• Journal of the Korea Society for Simulation
• /
• v.11 no.2
• /
• pp.67-75
• /
• 2002

This paper proposes a parallel simulation algorithm for bounded Petri nets in a single processor, which exploits the SIMD(Single Instruction Multiple Data)-type parallelism. The proposed algorithm is based on a data packing scheme which packs multiple bytes data in a single register, thereby being manipulated simultaneously. The parallelism can reduce simulation time of bounded Petri nets in a single processor environment. The effectiveness of the algorithm is demonstrated by presenting speed-up of simulation time for two bounded Petri nets.

• Proceedings of the Korean Powder Metallurgy Institute Conference
• /
• 2006.09b
• /
• pp.1254-1255
• /
• 2006

For precise property control of sintered products, it is important to understand accurately the packing density of the powder. We developed a packing simulation program that could make a packed bed of spherical particles having particle size distribution. In addition, the influence of the particle shape of the actual powder on the packing density was quantitatively analyzed. The predicted packing densities corresponded well to the actual data.

• Applied Chemistry for Engineering
• /
• v.18 no.6
• /
• pp.636-642
• /
• 2007

Software program to predict the packing density of multi-sized and multi-component particulate system was developed. For this purpose, the experiment to measure the packing density of AP (ammonium perchlorate) and Al (aluminum) particles with different sizes and their mixtures was carried out. The packing densities obtained from various experiments were compared with the predicted data from the developed software program. In the case of the packing density of the binary system, which is comprised of two different size particles and/or two different components, the relative errors were ranged 0.25~13.13%, and in the same venue the relative errors of the ternary system were 0.25~13.13%. Agreement between experimental data and the predicted results is reasonably accurate. In order to achieve the targeted packing density, the software program calculated the contour of the component particles and this will contribute the formulation of optimal packing systems.

• Journal of Korea Multimedia Society
• /
• v.14 no.9
• /
• pp.1165-1174
• /
• 2011

In data broadcasting systems, servers continuously disseminate data items through broadcast channels, and mobile client only needs to wait for the data of interest to present on a broadcast channel. However, because broadcast channels are shared by a large set of data items, the expected delay of receiving a desired data item may increase. This paper explores the issue of designing proper data allocation on multiple broadcast channels to minimize the average expected delay time of all data items, and proposes a new data allocation scheme named two level bin-packing(TLBP). This paper first introduces the theoretical lower-bound of the average expected delay, and determines the bin capacity based on this value. TLBP partitions all data items into a number of groups using bin-packing algorithm and allocates each group of data items on an individual channel. By employing bin-packing algorithm in two step, TLBP can reflect a variation of access probabilities among data items allocated on the same channel to the broadcast schedule, and thus enhance the performance. Simulation is performed to compare the performance of TLBP with three existing approaches. The simulation results show that TLBP outperforms others in terms of the average expected delay time at a reasonable execution overhead.

• 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 Institute of Information and Communication Engineering
• /
• v.21 no.10
• /
• pp.1935-1942
• /
• 2017

Recently, a compression algorithm is widely used as a method for compressing geographic information data. However, such a compression algorithm has a problem that the continuity of the map data is insufficient to actually apply it to the geographic information data compression, and the compression rate is lowered because it can not be compressed into a single data. Therefore, in this paper, we have designed and implemented a Run-Length / Byte-Packing compression algorithm that enables compression of geographic information by combining the advantages of compression algorithms and improves compression and restoration speed. As a result of evaluating the implemented algorithm, it was confirmed that the proposed algorithm improved about 5% on average compared with the existing compression algorithm, and it was confirmed that the compression rate and the restoration speed were improved.

• Composites Research
• /
• v.34 no.5
• /
• pp.330-336
• /
• 2021

Alumina powder is one of the widely used materials for industry, but there is a problem that the strength of the product changes depending on the powder packing state. To solve the above problem, previous studies have been conducted to increase the particle packing efficiency, but most of the existing studies analyzed the packing characteristics of millimeter-scale particles, so the physical properties are different from those of the micrometer scale. It is difficult to apply to the micrometer scale. In this paper, a three-step experiment was performed using a statistical method to increase packing using micrometer-scale alumina powder. First, a size combination with high packing and a mixing ratio were selected using the mixture test design method, and an appropriate excitation frequency was selected by analyzing the height change according to the frequency change in the vibration test apparatus. Finally, an alumina powder packing experiment was performed based on the experimental results mentioned above. As a result, it was confirmed that the maximum height variation was 42% higher than the maximum value of the 155 measurements performed when selecting the packing size combination. It is thought that this study will serve as basic data for processing and packing research using fine powder.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.2
• /
• pp.125-137
• /
• 1997

We are concerned with the packing policy determines the optimal packing of products with variable sizes to minimize the penalty costs for idle space and product spliting. Optimal packing problem is closely related to the optimal packet/record sizing problem in that randomly generated data stream with variable bytes are divided into a unit of packet/record for transmitting or storing. Assuming the product size and the production period are independently determined by renewal process, we can approximate the renewal process and formulate the optimization problem that minimize the expected packing cost for a production period. The problem is divided into two cases according to whether a product is allowed to split or not. Computational results for various distributions will be given to verify the approximation procedure and the resulting optimization problem.

• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• v.14 no.10
• /
• pp.775-780
• /
• 2002

An experimental study on the characteristics of several kinds of packing materials was carried out in order to get the optimum design data for the packed-type rectification system of an NH$_3$/$H_2O$ GAX absorption heat pump. Several suitable packing materials were examined and the bulk of steel wire was shown as the most effective packing material in rectifier. The optimum volumetric ratio of packed steel wire in rectifier was obtained as around 36%. The performance results can be adapted in rectifier design of absorption heat pump.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.4B
• /
• pp.278-287
• /
• 2012

In this paper, we propose an allocation scheme for variable message packings to increase efficiency of military operation using Link-16 which is well-known for tactical data link by delivering imagery information rapidly. We propose a variable message packing scheme using COC waveform to support variable data rate under some coverage limitation. Variety of message packing makes Link-16 vary transmission rate appropriately for tactical environment. We also propose a allocation scheme to assign message packing to time slot properly. Finally we verify the performance and superiority of proposed ideas by simulations.