• Journal of applied mathematics & informatics
• /
• v.8 no.1
• /
• pp.181-197
• /
• 2001

A heuristic method TABU-CSP using Tabu Search (TS) is described for solving Constraint Satisfaction Problems (CSPs). The method is started with a complete but inconsistent solution of a binary CSP and obtained in prespecified number of iterations either a consistent solution or a near optimal solution with an acceptable number of conflicts. The repair in the solution at each iterative step is done by using two heuristics alternatively. The first heuristic is a min-conflicts heuristic that chooses a variable with the maximum number of conflicts and reassigns it the value which leads to the minimum number of conflicts. If the acceptable solution is not reached after the search continued for a certain number of iterations, the min-conflict heuristic is changed and the variable selected least number of times is chosen for repair. If an acceptable solution is not reached, the method switches back to the min-conflict heuristic and proceeds further. This allowed the method to explore a different region of search space space for the solution as well as to prevent cycling. The demonstration of the method is shown on a toy problem [9]which has no solution. The method is then tested on various randomly generated CSPs with different starting solutions. The performance of the proposed method in terms of the average number of consistency is checked and the average number of conflicts is conflicts is compared with that of the Branch and Bound(BB) method used to obtain the same solution. In almost all cases, the proposed method moves faster to the acceptable solution than BB.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.8 no.4
• /
• pp.159-165
• /
• 2012

The accurate focusing position should be determined for accurate measurements In VMS. Camera lens focusing is an important problem in computer vision and video measuring systems (VMS) that use CCD cameras and high precision XYZ stages. Camera focusing is a very important step in high precision measurement systems that use computer vision technique. The auto focusing process consists of two steps, the focus value measurement step and the exact focusing position determination step. It is suitable for eliminating high frequency noises with lower processing time and without blurring. An automatic focusing technique is applied to measure a crater with a one-dimensional search algorithm for finding the best focus. Throughout this paper, the suggested algorithm for the Auto focusing was combined with the learning. As a result, it is expected that such a combination would be expanded into the system of recognizing voices in a noisy environment.

• Journal of applied mathematics & informatics
• /
• v.24 no.1_2
• /
• pp.333-342
• /
• 2007

A nonsmooth PGD scheme for minimizing a nonsmooth convex function is presented. In the parallelization step of the algorithm, a method due to Pang, Han and Pangaraj (1991), [7], is employed to solve a subproblem for constructing search directions. The convergence analysis is given as well.

• Transactions of Materials Processing
• /
• v.16 no.2 s.92
• /
• pp.138-143
• /
• 2007

Superplastic forming/diffusion bonding (SPF/DB) processes were analyzed using a 3-D rigid visco-plastic finite element method. A constant-triangular element based on membrane approximation and an incremental theory of plasticity are employed for the formulation. The coulomb friction law is used for interface friction between tool and material. Pressure-time relationship for a given optimal strain rate is calculated by stress and pressure values at the previous iteration step. In order to improve the contact searching, hierarchical search algorithm has been applied and implemented into the code. Various geometries including sandwich panel and 3 sheet shape for 3-D SPF/DB model are analyzed using the developed program. The validity fer the analysis is verified by comparison between analysis and results in the literature.

• YAKHAK HOEJI
• /
• v.41 no.3
• /
• pp.298-304
• /
• 1997

Molecular mechanics and conformation search methods were carried oyt to investigate the relationship between conformations and thromboxane synthetase ingibitory activities of om ega-pyridylalkenoic acids. The initial geometries of ${\omega}$-pyridylalkenoic acids and heme part of cytochrome P-450 were obtained from MM+ geometry optimization. The bond lenths and angles were not varied by step during the conformation searching. Stable conformers of some ${\omega}$-pyridylalkenoic acids were obtained by comformational search method. The distances were 8.5~10.8 ${\AA}$- between N atom at 3-position of pyridine ring and C atom at carboxylic group of stable ${\omega}$-pyridylalkenoic acids. The conformations of ${\omega}$-pyridylalkenoic acids and heme part complex were determined by same method. In theses structures, benzene ring and ethylene group in ${\omega}$-pyridylalkenoic acids are making the structure more rigid and increase inhbitory activity. The electron donating groups in C atom shich is connected to pyridine ring also increase activity.

• Journal of the Korea Society of Computer and Information
• /
• v.3 no.2
• /
• pp.119-124
• /
• 1998

