• Journal of Korean Library and Information Science Society
• /
• v.35 no.1
• /
• pp.303-317
• /
• 2004

The purpose of this study was to develop a framework for predicting searching performance through an understanding of how cognitive ability relates to searching process and outcome. Specifically, this study examined the relationship between spatial visualization, logical reasoning, integrative reasoning, and information searching process and outcome. Information searching process was assessed by seven search process indicators: (1) search command selection: (2) combination of search commands; (3) application of Boolean logic: (4) application of truncation; (5) use of limit search function; (6) number of search statements; and (7) number of search errors made. Searching outcome was assessed by the number of correct answers to search questions. Subjects first took three standardized cognitive tests that measured cognitive abilities, and performed online catalog searching in response to seven information search questions. The searches were logged using Lotus ScreenCam, and reviewed for the analysis. Factor analysis was used to find underlying structures of the seven search process variables. Multiple regression analysis was applied to examine the predictive power of three cognitive variables on three extracted factors, and search outcome. Results of the data analysis showed that individual differences in logical reasoning could predict information searching process and outcome.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1994.06c
• /
• pp.188-194
• /
• 1994

Code excited linear prediction speech coders exhibit good performance at data rates as low as 4800bps. But the major drawback to CELP type coders is their large computational requirements. Therefore, in this paper a comparative performance study of three pitch searching algorithms for the CELP vocoder was conducted. For each of the algorithms, a standard pitch searching algorithm was used by the full pitch searching algorithm that was implimented in the QCELP vocoder. The algorithms used in this study is to reduce the pitch searching time 1) using the skip table, 2) using the symmetrical property of the autocorrelation , and 3) using the preprocessing autocorrelation, 4) using the positive autocorrelation, 5) using the preliminary pitch. Performance scores are presented for each of the five pitch searching algorithms based on computation speed and on pitch prediction error.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2004.11a
• /
• pp.1012-1015
• /
• 2004

There have been several kinds of attempts to actively control the deflected noise behind the noise barrier. Omoto's work in 1993 would be one of the fundamental studies, where he placed the control sources uniformly parallel to the noise barrier. Following this study, Yang pointed that the average distance between the noise source and control sources is more important than the arrangement of control sources such as a straight line or an arc type distribution. In 2004, Baek tried to show optimal arrangement of control sources while keeping the average distance between the noise source and control sources. He used simulated annealing algorithm which is one of the natural algorithms for the selections of optimal control source positions, but the searching technique was a hybrid of the simulated annealing and the sequential searching to adapt to the vast amount of searching time. This study is about the performance comparison between the pure sequential searching and the hybrid one. The simulation results show very similar performance and a pure simulated annealing searching will be more beneficial for the noise reduction performance but at the cost of computing time.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.18 no.36
• /
• pp.31-39
• /
• 1995

This study reflected sensitivity cognition in using color and evaluated the performance in task regarded GUI environment. Largely, three experiments were conducted. First, the searching time in text environment was compared with the searching time in color environment. Second, to know relationship of hue, saturation, lightness which are factors of color, and searching time, the searching time was measured using two-way ANOVA with interaction with three independent variables: hue, saturation, and distance. Third, sensitivity cognition about color was investigated and the performance of searching task was analyzed in the environment designed by color regarded sensitivity cognition. According to statistical results, the average searching time was decreased about 50.31% in color environment. The searching time was significant among the difference of hue and saturation. For the factor of color, the more the ratio of green and red was increased, the more searching time was decreased. The more the ratio of gray was increased, the more searching time was increased. And the searching time was developed in the environment designed by color regarded sensitivity. The purpose of this study is the presentation of sensitivity realization method and verification in the reflection and application of sensitivity to the industrial environment and design.

• Journal of the Ergonomics Society of Korea
• /
• v.11 no.1
• /
• pp.21-29
• /
• 1992

A study on analyze the effect of positive and negative contrast for user performance on the VDT tasks);text typing, text deiting, and searching task) has been performed. The performances were measured in terms of the completion time and the number of errors. The results of each VDT task are followings. In the text typing task and the searching task, the performances measured by the number of errors were better at the condition of negative contrast than at that of positive contrast. In the text deiting task, the performance showed a reverse tendency.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1993.06a
• /
• pp.280-287
• /
• 1993

Code Excited Linear Prediction(CELP) speech coders exhibit good performance at data rates as low as 4800bps. The major drawback to CELP type paper, a comparative performance study of three pitch searching algorithms for the CELP vocoder was conducted. For each of the algorithms, a standard pitch searching algorithm was used by the sequential pitch searching algorithm that was implimented in the QCELP vocoder. The algorithms used in this study were 1) using the skip table(TABLE), 2) using the symmetrical property of the autocorrelation(SYMMT), and 3) using the preprocessing autocorrelation(PREPC). Performance scores are presented for each of the three pitch searching algorithms based on computation speed and on pitch prediction error.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.9 no.4
• /
• pp.135-141
• /
• 2013

String matching is one of the key algorithms in network security and many areas could be benefit from a faster string matching algorithm. Based on the most efficient string matching algorithm in sual applications, the Boyer-Moore (BM) algorithm, a novel algorithm called RQS is proposed. RQS utilizes an improved bad character heuristic to achieve bigger shift value area and an enhanced good suffix heuristic to dramatically improve the worst case performance. The two heuristics combined with a novel determinant condition to switch between them enable RQS achieve a higher performance than BM both under normal and worst case situation. The experimental results reveal that RQS appears efficient than BM many times in worst case, and the longer the pattern, the bigger the performance improvement. The performance of RQS is 7.57~36.34% higher than BM in English text searching, 16.26~26.18% higher than BM in uniformly random text searching, and 9.77% higher than BM in the real world Snort pattern set searching.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.12 no.1
• /
• pp.18-23
• /
• 2009

It is hard to find an operation case using anti-submarine searching pattern(ASSP) developed by Korean navy since Korean navy has begun submarine searching operation. This paper proposes the method to develop hull mount sonar(HMS) based optimal submarine searching pattern by using genetic algorithm. Developing the efficient ASSP based on theory in near sea environment has been demanded for a long time. Submarine searching operation can be executed by using ma ulti-step and multi-layed method. however, In this paper, we propose only HMS based ASSP generation method considering the ocean environment and submarine searching tactics as a step of first research. The genetic algorithm, known as a global opination method, optimizes the parameters affecting efficiency of submarine searching operation. Finally, we confirm the performance of the proposed ASSP by simulation.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1995.06a
• /
• pp.141-145
• /
• 1995

Code excited linear prediction speech coders exhibit good performance at data rates as low as 4800 bps. The major drawback to CELP type coders is their large computational requirements. In this paper, we propose a new codebook search method that preserves the quality of the CELP vocoder with reduced complexity. The basic idea is to restrict the searching range of the random codebook by using a searching technique of the regular pulse excitation. Applying the proposed method to the CELP vocoder, we can get approximately 48% complexity reduction in the codebook search.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.12
• /
• pp.137-143
• /
• 2017

In this paper, we propose optimal route searching algorithm using ANN(Artificial Neural Network) and implement route searching system. Our proposed scheme shows that the route using artificial neural network is almost same as the route using Dijkstra's algorithm but the time in our propose algorithm is shorter than that of existing Dijkstra's algorithm. Proposed route searching method using artificial neural network has better performance than exiting route searching method because it use several weight value in making different routes. Through simulation, we show that our proposed routing system improves the performance and reduces time to make route irrespective of the number of hidden layers.