• Journal of IKEEE
• /
• v.20 no.4
• /
• pp.432-434
• /
• 2016

In conventional SIDO(Single Inductor Dual Output) boost converter, charging time is changed by load power consumption. In this case, if the power consumption of one load is changed to such a degree that switching frequency of the boost converter must be changed, another load charge time is also changed, which this causes cross regulation. In this paper, the charge copy technique is proposed to reduce cross regulation. When the switching frequency is changed to an integer ratio, another load charge time is also changed to integer ratio. Simulation result shows that proposed method reduces the 10.24mV cross regulation and 39.118us recover-time compared with conventional method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.12
• /
• pp.1328-1336
• /
• 2012

Compared to terrestrial RF communications, underwater acoustic communications have several limitations such as limited bandwidth, high level of fading effects, and a large underwater propagation delay. In this paper, in order to tackle those limitations of underwater communications and to make it possible to form a large underwater monitoring systems, we propose a hierarchical underwater network architecture, which consists of underwater sensors, clusterheads, underwater/surface sink nodes, autonomous underwater vehicles (AUVs). In the proposed architecture, for the maximization of packet delivery ratio and the minimization of underwater sensor's energy consumption, a hybrid routing protocol is used. More specifically, cluster members use Tree based routing to transmit sensing data to clusterheads. AUVs on optimal trajectory movements collect the aggregated data from clusterhead and finally forward the data to the sink node. Also, in order to minimize the maximum travel distance of AUVs, an Integer Linear Programming based algorithm is employed. Performance analysis through simulations shows that the proposed architecture can achieve a higher data delivery ratio and lower energy consumption than existing routing schemes such as gradient based routing and geographical forwarding. Start after striking space key 2 times.

• Journal of Navigation and Port Research
• /
• v.36 no.8
• /
• pp.665-671
• /
• 2012

A remarshalling is studied as an important operational strategy in an automated container terminal to enhance the productivity of container handling. This means the rearrangements of the containers scattered at a vertical yard block. The dispatching problem for remarshalling is selecting the remarshalling operation considering the available operation time and deciding the operation sequencing to maximize the effectiveness of remarshalling. This study develops the optimal mathematical model for yard crane dispatching problem with mixed integer program and explains dispatching problem using an example. However it is difficult to apply this model to a field problem because of its computational time. Therefore, we compare the representative 5 dispatching rules for real world adaption. In a numerical experiment, maximum weight ratio(MR) rule shows an overall outstanding performance.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.5
• /
• pp.388-396
• /
• 2003

In this paper, a fast motion search algorithm that performs motion search for variable blocks in integer pixel unit is proposed. The proposed method is based on the successive elimination algorithm (SEA) using sum norms to find the best estimate of motion vector and obtains the best estimate of the motion vectors of blocks, including 16${\times}$8, 8${\times}$16, and 8${\times}$8, by searching eight pixels around the best motion vector of 16${\times}$16 block obtained from all candidates. And the motion vectors of blocks, including 8${\times}$4, 4${\times}$8, and 4${\times}$4, is obtained by searching eight pixels around the best motion vector of 8${\times}$8 block. The proposed motion search is applied to the H.264 encoder that performs variable blocks motion estimation (ME). In terms of computational complexity, the proposed search algorithm for motion estimation (ME) calculates motion vectors in about 23.8 times speed compared with the spiral full search without early termination and 4.6 times speed compared with the motion estimation method using hierarchical sum of absolute difference (SAD) of 4${\times}$4 blocks, while it shows 0.1dB∼0.4dB peak signal-to-noise ratio (PSNR) drop in comparison to the spiral full search.

• Industrial Engineering and Management Systems
• /
• v.7 no.2
• /
• pp.126-132
• /
• 2008

The bin packing problem (BPP) is an NP-Complete Problem. The problem can be described as there are $N=\{1,2,{\cdots},n\}$ which is a set of item indices and $L=\{s1,s2,{\cdots},sn\}$ be a set of item sizes sj, where $0<sj{\leq}1$, ${\forall}j{\in}N$. The objective is to minimize the number of bins used for packing items in N into a bin such that the total size of items in a bin does not exceed the bin capacity. Assume that the bins have capacity equal to one. In the past, many researchers put on effort to find the heuristic algorithms instead of solving the problem to optimality. Then, the quality of solution may be measured by the asymptotic worst-case ratio or the average-case ratio. The First Fit Decreasing (FFD) is one of the algorithms that its asymptotic worst-case ratio equals to 11/9. Many researchers prove the asymptotic worst-case ratio by using the weighting function and the proof is in a lengthy format. In this study, we found an easier way to prove that the asymptotic worst-case ratio of the First Fit Decreasing (FFD) is not more than 11/9. The proof comes from two ideas which are the occupied space in a bin is more than the size of the item and the occupied space in the optimal solution is less than occupied space in the FFD solution. The occupied space is later called the weighting function. The objective is to determine the maximum occupied space of the heuristics by using integer programming. The maximum value is the key to the asymptotic worst-case ratio.

• Journal of architectural history
• /
• v.27 no.5
• /
• pp.7-16
• /
• 2018