Block Matching Motion Estimation(BMME) Algorithm is demands a very large amount of computing power and have been proposed many fast algorithms. These algorithms are many problem that larger size of VLSI scale due to non-localized search block data and problem of non-reuse of input data for each processing step. In this paper, we designed systolic arry of high processing capacity, constraints input output pin size and reuse of input data for small VLSI size. The proposed systolic array is optimized memory access time because of iterative reuse of input data on search block and become independent of problem size due to increase of algorithm's parallelism and total processing elements connection is localized spatial and temporal. The designed systolic array is reduced O(N6) time complexity to O(N3) on moving vector and has O(N) input/output pin size.

• Journal of Korean Library and Information Science Society
• /
• v.15
• /
• pp.207-243
• /
• 1988

This study is an attempt to furnish some helpful data for the maximum use of online information retrieval systems based on the comparative analysis of commands and operating terms employed by DIALOG, ORBIT and BRS which are three largest information retrieval systems in the world. To begin with, the historical development, service contents and retrieval functions of three systems were overviewed in the second chapter, on the basis of which the concrete functions and contents of the commands and the operating terms of the three systems were compared and analyzed one another. Commands were explained divided into basic and special ones. The basic commands subdivided into 44 items were put into the form of a diagram(Table 1). The special commands were first subdivided into search commnad, output-related commands and su n.0, pplementary commands, and then 14 items of which were comparatively analyzed and were represented as a chart(Table 2). In addition, any stand-alone commands employed by each system were also analyzed as a chart(Table 3). The Operating terms other than commands were subdivided into 16 items and were represented as a chart(Table 4). Password, inverted file, search step number in search session, etc were explained to the very detailed extent. A self-evident, single word is that the through understanding of commands is essential to the maximm use of all the functions of each of three systems.

• Journal of IKEEE
• /
• v.17 no.1
• /
• pp.36-43
• /
• 2013

This paper proposes a motion estimation algorithm with run-time adaptive workload control. It has optimized performance within limited hardware resources while guaranteeing hard realtime operation. It performs maximum searches within hard realtime constraints, since it determines search steps and workload adaptively. It reduces the hardware size to 1/4~1/400 of conventional algorithms, while its PSNR degradation is only 0.02~0.44 dB. It can be easily applied to most conventional fast algorithms, so it is useful to design realtime encoder chips.

• Journal of Korean Library and Information Science Society
• /
• v.26
• /
• pp.365-400
• /
• 1997

The interface design for most present query-base model of OPAC systems does not include the function to implement an iterative feedback process till the user arrives at satisfied search results through the interaction with the system. Also, the interface doesn't provide the help function for a user to select pertinent search terms. To formulate a query at the present OPAC system, a user should learn a set of syntax different from system to system. All of above mentioned things make an end-user feel difficult to utilize an OPAC system effectively. This experimental system is attempted to alleviate a few limitations of the present OPAC system by a n.0, pplying the direct-manipulation technique as well as the feedback principle. First, this system makes it unnecessary for a user to learn some syntax for query formulation by providing option buttons for access points. Second, this system makes it possible for a user to decide whether each displayed record is relevant or not, and for keywords included in the relevant records to be automatically stored in order to be used for later feedback. Third, in this system, the keywords stored in [sayongja yongeu bogyanham] can be deleted if unnecessary or can selected as search terms for a query expansion as well as a query modification. Fourth, in this system, after inputting the original query, the feedback process can be proceed without coming back to the previous search step until a user becomes satisfied with the search results. In conclusion, the searching behaviors of heterogeneous users should be continuously observed, analysed, and studied, the findings of which should be integrated into the design for the interface of the OPAC system.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.9
• /
• pp.139-147
• /
• 2012

This paper suggests simple search algorithm for optimal solution in assignment problem. Generally, the optimal solution of assignment problem can be obtained by Hungarian algorithm. The proposed algorithm reduces the 4 steps of Hungarian algorithm to 1 step, and only selects the minimum cost of row and column then gets the optimal solution simply. For the 27 balanced and 7 unbalanced assignment problems, this algorithm finds the optimal solution but the genetic algorithm fails to find this values. This algorithm improves the time complexity O($n^3$) of Hungarian algorithm to O(n). Therefore, the proposed algorithm can be general algorithm for assignment problem replace Hungarian algorithm.