• The Transactions of the Korea Information Processing Society
• /
• v.2 no.3
• /
• pp.354-363
• /
• 1995

We propose a new search method which is based on the precedence relationship between subgoals.The prosed method reducess both the branching factor of and the depth of the search space by making use of the precedence relationship between subgoals, and further improves the efficiency of A.I.search by immediately achieving directly achievable maximal subgoals and immediately performing the directly applicable actions which must be eventually done.The efficiency of our method has been analysed theoretically.We have also implemented a robot planning system equipped with versions of DFID and IDA which are modified by applying our proposed strategies, and experimentally showed the efficiency of our strategy.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.4
• /
• pp.292-302
• /
• 2003

We propose a new method to reduce the complexity of excitation codebook search. The preselected excitation pulses by the coarse search method can be updated to pulses with higher quality performance measure. The excitation pulses can arbitrarily be deleted and inserted among the searched pulses until the overall performance achieves. If we use this excitation pulse search method in AMR-WB, the complexity required for excitation codebook search can be reduced to half the original method while the output speech maintains equal speech quality to a conventional method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.4
• /
• pp.843-859
• /
• 2024

The university course scheduling problem (UCSP) aims at optimally arranging courses to corresponding rooms, faculties, students, and timeslots with constraints. Previously, the university staff solved this thorny problem by hand, which is very time-consuming and makes it easy to fall into chaos. Even some meta-heuristic algorithms are proposed to solve UCSP automatically, while most only utilize one single algorithm, so the scheduling results still need improvement. Besides, they lack an in-depth analysis of the inner algorithms. Therefore, this paper presents a novel and practical approach based on Tabu search and simulated annealing algorithms for solving USCP. Firstly, the initial solution of the UCSP instance is generated by one construction heuristic algorithm, the first fit algorithm. Secondly, we defined one union move selector to control the moves and provide diverse solutions from initial solutions, consisting of two changing move selectors. Thirdly, Tabu search and simulated annealing (SA) are combined to filter out unacceptable moves in a parallel mode. Then, the acceptable moves are selected by one adaptive decision algorithm, which is used as the next step to construct the final solving path. Benefits from the excellent design of the union move selector, parallel tabu search and SA, and adaptive decision algorithm, the proposed method could effectively solve UCSP since it fully uses Tabu and SA. We designed and tested the proposed algorithm in one real-world (PKNU-UCSP) and ten random UCSP instances. The experimental results confirmed its effectiveness. Besides, the in-depth analysis confirmed each component's effectiveness for solving UCSP.

• Asia-Pacific Journal of Business
• /
• v.15 no.1
• /
• pp.45-69
• /
• 2024

Purpose - To examine the influence of mobile visual search as a strategic technology service on consumer perceived economic value and customer commitments, which in turn affect consumer's usage intention of mobile visual search. This study also explores the moderating effect of different levels of consumer online shopping orientation. Design/methodology/approach - One-by-one open-ended in-depth interview was first undertaken to 15 Korean consumers to figure the features of mobile visual search. Then a conceptual model was built to verify the hypotheses that indicate the impact of mobile visual search on consumer perceived economic value and customer commitment, which further influence consumer's usage intention. Findings - The results show Convenience, Information quality, Personalization, Text-free search interface design and Visual communication of mobile visual search positively influence consumer perceived economic value and customer commitment and in turn positively affect consumer's usage intention. Moreover, the different levels of consumer online shopping orientation also found to have different effects on consumers' perception and behavior of using mobile visual search in online fashion shopping. Research implications or Originality - The present study verified that mobile visual search is a service tool that consumers want to use in the online fashion shopping journey since it provides economic benefits.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.11
• /
• pp.1538-1543
• /
• 2018

For n pairs of points (a,b) on a circle, the line segment to connect two points is called a chord. These chords define a new graph G. Each chord corresponds to a vertex of G, and if two chords intersect, the two vertices corresponding to them are connected by an edge. This makes a graph, called by a circle graph. In this paper, we deal with the problem to find the connected components of a circle graph. The connected component of a graph G is a maximal subgraph H such that any two vertices in H can be connected by a path. When the adjacent matrix of G is given, the problem to find them can be solved by either the depth-first search or the breadth-first search. But when only the information for the chords is given as an input, it takes ${\Omega}(n^2)$ time to obtain the adjacent matrix. In this paper, we do not make the adjacent matrix and develop an $O(n{\log}^2n)$ algorithm for the problem.

