• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2002년도 하계학술대회 논문집 D
• /
• pp.2410-2414
• /
• 2002

In this paper, a software framework is proposed for the personal robot located on home network. The proposed software framework is divided into four layers-a transparency layer, a behavior layer, a distributed task layer, and a mission scenario layer. The transparency layer consists of a virtual machine for platform transparency, and a communication broker for communication transparency among behavior modules. The communication architecture includes both server/client communication and publisher/subscriber communication. A mission scenario is assumed to be a composition of sequentially planned distributed tasks. In addition to the software framework, a new concept, personal robot design center platform as proposed in this paper with its implementation mechanisms. The personal robot design center is defined as a developing and a managing environment for high-level behavior modules, distributed tasks, and mission scenarios.

• 한국정보시스템학회:학술대회논문집
• /
• 한국정보시스템학회 2000년도 추계학술대회
• /
• pp.12-15
• /
• 2000

An SADT-based methodology is presented for systematically analyzing the container working process in container terminal, as well as an object-oriented design method for an integrated information system for container terminal resource planning and management. Our design architecture is composed of four levels, activity interface, activity PDCA control, human resource management, and facility resource management. Especially, the consideration of the human resource management level makes it possible to support cooperative tasks, to make the authority and responsibility on a task clear, and to extremely promote the balance between human and facility resources. Finally, The system architecture is suggested for Virtual Container Terminal, in which a planned container working process is simulated for previous feasibility check, work orders are transferred to control real devices, and to manage the entire process and related data.

• 전자공학회논문지S
• /
• 제35S권4호
• /
• pp.10-19
• /
• 1998

With the advent of high-speed networks, the increasingly stringent performance requeirements are being placed on the underlying switching systems. Under these circumstances, simulation methods for evaluating the performace of such a switch requires vast computational cost and accordingly the importance of anlytical methods increases. In general, the performance analysis of a switch architecture is also a very difficult task in that the conventional queueing system such as switching systems, which consists of a large numbe of queues which interact with each other in a fiarly complicated manner. To overcome these difficulties, most of the past research results assumed that multiple queues become decoupled as the switch size grows unboundely large, which enables the conventional queueing theory to be applied. In this apepr, w analyze a non-blocking space-division ATM swtich with input queueing, and prove analytically the pheonomenon that virtual queues formed by the head-of-line cells become decoupled as the switch size grows unboundedly large. We also establish various properties of the limiting queue size processes so obtained and compute the maximum throughput associated with ATM switches with input queueing.

• Journal of Communications and Networks
• /
• 제4권3호
• /
• pp.209-220
• /
• 2002

In this paper, we propose a hierarchical packet scheduling technique to closely approximate a hierarchical extension of the generalized processor sharing model, Hierarchical Generalized Processor Sharing (H-GPS). Our approach is to undertake the tasks of service guarantee and hierarchical link sharing in an independent manner so that each task best serves its own objective. The H-GPS model is decomposed into two separate service components: the guaranteed service component to consistently provide performance guarantees over the entire system, and the excess service component to fairly distribute spare bandwidth according to the hierarchical scheduling rule. For tight and harmonized integration of the two service components into a single packet scheduling algorithm, we introduce two novel concepts of distributed virtual time and service credit, and develop a packet version of H-GPS called Hierarchical Fair Queueing (HFQ). We demonstrate the layerindependent performance of the HFQ algorithm through simulation results.

• 한국멀티미디어학회논문지
• /
• 제24권9호
• /
• pp.1279-1284
• /
• 2021

This paper addresses the task of transferring facial blendshape models to an arbitrary target face. Blendshape is a common method for the facial rig; however, production of blendshape rig is a time-consuming process in the current facial animation pipeline. We propose automatic blendshape facial rigging based on our blendshape transfer method. Our method computes the difference between source and target facial model and then transfers the source blendshape to the target face based on a deformation transfer algorithm. Our automatic method provides efficient production of a controllable digital human face; the results can be applied to various applications such as games, VR chating, and AI agent services.

• 한국멀티미디어학회논문지
• /
• 제22권7호
• /
• pp.759-769
• /
• 2019

Since a surgery simulation should be able to represent the internal structure of the human body, it is advantageous to adopt volume based techniques rather than polygon based techniques. However, the volume based techniques induce large computation to deform heterogeneous volume datasets such as bones and muscles. In this study, we propose a new method to deform volume data using multi-core CPUs. By improving previous studies, the proposed method minimizes unnecessary propagation operations. Moreover, we propose an efficient task-partitioning method for volume deformation using multi-core CPUs. As a result, we can simulate the deformation of heterogeneous volume data at an interactive speed without special hardware.

• Journal of information and communication convergence engineering
• /
• 제16권4호
• /
• pp.264-270
• /
• 2018

In our research study, we aim at optimizing multiple load in cloud, effective resource allocation and lesser response time for the job assigned. Using Hadoop on datacenter is the best and most efficient analytical service for any corporates. To provide effective and reliable performance analytical computing interface to the client, various cloud service providers host Hadoop clusters. The previous works done by many scholars were aimed at execution of workflows on Hadoop platform which also minimizes the cost of virtual machines and other computing resources. Earlier stochastic hill climbing technique was applied for single parameter and now we are working to optimize multiple parameters in the cloud data centers with proposed heuristic hill climbing. As many users try to priorities their job simultaneously in the cluster, resource optimized workflow scheduling technique should be very reliable to complete the task assigned before the deadlines and also to optimize the usage of the resources in cloud.

• 전자통신동향분석
• /
• 제34권6호
• /
• pp.100-107
• /
• 2019

Recently, reinforcement learning (RL) has expanded from the research phase of the virtual simulation environment to a wide range of applications, such as autonomous driving, natural language processing, recommendation systems, and disease diagnosis. However, RL is less likely to be used in these complex real-world environments. In contrast, inverse reinforcement learning (IRL) can obtain optimal policies in various situations; furthermore, it can use expert demonstration data to achieve its target task. In particular, IRL is expected to be a key technology for artificial general intelligence research that can successfully perform human intellectual tasks. In this report, we briefly summarize various IRL techniques and research directions.

• Current Optics and Photonics
• /
• 제4권6호
• /
• pp.540-544
• /
• 2020

Current two-dimensional (2D) augmented reality (AR) devices present virtual image and information to a fixed focal plane, regardless of the various locations of ambient objects of interest around the observer. This limitation can lead to a visual discomfort caused by misalignments between the view of the ambient object of interest and the visual representation on the AR device due to a failing of the singular fusion. Since the misalignment becomes more severe as the depth difference gets greater, it can hamper visual understanding of the scene, interfering with task performance of the viewer. Thus, we analyzed the range of singular fusion (RSF) of AR images within which viewers can perceive the shape of an object presented on two different depth planes without difficulty due to the failure of singular fusion. It is expected that our analysis can inspire the development of advanced AR systems with low visual discomfort.

• 한국BIM학회 논문집
• /
• 제10권4호
• /
• pp.60-69
• /
• 2020

Allowing on-site workers to access information of the construction process can enable task control, data integration, material and resource control. However, in the current practice of the construction industry, the existing methods and scope is quite limited, leading to inefficient management during the construction process. In this research, by adopting cutting edge technologies such as Augmented Reality(AR), digital twins, deep learning and computer vision with wearable AR devices, the authors proposed an AR visualization framework made of virtual components to help on-site workers to obtain information of the construction process with ease of use. Also, this paper investigates wearable AR devices and object detection algorithms, which are critical factors in the proposed framework, to test their suitability.