• Journal of Korean Society of Transportation
• /
• v.14 no.3
• /
• pp.45-59
• /
• 1996

The shortest path algorithm for route guidance is implicitly required not only to support geometrical variations of transportation network such as U-TURN or P-TURN but to efficiency search reasonable routes in searching mechanism. The purpose of this paper is to integrate such two requirements ; that is, to allow U-TURN and P-TURN possibilities and to cut down searching time in locating routes between two points (origin and destination) in networks. We also propose a new type of link searching algorithm which can solve the limitation of vine building algorithm at consecutively left-turn prohibited intersections. The test site is a block of Gangnam road network that has some left-turn prohibited and allowed U-TURN intersections. Four models have been identified to be comparatively analyzed in terms of searching efficiency. The Models are as follows : (i) Model 1 - Link Searching Dijkstra Algorithm without Searching Area Extraction (SAE) ; (ii) Model 2 - Link Searching Dijkstra Algorithm with SAE ; (iii) Model 3 - Link Searching Bidirectional Dijkstra Algorithm without SAE ; and (iv) Model 4 - Link Searching Bidirectional Dijkstra Algorithm with SAE. The results of comparative evaluation show that Model 4 can effectively find optimum path faster than any other models as expected. Some discussions and future research agenda have been presented in the light of dynamic route guidance application of the urban ATIS.

• The Journal of Information Systems
• /
• v.8 no.2
• /
• pp.91-110
• /
• 1999

Recently, searching agent systems to help purchase of products between business and customer have been actively studied in Electronic Commerce(EC). However, the most of comparative searching agent systems are only provided customers with searching results by the keyword-based search, and is not support the efficient decision models to be selected products considering the customer's requirements. This paper proposes the decision agent system applied decision model as well as searching functions based on the keyword-input to be selected useful products in EC. The proposed decision agent system is consist of the user interface, provider interface, decision model. Especially, as the example of the decision model, this paper is designed and implemented the prototype of decision agent system which is normalized the searching data and value of customer's preference weight as to each attribute, and orderly provided customers with computed results. This agent system is also carried out sensitive analysis according to the reflection ratio of the each attribute.

• Asia pacific journal of information systems
• /
• v.12 no.1
• /
• pp.1-16
• /
• 2002

Most of searching systems used by shopping-mall provide too much information for user requirements or fail to provide appropriate items reflecting customer's preference. This paper aims to design and implement the product searching systems based on customer preference which will enable efficient product selection in the internet shopping-mall. The proposed system consists of user/provider interface, searching and model agent, data management system, and model management system. Especially, we construct the searching pattern database to support fast search using association mining method. And this system includes the customer-oriented decision model which shows the highly preferred products. Input weight value per attribute and preference level should be needed to compute priority grade of preference.

• Journal of the Korean Society for Library and Information Science
• /
• v.26
• /
• pp.167-185
• /
• 1994

The purpose of this study is to develop the optimal user/librarian interface in information searching. In order to achive the purpose, the 150 unskilled students as subjects have participated in the study. According to the change of the subjects' psychological information states by the access points within the library system, the subjects have been classified into the five types of model: the initial information state, the accepted identification information state, the bibliographic information state, the stack information state, and the location information state. Librarian's searching support is done for 10 minutes at the each access points. To develop the optimal user/librarian interface, the expected values of the models are calculated. The resultants are as follows: 1) The expected value of the initial information states model is 18.94: 2) The expected value of the accepted identification information model is 27.06: 3) The expected value of the bibliographic information state model is 27.06: 4) The expected value of the stack information state model is 22.38: 5) The expected value of the location information state model is 22.38. Those expected values are compared with each other. The model with the lowest expected value is chosen as the optimal user/librarian interface model. In the result, the user's initial information state model of the optimal user/librarian interface in information searching is developed. In order to search the information with the most effect, user must be interfaced with the librarian at his/her own initial information state.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.1
• /
• pp.115-121
• /
• 2010

As internet becomes widespread, a lot of information is opened to public and users of Internet can access effectively information using web searching service. To construct web searching service, the web searching method for collecting of information is needed to obtain web page view. As a number of web page view increases, it is necessary to collect information of high quality information to be searched, therefore, a variety of web engine for searching mechanism is developed. Method of link extraction with javascript in dynamic web page and design of web searching robot are presented m this paper. To evaluate performance analyzes, we fixed one searching model with the proposed method. The searching time takes 2 minute 67 sec for 299 web pages and 12.33 sec for 10 searching model.

