• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.386-386
• /
• 2000

Cell mapping is a powerful computational technique for analyzing the global behavior of nonlinear dynamic systems. It simplifies the task of analyzing a continuous phase space by partitioning it into a finite number of disjoint cells and approximating system trajectories as cell transitions. A cell map for the system is then constructed based on the allowable control actions. Next search algorithms are employed to identify the optimal or near-optimal sequence(s) of control actions required to drive the system from each cell to the target cell by an "unravelling algorithm." Errors resulting from the cell center-point approximation could be reduced and eliminated by fuzzifying the bonders of cells. The dynamic system control method based on the cell mapping has been demonstrated for a motor control problem.l problem.

• Proceedings of the KIPE Conference
• /
• 2018.07a
• /
• pp.126-128
• /
• 2018

Solar array simulator (SAS) is a special DC power supply that regulates the output voltage or current to emulate characteristics of photovoltaic (PV) panels. Especially, the control of SAS is a challenging task due to the nonlinearity in the output curve, which is dependent on irradiance as well as temperature and is determined by panel materials. Conventionally, both current-mode control and voltage-mode control should be alternated by partitioning the operating curve into multiple sections, which is not only for the measurement noise problem with the feedback sensing but also for the control stability issue near the maximum power point. However, the occurrence of transition among different controllers may deteriorate the overall performance. To eliminate the mode transitions, a novel single controller scheme has been introduced in this paper, where the reference operating projection technique enables simple, smooth and numerically stable control. Theoretical consideration on the loop stability issue is discussed and the performance is verified experimentally for the emulation of a PV panel data in view of stability and response speed.

• Journal of the Semiconductor & Display Technology
• /
• v.19 no.2
• /
• pp.88-91
• /
• 2020

Image segmentation is the task of partitioning an image into multiple sets of pixels based on some characteristics. The objective is to simplify the image into a representation that is more meaningful and easier to analyze. In this paper, we apply deep-learning to pre-train the learning model, and implement an algorithm that performs image segmentation in real time by extracting frames for the stream input from the Android device. Based on the open source of DeepLab-v3+ implemented in Tensorflow, some convolution filters are modified to improve real-time operation on the Android platform.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.04a
• /
• pp.278-279
• /
• 2014

모바일 시스템은 제한된 하드웨어 리소스로만 구성된다. 예를 들면, 배터리 용량, 네트워크 대역폭, 저장 용량, 프로세서 성능 등이 그것이다. 이러한 제한된 리소스는 클라우드 서버로의 작업분할을 통하여 경감될 수 있다. 계산량이 많은 부분을 리소스가 풍부한 서버에 전송하고, 서버로부터 결과만을 받아 사용함으로써 리소스의 제약에서 벗어날 수 있다. 작업분할 기술들과 관련하여 많은 연구들이 지난 십 여년 간 진행되었다. 본 연구에서는 이와 관련된 기본적인 논의들을 살펴보도록 하겠다.

• Journal of Korea Multimedia Society
• /
• v.22 no.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.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.05a
• /
• pp.472-473
• /
• 2013

The growth in number and efficiency of smart devices such as GPS enabled smart phones and PDAs present an unparalleled opportunity for diverse areas of life. However extraction of GPS traces for provision of services demand a huge storage space as well as computation overhead. This is a challenging task especially for the applications which provide runtime services. In this paper we provide a simplified model to extract GPS traces of moving objects at runtime. Road segment partitioning and measure of deviation in angle of trajectory path is incorporated to identify the significant data points. The number of these data points is minimized by our proposed approach in an efficient manner to overwhelm the storage and computation overhead. Further, the competent reconstruction of complete itinerary based on gathered data, is also ensured by proposed method.

• International Journal of Computer Science & Network Security
• /
• v.23 no.6
• /
• pp.84-90
• /
• 2023

In this article the problem of computing floating-point reciprocal cube root functions is considered. Our new algorithms for this task decrease the number of arithmetic operations used for computing $1/{\sqrt[3]{x}}$. A new approach for selection of magic constants is presented in order to minimize the computation time for reciprocal cube roots of arguments with movable decimal point. The underlying theory enables partitioning of the base argument range x∈[1,8) into 3 segments, what in turn increases accuracy of initial function approximation and decreases the number of iterations to one. Three best algorithms were implemented and carefully tested on 32-bit microcontroller with ARM core. Their custom C implementations were favourable compared with the algorithm based on cbrtf(x) function taken from C ＜math.h＞ library on three different hardware platforms. As a result, the new fast approximation algorithm for the function $1/{\sqrt[3]{x}}$ was determined that outperforms all other algorithms in terms of computation time and cycle count.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2021.11a
• /
• pp.100-103
• /
• 2021

5G 의 발전과 함께 차량과 IT 통신 기술을 융합한 어플리케이션들이 급증하면서 멀티 액세스 엣지 컴퓨팅(MEC)이 차세대 기술로 등장했다. 낮은 지연시간 안에 계산 집약적인 서비스들을 제공하기 위해 단독적인 MECS 서버(MECS)에서의 수행이 아닌 다수의 MECS 에서 동시에 연산을 수행할 수 있도록 태스크를 파티셔닝하는 기법이 주목받고 있다. 특히 차량이 다수의 MECS 로 태스크를 파티셔닝하여 오프로딩하는 기법과 하나의 MECS 로 오프로딩한 후 다른 MECS 들로 파티셔닝하여 마이그레이션하는 기법들이 연구되고 있다. 본 논문에서는 오프로딩과 마이그레이션을 이용한 파티셔닝 기법들을 서비스 지연시간과 차량의 에너지 소비량 측면에서 성능을 비교 분석을 하였다.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.3
• /
• pp.77-85
• /
• 2009

Execution times of tasks can be variable depend on input data. If we choose a high performance processor to satisfy the worst case execution times, the hard cost becomes high and the energy consumption also becomes large. To apply a lower performance processor, we have to utilize processor capacity maximally while overrunning tasks can not affect deadlines of other tasks. To be used for such systems, this paper presents SBP (Shared Bandwidth Partitioning) that a processor bandwidth is reserved and shared among all tasks. If a task needs more processor capacity, it can use a portion of the shared bandwidth. A simulation result shows that SBP provides better performance than previous algorithms. SBP reduces deadline miss ratio which is related to scheduling quality. And the number of context switches, which is related to system overhead, is also reduced.

• Journal of Internet Computing and Services
• /
• v.1 no.2
• /
• pp.69-88
• /
• 2000

One of the most important factors on the performance of the distributed systems is the effective distribution of the software components, There have been a lot of researches on partitioning and allocating the task-based system, while the studies on the allocating the objects of the object-oriented system into the distributed object environments are very little relatively. In this paper. we defines the graph model for partitioning the existing C++ application and allocating the C++ objects into CORBA-base distributed system, In addition, we propose a distributed object allocation algorithm based on this graph model. The performance of distributed systems is determined by the concurrency between objects, the load balance among the processors and the communication cost on the networks. To search for the solutions optimizing the above three factors simultaneously, the object allocation algorithm of this paper is based on the Niched Pareto Genetic Algorithm (NPGA). We performed the experiment on the typical C++ application and CORBA system to prove the effectiveness of our graph model and our object allocation algorithm.