• KOREAN JOURNAL OF PACKAGING SCIENCE & TECHNOLOGY
• /
• v.10 no.1
• /
• pp.7-14
• /
• 2004

Migration behavior of selected solvents and food samples showed differences of the chemical structures and polarities, the food samples which have similar polar expresses more higher affinity than different polar degrees. Water which is polar has a highest partitioning coefficient values on polar isopropanol, and oil which is nonpolar has highest partitioning value on non-polar toluene. The increasing order of partitioning values was accord with increasing water contents in food samples. It is showed that the wheat flour with 13.2% moisture content has the highest partitioning coefficient values on the isopropanol with -OH. Kp value of sugar showed remarkable lower partitioning coefficient values than other food samples due to high degree crystallinity. This phenomenon can be predictable with ${\delta}$ values, because order of partitioning coefficient values which comes out through the experiment and the sequence of Hildebrand solubility parameter value difference between food sample and printing ink solvent correspond almost. This Hildebrand solubility parameter value can be easily applied to the food package industry because the effect of food-safety can be considered without passing through complicated steps by using this method.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2017.04a
• /
• pp.595-597
• /
• 2017

Despite rapid growth of the global SW market, the Korean market still has a long way to go to impact global power nations. What is the reason that holds back of the No. 1 high-speed Internet country in terms of SW development? It is lack of the foundation for development of the Korean SW industry. In this context, the Korean government declared SW-oriented society and developed polices for each sector; Regarding movement that tries to apply the SW partitioning order institution in public sector to IT projects, this research aims to study SI project problems expected when conducting the SW partitioning order institution and improvements focusing on the public sector that accounts for about 30% of the entire SW industry. SW partitioning order institution is divided into planning-design and development-realization stages, which may cause problems when it is applied to SI projects. As such, the study analyzed SI projects and separate and partitioning order, exemplary cases and examples of industrial projects related to partitioning order, and drew improvement measures from institutional, technological and managerial viewpoints. The research aims to help people involved in IT projects sell SW at proper prices and improve the environment, and presents directions to create a system that strengthens competitiveness of the SW industry and SI projects by providing solutions to problems that suppliers and demanders should recognize before implementing the SW partitioning order institution.

• Journal of the Institute of Convergence Signal Processing
• /
• v.2 no.4
• /
• pp.97-102
• /
• 2001

In computer-aided design, partitioning is task of clustering objects into groups to that a given objection function is optimized It is used at the layout level to fin strongly connected components that can be placed together in order to minimize the layout area and propagation delay. Partitioning can also be used to cluster variables and operation into groups for scheduling and unit selection in high-level synthesis. The most popular algorithms partitioning include the Kernighan-Lin algorithm Fiduccia-Mattheyses heuristic and simulated annealing In this paper we propose a genetic algorithm searching solution space for the circuit partitioning problem. and then compare it with simulated annealing by analyzing the results of implementation.

• Korean Journal of Computational Design and Engineering
• /
• v.6 no.4
• /
• pp.215-221
• /
• 2001

In the zigzag milling of a pocket having islands, tool retraction is one of the primary factors that decrease productivity. Therefore, tool path with minimum number of tool retraction has been needed. Most researches about this topic have been concentrated on obtaining the optimum solution formulated through the geometric reasoning off pocket. Recently, several attempts were made to simplify this problem into region partitioning in order to get the numerically expressed minimum solution. In this research, a method reducing the number of tool retractions extended from existing region partitioning is provided. Applying the segment that is normal to the reference direction of zigzag milling, region partitioning is carried out and structural elements of the region are searched via graphs of islands and characteristic points. Through the processes presented, the number of region partitioned is less than that of existing processes.

• KIPS Transactions on Computer and Communication Systems
• /
• v.11 no.5
• /
• pp.139-146
• /
• 2022

With the recent development of the Internet of Things (IoT) and the convergence of vehicles and IT technologies, high-performance applications such as autonomous driving are emerging, and multi-access edge computing (MEC) has attracted lots of attentions as next-generation technologies. In order to provide service to these computation-intensive tasks in low latency, many methods have been proposed to partition tasks so that they can be performed through cooperation of multiple MEC servers(MECSs). Conventional methods related to task partitioning have proposed methods for partitioning tasks on vehicles as mobile devices and offloading them to multiple MECSs, and methods for offloading them from vehicles to MECSs and then partitioning and migrating them to other MECSs. In this paper, the performance of task partitioning methods using offloading and migration is compared and analyzed in terms of service delay, blocking rate and energy consumption according to the method of selecting partitioning targets and the number of partitioning. As the number of partitioning increases, the performance of the service delay improves, but the performance of the blocking rate and energy consumption decreases.

