• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.1
• /
• pp.183-191
• /
• 2001

We develop the new data s]ice representation, called the data value flow graph(VFG), for modeling the information flow oil data slices. Then we define a slice complexity measure by using the existing flow complexity measure in order to measure the complexity of the information flow on VFG. We show relation of the slice complexity on a slice with the slice complexity on a procedure. We also demonstrate the measurement scale factors through a set of atomic modifications and a concatenation operator on VFG.

• The KIPS Transactions:PartD
• /
• v.8D no.3
• /
• pp.257-264
• /
• 2001

We developed a SIFG (Slice-based Information Graph), which modelled the information flow on program on the basis of the information flow of data tokens on data slices. Then we defied a SCM (Slice-based complexity measure), which measured the program complexity by measuring the complexity of information flow on SIFG. SCM satisfied the necessary properties for complexity measure proposed by Briand et al. SCM could measure not only the control and data flow on program but also the physical size of program unlike the existing measures.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2004.10a
• /
• pp.1221-1224
• /
• 2004

In this study, we developed a method classifying slice shot during golf practice using backpropagation algorithm. The 144 data based on the backpropagation model(11 inputs, 2 outputs) was used as a learning set and the model was verified based on the extra 50 data in the process to predict a slice shot in golf swing. The results showed 100％ separating rate of learning set and 91.5％ separating rate of verified set. The developed method can be potentially beneficial for the predicting of slice shot in an indoor golf excercise setting without applying any additional equipment.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1997.04a
• /
• pp.416-421
• /
• 1997

This study presents a way to construct 3D shape in STL format from 2D slice data. Nowadays ahape reconstruct has been done in many ares, the application of this method is important especially in Reverse Engineering which reconstructs original shape from cross-section data. Current RP (Rapid Prototyping) is used not only for the verification of a part designed but also for the production and tooling in more effective way. In RP technology, data should be prepared in STL format. In this paper, the way to make 3D shape data in STL format form 2D slice data is described which can be used to reconstruct an original shape in RP equipment.

• Journal of information and communication convergence engineering
• /
• v.17 no.3
• /
• pp.185-190
• /
• 2019

The explosive growth of data traffic and services has created cost challenges for networks. Studies have attempted to effectively apply network slicing in fifth generation networks to provide high speed, low latency, and various compatible services. However, in network slicing using mixed-integer linear programming, the operation count increases exponentially with the number of physical servers and virtual network functions (VNFs) to be allocated. Therefore, we propose an efficient slice allocation method based on cluster technology, comprising the following three steps: i) clustering physical servers; ii) selecting an appropriate cluster to allocate a VNF; iii) selecting an appropriate physical server for VNF allocation. Solver runtimes of the existing and proposed methods are compared, under similar settings, with respect to intra-slice isolation. The results show that solver runtime decreases, by approximately 30% on average, with an increase in the number of physical servers within the cluster in the presence of intra-slice isolation.

• Journal of KIISE:Software and Applications
• /
• v.31 no.7
• /
• pp.922-928
• /
• 2004

We propose a new 3 dimensional labeling method based on slice information for the volume data. This method is named SIL (Slice Information based Labeling). Compare to the conventional algorithms, it has advantages that the use of memory is efficient and it Is possible to combine with a variety of 2 dimensional labeling algorithms for finding an appropriate labeling algorithm to its application. In this study, we applied SIL to confocal microscopy images of cervix cancer cell and compared the results of labeling. According to the measurement, we found that the speed of Sd combined with, CCCL (Contour based Connected Component Labeling) is almost 2 times higher than that of other methods. In conclusion, considering that the performance of labeling depends on a kind of image, we obtained that the proposed method provide better result for the confocal microscopy cell volume data.

• Imaging Science in Dentistry
• /
• v.34 no.1
• /
• pp.13-18
• /
• 2004

Purpose : This study was to evaluate the influence of slice thickness of computed tomography (CT) and rapid protyping (RP) type on the accuracy of 3-dimensional medical model. Materials and Methods: Transaxial CT data of human dry skull were taken from multi-detector spiral CT. Slice thickness were 1, 2, 3 and 4 mm respectively. Three-dimensional image model reconstruction using 3-D visualization medical software (V-works /sup TM/ 3.0) and RP model fabrications were followed. 2-RP models were 3D printing (Z402, Z Corp., Burlington, USA) and Stereolithographic Apparatus model. Linear measurements of anatomical landmarks on dry skull, 3-D image model, and 2-RP models were done and compared according to slice thickness and RP model type. Results: There were relative error percentage in absolute value of 0.97, 1.98,3.83 between linear measurements of dry skull and image models of 1, 2, 3 mm slice thickness respectively. There was relative error percentage in absolute value of 0.79 between linear measurements of dry skull and SLA model. There was relative error difference in absolute value of 2.52 between linear measurements of dry skull and 3D printing model. Conclusion: These results indicated that 3-dimensional image model of thin slice thickness and stereolithographic RP model showed relative high accuracy.

• 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.

• Korean Journal of Computational Design and Engineering
• /
• v.2 no.3
• /
• pp.195-210
• /
• 1997

In Rapid Prototyping process, the time required to build multiple prototype parts can be reduced by packing several parts optimally in a work volume. Interactive arrangement of the multiple parts is a tedious process and does not guarantee the optimal placement of all the parts. In this case, packing is a kind of 3-D nesting problem because parts are represented by STL files with 3-D information. 3-D nesting is well known to be a problem requiring an intense computation and an efficient algorithm to solve the problem is still under investigation. This paper proposes that packing 3-D parts can be simplified into a 2-D irregular polygon nesting problem by using the characteristic of rapid prototyping process that the process uses 2-dimensional slicing data of the parts and that slice of the STL parts are composed of polygons. Our algorithm uses no-fit-polygon (NFP) to place each slice without overlapping other slices in the same z-level. The allowable position of one part at a fixed orientation for given parts already packed can be determined by obtaining the union of all NFP's that are obtained from each slice of the part. Genetic algorithm is used to determine the order of parts to be placed and orientations of each part for the optimal packing. Optimal orientation of a part is determined while rotating it about the axis normal to the slice by finite angles and flipping upside down. This algorithm can be applied to any rapid prototyping process that does not need support structures.

• Korean Journal of Computational Design and Engineering
• /
• v.3 no.1
• /
• pp.15-21
• /
• 1998

Several adaptive and direct slicing methods have been developed to make the slice data for RP parts with better accuracy and speed. This research deals with a new adaptive slicing algorithm that shows drastic improvement in computing time for calculating the slices of a part. First, it uses less number of sampling points fur each slice in determining the thickness of the next slice. Secondly, the idea of contour map is utilized to determine the optimal sampling point on each slice. Thirdly, the calculation efficiency is further improved by introducing vertical character lines of the given part. The results in terms of accuracy and speed are compared with the existing methods.