• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.10
• /
• pp.1491-1497
• /
• 2013

Radio frequency identification (RFID) is an important and essential components of ubiquitous computing, with the development of wireless communication technologies and mobile computing environment. Recently, RFID becomes the mainstream application that helps fast handling and uniquely identifying the physical objects. It utilizes the electromagnetic energy for data transmission from a tag to a reader in the presence of arbitrary interference and noise. In order to employ the portable mobile RFID reader, a tag-collision problem between two or more adjacent tags should be considered. In this paper, we present the operation of RFID system in which numerous tags are present in the interrogation zone of a single reader at the same time. Since there may exist a number of tagged objects in the narrow area, multiple RFID tags may interfere each other, caused to degrade the data reliability and efficiency of the RFID system. In order to suppress interference signals from multiple neighboring tags, we present an application of Gold code for RFID communication system, which uses spread spectrum technique. In this RFID system, data bits are spreaded in each tags with the unique Gold code and the spreaded data bits are despreaded in the reader with the same Gold code. The performance analysis of the considered RFID anti-collision system is illustrated via computer simulation examples.

• Journal of Biomedical Engineering Research
• /
• v.23 no.5
• /
• pp.341-349
• /
• 2002

The target controlled infusion(TCI) pump system is a logical approach to the development of improved administration techniques of an intravenous anaesthetic agent. The principle of TCI system is based on an understanding of the pharmacokinetic properties, three or four compartment model. The TCI system is optimal and flexible control of the plasma drug concentration. But the clinical goal is always to achieve a therapeutic drug effect, not a therapeutic concentration. So we developed the algorithm to target the concentration at the site of drug effect rather than the concentration in the plasma. If impulse drug is inputted into body, the decline of plasma concentration with time is shown, resulting in the expression of the differential equation. Therefore, we must reformulate our three-compartment model as four-compartment model with the effect compartment. And we tested plasma targeting and effect targeting algorithm by computer simulation using four-compartment model. So we developed the TCI capable of applying all intravenous drugs by adjusting individual pharmacokinetic parameters independently.

• Journal of Navigation and Port Research
• /
• v.29 no.5 s.101
• /
• pp.403-408
• /
• 2005

The techniques of estimating angle of arrival(AOA) have played a key role for enhancement of wireless communications using array antennas. Among those techniques, the superresolution algorithms, such as MUSIC and ESPRIT, calculate the covariance matrix of the array output vectors which are observed at the array antennas, and then by using eigen-decomposition of the covariance matrix, they estimate AOAs of the received signals with high accuracy. However, superresolution algorithms based eigenvalue decomposition fails to estimate AOAs under multipath environments. Under multipath environments, it is difficult to estimate AOAs of the received signals due to coherency and high-correlation. To resolve coherent signals, the covariance matrix is calculated by using the conventional spatial smoothing technique, and then the techniques based on eigen-descomposition is applied. The result of the conventional spatial smoothing technique, however, is obtained at the cost of losing effective spatial aperture. Moreover, the conventional technique ignores any information in the cross-correlations of the array outputs the subarrays. As the result, the performance for AOA estimation is degraded. In this paper, we propose a new spatial smoothing technique, which consider the cross-correlation for subarrays. By computer simulation, the AOA estimation performance of the proposed method is compared with the conventional method and evaluated.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.7
• /
• pp.349-358
• /
• 2005

False sharing is a result of co-location of unrelated data in the same unit of memory coherency, and is one source of unnecessary overhead being of no help to keep the memory coherency in multiprocessor systems. Moreover. the damage caused by false sharing becomes large in proportion to the granularity of memory coherency. To reduce false sharing in a page-based DSM system, it is necessary to allocate unrelated data objects that have different access patterns into the separate shared pages. In this paper we propose call-site tracing-based shared memory allocator. shortly CSTallocator. CSTallocator expects that the data objects requested from the different call-sites may have different access patterns in the future. So CSTailocator places each data object requested from the different call-sites into the separate shared pages, and consequently data objects that have the same call-site are likely to get together into the same shared pages. We use execution-driven simulation of real parallel applications to evaluate the effectiveness of our CSTallocator. Our observations show that by using CSTallocator a considerable amount of false sharing misses can be additionally reduced in comparison with the existing techniques.

• Journal of KIISE:Information Networking
• /
• v.29 no.1
• /
• pp.65-76
• /
• 2002

QoS routing is a routing technique for finding feasible path that satisfies QoS requirements required by application programs. Since QoS routing determines such paths in terms of dynamic network state, it satisfies the requirement of applications and increases the utilization of the network. The overhead is, however, generated by routers to exchange the information of the dynamic state of network. In order to reduce this protocol overhead, a timer based update mechanism is proposed in which router checks the change of the network status periodically and network state information is exchanged if the change is greater than a certain value. Using large update period makes, though, routing performance irresponsive to the parameters which determine the update of the network state of the router. In addition to this, large update period may result in inaccurate network state information at routers and cause resource reservation failure. The resource reservation failure generates additional overhead to cancel the resource reservation of the part of the path. In this paper, we propose mechanisms enhancing the existing network state update policy with respect to these two problems. Performance of the proposed schemes are evaluated through a course of simulation.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.10
• /
• pp.569-578
• /
• 2003

