• 음성과학
• /
• 제8권3호
• /
• pp.143-148
• /
• 2001

We propose a new scheme for VQ codebook search. The procedure is in between the binary-tree-search and full-search and thus might be called N-ary search of a codebook. Through the experiment performed on 7200 frames spoken by 25 speakers, we confirmed that the best codewords as good as by the full-search were obtained at moderate time consumption comparable to the binary-tree-search. In application to speech recognition by HMM/VQ with Bakis model, where appearance of a specific codeword is essential in the parameter training phase, the method proposed here is expected to provide an efficient training procedure.

• 한국문헌정보학회지
• /
• 제19권
• /
• pp.189-241
• /
• 1990

This study identified cognitive styles of online searchers in terms of Field Dependence (FD) and Field Independence (FI) dimension and determined whether searching performance was affected by FD / FI cognitive differences between online searchers and the extent to which searching performance was affected by the FD / FI dimension of cognitive style. This study used a quasi experimental design with 41 student subjects using the Lockheed DIALOG system and ERIC ONT AP database. Cognitive styles of student subjects were measured by using GEFT (Group Embedded Figure Test) and the subjects were divided into two cognitive groups- FD and FI based on the GEFT scores. Each subject was assigned two predetermined searches which had different search goals-a 'high precision search' and a 'high recall search.' Search performance of the two cognitive groups on the two problems was compared in order to see how these two groups responded to achieving different search goals in terms of search strategy, search inputs, and resulting search outputs. The major findings of this study were: 1. The pattern of approaching a search problem regardless of whether it was a high precision search or a high recall search was not significantly different between the two cognitive groups. 2. The FI group tended to use significantly more terms for the high recall search than the FD group but slightly less time than the FD group. However, significant differences in connect time between the two groups were not revealed. 3. For both search problems the FI group achieved a significantly higher success rate than the FD group. The FI group were significantly more successful searchers than the FD group. As for unit / cost, although the FI group were more cost effective than those of the FD group for both searches, these differences were too small to be statistically significant. 4. Mean differences of the search performance variables between the FD / FI groups were consistent across the two types of search questions. The FI group seemed to be equally effective for both types of search questions. In conclusion, the differences found in number of terms used and success rate between the two cognitive groups apparently resulted from different cognitive styles.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 Proceedings of the Korea Automatic Control Conference, 11th (KACC); Pohang, Korea; 24-26 Oct. 1996
• /
• pp.95-98
• /
• 1996

Universal Learning Network(U.L.N.), which can model and control the large scale complicated systems naturally, consists of nonlinearly operated nodes and multi-branches that may have arbitrary time delays including zero or minus ones. Therefore, U.L.N. can be applied to many kinds of systems which are difficult to be expressed by ordinary first order difference equations with one sampling time delay. It has been already reported that learning algorithm of parameter variables in U.L.N. by forward and backward propagation is useful for modeling, managing and controlling of the large scale complicated systems such as industrial plants, economic, social and life phenomena. But, in the previous learning algorithm of U.L.N., time delays between the nodes were fixed, in other words, criterion function of U.L.N. was improved by adjusting only parameter variables. In this paper, a new learning algorithm is proposed, where not only parameter variables but also time delays between the nodes can be adjusted. Because time delays are integral numbers, adjustment of time delays can be carried out by a kind of random search procedure which executes intensified and diversified search in a single framework.

• 대한산업공학회지
• /
• 제42권6호
• /
• pp.377-385
• /
• 2016

The previous Adaptive Control of Thought-Rational (ACT-R) cognitive architecture model has a limitation in that it cannot accurately predict human visual search strategy, because time effect, one of important human cognitive features, is not considered. Thus, the present study proposes ACT-R cognitive modeling that contains the impact of time using a revised utility system in the ACT-R model. Then, the validation of the model is performed by comparing results of the model with eye-tracking experimental data and SEEV-T (SEEV-Time; SEEV model which considers time effect) model in "Where's Wally" game. The results demonstrate that the model data fit fairly well with the eye-tracking data ($R^2=0.91$) and SEEV-T model ($R^2=0.93$). Therefore, the modeling method which considers time effect using a revised utility system should be used in predicting the human visual search paradigm when the available time is limited.

• 경영정보학연구
• /
• 제5권1호
• /
• pp.97-111
• /
• 2003

인터넷 기반의 전자상거래가 확산되면서, 에이전트 기술을 사용한 비교 쇼핑 사이트들이 등장하여 쇼핑이 점차 편해지고 있다. 하지만, 이들 비교 쇼핑 사이트들이 동일 상품에 대해 서로 다른 가격을 보여줄 때도 있고, 또 어떤 사이트는 특정 상품에 대한 정보를 전혀 보여주지 못할 때가 많기 때문에, 여전히 대부분의 소비자들은 최적의 가격을 검색하기 위해 많은 시간을 소비하고 있다. 또한, 책이나 CD 등의 상품에 대한 가격 검색에서는 온라인 실시간 검색이 요구되므로 시스템 부하를 유발시켜 응답시간이 길어지게 된다. 이러한 문제를 해결하기 위해, 본 논문에서는 지역 데이터베이스와 메모리 캐시를 갖는 메타-비교 쇼핑 시스템을 설계하고 구현하였다. 제안된 시스템은 여러 소프트웨어 에이전트를 이용하여 기존 비교 쇼핑 사이트들에 대해 메타 검색을 수행함으로써, 인기검색 상품들에 대한 가격 정보를 수집하여 유지한다. 실험을 통해 제안 시스템이 효율적인 메타-비교 쇼핑 엔진으로 응답 시간의 지연을 줄여 주며 오버헤드도 적게 유발시킨다는 것을 보였다.

