• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2011년도 제42회 하계학술대회
• /
• pp.412-413
• /
• 2011

This paper presents a new generation rescheduling approach for preventive control of power systems, which can optimally reallocate power generations for unstable contingencies. The transient stability constraints used in the optimal rescheduling model are described by energy margin sensitivity. Especially the energy margin sensitivity is evaluated for change with respect to generation. For a given contingency, the energy margin is computed and the respective sensitivities are also computed.

• International Journal of Contents
• /
• 제3권2호
• /
• pp.25-29
• /
• 2007

In this paper, we discuss the mesh segmentation problem which divides a given 3D mesh into several disjoint sets. To solve the problem, we propose a greedy method based on the merging priority metric defined for representing the geometric properties of meaningful parts. The proposed priority metric is a weighted function using five geometric parameters, those are, a distribution of Gaussian map, boundary path concavity, boundary path length, cardinality, and segmentation resolution. In special, we can control by setting up the weight values of the proposed geometric parameters to obtain visually better mesh segmentation. Finally, we carry out an experiment on several 3D mesh models using the proposed methods and visualize the results.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1992년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 19-21 Oct. 1992
• /
• pp.55-60
• /
• 1992

The IEEE 802.4 priority mechanism can be used to handle multiple data access classes of traffic. Several timers are used to realize the priority mechanism. The performance and stability of a token bus network depend on the assignment of such timers. In this peper, we present a dynamic timer assignment algorithm for the token passing bus network. The presented algorithm has simple structure for real-time applications and adaptively controls the set of initial timer values according to the offered traffic load. The assignment of the set of timers becomes easy due to the presented algorithm. Based on the iterative algorithm, some solutions such as mean waiting time are derived.

• ETRI Journal
• /
• 제37권3호
• /
• pp.626-636
• /
• 2015

This paper proposes an adaptive multimodal in-vehicle information system for safe driving. The proposed system filters input information based on both the priority assigned to the information and the given driving situation, to effectively manage input information and intelligently provide information to the driver. It then interacts with the driver using an adaptive multimodal interface by considering both the driving workload and the driver's cognitive reaction to the information it provides. It is shown experimentally that the proposed system can promote driver safety and enhance a driver's understanding of the information it provides by filtering the input information. In addition, the system can reduce a driver's workload by selecting an appropriate modality and corresponding level with which to communicate. An analysis of subjective questionnaires regarding the proposed system reveals that more than 85% of the respondents are satisfied with it. The proposed system is expected to provide prioritized information through an easily understood modality.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.60.3-60
• /
• 2001

Usually the static scheduling algorithms such as DMS(Deadline Monotonic Scheduling) or RMS(Rate Monotonic Scheduling) are used for CAN scheduling due to its ease with implementation. However, due to their inherently low utilization of network media, some dynamic scheduling approaches have been studied to enhance the utilization. In case of dynamic scheduling algorithms, two considerations are needed. The one is a priority inversion due to rough deadline encoding into stricted arbitration fields of CAN. The other is an arbitration delay due to the non-preemptive feature of CAN. In this paper, an extended algorithm is proposed from an existing EDS(Earliest Deadline Scheduling) approach of CAN scheduling algorithm having a solution to the priority inverstion ....

• Nuclear Engineering and Technology
• /
• 제55권11호
• /
• pp.4282-4286
• /
• 2023

Nuclear energy is estimated by the machine learning method as the mathematical quantifications where neural networking is the major algorithm of the data propagations from input to output. As the aspect of nuclear energy, the other energy sources of the traditional carbon emission-characterized oil and coal are compared. The artificial intelligence (AI) oriented algorithm like the intelligence of a robot is applied to the modeling in which the mimicking of biological neurons is utilized in the mathematical calculations. There are graphs for nuclear priority weighted by climate factor and for carbon dioxide mitigation weighted by climate factor in which the carbon dioxide quantities are divided by the weighting that produces some results. Nuclear Priority and CO2 Mitigation values give the dimensionless values that are the comparative quantities with the normalization in 2010. The values are 1.0 in 2010 of the graphs which are changed to 24.318 and 0.0657 in 2040, respectively. So, the carbon dioxide emissions could be reduced in this study.

• 한국컴퓨터정보학회논문지
• /
• 제25권1호
• /
• pp.21-27
• /
• 2020

본 논문에서는 전투관리체계의 QoS를 향상시키기 위해 동적 가중 결손 라운드로빈과 우선 순위 기반의 혼합 스케줄링 알고리즘을 제안한다. 제안된 알고리즘인 DWDRR은 큐의 트래픽과 중요도에 따라 가중치를 동적으로 부여하여 패킷을 전송하는 방법이다. 제안된 알고리즘의 타당성을 분석하기 위해 모의실험을 통해 제안된 알고리즘이 특정구간에서 높은 효율성을 나타내는 것을 증명하였다. 따라서 기존의 알고리즘과 제안된 알고리즘을 혼합하여 사용하는 방법을 제안한다. 또한, 빈번한 기법 전환을 방지하기 위해 히스테리시스 기법을 적용하였다. 제안한 알고리즘은 동일한 트래픽에서 기존 알고리즘보다 낮은 패킷 손실률과 지연 시간을 나타낸다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권9호
• /
• pp.3008-3028
• /
• 2022

In this paper, we investigate traffic scheduling for a delay-sensitive multi-hop relay network, and aim to minimize the priority-based end-to-end delay of different data packet via joint relay selection, subcarrier assignment, and power allocation. We first derive the priority-based end-to-end delay based on queueing theory, and then propose a two-step method to decompose the original optimization problem into two sub-problems. For the joint subcarrier assignment and power control problem, we utilize an efficient particle swarm optimization method to solve it. For the relay selection problem, we prove its convexity and use the standard Lagrange method to deal with it. The joint relay selection, subcarriers assignment and transmission power allocation problem for each hop can also be solved by an exhaustive search over a finite set defined by the relay sensor set and available subcarrier set. Simulation results show that both the proposed routing scheme and the resource allocation scheme can reduce the average end-to-end delay.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제53권10호
• /
• pp.714-719
• /
• 2004

The Controller Area Network (CAN) is being widely used in real-time control applications such as automobiles, aircraft, and automated factories. Unfortunately, CAN, in its current form, is not able to either share out the system bandwidth among the different devices fairly or to grant an upper bound on the transmission times experienced by the nodes connected to the communication medium as it happens, for instance, in the token-based networks. In this paper. we present the message scheduling for CAN, based on the distributed control scheme to integrate actuators and sensors in a humanoid robot. Besides introducing the new algorism, this paper also presents some performance figures obtained using a specially developed software simulator, while the behavior of the new algorism is compared with the traditional CAN systems, in order to see how effective they are.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2003년도 추계학술대회 논문집 전력기술부문
• /
• pp.444-446
• /
• 2003

This paper deals with an allocation strategy for the resources of direct load control program, which is considered the operating states in power systems. The existing approaches, load shedding priority algorithm, curtailment payback based algorithm and mixed curtailment algorithm, are based on the uniform allocation strategy. These approaches are not taken into account the operating states in power systems. So, under the critical operating condition, direct load control resource is evaluated by introducing the congestion factor.