• Journal of the Korean Society for Precision Engineering
• /
• v.17 no.1
• /
• pp.185-191
• /
• 2000

Direct ＆ adaptive slicing of sculptured surfaces in RP improves, quality ＆ accuracy of the final product, compared to the slicing with uniform layer thickness or the slicing of facets (ie, STL). Present D＆A slicing procedures adaptively compute the next layer thickness based on the surface information of current sliced contour, which assumes constant normal curvature values. In some cases, however. such assumption leads to intolerable slicing result which cannot correctly consider the entire local feature shape. We propose improved adaptive slicing algorithms which can determine near-optimal layer thickness, including illustrated examples.

• Journal of Information Display
• /
• v.2 no.2
• /
• pp.27-31
• /
• 2001

Transistor slicing refers to the use of multiple smaller transistors in implementing a large MOS transistor. What is special about transistor slicing is that it can reduce the effects of device non-uniformity introduced during the fabrication process. The paper presents the idea of transistor slicing and analyzes the benefits of using transistor slicing in the context of Poly-Si TFT-LCD driving.

• Journal of Korea Multimedia Society
• /
• v.6 no.4
• /
• pp.736-745
• /
• 2003

Traditional slicing techniques make slices through dependence graphs. They also 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, and size of the slices is larger. We propose the representation of a dynamic object-oriented program dependence graph so as to process the slicing of object-oriented programs that is composed of related programs in order to process certain jobs. We also propose an efficient slicing algorithm using the relations of relative tables in order to compute dynamic slices of object-oriented programs. Consequently, the efficiency of the proposed efficient dynamic object-oriented program dependence graph technique is also compared with the dependence graph techniques discussed previously As a result, this is certifying that an efficient dynamic object-oriented program dependence graph is more efficient in comparison with the traditional object-oriented dependence graphs and dynamic object-oriented program dependence graph.

• Journal of Embryo Transfer
• /
• v.16 no.2
• /
• pp.99-106
• /
• 2001

