• Journal of KIISE:Software and Applications
• /
• v.37 no.1
• /
• pp.19-28
• /
• 2010

Recently, various home appliances are inter connected in wired/wireless network to provide a single service, but their interfaces are not uniformly integrated. In order to get a service in such an environment, users have to figure out how to control each appliance and the way of combining its functions with others. Even worse to the users, many buttons are barely used to control the complicated functions of the appliances on the remote controllers, and controllers have very similar shapes in each other. In this paper, based on the definitions of a task as a unit of services provided in the environment of multi-connected appliances, we propose a markup language for home appliances, called HAML (Home Appliance Markup Language), for generating task-based user interfaces to help controlling multi-connected appliances as one pleases. The proposed method generates interfaces by gathering the buttons frequently used and necessary for tasks, and provides automatic settings of multi-connected appliances. The proposed method is verified with an analysis of scenarios and usability tests.

• Journal of KIISE:Software and Applications
• /
• v.32 no.8
• /
• pp.717-729
• /
• 2005

Product Line Engineering (PLE) consists of two phases; Core Assets Development and Application Engineering. The core asset development is to model common features of members in a domain and to develop them. The application engineering is to effectively generate an application by instantiating the core asset. Today, PLE research mainly focuses on developing core assets, whereas activities and instructions for application engineering are weakly defined. Moreover, instructions of application engineering are not enough to be practically applied. To widely apply PLE to industry, researches on systematic and practical methods such as instantiation processes, instructions, and artifacts are needed. In this paper, we propose a practical PLE process, instructions, and artifacts about each activity. And then, we also present a case study to show applicability and practicality of the process proposed in this paper.

• Journal of KIISE:Software and Applications
• /
• v.30 no.7_8
• /
• pp.610-617
• /
• 2003

Similarity matching in video database is of growing importance in many new applications such as video clustering and digital video libraries. In order to provide efficient access to relevant data in large databases, there have been many research efforts in video indexing with diverse spatial and temporal features. however, most of the previous works relied on sequential matching methods or memory-based inverted file techniques, thus making them unsuitable for a large volume of video databases. In order to resolve this problem, this paper proposes an effective and scalable indexing technique using a trie, originally proposed for string matching, as an index structure. For building an index, we convert each frame into a symbol sequence using a window order heuristic and build a disk-resident trie from a set of symbol sequences. For query processing, we perform a depth-first search on the trie and execute a temporal segmentation. To verify the superiority of our approach, we perform several experiments with real and synthetic data sets. The results reveal that our approach consistently outperforms the sequential scan method, and the performance gain is maintained even with a large volume of video databases.

• Journal of KIISE:Software and Applications
• /
• v.30 no.7_8
• /
• pp.642-648
• /
• 2003

In this paper, we are interested in checking equivalence of FSMs(finite state machines). Two FSMs are equivalent if and only if their responses are always equal with each other with respect to the same external stimuli. Equivalence checking FSMs makes complicated FSM be substituted for simpler one, if they are equivalent. We can also determine the system satisfies the requirements, if they are all written in FSMs. In this paper, we regard equivalence checking problem as model checking one. For doing so, we construct the product model $M ={M_A} {\beta}{M_B} from two FSMs ${M_A} and {M_B}$. And we also get the temporal logic formula ${\Phi}$ from the equivalence checking definition. Then, we can check with model checker whether if satisfies ${\Phi}$, written $M= {.\Phi}$. Two FSMs are equivalent, if $M= {.\Phi}$ Otherwise, it is not equivalent. In that case, model checker generates counterexamples which explain why FSMs are not equivalent. In summary, we solve the equivalence checking problem with model checking techniques. As a result of applying to several examples, we have many satisfiable results.

• Journal of KIISE:Software and Applications
• /
• v.33 no.4
• /
• pp.378-387
• /
• 2006

A programming model for ubiquitous sensor network (USN) applications based on Nano-Qplus is proposed. USN applications mean programs of nodes which are components of sensor network such as sensor, router, sink and actuator. Developers can automatically generate programs of USN applications by setting attributes values of nodes using a script after they model a sensor network. A script for setting attributes values of a node is proposed in this paper. The algorithm of automatic code generation is also described. Developers can easily implement USN applications even if they do not know details of low-level communication, data sharing, and collective operations because the applications are automatically generated from a script. They set only attributes values of nodes using the script. Efforts for USN applications development also are reduced because of automatic code generation. Furthermore, developers can correct errors of applications in the early stage of development through ear]y test based on rapid code generation.

