• Journal of the Korea Institute of Building Construction
• /
• v.10 no.2
• /
• pp.33-40
• /
• 2010

Recently, the scale of construction work has been growing, and buildings are becoming higher. To enable greater efficiency of construction work, the use of vertical transportation equipment has been radically increasing. In this context, many studies have been conducted on tower cranes. While these studies have discussed issues such as the selection of tower cranes, the optimization of locations, and the hoisting time of tower cranes, there has been no research on the installation of tower cranes. As such, the installation of tower cranes on construction sites has been accomplished based on subjective judgment and technical assistance, and the experience of workers in equipment companies. Therefore, this study analyzes the productivity of tower cranes using simulation methodology, and proposes a generalized model of the installation process of tower cranes in order to offer a basic resource that site managers can directly utilize.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.2
• /
• pp.267-276
• /
• 2009

Nowadays, numerous of valuable internet services are available not only for personal computer but also for mobile appliances in wireless network environment. Therefore, as the amount of contents is increased for those services, the storage limitation on mobile devices has became a significant issue. In this paper, we present a new block-level storage network protocol, iATA (Internet Advanced Technology Attachment) as a solution to the above problem. iATA is designed to transport ATA block-level data and command over the ubiquitous TCP/IP network. With iATA, a mobile appliance is able to access and control the ATA storage devices natively through network from anywhere and at anytime as if the storage devices is attached locally. We describe the concepts, design and diverse consideration of iATA protocol. Based on the benchmark experiments and application exploitation, we strongly believe that iATA as a light-weight protocol is efficient and cost-effective to be used as a storage network protocol on a resource limited device that utilizes common-off-the-shelf storage hardware and existing IP infrastructure.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.6
• /
• pp.105-109
• /
• 2021

In this paper, we evaluate Boosted 3-D PCA as a Dataset and evaluate its performance. After that, we will analyze the network features and performance. In this paper, the learning was performed using the 300W-LP data set using the same learning method as Boosted 3-D PCA, and the evaluation was evaluated using the AFLW2000 data set. The results show that the performance is similar to that of the Boosted 3-D PCA paper. This performance result can be learned using the data set of face images freely than the existing Landmark-to-Pose method, so that the poses can be accurately predicted in real-world situations. Since the optimization of the set of key points is not independent, we confirmed the manual that can reduce the computation time. This analysis is expected to be a very important resource for improving the performance of network boosted 3-D PCA or applying it to various application domains.

• Journal of the Korean Institute of Gas
• /
• v.25 no.3
• /
• pp.53-58
• /
• 2021

The number of patients with cardiovascular diseases who experience an out-of-hospital cardiac arrest (OHCA) are increasing among young adults as well as the aged population. An automated external defibrillator (AED) is vital in improving survival rates of OHCA victims. Survival rates of OHCA were shown to decline exponentially in time to defibrillation, yet studies in Korea are uncommon that captures the properties of their survival rates in examining optimal locations of AEDs. In this study, we worked on the maximal gradual coverage location problem (MGCLP) with exponential decay coverage function to decide on their optimal locations. The exponential decay coverage function mitigates the drawback of over-estimating survival rates of OHCA patients. It is expected that a more sophisticated facility location problem will be developed to identify the "emergent" characteristics of pedestrians who responds to the OHCA occurrence by incorporating random pedestrian locations and movement through simulation.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.22 no.3
• /
• pp.565-573
• /
• 2012

To investigate the business corruption, the obtainments of the business data such as personnel, manufacture, accounting and distribution etc., is absolutely necessary. Futhermore, the investigator should have the systematic extraction solution from the business data of the enterprise database, because most company manage each business data through the distributed database system, In the general business environment, the database exists in the system with upper layer application and big size file server. Besides, original resource data which input by user are distributed and stored in one or more table following the normalized rule. The earlier researches of the database structure analysis mainly handled the table relation for database's optimization and visualization. But, in the point of the digital forensic, the data, itself analysis is more important than the table relation. This paper suggests the extraction technique from the table relation which already defined in the database. Moreover, by the systematic analysis process based on the domain knowledge, analyzes the original business data structure stored in the database and proposes the solution to extract table which is related incident.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.20 no.1
• /
• pp.3-16
• /
• 2010

