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

A virtual power plant (VPP) is a system that virtually integrates power resources based on the VPP participating customer (VPC) unit and operates as a power plant. When VPP operators manage resources to maximize their benefits, load reduction instructions may focus on more responsive VPCs, or those producing high profitability, by using VPC resources with high operation efficiency. VPCs may thus encounter imbalance problems during operation. This imbalance in operation time would bring more participation for some VPCs, causing potential degradation of their resources. Such an operation strategy would be not preferable for VPP operators in managing the relationship with VPCs. This issue impedes both continual VPC participation and economical and reliable VPP operation in the long term. An operation algorithm is therefore proposed that considers the operation time of VPC generators for mandatory reduction of power resource consumption. The algorithm is based on constraints of daily and annual operation times when VPP operators of local generators perform capacity-market power transactions. The algorithm maximizes the operator benefit through VPP operations. The algorithm implements a penalty parameter for imbalances in operation times spent by VPC generators in fulfilling their obligations. An evaluation was conducted on VPP operational effects by applying the algorithm to the Korean power market.

• 공학논문집
• /
• 제1권1호
• /
• pp.49-57
• /
• 1997

본 논문에서는 Habermann의 deadlock 회피책에 대한 기존의 방안을 향상시킬 수 있는 방법을 고안하였다. 먼저 correction, efficiency, concurrency 측면에서 기존의 개선 방법들을 비교 분석한 다음, 대표적인 Kameda의 개선방안을 심도있게 논의한다. Dinic의 알고리듬을 채택한 Kamedia의 방법에서는 실행시간 O($mn^1.5$)이 요구되지만 Karzanov의 wave method를 응용하여 본고에서 제안한 faster algorithm에서는 실행시간 O($mn^1.5$)이 됨을 보인다.

• 정보저장시스템학회:학술대회논문집
• /
• 정보저장시스템학회 2005년도 추계학술대회 논문집
• /
• pp.139-144
• /
• 2005

Because of the photorefractive recording dynamics, each newly recorded hologram partially erases all previously stored image. Thus achieving the desired diffraction efficiency profile for the entire sequence after all images have been recorded requires exposure time schedule. The often cited classical exposure-schedule model predicts a rising-exponential build-up and an exponential decay in An with an exposure time. However because we cannot directly measure the An, it's difficult to establish the relation of both. In this paper, we deduce the relation of diffraction efficiency and exposure time from experiment data and suggest an algorithm to make time schedule profile in angle/fractal multiplexing of holographic data storage. After that, we present simulated result with equal hologram diffraction efficiency for a sequence of 250 holograms recorded by angle/fractal multiplexing.

• 한국멀티미디어학회논문지
• /
• 제5권6호
• /
• pp.745-752
• /
• 2002

도로에서의 최적 경로 탐색은 출발지와 목적지의 위치를 알고 있는 경우로서 탐색에 대한 일종의 사전 지식을 가진 탐색으로 A* 알고리즘이 널리 사용되고 있다. 단방향 A* 알고리즘은 최적의 경로를 보장해 주는 반면 탐색 시간이 많이 소요되고 양방향 A* 알고리즘은 최적 경로를 보장해 주지 못하거나 최적 경로 보장을 위해서는 오히려 단방향 A* 보다 탐색 시간이 더 많이 소요될 수도 있다. 본 논문에서는 탐색 시간이 우수하며 최적 경로를 보장하는 새로운 양방향 A* 알고리즘을 제안한다. 본 논문에서 제안하는 알고리즘의 효용성을 확인하기 위하여 실제 도로에 적용한 격과 정확한 최적 경로를 탐색하고 탐색 시간도 매우 우수한 것으로 확인되었다.

• 한국통신학회논문지
• /
• 제25권10B호
• /
• pp.1648-1664
• /
• 2000

This paper proposes a real-time dynamic storage allocation algorithm QSHF(quick-segregated-half-fit) that provides various memory allocation policies. that manages a free block list per each word size for memory requests of small size good(segregated)-fit policy that manages a free list per proper range size for medium size requests and half-fit policy that manages a free list per proper range size for medium size requests and half-fit policy that manages a free list per each power of 2 size for large size requests. The proposed algorithm has the time complexit O(1) and makes us able to easily estimate the worst case execution time(WCET). This paper also suggests two algorithm that finds the proper free list for the requested memory size in predictable time and if the found list is empty then finds next available non-empty free list in fixed time. In order to confirm efficiency of the proposed algorithm we simulated the memory utilization of each memory allocation policy. The simulation result showed that each policy guarantees the constant WCET regardless of memory size but they have trade-off between memory utilization and list management overhead.

• 대한전자공학회논문지SP
• /
• 제44권3호
• /
• pp.88-96
• /
• 2007

