• Journal of the Korean Statistical Society
• /
• v.22 no.2
• /
• pp.249-258
• /
• 1993

It is well known that design matrix X for any factorial design can be represented by a product $X = TX_o$ where T is replication matrix and $X_o$ is the corresponding balanced design matrix. Since $X_o$ consists of regular arrangement of 0's and 1's, we can easily find the spectral decomposition of $X_o',X_o$. Also using this we propose an efficient algorithm for computing the orthogonal projection matrix for a balanced factorial design.

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.2
• /
• pp.162-171
• /
• 1999

Plane sweep plays an important role in computational geometry. This paper shows that an extension of topological plane sweep to three-dimensional space can calculate the volume swept by rotating a solid polyhedral object about a fixed axis. Analyzing the characteristics of rotational swept volumes, we present an incremental algorithm based on the three-dimensional topological sweep technique. Our solution shows the time bound of O(n²·2?+T?), where n is the number of vertices in the original object and T? is time for handling face cycles. Here, α(n) is the inverse of Ackermann's function.

• Journal of Korean Institute of Industrial Engineers
• /
• v.21 no.2
• /
• pp.289-298
• /
• 1995

We consider a general queueing network with multi-server stations. The stations are under heavy traffics or moderate variable conditions. We develope an algorithm to determine the optimal loading policy, which minimizes the congestion in a network. Under more specified condition, majorization and arrangement orderings are established to compare, respectively, various loading and assignment policies. Implications of results are also discussed.

• The Journal of the Korea Contents Association
• /
• v.9 no.10
• /
• pp.40-50
• /
• 2009

Incorrect deployment of RFID readers occurs reader-to-reader interferences in many applications using RFID technologies. Reader-to-reader interference occurs when a reader transmits a signal that interferes with the operation of another reader, thus preventing the second reader from communicating with tags in its interrogation zone. Interference detected by one reader and caused by another reader is referred to as a reader collision. In RFID systems, the reader collision problem is considered to be the bottleneck for the system throughput and reading efficiency. In this paper, we propose a novel RFID reader anti-collision algorithm based on evolutionary algorithm(EA). First, we analyze characteristics of RFID antennas and build database. Also, we propose EA encoding algorithm, fitness algorithm and genetic operators to deploy antennas efficiently. To show superiority of our proposed algorithm, we simulated our proposed algorithm. In the result, our proposed algorithm obtains 95.45% coverage rate and 10.29% interference rate after about 100 generations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.2
• /
• pp.583-599
• /
• 2015

We apply the Bayesian matching pursuit (BMP) algorithm to the estimation of time-frequency selective channels in orthogonal frequency division multiplexing (OFDM) systems. By exploiting prior statistics and sparse characteristics of propagation channels, the Bayesian method provides a more accurate and efficient detection of the channel status information (CSI) than do conventional sparse channel estimation methods that are based on compressive sensing (CS) technologies. Using a reasonable approximation of the system model and a skillfully designed pilot arrangement, the proposed estimation scheme is able to address the Doppler-induced inter-carrier interference (ICI) with a relatively low complexity. Moreover, to further reduce the computational cost of the channel estimation, we make some modifications to the BMP algorithm. The modified algorithm can make good use of the group-sparse structure of doubly selective channels and thus reconstruct the CSI more efficiently than does the original BMP algorithm, which treats the sparse signals in the conventional manner and ignores the specific structure of their sparsity patterns. Numerical results demonstrate that the proposed Bayesian estimation has a good performance over rapidly time-varying channels.

• Journal of Broadcast Engineering
• /
• v.16 no.6
• /
• pp.927-940
• /
• 2011

In this paper, we improve a time-domain channel estimation algorithm with multi-input multi-output (MIMO) systems for the next-generation digital television (DTV). The conventional algorithm use orthogonal codes for separating channels from the time-domain orthogonal frequency division multiplexing (OFDM) symbols. However. it has the disadvantage of reduced data-rate because of many pilots. The improved algorithm shows better performance than the conventional one even with reduced number of pilots. The improved algorithm is evaluated by computer simulations.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.15 no.8 s.101
• /
• pp.911-917
• /
• 2005

