• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.596-608
• /
• 2004

A lot of work has been done to reduce disk access time in I/O intensive systems, which store and handle massive amount of data, by distributing data across multiple disks and accessing them in parallel. Most of the previous work has focused on an efficient mapping from a grid cell to a disk number on the assumption that data space is regular grid-like partitioned. Although we can achieve good performance for low-dimensional data by grid-like partitioning, its performance becomes degenerate as grows the dimension of data even with a good disk allocation scheme. This comes from the fact that they partition entire data space equally regardless of distribution ratio of data objects. Most of the data in high-dimensional space exist around the surface of space. For that reason, we propose a new declustering algorithm based on the partitioning scheme which partition data space from the surface. With an unbalanced partitioning scheme, several experimental results show that we can remarkably reduce the number of data blocks touched by a query as grows the dimension of data and a query size. In this paper, we propose disk allocation schemes based on the layout of the resultant data blocks after partitioning. To show the performance of the proposed algorithm, we have performed several experiments with different dimensional data and for a wide range of number of disks. Our proposed disk allocation method gives a performance within 10 additive disk accesses compared with strictly optimal allocation scheme. We compared our algorithm with Kronecker sequence based declustering algorithm, which is reported to be the best among the grid partition and mapping function based declustering algorithms. We can improve declustering performance up to 14 times as grows dimension of data.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.22 no.3
• /
• pp.60-67
• /
• 1985

A new glut bel routing technique for gate array is described in this paper. In former global routers the position of pins is considered to be in the center of the cell. So it is impossible to exactly estimate the number of signal lines passing through each channel. As a result, an overflow occurs and the overflow violates 100% wiring in detailed routing pro-cesses. Besides this, there are some problems in former global routers, for example, design time and cost, etc. This paper proposed a new algorithm in which pins ordering is considered to solve these problems. Using this algorithm, a global router is developed. Program experiments show the efficiency of the proposed algorithm.

• Journal of the Korea Society for Simulation
• /
• v.15 no.4
• /
• pp.137-142
• /
• 2006

D/In modern production industries, computer aided systems have been improving the efficiency and convenience of the various stages of work. However. as the complexity of computerized production systems increases, various techniques are still necessary. The problem we addressed occurs in computer systems that automatically make manufacturing process plans in the metal grating manufacturing industry. In the grating layout design, the key to saving the manufacturing cost is to find a design with the minimal number of cutting operations. The proposed genetic algorithm explores the feasible alternatives within the space until an optimal solution is obtained.

• Nuclear Engineering and Technology
• /
• v.56 no.9
• /
• pp.3750-3757
• /
• 2024

Rapidly obtaining the coverage characteristics of leaching solution in In-situ Leaching Area of Sandstone Uranium Mines is a necessary condition for optimizing well locations reasonably. In the presented study, the improved algorithm of the Fast Marching Method (FMM) was studied for rapidly solving coverage characteristics to replace the groundwater numerical simulator. First, the effectiveness of the FMM was verified by simulating diffusion characteristics of the leaching solution in In-situ Leaching Area. Second, based on the radial flow pressure equation and the interaction mechanism of the front diffusion of production and injection well flow field, an improved FMM which is suitable for In-situ Leaching Mining, was developed to achieve the co-simulation of production and injection well. Finally, the improved algorithm was applied to engineering practice to guide the design and production. The results show that the improved algorithm can efficiently solve the coverage characteristics of leaching solution, which is consistent with those obtained from traditional numerical simulators. In engineering practice, the improved FMM can be used to rapidly analyze the leaching process, delineate Leaching Blind Spots, and evaluate the rationality of well pattern layout. Furthermore, it can help to achieve iterative optimization and rapid decision-making of production and injection well locations under largescale mining area models.

• Journal of Computational Design and Engineering
• /
• v.1 no.2
• /
• pp.140-151
• /
• 2014

Storing, and the loading and unloading of materials at production sites in the manufacturing sector for mass production is a critical problem that affects various aspects: the layout of the factory, line-side space, logistics, workers' work paths and ease of work, automatic procurement of components, and transfer and supply. Traditionally, the nesting problem has been an issue to improve the efficiency of raw materials; further, research into mainly 2D optimization has progressed. Also, recently, research into the expanded usage of 3D models to implement packing optimization has been actively carried out. Nevertheless, packing algorithms using 3D models are not widely used in practice, due to the large decrease in efficiency, owing to the complexity and excessive computational time. In this paper, the problem of efficiently loading and unloading freeform 3D objects into a given container has been solved, by considering the 3D form, ease of loading and unloading, and packing density. For this reason, a Group Packing Approach for workers has been developed, by using analyzed truck packing work patterns and Group Technology, which is to enhance the efficiency of storage in the manufacturing sector. Also, an algorithm for 3D packing has been developed, and implemented in a commercial 3D CAD modeling system. The 3D packing method consists of a grouping algorithm, a sequencing algorithm, an orientating algorithm, and a loading algorithm. These algorithms concern the respective aspects: the packing order, orientation decisions of parts, collision checking among parts and processing, position decisions of parts, efficiency verification, and loading and unloading simulation. Storage optimization and examination of the ease of loading and unloading are possible, and various kinds of engineering analysis, such as work performance analysis, are facilitated through the intelligent 3D packing method developed in this paper, by using the results of the 3D model.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.40 no.2
• /
• pp.60-67
• /
• 2017

