• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.10a
• /
• pp.563-564
• /
• 2017

The core of the cloud computing technology is the data center in that the networking technology is important. Cloud data centers are comprised of tens or even hundreds of thousands of physical servers, so networking technology is required for high-speed data transfer. These networking technologies also require scalability, fault tolerance, and agility. For these requirements, many multi-path based schemes have been proposed. However, it was mainly used for load balancing of traffic and select a path randomly. In this paper, a scheme that can construct a multipath using software defined networking technology and transmit the traffic in parallel by using the multipath to achieve a fast transmission speed, solve the scalability problem and fault tolerance is proposed.

• Molecules and Cells
• /
• v.42 no.2
• /
• pp.104-112
• /
• 2019

Tracking the fate of individual cells and their progeny through lineage tracing has been widely used to investigate various biological processes including embryonic development, homeostatic tissue turnover, and stem cell function in regeneration and disease. Conventional lineage tracing involves the marking of cells either with dyes or nucleoside analogues or genetic marking with fluorescent and/or colorimetric protein reporters. Both are imaging-based approaches that have played a crucial role in the field of developmental biology as well as adult stem cell biology. However, imaging-based lineage tracing approaches are limited by their scalability and the lack of molecular information underlying fate transitions. Recently, computational biology approaches have been combined with diverse tracing methods to overcome these limitations and so provide high-order scalability and a wealth of molecular information. In this review, we will introduce such novel computational methods, starting from single-cell RNA sequencing-based lineage analysis to DNA barcoding or genetic scar analysis. These novel approaches are complementary to conventional imaging-based approaches and enable us to study the lineage relationships of numerous cell types during vertebrate, and in particular human, development and disease.

• International Journal of Computer Science & Network Security
• /
• v.23 no.8
• /
• pp.121-136
• /
• 2023

Wireless Sensor Networks (WSNs) have many potential applications and unique challenges. Some problems of WSNs are: severe resources' constraints, low reliability and fault tolerant, low throughput, low scalability, low Quality of Service (QoS) and insecure operational environments. One significant solution against mentioned problems is hierarchical and clustering-based multipath routing. But, existent algorithms have many weaknesses such as: high overhead, security vulnerabilities, address-centric, low-scalability, permanent usage of optimal paths and severe resources' consumption. As a result, this paper is proposed an energy-aware, congestion-aware, location-based, data-centric, scalable, hierarchical and clustering-based multipath routing algorithm based on Numerical Taxonomy technique for homogenous WSNs. Finally, performance of the proposed algorithm has been compared with performance of LEACH routing algorithm; results of simulations and statistical-mathematical analysis are showing the proposed algorithm has been improved in terms of parameters like balanced resources' consumption such as energy and bandwidth, throughput, reliability and fault tolerant, accuracy, QoS such as average rate of packet delivery and WSNs' lifetime.

• International Journal of Stem Cells
• /
• v.17 no.1
• /
• pp.38-50
• /
• 2024

Induced pluripotent stem cell (iPSC) technology has revolutionized various fields, including stem cell research, disease modeling, and regenerative medicine. The evolution of iPSC-based models has transitioned from conventional two-dimensional systems to more physiologically relevant three-dimensional (3D) models such as spheroids and organoids. Nonetheless, there still remain challenges including limitations in creating complex 3D tissue geometry and structures, the emergence of necrotic core in existing 3D models, and limited scalability and reproducibility. 3D bioprinting has emerged as a revolutionary technology that can facilitate the development of complex 3D tissues and organs with high scalability and reproducibility. This innovative approach has the potential to effectively bridge the gap between conventional iPSC models and complex 3D tissues in vivo. This review focuses on current trends and advancements in the bioprinting of iPSCs. Specifically, it covers the fundamental concepts and techniques of bioprinting and bioink design, reviews recent progress in iPSC bioprinting research with a specific focus on bioprinting undifferentiated iPSCs, and concludes by discussing existing limitations and future prospects.

• KIPS Transactions on Computer and Communication Systems
• /
• v.9 no.10
• /
• pp.221-230
• /
• 2020

Supercomputer that shares limited resources to multiple users needs a way to optimize the execution of application. For this, it is useful for system administrators to get prior information and hint about the applications to be executed. In most high-performance computing system operations, system administrators strive to increase system productivity by receiving information about execution duration and resource requirements from users when executing tasks. They are also using profiling techniques that generates the necessary information using statistics such as system usage to increase system utilization. In a previous study, we have proposed a scheduling optimization technique by developing a hardware performance counter-based profiling technique that enables characterization of applications without further understanding of the source code. In this paper, we constructed a profiling testbed cluster to support optimal execution of the supercomputer and experimented with the scalability of the profiling method to analyze application characteristics in the built cluster environment. Also, we experimented that the profiling method can be utilized in actual scheduling optimization with scalability even if the application class is reduced or the number of nodes for profiling is minimized. Even though the number of nodes used for profiling was reduced to 1/4, the execution time of the application increased by 1.08% compared to profiling using all nodes, and the scheduling optimization performance improved by up to 37% compared to sequential execution. In addition, profiling by reducing the size of the problem resulted in a quarter of the cost of collecting profiling data and a performance improvement of up to 35%.