• Journal of Korea Multimedia Society
• /
• v.7 no.2
• /
• pp.145-155
• /
• 2004

It is very important for Internet searching systems to have user-friendly and rapid searching functions at the managers'point of view. The former finds optimized input parameters to support the various searching requirements of user. The latter has fast searching results which are effectively normalized to various input parameters having different attributes. In this paper we basically focus on optimized database construction not only to have searching functions with multiple attributes to support maximal various input requirements of the user but also to have more rapid searching functions. For this research, we suggest a modified association algorithm that takes into consideration to the support and confidence that is the criteria of the association mining rule in order to reflect the searching characteristics of internet shopping malls. We also propose the model management systems for rapid searching functions. The following results are from a processed simulation: the more the number of searching transactions of the users increase, the less the total relative average searching time becomes.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.12 no.4
• /
• pp.146-157
• /
• 2009

In order to implement ontology data searching system, this paper uses some methods that effectively analyse searching options/key words with event process model and design pattern. I will propose some techniques on object-oriented process model that should improve reusability of system and reusability of ontology data which users can obtain more precise searching results. This paper shows that ontology-based data searching can assure users of the precision of searching results. Therefore, ontology-based data searching system on object-oriented design pattern is expected to show high stability and reliability, enhance reusability and scalability of modules and softwares and provide reliable data searching results to users.

• Nuclear Engineering and Technology
• /
• v.41 no.3
• /
• pp.247-270
• /
• 2009

This paper reviews studies on information searching behavior in process control systems and discusses some implications learned from previous studies for use in human factors studies on nuclear power plants (NPPs) main control rooms (MCRs). Information searching behavior in NPPs depends on expectancy, value, salience, and effort. The first quantitative scanning model developed by Senders for instrument panel monitoring considered bandwidth (change rate) of instruments as a determining factor in scanning behavior. Senders' model was subsequently elaborated by other researchers to account for value in addition to bandwidth. There is also another type of model based on the operator's situation awareness (SA) which has been developed for NPP application. In these SA-based models, situation-event relations or rules on system dynamics are considered the most significant factor forming expectancy. From the review of previous studies it is recommended that, for NPP application, (1) a set of symptomatic information sources including both changed and unchanged symptoms should be considered along with bandwidth as determining factors governing information searching (or visual sampling) behavior; (2) both data-driven monitoring and knowledge-driven monitoring should be considered and balanced in a systematic way; (3) sound models describing mechanisms of cognitive activities during information searching tasks should be developed so as to bridge studies on information searching behavior and design improvement in HMI; (4) the attention-situation awareness (A-SA) modeling approach should be recognized as a promising approach to be examined further; and (5) information displays should be expected to have totally different characteristics in advanced control rooms. Hence much attention should be devoted to information searching behavior including human-machine interface (HMI) design and human cognitive processes.

• Journal of Electrical Engineering and Technology
• /
• v.8 no.3
• /
• pp.464-471
• /
• 2013

This paper proposes a hybrid searching algorithm based on parameter identification for power system load models. Hybrid searching was performed by the combination of particle swarm optimization (PSO) and a complex method, which enhances the convergence of solutions closer to minima and takes advantage of global searching with PSO. In this paper, the load model of interest is composed of a ZIP model and a third-order model for induction motors for stability analysis, and parameter sets are obtained that best-fit the output measurement data using the hybrid search. The origin of the hybrid method is to further apply the complex method as a local search for finding better solutions using the selected particles from the performed PSO procedure.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.781-784
• /
• 1998

An image segmentation approach based on the fuzzy worm searching and MIN-MAx clusterng algorithm is proposed in this paper. This algorithm deals with fuzzy worm value and min-max node at a gross scene level, which investigates the edge information including fuzzy worm action. But current segmentation methods based edge extraction methods generally need the mask information for the algebraic model, and take long run times at mask operation, wheras the proposed algorithm has single operation ccording to active searching of fuzzy worms. In addition, we also genetic min-max clustering using genetic algorithm to complete clustering and fuzyz searching on grey-histogram of image for the optimum solution, which can automatically determine the size of rnages and has both strong robust and speedy calculation. The simulation results showed that the proposed algorithm adaptively divided the quantized images in histogram region and performed single searching methods, significantly alleviating the increase of the computational load and the memory requirements.