• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.3
• /
• pp.16-23
• /
• 1998

In this paper, we present a fast and efficient Iterative Improvement Partitioning(IIP) technique for VLSI circuits and hybrid bucket structures on its implementation. The IIP algorithms are very widely used in VLSI circuit partition due to their time efficiency. As the performance of these algorithms depends on choices of moving cell, various methods have been proposed. Specially, Cluster-Removal algorithm by S. Dutt significantly improved partition quality. We indicate the weakness of previous algorithms wjere they used a uniform method for choice of cells during for choice of cells during the improvement. To solve the problem, we propose a new IIP technique that selects the method for choice of cells according to the improvement status and present hybrid bucket structures for easy implementation. The time complexity of proposed algorithm is the same with FM method and the experimental results on ACM/SIGDA benchmark circuits show improvment up to 33-44%, 45%-50% and 10-12% in cutsize over FM, LA-3 and CLIP respectively. Also with less CUP tiem, it outperforms Paraboli and MELO represented constructive-partition methods by about 12% and 24%, respectively.

• Journal of the Korean Chemical Society
• /
• v.7 no.2
• /
• pp.174-178
• /
• 1963

The new method to determine the parameters in the liquid partition function of H. Eyring and co-workers is proposed, in which method the equilibrium condition of the three phases and the boundary condition of the liquid partition function at the triple point are used. The calculated thermodynamic properties using the new determined parameters are agreed well with the observed values.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.61 no.1
• /
• pp.130-134
• /
• 2012

In this paper, we propose a space partitioning technique for swarm robots by using the Centroidal Voronoi Tessellation. The proposed method consists of two parts such as space partition and collision avoidance. The space partition for searching a given space is carried out by a density function which is generated by some accidents. The collision avoidance is implemented by the potential field method. Finally, the numerical experiments show the effectiveness and feasibility of the proposed method.

• Journal of the Korean School Mathematics Society
• /
• v.14 no.3
• /
• pp.261-275
• /
• 2011

Seok-Jung Choi's Jisuguimundo mentioned as a brilliant legacy in the history of Korean mathematics had been cloaked in mystery for 300 years. In the meantime there has been some efforts to find solutions, and some particular answers were found, but no one achieved full success mathematically. By the way, H-alternating method showed that to find solutions of Jisuguimundo is possible, even though that method restricted magic number to 88~92 and 94~98. In this paper, $n{\times}n$ Jisuguimundo is defined, and it is showed that finding solutions of it is always possible in case of partition $({\upsilon}+1)+{\upsilon}+({\upsilon}+1)$ & co-partition ${\upsilon}+({\upsilon}+1)+{\upsilon}$, partition $({\upsilon}+1)+({\upsilon}-1)+({\upsilon}+1)$ & co-partition $({\upsilon}-1)+({\upsilon}+1)+({\upsilon}-1)$, partition $({\upsilon}+1)+({\upsilon}+2)+({\upsilon}+1)$ & co-partition $({\upsilon}+2)+({\upsilon}+1)+({\upsilon}+2)$, and partition $({\upsilon}+1)+({\upsilon}+3)+({\upsilon}+1)$ & co-partition $({\upsilon}+3)+({\upsilon}+1)+({\upsilon}+3)$. And It is suggested to find solutions of $n{\times}n$ Jisuguimundo could be used as a task for problem solving.

• Environmental Analysis Health and Toxicology
• /
• v.20 no.4 s.51
• /
• pp.351-358
• /
• 2005

