• Journal of Korean Institute of Industrial Engineers
• /
• v.29 no.2
• /
• pp.165-171
• /
• 2003

Visual search in an unstructured search field is a fruitful research area for computational modeling. Search models that describe relationship between search time and probability of target detection have been used for prediction of human search performance and provision of ideal goals for search training. Until recently, however, most of models were focused on detecting a single target in a search field, although, in practice, a search field includes multiple targets and search models for multiple targets may differ from search models for a single target. This study proposed a random search model for multiple targets, generalizing a random search model for a single target which is the most typical search model. To test this model, human search data were collected and compared with the model. This model well predicted human performance in visual search for multiple targets. This paper also proposed how to determine optimal stopping time in multiple-target search.

• Journal of Magnetics
• /
• v.13 no.1
• /
• pp.34-36
• /
• 2008

For the measurement of the magnetic field distribution with high spatial resolution and high accuracy, the magnetic field sensing probe must be non-magnetic, but the MFM probe and sub-millimeter-meter size Hall probe use a ferromagnetic tip and block, respectively, to increase the sensitivity. To overcome this drawback, we developed a micro-size search coil magnetometer which consists of a single turn search coil, Terfenol-D actuator, scanning system, and control software. To reduce the noise generated by the stray ac magnetic field of the actuator driving coil, we employed an even function $\lambda$-H magnetostriction curve and lock-in technique. Using the developed magnetometer, we were able to measure the magnetic field distribution with a magnetic field resolution of 1 mT and spatial resolution of $0.1mm{\times}0.2mm$ at a coil vibration frequency of 1.8 kHz.

• Journal of the Korean Society for Precision Engineering
• /
• v.22 no.12 s.177
• /
• pp.175-183
• /
• 2005

In recent years, as the demands of VBNS and VDSL increase, the development of kernel parts of optical communication such as PLC(Planar Light Circuit), Coupler, and WDM elements increases. The alignment and the attachment technology are very important in the fabrication of optical elements. In this Paper, the optical alignment characteristic of multi-axis ultra precision stage is studied. The alignment algorithms are studied for applying to the ultra precision multi-axis stage. The alignment algorithm is comprised of field search and peak search algorithms. The contour of optical power signals can be obtained by field search and the precise coordinate can be found out by peak search. Three kinds of alignments, such as 1 ch. input vs. 1 ch. output optical stack, 1 ch. input vs. 8 ch. output PLC stacks, and ferrule vs. ferrule, are performed for investigating the alignment characteristics.

• Journal of the Korean Society for Library and Information Science
• /
• v.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.

• Journal of KIISE:Software and Applications
• /
• v.37 no.3
• /
• pp.214-221
• /
• 2010

The search-results clustering problem is defined as the automatic and on-line grouping of similar documents in search results returned from a search engine. In this paper, we propose a new search-results clustering algorithm specialized for a paper search service. Our system consists of two algorithmic phases: Category Hierarchy Generation System (CHGS) and Paper Clustering System (PCS). In CHGS, we first build up the category hierarchy, called the Field Thesaurus, for each research field using an existing research category hierarchy (KOSEF's research category hierarchy) and the keyword expansion of the field thesaurus by a word clustering method using the K-means algorithm. Then, in PCS, the proposed algorithm determines the category of each paper using top-down and bottom-up methods. The proposed system can be used in the application areas for retrieval services in a specialized field such as a paper search service.

• The Journal of Korean Medicine
• /
• v.30 no.4
• /
• pp.47-58
• /
• 2009

Objectives: Several domestic search systems for research projects providing capabilities of searching and managing the research information based on metadata have been completed, although they cannot search projects for specific domains such as the Oriental Medicine field. Therefore, in this paper we propose an effective method for collecting and refining information of research projects in the oriental medicine field. We also design and implement a search management system based on the collected information. Methods: We chose three search elements and defined the collecting process for research projects. The collected information was refined to enhance the quality of results. Then, the search management system was implemented by Adobe Flex. Results: We were able to collect 1,688 research projects in the oriental medicine field. We also implemented the search management system, which provides the functionalities of search and management such as input, update, delete, spreadsheet import/export of R&D projects, user management and access control. Conclusions: The collected information and the search management system will be used in a project analysis system which will be constructed in the future. The project analysis system could help to analyze trends in oriental medicine research as well as construct a technical roadmap.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.1
• /
• pp.242-259
• /
• 2015

Three-dimensional video coding is one of the main challenges restricting the widespread applications of 3D video and free viewpoint video. In this paper, a novel fractal coding algorithm with motion-vector-field-based motion estimation for depth map sequence is proposed. We firstly add pre-search restriction to rule the improper domain blocks out of the matching search process so that the number of blocks involved in the search process can be restricted to a smaller size. Some improvements for motion estimation including initial search point prediction, threshold transition condition and early termination condition are made based on the feature of fractal coding. The motion-vector-field-based adaptive hexagon search algorithm on the basis of center-biased distribution characteristics of depth motion vector is proposed to accelerate the search. Experimental results show that the proposed algorithm can reach optimum levels of quality and save the coding time. The PSNR of synthesized view is increased by 0.56 dB with 36.97% bit rate decrease on average compared with H.264 Full Search. And the depth encoding time is saved by up to 66.47%. Moreover, the proposed fractal depth map sequence codec outperforms the recent alternative codecs by improving the H.264/AVC, especially in much bitrate saving and encoding time reduction.

• KIPS Transactions on Software and Data Engineering
• /
• v.11 no.2
• /
• pp.93-100
• /
• 2022

Keyword-oriented search methods are mainly used as data search methods, but this is not suitable as a search method in the legal field where professional terms are widely used. In response, this paper proposes an effective data search method in the legal field. We describe embedding methods optimized for determining similarities between sentences in the field of natural language processing of legal domains. After embedding legal sentences based on keywords using TF-IDF or semantic embedding using Universal Sentence Encoder, we propose an optimal way to search for data by combining BERT models to check similarities between sentences in the legal field.

• Progress in Superconductivity and Cryogenics
• /
• v.23 no.4
• /
• pp.39-43
• /
• 2021

This study deals with the ferromagnetic shims design based on the spherical harmonic coefficient reduction method. The design method using the sequential search method is an intuitive method and has the advantage of quickly reaching the optimal result. The study was conducted for a 400 MHz all-REBCO magnet, which had difficulty in shimming due to the problem of SCF (screening current induced field). The initial field homogeneity of the magnet was measured to be 233.76 ppm at 20 mm DSV (Diameter Spherical Volume). In order to improve the field homogeneity of the magnet, the ferromagnetic shim with a thickness of 1 mil to 11 mil was constructed by a design method in which sequential search algorithm was applied. As a result, the field homogeneity of the magnet could be significantly improved to 0.24 ppm at 20 mm DSV and 0.05 ppm at 10 mm DSV.

• Journal of Fisheries and Marine Sciences Education
• /
• v.16 no.1
• /
• pp.50-59
• /
• 2004

Recently, many more fisheries and shipping high school students have entered college than those of the past. But, this trend could be attributed to the easy and various forms of selection for college admission. Thus the examinations of the college scholastic ability 2005 have added to the vocational search ability including verbal ability, mathematic ability, foreign language ability and inquiry ability. The vocational search ability in fisheries and shipping field is concluded the general fisheries science, general maritime science, general marine science and fisheries and shipping information management. This study analyzed the questions of the fisheries and shipping subject of vocational search field with high school 2nd students on October 2003. In result, this study identified some needed basic scholastic ability for fisheries and shipping high school students.