• Journal of the Korea Society of Computer and Information
• /
• v.14 no.10
• /
• pp.217-223
• /
• 2009

Vocabulary recognition system of Mobile terminal is executed statistical method for vocabulary recognition and used statistical grammar recognition system using N-gram. If limit arithmetic processing capacity in memory of vocabulary to grow then vocabulary recognition algorithm complicated and need a large scale search space and many processing time on account of impossible to process. This study suggest vocabulary recognition optimize using MLHF System. MLHF separate acoustic search and lexical search system using FLaVoR. Acoustic search feature vector of speech signal extract using HMM, lexical search recognition execution using Levenshtein distance algorithm. System performance as a result of represent vocabulary dependence recognition rate of 98.63%, vocabulary independence recognition rate of 97.91%, represent recognition speed of 1.61 second.

• Journal of the Ergonomics Society of Korea
• /
• v.36 no.4
• /
• pp.343-353
• /
• 2017

Objective: This study aims to evaluate the efficiency of two representative subway map design types, namely a diagram type and a geographical type using physiological metrics, performance metrics, and self-reported metrics, which are representative usability metrics. Background: Subway maps need to be designed in order for users to quickly search and recognize subway line information. Although most cities' subway maps currently use the diagram type designed by Henry Beck, New York City's subway map has recently been changed to the subway map type combined with the geographical type designed by Michael Hertz. However, not many studies on its efficiency are found, and the studies that are available mainly depend on questionnaire surveys or take on a subjective behavioral study type based on experts' experiences. In this regard, evaluation through a more objective method is needed. Method: This study employed usability metrics as a method to evaluate the efficiency of information search targeting the diagram type and geographical type subway maps used mostly as subway maps. To this end, physiological metrics obtained through eye tracking, task completion time, representative metric of task performance, and subjective evaluation metrics were used for the suitability evaluation of subway map designs. Results: In the result of gaze movement distance analysis, no significant difference was shown in the two design types in terms of a process finding a departure station from the starting point and a process finding a transfer station between the departure station and arrival station (destination). However, the gaze movement distance in the process finding the arrival station at the departure station was significantly shorter in the geographical type, rather than in the diagram type. The analysis of task completion time showed a result similar to the gaze movement distance analysis result. Task completion time was significantly shorter in the geographical type, rather than in the diagram type, which is in the process finding the arrival station at the departure station. In other information search processes, no significant difference was shown. As a result of subjective evaluation metrics analysis, no significant difference was revealed in the two design types. Conclusion: An analysis on the two representative subway map design types was carried out via the adoption of usability metrics. As a result, although no significant difference was shown in some information search processes, it was revealed that information search was easier in the geographical type overall. Also, it was found that usability metrics can be effectively used to evaluate the design types of subway maps. Application: The study results can be used to set design direction to offer ease in information search on subway lines. The study also can be used as a method to evaluate a subway map's design type.

• Journal of Communications and Networks
• /
• v.2 no.1
• /
• pp.58-68
• /
• 2000

In this paper we introduce the correlation-aided distributed sample acquisition (CDSA) scheme for fast cell search in IMT-2000 W-CDMA cellular system. The proposed scheme incorporates the state symbol correlation process into the comparison-correction based synchronization process of the original DSA scheme to enable fast acquisition even under very poor channel environment. for its realization, each mobile station (MS) has to store in its memory a set of state sample sequences. which are determined by the long-period scrambling sequences used in the system and the sampling interval of the state samples. CDSA based cell search is carried out in two stages : First, the MS first acquires the slot timing by using the primary synch code (PSC) and then identifies the igniter code which conveys the state samples of the current cell . Secondly. the MS identifies the scrambling code and frame timing by taking the comparison-correction based synchronization approach and, if the identification is not done satisfactorily within preset time. it initiates the state symbol correlation process which correlates the received symbol sequence with the pre-stored state sample sequences for a successful identification. As the state symbol SNR is relatively high. the state symbol correlation process enables reliable synchronization even in very low chip-SNR environment. Simulation results show that the proposed CDSA scheme outperforms the 3GPP 3-step approach, requiring the signal power of about 7 dB less for achieving the same acquisition time performance in low-SNR environments. Furthermore, it turns out very robust in the typical synchronization environment where large frequency offset exists.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.3
• /
• pp.1-7
• /
• 2015

This research is to develop a possible process to apply k-means clustering to an efficient vehicle routing process under time varying vehicle moving speeds. Time varying vehicle moving speeds are easy to find in metropolitan area. There is a big difference between the moving time requirements of two specific delivery points. Less delivery times are necessary if a delivery vehicle moves after or before rush hours. Various vehicle moving speeds make the efficient vehicle route search process extremely difficult to find even for near optimum routes due to the changes of required time between delivery points. Delivery area division is designed to simplify this complicated VRPs due to time various vehicle speeds. Certain divided area can be grouped into few adjacent divisions to assume that no vehicle speed change in each division. The vehicle speeds moving between two delivery points within this adjacent division can be assumed to be same. This indicates that it is possible to search optimum routes based upon the distance between two points as regular traveling salesman problems. This makes the complicated search process simple to attack since few local optimum routes can be found and then connects them to make a complete route. A possible method to divide area using k-means clustering is suggested and detailed examples are given with explanations in this paper. It is clear that the results obtained using the suggested process are more reasonable than other methods. The suggested area division process can be used to generate better area division promising improved vehicle route generations.

