• Journal of the Korea Computer Graphics Society
• /
• v.23 no.3
• /
• pp.19-29
• /
• 2017

When a fixed-sized memory allocation method is used for sparse volume data, a considerable memory space is in general wasted, which becomes more serious for a large volume of high resolution. In this paper, in order to reduce such unnecessary memory consumption, we propose a volume representation method to store mostly voxels that represent valid information rather than all voxels in a fixed volume space. Then our method is compared with the conventional static memory allocation method, an octree-based representation, and a voxel hashing method in terms of memory usage and computation speed. In particular, we compare the proposed method and the voxel hashing method with respect to implementation of the GPU-based Marching Cubes algorithm.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.11
• /
• pp.5321-5329
• /
• 2011

Space Layout has been an issue in the facet of reducing the co2 in that the transportation sector has been to represent almost more than 20% of the total energy consumption for decades. Beside the development of the more efficient transportation systems, an efficient space layout makes it possible to reduce the amount of energy consumption in the transportation sector through allocating the sub-spaces in such an arrangement of minimizing the travel distances. In line with this thinking, this research aims at implementing a simulator which can calculate the vehicle-based travel distance upon a certain space layout. Based on the findings that the vehicle-based travels take place between the two functionally related sub-spaces, this research addresses a method of calculating the vehicle-based travel distance by multiplying the traffic volume of each sub-spaces by the travel distance to the other connected sub-spaces.

• Journal of the Korean earth science society
• /
• v.43 no.1
• /
• pp.224-235
• /
• 2022

This study aimed to confirm the status of media reports on space hazards using topic modeling analysis of media articles that are related to space hazards for the past 12 years. Therefore, Latent Dirichlet Allocation (LDA) analysis was performed by collecting over 1200 space hazards articles between 2010 and 2021 on solar storm, artificial space objects, and natural space objects from BIGKins news platform. The articles related to solar storm focused on three topics: the effect of solar explosion on satellites; effect of solar explosion on radio communication in Korea, centered on the Korean Space Weather Center; and relationship between aircrew and space radiation. The articles related to artificial space objects focused on three topics: the threat of space garbage to satellite and space stations and the transition of useful objects into space junk; the relationship between space garbage and humanity as shown in movies; and the effort of developed countries for tracking, monitoring, and disposing of space garbage. The articles related to natural space objects focused on two topics: International Space Agency's tracking and monitoring of near-Earth asteroids and the countermeasures of collisions, and the evolution and extinction of dinosaurs and mammals, with a focus on the collisions of asteroids or comets. Therefore, this study confirmed that domestic media play a role in conveying dangers of space hazards and arousing the attention of public using a total of eight themes in various fields such as society and culture, and derived education method and policy on space hazards.

• The Journal of the Korea Contents Association
• /
• v.6 no.12
• /
• pp.121-127
• /
• 2006

As information technologies are improving, geographical information system (GIS) technologies are also developing rapidly and demands for spatial analysis with GIS are increasing. Particularly, the spatial analyses with GIS researches have been noted rather than general GIS researches. However, most GIS researches focus on space dimension: a density-based clustering method (DBSCAN) or a DBSCAN algorithm using region expressed as Weight (DBSCAN-W) but the importance of rational decision making based on time dimension has been neglected. This study adopts system dynamics in order to put time dimension in GIS-based optimum allocation.

• Journal of Korea Multimedia Society
• /
• v.25 no.10
• /
• pp.1404-1415
• /
• 2022

The 2-dimensional arrangement method of nodes has been used in most of RF (Radio Frequency) based communication network simulations. However, this method is not useful for the an none-obstacle 3-dimensional space networks in which the propagation delay speed in communication is very slow and, moreover, the values of performance factors such as the communication speed and the error rate change on the depth of node. Such a typical example is an underwater communication network. The 2-dimensional arrangement method is also not useful for the RF based network like some WSNs (Wireless Sensor Networks), IBSs (Intelligent Building Systems), or smart homes, in which the distance between nodes is short or some of nodes can be arranged overlapping with their different heights in similar planar location. In such cases, the 2-dimensional network simulation results are highly inaccurate and unbelievable so that they lead to user's erroneous predictions and judgments. For these reasons, in this paper, we propose a method to place uniformly and randomly communication nodes in 3-dimensional network space, making the wireless link with neighbor node possible. In this method, based on the communication rage of the node, blocks are generated to construct the 3-dimensional network and a node per one block is generated and placed within a block area. In this paper, we also introduce an algorithm based on this method and we show the performance results and evaluations on the average time in a node generation and arrangement, and the arrangement time and scatter-plotted visualization time of all nodes according to the number of them. In addition, comparison with previous studies is conducted. As a result of evaluating the performance of the algorithm, it was found that the processing time of the algorithm was proportional to the number of nodes to be created, and the average generation time of one node was between 0.238 and 0.28 us. ultimately, There is no problem even if a simulation network with a large number of nodes is created, so it can be sufficiently introduced at the time of simulation.

