• Journal of Korea Society of Digital Industry and Information Management
• /
• v.7 no.4
• /
• pp.1-6
• /
• 2011

In this paper, search-efficient Bi-directional-Chord(B-Chord) is proposed in P2P (peer-to-Peer) overlay network. Chord is the most popular P2P Look-up protocol. However, it applied to the mobile environment, the search success rate become lower and the request delay time increases. That is big problem. Thus, by improving the existing Chord, in this paper proposed B-Chord reduces the request delay time to in a mobile environment. Proposed B-Chord have the two Finger table and can search by selecting Finger table depending on the value of Key. By use these bi-directional, it can reduce the number of nodes Hop and search delay time. Thus, As a result, it will be able to increase the search success rate in a mobile environment.

• KIEE International Transactions on Power Engineering
• /
• v.5A no.2
• /
• pp.177-185
• /
• 2005

This paper proposes an expert system that can enhance the accuracy of real-time bus reconfiguration strategy by adopting the local minimum tree search method and that can minimize the spreading effect of the fault by considering the operating condition when a main transformer fault occurs in an automated substation. The local minimum tree search method is used to expand the best-first search method. This method has the advantage that it can improve the solution performance within the limits of the real-time condition. The inference strategy proposed expert system consists of two stages. The first stage determines the switching candidate set by searching possible switching candidates starting from the main transformer or busbar related to the event. The second stage determines the rational real-time bus reconfiguration strategy based on heuristic rules from the obtained switching candidate set. Also, this paper proposes generalized distribution substation modeling using graph theory, and a substation database based on the study results is designed.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.53 no.10
• /
• pp.565-572
• /
• 2004

This paper proposes an expert system which can enhance the accuracy of real-time bus reconfiguration strategy by adopting local minimum tree search method and minimize the spreading effect of the fault by considering totally the operating condition when a main transformer fault occurs in the automated substation. The local minimum tree search method to expand the best-first search method. This method has an advantage which can improve the performance of solution within the limits of the real-time condition. The inference strategy proposed expert system consists of two stages. The first stage determines the switching candidate set by searching possible switching candidates starting from the main transformer or busbar related to the event. And, second stage determines the rational real-time bus reconfiguration strategy based on heuristic rules for the obtained switching candidate set. Also, this paper studies the generalized distribution substation modelling using graph theory and a substation database is designed based on the study result. The inference engine of the expert system and the substation database is implemented in MFC function of Visual C++. Finally, the performance and effectiveness of the proposed expert system is verified by comparing the best-first search solution and local minimum tree search solution based on diversity event simulations for typical distribution substation.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.13 no.5
• /
• pp.824-830
• /
• 2010

It is not easy job to find a underwater target using sonar system in the ASW operations. Many researchers have tried to solve anti-submarine search problem aiming to maximize the probability of detection under limited searching conditions. The classical 'Search Theory' deals with search allocation problem and search path problem. In both problems, the main issue is to prioritize the searching cells in a searching area. The number of possible searching path that is combination of the consecutive searching cells increases rapidly by exponential function in the case that the number of searching cells or searchers increases. The more searching path we consider, the longer time we calculate. In this study, an effective algorithm that can maximize the probability of detection in shorter computation time is presented. We show the presented algorithm is quicker method than previous algorithms to solve search problem through the comparison of the CPU computation time.

• 한국산학경영학회:학술대회논문집
• /
• 2005.11a
• /
• pp.1-9
• /
• 2005

Job search research has been criticized for failing to study the dynamics and change of the job search process. A lot of previous researches have used cross-sectional designs and treated job search as a static process. As a result, job search research has failed to examine how job seekers' behaviors change during the course of their search. This paper examined changes In job search behaviors(preparatory and active job search behavior, and job search intensity) and the effects of individual difference variables(self-esteem, self-efficacy, extroversion, agreeableness, conscientiousness, openness) on job search behaviors. Data were gathered from 404 university students who had not found employment at the time of beginning of second semester The results of t-test pairs indicated that job seeking students increased their preparatory job search behavior and active job search behavior, but didn't job search intensity. The results of multiple regression showed that self-efficacy had strong relationship with preparatory and active job search behavior, and job search intensity, but self-esteem had not any relationship with them. Among big-5 personality, extroversion had relationship with active job search behavior and job search intensity, and agreeableness only with job search intensity.

• The Journal of the Acoustical Society of Korea
• /
• v.20 no.6
• /
• pp.46-50
• /
• 2001

This paper proposes a new recognition time reduction algorithm Score-Cache technique, which is applicable to the HMM-base speech recognition system. Score-Cache is a very unique technique that has no other performance degradation and still reduces a lot of search time. Other search reduction techniques have trade-offs with the recognition rate. This technique can be applied to the continuous speech recognition system as well as the isolated word speech recognition system. W9 can get high degree of recognition time reduction by only replacing the score calculating function, not changing my architecture of the system. This technique also can be used with other recognition time reduction algorithms which give more time reduction. We could get 54% of time reduction at best.

• Journal of Korean Society of Transportation
• /
• v.22 no.5
• /
• pp.61-73
• /
• 2004

The efficiency of the real-time route guidance system(RGS) depends largely on the quality of route search algorithms. In this paper, we implement the coarse grid method(CGM) in mathematical programming for finding a good quality route of real-time RGS in large-scale networks. The proposed CGM examines coarser and wider networks as the search phase proceeds, in stead of searching the whole network at once. Naturally, we can significantly reduce computational efforts in terms of search time and memory requirement. We demonstrate the practical effectiveness of the proposed CGM with nationwide real road network simulation.

• Korean Management Science Review
• /
• v.13 no.1
• /
• pp.13-27
• /
• 1996

This paper considers the sequencing problem in mixed model assembly lines with hybrid workstation types and sequence-dependent setup times. Computation time is often a critical factor in choosing a method of determining the sequence. We develop a mathematical formulation of the problem to minimize the overall length of a line, and present a tabu search technique which can provide a near optimal solution in real time. The proposed technique is compared with a genetic algorithm and a branch-and-bound method. Experimental results are reported to demonstrate the efficiency of the technique.

• Proceedings of the Safety Management and Science Conference
• /
• 2008.11a
• /
• pp.35-39
• /
• 2008

This paper considers the sequencing of products in mixed model assembly lines. The sequence which minimizes overall utility work in car assembly lines reduce the cycle time, the number of utility workers, and the risk of conveyor stopping. The sequencing problem is solved using Tabu Search. Tabu Search is a heuristic method which can provide a near optimal solution in real time. Various examples are presented and experimental results are reported to demonstrate the efficiency of the technique.

• International Journal of Contents
• /
• v.12 no.2
• /
• pp.31-36
• /
• 2016

The purpose of this research is to realize interactive art based on user's motions information using real time internet search terms. For this purpose, real-time search terms and related news information were extracted from three domestic and foreign portal sites, and the extracted information was used to generate content for interaction with the user. For interaction between the generated content and the user, a motion-based interactive technology that optimizes the intentions and experiences of the user was developed. A motion-based interactive system can be used to develop an immersive interface that induces user interest.