• 대한기계학회논문집A
• /
• 제27권5호
• /
• pp.681-687
• /
• 2003

Terrain surfaces have to be modeled in very detail and wheel-surface contacting geometry must be well defined in order to obtain proper ground-reaction and friction forces fur realistic simulation of off-road vehicles. Delaunay triangulation is one of the most widely used methods in modeling 3-dimensional terrain surfaces, and the T-search is a relevant algorithm for searching resulting triangular polygons. The T-search method searches polygons in a successive order and may not allow real-time computation of off-road vehicle dynamics if the terrain is modeled with many polygons, depending on the computer performance used in the simulation. The dynamic T-search, which is proposed in this paper, combines conventional T-search and the concept of the dynmaic-window search which uses reduced searching windows or sets of triangular surface polygons at each frame by taking advantage of the information regarding dynamic charactereistics of a simulated vehicle. Numerical tests show improvement of searching speeds by about 5% for randomly distributed triangles. For continuous search following a vehicle path, which occurs in actual vehicle simulation, the searching speed becomes 4 times faster.

• 정보처리학회논문지B
• /
• 제10B권7호
• /
• pp.811-814
• /
• 2003

본 논문에서는 십자패턴과 육각패턴을 이용한 고속 블록 정합 동작 예측 기법을 제안한다. 블록 기반 탐색에서 전역 탐색방법이 가장 좋은 동작벡터를 찾지만, 탐색영역 내의 모든 전을 검색하기 때문에 많은 시간을 필요로 하게 된다. 본 방법은 대부분의 동영상에서 동작벡터가 블록의 중심 부근에 집중적으로 분포함을 착안하여 십자패턴으로 중앙을 우선 탐색한 다음 움직임이 큰 동작벡터를 육각패턴을 사용하여 찾는다. 실험결과, 본 방법은 기존의 탐색방법보다 화질과 탐색시간에서 대부분의 경우에 좋은 성능을 보임을 알 수 있다.

• Journal of Information Processing Systems
• /
• 제16권3호
• /
• pp.639-647
• /
• 2020

In the vibration target localization algorithms based on time difference of arrival (TDOA), Fang algorithm is often used in practice because of its simple calculation. However, when the delay estimation error is large, the localization equation of Fang algorithm has no solution. In order to solve this problem, one dimensional search location algorithm based on TDOA is proposed in this paper. The concept of search is introduced in the algorithm. The distance d1 between any single sensor and the vibration target is considered as a search variable. The vibration target location is searched by changing the value of d1 in the two-dimensional plane. The experiment results show that the proposed algorithm is superior to traditional methods in localization accuracy.

• 한국IT서비스학회지
• /
• 제10권4호
• /
• pp.243-258
• /
• 2011

With increasing interest in ubiquitous computing technology, an infrastructure for the short-distance wireless communication has been extended socially, bringing spotlight to the security system using the image or location. In case of existing security system, there have been issues such as the occurrences of blind spots, difficulty in recognizing multiple objects and storing of the unspecified objects. In order to solve this issue, zone-based location-estimation search system for the image have been suggested as an alternative based on the real-time location determination technology combined with image. This paper intends to suggest the search service for the image zone-based location-estimation. For this, it proposed the location determination algorism using IEEE 802.15.4/ZigBee's RSSI and for real-time image service, the RTP/RTCP protocol was applied. In order to combine the location and image, at the event of the entry of the specified target, the record of the time for image and the time of occurrence of the event on a global time standard, it has devised a time stamp, applying XML based meta data formation method based on the media's feature data based in connection with the location based data for the events of the object. Using the proposed meta data, the service mode which can search for the image from the point in time when the entry of the specified target was proposed.

• Structural Engineering and Mechanics
• /
• 제72권6호
• /
• pp.689-712
• /
• 2019

Time-series models like AR-ARX and ARMAX, provide a robust way to capture the dynamic properties of structures, and their residuals can be effectively used as features for damage detection. Even though several research papers discuss the implementation of AR-ARX and ARMAX models for damage diagnosis, they are basically been exploited so far for detecting the time instant of damage and also the spatial location of the damage. However, the inverse problem associated with damage quantification i.e. extent of damage using time series models is not been reported in the literature. In this paper, an approach to detect the extent of damage by combining the ARMAX model by formulating the inverse problem as a multi-constrained optimization problem and solving using a newly developed hybrid adaptive differential search with dynamic interaction is presented. The proposed variant of the differential search technique employs small multiple populations which perform the search independently and exchange the information with the dynamic neighborhood. The adaptive features and local search ability features are built into the algorithm in order to improve the convergence characteristics and also the overall performance of the technique. The multi-constrained optimization formulations of the inverse problem, associated with damage quantification using time series models, attempted here for the first time, can considerably improve the robustness of the search process. Numerical simulation studies have been carried out by considering three numerical examples to demonstrate the effectiveness of the proposed technique in robustly identifying the extent of the damage. Issues related to modeling errors and also measurement noise are also addressed in this paper.