• 해양환경안전학회지
• /
• 제1권2호
• /
• pp.69-82
• /
• 1995

This study is concerned with developing a heuristic algorithm for solving a class of ninlinear integer programs(NLIP). Exact algrithm for solving a NLIP either may not exist, or may take an unrealistically large amount of computing time. This study develops a new heuristic, the Excursion Algorithm(EA), for solving a class of NLIP's. It turns out that excursions over a bounded feasible and/or infeasible region is effective in alleviation the risks of being trapped at a lical optimum. The developed EA is applied to the redundancy optimization problems for improving the system safety, and is compared with other existing heuristic methods. We also include simulated annealing(SA) method in the comparision experiment due to ist populatrity for solving complex combinatorial problems. Computational results indicate that the proposed EA performs consistently better than the other in terms of solution quality, with moderate increase in computing time. Therefore, the proposed EA is believed to be an attractive alternative to other heuristic methods.

• 한국환경과학회지
• /
• 제24권4호
• /
• pp.525-540
• /
• 2015

Spatial distribution of precipitation has been estimated based on the local gauge correction (LGC) with a fixed inverse distance weighting (IDW), which is not optimized in taking effective radius into account depending on the radar error. We developed an algorithm, improved local gauge correction (ILGC) which eliminates outlier in radar rainrate errors and optimize distance power for IDW. ILGC was statistically examined the hourly cumulated precipitation from weather for the heavy rain events. Adjusted radar rainfall from ILGC is improved to 50% compared with unadjusted radar rainfall. The accuracy of ILGC is higher to 7% than that of LGC, which resulted from a positive effect of the optimal algorithm on the adjustment of quantitative precipitation estimation from weather radar.

• 대한기계학회논문집A
• /
• 제21권6호
• /
• pp.988-994
• /
• 1997

The demands for robotic and automatic system are continually increasing in manufacturing fields. There have been many studies to monitor and predict the system, but they have mainly focused upon measuring cutting force, and current of motor spindle, and upon using acoustic sensor, etc. In this study, digital image of time series sequence was acquired by taking advantage of optical technique. Mean square error was obtained from it and was available for useful observation data. The parameter was estimated using PAA(parameter adaptation algorithm) from observation data. AR(auto regressive) model was selected for system model and fifth order was decided according to parameter estimation. Uncorrelation test was also carried out to verify convergence of parameter. Through the proceedings, it was found that there was a system stability.

• Journal of the Optical Society of Korea
• /
• 제20권6호
• /
• pp.653-662
• /
• 2016

An optimized multilayer superlens is designed, using a rigorous and efficient approach based on the method of moments (MoM) in conjunction with a simulated annealing (SA) algorithm. For the MoM solution, fast evaluation of closed-form Green's functions (GFs) in the spatial domain is performed by applying the complex-image (CI) technique, which obviates the time-consuming numerical evaluation of Sommerfeld integrals. The imaging capability of the superlens is examined with the correlation coefficient; results show that using circular polarization for the incident wave can improve this coefficient. To validate the proposed method, finite-element-based simulations are exploited, which reveal the method's accuracy and computational efficiency. Simulation results indicate that the designed structure is capable of producing two-dimensional sub-diffraction-limited images in the visible range, which may make it more versatile for practical applications. Finally, as a considerable finding, it is demonstrated for the proposed design that using circularly polarized illumination provides improved super-resolving performance, compared to linearly polarized illumination.

• 전력전자학회논문지
• /
• 제10권4호
• /
• pp.373-379
• /
• 2005

본 논문에서는 인버터를 구동하는 용도의 직류전원장치에 대한 제어 알고리즘 개발을 목표로 하고 있으며, 구동과 회생기능을 갖는 전압형 PWM 컨버터에서 운전시 전원의 불평형을 보상하는 제어방법을 제안한다. 교류전원에 대하여 컨버터가 항상 평형상태를 유지하는 방법은 전류제어 루프에 의하여 불평형 상태를 보상하는 방법을 사용하였으며, 불평형의 제어는 전력변환기의 구성면에 있어서 각상의 리액턴스가 같지 않은 누설변압기 등의 사용을 가능하게 하므로 제안된 전력변환기의 하드웨어와 제어 알고리즘은 장치의 소형화와 효율향상에 기여할 것이다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.772-776
• /
• 2004

