• Title/Summary/Keyword: Graph Model Structure

Search Result 142, Processing Time 0.032 seconds

Analysis of Guidance Laws for Impact Angle Control Mission of Cooperative Missiles Based on Communication Structure (협업 유도탄 간 상대 충돌 각 제어 임무에서 통신 구조에 따른 유도기법의 영향 분석)

  • Hyosang Ko;Danil Lee;Myunghwa Lee;Hanlim Choi
    • Journal of Aerospace System Engineering
    • /
    • v.18 no.2
    • /
    • pp.1-11
    • /
    • 2024
  • This paper applies a relative impact angle control guidance law to a communication-based multi-missile network system with uncertainties and disturbances. The multi-missile network system is represented as a transitive reduction directed acyclic graph. Furthermore, this paper introduces both centralized and decentralized guidance laws based on the graph's structure. The relationship between these guidance laws is analyzed by comparing them based on the communication structure and the presence of system noise. To analyze the effects of decentralized optimal cooperative guidance law, this paper assumes uncertainty in missile dynamics and predicted impact point information for the relative impact angle control mission. Monte Carlo simulations are conducted for various mission environments to analyze the impact of communication and its structure on the system.

A study on computer-aided synthesis of process control system structure (전산기를 이용한 공정 제어구조 합성에 관한 연구)

  • Lo, Kyun;Yoon, En-Sup
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1987.10b
    • /
    • pp.670-673
    • /
    • 1987
  • The structure of chemical process has become increasingly complex, due to better management of energy and raw materials. As a consequence, the design of control systems for complete plants now constitutes the focal point of engineering interest, rather than controller designs for single processing units. Instead of traditional methods based on complex mathematical model, chemical processes are represented by structural array and cause-and-effect graph to apply non-numerical problem-solving techniques. A systematic logical procedure to synthesize alternatives of control system structure and some heuristic rules to select a feasible solution from the vast number of alternatives that are possible are considered in this study.

  • PDF

A Beta-distributed Timed Petri Net Model for Specification, Analysis and Playout Control of Multimedia Titles (멀티미디어 응용의 명세, 분석 및 재생제어를 위한 베타분포형 시간 패트리넷 모형)

  • 이진석;이강수
    • Journal of Korea Multimedia Society
    • /
    • v.2 no.2
    • /
    • pp.200-216
    • /
    • 1999
  • In this paper, we propose a BTPN (Beta-distributed Timed Petri Net) model which is not only an effective multimedia synchronization and authoring specification model, but also a direct control model for playout of a title. Methods of specification of relationships among all media objects in a title by using the BTPN structure and language, as well as methods of analysis of the BTPN by means of a Remaining Timed Reachability Graph and Timing diagram, are proposed. A concept of critical object path, coming from PERT/CPM, is useful for modeling the uncertainty of playout of a multimedia title and editing of title.

  • PDF

Traveltime estimation of first arrivals and later phases using the modified graph method for a crustal structure analysis (지각구조 해석을 위한 수정 그래프법을 이용한 초동 및 후기 시간대 위상의 주시 추정)

  • Kubota, Ryuji;Nishiyama, Eiichiro;Murase, Kei;Kasahara, Junzo
    • Geophysics and Geophysical Exploration
    • /
    • v.12 no.1
    • /
    • pp.105-113
    • /
    • 2009
  • The interpretation of observed waveform characteristics identified in refraction and wide-angle reflection data increases confidence in the crustal structure model obtained. When calculating traveltimes and raypaths, wavefront methods on a regular grid based on graph theory are robust even with complicated structures, but basically compute only first arrivals. In this paper, we develop new algorithms to compute traveltimes and raypaths not only for first arrivals, but also for fast and later reflection arrivals, later refraction arrivals, and converted waves between P and S, using the modified wavefront method based on slowness network nodes mapped on a multi-layer model. Using the new algorithm, we can interpret reflected arrivals, Pg-later arrivals, strong arrivals appearing behind Pn, triplicated Moho reflected arrivals (PmP) to obtain the shape of the Moho, and phases involving conversion between P and S. Using two models of an ocean-continent transition zone and an oceanic ridge or seamount, we show the usefulness of this algorithm, which is confirmed by synthetic seismograms using the 2D Finite Difference Method (2D-FDM). Characteristics of arrivals and raypaths of the two models differ from each other in that using only first-arrival traveltime data for crustal structure analysis involves risk of erroneous interpretation in the ocean-continent transition zone, or the region around a ridge or seamount.

