• Progress in Superconductivity and Cryogenics
• /
• v.23 no.4
• /
• pp.39-43
• /
• 2021

This study deals with the ferromagnetic shims design based on the spherical harmonic coefficient reduction method. The design method using the sequential search method is an intuitive method and has the advantage of quickly reaching the optimal result. The study was conducted for a 400 MHz all-REBCO magnet, which had difficulty in shimming due to the problem of SCF (screening current induced field). The initial field homogeneity of the magnet was measured to be 233.76 ppm at 20 mm DSV (Diameter Spherical Volume). In order to improve the field homogeneity of the magnet, the ferromagnetic shim with a thickness of 1 mil to 11 mil was constructed by a design method in which sequential search algorithm was applied. As a result, the field homogeneity of the magnet could be significantly improved to 0.24 ppm at 20 mm DSV and 0.05 ppm at 10 mm DSV.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1997.10a
• /
• pp.519-522
• /
• 1997

In this study, the collision free path planning method of the articulated manipulator using sequential search is proposed. This method is to find the joint path of the manipulator with many degrees of freedom from the distal joint to the proximal one. To do this, the initial work space of the gantry manipulator, which is a remote maintenance equipment of the radioactive environment, is defined from the condition that the distal joint configuration is determined by the posture of maintenance. Then, 2-dimensional configuration space with the obstacle area is represented and the collision free path of manipulator is searched in the configuration space. And, this method is verified using the graphic simulation in virtual workcell for the spent fuel disassembling processes. The result of this study can be effectively used in implementing the maintenance processes for the hot cell equipment and enhance the reliability of the spent fuel management.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.61-64
• /
• 2003

A band function model paired comparison method (BMPC method) is a kind of a paired comparison methods. Considering the human ambiguities, the BMPC method expressing the human judgment characteristics as a monotonous increase function with some width. Since function types are not specified in a BMPC method, the solution is obtained from inequalities, and the solution is given as a domain. To solve the simultaneous inequalities, the sequential renew method is used in the previous BMPC method. However, the sequential renew method requires much computational effort and memories. Generally, in BMPC method, it is able to solve only a paired comparison table which has less 12-13 samples. For that purpose, a new fast solution algorithm is required. In this paper, we proposed a new “search vector method” which renews the solution domain without creating new edge vectors. By using the method, it is able to decrease the necessary memory spaces and time to solve. The proposed method makes it able to solve more than 15 samples paired comparison inspections which are impossible to solve by previous method.

• Journal of the Korea Society for Simulation
• /
• v.9 no.2
• /
• pp.75-87
• /
• 2000

In this paper, nonstationary multiple sampling plans are discussed which are difficult to solve by analytical method when there exists dependency between the sample data. The initial solution is found by the sequential sampling plan using the sequential probability ration test. The number of acceptance and rejection in each step of the multiple sampling plan are found by grouping the sequential sampling plan's solution initially. The optimal multiple sampling plans are found by simulation. Four search methods are developed U and the optimum sampling plans satisfying the Type I and Type ll error probabilities. The performance of the sampling plans is measured and their algorithms are also shown. To consider the nonstationary property of the dependent sampling plan, simulation method is used for finding the lot rejection and acceptance probability function. As a numerical example Markov chain model is inspected. Effects of the dependency factor and search methods are compared to analyze the sampling results by changing their parameters.

• ETRI Journal
• /
• v.29 no.3
• /
• pp.336-352
• /
• 2007

Sequential pattern mining has become an essential task with broad applications. Most sequential pattern mining algorithms use a minimum support threshold to prune the combinatorial search space. This strategy provides basic pruning; however, it cannot mine correlated sequential patterns with similar support and/or weight levels. If the minimum support is low, many spurious patterns having items with different support levels are found; if the minimum support is high, meaningful sequential patterns with low support levels may be missed. We present a new algorithm, weighted interesting sequential (WIS) pattern mining based on a pattern growth method in which new measures, sequential s-confidence and w-confidence, are suggested. Using these measures, weighted interesting sequential patterns with similar levels of support and/or weight are mined. The WIS algorithm gives a balance between the measures of support and weight, and considers correlation between items within sequential patterns. A performance analysis shows that WIS is efficient and scalable in weighted sequential pattern mining.

