• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.773-778
• /
• 1991

In this paper we describe a road following method for an autonomous vehicle. From a road image in gray level, a road boundary is detected using a gradient operator, and then the road boundary is converted to orthogonal view of the road showing the vehicle position and heading direction. In this research an efficient road boundary search technique is developed to support real time vehicle control. Also, an obstacle detection method, using images taken from two different positions, has been developed.

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.5
• /
• pp.458-463
• /
• 2004

This paper presents a fast IA(integer ambiguity) resolution method that determines the IA within short epochs with guaranteed reliability. Based on the fact that the search volume and the cost function are influenced by the selection of primary IAs in the plane intersection method, an IA resolution method is proposed that evaluates IA candidates repeatedly in an epoch with different combinations of primary IAs. In order to guarantee the reliability of the resolved IA with a certain probability, an inequality condition for selecting differencing operator is derived. Experiment results show that the proposed method consistently provides the true IA estimates within short time.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.6
• /
• pp.1861-1866
• /
• 2000

This paper describes a multi-constrained university timetabling problem that is a one of the field of artificial intelligent research area. For this problem, we propose the 2type edge graph that is can be represented time-conflict and day-conflict constraints simultaneously. The genetic algorithms are devised and considered for it. And we describe a method of local search in traditional random operator for its search efficiency. In computational experiments, the solutions of proposed method are average 71% costs that ware compared with solutions of random method in 10,000 iterations.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.11
• /
• pp.74-83
• /
• 1993

This paper presents methodology which enables the derivation of goal ordering rules from the analysis of problem failures. We examine all the possible ways of taking actions that lead to failures. If there are restrictions imposed by a problem state on possible actions to be taken, the restrictions manifest themselves in the form of a restricted set of possible operator bindings. Our method makes use of this observation to derive general control rules which are guaranteed to be correct. The overhead involved in learning is very low because this methodology needs only small amount of data to learn from namely, the goal stacks from the leaf nodes of a failure search tree. Empirical tests show that the rules derived by our system PAL couperform those derived by other systems such as PRODIGY and STATIC.

• Journal of the Korean Institute of Electrical and Electronic Material Engineers
• /
• v.30 no.4
• /
• pp.253-257
• /
• 2017

Nowadays, it is increasingly important to detect whether cables are live for the operator's safety if there is a sudden power failure. It is especially hard to detect the electrical field of an underground line because of shielding. This paper on detection of live-line states in cables studied the detection characteristics of the change in the magnetic field and axis as the frequency, voltage, and distance at the same load are changed using 3 axes. A search coil type was used as a magnetic field sensor with non-contact. We found that magnetic fields decrease proportionally to the square of the distance and the decrease of rated voltage with load effected to magnetic field. The magnetic field was detected by 3-axis sensors given correct proximity, but appeared as noise components beyond a distance of 2 cm.

• Proceedings of the KIEE Conference
• /
• 2003.11a
• /
• pp.248-250
• /
• 2003

Recently, electric power system's situation grows gradually so Fault Diagnosis is being complicated and is felt difficult. And ability that operator who is using electric power system must do correct judgment of power system state, and can cope at fault of power system state is required. Therefore, large size power system is divided into predefined minimum module, and define each module accident type. We use and compare defined accident type, we can know easily accident that happen forward. Therefore, large size power system using module that is defined to each section common accident type search in this paper. Therefore, large size power system using module that is defined to each section, we search for common accident type. And when accident in electric power system happens, I wish to explain about process that can do fault diagnosis in more easy and fast time, because using accident type that it is verified in front.

• Journal of the Korea Society of Computer and Information
• /
• v.7 no.1
• /
• pp.1-7
• /
• 2002

Component-based software development(CBSD) is gaining popularity Effective search and retrieval of desired components, which are stored in a component repository, is a very important issue in CBSD. In this paper. a new weighted synaptic connectivity matrix is proposed to find more appropriate components. An algorithm is proposed for effective search with NOT operator and a proof for the algorithm is Presented . A new procedure to calculate the output vector for a logically combined query is also presented.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2020.07a
• /
• pp.303-306
• /
• 2020

사용자들은 검색할 때 각자 자신이 애용하는 포털 사이트를 이용한다. 우리나라의 경우 네이버, 다음, 구글 등의 포털 사이트를 주로 이용하는 경향이 있다. 각 포털 사이트는 사이트마다 검색이 용이 하도록 검색 연산자들을 제공하고 있다. 하지만 각 포털 사이트마다 제공하는 검색 연산자의 종류, 사용 방법 등이 다양하게 제공 되고 있다. 일반적으로 대부분의 사용자들은 검색 연산자 활용이 저조할 뿐만 아니라 각 포털 사이트에서 제공되는 연산자를 인식하지 못하는 경향이 많이 발생 된다. 이 논문에서는 다양한 포털 사이트에서 활용 가능한 통합 검색 프로그램을 제공함으로써 포털 사이트 검색 및 각 포털 사이트의 검색 연산자 활용을 통한 검색 효율 극대화를 기하고자 하였다.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.6
• /
• pp.1550-1556
• /
• 1997

In this paper, we apply the evolutionary algorithm to the combinatorial optimization problem. Evolutionary algorithm useful for the optimization of the large space problem. This paper propose a method for the reuse of wastes of light water in atomic reactor system. These wastes contain several reusable elements, and they should be carefully selected and blended to satisfy requirements as an input material to the heavy water atomic reactor system. This problem belongs to an NP-hard like the 0/1 knapsack problem. Two evolutionary strategies are used as approximation algorithms in the highly constrained combinatorial optimization problem. One is the traditional strategy, using random operator with evaluation function, and the other is heuristic based search that uses the vector operator reducing between goal and current status. We also show the method which perform the feasible test and solution evaluation by using the vectored knowledge in problem domain. Finally, We compare the simulation results of using random operator and vector operator for such combinatorial optimization problems.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.3
• /
• pp.424-431
• /
• 2012

In information retrieval, search engine provide the rank of web page and the summary of the web page information to user. Snippet is a summaries information of representing web pages. Visiting the web page by the user is affected by the snippet. User sometime visits the wrong page with respect to user intention when uses snippet. The snippet extraction method is difficult to accurate comprehending user intention. In order to solve above problem, this paper proposes a new snippet extraction method using fuzzy implication operator and relevance feedback. The proposed method uses relevance feedback to expand the use's query. The method uses the fuzzy implication operator between the expanded query and the web pages to extract snippet to be well reflected semantic user's intention. The experimental results demonstrate that the proposed method can achieve better snippet extraction performance than the other methods.