The n -octanol/water partition coefficient (Pow) is one of the most important parameters employed for estimating a chemiral's environmental fate and toxicity. The shake-flask method, one direct experimental method, i.1 prone to experimental artifacts for highly hydrophobic compounds. Thus, a valid method for direct determination of the Pow of highly hydrophobic compounds is needed. The slow -stirring method has been demonstrated to provide reliable log Pow data to log Pow greater than 5. This study was performed to evaluate the accuracy of slow- stirring experiment for determination of log Pow, particularly for highly hydrophobic compounds. 1, 2, 3, 4-tetrachlorobenzene, hexachlorobezene, 2, 2', 3, 3', 5, 5', 6, 6'-octachlorobiphenyl, decachlorobiphenyl, and p, p'-DDT (4.5$\times$0.02, 5.41$\times$0.06, 7.26$\times$0.04, 7.87$\times$0.10, and 6.03$\times$0.06, respectively. The octanol/water partition coefficient by the slow-stirring method were very similar to the literature values. These results indicate that the slow- stirring method allows for reliable determination of log Pow of highly hydrophobic chemicals.

• 한국공간정보시스템학회:학술대회논문집
• /
• 2007.06a
• /
• pp.59-64
• /
• 2007

데이타 중심 센서 네트워크에서는 측정된 데이타의 값에 따라 데이타를 저장하는 센서 노드가 결정되기 때문에 같은 값을 갖는 데이타가 빈번하게 발생하면 이를 저장하는 센서 노드에 부하가 집중되어 에너지가 빠르게 고갈되는 문제가 있다. 또한 센서 네트워크가 확장되면 데이타 저장 및 질의 처리시 목적 센서 노드로의 라우팅 거리가 멀어져 통신 비용이 증가되는 문제가 있다. 그러나 기존 연구들은 데이타 저장의 효율적인 관리에만 치우쳐 이와 같은 문제를 효율적으로 해결하지 못하고 있다. 본 논문에서는 이러한 문제를 해결하기 위해 비균등 네트워크 분할(Non-Uniform Network Spilt: NUNS) 기법을 제안한다. NUNS는 센서 네트워크를 센서 노드 개수와 분할된 영역 크기 차이가 최소가 되도록 비균등 크기의 Partition으로 분할하고 각 Partition에서 발생한 데이타를 그 Partition 내의 센서 노드가 저장 관리함으로써 센서 노드의 데이타 저장 부하를 분산시키고, 센서 네트워크의 확장에 따른 통신 비용을 줄인다. 그리고 NUNS는 각 Partition을 분할된 영역 크기 차이가 최소가 되도록 센서 노드 개수만큼 비균등하게 Zone으로 분할함으로써 센서 노드가 없는 Zone으로 인해 센서 노드에 부하가 집중되는 것을 막고 불필요한 라우팅 비용을 줄인다.

• Communications for Statistical Applications and Methods
• /
• v.24 no.5
• /
• pp.457-480
• /
• 2017

We develop a random partition procedure based on a Dirichlet process prior with Laplace distribution. Gibbs sampling of a Laplace mixture of linear mixed regressions with a Dirichlet process is implemented as a random partition model when the number of clusters is unknown. Our approach provides simultaneous partitioning and parameter estimation with the computation of classification probabilities, unlike its counterparts. A full Gibbs-sampling algorithm is developed for an efficient Markov chain Monte Carlo posterior computation. The proposed method is illustrated with simulated data and one real data of the energy efficiency of Tsanas and Xifara (Energy and Buildings, 49, 560-567, 2012).

• Journal of the Korea Institute of Building Construction
• /
• v.12 no.6
• /
• pp.575-585
• /
• 2012

The extruded cement panel, which has many advantages as a prefabricated method, has been limited in its application due to its low fire-resistance. However, an extruded cement panel produced by mixing a-hemihydrate gypsum offers dramatically improved fire-resistance and is expected to have wide-ranging applications in the construction sector as an interior material or partition wall between housing units. Sound insulation performance is very important for the partition wall between housing units. In this study, the sound insulation performance of the extruded cement panel produced through the mixture of a-hemihydrate gypsum is reviewed in order to determine its usability for a partition wall between housing units and for interior materials. Through the review it was found that the wall formed using the extruded cement panels produced by mixing the a-hemihydrate gypsum have ★★★ class in sound insulation test, equal or superior compared with the other two types of extruded cement panel walls currently available in the market.

• Proceedings of the KIEE Conference
• /
• 2000.11a
• /
• pp.223-225
• /
• 2000

Network congestion is important problem that must be managed for active power contracts in deregulated power industry. Existing network partition technique is based on statistical method don't suggest clear network partition criterion. So in this paper we proposed a new network partition technique using the marginal cost sensitivity to fairly allocate congestion cost to network user.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.54
• /
• pp.1-11
• /
• 2000

This study suggests the partition algorithm for updating the discovered association rules in large database, because a database may allow frequent or occasional updates, and such update may not only invalidate some existing strong association rules, but also turn some weak rules into strong ones. the Partition algorithm updates strong association rules efficiently in the whole update database reuseing the information of the old large itemsets. Partition algorithms that is suggested in this study scans an incremental database in view of the fact that it is difficult to find the new set of large itemset in the whole updated database after an incremental database is added to the original database. This method of generating large itemsets is different from that of FUP(Fast Update) and KDP(Kim Dong Pil)