• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.41 no.2
• /
• pp.1-8
• /
• 2004

This paper presents an optimal robust LQ-PID controller design method for the second order system with time-delay to meet design specifications. By LQR formulation of the second order system with time-delay, the tuning parameters of PID controller are related by weighting factors Q and R of cost function. The selection of weighting factors Q and R are chosen to satisfy such the design specifications as overshoot and settling time.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2004.05b
• /
• pp.615-619
• /
• 2004

본 연구에서는 유출해석에 있어서 중요한 기존 설계강우의 시간분포 방법의 문제점을 해결하고 강우의 통계적 특성과 유역특성에 맞는 설계강우의 시간분포 방법을 개발하고자 하였다. 홍수량 산정지점별로 인근 관측소의 Thiessen 가중치를 부여하여 지속시간별로 호우사상을 호우 중심에 따라 4개 분위로 구분한 다음 분위별 호우사상을 무차원화 하여 누가우량곡선으로 변환한 후 산정지점별로 지속시간별 설계강우를 분포시킨다. 본 연구의 결과로 지속시간별 분위를 구분함으로써 기존 Huff의 4분위법에서 문제점으로 제시된 평활화된 무차원누가곡선으로 인한 첨두홍수량의 과소산정 등을 해결할 수 있었고, 홍수량산정지점에 대하여 지점별 대표누가우량곡선의 작성이 가능하여 현재 제시된 우량관측소별 우량주상도의 지점별 적용시 대표 우량관측소 선정 등의 어려움을 해결할 수 있이 설계홍수량 산정시 유역의 시${\cdot}$공간적 특성에 따른 강우의 특성이 최대한 반영되도록 하였다.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2009.10a
• /
• pp.177-178
• /
• 2009

본 연구는 반입 작업에서 수출 컨테이너의 작업순서 및 장치위치를 결정하는 문제를 다루었다. 수직 배치형 컨테이너 터미널에서 적하작업시간의 단축을 위해서는 가능한 해측에 컨테이너를 장치하는 것이 유리하지만 반입 외부 트럭의 빠른 회전시간의 측면에서는 육측이 선호된다. 이때 수출 컨테이너의 장치위치는 본선작업 우선순위에 따라 가중치가 다르고 이에 소요되는 장치소요시간에 따라 외부트럭들의 대기시간도 달라진다. 따라서 본 연구는 외부 트럭들의 예정 도착시간과 최대대기시간 그리고 적하작업의 선호 장치위치를 동시에 고려한 혼합정수모델을 개발하고 이를 활용한 적용 예를 제시하였다.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.9 no.4
• /
• pp.330-336
• /
• 2016

In this paper, we studied for modified bartlett method to estimate desired information signal. Constrained length of bartlett method is assigned as one, and estimate desired information signal to compensate for delay time. Modified bartlett method is an optimum direction-of-arrival (DoA) estimation algorithm to apply delay time compensation to update optimum weight. The optimum weight is used linear constrained minimum variance method(LCMV). Through simulation, we are comparative analysis proposed algorithm and general Bartlett and MUSIC method. In desired signal estimation, condition simulation is an array antenna element numbers 6 or 9 and desired information signals number 3. We show the superior performance of the proposed algorithm relative to the existing method in estimation of desired information signal.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.8
• /
• pp.456-462
• /
• 2002

We are developing searching algorithms for weighted strings such as protein sequences. Let${\sum}$ be an alphabet and for each $a{\in}{\sum}$ its weight ${\mu}(a)$ is given. Given a string $A=a_1a_2…a_n\; with each ai{\in}{\sum}$, a substring<$A(i.j)=a_ia_{i+1}…a_j$ has weight ${\in}(A(i.j))={\in}(a_i)+{\in}(a_i+1)+…+{\in}(a_j)$.The problem we are dealing with is to preprocess A to build a searching structure, and later, given a query weight M, the structure is used to answer the question of whether there is a substring A(i,j) such that$M={\in}(A(i,j))$.In this paper an algorithm that improves over the previous result will be presented. The previously best known algorithm answers a query in $0(\frac{nlog\;logn}{log\; n})$time using a searching structure that requires O(n) amount of memory. Our algorithm reduces the memory requirement to $0(\frac{n}{log\; n})$ while achieving the same query answer time.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.1
• /
• pp.71-78
• /
• 2009