Analysis on the characteristics for upper bound of [1,2]-domination in trees (트리의 [1,2]-지배 수 상계에 대한 특성 분석)

  • Lee, Hoon;Sohn, Moo Young
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.12
    • /
    • pp.2243-2251
    • /
    • 2016
  • In this paper, we propose a theoretical model for characterization and upper bounds of [1,2]-domination set of network which has tree structure. In detail, we propose a theoretic model for upper bounds on [1,2]-domination set of a tree network which has some typical constrains. To that purpose, we introduce a graph theory to model and analyze the characteristics of tree structure networks. We assume a node subset D of a graph G=(V,E). We define that D is a [1,2]-dominant set if for any node v in set V which is not an element of a set D is adjacent to a node or two nodes of an element in a set D (that is, $1{\leq}{\mid}N({\upsilon}){\bigcap}D{\mid}{\leq}2$ for every node $v{\in}V-D$). The minimum cardinality of a [1,2]-dominating set of G, which is denoted by ${\gamma}_{[1,2]}(G)$, is called the [1,2]-domination number of G. In this paper, we show new upper bounds and characteristics about the [1,2]-domination number of tree.

A Study on the Deduction of 3-Dimmensional Visual Structure and measurement of Quantitative Openness in Accordance with Spatial Probe Routes (공간탐색경로에 따른 3차원 시각구조 도출과 정량적 개방도 측정에 관한 연구)

  • Kim, Suk-Tae
    • Korean Institute of Interior Design Journal
    • /
    • v.19 no.6
    • /
    • pp.112-120
    • /
    • 2010
  • Human can recognize the environment by detecting spatial perception, and most of environmental perception depends on visual perception. In view that the acquisition of spatial information is accomplished through visual recognition, analysis of visual structure contained in the space is thought to be very important sector in studying the characteristic of the space. The history of studies on visual structure of space, however, wasn't too long, and furthermore most of the theories up to now focused on static and planar principles. Under this circumstance, this study is intended to suggest new theory by combining Isovist theory and VGA theory that have been actively discussed as the theory on visual perception-based spatial structure and supplementing them between each other to expand into 3-dimensional model. The suggested theory is a complex principle in dimensional and dynamic form in consideration of visual direction, which forms 3-dimentional virtual model that enables visualization of the property of spatial structure as the routine discriminating whether visual connection is made between viewing point and target point, and the target point is included in the visual field quadrangular pyramid or not. Such model was built up by an analysis application where four probe paths were applied to simulate the visual structure that occurs in virtual space, and then the characteristics were analyzed through quantification. In result, in spite of the path with equal space and equal length, significant difference in the acquired quantity of spatial information could be found depending on the probe sequence. On the contrary, it was found that probe direction may not affect the acquired quantity of information and visual property of the space.