There were many attempts to reduce noise behind the noise barrier using active control techniques. Omoto(1993) Shao(1997) and Yang(2001) tried to actively control the diffracted noise behind the barrier and main concerns were about the arrangement methods for the control sources. Baek (2004) tried to get better results using the simulated annealing method and the sequential searching technique. The main goal of this study is to develop and compare the performance of several optimization techniques including those mentioned above, hybrid version of simulated annealing and genetic algorithm for the optimal control source positions of active noise barrier system. The simulation results show fairly similar performance lot the small size of searching problem. However, as the number of control sources are increased, the performance of simulated annealing algorithm and genetic algorithm are better than the others. Simulations are also made to show the performance of the selected optimal control source positions not only at the receiver position but at the surrounding volume of the receiver position and plotted the noise reduction level in 3-D.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.4
• /
• pp.401-410
• /
• 2001

An adaptive Odd/Even Multi-shell Median Filter(Adaptive O/E MMF) is proposed by using a adaptive threshold strategy and odd/even multishells. This algorithm was verified in MATLAB and implemented on FPGA. The performance of the algorithm is evaluated by adding impulse noise and line missing into well-known images. A proposed adaptive threshold strategy may reduce the computation time and redundant arrangement. odd and even multishells can recover line missing of vertical and diagonal directions respectively Therefore, the algorithm proposed in this work can be effectively used in real time image processing applications.

• Nuclear Engineering and Technology
• /
• v.55 no.4
• /
• pp.1225-1232
• /
• 2023

The ¹⁸⁰W is the lightest isotope of Tungsten with small abundance ratio. It is slightly radioactive (α decay), with an extremely long half-life. Its separation is possible by non-conventional single withdrawal cascades. The ¹⁸⁰W is used in radioisotopes production and study of metals through gamma-ray spectroscopy. In this paper, single withdrawal cascade model is developed to evaluate multicomponent separation in non-conventional transient cascades, and available experimental results are used for validation. Numerical studies for separation of ¹⁸⁰W in a transient single withdrawal cascade are performed. Parameters affecting the separation and equilibrium time of cascade such as number of stages, cascade arrangements, feed location and flow rate for a fixed number of gas centrifuges (GC) are investigated. The Salp Swarm Algorithm (SSA) as a bio-inspired optimization algorithm is applied as a novel method to minimize the feed consumption to obtain desired concentration in the collection tank. Examining different cascade arrangements, it is observed in arrangements with more stages, the separation is further efficient. Based on the obtained results, with increasing feed flow rate, for fixed product concentration, the cascade equilibrium time decreases. Also, it is shown while the feed location is the farthest stage from the collection tank, the separation and cascade equilibrium time are well-organized. Finally, using SSA optimal parameters of the cascade is calculated, and optimal arrangement to produce 5 gr of ¹⁸⁰W with 90% concentration in the tank, is proposed.

• Korean Journal of Optics and Photonics
• /
• v.33 no.1
• /
• pp.11-21
• /
• 2022

We have investigated the optimal design of an aperiodic optical phased array (OPA) for use in light detection and ranging applications. Three optimization algorithms - particle-swarm optimization (PSO), a genetic algorithm (GA), and a pattern-search algorithm (PSA) - were employed to obtain the optimal arrangement of optical antennas comprising an OPA. The optimization was performed to obtain the minimal side-lobe level (SLL) of an aperiodic OPA at each steering angle, using the three optimization algorithms. It was found that PSO and GA exhibited similar results for the SLL of the optimized OPA, while the SLL obtained by PSA showed somewhat different features from those obtained by PSO and GA. For an OPA optimized at a steering angle <45°, the SLL value averaged over all steering angles increased as the angle of optimization decreased. However, when the angle of optimization was larger than 45°, low average SLL values of <13 dB were obtained for all three optimization algorithms. This implies that an OPA with high signal quality can be obtained when the arrangement of the optical antennas is optimized at a large steering angle.