• 한국통신학회논문지
• /
• 제41권11호
• /
• pp.1406-1409
• /
• 2016

본 논문에서는 송수신단 간 변조기법 및 채널 상태 값이 약속되지 않은 완벽한 블라인드 통신 상황에서 송신측의 변조방식을 알아내기 위해 성좌도 회전 및 확률밀도함수(probability density function : pdf)를 이용한 새로운 자율 변조 구분(Automatic modulation classification : AMC)기법과 경험적 신호 그룹화 알고리즘을 통해 채널 상태 값을 추정하는 방법을 제안한다. 평균제곱근 편차(Root mean square error : RMSE) 및 심볼 오류율(Symbol error rate : SER) 등의 모의실험을 통해 제안된 기법과 기존의 다른 기법간의 채널 상태와 변조 추정 능력을 비교 평가한다.

• 한국지능시스템학회논문지
• /
• 제8권6호
• /
• pp.78-84
• /
• 1998

본 논문에서는 유전 알고리즘을 사용하는 퍼지 교통 제어기를 제안한다. 일반적인 퍼지 교통 제어기들은 사람에 의해 생성된 소속함수들을 사용한다. 그러나 이 방식은 퍼지 제어기를 설계하는데 최적의 해를 보장하지 못한다. 유전 알고리즘은 휴리스틱적인 특정 영역의 지식을 필요로 하는 최적화 문제의 좋은 해결 방법이다. 좋은 성능을 보이는 퍼지 소속함수를 찾기 위해서 적합도 함수가 정의되어야 한다. 그러나 교통 제어에서 적합도 함수를 수치 표현으로 정의하는 것은 쉽지 않다. 따라서 본 논문에서는 교통 시뮬레이터에 의해 얻어지는 성능척도로써 해의 적합도를 결정하는 시뮬레이션 접근법을 사용한다. 제안된 방법은 기존의 퍼지 제어기들에 비하여 우수한 성능을 보여준다.

• Journal of Communications and Networks
• /
• 제10권3호
• /
• pp.351-361
• /
• 2008

This paper presents a delay-margin based traffic engineering (TE) approach to provide end-to-end quality of service (QoS) in multi-protocol label switching (MPLS) networks using differentiated services (DiffServ) at the link level. The TE, including delay, class, and route assignments, is formulated as a nonlinear optimization problem reflecting the inter-class and inter-link dependency introduced by DiffServ and end-to-end QoS requirements. Three algorithms are used to provide a solution to the problem: The first two, centralized offline route configuration and link-class delay assignment, operate in the convex areas of the feasible region to consecutively reduce the objective function using a per-link per-class decomposition of the objective function gradient. The third one is a heuristic that promotes/demotes connections at different links in order to deal with concave areas that may be produced by a trunk route usage of more than one class on a given link. Approximations of the three algorithms suitable for on-line distributed TE operation are also derived. Simulation is used to show that proposed approach can increase the number of users while maintaining end-to-end QoS requirements.

• 한국정보통신학회논문지
• /
• 제4권2호
• /
• pp.397-406
• /
• 2000

유전자 알고리즘은 탐색, 최적화 및 기계 학습의 도구로 많이 사용되고 있는데, 구조는 단순하지만, 다양한 분야에서 적용되고 있다. 그리고 변화하는 환경에서 유연하게 대처 할 수 있는 자율운송장치의 능동적이고 효과적인 제어기에 관한 연구와 스스로 진화하여 학습할 수 있도록 하는 행동 기반 시스템에 관한 연구 또한 활발히 진행되고 있다. 퍼지 제어기 설계를 위한 소속 함수와 제어규칙의 구성 시 전문가의 경험적인 지식에 전적으로 의존하는 문제점을 가지고 있다. 본 논문에서는 자기 조직이 가능한 자율 운송 장치를 구성하기 위해서, 유전자 알고리즘을 이용하여 최적에 가깝도록 멤버십 함수를 조정했으며 제어규칙의 자기수정과 생성에 의해 제어 성능을 향상시켰다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권7호
• /
• pp.3393-3412
• /
• 2017

As a main challenge in network virtualization, virtual network embedding problem is increasingly important and heuristic algorithms are of great interest. Aiming at the problems of poor correlation in node embedding and link embedding, long distance between adjacent virtual nodes and imbalance resource consumption of network components during embedding, we herein propose a two-stage virtual network embedding algorithm NA-PVNM. In node embedding stage, resource requirement and breadth first search algorithm are introduced to sort virtual nodes, and a node fitness function is developed to find the best substrate node. In link embedding stage, a path fitness function is developed to find the best path in which available bandwidth, CPU and path length are considered. Simulation results showed that the proposed algorithm could shorten link embedding distance, increase the acceptance ratio and revenue to cost ratio compared to previously reported algorithms. We also analyzed the impact of position constraint and substrate network attribute on algorithm performance, as well as the utilization of the substrate network resources during embedding via simulation. The results showed that, under the constraint of substrate resource distribution and virtual network requests, the critical factor of improving success ratio is to reduce resource consumption during embedding.

