• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2003.06a
• /
• pp.1751-1754
• /
• 2003

Due to advances in information technology, even Engineering Simulations can now be performed in web-based JAVA through an integrated operating system called Virtual Machine and the use of byte code, which guarantees the compatibility of identical codes in every computing system and makes it suitable for web-based simulation system development. This paper introduces an implementation embodied in JAVA Applet that allows a block-diagram type GUI that runs in a web browser for use in the dynamics simulation modeling of powertrains of vehicles and multi-body systems. This system is not restrained by any of the H/W and S/W in the user's computer, so that it has the advantage of providing a GUI that allows web-based block-diagram type modeling.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.11 no.3
• /
• pp.153-162
• /
• 2016

This paper proposes an optimal dynamic resource allocation method in IoT (Internet of Things) parking guidance system using Q-learning resource allocation model. In the proposed method, a resource allocation using a forecasting model based on Q-learning is employed for optimal utilization of parking guidance system. To demonstrate efficiency and availability of the proposed method, it is verified by computer simulation and practical testbed. Through simulation results, this paper proves that the proposed method can enhance total throughput, decrease penalty fee issued by SLA (Service Level Agreement) and reduce response time with the dynamic number of users.

• Journal of Power Electronics
• /
• v.10 no.6
• /
• pp.739-748
• /
• 2010

The increased integration of fuel cells with power electronics, critical loads, and control systems has prompted recent interest in accurate electrical terminal models of the polymer electrolyte membrane (PEM) fuel cell. Advancement in computing technologies, particularly parallel computation techniques and various real-time simulation tools have allowed the prototyping of novel apparatus to be investigated in a virtual system under a wide range of realistic conditions repeatedly, safely, and economically. This paper builds upon both advancements and provides a means of optimized model construction boosting computation speeds for a fuel cell model on a real-time simulator which can be used in a power hardware-in-the-loop (PHIL) application. Significant improvement in computation time has been achieved. The effectiveness of the proposed model developed on Opal RT's RT-Lab Matlab/Simulink based real-time engineering simulator is verified using experimental results from a Ballard Nexa fuel cell system.

• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.701-704
• /
• 2003

The home network system of ubiquitous computing concept is changing present our home life as more comfortable and safe. Also, it permits that we can connect the home network system and control the appliance which is linked to the home network system without limitation in time and place. But, as other systems that use the public network like the Internet, remote control/monitoring of the home network system that use the Internet includes problems such as user's access which is not admitted and information changing. This paper presents the efficient solution about the security problem that is recognized to important problem of the home network system. Also this paper implements the security of the home network system based on the UPnP (Universal Plug and Play), adding VPN (Virtual Private Network) router that uses the IPsec to the home network system which is consisted of the ARM9 and the Embedded Linux.

• Journal of Communications and Networks
• /
• v.13 no.6
• /
• pp.591-601
• /
• 2011

Today's Internet which provides communication channels with best-effort end-to-end performance is rapidly evolving into an autonomic global computing platform. Achieving autonomicity in the Future Internet will require a performance architecture that (a) allows users to request and own 'slices' of geographically-distributed host and network resources, (b) measures and monitors end-to-end host and network status, (c) enables analysis of the measurements within expert systems, and (d) provides performance intelligence in a timely manner for application adaptations to improve performance and scalability. We describe the requirements and design of one such "Future Internet performance architecture" (FIPA), and present our reference implementation of FIPA called 'OnTimeMeasure.' OnTimeMeasure comprises of several measurement-related services that can interact with each other and with existing measurement frameworks to enable performance intelligence. We also explain our OnTimeMeasure deployment in the global environment for network innovations (GENI) infrastructure collaborative research initiative to build a sliceable Future Internet. Further, we present an applicationad-aptation case study in GENI that uses OnTimeMeasure-enabled performance intelligence in the context of dynamic resource allocation within thin-client based virtual desktop clouds. We show how a virtual desktop cloud provider in the Future Internet can use the performance intelligence to increase cloud scalability, while simultaneously delivering satisfactory user quality-of-experience.

• Journal of Internet Technology
• /
• v.20 no.5
• /
• pp.1535-1545
• /
• 2019