This study investigated the dimensional plan of Kor Sork temple in Preah Pithu complex, Angkor by civil surveying, 3D scan, measured integer ratio and regularity. According to epitaph and preceding researches, Khmer temples were built based on structural planing with the constant ratio and regularity by using special construct measure scales "Hasta" and "Byama". The study assumed the same unit method was applied in Kor Sork temple and identified the regularity of actual measurement value about the temple. The assumed construct measure scale (Hasta) used for the design of this temple is 413mm. The overall apart arrangement of the temple is different in the East-West direction and the North-South direction. In the East-West direction, the whole scale is 180 hasta, and it is divided into 20 hastas. On the other hands, it was confirmed that the North-South direction is 96 hasta and it was divided four quadrants in 24 hastas. Regarding the detailed design, the regularity according to the constant ratio was confirmed. 7 hasta was used as the basic unit on the first floor and 6 hasta were used as the basic unit on the second floor of the terrace. the basement and the central sanctuary is of 6 hasta and 8 hasta were used as the basic standard.

• Journal of Digital Contents Society
• /
• v.10 no.2
• /
• pp.189-198
• /
• 2009

In this paper, we propose a method to improve the performance of orthogonal frequency division multiplexing (OFDM) receivers by using oversampling the received signals. Demodulation of the received OFDM signals is to detect the amplitude and phase components of the subcarriers. From the oversampled OFDM signals, we can get redundant informations in frequency domain for the data, which are different in phase but the same in amplitude. By using these properties, we can obtain signal to noise ratio (SNR) gain by the oversampling ratio compared to the receivers which sampled with symbol rate. In this paper, we propose oversampled receivers whose oversampling ratio is expanded from integer to general rational number. Through computer simulations, we show the validity of the proposed methods by comparing the performance of the receivers with nonideal band-limiting filters.

• Journal of Korea Port Economic Association
• /
• v.33 no.2
• /
• pp.53-82
• /
• 2017

The purpose of this study is to show the clustering trend and compare empirical results, as well as to choose the clustering ports for 3 Korean ports (Busan, Incheon, and Gwangyang) by using meta-frontier DEA (Data Envelopment Analysis) and integer models on 38 Asian container ports over the period 2005-2014. The models consider 4 input variables (birth length, depth, total area, and number of cranes) and 1 output variable (container TEU). The main empirical results of the study are as follows. First, the meta-frontier DEA for Chinese seaports identifies as most efficient ports (in decreasing order) Shanghai, Hongkong, Ningbo, Qingdao, and Guangzhou, while efficient Korean seaports are Busan, Incheon, and Gwangyang. Second, the clustering results of the integer model show that the Busan port should cluster with Dubai, Hongkong, Shanghai, Guangzhou, Ningbo, Qingdao, Singapore, and Kaosiung, while Incheon and Gwangyang should cluster with Shahid Rajaee, Haifa, Khor Fakkan, Tanjung Perak, Osaka, Keelong, and Bangkok ports. Third, clustering through the integer model sharply increases the group efficiency of Incheon (401.84%) and Gwangyang (354.25%), but not that of the Busan port. Fourth, the efficiency ranking comparison between the two models before and after the clustering using the Wilcoxon signed-rank test is matched with the average level of group efficiency (57.88 %) and the technology gap ratio (80.93%). The policy implication of this study is that Korean port policy planners should employ meta-frontier DEA, as well as integer models when clustering is needed among Asian container ports for enhancing the efficiency. In addition Korean seaport managers and port authorities should introduce port development and management plans accounting for the reference and clustered seaports after careful analysis.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.24 no.2
• /
• pp.16-26
• /
• 2010

The transmission valuation methodology we propose here captures the interaction between generation and transmission investment decisions recognizing that a transmission expansion can impact the profitability of new resources investment, so that a methodology should consider both the objectives of investors in resources and the transmission planner. In this perspective, this paper purports to develop the mixed-integer programming based transmission expansion planning optimization software, which is well designed to determine the construction time and place of new generators, transmission lines, and substations as well as their capacities to minimize total expenditures related to their investment and operations while meeting technical constraints such as capacity margin, constitution ratio of power resources, spinning reserves, energy and fuel constraints, transmission line outages and losses, pi-type branching, and so on. Finally, Garver's simple system is adopted to validate not simply the accuracy but the efficiency of the proposed model in this paper.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.41 no.2
• /
• pp.53-65
• /
• 2016

Static wireless multi-hop networks, such as wireless mesh networks and wireless sensor networks have proliferated in recent years because of they are easy to deploy and have low installation cost. Two key measures are used to evaluate the performance of a multicast tree algorithm or protocol : end-to-end delay and the number of transmissions. End-to-end delay is the most important measure in terms of QoS because it affects the total throughput in wireless networks. Delay is similar to the hop count or path length from the source to each destination and is directly related to packet success ratio. In wireless networks, each node uses the air medium to transmit data, and thus, bandwidth consumption is related to the number of transmission nodes. A network has many transmitting nodes, which will cause many collisions and queues because of congestion. In this paper, we optimize two metrics through a guaranteed delay scheme. We provide an integer linear programming formulation to minimize the number of transmissions with a guaranteed hop count and preprocessing to solve the aforementioned problem. We extend this scheme not only with the guaranteed minimum hop count, but also with one or more guaranteed delay bounds to compromise two key metrics. We also provide an explanation of the proposed heuristic algorithm and show its performance and results.