• 한국공간구조학회논문집
• /
• 제15권2호
• /
• pp.87-94
• /
• 2015

This paper aimed at modeling a fine triangular grid for network dome by using Harmony Search (HS) algorithm. For this purpose, an optimization process to find a fine regular triangular mesh on the curved surface was proposed and the analysis program was developed. An objective function was consist of areas and edge's length of each triangular and its standard deviations, and design variables were subject to the upper and lower boundary which was calculated on the nodal connectivity. Triangular network dome model, which was initially consist of randomly irregular triangular mesh, was selected for the target example and the numerical result was analyzed in accordance with the HS parameters. From the analysis results of adopted model, the fitness function has been converged and the optimized triangular grid could be obtained from the initially distorted network dome example.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권12호
• /
• pp.5212-5230
• /
• 2016

How to determine the right number of small base stations to activate in multi-cell uplinks to match traffic from a fixed quantity of K users is an open question. This paper analyses the uplink cooperative that jointly receives base stations activation to explore this question. This paper is different from existing works only consider transmitting power as optimization objective function. The global objective function is formulated as a summation of two terms: transmitting power for data and coordinated overhead for control. Then, the joint base stations activation and beamforming problem is formulated as a mixed integer second order cone optimization. To solve this problem, we develop two polynomial-time distributed methods. Method one is a two-stage solution which activates no more than K small base stations (SBSs). Method two is a heuristic algorithm by dual decomposition to MI-SOCP that activates more SBSs to obtain multiple-antennae diversity gains. Thanks to the parallel computation for each node, our methods are more computationally efficient. The strengths and weaknesses of these two proposed two algorithms are also compared using numerical results.

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

This paper presents an optimal fuzzy power system stabilizer to damp out low frequency oscillation. So far fuzzy controllers have been applied to power system stabilizing controllers due to its excellent properties on the nonlinear systems. But the design process of fuzzy logic power system stabilizer requires empirical and heuristic knowledge of human experts as well as many trial-and-errors in general. This paper presents and optimal design method of the fuzzy logic stabilizer using the genetic algorithm. Non-symmetric membership functions are optimally tuned over an evaluation function. The present inputs of fuzzy stabilizer are torque angle error and the change of torque angle error without loss of generality. The coding method used in this paper is concatenated binary mapping. Each linguistic fuzzy variable, defined as the peak of a membership function, is assigned by the mapping from a minimum value to a maximum value using eight bits. The tournament selection and the elitism are used to keep the worthy individuals in the next generation. The proposed system is applied to the one-machine infinite-bus model of a power system, and the results showed a promising possibility.

• 한국군사과학기술학회지
• /
• 제23권4호
• /
• pp.381-388
• /
• 2020

Weapon target assignment problem is an essential technology for automating the operator's rapid decision-making support in a battlefield situation. Weapon target assignment problem is a kind of the optimization problem that can build up an objective function by maximizing the number of threat target destructed or maximizing the survival rate of the protected assets. Weapon target assignment problem is known as the NP-Complete, and various studies have been conducted on it. Among them, a greedy heuristic algorithm which guarantees (1-1/e) approximation has been considered a very practical method in order to enhance the applicability of the real weapon system. In this paper, we formulated the weapon target assignment problem for supporting decision-making at the level of artillery. The lazy strategy based on hierarchical structure is proposed to accelerate the greedy algorithm. By experimental results, we show that our algorithm is more efficient in processing time and support the same level of the objective function value with the basic greedy algorithm.

• 전기학회논문지
• /
• 제68권1호
• /
• pp.172-181
• /
• 2019

This paper deals with the problem of generating the energy optimal trajectory which is intended to enhance the target tracking performance of a passive homing missile. Noticing that the essence of passive target tracking is the range estimation problem, the target information gathered by passive measurements can be readily analyzed by introducing the range estimator designed in line-of-sight(LOS) frame. Moreover, for the linear filter structure of the suggested range estimator, the cost function associated with the target information is clearly expressed as a function of the line-of-sight rate. Based on this idea, the optimal missile trajectory maximizing the target information is obtained by solving the saddle point problem for an indefinite quadratic cost which consists of the target information and the energy. It is shown that, different from the previous heuristic approaches, the guidance command producing the optimal passive homing trajectory is produced by the modified proportional navigation guidance law whose navigation constant is determined by the weighting coefficient for target information cost.