• The Journal of the Korea Contents Association
• /
• v.10 no.12
• /
• pp.164-172
• /
• 2010

The purpose of this paper is to clarify the naming creation process of cultural contents based on the violation of selectional restrictions. This is to insist that the violation of selectional restrictions should be significantly considered as a mode of story planning and title naming in the cultural contents such as 'King and the Clown' and 'Ballerina Who Loves B-Boy'. This approach of selectional restrictions is based on the insistence of Chomsky's 'Aspects of the Theory of Syntax' in 1965. His idea had proposed that violation of linguistic rules affects the acceptability in the selectional properties of words and sentences. This focuses on the naming creation of cultural contents by widening his notion between selectional restrictions and the violation of selectional restrictions.

• The KIPS Transactions:PartA
• /
• v.9A no.3
• /
• pp.379-386
• /
• 2002

This paper presents a scheduling approach for synthesizing pipelined datapaths under resource constraints. Our approach builds up a schedule based on gradual mobility reduction in contrast to other algorithms of previous researches, where an operation being scheduled is selected by using a priority function. The proposed method consists of a scheduling algorithm and a decision algorithm for detecting any violation against resource constraints. Our approach evaluates whether or not a scheduling solution can exist in case an operation temporarily is assigned to the earliest or latest control step among the assignable steps for the operation. If a solution cannot be found, it is impossible to assign the operation to that step due to a violation against resource constraints, and so we can eliminate that control step. This process is iterated until a reduction of mobility for all operations can not be obtained. Experiments on benchmarks show that this approach gains a considerable improvement over those by previous approaches.

• Proceedings of the KIEE Conference
• /
• 2009.07a
• /
• pp.81_82
• /
• 2009

본 논문은 한국형 에너지관리시스템에 적용되는 발전계획 응용프로그램 기능중 최적조류계산 기능을 실제 시스템에 적용하기 위한 준비과정을 설명하고 있다. 최적조류계산 기능은 운영자가 정의한 계통모델, 제어요소, 목적함수, 제약요소를 기반으로 운영자가 선택하는 전력계통 BaseCase를 해석하여 계통운영 한계값의 위반을 제거하거나 최소화하여 전력계통의 안정성을 향상시키며, 유효전력 손실 최소화, 연료 비용 최소화 등 목적함수를 최소화하는 해를 생성하고 계통운영상의 주요 제어 및 비용권고 사항 등 계통 해석상태를 제시하는 기능을 수행하는 응용프로그램으로 K-EMS Prototype 개발 기간에 개발되었다. 이에 본 논문에서는 언급한 OPF 기능을 실제 계통 데이터를 Interface하는 과정과 검증방법들에 대해서 설명하고자 한다.

• Journal of Korean Society of Steel Construction
• /
• v.24 no.6
• /
• pp.701-710
• /
• 2012

We present optimum design for truss and frame structures subject to constraints on stresses, displacement, and natural frequency. The optimum design procedure is used discrete and continuous design variables and Genetic Algorithms. Genetic Algorithms is used the method of Elitism and penalty parameters in order to improved fitness in the reproduction process, and optimum design is used steel(W-section) and pre-made discrete cross-section. Truss and frame structures optimization examples are used for 10-Bar truss, 25-Bar truss, 1-bay 2-story frame, 1-bay 7-story frame, and these examples are employed to demonstrate the availability and serviceability of Genetic Algorithms for solving optimum design of truss and frame.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.04a
• /
• pp.35-38
• /
• 2001

본 논문에서는 이동 컴퓨팅 환경에서 발생하는 실시간 이동 트랜잭션을 효율적으로 처리하기 위한 트랜잭션 관리자를 제안한다. 제안된 트랜잭션 관리자는 기존의 종료시한만 고려하던 방법과는 달리 이동 호스트 때문에 발생하는 실시간 데이터의 유효성도 함께 고려하여 트랜잭션의 실행여부를 판단한다. 그 후, 트랜잭션의 중요도와 종료시한을 고려한 우선순위 큐에 최적의 실행 윈도우를 생성하여 스케줄링하고, 실행될 트랜잭션을 선택할 때는 이동 호스트와의 접속 단절을 고려한다. 따라서, 제안된 기법은 실시간 데이터의 유효성 제약조건 위반에 따른 트랜잭션의 철회 후 재시작을 감소시키며, 종료시한을 만족시키는 실시간 이동 트랜잭션의 중요도의 합을 최대로 하는 장점을 가진다. 이 기법은 이동 통신, 응급 재난 구조 시스템 등에서 발생하는 실시간 이동 트랜잭션의 관리자로 적합하다.

• The KIPS Transactions:PartD
• /
• v.8D no.5
• /
• pp.533-542
• /
• 2001

In this paper, we present a scheduling method for real-time mobile transaction manager in mobile computing environment. The proposed method checks whether a transaction is executable or not. It is able to by considering not only the deadline of real-time data in mobile hosts. And then, it schedules the real-time mobile transactions by making optimal execution window based on the priority queue, while considering transaction value and deadline. Disconnection with mobile hosts is monitored in selecting the transaction for execution. Using the proposed method reduces the number of restarting times after transaction aborts which is caused by the violation of the validity constraints of real-time data. And in has merits of maximizing the sum of values of real-time mobile transactions which meet the deadline. The performance evaluation demonstrates that the number of committed real-time transactions within the deadline is improved by 20%. This method can be used in real-time mobile transaction manager is such environments as cellular communications, emergency medicine information system and so on.