Recently, the diverse kinds of applications in multimedia computing have been developed for visual surveillance, healthcare, smart cities, and security. Video conferencing is one of core applications among multimedia applications. The Quality of Service of video conferencing is a major issue, because of limited network traffic. Video conferencing allow a large number of users to converse with each other. However, the huge amount of packets are generated in the process of transmitting and receiving the photographed images of users. Therefore, the number of packets in video conferencing needs to be reduced. Video conferencing can be conducted in virtual reality by sending only the control signals of virtual characters and showing virtual characters based on the received signals to represent the users, instead of the photographed images of the users, in real time. This paper proposes a method that determines representative photographed images by analyzing the collected photographed images of users, using KMedoids algorithm and a decision tree, and expresses the users based on the analyzed images. The decision tree used for video conferencing are generated automatically using the proposed method. Given that the behaviors in the decision tree is added or changed considering photographed images, it is possible to reproduce the decision tree by photographing the behavior of the user in real-time. In an experiment conducted, 63 consecutively photographed images were collected and a decision tree generated by using the silhouette images of the photographed images. Indices of the silhouette images were utilized to express a subject and one index was selected using a decision tree. The proposed method reduced the number of comparisons by a factor of 3.78 compared with the traditional method that uses correlation coefficient. Further, each user's image could be outputted by using only the control image table of the image and the index.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.1
• /
• pp.204-226
• /
• 2018

Big data processing applications have been migrated into cloud gradually, due to the advantages of cloud computing. Hadoop Distributed File System (HDFS) is one of the fundamental support systems for big data processing on MapReduce-like frameworks, such as Hadoop and Spark. Since HDFS is not aware of the co-location of virtual machines in the cloud, the default scheme of block allocation in HDFS does not fit well in the cloud environments behaving in two aspects: data reliability loss and performance degradation. In this paper, we present a novel location-aware data block allocation strategy (LDBAS). LDBAS jointly optimizes data reliability and performance for upper-layer applications by allocating data blocks according to the locations and different processing capacities of virtual nodes in the cloud. We apply LDBAS to two stages of data allocation of HDFS in the cloud (the initial data allocation and data recovery), and design the corresponding algorithms. Finally, we implement LDBAS into an actual Hadoop cluster and evaluate the performance with the benchmark suite BigDataBench. The experimental results show that LDBAS can guarantee the designed data reliability while reducing the job execution time of the I/O-intensive applications in Hadoop by 8.9% on average and up to 11.2% compared with the original Hadoop in the cloud.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.05a
• /
• pp.35-37
• /
• 2022

Online video conferencing systems such as Zoom and Discord are mainly used for non-face-to-face work due to their good accessibility and lack restriction of space. However, most online video conferencing systems are difficult to interact in both directions, and problems such as difficulty in communication and lack of immersion are emerging in participants who use them. On the other hand, Metaverse, which has attracted attention with the development of spatial computing, enables smooth interaction like the real world in the three-dimensional virtual world by utilizing hearing, visual, and touch information. In this paper, we propose a method of utilizing the metaverse platform to improve the problem of lack of immersion in the existing online video conferencing system. Through the proposal method, platform users can share and check each other's work screens in a virtual space and exchange various data. In order to improve participants' of immersion, the environment and improvement plan of the metaverse platform were constructed and compared with the existing online video conferencing platform.

• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.9
• /
• pp.297-306
• /
• 2015

Cloud computing has been increasingly used in various fields due to its flexibility, scalability, cost effectiveness, etc. Recently, many scientific communities have been attempting to use cloud computing as a way to deal with difficulties in constructing and operating a research infrastructure. Especially, since they need various collaborations based on networking, such as sharing experimental data, redistributing experimental results, and so forth, cloud computing environment that supports high performance networking is required for scientific communities. To address these issues, we propose RealLab, a high performance cloud platform for collaborative research that provides virtual experimental research environment and data sharing infrastructure over KREONET/GLORIAD. Additionally, we describe some RealLab use cases for showing the swift creation of experimental environment and explain how massive experimental data can be transferred and shared among the community members.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.2952-2971
• /
• 2016

Outsourcing jobs to a public cloud is a cost-effective way to address the problem of satisfying the peak resource demand when the local cloud has insufficient resources. In this paper, we studied the management of deadline-constrained bag-of-tasks jobs on hybrid clouds. We presented a binary nonlinear programming (BNP) problem to model the hybrid cloud management which minimizes rent cost from the public cloud while completes the jobs within their respective deadlines. To solve this BNP problem in polynomial time, we proposed a heuristic algorithm. The main idea is assigning the task closest to its deadline to current core until the core cannot finish any task within its deadline. When there is no available core, the algorithm adds an available physical machine (PM) with most capacity or rents a new virtual machine (VM) with highest cost-performance ratio. As there may be a workload imbalance between/among cores on a PM/VM after task assigning, we propose a task reassigning algorithm to balance them. Extensive experimental results show that our heuristic algorithm saves 16.2%-76% rent cost and improves 47.3%-182.8% resource utilizations satisfying deadline constraints, compared with first fit decreasing algorithm, and that our task reassigning algorithm improves the makespan of tasks up to 47.6%.