지난 수년간 많은 국제 비디오 부호화 표준들이 연구되고 제안되었다. 그 중에서도 H.264는 가장 최근에 제안된 부호화 방식으로 가장 높은 부호화 효율을 제공한다. 이는 기존의 부호화 방식들보다 향상된 부호화 기법들을 사용했으며, 특히 다양한 매크로블록 모드와 라그랑지안(Lagrangian) 최적화 기법을 통한 최적 모드 결정법은 부호화 효율 향상에 결정적인 역할을 했다. 비록 H.264는 부호화 효율 측면에서 기존의 방식보다 월등한 성능 향상을 보이지만, 최적 모드를 결정하는 과정에서 모든 부호화 매개 변수를 고려하므로 실시간 부호화가 어려울 정도로 복잡도가 크게 증가한다. 본 논문에서는 이러한 복잡도를 최소화하기 위해 매크로블록 모드를 복잡도 측면에서 분류하고 복잡도가 낮은 최적 모드를 조기에 결정하는 고속 모드결정 방식을 제안한다. 실험 결과, 제안한 방식은 여러 종류의 실험 영상에 대해 현저한 PSNR 감소나 비트량 증가 없이 부호화 시간을 평균 34.95%까지 감소시켰다. 또한, 본 논문에서 제공한 실험 결과의 타당성을 보이기 위해 부호화 효율과 복잡도에 대한 하위 경계조건(low boundary condition)을 설정하고, 제안한 방식이 하위 경계조건을 만족함을 보였다.

• Journal of information and communication convergence engineering
• /
• 제6권3호
• /
• pp.353-357
• /
• 2008

One objective in developing the next generation of wireless communication systems is to increase data rates and reliability. A promising way to achieve this is to combine multiple-input and multiple-output signal processing with a space-time coding scheme, which offers higher coding and diversity gains and improves the spectrum efficiency and reliability of a wireless communication system. It is noted, however, that time delay differences and phase differences among different channels increase symbol interference and degrade system performance. In this letter, we investigate phase differences and their effects on multiple-input and multiple-output systems, and propose a compensation algorithm for the Rayleigh fading model to minimize their effects.

• 지능정보연구
• /
• 제4권1호
• /
• pp.1-10
• /
• 1998

Process planning is a very complex task and requires the dynamic informatioon of shop foor and market situations. Process plan selection is one of the main problems in the process planning. In this paper, we propose a new process plan selection model considering operation flexibility for the computer aided process planing. The model is formulated as a 0-1 integer programming considering realistic shop factors such as production volume, machining time, machine capacity, transportation time and capacity of tractors such as production volume, machining time, machine capacity, transportation time capacity of transfer device. The objective of the model is to minimize the sum of the processing and transportation time for all parts. A genetic algorithm a, pp.oach is developed to solve the model. The efficiency of the proposed a, pp.oach is verified with numerical examples.

• 한국조명전기설비학회지:조명전기설비
• /
• 제1권1호
• /
• pp.61-66
• /
• 1987

이 연구는 주어진 소요배광을 만족시킬 수 있는 조명기구의 광학계의 설계를 다루고 있다. 지금까지 개인적인 경험과 직관에 의지하여 설계가 수행되었고 또한 기존의 CAD algorithm의 경우에도 반사면에서의 확산특성을 무시하였고 CPU time도 상당히 긴 편이었다. 이러한 한계점들을 극복하기 위하여 새로운 CAD algorithm을 제시하였다. 이 새로운 algorithm은 높은 효율과 적절한 조도분포를 제공하는 설계를 간편하고 바르게 수행할 수 있다.

• 한국측량학회:학술대회논문집
• /
• 한국측량학회 2006년도 춘계학술발표회 논문집
• /
• pp.181-185
• /
• 2006

Image co-registration is the process of overlaying two images of the same scene, one of which represents a reference image, while the other is geometrically transformed to the one. In order to improve efficiency and effectiveness of the co-registration approach, the author proposed a pre-qualified area matching algorithm which is composed of feature extraction with canny operator and area matching algorithm with cross correlation coefficient. For refining matching points, outlier detection using studentized residual was used and iteratively removes outliers at the level of three standard deviation. Throughout the pre-qualification and the refining processes, the computation time was significantly improved and the registration accuracy is enhanced. A prototype of the proposed algorithm was implemented and the performance test of 3 Landsat images of Korea showed: (1) average RMSE error of the approach was 0.436 Pixel (2) the average number of matching points was over 38,475 (3) the average processing time was 489 seconds per image with a regular workstation equipped with a 3 GHz Intel Pentium 4 CPU and 1 Gbytes Ram. The proposed approach achieved robustness, full automation, and time efficiency.