• Journal of Korean Institute of Industrial Engineers
• /
• v.15 no.1
• /
• pp.41-50
• /
• 1989

This paper deals with the problem of space allocation of items within a warehouse. Recognizing the importance of weights associated with material handling, mathematical models are developed for two cases, out-and-back selection and storage retrieval interleaving. It is proved that the density order index rule we proposed generates an optimal solution for the first model. An example problem solved with the pairwise interchange method indicates that the rule is also fairly efficient for the second model. The proposed rule is compared with other assignment rules of warehouse space such as COI rule, space and popularity.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.5
• /
• pp.272-284
• /
• 2010

Flash Memory differs from the hard disk, because it cannot be overwritten. Most of the flash memory file systems use not-in-place update mechanisms for the update. Flash memory file systems execute sometimes block cleaning process in order to make writable space while performing not-in-place update process. Block cleaning process collects the invalid pages and convert them into the free pages. Block cleaning process is a factor that affects directly on the performance of the flash memory. Thus this paper suggests the efficient page allocation method, which reduces block cleaning cost by minimizing the numbers of block that has valid and invalid pages at a time. The result of the simulation shows an increase in efficiency by reducing more block cleaning costs than the original YAFFS.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.5
• /
• pp.540-548
• /
• 2012

The Weapon Target Allocation(WTA) problem is the NP-Complete problem. The WTA problem is that the threatful air targets are assigned by weapon of allies for killing the targets. A good solution of NP-complete problem is heuristic algorithms. Genetic algorithms are commonly used heuristic for global optimization, and it is good solution on the diverse problem domain. But there has been very little research done on the generation of their initial population. The initialization of population is one of the GA step, and it decide to initial value of individuals. In this paper, we propose to the population initialization method to improve a Genetic Algorithm. When it initializes population, the proposed algorithm reflects the characteristics of the WTA problem domain, and inherits the dominant gene. In addition, the search space widely spread in the problem space to find efficiently the good quality solution. In this paper, the proposed algorithm to verify performance examine that an analysis of various properties and the experimental results by analyzing the performance compare to other algorithms. The proposed algorithm compared to the other initialization methods and a general genetic algorithm. As a result, the proposed algorithm showed better performance in WTA problem than the other algorithms. In particular, the proposed algorithm is a good way to apply to the variety of situation WTA problem domain, because the proposed algorithm can be applied flexibly to WTA problem by the adjustment of RMI.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.32 no.1
• /
• pp.44-51
• /
• 2009

A bonded warehouse is the warehouse located in bonded area. It functions not only as a general warehouse but also as a place for managing the work related to import and export bonded goods. As a general warehouse, it uses the rack system to store the goods and the folk lift truck to move the unitized goods. The operation of the storing system closely related to the efficiency of space uses in a warehouse and vehicle working. Thus, vehicle performance measured in distance units in the ware-house could be used as one of the key performance measure in warehouse system. This paper focuses on the operation efficiency of the bonded warehouse which uses rack system for the storing and the folk lift truck for moving goods. The method of load allocation for balancing the rack uses and vehicle operation for maximizing efficiency are the specific concerns in this paper. The simulation study is conducted to find a policy for efficient vehicle operation based on balanced rack utilization, and the favorable result for the system operation would lead the usable proposal in vehicle operation.

• Journal of the Korea Institute of Building Construction
• /
• v.17 no.4
• /
• pp.369-375
• /
• 2017

This study suggests PSO(Particle Swarm Optimization) algorithm that optimizes the snowplow route allocation and the location of the snow control material storage to improve the efficiency in snow removal works. The modified PSO algorithm for improving the search capacity is proposed, and this study suggests the solution representation, the parameter setting, and the fitness function for the given optimization problems. Computational experiments in real-world case are carried out to justify the proposed method and compared with the traditional PSO algorithms. The results show that the proposed algorithms can find the better solution than the traditional PSO algorithms by searching for the wider solution space without falling into the local optima. The finding of this study is efficiently employed to solve the optimization of the snowplow route allocation by minimizing the workload of each snowplow to search the location of the snow control material storage as well.