• 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.

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.557-560
• /
• 1988

In this paper, we present a new k-way partitioning algorithm for a graph of an electrical circuit wherein nodes and edges are regarded as cells (modules) and nets, respectively. In contrast to the previous work, our method is based upon a linearly ordered partition paradigm. We also claim that the maximum number of netcuts mostly governs the performance of k-way partitioning, thus having influence on the construction of a new cost function. In addition, our approach elaborates upon balancing the partition size. Our experiments show excellent results in comparison with previous k-way partitioning algorithms.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.1
• /
• pp.22-33
• /
• 1999

In this paper, we propose a new multi-way circuit partitioning system that partition large circuits to progrmmable circuit board which consist of FPGAs and interconnect components. Here the routing topology among the chips are predetermined and the number of available interconnections are fixed. Since the given constraints are difficult to be satisfied by the previous partition method, we suggest a new multi-way partition method by target restriction that considers all the constraints for the given board. To speed up, we construct a multi-level cluster tree for hierarchical partitioning. Experimental results for several benchmarks show that the our partition method partition them by satisfying all the given constraints and it used up to 10 % fewer interconnections among the chips than the previous K-way partition method.

• Honam Mathematical Journal
• /
• v.39 no.2
• /
• pp.267-273
• /
• 2017

The objective of this note is to establish three results between q-products and combinatorial partition identities in a elementary way. Several closely related q-product identities such as (for example)continued fraction identities and Jacobis triple product identities are also considered.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.2
• /
• pp.38-49
• /
• 1997

In this paper, w describe partitioning large circuits into multiple chips on the programmable FPCB for rapid prototyping. FPCBs consists of areas for FPGAs for logic and interconnect components, and the routing topology among them are predetermined. In the partition problem for FPCBs, the number of wires ofr routing among chips is fixed, which is an additonal constraints to the conventional partition problem. In order to deal with such aconstraint properly we first define a new partition problem, so called the topologybased partition problem, and then propose a heuristic method. The heuristic method is based on the simulated annealing and clustering technique. The multi-level tree clustering technique is used to obtain faster and better prtition results. In the experimental results for several test circuits, the restrictions for FPCB were all satisfied and the needed execution time was about twice the modified K-way partition method for large circuits.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.21 no.12
• /
• pp.2114-2120
• /
• 1997

This paper presents precision machining of sculptured surfaces with a flat end cutter as follows; tool path generation using partition machining method and elimination interference. These days many researchers are getting interested in flat end cutter having a good cutting performance as machine tool for machining sculptured surfaces. It can get low curvature surfaces and have a much better material removal rates and longer tool life. Partition machining method is the first submitted in this paper. It is a new method of tool path generation, which means the way to map surfaces under the normal vector and then to cut them partially.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.12
• /
• pp.1548-1555
• /
• 1999

