• Structural Engineering and Mechanics
• /
• v.52 no.2
• /
• pp.351-368
• /
• 2014

This study presents a hunting search based optimum design algorithm for engineering optimization problems. Hunting search algorithm is an optimum design method inspired by group hunting of animals such as wolves, lions, and dolphins. Each of these hunters employs hunting in a different way. However, they are common in that all of them search for a prey in a group. Hunters encircle the prey and the ring of siege is tightened gradually until it is caught. Hunting search algorithm is employed for the automation of optimum design process, during which the design variables are selected for the minimum objective function value controlled by the design restrictions. Three different examples, namely welded beam, cellular beam and moment resisting steel frame are selected as numerical design problems and solved for the optimum solution. Each example differs in the following ways: Unlike welded beam design problem having continuous design variables, steel frame and cellular beam design problems include discrete design variables. Moreover, while the cellular beam is designed under the provisions of BS 5960, LRFD-AISC (Load and Resistant Factor Design-American Institute of Steel Construction) is considered for the formulation of moment resisting steel frame. Levy Flights is adapted to the simple hunting search algorithm for better search. For comparison, same design examples are also solved by using some other well-known search methods in the literature. Results reveal that hunting search shows good performance in finding optimum solutions for each design problem.

• Journal of Communications and Networks
• /
• v.16 no.5
• /
• pp.512-522
• /
• 2014

This paper proposes fast millimeter-wave (mm-wave) beam training protocols with receive beamforming. Both IEEE standards and the academic literature have generally considered beam training protocols involving exhaustive search over all possible beam directions for both the beamforming initiator and responder. However, this operation requires a long time (and thus overhead) when the beamwidth is quite narrow such as for mm-wave beams ($1^{\circ}$ in the worst case). To alleviate this problem, we propose two types of adaptive beam training protocols for fixed and adaptive modulation, respectively, which take into account the unique propagation characteristics of millimeter waves. For fixed modulation, the proposed protocol allows for interactive beam training, stopping the search when a local maximum of the power angular spectrum is found that is sufficient to support the chosen modulation/coding scheme. We furthermore suggest approaches to prioritize certain directions determined from the propagation geometry, long-term statistics, etc. For adaptive modulation, the proposed protocol uses iterative multi-level beam training concepts for fast link configuration that provide an exhaustive search with significantly lower complexity. Our simulation results verify that the proposed protocol performs better than traditional exhaustive search in terms of the link configuration speed for mobile wireless service applications.

• Annual Conference on Human and Language Technology
• /
• 1998.10c
• /
• pp.281-286
• /
• 1998

구문분석(syntactic analysis)은 형태소 분석된 결과를 입력으로 받아 구문단위간의 관계를 결정해 주는 자연어 처리의 한 과정이다. 그러나 구문분석된 결과는 많은 중의성(ambiguity)을 갖게 되며, 이러한 중의성은 이후의 자연어 처리 수행과정에서 많은 복잡성(complexity)를 유발하게 된다. 지금까지 이러한 문제를 해결하기 위한 여러 가지 연구들이 있었으며, 그 중 하나가 대량의 데이터로부터 추출된 통계치를 이용한 방법이다. 그러나, 생성된 모든 구문 트리(parse tree)에 통계치를 부여하고, 그것들을 순위화하는 것은 굉장히 시간 소모적인 일(time-consuming job)이다. 그러므로, 생성 가능한 트리의 수를 효과적으로 줄이는 방법이 필요하다. 본 논문에서는 이러한 문제를 해결하기 위해 개선된 beam search 알고리즘을 제안하고, 기존의 방법과 비교한다. 본 논문에서 제안된 beam search 알고리즘을 사용한 구문분석기는 beam search를 사용하지 않은 구문분석기가 생성하는 트리 수의 1/3정도만으로도 같은 구문 구조 정확률을 보였다.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 1998.10a
• /
• pp.315-322
• /
• 1998

It is discussed how to route yard-side equipment during the loading operation in port container terminals. The number of containers to be picked up at each yard-bay, as well as the route of a yard-side equipment (for example, transfer crane or straddle carrier) in a yard, are determined. The objective of the problem is to minimize the total container handling time in the yard. An encoding method to represent nodes in the search space is introduced utilizing inherent properties of the optimal solution by which the search space is greatly reduced. A beam search algorithm is suggested. A numerical experiment is carried out to compared the performance of the beam search algorithm with those of other approaches.

• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• pp.274-277
• /
• 2003

Millimeter-wave networking is composed of narrow beam link. High directivity of the beam provides either advantage or disadvantage in comparison with conventional wide-lobe microwave communications. In such networks, it is very substantial that beam connecting point to point is fixed in right direction. It is major requirement in the beam network to keep the beam in best direction. In this paper, We propose the method to find a best suited direction of the antenna's beam using the Genetic Algorithm in point-to-point link. Proposed method presume that each station knows his direction $\theta$$_1$,$\theta$$_2$ at every step of Genetic Algorithm, then it can be expected that GA is possible to search the ideal solution. Intensity of the received signal is evaluated by the multiplication of lengths to the point which the lobe meets with the horizontal line.

• Structural Engineering and Mechanics
• /
• v.73 no.5
• /
• pp.481-486
• /
• 2020

This paper deals with the buckling and optimization of a nanocomposite beam. The agglomeration of nanoparticles was assumed by Mori-Tanaka model. The harmony search optimization algorithm is adaptively improved using two adjusted processes based on dynamic parameters. The governing equations were derived by Timoshenko beam model by energy method. The optimum conditions of the nanocomposite beam- based proposed AIHS are compared with several existing harmony search algorithms. Applying DQ and Hs methods, the optimum values of radius and FS were obtained. The effects of thickness, agglomeration, volume percent of CNTs and boundary conditions were assumed. The results show that with increasing the volume percent of CNTs, the optimum radius of the beam decreases while the FS was improved.

• Journal of Korean Institute of Industrial Engineers
• /
• v.19 no.3
• /
• pp.11-23
• /
• 1993

A basic problem of sequencing a set of independent tasks at a single facility with the objective of minimizing total tardiness is considered. A variation of beam search, called knowledge-based beam search, has been studied which uses domain knowledge to reduce the problem size with an evaluation function to generate nodes probable to include the optimal solution. Its performance behavior is compared with some existing algorithms.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2021.11a
• /
• pp.918-920
• /
• 2021

최근 군사 분야에서 사용하는 기존 판독시스템을 개선하기 위해 판독보고서를 기반으로 문장을 추천해주는 시스템이 연구되었다. 제안한 시스템에서 문장을 추천하기 위해 Beam Search 알고리즘을 사용하는데, Beam Search 알고리즘은 추천해 주는 문장의 다양성이 떨어진다는 문제가 있었고, 이를 해결하기 위해 Divers Beam Search 알고리즘을 응용하여 적용하였다. 이는 판독관들의 업무효율을 높임으로써 업무 과 부화를 해결할 수 있을 것이다.

• KIPS Transactions on Software and Data Engineering
• /
• v.10 no.11
• /
• pp.521-528
• /
• 2021

Existing image analysis systems in use in the military field are carried out by readers analyzing and identifying images themselves, writing and disseminating related content, and in this process, repetitive tasks are frequent, resulting in workload. In this paper, to solve the previous problem, we proposed an algorithm that can operate the Seq2Seq model on a word basis, which operates on a sentence basis, and applied the Attention technique to improve accuracy. In addition, by applying the Beam Search technique, we would like to recommend various current identification sentences based on the past identification contents of a specific area. It was confirmed through experiments that the Beam Search technique recommends sentences more effectively than the existing greedy Search technique, and confirmed that the accuracy of recommendation increases when the size of Beam is large.

• Journal of the Korea Concrete Institute
• /
• v.12 no.4
• /
• pp.91-101
• /
• 2000

As the computer related technology evolves a study for a practical use of real structure as well as its hteory for optimum design has been greatly advanced. But the study on optimum design of pre-stressed concrete beam(PSC-beam) bridge for the construction of national roads and highways in Korea is not sufficient. Since a standard section for the PSC-beam is proposed, it is practically used in designing the PSC-beam. It is noticed that the section using the current standard PSC-beam design to be an over-designed with its surplus safety factor. Therefore, it is necessary to consider economical PSC-beam section which automatically satisfies all requirement of design specifications. Thus, in this study, the optimum design methods of PSC-beam are carried out using the gradient-based search method and global search method. As a result of the optimum design method, it was confirmed that the design of PSC-beam has a serious properties to non-linearity and discontinuity. And the section that in economical and efficinet design methods than the current standard design method is proposed.