• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.22 no.52
• /
• pp.297-309
• /
• 1999

Resource Constrained Dynamic Multi-Projects Scheduling(RCDMPS) is intended to minimize the total processing time(makespan) of two or more projects sequentially arriving at the shop under restricted resources. The aim of this paper is to develop the new Tabu Search heuristic for RCDMPS to minimize makespan. We propose the insertion method to generate the neighborhood solutions in applying the Tabu Search for the RCDMPS and the diversification strategy to search the solution space diversely. The proposed diversification strategy apply the dynamic tabu list that the tabu list size is generated and renewed at each iteration by the complexity of the project, and change the proposed tabu attribute. In this paper, We use the dynamic tabu list for the diversification strategy and intensification strategy in the tabu search, and compare with other dispatching heuristic method to verify that the new heuristic method minimize the makespan of the problem.

• Journal of Computational Design and Engineering
• /
• v.3 no.3
• /
• pp.226-249
• /
• 2016

The symbiotic organisms search (SOS) algorithm is an effective metaheuristic developed in 2014, which mimics the symbiotic relationship among the living beings, such as mutualism, commensalism, and parasitism, to survive in the ecosystem. In this study, three modified versions of the SOS algorithm are proposed by introducing adaptive benefit factors in the basic SOS algorithm to improve its efficiency. The basic SOS algorithm only considers benefit factors, whereas the proposed variants of the SOS algorithm, consider effective combinations of adaptive benefit factors and benefit factors to study their competence to lay down a good balance between exploration and exploitation of the search space. The proposed algorithms are tested to suit its applications to the engineering structures subjected to dynamic excitation, which may lead to undesirable vibrations. Structure optimization problems become more challenging if the shape and size variables are taken into account along with the frequency. To check the feasibility and effectiveness of the proposed algorithms, six different planar and space trusses are subjected to experimental analysis. The results obtained using the proposed methods are compared with those obtained using other optimization methods well established in the literature. The results reveal that the adaptive SOS algorithm is more reliable and efficient than the basic SOS algorithm and other state-of-the-art algorithms.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.3
• /
• pp.37-58
• /
• 1997

An AI approach with tabu search is designed to solve multi-level knapsack problems. The approach performs intelligent actions with memories of historic data and learning effect. These action are developed ont only by observing the attributes of the optimal solution, the solution space, and its corresponding path to the optimal, but also by applying human intelligence, experience, and intuition with respect to the search strategies. The approach intensifies, or diversifies the search process appropriately in time and space. In order to create a good neighborhood structure, this approach uses two powerful choice rules that emphasize the impact of candidate variables on the current solution with respect to their profit contribution. "Pseudo moves", similar to "aspirations", support these choice rules during the evaluation process. For the purpose of visiting as many relevant points as possible, strategic oscillation between feasible and infeasible solutions around the boundary is applied. To avoid redundant moves, short-term (tabu-lists), intemediate-term (cycle-detection), and long-term (recording frequency and significant solutions for diversfication) memories are used. Test results show that among the 45 generated problems (these problems pose significant or insurmountable challenges to exact methods) the approach produces the optimal solutions in 39 cases.lutions in 39 cases.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.3
• /
• pp.131-136
• /
• 1990

In this paper, new methods are proposed which speed up the logical redundancy identification for the gate-level logic optimization. Redundancy indentification, as well as deterministic test pattern generation, can be viewed as a finite space search problem, of which execution time depends on the size of the search space. For the purpose of efficient search, we propose dynamic head line and mandatory assignment. Dynamic head lines are changed dynamically in the process of the redundancy identification. Mandatory assignement can avoid unnecessary assignment. They can reduce the search size efficiently. Especially they can be used even though the circuit is modified in the optimization procedure, that is different from the test pattern generation methods. Some experimental results are presented indicating that the proposed methods are faster than existing methods.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.10 no.11
• /
• pp.1239-1244
• /
• 2015