• Bulletin of the Society of Naval Architects of Korea
• /
• v.25 no.3
• /
• pp.35-45
• /
• 1988

This paper presents a sophisticated Sequential Linear Approximation Method(SLAM) to solve nonlinear optimization problem and the performance of this method is compared with those of the Penalty Function Method(SUMT), Tangent Search Method(TSM) and Flexible Tolerance Method(FTM). To improve the convenience and flexibility in using the proposed SLAM, an user oriented design optimization language is developed and the application examples are shown for the optimization of propeller principal dimensions and the optimization of bulk carrier principal particulars.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.133-136
• /
• 2002

This paper presents a new method of Huffman decoding which gives a significant improvement of processing efficiency based on the reconstruction of an efficient one-dimensional array data structure incorporating the numeric interpretation of the accrued codewords in the binary tree. In the Proposed search method, the branching address is directly obtained by the arithematic operation with the incoming digit value eliminating the compare instruction needed in the binary tree search. The proposed search method gives 30% of improved Processing efficiency and the memory space of the reconstructed Huffman table is reduced to one third compared to the ordinary ‘compare and jump’ based binary tree. The experimental result with the six MPEG-2 AAC test files also shows about 198% of performance improvement compared to those of the widely used conventional sequential search method.

• International Journal of Computer Science & Network Security
• /
• v.24 no.3
• /
• pp.12-22
• /
• 2024

The travelling salesman problem is very famous and very difficult combinatorial optimization problem that has several applications in operations research, computer science and industrial engineering. As the problem is difficult, finding its optimal solution is computationally very difficult. Thus, several researchers have developed heuristic/metaheuristic algorithms for finding heuristic solutions to the problem instances. In this present study, a new hybrid genetic algorithm (HGA) is suggested to find heuristic solution to the problem. In our HGA we used comprehensive sequential constructive crossover, adaptive mutation, 2-opt search and a new local search algorithm along with a replacement method, then executed our HGA on some standard TSPLIB problem instances, and finally, we compared our HGA with simple genetic algorithm and an existing state-of-the-art method. The experimental studies show the effectiveness of our proposed HGA for the problem.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.369-370
• /
• 2006

This paper presents a new method for Huffman decoding specially designed for the MPEG-2 AAC audio. The method significantly enhances the processing efficiency of the conventional Huffman decoding realized with the ordinary binary tree search method. A data structure is newly designed based on the numerical interpretation of the incoming bit stream and its utilization for the offset oriented nodes allocation. The experimental results show the average performance enhancement of 54% and 665%, compared to those of the conventional binary tree search method and the sequential search method, respectively.

• 한국전산유체공학회:학술대회논문집
• /
• 2005.10a
• /
• pp.163-167
• /
• 2005

A research to evaluate efficiency of design optimization was performed for aerodynamic design optimization problem in distributed computing environment. The aerodynamic analyses which take most of computational work during design optimization were divided into several jobs and allocated to associated PC clients through network. This is not a parallel process based on domain decomposition rather than a simultaneous distributed-analyses process using network-distributed computers. GBOM(gradient-based optimization method), SAO(Sequential Approximate Optimization) and RSM(Response Surface Method) were implemented to perform design optimization of transonic airfoil and to evaluate their efficiencies. One dimensional minimization followed by direction search involved in the GBOM was found an obstacle against improving efficiency of the design process in distributed computing environment. The SAO was found quite suitable for the distributed computing environment even it has a handicap of local search. The RSM is apparently the fittest for distributed computing environment, but additional trial and error works needed to enhance the reliability of the approximation model are annoying and time-consuming so that they often impair the automatic capability of design optimization and also deteriorate efficiency from the practical point of view.