• Journal of Communications and Networks
• /
• 제8권1호
• /
• pp.116-122
• /
• 2006

Most of the multimedia applications require strict quality of service (QoS) guarantee during the communication between a single source and multiple destinations. This gives rise to the need for an efficient QoS multicast routing strategy. Determination of such QoS-based optimal multicast routes basically leads to a multi-objective optimization problem, which is computationally intractable in polynomial time due to the uncertainty of resources in Internet. This paper describes a network model for researching the routing problem and proposes a new multicast tree selection algorithm based on genetic algorithms to simultaneously optimize multiple QoS parameters. The paper mainly presents a QoS multicast routing algorithm based on genetic algorithm (QMRGA). The QMRGA can also optimize the network resources such as bandwidth and delay, and can converge to the optimal or near-optimal solution within few iterations, even for the networks environment with uncertain parameters. The incremental rate of computational cost can close to polynomial and is less than exponential rate. The performance measures of the QMRGA are evaluated using simulations. The simulation results show that this approach has fast convergence speed and high reliability. It can meet the real-time requirement in multimedia communication networks.

• 한국인터넷방송통신학회논문지
• /
• 제19권3호
• /
• pp.185-191
• /
• 2019

현대전에서는 다중 적기 편대가 침공할 경우 이를 무력화시키기 위해 지대공미사일 발사포대의 미사일로 효과적이면서도 빠르게 위협을 최소화시키는 전략이 필수적이다. 이 문제에 대해 Pan et al.은 유전자 알고리즘을 적용하여 해를 구하고자 하였으나 최적 해를 구하는데 실패하였다. 본 논문에서는 각 미사일 발사포대 가용 미사일의 75%로 고위협 목표물을 우선하여 파괴시키는 전략으로 초기 실현 가능 해를 구하였다. 다음으로 각 발사포대에 배정된 미사일 1발을 감소시켜 총 위협을 보다 감소시킬 수 있는 다른 목표물로 이동시키는 최적화 기법을 제안하였다. 실험 결과 제안된 알고리즘은 다항시간 수행 복잡도의 탐욕 알고리즘임에도 불구하고 메타휴리스틱 기법인 유전자 알고리즘에 비해 해를 개선하는 결과를 얻었다.

• 한국인터넷방송통신학회논문지
• /
• 제19권2호
• /
• pp.221-227
• /
• 2019

무기 목표물 배정 문제는 지금까지 다항시간 알고리즘이 제안되지 않는 NP-hard 문제로 알려져 왔다. 그럼에도 불구하고, 본 문제에 대해 가능한 모든 경우수를 검증하는 Brute-Force 법이나 분기한정법으로 최적 해를 구하거나 유전자 알고리즘, 입자군 최적화 등의 인공지능 방법으로 근사 해를 구하는 방법들이 제안되고 있다. 본 논문에서는 단지 무기의 총 대수 k, 무기 종류 수 m, 목표물 개수 n에 대해 O(mn)을 k회 수행하는 O(kmn) 다항시간으로 최적 해를 구하는 알고리즘을 제안하였다. 제안된 알고리즘은 Brute-Force 법에 비해 수행횟수를 최소화 시킬 뿐 아니라 최적해도 구하는 장점을 갖고 있다.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제51권4호
• /
• pp.129-136
• /
• 2002

This paper presents a $H_{\infty}$ robust controller with parameter estimation in polynomial approach. For good performance of a uncertain system, the parameters are estimated by RLS algorithm. The controller minimizes the sum of $H_{\infty}$ norm between sensitivity function and complementary sensitivity function by employing the Youla parameterization and polynomial approach at the same time. A numerical example and its simulation results are given to show the validity of the proposed controller.

• 한국인터넷방송통신학회논문지
• /
• 제23권1호
• /
• pp.151-156
• /
• 2023

본 논문은 주어진 예산과 광고를 접하는 최소 인원수를 초과하는 제약조건을 만족시키면서 신제품에 대한 인지도를 극대화시키기 위해 다수의 광고매체들 중에서 어느 광고매체를 몇 회 광고해야 하는지를 결정하는 최적화 문제를 다룬다. 본 문제에 대해 지금까지는 선형계획법 (LP) 소프트웨어 패키지를 활용하는 수학적 접근법만이 활용되고 있으며, 다항시간 알고리즘은 제안되지 않고 있는 실정이다. 본 논문은 이 문제에 대해 O(nlog n) 수행 복잡도의 다항시간으로 최적 해를 얻을 수 있는 휴리스틱 알고리즘을 제안한다. 제안된 방법은 광고매체를 가장 경제적으로 선정하는 평가기준을 제안하였으며, 이 평가기준을 적용하여 광고매체 선정과 광고횟수를 결정하였다. 제안된 알고리즘은 Excel을 활용하였음에도 불구하고, 실험 데이터에 적용한 결과 LP와 동일한 결과를 얻었다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2000년도 하계학술대회 논문집 D
• /
• pp.2946-2948
• /
• 2000