• Journal of KIISE:Information Networking
• /
• v.29 no.4
• /
• pp.375-385
• /
• 2002

The IETF has defined the Intserv model and the RSVP signaling protocol to improve QoS capability for a set of newly emerging services including voice and video streams that require high transmission bandwidth and low delay. However, since the current Intserv model requires each router to maintain the states of each service flow, the complexity and the overhead for processing packets in each rioter drastically increase as the size of the network increases, giving rise to the scalability problem. This motivates our work; namely, we investigate and devise new control schemes to enhance the scalability of the Intesev model. To do this, we basically resort to the SCORE network model, extend it to fairly well adapt to the three services presented in the Intserv model, and devise schemes of the QoS scheduling, the admission control, and the edge and core node architectures. We also carry out the computer simulation by using ns-2 simulator to examine the performance of the proposed scheme in respects of the bandwidth allocation capability, the packet delay, and the packet delay variation. The results show that the proposed scheme meets the QoS requirements of the respective three services of Intserv model, thus we conclude that the proposed scheme enhances the scalability, while keeping the efficiency of the current Intserv model.

• Journal of Broadcast Engineering
• /
• v.28 no.3
• /
• pp.314-328
• /
• 2023

In this paper, we propose a texture map compression method based on the hierarchical coding method of SHVC to support the scalability function of dynamic mesh compression. The proposed method effectively eliminates the redundancy of multiple-resolution texture maps by downsampling a high-resolution texture map to generate multiple-resolution texture maps and encoding them with SHVC. The dynamic mesh decoder supports the scalability of mesh data by decoding a texture map having an appropriate resolution according to receiver performance and network environment. To evaluate the performance of the proposed method, the proposed method is applied to V-DMC (Video-based Dynamic Mesh Coding) reference software, TMMv1.0, and the performance of the scalable encoder/decoder proposed in this paper and TMMv1.0-based simulcast method is compared. As a result of experiments, the proposed method effectively improves in performance the average of -7.7% and -5.7% in terms of point cloud-based BD-rate (Luma PSNR) in AI and LD conditions compared to the simulcast method, confirming that it is possible to effectively support the texture map scalability of dynamic mesh data through the proposed method.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2001.10a
• /
• pp.195-198
• /
• 2001

인터넷의 사용자가 급증하면서 고가용성(High Availability)과 확장성(Scalability)를 지닌 고성능 인터넷 서버들이 요구되고 있다. 클러스터 시스템은 이러한 요구사항을 만족시킬 수 있는 시스템으로 실제 작업을 처리하는 서버(Server)와 시스템 외부에서 유입되는 사용자 요구를 시스템에 속한 서버 노드에 분배하는 디렉터 (Director)로 이루어져 있다. 디렉터는 사용자가 요구한 작업을 서버노드에 분배하는 로드밸런서(Load-Balancer)의 역할을 하게 되는데, 작업을 분배하는 방법으로는 Round-Robin, Least-Connection 등의 방법이 주로 사용되고 있다. 본 논문에서는 각 작업분배 방법 중 효과적인 방법을 비교 선택하기 위해 대기이론을 적용하여 시뮬레이션을 통해 검증하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.2
• /
• pp.313-325
• /
• 1996

This paper presents a new architecture for full-search block-matching motion estimation. The architecture is based on linear systolic arrays. High speed operation is obtained by feeding reference data, search data, and control signals into the linear systolic array in a pipelined fashion. Input data are fed into the linear systolic array at a half of the processor speed, reducing the required data bandwidth to half. The proposed architecture has a good scalability with respect to the number of processors and input bandwidth when the size of reference block and search range change.

• IE interfaces
• /
• v.12 no.2
• /
• pp.329-336
• /
• 1999

Job efficiency and productivity of a manufacturing system with frequent job schedule changes are affected by performance of information system between job order planners anti manufacturing device operators. This paper describes implementation of concurrent information system which can active identify machine status and dispatch job orders to operators in a machine shop. Client and server environment for various machinery is implemented using OSI based network between shop floor control system and manufacturing devices. Portability and scalability are among many characteristics of the implemented system. The developed client and server system is expected to realize high productivity for manufacturing device.