• The Journal of Korean Association of Computer Education
• /
• v.18 no.2
• /
• pp.83-90
• /
• 2015

In an virtualization environment, several virtual machines use physical resources together. If a specific virtual machine uses to much of the computing resources, other machines may not be working properly. There are various method to solve this problem. Most representative study is to migrate a specified virtual machines to a different server, a target server. In this study, server load can be transferred to a target server by the remigrate of the load imposed on virtual machine. It is still problematic that virtual machine has to remigrate to a different server. This thesis has proposed the algorithm determining the remigration targets by applying dynamic thresholds to solve those problems. The migration algorithm applies dynamic thresholds according to the following criteria. Firstly, the usage of CPU, network and memory; secondly, decide the set of artificial machine and the target server based on the resources surpassed thresholds; thirdly, determine artificial machines based on the resource usage in the target server.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.27 no.6
• /
• pp.1271-1280
• /
• 2017

The android packer service using runtime execution compression technology switches to the original application using DexClassLoader. However the API interface of the DexClassLoader receives the path of the loaded DEX(Dalvik EXcutable) and the path of the compiled file. So there is a problem that the original file is exposed to the file system. Therefore, it is not safe to use the API for the packer service. In this paper, we solve this problem by changing the compile and load flow of the DexClassLoader API. Due to this changed execution flow, the complied file can be encrypted and stored in the file system or only in the memory and it can be decrypted or substituted at the time of subsequent loading to enable the original application conversion. we expected that the stability of the packer will increase beacause the proposed method does not expose the original file to the file system.

• The korean journal of orthodontics
• /
• v.36 no.5
• /
• pp.349-359
• /
• 2006

Objective: Nickel-titanium alloy wire possesses excellent spring-back properties, shape memory and super-elasticity. In order to adapt this wire to clinical use, it is necessary to bend as well as to control its super-elastic force. The purpose of this study is to evaluate the effects of heat treatment on the load-deflection properties and transitional temperature range (TTR) of nickel-titanium wires. Methods: Nickel-titanium wires of different diameters ($0.016"\;{\times}\;0.022"$, $0.018"\;{\times}\;0.025"$ and $0.0215"\;{\times}\;0.028"$) were used. The samples were divided into 4 groups as follows: group 4, posterior segment of archwire (24 mm) without heat treatment; group 2, posterior segment of archwire (24 mm) with heat treatment only; group 3, anterior segment with bending and heat treatment; group 4, anterior segment with bending and 1 sec over heat treatment. Three point bending test was used to evaluate the change in load-deflection curve and obtained DSC (different scanning calorimetry) to check changes in $A_f$ temperature. Results: In the three point bending test, nickel-titanium wires with heat treatment only had higher load-deflection curve and loading and unloading plateau than nickel-titanium wires without heat treatment. Nickel-titanium wires with heat treatment had lower Af temperature than nickel-titanium wires without heat treatment. Nickel-titanium wires with heat treatment and bending had higher load-deflection curve than nickel- titanium wires with heat treatment and nickel-titanium wires without heat treatment. Nickel-titanium with heat treatment of over 1 sec and bending had the highest load-deflection curve. Nickel-titanium wires with heat treatment and bending had lower Af temperature, Nickel-titanium wires with heat treatment of over Af sec and bending had the lowest Af temperature. Conclusion: From the results of this study, it can be stated that heat treatment for bending of Nickel-titanium wires does not deprive the superelastic property but can cause increased force magnitude due to a higher load-deflection curve.

• Journal of the Korean Society for Precision Engineering
• /
• v.29 no.8
• /
• pp.818-823
• /
• 2012

In order to predict necking behaviour of aluminium sheets, a crystal plasticity model is introduced in the finite element analysis of tensile test. Due to the computational limits of time and memory, only a small part of tensile specimen is subjected to the analysis. Grains having different orientations are subjected to numerical tensile tests and each grain is discretized by many elements. In order to predict the sudden drop of load carrying capacity after necking, a well-known Cockcroft-Latham damage model is introduced. The mismatch of grain orientation causes stress concentration at several points and damage is evolved at these points. This phenomenon is similar to void nucleation. In the same way, void growth and void coalescence behaviours are well predicted in the analysis. For the comparison of prediction capability of necking, same model is subjected to finite element analysis using uniform material properties of polycrystal with and without damage. As a result, it is shown that the crystal plasticity model can be used in prediction of necking and fracture behavior of materials accurately.

• Journal of Korea Multimedia Society
• /
• v.18 no.9
• /
• pp.1098-1104
• /
• 2015

With the widespread use of smartphones and IoT (Internet of Things), data are being generated on a large scale, and there is increased for the analysis of such data. Hence, distributed processing systems have gained much attention. Hadoop, which is a distributed processing system, saves the metadata of stored files in name nodes; in this case, the main problems are as follows: the memory becomes insufficient; load occurs because of massive small files; scheduling and file processing time increases because of the increased number of small files. In this paper, we propose a solution to address the increase in processing time because of massive small files, and thus improve the processing performance, using the Reuse JVM method provided by Hadoop. Through environment setting, the Reuse JVM method modifies the JVM produced conventionally for every task, so that multiple tasks are reused sequentially in one JVM. As a final outcome, the Reuse JVM method showed the best processing performance when used together with CombineFileInputFormat.