본 논문에서는 하이퍼그래프의 {{{{k분 분할을 위한 서열화(vertex ordering) 알고리즘의 효율을 개선하기 위한 후처리 알고리즘인 재서열법을 소개한다. 제안된 알고리즘은 {{{{k분 분할을 위한 다양한 알고리즘에 쉽게 적용될 수 있다. 보통 초기 분할은 서열화를 기반으로 하는 알고리즘에 의해 형성된다. 그 후 제안된 알고리즘은 클러스터와 정점을 재배열하여 분할하는 과정을 반복함으로써 분할의 효율을 향상시켜간다. 이 방법을 여러 가지 그래프에 적용하여 향상된 결과를 얻었다.Abstract This paper addresses the post-processing algorithm for {{{{k-way hypergraph partitioning by using a cluster and vertex reordering method. The proposed algorithm applies to several {{{{k-way partitioning algorithm. Generally, the initial partition generating method is based on a vertex ordering algorithm. Our reordering algorithm construct an enhanced partitioning by iteratively partition the reodered clusters and vertices. Experimental results on several graphs demonstrate that reodering provides substantial enhancement.

• Journal of information and communication convergence engineering
• /
• v.7 no.2
• /
• pp.141-147
• /
• 2009

To initialize and maintain self-organizing networks such as mobile ad hoc networks, address allocation protocol is essentially required. However, centralized approaches that pervasively used in traditional networks are not recommended in this kind of networks since they cannot handle with mobility efficiently. In addition, previous distributed approaches suffer from inefficiency with control overhead caused by duplicated address detection and management of available address pool. In this paper, we propose a new dynamic address allocation scheme, which is based on adaptive partition. An available address is managed in distributed way by multiple agents and partitioned adaptively according to current network environments. Finally, simulation results reveal that a proposed scheme is superior to previous approach in term of address acquisition delay under diverse simulation scenarios.

• The Transactions of the Korean Institute of Electrical Engineers C
• /
• v.53 no.10
• /
• pp.530-538
• /
• 2004

A electromagnetic waves are used for sensing in insulation diagnosis at electric machine or equipment. When it a method, waves are transformed into the FFT(Fast Fourier Transform); a kind of the process for data transformation. In a general way, a scientist use frequncy band 30[㎒]～l[㎓] to applied field. If we are measured high frequency band, we will need to a high capacity hardware. Also a antenna has a fault on atmospheric phenomena, outside environment and the like. In this paper We proposed new method for detecting electric equipment faulty state using only electric voltage which is generally measured in the electric and electronic field. It is called the Partition-FFT The analytic method is this first divide measured voltage waves into equal parts, second each deal with give effect to the FFT, finally each results deal with a graphic method and gather graphic. We are compare Partition-FFT with discharge form by tracking tester. As the result it demonstrated that the Partition-FFT is applicable.

• Proceedings of the Korean Society of Near Infrared Spectroscopy Conference
• /
• 2001.06a
• /
• pp.1131-1131
• /
• 2001

To develop a nondestructive quality evaluation technique of fruits, a K-mean algorism is applied to near infrared (NIR) spectroscopy of apples. The K-mean algorism is one of neural network partition methods and the goal is to partition the set of objects O into K disjoint clusters, where K is assumed to be known a priori. The algorism introduced by Macqueen draws an initial partition of the objects at random. It then computes the cluster centroids, assigns objects to the closest of them and iterates until a local minimum is obtained. The advantage of using neural network is that the spectra at the wavelengths having absorptions against chemical bonds including C-H and O-H types can be selected directly as input data. In conventional multiple regression approaches, the first wavelength is selected manually around the absorbance wavelengths as showing a high correlation coefficient between the NIR $2^{nd}$ derivative spectrum and Brix value with a single regression. After that, the second and following wavelengths are selected statistically as the calibration equation shows a high correlation. Therefore, the second and following wavelengths are selected not in a NIR spectroscopic way but in a statistical way. In this research, the spectra at the six wavelengths including 900, 904, 914, 990, 1000 and 1016nm are selected as input data for K-mean analysis. 904nm is selected because the wavelength shows the highest correlation coefficients and is regarded as the absorbance wavelength. The others are selected because they show relatively high correlation coefficients and are revealed as the absorbance wavelengths against the chemical structures by B. G. Osborne. The experiment was performed with two phases. In first phase, a reflectance was acquired using fiber optics. The reflectance was calculated by comparing near infrared energy reflected from a Teflon sphere as a standard reference, and the $2^{nd}$ derivative spectra were used for K-mean analysis. Samples are intact 67 apples which are called Fuji and cultivated in Aomori prefecture in Japan. In second phase, the Brix values were measured with a commercially available refractometer in order to estimate the result of K-mean approach. The result shows a partition of the spectral data sets of 67 samples into eight clusters, and the apples are classified into samples having high Brix value and low Brix value. Consequently, the K-mean analysis realized the classification of apples on the basis of the Brix values.