• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2001년도 추계학술대회논문집B
• /
• pp.837-841
• /
• 2001

Almost all power plant boiler has temperature distribution nonuniformity problem in heat transfer tube flow path. It can cause hot spot damage of superheated or reheated heat transfer section and reduce maintenance schedule when nonuniformity is severe. There are two solutions for improvement temperature nonuniformity. one is change of gas flow distribution of gas path and the other is contorl steam flow in tube bank. Of course, first method is very difficulty to apply but second method is'nt. In this paper, control steam flow is used to solve temperature nonuniformity of power plant boiler.

• 정보통신설비학회논문지
• /
• 제8권4호
• /
• pp.195-200
• /
• 2009

In this paper, we propose a new priority Optical Burst Switching (OBS) protocol based on a hop count, which can provide an efficient utilization in optical wireless networks. Under several legacy schemes, a switch drops the burst with a shorter time among ones regardless of its traversed hop count. As a result, the dropped burst that have been traversed more hops might cause to waste bandwidth than the one traversed a few hops. Noting that this problem, we propose a Just Enough Time (JET) with a hop count scheme which can reduce the wasted bandwidth by prioritizing the burst traversed more hops over others. The simulation results shows that the proposed scheme has more advantages over the legacy schemes in terms of the burst blocking probability and the link utilization.

• 한국경영과학회지
• /
• 제15권2호
• /
• pp.17-31
• /
• 1990

This problem analyzed in this paper is to specify a schedule for thesis committee allowing maximum committee members' preference over thesis topics and meeting time-slots while satisfying other related scheduling requirements such as prohibiting simultaneous assignment of a committee member to more than one committee at a time. Two mathematical programming applroaches are presented to solve the thesis committee scheduling problem in a professional graduate school. They include LP-based branch-and-bound approach with network subproblems. Characterization of the problem is analyzed to develop an efficient solution algorithm. Implementation and computational experiments are also performed for real size problems on an IBM PC/AT to show the relative performance of the propsoed approaches along with an ordinary ILP solution approach.

• 한국건축시공학회:학술대회논문집
• /
• 한국건축시공학회 2012년도 춘계 학술논문 발표대회
• /
• pp.341-343
• /
• 2012

This study introduces a method for computation of process and operation gap in the specific construction operation(i.e., RC frame construction applying a block-grouping scheme) using CYCLONE-based simulation modeling and analysis technique. Since uncertainty of construction environment exists, a thoughtful production planning is required to effectively deal with a risk resulting in schedule delay in advance. This study presents the concepts of a time delay occurred in a process level and operation level in a operation model, and a method of measuring gap-times in each level while the simulation progresses. It helps a site manager to decide how many segmentation in a construction block is suitable for eliminating unproductive time-delays under the constrained resources (e.g., laborer, equipment). A case study presents a network model representing a three segmented RC frame work, and result obtained from the simulation experiment.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2012년도 한국컴퓨터종합학술대회논문집 Vol.39 No.1(B)
• /
• pp.390-392
• /
• 2012

인공비서 에이전트는 일정관리 및 추천을 할 때 일정이 비어 있는 시간을 계산하는 비교적 간단한 방식을 사용하는데, 보다 유용한 추천을 위해서는 사용자의 상황과 일정의 수행 조건을 고려하여야 한다. 본 논문에서는 환경의 변화에 유연하게 대응할 수 있는 행동선택 네트워크를 사용하는 일정추천 에이전트를 개발한다. Maes가 제안한 행동선택 네트워크를 현실적인 문제에 적용하는 데는 목적과 행동 노드의 개수가 크게 늘어나면 문제가 있다. 이를 해결하기 위해 행동선택 네트워크를 모듈화 하여 목적간의 충돌을 방지하고, 모듈화를 할 때 선행 행동 연결을 통한 모듈간의 사라진 연결을 보완하며, 목적들 간의 연관관계를 표현하기 위한 상위 행동선택 네트워크를 두는 계층적 행동선택 네트워크 방식을 제안한다. 제안하는 방법을 사용하여 몇가지 시나리오에 따른 일정추천 실험을 통하여 제안한 에이전트의 유용성을 확인하였다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1998년도 하계학술대회 논문집 C
• /
• pp.1042-1045
• /
• 1998

