• 한국통신학회논문지
• /
• 제19권2호
• /
• pp.276-283
• /
• 1994

백터양자와를 위한 신경망을 사용은 그것의 적응적 설계 특성으로 더 좋은 코드북을 설계할 수 있을 것으로 기대되며, 또한 설계된 코드북의 코드워드는 자동정렬되어 실시간 탐색을 가능케 한다. 신경망의 이러한 장점을 살리기 위하여 본 논문에서는 KSFM(Kohonen`s Self-organizing Feature Map)을 수정하고, K-means 알고리즘을 결함한 새로운 코드북 설계 할고리즘을 제안한다. 실험결과로 부터 제안된 알고리즘의 성능향상과 실시간 처리를 위한 코드북의 부분탐색 가능성을 확인하였다.

• ETRI Journal
• /
• 제27권2호
• /
• pp.231-234
• /
• 2005

This letter proposes a new embedded speech coding structure based on the Adaptive Multi-Rate Wideband (AMR-WB) standard codec. The proposed coding scheme consists of three different bitrates where the two lower bitrates are embedded into the highest one. The embedded bitstream was achieved by modifying the algebraic codebook search procedure adopted for the AMR-WB codec. The proposed method provides the advantage of scalability due to the embedded bitstream, while it inevitably requires some additional computational complexity for obtaining two different code vectors of the higher bitrate modes. Compared to the AMR-WB codec, the embedded coder shows improved speech qualities for two higher bitrate modes with a slightly increased bitrate caused by the decreased coding efficiency of the algebraic codebook.

• ETRI Journal
• /
• 제29권6호
• /
• pp.826-828
• /
• 2007

Efficient downscaling in a transcoder is important when the output should be converted to a lower resolution video. In this letter, we suggest an efficient algorithm for transcoding from MPEG-4 SP (with simple profile) to H.264/AVC with spatial downscaling. First, target image blocks are classified into monotonous, complex, and very complex regions for fast mode decision. Second, adaptive search ranges are applied to these image classes for fast motion estimation in an H.264/AVC encoder with predicted motion vectors. Simulation results show that our transcoder considerably reduces transcoding time while video quality is kept almost optimal.

• 한국해양공학회:학술대회논문집
• /
• 한국해양공학회 2000년도 춘계학술대회 논문집
• /
• pp.96-103
• /
• 2000

This research is a new design method, which will be presented as a basic concept for a more efficient minimum weight design of grillages, as an attempt to describe true collapse mechanism in as overall search as possible. It serves as introduction to the numerical technique of Linear Programming(LP) and Automatic Modified Direct Plastic Frame Analysis(AMDPFA). Attention is directed to both analysis and design, and emphasis is placed on the physical significance of Systematic Searching Techniques(SST) involved. In weight minimum grillages design, the parameterisation study in optimum beam configuration which was carried out over the range of beam sections for a given plastic section modulus likely to occur in structures by suing an adaptive stochastic optimisation technique, Genetic Algorithms.

• Journal of Advanced Marine Engineering and Technology
• /
• 제21권3호
• /
• pp.293-301
• /
• 1997

Edge detection is the first step and very important step in image analysis. We cast edge detec¬tion as a problem in cost maximization. This is acheived by the formulation of a cost function that evaluates the quality of edge configurations. The cost function can be used as a basis for compar¬ing the performances of different detectors. We used a Genetic Algorithm for maximizing cost func¬tion. Genetic algorithms are a class of adaptive search techniques that have been intensively stud¬ied in recent years and have been prone to converge prematurely before the best solution has been found. This paper shows that carefully chosen modifications(three factors of the crossover opera¬tor) are implemented can be effective in alleviating this problem.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2006년도 춘계공동학술대회 논문집
• /
• pp.1178-1185
• /
• 2006

컨테이너 터미널에서의 생산성은 본선작업의 효율성과 밀접한 관련이 있다. 효율적인 본선작업을 위한 첫 번째 단계는 선석에서 컨테이너를 취급하는 장비인 안벽크레인(Quay Crane : QC)에 대하여 효율적인 작업일정계획을 수립하는 것이다. 일반적으로 안벽크레인의 작업일정계획은 선박내의 장치계획에 관한 정보와 장치장의 장치현황정보등 많은 정보를 활용해야 하며, 선박의 안정성과 크레인의 작업용이성 등 다양한 제약사항을 고려하여야 한다. 따라서 본 연구에서는 인공지능기법 중 최적에 가까운 해를 찾아주는 탐색기법인 GRASP(Greedy Randomized Adaptive Search Procedure)를 적용하여 실제 현장에서 적용 가능한 안벽크레인 작업일정계획기법을 제안하였다. 또한, 컨테이너 터미널의 실제 자료를 수집하여 제안된 메타휴리스틱 알고리즘의 성능을 분석하였다.

• 전자공학회논문지B
• /
• 제32B권12호
• /
• pp.1680-1686
• /
• 1995

GAs, effective stochastic search algorithms based on the model of natural evolution and genetics, have been successfully applied to various optimization problems. When population size is not large, GAs often suffer from the phenomenon of premature convergence in which all chromosomes in the population lose the diversity of genes before they find the optimal solution. In this paper, we propose that a new heuristic that maintains the diversity of genes by adding some chromosomes with random mutation and selective mutation into population during evolution. And population size changes dynamically with supplement of new chromosomes. Experimental results for several test functions show that when population size is rather small and the length of chromosome is not long, this method is effective.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권6호
• /
• pp.1101-1112
• /
• 2011

The Multiuser Eigenmode Transmission (MET) has generated significant interests in literature due to its optimal performance in linear precoding systems. The MET can simultaneously transmit several spatial multiplexing eigenmodes to multiple users which significantly enhance the system performance. The maximum number of users that can be served simultaneously is limited due to the constraints on the number antennas, and thus an appropriate user selection is critical to the MET system. Various algorithms have been developed in previous works such as the enumerative search algorithm. However, the high complexities of these algorithms impede their applications in practice. In this paper, motivated by the necessity of an efficient and effective user selection algorithm, a low complexity recursive user selection algorithm is proposed for the MET system. In addition, the fairness of the MET system is improved by using the combination of the proposed user selection algorithm and the adaptive Proportional Fair Scheduling (PFS) algorithm. Extensive simulations are implemented to verify the efficiency and effectiveness of the proposed algorithm.

• 천문학회지
• /
• 제49권4호
• /
• pp.123-126
• /
• 2016

Microlensing is generally thought to probe planetary systems only out to a few Einstein radii. Microlensing events generated by bound planets beyond about 10 Einstein radii generally do not yield any trace of their hosts, and so would be classified as free floating planets (FFPs). I show that it is already possible, using adaptive optics (AO), to constrain the presence of potential hosts to FFP candidates at separations comparable to the Oort Cloud. With next-generation telescopes, planets at Kuiper-Belt separations can be probed. Next generation telescopes will also permit routine vetting for all FFP candidates, simply by obtaining second epochs 4-8 years after the event. At present, the search for such hosts is restricted to within the "confusion limit" of θ_confus ∼ 0.25′′, but future WFIRST (Wide Field Infrared Survey Telescope) observations will allow one to probe beyond this confusion limit as well.

• 제어로봇시스템학회논문지
• /
• 제18권1호
• /
• pp.21-27
• /
• 2012

We can efficiently collect crops or minerals by operating multi-robot foraging. As foraging spaces become wider, control algorithms demand scalability and reliability. Swarm robotics is a state-of-the-art algorithm on wide foraging spaces due to its advantages, such as self-organization, robustness, and flexibility. However, high initial and operating costs are main barriers in performing multi-robot foraging system. In this paper, we propose a novel method to improve the energy efficiency of the system to reduce operating costs. The idea is to employ a new behavior model regarding role division in concert with the search space division.