• Journal of Electrical Engineering and Technology
• /
• 제4권3호
• /
• pp.346-352
• /
• 2009

The eventual goal of this paper is to help the generating companies and load-serving entities to choose appropriate relative levels of interconnected system versus bilateral trades while considering risk, and economic performance. In competitive power markets, electricity prices are determined by balance between demand and supply in electric power exchanges or bilateral contracts. The problem formulation is bilateral contract incorporated into Multi-area unit commitment with import/export and tie-line constraints. This proposed method considers maximizing own profit or minimize the operating cost among the generating companies in multi-area system. The feasibility of the proposed algorithm has been demonstrated using IEEE system with four areas and experimental results shows that proposed method is reliable, fast and computationally efficient

• 한국게임학회 논문지
• /
• 제9권5호
• /
• pp.137-144
• /
• 2009

이 논문은 피하산란의 정도가 다를 것으로 예상되는 얼굴의 6개의 부위를 촬영하여 각각의 산란특성을 추출하고 렌더링에 반영하여 얼굴의 사실감 있는 표현이 가능한 방법을 제안한다. 각 부위별 산란이미지는 프로젝터로부터 피부에 입사된 단위광선이 내부 산란을 거쳐 밖으로 드러나는 모양을 여러 노출로 촬영하여 HDR 이미지로 합성하고, 비선형 최소제곱합의 해법 중 Sequential Quadratic Programming을 이용하여 광선의 입사지점을 지나는 단면이 이루는 곡선에 '가우스 함수의 선형결합'을 적합한다. 가우스 함수는 산란곡선을 잘 근사하면서 필터로서 적용이 쉬운 장점을 가진다. 우리는 최소제곱합의 해가 지역 해에 빠지는 않도록 유전알고리듬을 이용해 초기 값을 설정한다. 근사된 식의 각 가우스 항은 얼굴에 입사되는 복사조도를 렌더링한 텍스처에 가우스 필터로 적용되어 피하산란효과를 표현. 이 논문에서는 최대 12회의 가우스 필터링을 효율적으로 처리하기 위해 쿠다의 병렬처리능력를 활용하였다.

• 산업경영시스템학회지
• /
• 제42권1호
• /
• pp.143-150
• /
• 2019

We focus on the weapon target assignment and fire scheduling problem (WTAFSP) with the objective of minimizing the makespan, i.e., the latest completion time of a given set of firing operations. In this study, we assume that there are m available weapons to fire at n targets (> m). The artillery attack operation consists of two steps of sequential procedure : assignment of weapons to the targets; and scheduling firing operations against the targets that are assigned to each weapon. This problem is a combination of weapon target assignment problem (WTAP) and fire scheduling problem (FSP). To solve this problem, we define the problem with a mixed integer programming model. Then, we develop exact algorithms based on a dynamic programming technique. Also, we suggest how to find lower bounds and upper bounds to a given problem. To evaluate the performance of developed exact algorithms, computational experiments are performed on randomly generated problems. From the results, we can see suggested exact algorithm solves problems of a medium size within a reasonable amount of computation time. Also, the results show that the computation time required for suggested exact algorithm can be seen to increase rapidly as the problem size grows. We report the result with analysis and give directions for future research for this study. This study is meaningful in that it suggests an exact algorithm for a more realistic problem than existing researches. Also, this study can provide a basis for developing algorithms that can solve larger size problems.