The main purpose of HITES(Highly Integrate Total Energy System) is to build and develop an integrated energy system for power system operational planning and analysis which consists of load forecast, economic generation schedule, stability analysis and relational database system. The integrated energy system can be utilized to supply a stable electric power and operate KEPCO power system facilities economically. This system will be put into operation in 1999. This paper describes the main feature of the HITES, system main functions, numerical methods adopted this system, and network configuration.

• Journal of Communications and Networks
• /
• 제17권2호
• /
• pp.203-209
• /
• 2015

Although mobile applications are an essential characteristic of wireless sensor networks, most existing media access control (MAC) protocols focus primarily on static networks. In these protocols, fixed periodic neighbor discovery and schedule updating are used to connect and synchronize neighbors to provide successful data transmission; however, they cannot adapt to mobile speed variation and degrade the network performance dramatically. In this paper, we propose a mobile-supporting mechanism for MAC protocols, in which the decision to update the neighbors of a mobile node is made adaptively according to the mobile speed. Analysis and simulation results demonstrate that the mechanism efficiently avoids the disconnection of amobile node from its neighbors and achieves a better performance as compared with fixed periodic neighbor discovery.

• 대한전기학회논문지:전력기술부문A
• /
• 제48권4호
• /
• pp.371-378
• /
• 1999

This paper presents an efficient algorithm for loss reduction of distribution system by automatic sectionalizing switch operation in large scale distribution systems of radial type. Simulated Annealing algorithm among optimization techniques can avoid escape from local minima by accepting improvements in cost, but the use of this algorithm is also responsible for an excessive computation time requirement. To overcome this major limitation of Simulated Annealing algorithm, we may use advanced Simulated Annealing algorithm. All constaints are divided into two constraint group by using perturbation mechanism and penalty factor, so all trail solutions are feasible. The polynomial-time cooling schedule is used which is based on the statistics calculation during the search. This approaches results in saving CPU time. Numerical examples demonstrate the validity and effectiveness of the proposed methodology.

• 정보통신설비학회논문지
• /
• 제9권1호
• /
• pp.7-12
• /
• 2010

In this paper, we propose a new prioritized Optical Burst Switching (OBS) protocol based on a hop count, which can provide an efficient utilization in optical Wireless networks. Under several legacy schemes, a switch drops the burst with a shorter time among ones regardless of its traversed hop counts. As a result, the dropped burst that have been traversed more hops might cause to waste bandwidth than the one traversed a few hops. Noting that this problem, we propose the Just Enough Time (JET) with a hop count scheme which can reduce the wasted bandwidth by prioritizing the burst traversed more hops over others. From the simulation result, we show that the proposed scheme is advantageous over the legacy schemes in terms of the burst blocking probability and the link utilization.

• 한국정보처리학회논문지
• /
• 제7권10호
• /
• pp.3055-3063
• /
• 2000

본 논문에서는 공유 메모리 다중 프로세서 시스템에서 태스크 중복을 기반으로 하는 휴리스틱 스케줄링 알고리즘을 제안한다. 제안된 알고리즘에서는 공유 메모리에서 통신할 때 발생되는 충돌을 방지하기 위하여 네트웍 통신 자원을 우선 할당하고, 스케줄링 길이를 단축하고 병렬처리 시간을 줄이기 위한 중복 태스크를 선택할 때 휴리스틱을 사용한다. 제안된 알고리즘은 태스크 그래프를 입력으로 받아 다중 프로세서로 스케줄링하며, 시스템에서 사용 가능한 프로세서의 수에 맞도록 태스크를 스케줄링 할 수 있다. 시뮬레이션에서는 제안된 알고리즘을 실제 응용프로그램의 태스크 그래프에 적용하였으며, 프로세서 수의 변화에 따른 스케줄링 길이를 비교하여 제안된 알고리즘의 성능이 우수함을 보여주었다.