• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2007.06a
• /
• pp.315-316
• /
• 2007

• The KIPS Transactions:PartD
• /
• v.15D no.5
• /
• pp.691-698
• /
• 2008

Web designers generally use a story board, a site map, a flow chart or the combination of these for representing web sites. But these methods are difficult to represent the entire architecture of a web site, and may be not adaptive for describing the detail flow of web pages. To solve these problems to some degree, there were works using EMFG(Extended Mark Flow Graph) recently. However the conventional EMFG representation method is not adaptive to represent the dynamic interface of web sites because that cover only the static parts of a web site. Internet utilization is rapidly growing in our life and we cannot imagine the worlds of work, study and business without internet. And web sites recently have not only more complex and various architecture but also web pages containing the dynamic interface. Therefore we propose the representation method of these web sites - for example, a web site containing varying pages with time and varying page status or contents with mouse operations - using EMFG. We expect our work to be help the design and maintenance of web sites.

• The Journal of Korea Robotics Society
• /
• v.12 no.3
• /
• pp.339-349
• /
• 2017

In this paper, we present a finite-time sliding mode control (FSMC) with an integral finite-time sliding surface for applying the concept of graph theory to a distributed wheeled mobile robot (WMR) system. The kinematic and dynamic property of the WMR system are considered simultaneously to design a finite-time sliding mode controller. Next, consensus and formation control laws for distributed WMR systems are derived by using the graph theory. The kinematic and dynamic controllers are applied simultaneously to compensate the dynamic effect of the WMR system. Compared to the conventional sliding mode control (SMC), fast convergence is assured and the finite-time performance index is derived using extended Lyapunov function with adaptive law to describe the uncertainty. Numerical simulation results of formation control for WMR systems shows the efficacy of the proposed controller.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.4
• /
• pp.1535-1554
• /
• 2016

This paper proposes a novel channel assignment scheme called multi-cluster based dynamic channel assignment (MC-DCA) to improve system performance for the downlink of dense femtocell networks (DFNs) based on orthogonal frequency division multiple access (OFDMA) and frequency division duplexing (FDD). In order to dynamically assign channels for femtocell access points (FAPs), the MC-DCA scheme uses a heuristic method that consists of two steps: one is a multiple cluster assignment step to group FAPs using graph coloring algorithm with some extensions, while the other is a dynamic subchannel assignment step to allocate subchannels for maximizing the system capacity. Through simulations, we first find optimum parameters of the multiple FAP clustering to maximize the system capacity and then evaluate system performance in terms of the mean FAP capacity, unsatisfied femtocell user equipment (FUE) probability, and mean FAP power consumption for data transmission based on a given FUE traffic load. As a result, the MC-DCA scheme outperforms other schemes in two different DFN environments for commercial and office buildings.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2005.04a
• /
• pp.185-188
• /
• 2005

This paper suggests a control method for efficient topology/parameter evolution in a bond-graph-based GP design framework that automatically synthesizes designs for multi-domain, lumped parameter dynamic systems, We adopt a hierarchical breeding control mechanism with fitness-level-dependent differences to obtain better balancing of topology/parameter search - biased toward topological changes at low fitness levels, and toward parameter changes at high fitness levels. As a testbed for this approach, an eigenvalue assignment problem, which is to find bond graph models exhibiting minimal distance errors from target sets of eigenvalues, was tested and showed improved performance for various sets of eigenvalues.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2001.01a
• /
• pp.151-155
• /
• 2001

Mobile agent technology has been the subject of much attention in the last few years, mainly due to the proliferation of distributed software technologies combined with the distributed AI research field. In this paper, we present a design of communication networks of agents that cooperate with each other for forwarding messages to the specific mobile agent in order to make the overall system location transparent. In order to make the material accessible to general intelligent system researchers, we present the general ideas abstractly in terms of the graph theory. In particular, a proxy network is defined as a directed acyclic graph satisfying some structural conditions. In turns out that the definition ensures some kind of reliability of the network, in the sense that as long as at most one proxy agent is abnormal, there agent exists a communication path, from every proxy agent to the target agent, without passing through the abnormal proxy. As the basis for the implementation of this scheme, an appropriate initial proxy network is specified and the dynamic nature of the network is represented by a set of graph transformation rules. It is shown that those rules are sound, in the sense that all graphs created from the initial proxy network by zero or more applications of the rules are guaranteed to be proxy networks. Finally, we will discuss some implementation issues.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.926-937
• /
• 1996

A graph traversal technique is a certain pattern of visiting nodes of a graph. Many special traversal techniques have been applied to solve graph related problems. For example, the depth first search technique has been used for finding strongly onnected components of a directed graph or biconnected components of a general graph. The distributed protocol to implement his depth first search technique on the distributed network can be divided into a fixed topology problem where there is no topological change and a dynamic topology problem which has some topological changes. Therefore, in this paper, we present a more efficient distributed depth first search protocol with fixed topology and a resilient distributed depth first search protocol where there are topological changes for the distributed network. Also, we analysed the message and time complexity of the presented protocols and showed the improved results than the complexities of the other distributed depth first search protocols.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.10
• /
• pp.2567-2574
• /
• 1998

Many software engineering tools and techniques rely on fraphic representations of software, such as control flow graphs, program dependene graphs, or system dependence graphs. Existing graphic representations for object-oriented programs are compkicated, reduplicated. We thus propose a new graphic representation for object-oriented programs. Object-oriented Program Dependency Graph (OPDG). An OPDG consists of class dependence graph, class hierarchy graph and procedure dependence graph. Other features of OPDG are (1) the representation is compact; (2) the representation is easy to extend for the incremental development of a program; and (3) the repreesentation can be extended to provide dynamic information.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1993.10a
• /
• pp.118-118
• /
• 1993

We consider a discrete event dynamic system called periodic job shop, where an identical mixture of items called minimal part set(MPS) is repetitively produced in the same processing order and the primary performance measure is the cycle time. The precedence relationships among events(starts of operations) are represented by a directed graph with rocurront otructure. When each operation starts as soon as all its preceding operations complete(called earliest starting), the occurrences of events are modeled in a linear system using a special algebra called minimax algebra. By investigating the eigenvalues and the eigenvectors, we develop conditions on the directed graph for which a stable steady state or a finite eigenvector exists. We demonstrate that each finite eigenvector, characterized as a finite linear combination of a class of eigenvalue, is the minimum among all the feasible schedules and an identical schedule pattern repeats every MPS. We develop an efficient algorithm to find a schedule among such schedules that minimizes a secondary performance measure related to work-in-process inventory. As a by-product of the linear system approach, we also propose a way of characterizing stable steady states of a class of discrete event dynamic systems.

• Korean Journal of Computational Design and Engineering
• /
• v.14 no.2
• /
• pp.69-76
• /
• 2009

The development of a simulation system requires many sub modules such as a dynamic module, a visualization module, etc. If a different freeware is used for each sub modules, it is hard to develop the simulation system by incorporating them because they use their own data structures. To solve this problem, a high-level data structure, called Dynamics Scene Graph Data structure (DSGD) is proposed, by wrapping data structures of two freeware; an Open Dynamics Engine (ODE) for the dynamic module and an Open Scene Graph (OSG) for the visualization module. Finally, to evaluate the applicability of the proposed data structure, it is applied to the block erection simulation in shipbuilding. The result shows that it can be used for developing the simulation system.