• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2020.06a
• /
• pp.94-95
• /
• 2020

This paper introduces the mix design and performance evaluation of Ultra-High Performance Concrete (UHPC). The concrete mixture is designed to achieve a densely compacted cementitious matrix via the modified Andreasen & Andersen particle packing model. The compressive strengths of UHPC designed by this method reached 154MPa. The relationship between packing theory and compressive strength of UHPC is discussed in this paper.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.6
• /
• pp.1490-1495
• /
• 1998

Call packing has been recognized as a routing scheme that significantly reduces the blocking probability of connection requests in a circuit-switched Clos multistage interconnection network. In this paper, for the first time, a general analytical model for the point-to-point blocking probability of the call-packing scheme applied to Clos networks is developed. By introducing a new parameter called the degree of call packing, the model can correctly estimate the blocking probability of both call-packing and random routing schemes. The model is verified by computer simulation for various size networks and traffic conditions.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2019.11a
• /
• pp.206-207
• /
• 2019

MPEG 에서는 최대 6 자유도(6DoF)를 가지는 몰입형 미디어의 압축 표준화를 진행하고 있다. 360 비디오에 움직임 시차(parallax)를 추가한 것으로 정의되는 3DoF+의 가상 공간에서, 원하는 위치의 장면을 제공하려면 다른 위치에서 찍은 여러 비디오를 사용하여 임의의 원하는 시점의 뷰(view)를 렌더링 해야 한다. MPEG-I Visual 그룹에서는 이러한 3DoF+ 비디오의 효율적인 부호화 및 전송을 위한 표준화가 진행되고 있으며, 최근 시험모델(TMIV)을 개발하고 있다. 본 논문은 TMIV 에서 패치(patch)를 아틀라스(atlas)에 효율적으로 패킹하여 부호화 성능을 향상시킬 수 있는 패치 패킹 방법을 제안한다. 제안 방식은 패킹되는 패치들 간에 보호 대역(Guard Band)를 적용하여 패치간의 거리를 둠으로써 부호화로 인해 발생할 수 있는 아티팩트(artifact)를 줄여 최종 복원 뷰의 화질을 향상시킨다.

• Journal of KIISE:Databases
• /
• v.31 no.2
• /
• pp.122-131
• /
• 2004

Traditional works on indexing have been suggested for low dimensional data under dynamic environments. But recent database applications require efficient processing of huge sire of high dimensional data under static environments. Thus many indexing strategies suggested especially in partitioning ones do not adapt to these new environments. In our study, we point out these facts and propose a new partitioning strategy, which complies with new applications' requirements and is derived from analysis. As a preliminary step to propose our method, we apply a packing technique on the one hand and exploit observations on the Minkowski-sum cost model on the other, under uniform data distribution. Observations predict that unbalanced partitioning strategy may be more query-efficient than balanced partitioning strategy for high dimensional data. Thus we propose our method, called CSP (Cyclic Spliced Partitioning method). Analysis on this method explicitly suggests metrics on how to partition high dimensional data. By the cost model, simulations, and experiments, we show excellent performance of our method over balanced strategy. By experimental studies on other indices and packing methods, we also show the superiority of our method.

• Journal of Broadcast Engineering
• /
• v.25 no.2
• /
• pp.185-191
• /
• 2020

MPEG-I is actively working on standardization on the immersive video coding which provides up to 6 degree of freedom (6DoF) in terms of viewpoint. In a virtual space of 3DoF+, which is defined as an extension of 360 with motion parallax, looking at the scene from another viewpoint (another position in space) requires rendering an additional viewpoint using multiple videos included in the 3DoF+ video. In the MPEG-I Visual workgroup, efficient coding methods for 3DoF+ video are being studied, and they released Test Model for Immersive Video (TMIV) recently. This paper presents a patch packing method which packs the patches into atlases efficiently for improving coding efficiency of 3DoF+ video in TMIV. The proposed method improves the reconstructed view quality with reduced coding artifacts by introducing guardbands between patches in the atlas.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.2
• /
• pp.169-177
• /
• 2020