In this paper, we proposed the Fuzzy Polynomial Neural Networks(FPNN) model with fuzzy activation node. The proposed FPNN structure is generated from the mutual combination of PNN(Polynomial Neural Networks) structure and fuzzy inference system. The premise of fuzzy inference rules defines by triangular and gaussian type membership function. The fuzzy inference method uses simplified and regression polynomial inference method which is based on the consequence of fuzzy rule expressed with a polynomial such as linear, quadratic and modified quadratic equation are used. The structure of FPNN is not fixed like in conventional Neural Networks and can be generated. The design procedure to obtain an optimal model structure utilizing FPNN algorithm is shown in each stage. Gas furnace time series data used to evaluate the performance of our proposed model.

• 대한수학회보
• /
• 제46권1호
• /
• pp.183-198
• /
• 2009

In this paper, we derive a characterization of orthonormal balanced multiwavelets of order p in terms of the continuous moments of the multiscaling function $\phi$. As a result, the continuous moments satisfy the discrete polynomial preserving properties of order p (or degree p - 1) for orthonormal balanced multiwavelets. We derive polynomial reproduction formula of degree p - 1 in terms of continuous moments for orthonormal balanced multiwavelets of order p. Balancing of order p implies that the series of scaling functions with the discrete-time monomials as expansion coefficients is a polynomial of degree p - 1. We derive an algorithm for computing the polynomial of degree p - 1.

• 대한원격탐사학회지
• /
• 제19권5호
• /
• pp.363-370
• /
• 2003

This paper describes a rectification procedure that relies on a polynomial model derived from the imaging geometry without loss of accuracy. By using polynomial model, one can effectively eliminate the iterative process to find an image pixel corresponding to each output grid point. With the imaging geometry and ephemeris data, a geo-location polynomial can be constructed from grid points that are produced by solving three equations simultaneously. And, in order to correct the local distortions induced by the geometry and terrain height, a distortion model has been incorporated in the procedure, which is a function of incidence angle and height at each pixel position. With this function, it is straightforward to calculate the pixel displacement due to distortions and then pixels are assigned to the output grid by re-sampling the displaced pixels. Most of the necessary information for the construction of polynomial model is available in the leader file and some can be derived from others. For validation, sample images of ERS-l PRI and Radarsat-l SGF have been processed by the proposed method and evaluated against ground truth acquired from 1:25,000 topography maps.

• 한국컴퓨터정보학회논문지
• /
• 제20권11호
• /
• pp.69-75
• /
• 2015

This paper suggests heuristic polynomial time algorithm for crew scheduling problem that is a kind of optimization problems. This problem has been solved by linear programming, set cover problem, set partition problem, column generation, etc. But the optimal solution has not been obtained by these methods. This paper sorts transit costs $c_{ij}$ to ascending order, and the task i and j crew paths are merged in case of the sum of operation time ${\Sigma}o$ is less than day working time T. As a result, we can be obtain the minimum number of crews $_{min}K$ and minimum transit cost $z=_{min}c_{ij}$. For the transit cost of specific number of crews $K(K>_{min}K)$, we delete the maximum $c_{ij}$ as much as the number of $K-_{min}K$, and to partition a crew path. For the 5 benchmark data, this algorithm can be gets less transit cost than state-of-the-art algorithms, and gets the minimum number of crews.

• 대한산업공학회지
• /
• 제16권1호
• /
• pp.17-25
• /
• 1990

Most of the least cost transportation network design problems are frequently formulated as the minimum spanning arborescence problems in directed networks with bitype are costs. These costs are classified whether the arc is included in the path from the root to a specified node over a given spanning arborescence. We prove that this problem is NP-hard, and develop a polynomial time algorithm for acyclic networks. The probelm in acyclic networks is initially formulated as 0-1 integer programming. Next, we prove that the 0-1 relaxed linear programming has an integral optimum solution by complementary slackness conditions. In this paper, we present an $O(n^2)$ algorithm based on a shortest path algorithm.