This study was undertaken to compare the efficiency of recovery rate and development rate of follicular oocytes collected either by aspiration or by slicing method. The follicular oocytes collected by the two methods matured in TCM199 supplemented with 10% steer serum at 39$^{\circ}C$ in a humidified atmosphere of 5% $CO_2$in air. After 22 h of culture, the oocytes were inseminated with frozen-thawed semen (2$\times$10$^{6}$ sperm/ml of final concentration) prepared with Percoll-density gradient in IVF-TALP medium for 16 h. Later, sets of 15 presumptive zygotes were transferred into 50 $\mu$L, droplets of CR1aa medium. On day 4 of the culture, embryos were transferred to TCM199 until day 9. The percentages of nuclear maturation to pre-metaphase II in the oocytes collected by aspiration are significantly (P<0.05) higher than that by slicing (83% vs. 62%, respectively). The mean number of oocytes recovered by slicing per ovary is significantly (P<0.05) higher than that by aspiration (15.1 vs. 6.7, respectively). Although the rates of cleavage and development to blastocyst of oocytes collected b)\\\\`aspiration are significantly (P<0.05) higher than that by slicing, the number of transferable embryos obtained by slicing method is significantly (P<0.05) higher than that by aspiration. From the results. we may conclude that slicing method is better than aspiration method for obtaining large number of transferable embryos per ovary.

• Journal of Platform Technology
• /
• v.11 no.5
• /
• pp.84-96
• /
• 2023

Network slicing refers to a technology that divides network infrastructure into multiple parts. Network slicing enables flexible network configuration while minimizing the physical resources required for network division. For this reason, network slicing technology has recently been developed and introduced in a form suitable for the 5G environment for efficient management of large-scale network environments. However, systematic analysis of network slicing research in the 5G environment has not been conducted, resulting in a lack of systematic analysis of the technology. Accordingly, in this paper, we provide insight into network slicing technology in the 5G network environment by conducting a comparative analysis of the technology. In this study's comparative analysis, 13 literatures on network slicing in the 5G environment was identified and compared and analyzed through a systematic procedure. As a result of the analysis, three network slicing technologies frequently used for 5G networks were identified: RAN (radio access network) slicing, CN (core network) slicing, and E2E (end-to-end) sliding. These technologies are mainly used for network services. It was confirmed that research is being conducted to achieve quality improvement and network isolation. It is believed that the results of this comparative analysis study can contribute to 6G technology research as a future direction and utilization plan for network slicing research.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1995.10a
• /
• pp.65-68
• /
• 1995

A slicing method by thin diamond blade is widely usd slicing of hard and brittle materials such as ceramics,glass and ferrite etc.. In this study, a new slicing system which realizes highly efficient and mirror surface slicing was developed by applying ELID-grinding with metallic bond diamond blades and its performance was evaluated. Hard and brittle materials such as ceramics,glass and ferrite were used as workpiece. Metallic bond diamond blades with grit sizes #325 and #2000 were used. Experimental results show that highly efficient slicing and good mirror surface can be successfully obtained using the developed slicing system with ELID features.

• Information and Communications Magazine
• /
• v.33 no.6
• /
• pp.9-17
• /
• 2016

본고에서는 5G 망에서의 서비스 요구사항을 만족하기 위한 구조로서 Network Slicing 구조를 제안하고 세부 적용방안을 기술한다. 이를 위해 5G 서비스를 우선 정의하고 그에 따른 서비스 요구사항을 도출한 후, 이러한 요구사항과 관련해 현재 망의 문제점에 대해 기술하고 망 개선을 위한 기술 요구사항을 정립한다. 특히, 5G에서의 중요성이 높아질 것으로 전망되고 있는 'Network Slicing'의 필요성 및 개념에 대해 서술한다. Network Slicing에 대한 제조사들의 솔루션 동향, 3GPP 등 단체의 표준화 동향, APN 방식의 P-LTE/DECOR/RAN Slicing 등 관련 기술의 발전 동향을 포함한 5G Network Slicing 주요 기술 동향에 대해서 알아본다. 또한, Slice의 관리 및 BSS/OSS등과의 연계를 위한 통신사업자 입장에서의 플랫폼 요구사항을 정리한다. 5G Network Slicing을 충족하기 위한 주요 기술로 C/U plane 분리구조, 범용 서버를 활용한 NFV/SDN, Edge 기반의 분산된 수평적 네트워크, 데이터 오프로딩 및 지연시간 절감을 위한 Edge Computing 등을 들 수 있고 효율적인 자원 관리를 위한 Orchestration 등에 대해서도 알아본다. 이를 기반으로 하여 사업자 입장에서 5G Core Network 기술을 선도함은 물론이고 향후, 조기 상용화를 위한 진화 방향을 제시하고자 한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.9
• /
• pp.2573-2589
• /
• 2023

As 5G mobile systems carry multiple services and applications, numerous user, and application types with varying quality of service requirements inside a single physical network infrastructure are the primary problem in constructing 5G networks. Radio Access Network (RAN) slicing is introduced as a way to solve these challenges. This research focuses on optimizing RAN slices within a singular physical cell for vehicle-to-everything (V2X) and enhanced mobile broadband (eMBB) UEs, highlighting the importance of adept resource management and allocation for the evolving landscape of 5G services. We put forth two unique strategies: one being offline network slicing, also referred to as standard network slicing, and the other being Online reinforcement learning (RL) network slicing. Both strategies aim to maximize network efficiency by gathering network model characteristics and augmenting radio resources for eMBB and V2X UEs. When compared to traditional network slicing, RL network slicing shows greater performance in the allocation and utilization of UE resources. These steps are taken to adapt to fluctuating traffic loads using RL strategies, with the ultimate objective of bolstering the efficiency of generic 5G services.

• Journal of the Korean Society for Precision Engineering
• /
• v.17 no.6
• /
• pp.69-75
• /
• 2000

At the stage of initial design, prototypes are needed for engineering and aesthetic purposes. In order to get a fast and non-expensive prototype, designers prefer rapid prototyping(RP) to any other means. In driving a 3D CAD model into rapid prototyping, sectioning the model is essential and there are two negotiation-needed targets, enhancing accuracy while taking less build-time, which makes adaptive slicing taken into account. In spite of the advantages of adaptive slicing, it is not yet applied to real RP machines because of the limits of hardwares. In this thesis, a new slicing algorithm which (1)uses several values of thickness available in a RP machine. (2)determines total number of layers to make the prototype within the intended time and (3)arranges the layers using orthogonal arrays to minimize the volume error caused by the difference between a given CAD model and a fabricated model is presented. And the algorithm is expected to have possibility of assisting RP machines to take the advantages of adaptive slicing.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2008.10b
• /
• pp.651-655
• /
• 2008

Traditional slicing techniques make slices through dependence graphs. They also improve the accuracy of slices. However, traditional slicing techniques require many vertices and edges in order to express a data communication links. Therefore the graph becomes complicated, and size of the slices is larger. We propose the representation of a dynamic object-oriented program dependence graph so as to process the slicing of object-oriented programs that is composed of related programs in order to process certain jobs. The efficiency of the proposed efficient dynamic object-oriented program dependence graph technique is also compared with the dependence graph techniques discussed previously. As a result, this is certifying that an efficient dynamic object-oriented program dependence graph is more efficient in comparison with the traditional dynamic object-oriented program dependence graph.