• 한국컴퓨터정보학회논문지
• /
• 제22권12호
• /
• pp.117-123
• /
• 2017

The personalized search algorithm is a search system that analyzes the user's IP, cookies, log data, and search history to recommend the desired information. As a result, users are isolated in the information frame recommended by the algorithm. This is called 'Filter bubble' phenomenon. Most of the personalized data can be deleted or changed by the user, but data stored in the service provider's server is difficult to access. This study suggests a way to neutralize personalization by keeping on sending random query words. This is to confuse the data accumulated in the server while performing search activities with words that are not related to the user. We have analyzed the rank change of the URL while conducting the search activity with 500 random query words once using the personalized account as the experimental group. To prove the effect, we set up a new account and set it as a control. We then searched the same set of queries with these two accounts, stored the URL data, and scored the rank variation. The URLs ranked on the upper page are weighted more than the lower-ranked URLs. At the beginning of the experiment, the difference between the scores of the two accounts was insignificant. As experiments continue, the number of random query words accumulated in the server increases and results show meaningful difference.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1992년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 19-21 Oct. 1992
• /
• pp.413-418
• /
• 1992

This paper presents a tree search technique to solve the dynamic control problems. To illustrate the proposed procedure, the swinging control of a pendulum carried by a motor-driven cast is discussed as an example. Since the control system is of two degrees and the control problem is a nonlinear one, it is difficult to determine a swinging control rule analytically. However, by means of the proposed tree search approach, the problem can be solved in a relatively easy way. Some numerical calculations axe performed to verify the methodology. The result of the study shows that the proposed tree search technique is suitable for the dynamic control problems, in particular, for the complicated nonlinear dynamic control problem.

• Journal of Advanced Marine Engineering and Technology
• /
• 제29권1호
• /
• pp.124-131
• /
• 2005

This paper suggests LOS(Line-Of-Sight) guidance system of a surface vessel in straight-line navigation under ocean currents An LOS vector from the vessel to a point on the path between two way-points is decided and a heading angle is calculated to converge to follow the desired path based on the LOS vector This guidance system is called LOS guidance system. The suggested LOS guidance law has parameters to be properly chosen according to navigational environment. Parameters of LOS guidance system are optimized to reduce propulsive energy and/or position error between desired Position and present position of a ship using genetic algorithm which is a strong optimization algorithm with adaptational random search The effectiveness of the suggested LOS guidance system is assured through computer simulations.

• 한국운동역학회지
• /
• 제30권3호
• /
• pp.235-245
• /
• 2020

Objective: The purpose of this study was to investigate the differences between visual search, eye fixation positions, and eye fixation position on whole body regions while judging final matches of dance sports. Method: Ten experienced judges (male 6, female 4) and six dance sports couples belonging to the top Korean leagues in the Korea Dance sports Federation were participated. Wearable eye trackers were used for data collection. The independent t-test was conducted to examine the effects of gender, and the two-way ANOVA was conducted to examine the effects of judges' gender, dance event, and ranking. Results: It was found that the movement of male contestants was preferred, and the gaze fixation was high for torso movements in the judges' evaluations. Moreover, attention was focused on the upper body rather than the lower body; this was maintained for about seven seconds to evaluate each couple. Conclusion: This find was the relative comparison between the two couples was the determining factor in winning or losing.

• 정보관리연구
• /
• 제39권4호
• /
• pp.173-186
• /
• 2008

본 연구에서는 다양한 Open API를 이용한 매쉬업 검색서비스를 통해 한의 분야의 약재 정보를 검색하는 약재 검색 매쉬업 시스템을 구축하였다. 특히 본 논문에서는 일반적인 Open API외에도 현재 서비스되고 있는 한의 분야의 논문과 연구개발과제 서비스에 대한 2개의 Open API를 개발하고 공개하여 전문적인 지식을 쉽게 공유하고 검색할 수 있도록 하였다. 한의 분야의 약재 정보는 다른 분야와는 다르게 정보의 출전이 어디냐에 따라 다양한 이름과 설명들을 가지기 때문에 일반적인 검색 방법과 같이 한 두 개의 검색어를 이용해서는 원하는 검색 결과를 얻기 힘들다. 본 연구에서는 이러한 문제를 해결하기 위해서 기존에 한의 약재 100건의 정보를 온톨로지로 구축한 약재 온톨로지를 이용해서 검색어를 확장하고 이를 여러 Open API를 통해 검색하는 시스템을 구축함으로써 정확하고 포괄적인 검색이 이루어질 수 있도록 하였다.