In this paper, a new method for finding optimal and short span in Convolutional Self-Doubly Orthogonal(CDO) codes are proposed. This new algorithm based on Parallel Implicitly-Exhaustive search, where we applied dynamic search space reduction methods in order to reduce computational time for finding Optimal Span for R=1/2 rate CDO codes. The simulation results shows that speedup and error correction performance of the new algorithm is better.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.2
• /
• pp.31-36
• /
• 2003

This paper proposes an acceleration method of PCA(Principal Component Analysis) based feature detection. The feature detection method makes decision whether the target feature is included in a given image, and if included, calculates the position and extent of the target feature. The position and scale of the target feature or face is not known previously, all the possible locations should be tested for various scales to detect the target. This is a search Problem in huge search space. This Paper proposes a fast face and feature detection method by reducing the search space using the multi-stage prediction map and contour Prediction map. A Proposed method compared to the existing whole search way, and it was able to reduce a computational complexity below 10％ by experiment.

• ETRI Journal
• /
• v.29 no.5
• /
• pp.545-558
• /
• 2007

This paper presents an efficient semantic service discovery scheme called UbiSearch for a large-scale ubiquitous computing environment. A semantic service discovery network in the semantic vector space is proposed where services that are semantically close to each other are mapped to nearby positions so that the similar services are registered in a cluster of resolvers. Using this mapping technique, the search space for a query is efficiently confined within a minimized cluster region while maintaining high accuracy in comparison to the centralized scheme. The proposed semantic service discovery network provides a number of novel features to evenly distribute service indexes to the resolvers and reduce the number of resolvers to visit. Our simulation study shows that UbiSearch provides good semantic searchability as compared to the centralized indexing system. At the same time, it supports scalable semantic queries with low communication overhead, balanced load distribution among resolvers for service registration and query processing, and personalized semantic matching.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.9 no.2
• /
• pp.49-60
• /
• 1999

IC 카드의 하드웨어적인 제약으로 대부분의 IC 카드는 대칭키 알고리즘을 사용하고 있지만 IC 카드 하드웨어 제조 기술의 발전으로 앞으로는 보안성이 우수한 비대 칭키 알고리즘이 많이 사용될 것이다. 그리고 IC 카드의 가장 큰 제약적 중 하나는 메모리 용량의 한계이다. 따라서 보안상 안전하면서도 메모리를 적게 사용하는 IC 카드 운영체제의 구현을 중요한 문제이다. 그래서 본 논문에서는 다양한 종류의 키 알고리즘을 수용할 수 있는 키 파일 탐색 기법을 제안하였다. 또한 데이터 파일 헤더에 잠금 필드를 삽입하여 보안성을 향상시켰으며 메모리 사용량을 줄일 수 있도록 데이터 파일 헤더만을 이용한 파일 탐색 기법과 자유 공간 탐색 기법을 제안하였다. Because of the evolution of IC card hardware fabrication technologies IC card will be able to accept asymmetric key encryption algorithm in the future. One of the most restrictive points of IC card is memory capacity. Therefore it is an important problem to design a secure IC card operating system using memory in small. In this paper we proposed a key file search mechanism using a key length field inserted in a key file header structure. The key file search mechanism makes IC card execute any key-based encryption algorithm. In addition we proposed inserting a lock field in data file header structure. The lock field intensifies the security of a data file. Finally we proposed a data file search mechanism and free space search mechanism using only data file header. The file system using these mechanisms spends smaller memory than that using a file description table and record of unallocated space.

• Bulletin of the Korean Space Science Society
• /
• 1998.10a
• /
• pp.23.1-23
• /
• 1998

No Abstract.See Full-text

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.61 no.1
• /
• pp.130-134
• /
• 2012

In this paper, we propose a space partitioning technique for swarm robots by using the Centroidal Voronoi Tessellation. The proposed method consists of two parts such as space partition and collision avoidance. The space partition for searching a given space is carried out by a density function which is generated by some accidents. The collision avoidance is implemented by the potential field method. Finally, the numerical experiments show the effectiveness and feasibility of the proposed method.