• Journal of Electrical Engineering and Technology
• /
• 제12권6호
• /
• pp.2187-2195
• /
• 2017

In order to solve the AC optimal power flow (OPF) problem considering the generators' on/off status, it is necessary to model the problem as mixed-integer nonlinear programming (MINLP). Because the computation time to find the optimal solution to the mixed-integer AC OPF problem increases significantly as the system becomes larger, most of the existing solutions simplify the problem either by deciding the on/off status of generators using a separate unit commitment algorithm or by ignoring the minimum output of the generators. Even though this kind of simplification may make the overall computation time tractable, the results can be significantly erroneous. This paper proposes a novel algorithm for the mixed-integer AC OPF problem, which can provide a near-optimal solution quickly and efficiently. The proposed method is based on a combination of the outer approximation method and the relaxed AC OPF theory. The method is applied to a real-scale power system that has 457 generators and 2132 buses, and the result is compared to the branch-and-bound (B&B) method and the genetic algorithm. The results of the proposed method are almost identical to those of the compared methods, but computation time is significantly shorter.

• 한국멀티미디어학회논문지
• /
• 제10권12호
• /
• pp.1741-1751
• /
• 2007

The imprecise computation technique ensures that all time-critical tasks produce their results before their deadlines by trading off the quality of the results for the computation time requirements of the tasks. In the imprecise computation, most scheduling problems of satisfying both 0/1 constraints and timing constraints, while the total error is minimized, are NP-complete when the optional tasks have arbitrary processing times. In the previous studies, the reasonable strategies of scheduling tasks with the 0/1 constraints on uniprocessors and multiprocessors for minimizing the total error are proposed. But, these algorithms are all off-line algorithms. Then, in the on-line scheduling, NORA(No Off-line tasks and on-line tasks Ready upon Arrival) algorithm can find a schedule with the minimum total error. In NORA algorithm, EDF(Earliest Deadline First) strategy is adopted in the scheduling of optional tasks. On the other hand, for the task system with 0/1 constraints, NORA algorithm may not suitable any more for minimizing total error of the imprecise tasks. Therefore, in this paper, an on-line algorithm is proposed to minimize total error for the imprecise real-time task system with 0/1 constraints. This algorithm is suitable for the imprecise on-line system with 0/1 constraints. Next, to evaluate performance of this algorithm, a series of experiments are done. As a consequence of the performance comparison, it has been concluded that IOSMTE(Imprecise On-line Scheduling to Minimize Total Error) algorithm proposed in this paper outperforms LOF(Longest Optional First) strategy and SOF(Shortest Optional First) strategy for the most cases.

• 한국컴퓨터정보학회논문지
• /
• 제19권4호
• /
• pp.25-33
• /
• 2014

본 논문에서는 멀티코어 프로세서 상에서 실시간 작업들의 데드라인들을 만족하면서 전력 소모량의 확률적 기대값을 최소화하는 문제를 해결하는 스케쥴링 기법을 제시하였다. 제시된 기법에서는 주어진 작업들의 불확실한 계산량을 과거의 계산량 분포에 기반하여 확률적 계산량으로 변환하고, 한정된 개수의 이산적 클락 주파수 값들을 이용하여 변환된 확률적 계산량의 전력 소모 기대 값을 최소화한다. 또한 시스템의 부하량이 적을 때에는 누수 전력을 고려하여 전체 코어들 중에서 일부의 코어들만을 사용하고 나머지 코어들의 전원을 소등시켜서 전력 소모량을 줄인다. 성능평가 실험에서 제시된 기법이 기존 방법의 전력 소모량을 최대 69%까지 감소시킴을 확인하였다.

• 대한조선학회논문집
• /
• 제39권4호
• /
• pp.1-10
• /
• 2002

초기쇄파의 수치모사에는 지금까지 경계적분법이 주로 쓰여왔고, 이 방법은 과도한 계산시간의 문제를 제외하고는 어느 정도 성공적이라고 할 수 있다. 본 논문에서는 쇄파실험을 수치모사하기 위한 새로운 수치기법을 보였다. 이 수치기법은 고차 스펙트럴/경계요소법과 경계적분법을 순차적으로 사용하며, 계산시간을 현저히 줄여준다. 조파 및 파 에너지 집중과정은 고차 스펙트럴/경계요소법에 의해 효율적으로 수치모사되고, 파의 전복과정만이 경계적분법에 의해 계산된다. 계산예에서 높은 입자속도와 가속도 등 쇄파의 두드러진 특성이 보여졌다.

• 대한기계학회논문집
• /
• 제13권3호
• /
• pp.500-507
• /
• 1989

본 논문에서는 흡배기 변동압을 실측하여 이것을 계산의 입력수치로 사용 하는 전산프로그램을 개발하여 간단하면서도 정확한 사이클 시뮬레이션이 가능하도록 하여 체적효율을 예측하였다.

