• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.636-638
• /
• 2010

Task scheduling is an integral part of parallel and distributed computing. Extensive research has been conducted in this area leading to significant theoretical and practical results. Stochastic reward nets (SRN) is an extension of stochastic Petri nets and provides compact modeling facilities for system analysis. In this paper, we address task scheduling model using extended timed marked graph, which is a special case of SRNs. And we analyze this model by giving reward measures in SRN.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.8
• /
• pp.317-326
• /
• 2013

In this paper, we present an effective method for comparing control flow graphs which represent static structures of binary programs. To compare control flow graphs, we measure similarities by comparing instructions and syntactic information contained in basic blocks. In addition, we also consider similarities of edges, which represent control flows between basic blocks, by edge extension. Based on the comparison results of basic blocks and edges, we match most similar basic blocks in two control flow graphs, and then calculate the similarity between control flow graphs. We evaluate the proposed edge extension method in real world Java programs with respect to structural similarities of their control flow graphs. To compare the performance of the proposed method, we also performed experiments with a previous structural comparison for control flow graphs. From the experimental results, the proposed method is evaluated to have enough distinction ability between control flow graphs which have different structural characteristics. Although the method takes more time than previous method, it is evaluated to be more resilient than previous method in comparing control flow graphs which have similar structural characteristics. Control flow graph can be effectively used in program analysis and understanding, and the proposed method is expected to be applied to various areas, such as code optimization, detection of similar code, and detection of code plagiarism.

• The KIPS Transactions:PartC
• /
• v.12C no.7 s.103
• /
• pp.949-958
• /
• 2005

In the paper we study key agreement schemes when a party needs to establish a session key with each of several parties, thus having multiple session keys. This situation can be represented by a graph, tailed a key graph, where a vertex represents a party and an edge represents a relation between two parties sharing a session key. graphs to establish all session keys corresponding to all edges in a key graph simultaneously in a single session. A key agreement protocol of a key graph is a natural extension of a two-party key agreement protocol. We propose a new key exchange model for key graphs which is an extension of a two-party key exchange model. using the so-called randomness re-use technique which re-uses random values to make session keys for different sessions, we suggest two efficient key agreement protocols for key graphs based on the decisional Diffie-Hellman assumption, and prove their securities in the key exchange model of key graphs. Our first scheme requires only a single round and provides key independence. Our second scheme requires two rounds and provides forward secrecy. Both are proven secure In the standard model. The suggested protocols are the first pairwise key agreement protocols and more efficient than a simple scheme which uses a two-party key exchange for each necessary key. Suppose that a user makes a session key with n other users, respectively. The simple scheme's computational cost and the length of the transmitted messages are increased by a factor of n. The suggested protocols's computational cost also depends on n, but the length of the transmitted messages are constant.

• Journal of Institute of Control, Robotics and Systems
• /
• v.20 no.12
• /
• pp.1252-1258
• /
• 2014

ROS is based on a graph architecture where processing takes place in nodes. Nodes communicate together by passing messages through topics based on the publish/subscribe model. On the other hand, OPRoS components know each other and are tightly-coupled via port connections, and different coupling schemes make the interoperation between two platforms difficult. This paper describes an extension of OPRoS framework to support the interoperation with the ROS topic.

• Journal of the Korean Mathematical Society
• /
• v.35 no.3
• /
• pp.765-782
• /
• 1998

The purpose of this paper is to give convergence theorems both for closed convex set valued and relative fuzzy valued martingales, and sub- and super- martingales. These kinds of martingales, sub- and super-martingales are the extension of classical real valued martingales, sub- and super-martingales. Here we compare two kinds of convergences, in the Hausdorff metric and in the Kuratowski-Mosco sense. We also introduce a new convergence for the fuzzy valued case in the graph sense and obtain convergence theorems.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.3
• /
• pp.589-602
• /
• 1999

There are some advantages of developing applications based on the object oriented concepts. One os them is that it is possible to reuse the existing designs and products. This paper provides a formal method for the reorganization of class hierarchies for the object extension in the object oriented design phase. In this paper, we introduce classes, and edges to represent the inheritance and aggregation relationship between classes. Based on the graph, we define an order relation(called the object extension) between class hierarchy graphs. And also we present a set of five basic transformations preserving the object extension relation. The set is proven to be correct and complete. The results of this paper help form a theoretical basis for the extension and reorganization object-oriented application systems.

• The KIPS Transactions:PartD
• /
• v.13D no.1 s.104
• /
• pp.117-124
• /
• 2006

Hardware and software codesign framework called PeaCE(Ptolemy extension as a Codesign Environment) was developed. It allows to express both data flow and control flow which is described as fFSM which extends traditional finite state machine. While the fFSM model provides lots of syntactic constructs for describing control flow, it has a lack of their formality and then difficulties in verifying the specification. In order to define the formal semantics of the fFSM, in this paper, firstly the hierarchical structure in the model is flattened and then the step semantics is defined. As a result, some important bugs such as race condition, ambiguous transition, and circulartransition can be formally detected in the model.

• Journal of KIISE:Software and Applications
• /
• v.31 no.12
• /
• pp.1611-1620
• /
• 2004

MPEG-4 supports dynamic scene composition through add/delete/replace of object or change of object's properties. Other existing MPEG-4 players focus on transmitting and playing the multimedia data according to MPEG-4 standard. It is insufficient for MPEG-4's characteristic such as playback of various objects and playback of dynamic scene composition. In this paper, we propose an effective scene compositor which is the core component of MPEG-4 player The scene compositor is an optimized processor that searches efficiently the scene graph, creates the data structure for independent management of object information and improves processing ability of user interaction. The scene compositor supports sufficiently scene description information, and is managed independently in player for component extension and application of mobile environment.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.1
• /
• pp.71-81
• /
• 2010

In a typical web environment, it is difficult to determine the update and re-computation status of WebView content or the transition of WebView processing included in web page. If an update to one of data is performed before a read operation to that, we could get a wrong result due to the incorrect operation and increase a complexity of the problem to process. To solve this problem, lots of researchers have studied and most of these problems at the single user environment is not problems. However, the problems at a distributed environment might be occurred. For this reason, in this paper, we proposed the extended state transition graph and algorithms for each status of WebView for explaining WebView state in the distributed environment and analyze the performance of using the materialized WebView and not. Additionally, also analyze the timing issues in network and effectiveness which follows in size of WebView contents.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.7 no.1
• /
• pp.84-93
• /
• 2004

Recently, domain-specific demands with respect to practical applications and analysis scheme using spatial thematic information are increasing. Accordingly, in this study, GIS-based application program is implemented to perform spatial analysis in transportation geography with base road layer data. Using this program, quantitative estimation of circuity and accessibility, which can be extracted from nodes composed of the graph-typed network structure, in a arbitrary analysis zone or administrative boundary zone is possible. Circuity is a concept to represent the difference extent between actual nodes and fully connected nodes in the analysis zone. While, accessibility can be used to find out extent of accessibility or connectivity between all nodes contained in the analysis zone, judging from inter-connecting status of the whole nodes. In put data of this program, which was implemented in AVX executable extension using AvenueTM of ArcView, is not transportation database information based on transportation data model, but layer data, directly obtaining from digital map sets. It is thought that computation of circuity and accessibility can be used as kinds of spatial analysis functions for GIS applications in the transportation field.