A Conceptual Modeling Tools for the Model Base Design (모델베이스 설계를 위한 개념적 모델링 도구에 관한 연구)

  • 정대율
    • The Journal of Information Systems
    • /
    • v.7 no.1
    • /
    • pp.181-208
    • /
    • 1998
  • In many literatures of model management, various schemes for representing model base schema have proposed. Ultimately, the goal is to arrive at a set of mutually supportive and synergistic methodologies and tools for the modeling problem domain and model base design. This paper focus on how best to structure and represent conceptual model of problem domain and schema of model base. Semantic concepts and modeling constructs are valuable conceptual tools for understanding the structural relationships and constraints involved in an model management environment. To this end, we reviewed the model management literature, and analyzed the constructs of modeling tools of data model management graph-based approach. Although they have good tools but most of them are not enough for the representation of structural relationships and constraints. So we wanted more powerful tools which can represent diverse constructs in a decision support modeling and model base schema design. For the design of a model base, we developed object modeling framework which uses Object Modeling Techniques (OMT). In Object Modeling Framework, model base schema are classified into conceptual schema, logical schema, and physical schema. The conceptual schema represents the user's view of problem domain, and the logical schema represents a model formatted by a particular modeling language. The schema design, this paper proposes an extension of Object Model to overcome some of the limitations exhibited by the OMT. The proposed tool, Extended Object Model(EOM) have diverse constructs for the representation of decision support problem domain and conceptual model base schema.

  • PDF

A Study on Character Recognition using HMM and the Mason's Theorem

  • Lee Sang-kyu;Hur Jung-youn
    • Proceedings of the IEEK Conference
    • /
    • summer
    • /
    • pp.259-262
    • /
    • 2004
  • In most of the character recognition systems, the method of template matching or statistical method using hidden Markov model is used to extract and recognize feature shapes. In this paper, we used modified chain-code which has 8-directions but 4-codes, and made the chain-code of hand-written character, after that, converted it into transition chain-code by applying to HMM(Hidden Markov Model). The transition chain code by HMM is analyzed as signal flow graph by Mason's theory which is generally used to calculate forward gain at automatic control system. If the specific forward gain and feedback gain is properly set, the forward gain of transition chain-code using Mason's theory can be distinguished depending on each object for recognition. This data of the gain is reorganized as tree structure, hence making it possible to distinguish different hand-written characters. With this method, $91\%$ recognition rate was acquired.

  • PDF

The MAPN Modeling for the distributed Data Allocation based on Multiple Aspects (다중 측면 기반의 분산 데이터 할당을 위한 MAPN 모델링)

  • Park, Seong-Jin
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.3
    • /
    • pp.745-755
    • /
    • 2000
  • In designing distributed databases, DAP(Data Allocation Problem) is one of the key design issues. Because, however, most of previous researches on DAP have considered only cost aspect, they cannot increase the performance and availability and they are not proper to the system requiring high-availability or real-time processing. Therefore, we need a more formal data allocation model considering multiple aspects. In this paper, we propose the MAPN (Multiple Aspects Petri Net) modeling method for the distributed transaction modeling. The MAPN model, an extended classical petri net, is proposed for the formal modeling considering multiple aspects (cost, performance and availability) concurrently. We demonstrate that we can compose the valid DAP evaluation model considering not only cost but also performance and availability concurrently by using the MAPN structure and MAPN graph.

  • PDF

Keyword Network Visualization for Text Summarization and Comparative Analysis (문서 요약 및 비교분석을 위한 주제어 네트워크 가시화)

  • Kim, Kyeong-rim;Lee, Da-yeong;Cho, Hwan-Gue
    • Journal of KIISE
    • /
    • v.44 no.2
    • /
    • pp.139-147
    • /
    • 2017
  • Most of the information prevailing in the Internet space consists of textual information. So one of the main topics regarding the huge document analyses that are required in the "big data" era is the development of an automated understanding system for textual data; accordingly, the automation of the keyword extraction for text summarization and abstraction is a typical research problem. But the simple listing of a few keywords is insufficient to reveal the complex semantic structures of the general texts. In this paper, a text-visualization method that constructs a graph by computing the related degrees from the selected keywords of the target text is developed; therefore, two construction models that provide the edge relation are proposed for the computing of the relation degree among keywords, as follows: influence-interval model and word- distance model. The finally visualized graph from the keyword-derived edge relation is more flexible and useful for the display of the meaning structure of the target text; furthermore, this abstract graph enables a fast and easy understanding of the target text. The authors' experiment showed that the proposed abstract-graph model is superior to the keyword list for the attainment of a semantic and comparitive understanding of text.