• Journal of KIISE:Software and Applications
• /
• v.30 no.7_8
• /
• pp.649-658
• /
• 2003

We propose a hierarchical architecture of ART2 Network for performance improvement and fast pattern classification model using fitness selection. This hierarchical network creates coarse clusters as first ART2 network layer by unsupervised learning, then creates fine clusters of the each first layer as second network layer by supervised learning. First, it compares input pattern with each clusters of first layer and select candidate clusters by fitness measure. We design a optimized fitness function for pruning clusters by measuring relative distance ratio between a input pattern and clusters. This makes it possible to improve speed and accuracy. Next, it compares input pattern with each clusters connected with selected clusters and finds winner cluster. Finally it classifies the pattern by a label of the winner cluster. Results of our experiments show that the proposed method is more accurate and fast than other approaches.

• Journal of Korea Multimedia Society
• /
• v.14 no.10
• /
• pp.1335-1347
• /
• 2011

The dissemination and use of mobile applications have been rapidly expanding these days. And in such a situation, the security of mobile applications has emerged as a new issue. Although the safety of general software such as desktop and enterprise software is systematically achieved from the development phase to the verification phase through secure coding, there have been not sufficient studies on the safety of mobile applications yet. This paper deals with deriving weakness enumeration specialized in mobile applications and implementing a tool that can automatically analyze the derived weakness. Deriving the weakness enumeration can be achieved based on CWE(Common Weakness Enumeration) and CERT(Computer Emergency Response Team) relating to the event-driven method that is generally used in developing mobile applications. The analysis tool uses the dynamic tests to check whether there are specified vulnerabilities in the source code of mobile applications. Moreover, the derived vulnerability could be used as a guidebook for programmers to develop mobile applications.

• Journal of Advanced Navigation Technology
• /
• v.21 no.6
• /
• pp.529-536
• /
• 2017

The general ground control system has control and information display functions for the operation of a single unmanned aerial vehicle. Recently, the function of the single ground control system extends to the operation of multiple UAVs. As a result, operators have been exposed to more diverse tasks and are subject to task overload due to various factors during their mission. This study proposes an adaptive ground control system that reflects the operator's condition through the task overload measurement of multiple UAV operators. For this, the ground control software is developed to control multiple UAVs at the same time, and the simulator with six degree-of-freedom aircraft dynamics is constructed for realistic human-machine-interface experiments by the operators.

• Journal of Navigation and Port Research
• /
• v.36 no.10
• /
• pp.833-838
• /
• 2012

TDOA which is one of the position estimation methods is used on indoor positioning, jammer localization, rescue of life, etc. due to high accuracy and simple structure. This paper proposes the super-resolution TDOA estimator using MPM(Matrix Pencil Method). The proposed estimator has more accuracy and is applicable to narrowband signal compared with the conventional cross-correlation. Furthermore, its complexity is low because obtained data directly is used for construction of matrix unlike the MUSIC(Multiple Signal Classification) which is one of the well-known super-resolution estimator using covariance matrix. To validate the performance of proposed estimator, errors of estimation and computational burden is compared to MUSIC through software simulation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.3
• /
• pp.594-600
• /
• 2017

This paper proposes a global search based motion estimation algorithm for high performance HEVC encoder and its hardware architecture. To eliminate temporal redundancy, motion estimation in HEVC inter-view prediction uses global search and fast search algorithm to search for a predicted block having a high correlation with the current PU in an interpolated reference picture. The global search method predicts the motion of all candidate blocks in a given search area, thus ensuring optimal results, but has a disadvantage of large computation time. Therefore we propose a new algorithm that reduces computational complexity by reusing SAD operation in global search to reduce computation time of inter prediction. As a result of applying the proposed algorithm to standard software HM16.12, the computation time was reduced by 61%, BDBitrate by 11.81%, and BDPSNR by about 0.5% compared with the existing search algorithm. As a result of hardware design, the maximum operating frequency is 255 MHz and the total number of gates is 65.1K.