• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.4
• /
• pp.1693-1713
• /
• 2018

An important technique used by database administrators (DBAs) is to improve performance in decision-support workloads associated with a Star schema is multi-level partitioning. Queries will then benefit from performance improvements via partition elimination, due to constraints on queries expressed on the dimension tables. As the task of multi-level partitioning can be overwhelming for a DBA we are proposing a wizard that facilitates the task by calculating a partitioning scheme for a particular workload. The system resides completely on a client and interacts with the costing estimation subsystem of the query optimizer via an API over the network, thereby eliminating any need to make changes to the optimizer. In addition, since only cost estimates are needed the wizard overhead is very low. By using a greedy algorithm for search space enumeration over the query predicates in the workload the wizard is efficient with worst-case polynomial complexity. The technology proposed can be applied to any clustering or partitioning scheme in any database management system that provides an interface to the query optimizer. Applied to the Teradata database the technology provides recommendations that outperform a human expert's solution as measured by the total execution time of the workload. We also demonstrate the scalability of our approach when the fact table (and workload) size increases.

• The Journal of Korea Robotics Society
• /
• v.3 no.1
• /
• pp.23-32
• /
• 2008

This paper presents a task planning system for a steward robot, which has been developed as an interactive intermediate agent between an end-user and a complex smart home environment called the ISH (Intelligent Sweet Home) at KAIST (Korea Advanced Institute of Science and Technology). The ISH is a large-scale robotic environment with various assistive robots and home appliances for independent living of the elderly and the people with disabilities. In particular, as an approach for achieving human-friendly human-robot interaction, we aim at 'simplification of task commands' by the user. In this sense, a task planning system has been proposed to generate a sequence of actions effectively for coordinating subtasks of the target subsystems from the given high-level task command. Basically, the task planning is performed under the framework of STRIPS (Stanford Research Institute Problem Solver) representation and the split planning method. In addition, we applied a state-partitioning technique to the backward split planning method to reduce computational time. By analyzing the obtained graph, the planning system decomposes an original planning problem into several independent sub-problems, and then, the planning system generates a proper sequence of actions. To show the effectiveness of the proposed system, we deal with a scenario of a planning problem in the ISH.

• The KIPS Transactions:PartD
• /
• v.15D no.1
• /
• pp.87-98
• /
• 2008

In company with the demand of powerful processing units for embedded systems, the method to develop embedded software is also required to support the demand in new approach. In order to improve the resource utilization and system performance, software modeling techniques have to consider the features of hardware architecture. This paper proposes a partitioning technique of UML-based software models, which focus the generation of the allocatable software components into multiprocessor architecture. Our partitioning technique, at first, transforms UML models to CBCFGs(Constraint-Based Control Flow Graphs), and then slices the CBCFGs with consideration of parallelism and data dependency. We believe that our proposition gives practical applicability in the areas of platform specific modeling and performance estimation in model-driven embedded software development.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.56
• /
• pp.35-43
• /
• 2000

In order to obtain rigorous systems analysis and design, it is essential to understand accurate information flow in the system. For the effective capturing of accurate information flow in a system, it Is vital to control information flow in the system. Also, information and information flow have to be simplified as a deliverable form. This paper presents partitioning and conveyance technique based on the application of situation theory. First, historical background of situation theory will be given. Then necessary conditions and definitions will be provided. Lastly, this paper provides specific technique with example. This introduced technique will be a powerful tool for sharing timely and relevant information in a complex manufacturing system that can be used continuously and efficiently throughout systems operation.

• Journal of KIISE
• /
• v.42 no.2
• /
• pp.177-182
• /
• 2015

The era of multi-core processors has begun since the limit of the clock speed has been reached. These days, multi-core technology is used not only in desktops, servers, and table PCs, but also in smartphones. In this architecture, there is always interference between processes, because of the sharing of system resources. To address this problem, cache partitioning is used, which can be roughly divided into two types: software and hardware cache partitioning. When it comes to dynamic cache partitioning, hardware cache partitioning is superior to software cache partitioning, because it needs no page copy. In this paper, we compare the effectiveness of hardware and software cache partitioning on the AMD Opteron 6282 SE, which is the only commodity processor providing hardware cache partitioning, to see whether this technique can be effectively deployed in dynamic environments.

• 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 Nuclear Fuel Cycle and Waste Technology(JNFCWT)
• /
• v.21 no.3
• /
• pp.397-410
• /
• 2023

This study examined the efficacy of various chlorinating agents in partitioning light water reactor spent fuel, with the aim of optimizing the chlorination process. Through thermodynamic equilibrium calculations, we assessed the outcomes of employing MgCl₂, NH₄Cl, and Cl₂ as chlorinating agents. A comparison was drawn between using a single agent and a sequential approach involving all three agents (MgCl₂, NH₄Cl, and Cl₂). Following heat treatment, the utilization of MgCl₂ as the sole chlorinating agent resulted in a moderate separation. Specifically, this method yielded a solid separation with 96.9% mass retention, 31.7% radioactivity, and 44.2% decay heat, relative to the initial spent fuel. In contrast, the sequential application of the chlorinating agents following heat treatment led to a final solid separation characterized by 93.1% mass retention, 5.1% radioactivity, and 15.4% decay heat, relative to the original spent fuel. The findings underscore the potential effectiveness of a sequential chlorination strategy for partitioning spent fuel. This approach holds promise as a standalone technique or as a complementary process alongside other partitioning processes such as pyroprocessing. Overall, our findings contribute to the advancement of spent fuel management strategies.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.10 s.340
• /
• pp.25-30
• /
• 2005

This paper generalizes the concept of the signal space detection to construct a fixed delay tree search (FDTS) detector which estimates a block of n channel symbols at a time. This technique is applicable to high speed implementation. Two approaches are discussed both of which are based on efficient signal space partitioning. In the first approach, symbol detection is performed based on a multi-class partitioning of the signal space. This approach is a generalization of binary symbol detection based on a two-class pattern classification. In the second approach, binary signal detection is combined with a look-ahead technique, resulting in a highly parallel detector architecture.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.9
• /
• pp.2080-2089
• /
• 1997

Recent evolution in compute technology makesthe multimedia processing widely availiable. Conventional storage systems do not meet the requirements of multimedia data. Several approaches were suggested to improve disk storing methods for them. Bocheck proposed a disk partitioning technique for multiple steams assuming that all steams have same retrieval intervals with the same amount data for each access. While Bocheck's one provides a good method for same period, it does not consider the case of different periods of continous media streams. This paper proposes a new partitioning technique in which a fixed number of blocks are assigned for stresms with different retrieval periodicity. The analysis shows this problem is the same as the one scheduling the steams into a given sequence. The simulation was done to compare the proposed m-sequence merge method with the conventional Scan-EDF and Partitioning methods.

• Proceedings of the Membrane Society of Korea Conference
• /
• 1996.10a
• /
• pp.3-7
• /
• 1996

A rigorous analysis on the effect of colloidal interactions on the separation characteristic has been extended to the case of non-dilute charged solute concentration. The solute partitioning within slit pores for a wide range of solute concentration has been predicted by performing the Monte Carlo technique. Using a hindered transport model, rejection coefficients have been estimated from the predicted concentration profile.