• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.04a
• /
• pp.724-728
• /
• 1995

A new dynamic channel assignment (DCA) algorithm with rearrangement for cellular mobile communication systems is suggested. Our DCA algorithm is both traffic and interference adaptive, which is based on the mathematical formulation of the maximum packing under a realistic propagation model. In developing the algorithm, we adopt the Lagrangean relaxation technique that has been successfully used in the area of mathematical programming. Computational experiments of the algorithm reveal quite encouraging results. Although our algorithm primarily focuses on microcellular systems, it can be effectively applied to conventional cellular systems under highly nonuniform traffic distributions and interference conditions.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.10
• /
• pp.177-185
• /
• 1996

This paper describes several algorithms for technolgoy mapping of logic functions into interesting and popular FPGAs that use look-up table memories. In order to improved the technology mapping for FPGA, some existing multi-level logic synthesis, decomposition reduction and packing techniques are analyzed and compared. And then new algorithms such as merging fanin, unified reduction and multiple disjoint decomposition which are used for combinational logic design, are proposed. The cost function is used to minimize the number of CLBs and edges of the network. The cost is a linear combination of each weight that is given by user. Finally we compare our new algorithm with previous logic design technique. In an experimental comparison our algorithm requires 10% fewer CLB and nets than SIS-pga.

• Journal of the Korean Ceramic Society
• /
• v.31 no.2
• /
• pp.161-170
• /
• 1994

For the preparation of short ceramic fibers of which average length might be in accordance with the opening size of sieve, e.g., 150${\mu}{\textrm}{m}$ or 300${\mu}{\textrm}{m}$, bulk fibers were grounded on sieve screen by applying both compressing and shearing force, and passed through the sieve screen. The grounded fibers were subjected to gravitational settling processes. The classified fibers were observed by scanning electron microscopy and the length of each fiber was measured to correlate the average length with the opening size of the sieve used for grinding bulk fibers. Theoretical analysis show that a free settling technique is ineffective for the classification of fibers by length compared with that of particles. The average lengths of classified fibers estimated by scanning electron microscopy were in good agreement with those obtained by relative packing volume of the fibers. Accordingly, it is confirmed that average fiber lengths can be determined from bulk volume data without photographing, counting and averaging results for hundreds of fibers.

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

We consider the bandwidth parking problem arising from telecommunication networks The problem is to determine the set of calls to be routed and an assignment or them to the paths in arc capacitated network. The objective is to maximize profit. We formulate the problem as an integer programming and propose an algorithm to solve it. Column generation technique to solve the linear programming relxation is proposed with two types of columns in addition, to obtain an optimum integer solution, we consider a new branching strategy. Computational experiments show that the algorithm gives option at solutions within reasonably small time limits.

• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.1
• /
• pp.55-76
• /
• 1997

This paper presents a heuristic solution for the three dimensional container loading problem with boxes which are different in size. The container loading problem is formulated as a zero-one mixed integer programming model whose objective is to maximize the container utilization. Due to its problem complexity, we propose a heuristic based on layered loading technique. Also, presented is a way to achieve the weighting balance of the stacked boxes. A micro-computer based program is developed which generates container loading pattern provided by the proposed heuristic. The results are displayed by computer-graphic. To evaluate the performance of the proposed heuristic, computational experiments are performed. The results indicate that in most of the cases the proposed heuristic performs better than an existing heuristic in terms of the container utilization.

• Journal of the Korean Society of Safety
• /
• v.15 no.1
• /
• pp.86-92
• /
• 2000

Recently, more advanced electronic elements become, they consume powerful and radiate more heat in devices. So the most suitable packaging technique is keenly needed. The most important purpose of packaging is to protect devices within a system for a long time and to prevent life of devices from external environments; floating ions such as humidity or sodium, and exposure from ultraviolet rays. In order to study the electrical properties of silicone gels often used as packing material due to the curing condition, volume resistivity and AC breakdown experiment are performed. Specimens are made up at several cured times and temperatures condition ; 0.5[H], 1[H] and 2[H] at 100[$^{\circ}C$], 125[$^{\circ}C$], 150[$^{\circ}C$], 160[$^{\circ}C$], 170[$^{\circ}C$] and 180[$^{\circ}C$]. It is confirmed that from volume resistivity experiment liquid silicone become get state at 90~100 [$^{\circ}C$] and cured specimen for 1~2[H] at 170[$^{\circ}C$] are superior in electrical properties.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.11
• /
• pp.11-16
• /
• 1993

VLIW architecture capable of testing multiple conditions in a cycle must support an efficient mechanism for multi-way branches. This paper proposes a mechanism to speed up the execution of multi-way branches and an efficient memory packing method of instructions, which reduced the wasted memory space. Also, we develops a new compiler technique which can transform program segments that are not applied to multi-way branches into ones that are applied to multi-way branches. The benefits gained by the transformation are to reduce branch penalty and to increase instruction-level parallelism.

• Journal of information and communication convergence engineering
• /
• v.11 no.4
• /
• pp.293-297
• /
• 2013

Delivery of high quality video over a wide area network with large number of users poses great challenges for the video communication system. To ensure video quality, multiple descriptions have recently attracted various attention as a way of encoding and visual information delivery over wireless network. We propose a new efficient multiple description coding (MDC) technique. Quincunx lattice sub-sampling is used for generating multiple descriptions of an image. In this paper, we propose the application of a directional discrete cosine transform (DCT) to a sub-sampled quincunx lattice to create an MDC representation. On the decoder side, the image is decoded from the received side information. If all the descriptions arrive successfully, the image is reconstructed by combining the descriptions. However, if only one side description is received, decoding is executed using an interpolation process. The experimental results show that such the directional DCT can achieve a better coding gain as well as energy packing efficiency than the conventional DCT with re-alignment.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.46-48
• /
• 2005

본 논문에서는 병렬 컴퓨팅의 스케줄링 시스템인 EASY Backfilling 알고리즘에 기반한 작업 패킹 기법의 최적화에 대해 논의한다. 이를 위해 최적의 작업 집합을 구성하기 위한 탐색 기법으로 유전자 알고리즘을 활용하여 작업 패킹을 효율적으로 수행함과 동시에, 적은 노드를 요청한 작업에 가중치를 부여함으로써 다수 작업의 동시 실행을 우선 고려하게 하였다. 스케줄링 정책은 컴퓨터 성능에 직접적인 영향을 미치는 요소이기 때문에 시스템 부하별로 각 워크로드의 평균 대기 시간을 측정한 실험을 통해 제안 기법이 전반적인 병렬 컴퓨팅의 성능을 개선함을 확인하였다.

• Journal of Advanced Marine Engineering and Technology
• /
• v.29 no.2
• /
• pp.177-184
• /
• 2005

Experimental studies on the characteristics of ice slurry flows in a circular pipe is rare due to the deficiency of conventional measurement techniques. In this report the flow characteristics are quantitatively investigated by the use of PIV technique concerning the Ice Packing Factor(IPF) and the power changes of pump motor It was experimentally verified that the power loss does not increase any more at a certain IPF value.