• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.4
• /
• pp.99-105
• /
• 1994

k-bounded circuits are combinational circuits proposed by Fujiwara whose subcircuits are partitioned in a way that they form a tree and have some restricted k inputs respectively. Fujiwara proposed a O($16^{k}m$) fault detection algorithm for k-bounded circuits where m is the number of signal lines in the circuit. This algorithm is very ineffective to be applied to real circuits, even for small values of k. In this paper, it is shown that a single stuck-at fault in k-bounded circuits can be detected in O($2^{k}m$)time, and multiple stuck-at faults are detected in O($4^{k}m$) time by using thable lookup and imput partitionsing.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.11 no.3
• /
• pp.43-52
• /
• 2007

A hard disk, which can be classified as an external storage is usually capacious and economical. In spite of the attractive characteristics and efforts on the performance improvement, however, the operation of the hard disk is apparently slower than a processor and the advancement has also been slowly conducted since it is based on mechanical process. On the other hand, the advancement of the processor has been drastically performed as semiconductor technology does. So, disk I/O sub-system becomes bottleneck of computer systems' performance. For this reason, the research on disk I/O sub-system is in progress to improve computer systems' performance. In this paper, we proposed multi-level LRU scheme and then apply it to the computer systems with buffer cache and disk cache. By applying the proposed scheme to computer systems, the average access time to disk blocks can be decreased. The efficiency of the proposed algorithm was verified by simulation results.

• Journal of Internet Computing and Services
• /
• v.8 no.2
• /
• pp.33-41
• /
• 2007

With the development of the multicast technology, the realtime strategy among the group applications using the multicast routing is getting more important. An essential factor of these real-time application is to optimize the Delay- and delay Variation-Bounded Multicast Tree(DVBMT) problem. This problem is to satisfy the minimum delay variation and the end-to-end delay within an upper bound. The DVBMT problem is known as NP-complete problem. The representative algorithms for the problem are DVMA, DDVCA, and so on. In this paper, we show that the proposed algorithm outperforms any other algorithm. The efficiency of our algorithm is verified through the prerformance evaluation and the enhancement is up to about 9% to 29% in terms of the multicast delay variation. The time complexity of our algorithm is $O(mn^2)$M.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.10C
• /
• pp.984-994
• /
• 2003

This paper proposes a novel blind adaptive algorithm for computing the weight vector of an antenna array system. The new technique utilizes a Generalized On-Off algorithm to obtain the weight vector maximizing the SINR(Signal to Interference plus Noise Ratio) of the received signal. It is observed that the proposed algorithm generates a suboptimal weight vector with a linear computational load(O(6N+8)). From the various simulations, it is confirmed that, when the signal environment becomes adverse, e.g., low Processing Gain, and/or wide angular spread. the proposed algorithm outperforms the conventional one in terms of the communication capacity by about 3 times. Applying the proposed algorithm to satellite tracking systems as well as IS2000 1X mobile communication system, we have found that both communication capacity and communication quality are significantly improved.

• Journal of Advanced Navigation Technology
• /
• v.24 no.4
• /
• pp.291-298
• /
• 2020

This study proposed a model that can track MPP faster than the existing MPPT algorithm using the particle swarm optimization algorithm (PSO). The proposed model highly sets the acceleration constants of gbest and pbest in the PSO algorithm to quickly track the MPP point and eliminates the power instability problem. In addition, this algorithm was re-executed by detecting the change in power of the solar panel according to the rapid change in solar radiation. As a result of the experiment, MPP time was 0.03 seconds and power was 131.65 for 691.5 W/m2, and MPP was tracked at higher power and speed than the existing P&O and INC algorithms. The proposed model can be applied when a change in the amount of power is detected by partial shading in a Photovoltaic power plant with Photovoltaic connected in parallel. In order to improve the MPPT algorithm, this study needs a comparative study on optimization algorithms such as moth flame optimization (MFO) and whale optimization algorithm (WOA).

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.3
• /
• pp.17-26
• /
• 1998

Shortest path problem in road network with turn penalties and prohibitions frequently arises from various transportation optimization models. In this paper, we propose a new algorithm for the shortest Path problem with turn prohibitions and delays. The proposed algorithm maintains distance labels of arcs, which is similar to labels of nodes of Dijkstra's algorithm. Fibonacci heap implementation of the proposed algorithm solves the problem in O(mn ＋ mlogm). We provide a new insight in transforming network with turn penalties and prohibitions into another network in which turn penalties and prohibitions are implicitly considered. The proposed algorithm is implemented using new data structure and compared with Ziliaskopoulos' algorithm. Computational results show that the proposed algorithm is very efficient.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.9
• /
• pp.105-111
• /
• 2015

This paper suggests O(n) linear-time algorithm for car sequencing problem (CSP) that has been classified as NP-complete because of the polynomial-time algorithm to solve the solution has been unknown yet. This algorithm applies maximum options-equiped car type first production rule to decide the car sequencing of n meet the r:s constraint. This paper verifies thirteen experimental data with the six data are infeasible. For thirteen experimental data, the proposed algorithm can be get the solution for in all cases. And to conclude, This algorithm shows that the CSP is not NP-complete but the P-problem. Also, this algorithm proposes the solving method to the known infeasible cases. Therefore, the proposed algorithm will stand car industrial area in good stead when it comes to finding a car sequencing plan.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.49 no.3
• /
• pp.118-123
• /
• 2000

This paper presents an efficient algorithm for loss reduction and load balancing by sectionalizing switch operation in large scale distribution system of radial type. We use Genetic algorithm and Kruskal algorithm to solve distribution system reconfiguration. Genetic algorithm is used to minimize objective function including loss and load balancing items. Kruskal algorithm is used to satisfy the radial condition of distribution system. The experimental results show that the proposed method has the ability to search a good solution regardless of initial configuration and size of system.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.45 no.2
• /
• pp.265-272
• /
• 1996

In this paper, attitude computation algorithm for a strap down ARS(Attitude Reference System)of an underwater vehicle has been studied. Attitude errors o the ARS using low-level gyroscopes tend to increase with time due to gyroscope errors. To cope with this problem, a mixing algorithm of accelerometer aided attitude computation has been developed. The algorithm can successfully bound the error increase for cruising motion, but it gives instantaneously large errors when a vehicle maneuvers. To improve the performance in case of vehicle's maneuver, a new attitude computation mixing algorithm complying state of vehicle and to manage the adjustment of the gains which are invariant in the existing algorithm. In addition, a gain scheduling method is applied to fuzzy inference composition process for real-time computation. Monte Carlo simulation results show that the proposed algorithm provides better performance than the existing algorithm.

• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.689-692
• /
• 2003

In this paper, we propose an adaptive beamforming algorithm for array antenna. The proposed beamforming algorithm, based on Block LMS (Block - Least Mean Squares) algorithm, has a variable step size from coefficient update. This method shows some advantages that the convergence speed is fast and the calculation time can reduced using a block LMS algorithm from frequency domain. As the adaptive parameter approaches a stationary state, it could reduce the number of filter coefficient update with the help of various step size. In this paper we compared the efficiency of the proposed algorithm with a standard LMS algorithm which is a representative method of adaptive beamforming.