• Journal of Computing Science and Engineering
• /
• v.2 no.4
• /
• pp.321-338
• /
• 2008

This paper presents a Modified Multiple Depth First Search algorithm for the exploration of the indoor environments occupied with obstacles in random distribution. The proposed algorithm was designed and implemented to employ one or a team of Khepera II mini robots for the exploration process. In case of multi-robots, the BlueCore2 External Bluetooth module was used to establish wireless networks with one master robot and one up to three slaves. Messages are sent and received via the module's Universal Asynchronous Receiver/Transmitter (UART) interface. Real exploration experiments were performed using locally developed teleworkbench with various autonomy features. In addition, computer simulation tool was also developed to simulate the exploration experiments with one master robot and one up to ten slaves. Computer simulations were in good agreement with the real experiments for the considered cases of one to one up to three networks. Results of the MMDFS for single robot exhibited 46% reduction in the needed number of steps for exploring environments with obstacles in comparison with other algorithms, namely the Ants algorithm and the original MDFS algorithm. This reduction reaches 71% whenever exploring open areas. Finally, results performed using multi-robots exhibited more reduction in the needed number of exploration steps.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.8
• /
• pp.2163-2172
• /
• 1997

SSI(Surface/Surface Intersection)is a fundamental geometric operation which is used in solid and geometric modeling to support trimmed surface and Boolean operations. In this paper, we suggest a new algorithm for tracing along the intersection curve of two regular surfaces. Thus, in this paper, we present a simplicity of computing and second degree continunity. Given a point of intersection curve, it is traced to entire curve of a intersection curve as the initial point of its and the initial point of each of a intersection curve is detected to DFS(Depth First Search) method in the Quadtree and is naturally presented a continuous form.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.6
• /
• pp.49-55
• /
• 2017

Robots, games and life applications have been developed while computer areas are developed. Moreover, various applications have been utilized for various users including the early childhood. Recently, smart phones have been dramatically used by various users including early childhood. Many applications need to find a path from a starting point to destinations. For example, without using real maps, users can find the direct paths for the destinations in realtime. Specifically, path exploration in game programs is so important to have accurate results. Nowadays, with these techniques, diverse applications for educations of early childhood have been developed. To deal with the functions, necessity of efficient path search programs with high accuracy becomes much higher. In this paper, we design and develop a friendly maze program for early childhood based on a path searching algorithm. Basically, the path of lineal distance from a starting location to destination is considered. Moreover, weight values are calculated by considering heuristic weighted h(x). In our approach, A* algorithm searches the path considering weight values. Moreover, we utilize depth first search approach instead of breadth first search in order to reduce the search space. so it is proper to use A* algorithm in finding efficient paths although it is not optimized paths.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3A
• /
• pp.293-302
• /
• 2004

Wireless LAN is a rather mature communication technology that connects mobile terminals. A typical wireless LAN system is composed of one AP and more than one terminals, which is called a BSS. Terminals near to an AP can receive high rate data but terminals far from an AP may not receive data with guaranteed high speed rate because received signal strength is weakened. This paper proposes a method to allow high speed data transmission by grouping terminals and using part of wireless terminals as repeaters. We compare and analyze proposed grouping algorithms based on Depth First Search and Breadth First Search via simulations. A grouping algorithm based on Breadth First Search is shown to be more effective in term of efficiency and coverage.

• Journal of the Korea Society for Simulation
• /
• v.4 no.2
• /
• pp.79-92
• /
• 1995

In this paper we present an efficient parallel simulation algorithm in recursive feedforward network(RFN) which can reduce the simulation delay while decreasing the number of null messages compared to the previous result. As a preprocessing step, we first determine the group and type of each oupput channel for the nodes using DFS(Depth First Search) algorithm, and show that the number of null messages as well as the simulation scheme. By the new scheme we decide if null messages are sent to the output channels or not according to the group to which it belongs.