• Smart Media Journal
• /
• v.9 no.3
• /
• pp.116-121
• /
• 2020

Digital Information Display and KIOSK have a problem that initial introduction cost and maintenance cost due to the development cost of dedicated contents and installation cost are high due to the characteristics of the product. In order to solve these problems, We designed and implemented of voice transmission system using Open Source Hardware and Event based Non-Blocking I/O Algorithm.

• Proceedings of the KIEE Conference
• /
• 1998.07g
• /
• pp.2327-2329
• /
• 1998

In this paper, an algorithm to make a configuration system for managing the I/O device of programmable logic controller(PLC) is proposed. Parallel processing architecture is used to deal with a number of I/O devices. From that architecture, a contention problem between processors can arise. To resolve this problem, the configuration system that contains informations about I/O devices is introduced. This configuration system is used to check the contention between processors in the I/O device and also used in program execution.

• 대한불안의학회:학술대회논문집
• /
• 2004.03a
• /
• pp.56-63
• /
• 2004

o 최근 강박장애의 치료가 발전한 것만은 사실이나 아직도 1차 치료에 반응이 없는 환자가 많다. o 치료반응의 평가는 매우 중요하며 현재 Y-BOCS를 이용하여 주로 치료반응을 평가하고 있으나 Y-BOSC 자체도 많은 문제점을 안고 있다. o 약물치료시 특히 치료반응의 여부를 결정짓는 의사결정은 매우 중요하다. o 국내에서도 강박장애 치료알고리듬이 개발되어 강박장애의 치료 및 평가에 있어 기초가 되어야 할 것으로 기대된다.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.11
• /
• pp.2845-2854
• /
• 1998

Median filter can be implemented in the binary domain based on threshold decomposition, stacking property, and linear separability. In this paper, we develop one-dimensional and two-dimensional parallel algorithms for the median filter on a reconfigurable mesh with buses(RMESH) which is suitable for VLSI implementation. And we evaluate their performance by comparing the time complexities of RMESH algorithms with those of algorithms on mesh-connected computer. When the length of M-valued 1-D signal is N and w is the window width, the RMESH algorithm is done in O(Mw) time and mesh algorithm is done in $O(Mw^2)$ time. Beside, when the size of M-valued 2-D image is $N{\times}N$ and the window size is $w{\times}w$, our algorithm on $N{\times}N$ RMESH can be computed in O(Mw) time which is a significant improvement over the $O(Mw^2)$ complexity on $N{\times}N$ mesh.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.10
• /
• pp.169-173
• /
• 2014

Nobody has yet been able to determine the optimal solution conclusively whether NP-complete problems are in fact solvable in polynomial time. Gu$\acute{e}$ret et al. tries to obtain the optimal solution using linear programming with $O(m^4)$ time complexity for barge loading problem a kind of bin packing problem that is classified as nondeterministic polynomial time (NP)-complete problem. On the other hand, this paper suggests the loading rule of profit priority rank algorithm with O(m log m) time complexity. This paper decides the profit priority rank firstly. Then, we obtain the initial loading result using the rule of loading the good has profit priority order. Finally, we balance the loading and capability of barge swap the goods of unloading in previously loading in case of under loading. As a result of experiments, this algorithm reduces the $O(m^4)$ of linear programming to O(m log m) time complexity for NP-complete barge loading problem.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.7
• /
• pp.2204-2218
• /
• 2000

This paper proposes a dynamic storage allocation algorithm, QHF(quick-half-fit) for real-time systems. The proposed algorithm manages a free block list per each worked size for memory requests of small size, and a free block list per each power of 2 size for memory requests of large size. This algorithms uses the exact-fit policy for small sie requests and provides high memory utilization. The proposed algorithm also has the time complexity O(I) and enables us to easily estimate the worst case execution time (WCET). In order to confirm efficiency of the proposed algorithm, we compare he memory utilization of proposed algorithm with that of half-fit and binary buddy system that have also time complexity O(I). The simulation result shows that the proposed algorithm guarantees the constant WCET regardless of the system memory size and provides lower fragmentation ratio and allocation failure ratio thant other two algorithms.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.42 no.3
• /
• pp.52-60
• /
• 2019

This paper presents a numerically robust algorithm to construct a Voronoi diagram of circles in the plane. The circles are allowed to have intersections among them, but one circle cannot fully contain another circle. The Voronoi diagram is a tessellation of the plane into Voronoi regions of given circles. Each circle has its Voronoi region which is defined by a set of points in the plane closer to the circle than any other circles. The distance from a point p to a circle $c_i$ of center $p_i$ and radius $r_i$ is ${\parallel}p-p_i{\parallel}-r_i$, which is the closest Euclidean distance from p to the circle boundary. The proposed algorithm first constructs the point Voronoi diagram of centers of given circles, then it enlarges each point to the circle and expands its Voronoi region accordingly. This region-expansion process is done by local modifications and after completing this process for the whole circles the desired circle Voronoi diagram can be obtained. The proposed algorithm is numerically robust and we provide with a few examples to show its robustness. The algorithm runs in $O(n^2)$ time in the worst case and O(n) time on average where n is the number of the circles. The experiment shows that the region-expansion algorithm is robust and runs fast with strong linear time behavior.

• Journal of applied mathematics & informatics
• /
• v.5 no.3
• /
• pp.771-784
• /
• 1998

In this paper we propose an algorithm for generating minimal cutsets of undirected graphs. The algorithm is based on a blocking mechanism for generating every minimal cutest ex-actly once. The algorithm has an advantage of not requiring any preliminary steps to find minimal cutsets. The algorithm generates minimal cutsets at O(e.n) {where e,n = number of (edges, vertices) in the graph} computational effort per cutset. Formal proofs of the algorithm are presented.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.7
• /
• pp.2229-2237
• /
• 2000

This paper intends to improve the problems of the slack stealing algorithm scheduling for periodic tasks with fixed priority and aperiodic tasks which occur dynamically. The Slack stealing algorithm reduces unnecessary waiting time by making the service possible immediately when the slack stealing server gives suitable priority to aperiodic tasks according to the status of aperiodic tasks arrivals at runtime. But no performs the slack stealing, we must calculate execution time of periodic tasks till the point of random. And, execution time of periodic tasks is being repeatedly every hours while the slack algorithm is applied. We show time complexity hen is used as to O(n) if the nubmer of tasks which is applied to the calculation is n. In this appear, due to stored in tables slack times and the execution times of the scheduled periodic tasks, the complexity of aperiodic tasks which is occurring dynamically reduced to O(log n) and improves the responses times. We prove the algorithm proposed in this paper through the simulation.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.9 s.339
• /
• pp.1-10
• /
• 2005

In this paper, we proposed predistortion algerian that can compensate temperature distortion by digital. Predistortion algorithm produces compensation value of distortion by temperature as well as system nonlinear distortion by input level, and warps beforehand signal of baseband. To prove excellency of such algorithm we applied predistortion algorithm to Saleh's high power amplifier model, and did computer simulation. As a result, P1dB increased about 0.5 dBm phase shift reduced about $0.8^{o}$ than existent the A&P PD, and predistiortion algorithm to apply temperature compensation techniques improved P1dB about 2dBm and stabilized phase shift by about $0.1^{o}$ low. When approved UMTS's sample signal to this amplifier, IMD3 of amplifier decreased 10dBm than is no temperature compensation techniques, and reduced 19dBm than signal that is no distortion.