• 한국국방경영분석학회지
• /
• 제23권2호
• /
• pp.103-119
• /
• 1997

This paper considers the shortest path problem combined with Min-Min-Sum objective for solving the problem of the military logistics. This paper develops a polynomial-time algorithm for the optimal solution. To analyze the real combat situation, the ability time and distance time of communication line are considered. The complexities of algorithm between previous study and the algorithm developed in this paper is presented. Finally we provide a simple example of application with randomly generated problem.

• 음성과학
• /
• 제9권3호
• /
• pp.35-45
• /
• 2002

A simple algorithm for discriminating voiced sounds in a speech is proposed. In addition to low-frequency energy and zero-crossing rate (ZCR), both of which have been widely used in the past for identifying voiced sounds, the proposed algorithm incorporates pitch variation to improve the discrimination rate. Based on TIMIT corpus, evaluation result shows an improvement of 13% in the discrimination of voiced phonemes over that of the traditional algorithm using only energy and ZCR.

• 대한기계학회논문집A
• /
• 제20권10호
• /
• pp.3135-3141
• /
• 1996

In order to develop an efficient algorithm for S-to-M mapping in CMCA, characteristics of CMCA mappings is studied and conceptual mapping procedure is physically described. Then, careful observations on the mapping procedure and experience reveal a simple algorithm of the S-to-M mapping. The algorithm is described and compared with other procedures for S-to-M mapping. It is found very efficient in terms of computational operations and processing time.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 하계종합학술대회 논문집(3)
• /
• pp.173-176
• /
• 2002

This paper describes an implementation of fast face detection algorithm. This algorithm can robustly detect human faces with unknown sizes and positions in complex backgrounds. This paper provides a powerful face detection algorithm using skin color segmenting. Skin Color is modeled by a Gaussian distribution in the HSI color space among different persons within the same race, Oriental. The main feature of the Algorithm is achieved face detection robust to illumination changes and a simple adaptive thresholding technique for skin color segmentation is employed to achieve robust face detection.

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 1998년도 The Korea Society for Simulation 98 춘계학술대회 논문집
• /
• pp.11-16
• /
• 1998

The classical algorithm for solving liner network flow problems are primal cost improvement method, including simplex method, which iteratively improve the primal cost by moving flow around simple cycles, which iteratively improve the dual cost by changing the prices of a subset of nodes by equal amounts. Typical iteration/shortest path algorithm is used to improve flow problem of liner network structure. In this paper we stdudied about the implemental method of shortest path which is a practical computational aspects. This method can minimize the best neighbor node and also implement the typical iteration which is $\varepsilon$-CS satisfaction using the auction algorithm of linear network flow problem

• 한국음향학회:학술대회논문집
• /
• 한국음향학회 1994년도 FIFTH WESTERN PACIFIC REGIONAL ACOUSTICS CONFERENCE SEOUL KOREA
• /
• pp.775-780
• /
• 1994

A new simple method to formulate the adaptive algorithm to control the coefficients of FIR filter is introduced. The filter is used in the active noise control system. The introduced algorithm includes the LMS algorithm as a special case. The validity of the theoretical result is confirmed by the computer simulation.

• 한국컴퓨터정보학회지
• /
• 제14권1호
• /
• pp.249-254
• /
• 2006

본 논문에서는 기존의 사각형을 이용한 충돌처리 기법 알고리즘에 대하여 알아보고, 문제점을 제시하며, 단순한 사각형 충돌의 단점을 보완한, 작은 사각형 단위의 충돌 체크 기법을 제안하고, 실험과 실제 구현한 게임 화면 디자인을 통하여 제안한 알고리즘이 실제 게임에서 적용할 수 있음을 보인다.

• 전기의세계
• /
• 제28권6호
• /
• pp.61-77
• /
• 1979

This paper is concerned with minimization process of the binary logic function. This paper describes an algorithm called the SIMPLE TABLE METHOD that well suited to minimization a switching function of any number of variables. For the Simple Table construction, a theorem based upon the numerical properties of the logic function is derived from the relationships governing minterms of the given function. Finally the minimal sum of products can be obtained in terms of the Direct Method or the Indirect Method from the table and table characteristics derived from the Simple Table. The properties and table characteristics used in this paper are described. All the minterms of a switching function are manipulated only by decimal numbers, not binary numbers. Some examples are used as a vehicle to guide the readers who are familiar with the Karnaugh map and Quine-McCluskey tabular method to this New method. These examples not only treat how to handle Don't Care miterms but also show the multiple output functions.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제33권4호
• /
• pp.427-439
• /
• 2006

간단한 경계선 추적자 알고리즘(SBF: Simple Boundary Follower)은 영상의 인식과 표현을 위하여 사용되는 경계선 추적 알고리즘 중에서 널리 사용되는 것이다. SBF는 주로 이진화된 영상에서 물체의 경계선을 추적할 때 매우 간단하면서도 효율적인 성능을 제공한다. 그러나 추적자의 위치와 방향조건에 따라 인너코너(inner corner)와 인너-아우터 코너(inner-outer corner)의 일부 영상을 추적하지 못하는 비일관성(inconsistency)을 가지고 있고, 경계선 이외의 픽셀들에 대한 부가적인 이동연산을 요구한다는 단점이 있다. 이러한 제약성들 중 인너-아우터 코너의 비일관성을 해결하기 위하여 수정된 간단한 경계선 추적자 알고리즘(MSBF: Modified Simple Boundary Follower)이 연구되었지만 여전히 인너코너 추적 비일관성과 부가 연산 필요성에 대한 해결책은 제시되지 않았다. 본 논문에서는 이를 개선하기 위하여 비일관성이 일어나지 않도록 처리하고, 경계선 주위 픽셀에 대한 이동 연산을 줄일 수 있는 개선된 간단한 경계선 추적자 알고리즘(ISBF: Improved Simple Boundary Follower)을 제안하였다. 또한 경계선상의 픽셀들의 배치와 이동 경로 방식에 대해 분류를 함으로써 세 가지 알고리즘의 연산복잡도를 계산하였다. 제안된 알고리즘은 MSBF에 비하여 연산량이 감소하였고, 비일관성의 문제가 없는 것으로 분석되었다.

• 한국생산제조학회지
• /
• 제24권2호
• /
• pp.141-147
• /
• 2015

In this study, a position control algorithm for an omni-directional mobile robot based on Mecanum wheels was introduced and experimentally evaluated. Multiple ultrasonic sensors were installed around the mobile robot to obtain position feedback. Using the distance of the robot from the wall, the position and orientation of the mobile robot were calculated. In accordance with the omni-directional velocity generation mechanism, the velocity kinematics between the Mecanum wheel and the mobile platform were determined. Based on this formulation, a simple and intuitive position control algorithm was suggested. To evaluate the control algorithm, a test bed composed of artificial walls was designed and implemented. While conventional control algorithms based on normal wheels require additional path planning for two-dimensional planar motion, the omni-directional mobile robot using distance sensors was able to directly follow target positions with the simple proposed position feedback algorithm.