• 한국정보통신학회논문지
• /
• 제14권11호
• /
• pp.2535-2540
• /
• 2010

전통적인 Pub/Sub(Publish/Subscribe) 시스템에서는 출판자(Pub)가 출판정보(Event)를 중개자(Broker)에게 전달을 하고 등록되어져 있는 구독조건(Subscription)과 매칭유무를 파악한 뒤 매칭된 구독조건들을 등록한 구독자(Sub)에게 출판정보를 전달한다. 이 시스템에서 정보의 전달은 출판자에서 구독자로의 단 방향으로 이루어졌다. 최근 새로운 용용 프로그램에서는 구독조건을 출판자에게도 전달하는 양 방향 정보전달의 필요성이 제기되었다. 따라서 출판자와 구독자들 간의 양방향 정보전달이 가능한 확장된 Pub/Sub 시스템을 제안하고자 한다. 확장된 Pub/Sub 시스템에서는 출판정보에 매칭되는 구독조건이 다수가 있을 수 있으므로 우선순위에 따라 상위 n개만을 출판자에게 전달할 수 있는 가능이 요구된다. 이 논문에서는 구독조건 간 우선순위를 결정하고 정하기 위한 SIF(Specific Interval First)를 정의하고 IS-List(Interval Skip List)를 이용하여 SIF기반의 우선순위 검색기법을 두 가지 방법으로 제안하였다. 성능평가 결과 집합정렬 방법은색인 생성 측면에서 그리고 삽입 시간 정렬 및 스팩을 이용한역 탐씩 방법은 검색 시간측면에서 좋은 성능을 보였다.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제5권4호
• /
• pp.333-338
• /
• 2005

This paper presents the target object search algorithm under Dynamic Programming (DP) in the Tree-type maze. We organized an experimental environment with the concatenation of Y-shape diverged way, small mobile robot, and a target object. By the principle of optimality, the backbone of DP, an agent recognizes that a given whole problem can be solved whether the values of the best solution of certain ancillary problem can be determined according to the principle of optimality. In experiment, we used two different control algorithms: a left-handed method and DP. Finally we verified the efficiency of DP in the practical application using our real robot.

• 대한조선학회논문집
• /
• 제31권4호
• /
• pp.139-146
• /
• 1994

본 논문에서는 선상가열법을 이용한 강판의 곡가공 자동화를 향한 하나의 가능성 있는 방향을 제시하고 있다. 이를 위해 선상가열현상을 대변할 수 있는 역학적 모델을 도입하여 가열조건들이 주어져 있을 때 가열경로를 구할 수 있는 알고리즘을 소개하였고 이에 의거해서 컴퓨터 프로그램을 개발하였다. 이의 정당성을 확인하기 위해 개발된 컴퓨터 프로그램을 2가지 형태의 곡면형상에 적용하여 이를 가공할 수 있는 가열경로를 찾는 시도를 해 보았는데, 이로부터 본 논문에서 제안하는 알고리즘과 프로그램 시스템은 만족할 만한 결과를 주고 있으며, 이는 곡가공 자동화 시스템 구축을 향한 합리적인 길이 될 수 있음을 확인할 수 있었다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2001년도 하계종합학술대회 논문집(4)
• /
• pp.21-24
• /
• 2001

In this paper, we present a fast face detection algorithm by estimating the eye region using neural network. To implement a real time face detection system, it is necessary to reduce search space. We limit the search space just to a few pairs of eye candidates. For the selection of them, we first isolate possible eye regions in the fast and robust way by modified histogram equalization. The eye candidates are paired to form an eye pair and each of the eye pair is estimated how close it is to a true eye pair in two aspects : One is how similar the two eye candidates are in shape and the other is how close each of them is to a true eye image A multi-layer perceptron neural network is used to find the eye candidate region's closeness to the true eye image. Just a few best candidates are then verified by eigenfaces. The experimental results show that this approach is fast and reliable. We achieved 94% detection rate with average 0.1 sec Processing time in Pentium III PC in the experiment on 424 gray scale images from MIT, Yale, and Yonsei databases.

• 산업기술연구
• /
• 제28권B호
• /
• pp.15-25
• /
• 2008

This paper is to develop a network reorganization method to consider the constraints which are turn restrictions, U-turns, and P-turns in two way traffic network for Intelligent Transport System(ITS). Several kinds of traffic constraints can be represented in reorganized network using virtual nodes and arc values. The evolution program is also developed to search the multiple shortest paths in this reorganized traffic network within limited time.