This paper proposes an interference avoidance approach for Constraint-Based Routing (CBR) algorithm in the Multi-Protocol Label Switching (MPLS) network. The MPLS network itself has a capability of integrating among any layer-3 protocols and any layer-2 protocols of the OSI model. It is based on the label switching technology, which is fast and flexible switching technique using pre-defined Label Switching Paths (LSPs). The MPLS network is a solution for the Traffic Engineering(TE), Quality of Service (QoS), Virtual Private Network (VPN), and Constraint-Based Routing (CBR) issues. According to the MPLS CBR, routing performance requirements are capability for on-line routing, high network throughput, high network utilization, high network scalability, fast rerouting performance, low percentage of call-setup request blocking, and low calculation complexity. There are many previously proposed algorithms such as minimum hop (MH) algorithm, widest shortest path (WSP) algorithm, and minimum interference routing algorithm (MIRA). The MIRA algorithm is currently seemed to be the best solution for the MPLS routing problem in case of selecting a path with minimum interference level. It achieves lower call-setup request blocking, lower interference level, higher network utilization and higher network throughput. However, it suffers from routing calculation complexity which makes it difficult to real task implementation. In this paper, there are three objectives for routing algorithm design, which are minimizing interference levels with other source-destination node pairs, minimizing resource usage by selecting a minimum hop path first, and reducing calculation complexity. The proposed CBR algorithm is based on power factor calculation of total amount of possible path per link and the residual bandwidth in the network. A path with high power factor should be considered as minimum interference path and should be selected for path setup. With the proposed algorithm, all of the three objectives are attained and the approach of selection of a high power factor path could minimize interference level among all source-destination node pairs. The approach of selection of a shortest path from many equal power factor paths approach could minimize the usage of network resource. Then the network has higher resource reservation for future call-setup request. Moreover, the calculation of possible path per link (or interference level indicator) is run only whenever the network topology has been changed. Hence, this approach could reduce routing calculation complexity. The simulation results show that the proposed algorithm has good performance over high network utilization, low call-setup blocking percentage and low routing computation complexity.

• 한국국방경영분석학회지
• /
• 제6권2호
• /
• pp.89-127
• /
• 1980

The multivariate analysis techniques of cluster analysis are examined in this article. The theory and applications of the techniques and computer software concerning these techniques are discussed and sample jobs are included. A hierarchical cluster analysis algorithm, available in the IMSL software package, is applied to a set of data extracted from a group of subjects for the purpose of partitioning a collection of 26 attributes of a weapon system into six clusters of superattributes. A nonhierarchical clustering procedure were applied to a collection of data of tanks considering of twenty-four observations of ten attributes of tanks. The cluster analysis shows that the tanks cluster somewhat naturally by nationality. The principal componant analysis and the discriminant analysis show that tank weight is the single most important discriminator among nationality although they are not shown in this article because of the space restriction. This is a part of thesis for master's degree in operations research.

• 한국철도학회:학술대회논문집
• /
• 한국철도학회 2011년도 춘계학술대회 논문집
• /
• pp.644-651
• /
• 2011

This study presents a development of DeCatS(Detail Design of High Speed Catenary System) which is a software to design high speed catenary system automatically. The program is developed by Korea Railroad Research Institute with the support of KHSR. A process of developing it and a comparison with LEXCAT, in order to demonstrate a preciseness of that, were performed. In the program, decision of H-beam, cantilever fitting, management of materials, automatic drawing and etc. according to input conditions can be accomplished. In this study, especially the program algorithm for the decision of mast was introduced.

• ETRI Journal
• /
• 제25권1호
• /
• pp.52-54
• /
• 2003

We propose an improved algorithm for detecting audio watermarks based on a spread spectrum in the spectral domain. Since the energy of a watermark is much smaller than that of the cover audio data, pre-processing to reduce the effect of the cover data is needed to reliably extract watermarks. We introduce a spectral envelope filter as a pre-process that enhances detecting performance by filtering out the intrinsic spectral character of cover data. The proposed watermarking structure can be easily included in the compression system and can extract watermarks from partially decompressed spectral data. Our experimental results demonstrate that with a bit error rate of around 10 dB against general attacks, the proposed detecting scheme works better than detectors without the spectral filter.

• 한국품질경영학회:학술대회논문집
• /
• 한국품질경영학회 2007년도 춘계학술대회
• /
• pp.491-497
• /
• 2007

The planning and scheduling is considered as an important function because it influence to the overall performance of production in manufacturing system for supporting global objectives. In this paper, propose the hybrid approach to solve the problem which considered alternative resources and sequences, a sequence-dependent setups and transportation times. The objective of this problem is minimize the makespan with AGV traveling time. A iterative two heuristic algorithm(PSO, SA) is proposed to obtain the sequence of operations and CPLEX package is used to obtain the optimal sub-lot sizes(OLS) when the sequence of operations and greedy-based AGV dispatching rules are fixed or given. we show that performance of iterative two heuristic algorithms and simple numerical experiment.