• 대한수학회논문집
• /
• 제28권4호
• /
• pp.833-850
• /
• 2013

We present an algorithm for computing the Hausdorff distance between two parametric curves in $\mathbb{R}^n$, or more generally between two sets of parametric curves in $\mathbb{R}^n$. During repeated subdivision of the parameter space, we prune subintervals that cannot contain an optimal point. Typically, our algorithm costs O(logM) operations, compared with O(M) operations for a direct, brute-force method, to achieve an accuracy of $O(M^{-1})$.

• Journal of Power Electronics
• /
• 제18권5호
• /
• pp.1448-1457
• /
• 2018

Many researchers devote themselves to develop model-predictive direct power control (MPDPC) so as to accelerate the response speed of the grid-connected systems, but they are troubled its large computing amount. On the basis of MPDPC, dual MPDPC (DMPDPC) is presented in this paper. The proposed algorithm divides the conventional MPDPC into two steps. In the first step, the optimal sector is obtained, which contains the optimal switching state in three-level converters. In the second step, the optimal switching state in the selected sector is searched to trace reference active and reactive power and balance neutral point voltage. Simulation and experiment results show that the proposed algorithm not only decreases the computational amount remarkably but also improves the steady-state performance. The dynamic response of the DMPDPC is as fast as that of the MPDPC.

• 전기학회논문지
• /
• 제56권10호
• /
• pp.1699-1708
• /
• 2007

The optimal power flow(OPF) problem was introduced by Carpentier in 1962 as a network constrained economic dispatch problem. Since then, the OPF problem has been intensively studied and widely used in power system operation and planning. In these days, OPF is becoming more and more important in the deregulation environment of power pool and there is an urgent need of faster solution technique for on-line application. To solve OPF problem, many heuristic optimization methods have been developed, such as Genetic Algorithm(GA), Evolutionary Programming(EP), Evolution Strategies(ES), and Particle Swarm Optimization(PSO). Especially, PSO algorithm is a newly proposed population based heuristic optimization algorithm which was inspired by the social behaviors of animals. However, population based heuristic optimization methods require higher computing time to find optimal point. This shortcoming is overcome by a straightforward parallel processing of PSO algorithm. The developed parallel PSO algorithm is implemented on a PC cluster system with 6 Intel Pentium IV 2GHz processors. The proposed approach has been tested on the IEEE 30-bus system. The results showed that computing time of parallelized PSO algorithm can be reduced by parallel processing without losing the quality of solution.

• 한국정보통신학회논문지
• /
• 제12권6호
• /
• pp.1128-1133
• /
• 2008

상황인식(Context-aware)은 인간-컴퓨터 상호작용의 단점을 극복하기 위한 방법으로써 많은 주목을 받고 있다. 본 논문에서는 UoC(Ubiquitous system on Chip)로 구현될 수 있는 상황인식 시스템 구조를 제안한다. 본 논문은 유비쿼터스 컴퓨팅 시스템을 구현하기 위해 CRS(Context Recognition Switch)와 DOS(Dynamic and Optimal Standard)의 개념을 포함한 Pre-processor, HPSP(High Performance Signal Processor), Network Topology Processor의 부분으로 구성된 UoC Architecture를 제안한다. 또한, IEEE 802.15.4 WPAN(Wireless Personal Area Network) Standard에 의해 구현된 UoC를 보여준다. 제안된 상황인식 기반의 UoC Architecture는 주거 환경에서 컨텍스트를 인식하여 사용자를 지원하는 지능형 이동 로봇 등에 적용될 수 있을 것이다.

• Journal of Computing Science and Engineering
• /
• 제12권1호
• /
• pp.24-35
• /
• 2018

Deep convolutional neural network (DCNN) is an advanced technology in image recognition. Because of extreme computing resource requirements, DCNN implementation with software alone cannot achieve real-time requirement. Therefore, the need to implement DCNN accelerator hardware is increasing. In this paper, we present a field programmable gate array (FPGA)-based hardware accelerator design of DCNN targeting handwritten Hangul character recognition application. Also, we present design optimization techniques in SDAccel environments for searching the optimal FPGA design space. The techniques we used include memory access optimization and computing unit parallelism, and data conversion. We achieved about 11.19 ms recognition time per character with Xilinx FPGA accelerator. Our design optimization was performed with Xilinx HLS and SDAccel environment targeting Kintex XCKU115 FPGA from Xilinx. Our design outperforms CPU in terms of energy efficiency (the number of samples per unit energy) by 5.88 times, and GPGPU in terms of energy efficiency by 5 times. We expect the research results will be an alternative to GPGPU solution for real-time applications, especially in data centers or server farms where energy consumption is a critical problem.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권8호
• /
• pp.3689-3700
• /
• 2016

It is not practically feasible to apply hardware-based fault-tolerant schemes, such as hardware replication, in mobile devices. Therefore, software-based fault-tolerance techniques, such as checkpoint and rollback schemes, are required. In checkpoint and rollback schemes, the optimal checkpoint interval should be applied to obtain the best performance. Most previous studies focused on minimizing the expected execution time or response time for completing a given task. Currently, most mobile applications run in real-time environments. Therefore, it is extremely essential for mobile devices to employ optimal checkpoint intervals as determined by the real-time constraints of tasks. In this study, we tackle the problem of determining the optimal inter-checkpoint interval of checkpoint and rollback schemes to maximize the deadline meet ratio in real-time systems and to build a probabilistic cost model. From this cost model, we can numerically find the optimal checkpoint interval using mathematical tools. The performance of the proposed solution is evaluated using analytical estimates.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국내학술편); Seoul National University, Seoul; 20-22 Oct. 1993
• /
• pp.533-539
• /
• 1993

In this paper, two side-attack guidance laws for an underwater vehicle are considered. In order to find the guidance command, we first make use of the optimal guidance law with terminal impact angle constraint. Secondly, the optimal solution of tracking problem is used. This paper shows some brief theory which is used in deriving the side-attack guidance laws, and the method of computing these guidance laws. Simulations on underwater vehicle for a constant moving target prove that the suggested side-attack guidance laws have enhanced side attack performance over the optimal guidance law with miss distance weighting only. Furthermore, from simulation results. we conclude that the guidance law using the optimal solution of tracking problem is more efficient for the side-attack guidance than the optimal guidance law with terminal impact angle constraint.

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

Interactions of major activities participating in fleet operations are investigated in the framework of a closed queueing network system with finite aircrafts assigned to it. An implementable algorithm is developed, which is useful for computing the distributions needed to evaluate the effects of the interactions on the fleet operations. The availability management program is focused on seeking an optimal resource allocation to multiple repair-shops to maximize the fleet availability subject to the budget constraint.

• 제어로봇시스템학회논문지
• /
• 제5권4호
• /
• pp.403-410
• /
• 1999

In this study, a parallel algorithm has been developed that can quickly solve the optiaml control problem of large-scale dynamic systems. The algorithm adopts the sequential quadratic programming methods and achieves domain decomposition-type parallelism in computing sensitivities for search direction computation. A silicon wafer thermal process problem has been solved using the algorithm, and a parallel efficiency of 45% has been achieved with 16 processors. Practical methods have also been investigated in this study as a way to further speed up the computation time.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2006년도 추계학술대회 논문집 전기기기 및 에너지변환시스템부문
• /
• pp.3-5
• /
• 2006

In this paper, annual energy production(AEP) of the wind generator system is analogized considering the regions of a variable wind speed and it is applied to optimal design of the PM wind generator for capturing maximum energy in the operating regions. In addition, internet parallel computing is used to loose excessive calculation times through optimization of the finite element analysis(FEA).