Malware analysis is one of the important concerns of computer security, and advances in analysis techniques have become important for computer security. In the past, the signature-based method was used to detect malware. However, as the percentage of packed malware increased, it became more difficult to detect using the conventional method. In this paper, we propose a method for identifying packers of packed programs using machine learning. The proposed method parses the packed program to extract specific PE information that can identify the packer and identifies the packer using the Adaptive Boosting algorithm among the machine learning models. To verify the accuracy of the proposed method, we collected and tested 391 programs packed with 12 types of packers and found that the packers were identified with an accuracy of about 99.2%. In addition, we presented the results of identification using PEiD, a signature-based PE identification tool, and existing machine learning method. The proposed method shows better performance in terms of accuracy and speed in identifying packers than existing methods.

• Journal of IKEEE
• /
• v.23 no.4
• /
• pp.1314-1320
• /
• 2019

In this paper, we propose a new method for optimizing bit operations and applying them to DNN(Deep Neural Network) in software environment. As a method for this, we propose a packing function for bitwise optimization and a masking matrix multiplication operation for application to DNN. The packing function converts 32-bit real value to 2-bit quantization value through threshold comparison operation. When this sequence is over, four 32-bit real values are changed to one 8-bit value. The masking matrix multiplication operation consists of a special operation for multiplying the packed weight value with the normal input value. And each operation was then processed in parallel using a GPU accelerator. As a result of this experiment, memory saved about 16 times than 32-bit DNN Model. Nevertheless, the accuracy was within 1%, similar to the 32-bit model.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2022.11a
• /
• pp.371-373
• /
• 2022

e커머스 풀필먼트 비즈니스에서 수요예측은 매우 중요하다. 이는 고객의 온라인 주문정보를 바탕으로 풀필먼트 창고 내에서의 적정 피킹, 패킹 인력과 배송을 위한 차량의 적정규모도 산정하여 관련 비용 및 자원들 관리에 활용되기 때문이다. 특히 예측결과에 따라 인력 운영비용 및 배송에도 영향을 미치기 때문에 그 중요성이 날이 갈수록 커지고 있는 상황이다. 이런 이유로 e커머스 풀필먼트 비즈니스에 활용하기 위한 특화된 수요예측 방법이 필요하다. 본 연구에서 제안하는 멀티 조합 수요예측 기술은 풀필먼트 비즈니스에 가장 중요한 요소인 피킹과 패킹을 위한 적정 작업 인력 확보를 하고 이를 통해 안정적인 상품 출고가 가능해진다.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.18 no.3
• /
• pp.59-65
• /
• 2019

In many industries, particle packing is adopted quite frequently. In the particle packing process, the Discrete Element Method (DEM) can analyze the multi-collision of particles efficiently. Two types of contact models are frequently used for the DEM. One is the linear spring model, which has the fastest calculation time, and the other is the Hertz-Mindlin model, which is the most frequently used contact model employing the DEM. Meanwhile, very tiny particles in the micrometer order are used in modern industries. In the micro length order, surface force is important to decreased particle size. To consider the effect of surface force in this study, we performed a simulation with the Hertz-Mindlin model and added the Johnson-Kendall-Roberts (JKR) theory depicting surface force with surface energy. In addition, three contact models were compared with several parameters. As a result, it was found that the JKR model has larger residual stress than the general contact models because of the pull-off force. We also validated that surface force can influence particle behavior if the particles are small.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.34 no.1
• /
• pp.31-40
• /
• 2024

Recently, static analysis-based signature and pattern detection technologies have limitations due to the advanced IT technologies. Moreover, It is a compatibility problem of multiple architectures and an inherent problem of signature and pattern detection. Malicious codes use obfuscation and packing techniques to hide their identity, and they also avoid existing static analysis-based signature and pattern detection techniques such as code rearrangement, register modification, and branching statement addition. In this paper, We propose an LLVM IR image-based automated static analysis of malicious code technology using machine learning to solve the problems mentioned above. Whether binary is obfuscated or packed, it's decompiled into LLVM IR, which is an intermediate representation dedicated to static analysis and optimization. "Therefore, the LLVM IR code is converted into an image before being fed to the CNN-based transfer learning algorithm ResNet50v2 supported by Keras". As a result, we present a model for image-based detection of malicious code.