• The Journal of the Korea Contents Association
• /
• v.19 no.9
• /
• pp.476-484
• /
• 2019

RFID yoking proof proves that a pair of tags is scanned at the same time. Since the tags scanned simultaneously by a single reader are adjacent to each other, the yoking proof is used in applications that need to check the physical proximity of tagged objects. Most of the yoking proof schemes require pre-knowledge on adjacent tags. If an error occurs in the process of collecting information about adjacent tags, all subsequent proofs will fail verification. However, there is no research that suggests specific methods for obtaining information about adjacent tags. In this study, I propose a tag proximity information acquisition scheme for a yoking proof. The proposed method consists of two steps: scanning area determination and scanning area verification. In the first step, the size and position of the area to scan tags is determined in consideration of position and transmission range of the tags. In the next step, whether tag scanning is performed within the scanning area or not is verified through reference tags of the fixed position. In analysis, I show that the determined scanning area assures acquisition of adjacent tag information and the scanning area verification detects deformation and deviation of the scanning area.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.12
• /
• pp.660-673
• /
• 2001

In Video-on-Demand (VoD) servers, disk throughput is an important system design parameter because it is directly related to the number of user requests that can be served simultaneously. In this paper, we propose an efficient periodic request grouping scheme for disk array-based VoD servers that reduces the disk seek time, thus improving the disk throughput of VoD disk arrays. To reduce the disk seek time, the proposed scheme groups the periodic requests that access data blocks stored in adjacent regions into one, and arranges these groups in a pre-determined order (e.g., in left-symmetric or right-symmetric fashion). Our simulation result shows that the proposed scheme reduces the average disk bandwidth required by a single video stream and can serve more user requests than existing schemes. For a data block size of 192KB, the number of simultaneously served user requests is increased by 8% while the average waiting time for a user request is decreased by 20%. We also propose an adaptation technique that conforms the proposed scheme to the user preference changes for video streams.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11C
• /
• pp.1098-1105
• /
• 2009

In this paper, we propose an asynchronous UWB (Ultra Wide Band) Positioning scheme that can provide precise positioning performance with low complexity and low power consumption. We also present the residual test to improve the positioning performance in multipath channels having heavy NLoS (Non-Line of Sight) components. As compared to conventional ToA (Time of Arrival) positioning scheme that requires round-trip transmissions as many as the number of beacons, the proposed UWB positioning scheme effectively decrease power consumption and processing delay since a single round-trip transmission is only required. Also, as compared to conventional TDoA (Time Difference of Arrival) positioning scheme requiring precise synchronization among the beacons, asynchronous nature of the proposed scheme achieves very low system complexity. Through simulations in LoS (Line of Sight) channel models, we observe that the proposed scheme requires low system complexity, low power consumption, while providing positioning performance of almost the same accuracy as the conventional ToA and TDoA positioning schemes. In addition, the proposed scheme by employing the residual test achieves accurate positioning performance even in multipath channels having heavy NLoS components.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.8 no.8
• /
• pp.825-834
• /
• 2018

Broadcasting is a basic data communication method for interconnection networks. There are two types of broadcasting. One-to-all broadcasting is to transmit a message from one node to all other nodes and all-to-all broadcasting is to transmit a message from all the nodes that have messages to other nodes. And by the using way of the transmission port per unit time, there are two schemes of broadcasting. Single port telecommunication(SLA) is to transmit messages from one node that contains the messages to one adjacent node only and all port telecommunication(MLA) is to transmit messages from one node to all adjacent nodes within a time of unit. Matrix hypercube is that an interconnection network has improved network cost than that of hypercube with the same number of nodes. In this paper, we analyze broadcasting scheme of matirx hypercube. First, we propose one-to-all and all-to-all broadcasting algorithms of matrix hypercube. And we prove that one-to-all broadcasting times are 2n+1 and $2{\lceil}{\frac{n}{2}}{\rceil}+1$ based on the SLA and MLA models, respectively. Also, we show all-to-all broadcasting time using SLA model is $5{\times}2^{\frac{n}{2}}-2$ when n=even, and is $5{\times}2^{\frac{n-1}{2}}+2$ when n=odd.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.6C
• /
• pp.505-511
• /
• 2008

The global navigation satellite system (GNSS) is using a direct sequence/spread spectrum (DS/SS) modulation. In order to recover the information data, the DS/SS system first performs a two-step synchronization process: acquisition and tracking. The acquisition process adjusts the phase difference between the received and locally generated acquisition sequences within ${\pm}T_c/2$ or less, where $T_c$ is the chip period. The tracking process performs fine synchronization. In this paper, we focus on the tracking issue. The single delta delay locked loop($\Delta$-DLL) is the optimal tracking scheme for a GNSS in the absence of multipath signals, where $\Delta$ means the spacing between the early and late correlation time offset. In the multipath environments, however, the $\Delta$-DLL suffers from huge estimation bias(denoted by $\beta$) caused by distorted correlation values. Although some modified schemes such as a $\Delta$-DLL with a narrow $\Delta$ and a double delta DLL (${\Delta}^{(2)}$-DLL) were proposed to reduce the estimation bias, they cannot remove the estimation bias completely and need more accurate acquisition process. This paper proposes a novel tracking scheme that can dramatically reduce the estimation bias, using the maximum slope change among the correlation outputs.

• Journal of Korean Society of Coastal and Ocean Engineers
• /
• v.32 no.1
• /
• pp.1-10
• /
• 2020

