• Journal of Biomedical Engineering Research
• /
• v.9 no.2
• /
• pp.153-158
• /
• 1988

A three-dimensional surface is reconstructed from contour information as identified on two-dimensional computed tomographic slices. Gradient operator with curvature constraint would be applied to extract the contour automatically, and backtracking is also adopted to reduce the tracking error. The surface between the consecutive slice is efficiently reconstructed using a triangular surface tiles. Hidden surface elimination, shading and parallel projection of the reconstructed surface are provied on the display screen.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.4
• /
• pp.133-149
• /
• 1997

The major two steps required to design a cellular layout are cell formation and cell layout. Because of the differences between manufacturing and assembly operations, the logic of cell formation and cell layout between an FMS and an FAS is not the same. Since the time for the assembly operations is usualaly relatively short, the transfer time is thus very crucial for the performance of assembly systems. Transfore in a cellular FAS it is more important to eliminate backtracking operations in assembly planning, not to allow intercellular movements in cell formation, and to arrange machines according to assembly sequence in cell layout. This study presents a method for the integrated layout design in cellular FASs considering the characteristics of FAS, layout, and production factors.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.6
• /
• pp.1557-1564
• /
• 1997

We propose an extension to Prolog called the count term for controlling Prolog execution. The purpose is to allow the programmers as well as the users to have greater flexibility in controlling the execution behavior of Prolog programs and for limiting the number of answers or proofs retrieved when Prolog is used as a database query language. Both syntax and operational semantics of the count term are defined. An implementation strategy based on WAM (Warren Abstract Machine) by modifying instructions related to backtracking behavior has been suggested.

• Journal of the military operations research society of Korea
• /
• v.9 no.1
• /
• pp.29-49
• /
• 1983

The algorithm developed in this paper utilized kettelle's [1] idea of the undominated allocation sequence and his way of tableau computation to solve the more general spares allocation problem in the system availability optimization. The algorithm is to optimally allocate resources to the independent modules which are connected to be series/parallel/mixed system configurations. It has advantages over the standard dynamic programming algorithm by eliminating the need for backtracking and by solving the allocation problem for any budget size. By careful heuristic inspection the algorithm can be made very efficient for manual calculations because large blocks of cells can be eliminated from computation. A numerical example is provided to illustrate the allocation algorithm.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.12
• /
• pp.1933-1939
• /
• 1990

In this paper, we proposed an algorithm which used backtracking method to get time information, and it be modelled DMS (Dynamic Multisection) by feature vectors and time information whic are represented to similiar feature in word patterns spoken during continuous time domain, for Korean Speech recognition by independent speaker using DMS. Each state of model is represented time sequence, and have time information and feature vector. Typical feature vector is determined as the feature vector of each state to minimize the distance between word patterns. DDD Area names are selected as recognition wcabulary and 12th LPC cepstrum coefficients are used as the feature parameter. State of model is made 8 multisection and is used 0.2 as weight for time information. Through the experiment result, recognition rate by DMS model is 94.8%, and it is shown that this is better than recognition rate (89.3%) by MSVQ(Multisection Vector Quantization) method.

• Convergence Security Journal
• /
• v.14 no.2
• /
• pp.57-63
• /
• 2014

Internet users drastically increases, also through the Internet to buy various intrusion significantly increased. These various methods of intrusion defense thinking hacker attempting to hack the actual position of the real-time tracking of the intruder backtracking technique for research have been actively carried out. In this paper, a technique used in TCP Connection trace-back System in one packet trace-back technique watermarking technique using TCP Hijacking Connection Reply packets how to solve the difficulties of maintaining presented.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.61
• /
• pp.105-114
• /
• 2000

Job Shop Problem which consists of the m different machines and n jobs is a NP-hard problem of the combinatorial optimization. Each job consists of a chain of operations, each of which needs to be processed during an uninterrupted time period of a given length on a given machine. Each machine can process at most one operation at a time. The purpose of this paper is to develop the heuristic method to solve large scale scheduling problem using Constraint Satisfaction Problem method and Simulated Annealing. The proposed heuristic method consists of the search algorithm and optimization algorithm. The search algorithm is to find the solution in the solution space using CSP concept such as backtracking and domain reduction. The optimization algorithm is to search the optimal solution using SA. This method is applied to MT06, MT10 and MT20 Job Shop Problem, and compared with other heuristic method.

• Journal of applied mathematics & informatics
• /
• v.29 no.1_2
• /
• pp.173-190
• /
• 2011

In this paper, we construct a new approach of affine scaling interior algorithm using the affine scaling conjugate gradient and Lanczos methods for bound constrained nonlinear optimization. We get the iterative direction by solving quadratic model via affine scaling conjugate gradient and Lanczos methods. By using the line search backtracking technique, we will find an acceptable trial step length along this direction which makes the iterate point strictly feasible and the objective function nonmonotonically decreasing. Global convergence and local superlinear convergence rate of the proposed algorithm are established under some reasonable conditions. Finally, we present some numerical results to illustrate the effectiveness of the proposed algorithm.

• Asia pacific journal of information systems
• /
• v.9 no.2
• /
• pp.1-17
• /
• 1999

A feedback echo is a structured restatement of the user's query and informs the user what the system intends to do for the query. This provides backtracking of the user's query so that the user knows how the system has interpreted the query. This study scrutinizes whether the feedback echo, as currently available in the INTELLECT commercial system, can improve the performance of a casual user using a restricted natural language database interface. This study concludes that the particular type of feedback echo available in this commercial system was not effective in terms of overall performance for casual users. It is worth mentioning, however, that the feedback echo was effective for the specific type of error: using wrong conditions for data retrieval.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.10a
• /
• pp.496-499
• /
• 2008

현재 정보영재 교육에서 중요성이 증대되는 사고력 신장 교육에 적합한 교수-학습 프로그램이 부족한 실정이다. 따라서 이 논문에서는 정보영재의 교육과정에 실제적으로 적용할 수 있는 교수-학습 모형을 제시한다. 정보영재 사고력 신장을 위한 영역별 교육 내용에 공통적으로 포함되는 문제들을 분석하여 사고력 신장에 적합한 교육 프로그램 모형으로서 OR 트리에 기반을 둔 교수-학습 모형을 제시한다. 이 논문에서 제시된 OR 트리형 교수-학습 모형을 정보영재의 현장 지도에 도입하기 위하여 8-puzzle 문제를 예로 들어 적용 방안을 제시하며, 적용 결과를 분석하여 교육 프로그램 개발의 타당성을 검증한다. OR 트리형 교수-학습 모형에서는 정보영재의 사고력 신장을 위한 교육 과정에서 주요 내용이 되는 backtracking과 heuristic 개념을 배우며 트리의 탐색 방법들을 익히게 된다.