• Current Optics and Photonics
• /
• 제2권5호
• /
• pp.453-459
• /
• 2018

We have developed a high-performance signal-processing and image-rendering heterogeneous computation system for optical coherence tomography (OCT) on mobile processor. In this paper, we reveal it by demonstrating real-time OCT image processing using a Snapdragon 800 mobile processor, with the introduction of a heterogeneous image visualization architecture (HIVA) to accelerate the signal-processing and image-visualization procedures. HIVA has been designed to maximize the computational performances of a mobile processor by using a native language compiler, which targets mobile processor, to directly access mobile-processor computing resources and the open computing language (OpenCL) for heterogeneous computation. The developed mobile image processing platform requires only 25 ms to produce an OCT image from $512{\times}1024$ OCT data. This is 617 times faster than the naïve approach without HIVA, which requires more than 15 s. The developed platform can produce 40 OCT images per second, to facilitate real-time mobile OCT image visualization. We believe this study would facilitate the development of portable diagnostic image visualization with medical imaging modality, which requires computationally expensive procedures, using a mobile processor.

• 한국지진공학회논문집
• /
• 제10권5호
• /
• pp.99-106
• /
• 2006

이 논문에서 소개되는 실시간 하이브리드 실험 시스템은 유사동적실험법을 근거로 하고 있으며, 실제 실험과수학적 모델을 이용한 수치해석을 결합한 실험법이다. 이 시스템은 종래의 유사동적해석법에 비해 지진하중을 받는 구조물의 실시간 반응에 근접하는 현저히 높은 하중재하 속도를 고려할 수 있도록 설계되었다. 또한 다자유도 구조물에 대해 안정적인 해석환경을 제공하기 위해 이 시스템은 implicit 시간적분법을 이용하여 수치해석을 수행한다. 이 논문은 연구를 통해 개발된 시스템의 전반적인 개요와 구성요소 그리고 이 시스템에서 사용하는 수치 해석법의 성능을 평가하기 위해 수행된 수치해석을 소개한다. 연구 결과 개발된 시스템에 적용된 수치해석법은 성능이 매우 우수하다는 것이 증명되었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권12호
• /
• pp.5723-5743
• /
• 2018

The evolving internet-based services demand high-speed data transmission in conjunction with scalability. The next generation optical network has to exploit artificial intelligence and cognitive techniques to cope with the emerging requirements. This work proposes a novel way to solve the dynamic provisioning problem in optical network. The provisioning in optical network involves the computation of routes and the reservation of wavelenghs (Routing and Wavelength assignment-RWA). This is an extensively studied multi-objective optimization problem and its complexity is known to be NP-Complete. As the exact algorithms incurs more running time, the heuristic based approaches have been widely preferred to solve this problem. Recently the software-defined networking has impacted the way the optical pipes are configured and monitored. This work proposes the dynamic selection of path computation algorithms in response to the changing service requirements and network scenarios. A software-defined controller mechanism with a novel packet matching feature was proposed to dynamically match the traffic demands with the appropriate algorithm. A software-defined controller with Path Computation Element-PCE was created in the ONOS tool. A simulation study was performed with the case study of dynamic path establishment in ONOS-Open Network Operating System based software defined controller environment. A java based NOX controller was configured with a parent path computation element. The child path computation elements were configured with different path computation algorithms under the control of the parent path computation element. The use case of dynamic bulk path creation was considered. The algorithm selection method is compared with the existing single algorithm based method and the results are analyzed.

• 전자공학회논문지CI
• /
• 제37권4호
• /
• pp.9-15
• /
• 2000

본 논문은 고정 우선순위 실시간 시스템에서 연성 비주기 실시간 태스크의 on-line 응답시간을 줄이기 위한 연산의 최소화에 목적이 있다. 제안하는 알고리즘은 온라인 시의 오버헤드를 줄이면서, 동시에 비주기 태스크에 할당할 수 있는 최대의 여유시간을 제공함으로써 목표를 만족시킨다. 제안하는 알고리즘은 고정우선 순위 비주기 실시간 태스크 스케줄링에서 off-line시 최적의 응답시간을 내는 알고리즘인 Slack Stealing에 비해 응답시간의 손실이 거의 없으면서 오버헤드 측면에서 7배 가량의 좋은 성능을 나타낸다.

• 대한기계학회논문집B
• /
• 제22권1호
• /
• pp.104-112
• /
• 1998

The mold filling process has been a central issue in the development of numerical methods to solve the casting processes. A mold filling which is inherently transient free surface fluid flow, is important because the quality of casting highly depends on such phenomenon, Most of the existing numerical schemes to solve mold filling process have severe limitations in time step restrictions or Courant criteria since explicit time integration is used. Therefore, a large computation time is required to analyze casting processes. In this study, the well known SOLA-VOF method has been modified implicitly to simulate the mold filling process. Solutions to example filling problems show that the proposed method is more efficient in computation time than the original SOLA -VOF method.