• Journal of the Korean Institute of Telematics and Electronics
• /
• v.18 no.3
• /
• pp.9-14
• /
• 1981

A nonexhaustive procedure for obtaining minimally testable Reed-Muller Canonical (RMC) forms with minimal 1itera1s of switching functions is presented, And, it is shown that this proced tore allows nonexhaustive and near-optimal handling of functions with Doft Care conditions.

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

In this paper, we present an algorithm for the multicast routing problem when there exit the cell replication limits of ATM switching nodes. This problem can be formulated as a Degree Constrained Minimum Steiner Tree Problem(DCSP). The proposed algorithm is a modification of the shortest path heuristic originally devised for minimum Steiner tree problem. From the experimental results, it can be seen that our algorithm is efficient to obtain a near optimal solution with comparatively low computational time.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.27 no.3
• /
• pp.106-112
• /
• 2004

This paper presents a new heuristic algorithm for the machine cell(MC) formation problem. MC formation problem is represented as an unbalanced k-way network partition and the proposed algorithm uses four stage-approach to solve the problem. Four stages are natural sub-network formation, determination of intial vertexes for each sub-network, determination of initial partition, and improvement of initial partition. Results of experiments show that the suggested algorithm provides near optimal solutions within very short computational time.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.29A no.4
• /
• pp.74-82
• /
• 1992

This paper deals with the scheduling problems, which are the most important subtask in High-level Synthesis. ILP(integer linear programming) formulations are used as a scheduling problem approach.For practical application to digital system design, we have concentrated our attentions on pipelined datapath scheduling. For experiment results, we choose the 5-th order digital wave filter as a benchmark and do the schedule. Finally, we can obtain better and near-optimal scheduling results.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1990.04a
• /
• pp.220-221
• /
• 1990

The objective of this study is to determine a near-optimal time schedule for processing necessary jobs in order to minimize total elapsed time. The fundamental assumptions are that jobs to be processed are classified into several groups and jobs within the same group are processed in succession in the flow-type GT line. A heuristic method by V. A. Petrov is applied to determine the job sequencing. In consideration of production quantity, group sequences and job sequences for each group are determined and the start time of processing for each job is calculated by computer.

• Proceedings of the Optical Society of Korea Conference
• /
• 2003.02a
• /
• pp.296-297
• /
• 2003

사회의 정보화가 급속하게 진전됨에 따라 취급해야 할 데이터 양이 증가되면서 정보 저장장치의 고속화, 소형화, 및 대용량화의 필요성이 대두되고 있다. 많은 양의 데이터를 저장하기 위해서는 저장장치의 물리적 디스크 공간이 높은 기록밀도를 가져야 한다. 이를 위한 방법으로 하드디스크 기술과 광자기 디스크 장치(magneto-optical disk drive) 기술을 결합하는 근접장 복합 기록 방법(Near field hybrid recording method)들이 보고 되었다. (중략)

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.645-651
• /
• 2002

we propose a k-nearest neighbors(k-NN) based pattern selection method. The method tries to select the patterns that are near the decision boundary and that are correctly labeled. The simulations over synthetic data sets showed promising results: (1) By converting a non-separable problem to a separable one, the search for an optimal error tolerance parameter became unnecessary. (2) SVM training time decreased by two orders of magnitude without any loss of accuracy. (3) The redundant SVM were substantially reduced.

• Journal of the Korea Society for Simulation
• /
• v.12 no.1
• /
• pp.35-48
• /
• 2003

This paper suggests the long-term strategy of the production distribution planning considering the capacity of factory production and the uncertain demand in a supply chain. This paper determines the near optimal capacity of factory production by using the advantages of mathematical and simulation models. Also, the relationship between the capacity from the suggested model and the strategy of production and distribution in a supply chain is studied. Arena is used for modeling and analysis.

• Journal of the Korean Society for Precision Engineering
• /
• v.17 no.1
• /
• pp.185-191
• /
• 2000

Direct ＆ adaptive slicing of sculptured surfaces in RP improves, quality ＆ accuracy of the final product, compared to the slicing with uniform layer thickness or the slicing of facets (ie, STL). Present D＆A slicing procedures adaptively compute the next layer thickness based on the surface information of current sliced contour, which assumes constant normal curvature values. In some cases, however. such assumption leads to intolerable slicing result which cannot correctly consider the entire local feature shape. We propose improved adaptive slicing algorithms which can determine near-optimal layer thickness, including illustrated examples.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.52.2-52
• /
• 2001

We propose a new optimization method to improve the productivity of dispenser machines in PCB assembly lines. The optimization problem for multi-nozzle dispensers is formulated as a variant TSP. A genetic algorithm is applied to the problem to get a near-optimal solution. Chromosome and some operator are newly defined to implement the genetic algorithm for multi-nozzle dispensers. Simulation results are then presented to verify the usefulness of the method.