• Journal of the Korea society of information convergence
• /
• v.7 no.2
• /
• pp.49-57
• /
• 2014

Recently, opinion mining is introduced to extract useful information from SNS data and to evaluate the true intention of users. Opinion mining are required several efficient techniques to collect and analyze a large amount of SNS data and extract meaningful data from them. Therefore in this paper, we propose a parallel HDFS(Hadoop Distributed File System) and emotion functions based on Mapreduce to extract some emotional information of users from various unstructured big data on social networks. The experiment results have verified that the proposed system and functions perform faster than O(n) for data gathering time and loading time, and maintain stable load balancing for memory and CPU resources.

• Journal of Electrical Engineering and Technology
• /
• v.6 no.2
• /
• pp.174-181
• /
• 2011

This paper proposes a novel binary ant colony optimization (NBACO) method. The proposed NBACO is based on the concept and principles of ant colony optimization (ACO), and developed to solve the binary and combinatorial optimization problems. The concept of conventional ACO is similar to Heuristic Dynamic Programming. Thereby ACO has the merit that it can consider all possible solution sets, but also has the demerit that it may need a big memory space and a long execution time to solve a large problem. To reduce this demerit, the NBACO adopts the state probability matrix and the pheromone intensity matrix. And the NBACO presents new updating rule for local and global search. The proposed NBACO is applied to test power systems of up to 100-unit along with 24-hour load demands.

• Journal of Korea Multimedia Society
• /
• v.6 no.1
• /
• pp.15-27
• /
• 2003

Recently, the volume of data is increasing rapidly in server for multimedia service, according to development of multimedia application environment. In recent research for storage technology the technology like of the SAN(Storage Area Network) advantages in scalibility of storage devices, and can read data from multiple disk arrays through RAID 0, 5. The RAID 0 and 5 translate to logical address to physical address using equation, but in case of adding disks at the system with equation -based mapping, the problem that we must rearrange the whole data in the previous disks happens. We use the mapping table to solve this problem in recent, but we can not load the whole mapping table in main memory because it occupies too large space. Therefore the extra I/Os are demanded to evaluate real physical address of data, so total performance of the system is degraded. In this paper, we propose the mapping method that supports the scalibility in RAID 0 or 5 system. The proposing method applies small metadata, so- called SZIT and simple equation, so it is possible that we make translate logical address to physical address rapidly and it is scalable in disk extending simultaneously Our suggesting method, if we add disks to the striping system for expanding of storage capacity, has an advantage of never stop service. So, SZlT-based mapping method can do online-disk-expanding in real-time service.

• Proceedings of the KIEE Conference
• /
• 2007.10c
• /
• pp.172-174
• /
• 2007

An electronic watt-hour meter with high-precision measurement technology can provide many valuable metering data of a real-time system measurements, such as per-phase voltage, ampere, active power, reactive power, apparent power, power factor, and system frequency. Also many of accumulated metering data such as active energy, reactive energy, apparent energy, and load profile can be gettable from an electronic watt-hour meter[1]. This paper presents an approach of the small-sized AMR (Automatic Meter Reading) that provides customers with a very valuable electrical service. This AMR service transmits lots of a valuable metering data by using ZigBee communication module, so that users resided in their premises can use the information to audit a power quality and improve their electrical conditions by using the PQ monitoring device equipped with ZigBee receiver. This PQ monitoring device shows metering data on LCD and transmits to the PC through an internal network. Also, the device can keep the valuable meter data into a built-in non-volatile memory. The final goal of this paper is to better understand the power quality of electrical systems and offer the power qualify information for the convenience of all power consumers.

• Structural Engineering and Mechanics
• /
• v.32 no.1
• /
• pp.95-126
• /
• 2009

The present contribution addresses the parallelization of advanced simulation methods for structural reliability analysis, which have recently been developed for large-scale structures with a high number of uncertain parameters. In particular, the Line Sampling method and the Subset Simulation method are considered. The proposed parallel algorithms exploit the parallelism associated with the possibility to simultaneously perform independent FE analyses. For the Line Sampling method a parallelization scheme is proposed both for the actual sampling process, and for the statistical gradient estimation method used to identify the so-called important direction of the Line Sampling scheme. Two parallelization strategies are investigated for the Subset Simulation method: the first one consists in the embarrassingly parallel advancement of distinct Markov chains; in this case the speedup is bounded by the number of chains advanced simultaneously. The second parallel Subset Simulation algorithm utilizes the concept of speculative computing. Speedup measurements in context with the FE model of a multistory building (24,000 DOFs) show the reduction of the wall-clock time to a very viable amount (<10 minutes for Line Sampling and ${\approx}$ 1 hour for Subset Simulation). The measurements, conducted on clusters of multi-core nodes, also indicate a strong sensitivity of the parallel performance to the load level of the nodes, in terms of the number of simultaneously used cores. This performance degradation is related to memory bottlenecks during the modal analysis required during each FE analysis.