• KNOM Review
• /
• v.21 no.2
• /
• pp.35-45
• /
• 2018

As Network Slicing functionality gets applied to mobile networking, a mechanism that enables the selection of network slices becomes indispensable. Following the 3GPP Technical Specification for the 5G Architecture, the inclusion of the Network Slice Selection Function (NSSF) in order to leverage the process of slice selection is apparent. However, actual implementation of this network function needs to deal with the dynamic changes of network instances, due to this, a platform that supports the orchestration of Virtual Network Functions (VNF) is required. Our proposed solution include the use of the Central Office Rearchitected as a Data Center (CORD) platform, with the specified profile for mobile networks (M-CORD) that integrates a service orchestrator (XOS) alongside solutions oriented to Software Defined Networking (SDN), Network Function Virtualization (VNF) and virtual machine management through OpenStack, in order to provide the right ecosystem where our implementation of NSSF can obtain slice information dynamically by relying on synchronization between back-end services and network function instances.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.6
• /
• pp.48-56
• /
• 2010

Recently, we need to dramatically speed up real-time video encoding and decoding on mobile devices because complexity of video CODEC is significantly increasing along with the demand for multimedia service of high-quality and high-definition videos by users. A variety of research is conducted for parallelism of video processing using newly developed multi-core platforms. In this paper, we propose a method of parallelism based on slice partition of video compression CODEC. We propose a novel concept of a parallel slice for parallelism and propose a new coding order to be adequate to the parallel slice which keeps high coding efficiency. To minimize synchronization time of multiple parallel slices, we also propose a synchronization method to determinate whether the parallel slice could be independently decoded or not. Experimental results shows that we achieved 27.5% (40.7%) speed-up by parallelism with bit-rate increase of 3.4% (2.7%) for CIF sequences (720p sequences) by implementing the proposed algorithm on the H.264/AVC.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2016.10a
• /
• pp.98-99
• /
• 2016

네트워크 슬라이싱 기술은 5G 네트워크에서의 필수 기술 중 하나이다. 네트워크 망에서는 네트워크 슬라이싱을 통해 서로 다른 요구사항이 존재하는 다수의 서비스를 유연하게 처리 할 수 있다. 본 논문에서는 먼저 전망되는 5G 네트워크 구조와 기반 기술에 대해 소개하고, 네트워크 슬라이싱 적용하기 위한 이슈를 정리한다. 끝으로 네트워크 슬라이스 선택 기능 설계 시 고려사항을 제안한다.

• Journal of the Korea Computer Graphics Society
• /
• v.25 no.3
• /
• pp.143-152
• /
• 2019

This paper presents two new techniques for solving the two problems of the water curtain: 'shape distortion' caused by gravity and 'resolution degradation' caused by fine satellite droplets around the shape. In the first method, when the user converts a three-dimensional model to a vertical sequence of slices, the slices are evenly spaced. The method is to adjust the time points at which the equi-distance slices are created by the nozzle array. In this method, even if the velocity of a water drop increases with time by gravity, the water drop slices maintain the equal interval at the moment of forming the whole shape, thereby preventing distortion. The second method is called the minimum time interval technique. The minimum time interval is the time between the open command of a nozzle and the next open command of the nozzle, so that consecutive water drops are clearly created without satellite drops. When the user converts a three-dimensional model to a sequence of slices, the slices are defined as close as possible, not evenly spaced, considering the minimum time interval of consecutive drops. The slices are arranged in short intervals in the top area of the shape, and the slices are arranged in long intervals in the bottom area of the shape. The minimum time interval is pre-determined by an experiment, and consists of the time from the open command of the nozzle to the time at which the nozzle is fully open, and the time in which the fully open state is maintained, and the time from the close command to the time at which the nozzle is fully closed. The second method produces water drop sculptures with higher resolution than does the first method.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.05a
• /
• pp.690-692
• /
• 2012

This pape presents the efficient test data compression method considering test power dissipation in scan test of IP core. There are many researches about test data compression using scan slice selective encoding except power dissipation. We present the new algorithm that assigns the don't care value to be a minimal hamming distance between adjacent slices. Experimental results show that the power dissipation is reduced.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2020.07a
• /
• pp.549-550
• /
• 2020

최근 등장한 자율주행, 스마트팩토리 및 IoT 등 다양한 기술은 기존 4G 네트워크를 활용하기에 부적합한 사항이 많았다. 따라서 5G 네트워크가 등장하였으며 네트워크 슬라이싱 기술을 통해 다양한 서비스에 각각의 네트워크 환경을 구성하여 제공하였다. 그러나 같은 네트워크 환경인 슬라이스 내에서도 특징이 다른 트래픽이 발생할 수 있으며 서비스의 종류로 고정된 슬라이스의 네트워크 환경은 트래픽 처리시간 증가 및 응답시간 증가를 유발할 수 있다. 따라서 본 논문에서는 트래픽의 특성을 고려하여 클러스터링을 시행하여 자동으로 네트워크 슬라이스를 관리하는 시스템을 제안한다.

• 베이커리
• /
• no.12 s.329
• /
• pp.110-110
• /
• 1995

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.5
• /
• pp.441-449
• /
• 2000

Binary volume data has its widespread use in the application of color volume rendering and surgical simulation system where gray-scale volume is inappropriate. For the efficient representation of binary volume, this paper proposes a new data structure - the Slice-based Binary Shell (SBS) - along with its rendering algorithm. Since SBS stores the minimal set of surface voxels in slice order and supports the direct computation of voxel coordinates, it shows high efficiency for rendering multiple objects. The rendering algorithm of SBS running on a PC with no specialized hardware renders more than one hundred binary objects in a second.

• Journal of the Korean Society of Radiology
• /
• v.13 no.5
• /
• pp.705-711
• /
• 2019

Currently, the brain CT scan of the latest equipment lacks the study of parameter change and dose change and especially of noise, uniformity analysis and dose change. Therefore, this study attempted to study the phenomenon that occurs at this time by analyzing tube voltage, slice thickness, and pitch change in exposure parameters when using high specification CT. Experimental results show that uniformity is better when using high voltage, thick slice thickness selection, and minimum pitch. As a result of the combination, the most uniformity condition was 140 kVp, 10 mm and pitch 0.5. Noise was found to be improved regardless of pitch by increasing tube voltage and slice thickness. The radiation dose increased linearly with tube voltage and pitch. Therefore, the results of this study will serve as a reference for the use of High specification brain CT.

• Journal of Korea Multimedia Society
• /
• v.5 no.3
• /
• pp.331-341
• /
• 2002

Traditional slicing techniques make slices through dependence graph and improve the accuracy of slices. However, traditional slicing techniques require many vertices and edges in order to express a data communication link because they are based on static slicing techniques. Therefore the graph becomes very complicated. We propose the representation of a dynamic system dependence graph so as to process the slicing of a software system that is composed of related programs in order to process certain jobs. We also propose programs on efficient slicing algorithm using relations of relative tables in order to compute dynamic slices of a software system. Using a marking table from results of the proposed algorithm can make dynamic system dependence graph for dynamic slice generation. Tracing this graph can generate final slices. We have illustrated our example with C program environment. Consequently, the efficiency of the proposed dynamic system dependence graph technique is also compared with the dependence graph techniques discussed previously. As the results, this is certifying that the dynamic system dependence graph is more efficient in comparison with system dependence graph.