• 한국IT서비스학회:학술대회논문집
• /
• 2009.11a
• /
• pp.499-504
• /
• 2009

최근 공공기관에서는 소프트웨어 산업의 선진화를 위하여 소프트웨어 분할발주 제도를 도입 검토하고 있다. 성공적인 제도 도입을 위해 사전에 고려해야 하는 사항을 제도 도입시 예상되는 위험요인 도출 및 분석, 평가를 통해 파악하고자 한다. 먼저 문헌연구를 통해 소프트웨어 산업의 일반적인 위험요인을 바탕으로, 설문조사를 통해 분할발주 하에서의 위험요인의 영향도 변화 파악 및 추가 위험요인을 도출한다. 이를 바탕으로 AHP기법을 통해 위험요인간 우선순위를 분석하여 위험요인 평가모델을 제시한다.

• Proceedings of the Korean Radioactive Waste Society Conference
• /
• 2004.02a
• /
• pp.150-164
• /
• 2004

According to the Korean long-term plan for nuclear technology development, KAERI is conducting a few R&D projects related to the proliferation-resistant back-end fuel cycle. The R&D activities for the back-end fuel cycle are reviewed in this work, especially focusing on the study of the partitioning and transmutation(P&T) of long-lived radionuclides. The P&T study is currently being carried out in order to develop key technologies in the areas of partitioning and transmutation. The partitioning study is based on the development of pyroprocessing such as electrorefining and electrowinning because they can be adopted as proliferation-resistant technologies in the fuel cycle. In this study, various behaviors of the electrodeposition of uranium and rare earth elements in the LiCl-KCl electrorefining system have been examined through fundamental experimental work. As for the transmutation system, KAERI is studying the HYPER (HYbrid Power Extraction Reactor), a kind of subcritical reactor which will be connected with a proton accelerator. Up to now, a conceptual study has been carried out for the major elemental systems of the subcritical reactor such as core, transuranic fuel, long-lived fission product target, and the Pb-Bi cooling system, etc. In order to enhance the transmutation efficiency of the transuranic elements as well as to strengthen the reactor safety, the reactor core was optimized by determining its most suitable subcriticality, the ratio of height/diameter, and by introducing the concepts of optimum core configuration with a transuranic enrichment as well as a scattered reloading of the fuel assemblies.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.11
• /
• pp.5491-5505
• /
• 2017

Use of the Gaussian inverse Wishart PHD (GIW-PHD) filter has demonstrated promise as an approach to track an unknown number of extended targets. However, the partitioning approaches used in the GIW-PHD filter, such as distance partition with sub-partition (DP-SP), prediction partition (PP) and expectation maximization partition (EMP), fails to provided accurate partition results when targets are spaced closely together and performing maneuvers. In order to improve the performance of a GIW-PHD filter, this paper presents a cooperation partitioning (CP) algorithm to solve the partitioning issue when targets are spaced closely together. In the GIW-PHD filter, the DP-SP is insensitive to target maneuvers but sensitive to the differences in target sizes, while EMP is the opposite. The proposed CP algorithm is a fusion approach of DP-SP and EMP, which employs EMP as a sub-partition approach after DP. Therefore, the CP algorithm will be sensitive to neither target maneuvers nor differences in target sizes. The simulation results show that the use of the proposed CP algorithm will improve the performance of the GIW-PHD filter when targets are spaced closely together.

• Journal of Korea Game Society
• /
• v.13 no.4
• /
• pp.25-34
• /
• 2013

Spatial partitioning trees are needed for processing collision detections efficiently. In order to select split planes for spatial partitioning trees, the tree balance and the number of polygons overlapped with the split plane should be considered. In this paper, the heuristic algorithm controlling weight values of tree build criteria is proposed for spatial partitioning trees of 3D games. As the weight values are changed, tree build time, T-junction elimination time which can cause visual artifacts in splitting polygons overlapped with the split plane, rendering speed (frame per second: FPS) according to tree balance are analysed under 3D game simulations.

• The Journal of the Korea Contents Association
• /
• v.21 no.7
• /
• pp.164-170
• /
• 2021

In VLSI design, partitioning is a task of clustering objects into groups so that a given objective circuit is optimized. It is used at the layout level to find strongly connected components that can be placed together in order to minimize the layout area and propagation delay. The most popular algorithms for partitioning include the Kernighan-Lin algorithm, Fiduccia-Mattheyses heuristic and simulated annealing. In this paper, we propose a adapted genetic algorithm searching solution space for the circuit partitioning problem, and then compare it with simulated annealing and genetic algorithm by analyzing the results of implementation. As a result, it was found that an adaptive genetic algorithm approaches the optimal solution more effectively than the simulated annealing and genetic algorithm.