The application of multiphase flows is increasingly being applied to analyze phenomena such as single phase flows where the fluid boundary changes continuously over time or the problem of mixing a liquid phase and a gas phase. In particular, multiphase flow models that take into account incompressible Newtonian fluids for liquid and gas are often applied to solve the problems of the free water surface such as wave fields. In general, multi-phase flow models require time-based the surface tracking of each fluid's phase boundary, which determines the accuracy of the final calculation of the model. This study evaluates the advection performance of representative VOF-type boundary tracking techniques applied to various CFD numerical codes. The effectiveness of the FCT method to control the numerical flux to minimize the numerical diffusion in the conventional VOF-type boundary tracking method and advection calculation was mainly evaluated. In addition, the possibility of tracking performance of free surface using CIP method (Yabe and Aoki, 1991) was also investigated. Numerical results show that the FCT-VOF method introducing an anti-diffusive flux to precent excessive diffusion is superior to other methods under the confined conditions in this study. The results from this study are expected to be used as an important basic data in selecting free surface tracking techniques applied to various numerical codes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.5
• /
• pp.258-270
• /
• 2014

In this paper, we investigate channel capacity of two kinds of uplink OFDMA (Orthogonal Frequency Division Multiple Access) schemes, i.e. ZCZ (Zero Correlation Zone) code time-spread OFDMA and sparse SC-FDMA (Single Carrier Frequency Division Mmultiple Access) robust to access timing offset (TO) among multiple users. In order to reflect the practical condition, we consider not only access TO among multiple users but also peak to average power ratio (PAPR) which is one of hot issues of uplink OFDMA. In the case with access TO among multiple users, the amplified signal of users by power control might affect a severe interference to signals of other users. Meanwhile, amplified signal by considering distance between user and base station might be distorted due to the limit of amplifier and thus the performance might degrade. In order to achieve the maximum channel capacity, we investigate the combinations of transmit power so called ASF (adaptive scaling factor) by numerical simulations. We check that the channel capacity of the case with ASF increases compared to the case with considering only distance i.e. ASF=1. From the simulation results, In the case of high signal to noise ratio (SNR), ZCZ code time-spread OFDMA achieves higher channel capacity compared to sparse block SC-FDMA. On the other hand, in the case of low SNR, the sparse block SC-FDMA achieves better performance compared to ZCZ time-spread OFDMA.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.37 no.2
• /
• pp.1-10
• /
• 2000

Traditional syntax-oriented serializability notions ate considered to be not enough to handle in particular various types of transaction in terms of duration of execution. To deal with this situation, altruistic locking has attempted to reduce delay effect associated with lock release moment by use of the idea of donation. An improved form of altruism has also been deployed in extended altruistic locking in a way that scope of data to be early released is enlarged to include even data initially not intended to be donated. In this paper, we first of all investigated limitations inherent in both altruistic schemes from the perspective of alleviating starvation occasions for transactions in particular of short-lived nature. The idea of two-way donation locking(2DL) has then been experimented to see the effect of more than single donation in client-server database systems. Simulation experiments shows that 2DL outperforms the conventional two-phase locking in terms of the degree of concurrency and average transaction waiting time under the circumstances that the size of long-transaction is in between 5 and 9.

• Korean Journal of Optics and Photonics
• /
• v.20 no.1
• /
• pp.1-5
• /
• 2009

Recently, much research has been done for to realizeing nano-scale photonic circuits based on photonic crystal, plasmonics and silicon photonics in order to overcome fundamental limits of electronic circuits. These limits include such as bottleneck of speed, and size that cannot be reduced. Even though several kinds of coupling schemes have been reported, coupling structures are still large when it is compared with the nano-scale optical circuit. In this paper, we proposed using a very thin Fresnel lens while shortening the focal length of the Fresnel lens as much as possible. We proposed, for the first time, to utilize metal slits that are able to use the optical coupling system between a nano-scale optical circuit and the standard single mode optical fiber for overcoming the limitation of focal length shortening of the Fresnel lens. Comparative study has been carried out with a FDTD simulation between normal and metal slit assisted Fresnel lens. From the result of simulation, we can achieve 65% coupling efficiency for the metal-slit Fresnel lens when the focal length of metal-slit Fresnel lens is just $4{\mu}m$. On the other hand, the coupling efficiency of the normal Fresnel lens is about 43%.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.2
• /
• pp.177-187
• /
• 2000

In the past several years, many systems which adopted ring topology with high-speed unidirectional point-to-point links have emerged to overcome the limit of bus for interconnection network of clustered multiprocessor system. However, rapid increase of processor speed and performance improvement of local bus and memory system limit scalability of system with point-to-point link of standard bandwidth. Therefore, necessity to extend bandwidth is emphasized. In this paper, we adopt PANDA system as base model, which is clustering-based multiprocessor system. By simulating a model adopting commercial processor and local bus specification, we show that point-to-point link is bottleneck of system performance, and bandwidth expansion by more than 200% is needed. To expand bandwidth of interconnection network, it needs excessive design cost and time to develop new point-to-point link with doubled bandwidth. As an alternative to double bandwidth, we propose several ways to implement dual ring -simple dual ring, transaction-separated dual ring, direction-separated dual ring- by using off-the-shelf point-to-point links with IEEE standard bandwidth. We analyze pros. and cons. of each model compared with doubled-bandwidth single ring by simulation.