• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.417-420
• /
• 2006

This paper suggests that resource allocation algorithm in multiuser orthogonal frequncy divisioin multiplexing (OFDM). The proposed algorithm considers throughput maximization with power constraint and quality of service (QoS) constraint. This problem has a optimal solution with using well known water-filling algorithm but the algorithm requires high computational complexity. Therefore the problem needs a sub-optimal algorithm for decreasing computational complexity. We propose a sub-optimal joint subcarrier and power allocation algorithm for multiuser OFDM system and compare with previous resource allocation algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.121.1-121
• /
• 2001

Congestion control is a critical issue in TCP networks, Recently, active queue management (AQM) was proposed for congestion control at routers. The random early detection RED algorithm is widely known in the AQM algorithms, We present an adaptive nonlinear RED (NRED) algorithm, which has nonlinear drop probability profile. The proposed algorithm enhanced the performance of the RED algorithm by the self-parameterization based on the traffic load Furthermore, the proposed algorithm can effectively adapt itself between he RED and the drop-tail queue management by adopting proper nonlinearity in the drop probability profile. Through simulation, we show the effectiveness of the proposed algorithm comparing with the drop-tail and the original RED algorithm.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.1071-1076
• /
• 2003

Evolutionary algorithm is recognized as a promising approach to solving multi-objective combinatorial optimization problems. When no preference information of decision makers is given, multi-objective optimization problems have been commonly used to search for diverse and good Pareto optimal solution. In this paper we propose a new multi-objective evolutionary algorithm based on competitive coevolutionary algorithm, and demonstrate the applicability of the algorithm. The proposed algorithm is designed to promote both population diversity and rapidity of convergence. To achieve this, the strategies of fitness evaluation and the operation of the Pareto set are developed. The algorithm is applied to job shop scheduling problems (JSPs). The JSPs have two objectives: minimizing makespan and minimizing earliness or tardiness. The proposed algorithm is compared with existing evolutionary algorithms in terms of solution quality and diversity. The experimental results reveal the effectiveness of our approach.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.8 no.2
• /
• pp.49-58
• /
• 2012

This paper is on an improved orthogonal projection method which can cancel the acoustic feedback signals in the digital hearing aids. Comparing with the NLMS algorithm which is widely used for simplicity and stability, it shows that this method has the improvement of the convergence performances, and has small computational quantities, for signals with the large auto-correlation as speech signals. This uses the improved orthogonal projection algorithm which reduces the correlation of signals. To verify the convergence characteristics of the proposed algorithm, we simulated about various input signals. The acoustic feedback canceller has a 12-bit resolution with 64-tap adaptive FIR filter. And we compared the results of simulation for this algorithm with the ones for the NLMS algorithm. By these works, it is proved that the feedback canceller adopting the proposed algorithm shows about 3.5dB more high SNR than the NLMS algorithm in the colored input signals.

• 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 Korea Society of Digital Industry and Information Management
• /
• v.9 no.1
• /
• pp.95-102
• /
• 2013

This paper covers nulling algorithm. In this algorithm, we assume that nulling points are already known. In general, nulling algorithm using matrix equation was utilized. But, this algorithm is pointed out that computational complexity is disadvantage. So, we choose gradient method to reduce the computational complexity. In order to further reduce the computational complexity, we propose approximate gradient method using characteristic of trigonometric functions. The proposed method has same performance compared with conventional method while having half the amount of computation when the number of antenna and nulling point are 20 and 1, respectively. In addition, we could virtually eliminate the trigonometric functions arithmetic. Trigonometric functions arithmetic cause a big problem in actual implementation like FPGA processor(Field Programmable gate array). By utilizing the above algorithm in a multi-cell environment, beamforming gain can be obtained and interference can be reduced at same time. By the above results, the algorithm can show excellent performance in the cell boundary.

• Journal of Korean Society for Quality Management
• /
• v.30 no.4
• /
• pp.68-77
• /
• 2002

EM algorithm has good convergence rate for numerical procedures which converges on very small step. In the case of proportion estimation in a mixed distribution which has very big incomplete data or of update of new data continuously, however, EM algorithm highly depends on a initial value with slow convergence ratio. There have been many studies to improve the convergence rate of EM algorithm in estimating the proportion parameter of a mixed data. Among them, dynamic EM algorithm by Hurray Jorgensen and Titterington algorithm by D. M. Titterington are proven to have better convergence rate than the standard EM algorithm, when a new data is continuously updated. In this paper we suggest dynamic EM algorithm and Titterington algorithm for the estimation of a mixed Poisson distribution and compare them in terms of convergence rate by using a simulation method.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.17 no.2
• /
• pp.13-20
• /
• 2021

Placement is a very important step in the VLSI physical design process. It is the problem of placing circuit modules to optimize the circuit performance and reliability of the circuit. It is used at the layout level to find strongly connected components that can be placed together in order to minimize the layout area and propagation delay. The most popular algorithms for circuit placement include the cluster growth, simulated annealing, integer linear programming and genetic algorithm. In this paper we propose a adapted genetic algorithm searching solution space for the placement problem, and then compare it with simulated annealing and genetic algorithm by analyzing the results of each implementation. As a result, it was found that the adaptive genetic algorithm approaches the optimal solution more effectively than the simulated annealing and genetic algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.15 no.6
• /
• pp.516-525
• /
• 1990

This paper proposes a hierarchical control algorithm for an efficient network management of a loosely-coupled system which consists of functional division and duplicating structure with a LAN to enhance reliability and availability. The algorithm is modeled using the Perti-net and verified with the reachability tree. Here, the proposed algorithm is compared with the purely centralized control algorithm and distributed control algorithm in terms of message traffic for the network management. The result shows that the message traffic related to system performance is as low as centralized control algorithm and the system availability is independent of a specific processor failure.

• The Journal of the Korea Contents Association
• /
• v.5 no.5
• /
• pp.248-254
• /
• 2005

The existing buffer management scheme is caused by with burstness characteristic of the TCP traffic and with only the transmission which is not loss it provides the smallest transmission rate guarantee where the GFR demands and a fair characteristic. In order to provide a high fair characteristic from the dissertation which it sees with the smallest transmission rate guarantee where the GFR demands it proposed the existing buffer algorithm which applies a Fuzzy mechanism in the existing buffer management technique. The proposed algorithm decides a packet disuse used by three parameters which are composed of tagging information, the buffer usage, and the load of VC. Simulation results shows that the fairness and goodput of the proposed algorithm were excellent where the size of MCR will become larger, from the switch the Double-EPD or the DFBA was visible a similar efficiency even from size change of the buffer. The algorithm which is proposed provides a good throughput and a fair characteristic.