• Nuclear Engineering and Technology
• /
• v.55 no.8
• /
• pp.3030-3038
• /
• 2023

Nowadays, mobile robots have been used to search for uncontrolled radioactive source in indoor environments to avoid radiation exposure for technicians. However, in the indoor environments, especially in the presence of obstacles, how to make the robots with limited sensing capabilities automatically search for the radioactive source remains a major challenge. Also, the source search efficiency of robots needs to be further improved to meet practical scenarios such as limited exploration time. This paper proposes an automatic source search strategy, abbreviated as ACA: the location of source is estimated by a convolutional neural network (CNN), and the path is planned by the A-star algorithm. First, the search area is represented as an occupancy grid map. Then, the radiation dose distribution of the radioactive source in the occupancy grid map is obtained by Monte Carlo (MC) method simulation, and multiple sets of radiation data are collected through the eight neighborhood self-avoiding random walk (ENSAW) algorithm as the radiation data set. Further, the radiation data set is fed into the designed CNN architecture to train the network model in advance. When the searcher enters the search area where the radioactive source exists, the location of source is estimated by the network model and the search path is planned by the A-star algorithm, and this process is iterated continuously until the searcher reaches the location of radioactive source. The experimental results show that the average number of radiometric measurements and the average number of moving steps of the ACA algorithm are only 2.1% and 33.2% of those of the gradient search (GS) algorithm in the indoor environment without obstacles. In the indoor environment shielded by concrete walls, the GS algorithm fails to search for the source, while the ACA algorithm successfully searches for the source with fewer moving steps and sparse radiometric data.

• Journal of The Korean Association of Information Education
• /
• v.20 no.3
• /
• pp.243-254
• /
• 2016

This study has produced a checker of the shortest path search problem with a total of 19 questions as a web-based computer evaluation based on the 'TRAFFIC' questions of PISA 2012. It is because the computer has been settled as an indispensable and significant instrument in the process of solving the problems of everyday life and as a media that is underlying in assessment. Therefore, information gifted students should be able to solve the problem using the computer and give clear enough commands to the computer so that it can perform the procedure. In addition, since it is the age that the computational thinking is affecting every sectors, it should give students new educational stimuli. The relationship between the rate of correct answers and the time took to solve the problem through the shortest route search process showed a significant correlation the variable that affected the problem solving as the difficulty of the question rises due to the increase of nodes and edges turned out to be the node than the edge. It was revealed that information gifted students went through algorithmic thinking in the process of solving the shortest route search problem. And It could be confirmed cognitive characteristics of the information gifted students such as 'ability streamlining' and 'information structure memory'.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9A
• /
• pp.1392-1400
• /
• 1999

In this paper, we propose a two-stage fast full search algorithm for block motion estimation that produces the same performance to that of full search algorithm (FSA) but with remarkable computation reduction. The proposed algorithm uses the search region subsampling and the difference of adjacent pixels in the current block. In the first stage, we subsample the search region by a factor of 9, and then calculate mean absolute error (MAE) at the subsampled search points. And in the second stage, we reduce the search points that need block matching process by using the lower bound of MAE value at each search Point. We Set the lower bound of MAE value for each search point from the MAE values which are calculated at the first stage and the difference of adjacent pixels in the current block. The experimental results show that we can reduce the computational complexity considerably without any degradation of picture quality.

• 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.

• Journal of the Korean Institute of Rural Architecture
• /
• v.1 no.2
• /
• pp.29-37
• /
• 1999

This study was analyzed and researched into each gradual properties of housing owner's decision making, for preservation of traditional scenery and search for the way its succession, on the basis of search of the rural area housing owner and the virtual research data. As a result of this study, public company should care and advertise significance of traditional scenery succession to housing owners and architectural planning offices, because the model what public company has been developed and distributed should not be ignored influence on the process of housing owner's decision making.

• Journal of Institute of Control, Robotics and Systems
• /
• v.9 no.2
• /
• pp.168-175
• /
• 2003

A new algorithm based on Genetic Algorithms is proposed f3r solving process optimization problems formulated in MINLP, GDP and hybrid MINLP/GDP. This work is focused especially on the design of the Genetic Algorithm suitable to handle disjunctive programming with the same level of MINLP handling capability. Hybridization with the Simulated Annealing is experimented and many heuristics are adopted. Real and binary coded Genetic Algorithm initiates the global search in the entire search space and at every stage Simulated Annealing makes the candidates to climb up the local hills. Multi-Niche Crowding method is adopted as the multimodal function optimization technique. and the adaptation of probabilistic parameters and dynamic penalty systems are also implemented. New strategies to take the logical variables and constraints into consideration are proposed, as well. Various test problems selected from many fields of process systems engineering are tried and satisfactory results are obtained.