A baggage handling system (BHS) in airport is an unified system for moving the passengers' baggage in designated time. Input baggage from the check-in counter travels to the baggage claim area or cargo handling terminal through this system. In particular, entryway BHS consists of conveyors, X-ray and sorters such as tilt-tray to send the baggage to departing airplane and it could have various problems for handling certain amount of baggage in restricted time such as baggage jamming at certain merge point. This causes systemic error such as delay of the time, omissions of the baggage and even breakdown of the equipment and inefficiency. Also the increasing maximum time of the baggage passing through the BHS could delay the flight schedule and finally decrease the service level. Thus, the algorithm for controlling the flow of the merge is essential to the system. The window reservation algorithm is the one of the most frequently used methods to control the merge configuration. Above all, the reserve location, so called reserve ahead point, that allocates the window is important for the performance of the algorithm. We propose the modified window reservation algorithm and the best reserve locations by changing the reserve ahead point in the induction conveyors. The effect of various reserve ahead points such as the capacity and utility of the system were analyzed and the most effective reserve ahead point combination was found. The total baggage processing time and the utilization of the tilt-tray are properly considered when choosing the optimal Reserve ahead point combination. In the layout of this study, the configuration of four conveyors merged into one tilt-tray is studied and simulation analysis is done by AutoMod(R), 3D simulation software. Through the simulation, the window reservation algorithm is effectively operated with the best combination of reserve ahead point which reduces the maximum baggage travel time.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.1
• /
• pp.477-483
• /
• 2019

In this paper, we propose vanishing-point position-improvement algorithms by using multiple images and a homography matrix. Vanishing points can be detected from a single image, but the positions of detected vanishing points can be improved if we adjust their positions by using information from multiple images. More accurate indoor space information detection is possible through vanishing points with improved positional accuracy. To adjust a position, we take three images and detect the information, detect the homography matrix between the walls of the images, and convert the vanishing point positions using the detected homography. Finally, we find an optimal position among the converted vanishing points and improve the vanishing point position. The experimental results compared an existing algorithm and the proposed algorithm. With the proposed algorithm, we confirmed that the error angle to the vanishing point position was reduced by about 1.62%, and more accurate vanishing point detection was possible. In addition, we can confirm that the layout detected by using improved vanishing points through the proposed algorithm is more accurate than the result from the existing algorithm.

• Korean Journal of Computational Design and Engineering
• /
• v.2 no.3
• /
• pp.195-210
• /
• 1997

In Rapid Prototyping process, the time required to build multiple prototype parts can be reduced by packing several parts optimally in a work volume. Interactive arrangement of the multiple parts is a tedious process and does not guarantee the optimal placement of all the parts. In this case, packing is a kind of 3-D nesting problem because parts are represented by STL files with 3-D information. 3-D nesting is well known to be a problem requiring an intense computation and an efficient algorithm to solve the problem is still under investigation. This paper proposes that packing 3-D parts can be simplified into a 2-D irregular polygon nesting problem by using the characteristic of rapid prototyping process that the process uses 2-dimensional slicing data of the parts and that slice of the STL parts are composed of polygons. Our algorithm uses no-fit-polygon (NFP) to place each slice without overlapping other slices in the same z-level. The allowable position of one part at a fixed orientation for given parts already packed can be determined by obtaining the union of all NFP's that are obtained from each slice of the part. Genetic algorithm is used to determine the order of parts to be placed and orientations of each part for the optimal packing. Optimal orientation of a part is determined while rotating it about the axis normal to the slice by finite angles and flipping upside down. This algorithm can be applied to any rapid prototyping process that does not need support structures.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.2
• /
• pp.28-36
• /
• 2018

Islands are supplied with power from diesel generation or from photovoltaic power generation, and problems with offshore environmental impacts (age deterioration, salt pollution), environmental pollution (exhaust gas, noise, dust) and power generation costs (installation, maintenance) have increasingly emerged. In 2016, the cost recovery rate was only 27%, and deficits reached 73% on 65 islands managed by KEPCO. In terms of deficits, the costs incurred in the power generation sector accounted for 91%, with the ratio of fixed costs at about 60%. Analysis suggests that operating costs can be reduced with an optimal power supply system that improves power generation efficiency and makes operating systems more efficient. Therefore, it is possible to simplify fuel transportation and facility maintenance, because one island integrates the power plants of remote islands, and offshore cable is used to supply power to the other islands. From the economic evaluations in this paper, an algorithm deciding offshore cable layout validity for an integrated power supply between adjacent islands is presented. Simulation results based on the proposed algorithm confirmed that an integrated power supply is economical for existing stand-alone operations on islands having diesel generation, low peak power, and near distances.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.38 no.10
• /
• pp.712-720
• /
• 2001

Algorithms from the research of the layout migration were proposed in the paper. These are automatic recognition algorithm for the VLSI devices from it, graph based construction algorithm to maintain the constraints, dependencies, and design rule between the devices, and high speed compaction algorithm to reduce size of the VLSI area and reuse the design with compacted size for the new technology. Also, this paper describes that why proposed algorithms are essential for the era of the SoC (System on a Chip), design reuse, and IP DB, which are the big concerns in these days. In addition to introduce our algorithms, the benchmark showed that our performance is superior by 27 times faster than that of the commercial one, and has better efficiency by 3 times in disk usage.