Data dependencies are one of major hurdles to limit ILP(Instruction Level Parallelism), so several related works have suggested that the limit imposed by data dependencies can be overcome to some extent with use of the data value prediction. Hybrid value predictor can obtain the high prediction accuracy using advantages of various predictors, but it has a defect that same instruction has overlapping entries in all predictor. In this paper, we propose a new hybrid value predictor which achieves high performance by using the information of static and dynamic classification. The proposed predictor can enhance the prediction accuracy and efficiently decrease the prediction table size of predictor, because it allocates each instruction into single best-suited predictor during the fetch stage by using the information of static classification. Also, it can enhance the prediction accuracy because it selects a best- suited prediction method for the “Unknown”pattern instructions by using the dynamic classification mechanism. Simulation results based on the SimpleScalar/PISA tool set and the SPECint95 benchmarks show the average correct prediction rate of 85.1% by using the static classification mechanism. Also, we achieve the average correction prediction rate of 87.6% by using static and dynamic classification mechanism.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.12
• /
• pp.1076-1084
• /
• 2012

In the CS/CB(Coordinated Scheduling/Beamforming) scheme, the cell edge user throughput is increased by selecting MIMO (Multiple Input Multiple Output) precoders which can minimize the interferences from adjacent base stations (BSs). However, in current LTE(Long Term Evolution) systems, the serving cell is selected in the initialization stage by using the synchronization signals and cell specific reference signals transmitted by adjacent BSs with a single antenna. The selected BS in the initialization stage may not be the best one since the MIMO precoding gain has not been considered in the cell selection stage. In this paper, a new cell selection technique is proposed for LTE systems with MIMO precoder by taking into account the effect of the precoder in the initialization stage. The proposed technique enables a user equipment (UE) in the cell boundary to select the serving BS by using the information (channel rank, effective channel capacity, and effective SINR(Signal to Interference plus Noise Ratio)) acquired from cell specific reference signals of candidate BSs. It is verified by computer simulation that the proposed technique can increase the channel capacity significantly in the multi-cell environments, compared with the conventional CS/CB scheme.

• KIPS Transactions on Computer and Communication Systems
• /
• v.9 no.3
• /
• pp.67-76
• /
• 2020

With the fast development in wireless communications and vehicular technologies, vehicular ad hoc networks (VANETs) have enabled to deliver data between vehicles. Recently, VANETs introduce a Vehicular Cloud (VC) model for collaborating to share and use resources of vehicles to create value-added services. To construct a VC, a vehicle should search vehicles that intend to provide their own resource. The single-hop search cannot search enough provider vehicles due to a small coverage and non-line-of-sights of communications. On the other hand, the multi-hop search causes very high traffics for large coverage searching and frequent connection breakages. Recently, many Roadside Units (RSUs) have been deployed on roads to collect the information of vehicles in their own coverages and to connect them to Internet. Thus, we propose a RSU-aided vehicular resource search and cloud construction mechanism in VANETS. In the proposed mechanism, a RSU collects the information of location and mobility of vehicles and selects provider vehicles enabled to provide resources needed for constructing a VC of a requester vehicle based on the collected information. In the proposed mechanism, the criteria for determining provider vehicles to provide resources are the connection duration between each candidate vehicle and the requester vehicle, the resource size of each candidate vehicle, and its connection starting time to the requester vehicle. Simulation results verify that the proposed mechanism achieves better performance than the existing mechanism.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.3
• /
• pp.133-147
• /
• 2005

Various types of ray-tracing methods are used to predict the quantity measures of radiation illumination, the uniformity of illumination, radiation performance of LCD BLU(Hack-Light Unit). The uniformity of radiation illumination is one of the most important design factor of BLU and is usually controlled by the diffusive-ink pattern printed on the bottom of light-guide panel of BLU. Therefore it is desirable to produce an improved (ideally, the optimal) ink pattern to achieve the best uniformity of radiation illumination. In this paper, we applied the Welder-Mead simplex-search method among various direct search method to compute the optimal ink pattern. Direct search methods are widely used to optimize the functions which are often highly nonlinear, unpredictably discontinuous, and nondifferentiable, The ink-pattern controlling the uniformity of radiation illumination is one type of these functions. In this paper, we found that simplex search methods are well suited to computing the optimal diffusive-ink pattern. In extensive numerical testing, we have found the simplex search method to be reasonably efficient and reliable at computing the optimal diffusive-ink pattern. The result also suggests that optimization can improve the functionality of simulation tools which are used to design LCD BLU.

• The Journal of Engineering Geology
• /
• v.18 no.4
• /
• pp.381-391
• /
• 2008

The eigenvalue technique is introduced to overcome the problem of truncation errors caused by temporal discretization of numerical analysis. The eigenvalue technique is different from simulation in that only the space is discretized. The spatially discretized equation is diagonized and the linear dynamic system is then decoupled. The time integration can be done independently and continuously for any nodal point at any time. The results of eigenvalue technique are compared with the exact solution and FEM numerical solution. The eigenvalue technique is more efficient than the FEM to the computation time and the computer storage in the same conditions. This technique is applied to the solute transport analysis in nonuniform flow fields around underground storage caverns. This method can be very useful for time consuming simulations. So, a sensitivity analysis is carried out by using this method to analyze the safety of caverns from nearly located contaminant sources. According to the simulations, the reaching time from source to the nearest cavern may takes 50 years with longitudinal dispersivity of 50 m and transversal dispersivity of 5 m, respectively.