Recently in the field of the wireless sensor network, many researchers are attracted to pairing cryptography since it has ability to distribute keys without additive communication. In this paper, we propose efficient hardware implementation of ${\eta}_T$ pairing which is one of various pairing scheme. we suggest efficient hardware architecture of ${\eta}_T$ pairing based on parallel processing and register/resource optimization, and then we present the result of our FPGA implementation over GF($2^{239}$). Our implementation gives 15% better result than others in Area Time Product.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.31 no.3
• /
• pp.323-330
• /
• 2021

Recently, the advantages of high-speed arithmetic in quantum computers have been known, and interest in quantum circuits utilizing qubits has increased. The Grover algorithm is a quantum algorithm that can reduce n-bit security level symmetric key cryptography and hash functions to n/2-bit security level. Since the Grover algorithm work on quantum computers, the symmetric cryptographic technique and hash function to be applied must be implemented in a quantum circuit. This is the motivation for these studies, and recently, research on implementing symmetric cryptographic technique and hash functions in quantum circuits has been actively conducted. However, at present, in a situation where the number of qubits is limited, we are interested in implementing with the minimum number of qubits and aim for efficient implementation. In this paper, the domestic hash function LSH is efficiently implemented using qubits recycling and pre-computation. Also, major operations such as Mix and Final were efficiently implemented as quantum circuits using ProjectQ, a quantum programming tool provided by IBM, and the quantum resources required for this were evaluated.

• International Journal of Computer Science & Network Security
• /
• v.21 no.1
• /
• pp.137-142
• /
• 2021

The Internet of Things (IoT) paradigm is at the forefront of present and future research activities. The huge amount of sensing data from IoT devices needing to be processed is increasing dramatically in volume, variety, and velocity. In response, cloud computing was involved in handling the challenges of collecting, storing, and processing jobs. The fog computing technology is a model that is used to support cloud computing by implementing pre-processing jobs close to the end-user for realizing low latency, less power consumption in the cloud side, and high scalability. However, it may be that some resources in fog computing networks are not suitable for some kind of jobs, or the number of requests increases outside capacity. So, it is more efficient to decrease sending jobs to the cloud. Hence some other fog resources are idle, and it is better to be federated rather than forwarding them to the cloud server. Obviously, this issue affects the performance of the fog environment when dealing with big data applications or applications that are sensitive to time processing. This research aims to build a fog topology job scheduling (FTJS) to schedule the incoming jobs which are generated from the IoT devices and discover all available fog nodes with their capabilities. Also, the fog topology job placement algorithm is introduced to deploy jobs into appropriate resources in the network effectively. Finally, by comparing our result with the state-of-art first come first serve (FCFS) scheduling technique, the overall execution time is reduced significantly by approximately 20%, the energy consumption in the cloud side is reduced by 18%.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.12
• /
• pp.1632-1638
• /
• 2020

In this paper, we investigate a multi-beam satellite communication system where multiple terminals transmit information signals to the gateway via a satellite. The satellite is equipped with phased array antennas to form multiple spot beams of which bandwidths are not identically allocated. We formulate an optimization problem to maximize fairness of beam bandwidth allocation. In order to solve the problem, we propose two heuristic algorithms; iterative beam bandwidth allocation (IBBA) and request ratio-based beam bandwidth allocation (RRBBA) algorithms. The IBBA algorithm iteratively equalizes the ratio of allocated bandwidth of each beam to their resource request while the RRBBA algorithm allocates beam bandwidth calculated from the ratio. Simulation results show that the IBBA algorithm has close fairness performance to the optimum while the RRBBA algorithm has less performance than the IBBA algorithm at the price of reduced computational complexity.

• KIPS Transactions on Computer and Communication Systems
• /
• v.10 no.4
• /
• pp.101-106
• /
• 2021

Quantum algorithms and quantum computers can break the security of many of the ciphers we currently use. If Grover's algorithm is applied to a symmetric key cipher with n-bit security level, the security level can be lowered to (n/2)-bit. In order to apply Grover's algorithm, it is most important to optimize the target cipher as a quantum circuit because the symmetric key cipher must be implemented as a quantum circuit in the oracle function. Accordingly, researches on implementing AES(Advanced Encryption Standard) or lightweight block ciphers as quantum circuits have been actively conducted in recent years. In this paper, korean lightweight block cipher LEA was optimized and implemented as a quantum circuit. Compared to the previous LEA quantum circuit implementation, quantum gates were used more, but qubits were drastically reduced, and performance evaluation was performed for this tradeoff problem. Finally, we evaluated quantum resources for applying Grover's algorithm to the proposed LEA implementation.