• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.502-507
• /
• 2009

We present a real-time photomosaics method for small image set optimized by feature selection method. Photomosaics is an image that is divided into cells (usually rectangular grids), each of which is replaced with another image of appropriate color, shape and texture pattern. This method needs large set of tile images which have various types of image pattern. But large amount of photo images requires high cost for pattern searching and large space for saving the images. These requirements can cause problems in the application to a real-time domain or mobile devices with limited resources. Our approach is a genetic feature selection method for building an optimized image set to accelerate pattern searching speed and minimize the memory cost.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.2
• /
• pp.9-16
• /
• 2018

Recently, as various IP set-top boxes based on Android OS have been widely used in general households and public facilities, complaints about services and set-top boxes have continued to increase as much as other smart devices. In order to reduce this problem, the manufacturer performs the testing work before the product is commercialized. However, the testing can reduce potential defects in the product, but it can not prove that the product is free of defects. Therefore, the quality of the product can vary depending on how effective testing techniques are introduced. In this paper, we propose a new exploratory testing method that minimizes test case creation time and makes it easier to plan and execute test while simultaneously learning how to run the product under test. Using the first proposed method, the test time is reduced by about 16.7 hours and the defect detection rate is 25.4% higher than the formal specification-based testing method. Informally, the test time was shortened by about 4.7 hours and the defect detection rate was 13% higher than the informal experience-based testing method.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.7
• /
• pp.923-932
• /
• 2001

In this paper, An imprecise real-time task sets composed of multimedia datas are generated using several parameters and an algorithm which can analyse schedulability of generated imprecise real-time task sets before execution of this task sets is proposed. Also, The schedulability of task set depends on variation of parameter values which were used during the generation of the task set is studied. As a result of experiment, It isproved that the schedulability of task set is more and more weak as large as execution requirement time of mandatory subtasks and, as many as the number of tasks which can be scheduled at some instant. The schedulabilty analysis algorithm which is presented on this paper is expected to use effectively on QoS service of multimedia datas.

• The Pure and Applied Mathematics
• /
• v.23 no.4
• /
• pp.339-345
• /
• 2016

The set of priors in the representation of Choquet expectation is expressed as the one of equivalent martingale measures under some conditions. We show that the set of priors, $\mathcal{Q}_c$ in (1.1) is the same set of $\mathcal{Q}^{\theta}$ in (1.3).

• Journal of Convergence for Information Technology
• /
• v.8 no.1
• /
• pp.173-177
• /
• 2018

This study compared the muscle on-set time of fully immersive virtual reality motions with that of actual motions to if there difference. The subjects were 30 healthy adults subjects and compared the virtual reality moction group(punch, archery) and actual motion group(punch, archery) muscle on-set time. In this study, there was no significant difference between the virtual reality motion group and actual motion group muscle on-set time(p>0.05). Fully immersive virtual reality is deemed to be applicable for use in physical therapy. In future studies, it is necessary to investigate whether a fully immersive virtual reality can be applied to patients.

• The KIPS Transactions:PartD
• /
• v.11D no.7 s.96
• /
• pp.1349-1356
• /
• 2004

The interest of version management is increasing in electronic commerce requiring data mining and documents processing system related to digital governmentapplications. In this paper, we define a change set that is to manage historicalinformation and to maintain XML documents during a long period of time and propose several storage policies of XML documents using a change set. A change set includes a change oper-ation set and temporal dimensions and a change operation set is composed with schema change operations and data change operations. We pro-pose three storage policies using a change set. Three storage policies are (1) storing all the change sets, (2) storing the change sets and the versions periodically. (3) storing the aggregation of change sets and the versions at a point of proper time. Also, we compare the performance between the existing storage policy and the proposed storage policies. Though the performance evaluation, we show that the method to store the aggregation of change sets and the versions at a point of proper time outperforms others.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.4
• /
• pp.1-12
• /
• 2003

In this study, a regime where independent treatment of SETs in transient simulations is valid has been identified quantitatively. It is found that as in the steady-state case, each SET can be treated independently even in the transient case when the interconnection capacitance is large enough. However, the value of the load capacitance $C_{L}$of the interconnections for the independent treatment of SETs is approximately 10 times larger than that of the steady state case. A compact SET transient model is developed for transient circuit simulation by SPICE. The developed model is based on a linearized equivalent circuit and the solution of master equation is done by the programming capabilities of the SmartSpice. Exact delineation of several simulation time scales and the physics-based compact model make it possible to accurately simulate hybrid circuits in the time scales down to several tens of pico seconds. The simulation time is also shown to depend on the complexity level of the transient model.l.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.1770-1773
• /
• 1997

In this paper, a linear discrete time system subject to the input saturatioin is shown to be exponentially stabilizable on any compact subset of the constrained asymptotically stabilizable set by a linear periodic variable structure controller. We also establish tat any neutrally stable system subject to the input saturation can be globally asymptotically stabilizable via linear feedback.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.2548-2551
• /
• 2005

In this paper, a robust receding horizon finite impulse response(FIR) filter is proposed for a class of linear discrete time systems with uncertainty satisfying an integral quadratic constraint. The robust state estimation problem involves constructing the set of all possible states at the current time consistent with given system input, output measurements and the integral quadratic constraint.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.20 no.2
• /
• pp.139-158
• /
• 1995

A temporal database systems provides timing information and maintains history of data compared to the conventional database system. In this paper, we present a temporal relational database which use an interval-stamping method for instant-based events and for interval-based states. A set of temporal algebraic operators are developed on an instance of time and interval of time so that we can manipulate events and states at a same time. The set of operation is the basis for creating a relational algebra that is closed for temporal relations. And temporal SQL is also suggested as a temporal query relational language for our algebraic operations on temporal relations.