Sound source localization systems in service robot applications estimate the direction of a human voice. Time delay information obtained from a few separate microphones is widely used for the estimation of the sound direction. Correlation is computed in order to calculate the time delay between two signals. In addition, PHAT weighting function can be applied to significantly improve the accuracy of the estimation. However, FFT and IFFT operations in the PHAT weighting function occupy more than half of the area of the sound source localization system. Thus efficient FFT and IFFT designs are essential for the IP implementation of sound source localization system. In this paper, we propose an efficient FFT/IFFT design method based on the characteristics of human voice.

• Journal of Korea Multimedia Society
• /
• v.13 no.4
• /
• pp.526-534
• /
• 2010

This paper describes an algorithm which merges two HDR pictures taken under different exposure time to display on the LDR devices such as LCD or CRT. The proposed method does not generate the radiance map, but directly merges using the weights computed from the input images. The weights are firstly produced on the pixel basis, and then blended with a Gaussian function. This process prevents some possible sparkle noises caused by radical change of the weights and contributes to smooth connection between 2 image informations. The chrominance informations of the images are merged on the weighted averaging scheme using the deviations of RGB average and their differences. The algorithm is characterized by the feature that it represents well the unsaturated area of 2 original images and the connection of the image information is smooth. The proposed method uses only 2 input images and automatically tunes the whole internal process according to them, thus autonomous operation is possible when it is included in HDR cameras which use double shuttering scheme or double sensor cells.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.113-115
• /
• 2015

In this paper, we proposed an algorithm based on movement prediction using rate of change of the attribute information of nodes what is called WRC(Weighted Rate Control) in delay tolerant networks(DTNs). Existing DTN routing algorithms based on movement prediction communicate by selecting relay nodes increasing connectivity with destination node. Thus, because the mobile nodes are in flux, the prediction algorithms that do not reflect the newest attribute information of node decrease reliability. In this paper, proposed algorithm approximate speed and direction of attribute information of node and analysis rate of change of attribute information of node. Then, it predict movement path of node using proposed weight. As the result, proposed algorithm show that network overhead and transmission delay time decreased by predicting movement path of node.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.10
• /
• pp.1531-1536
• /
• 2022

This paper considers a problem to find a set of intervals containing all the points for the given n points and m intervals on a line, This is a special case of the set cover problem, well known as an NP-hard problem. As optimization criteria of the problem, there are minimizing the number of intervals to cover the points, maximizing the number of points each of which is covered by exactly one interval, and so on. In this paper, the intervals have weights and the sum of weights of intervals to cover a point is defined as a membership of the point. We will study the problem to find an interval cover minimizing the maximum of memberships of points. Using the dynamic programming method, we provide an O(m²)-time algorithm to improve the time complexity O(nm log n) given in the previous work.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.5
• /
• pp.786-792
• /
• 2022

In the cloud computing environment, there has been a lot of research into the Fog/Edge Computing (FEC) paradigm for securing user proximity of application services and computation offloading to alleviate service delay difficulties. The method of predicting dynamic location change patterns of edge devices (moving objects) requesting application services is critical in this FEC environment for efficient computing resource distribution and deployment. This paper proposes an optimal moving pattern extraction algorithm in which variable weights (distance, time, congestion) are applied to selected paths in addition to a support factor threshold for frequency patterns (moving objects) of edge devices. The proposed algorithm is compared to the OPE_freq [8] algorithm, which just applies frequency, as well as the A^* and Dijkstra algorithms, and it can be shown that the execution time and number of nodes accessed are reduced, and a more accurate path is extracted through experiments.