• Title/Summary/Keyword: Behavior Graph

Search Result 168, Processing Time 0.023 seconds

Construction of Global State Transition Graph for Verifying Telecommunications Software Specifications written in Message Chart (MSC로 기술된 통신소프트웨어 명세의 검증을 위한 전체 상태 전이 그래프 생성)

  • Kim, Byeong-Man;Kim, Hyeon-Su;Sin, Yun-Sik
    • Journal of KIISE:Software and Applications
    • /
    • v.26 no.12
    • /
    • pp.1428-1444
    • /
    • 1999
  • MSC는 ITU에 의해 표준화된, 병행 시스템의 명세를 기술하기 위한 그래픽 형태와 텍스트 형태를 제공하는 언어로서 실시간 시스템 특히 통신 교환 시스템의 특성을 기술하기 위해 자주 사용된다. 통신 시스템이 제대로 동작함을 보이기 위해서는 정형적인 방법을 사용하여 시스템 행위를 검증할 필요가 있다. 통신 소프트웨어를 검증하는 방법 중 하나의 방법으로 유한 상태를 기반으로 하는 방법이 있다. 유한 상태를 기반으로 하는 방법에서는 먼저 시스템 명세에 해당하는 전체 상태 전이 그래프를 생성한 후 이를 바탕으로 model-checking 등의 방법을 사용하여 시스템의 특성을 검증한다. 본 논문에서는 MSC로 기술된 통신 소프트웨어 명세로부터 전체 상태 전이 그래프를 생성하는 방법에 초점을 맞추었다. 시스템 명세에 해당하는 상태 전이 그래프를 생성하기 위해 보다 직관적으로 MSC의 의미론을 표현할 수 있고, 또한 쉽게 전체 상태 전이 그래프를 생성할 수 있는 행위 종속 그래프를 제안하였다. MSC 명세는 일단 행위 종속 그래프로 변환이 되고 이 행위 종속 그래프를 이용하여 전체 상태 전이 그래프가 생성된다.Abstract Message Sequence Chart (MSC) standardized by International Telecommunication Union is a graphical and textual language for describing the specification of concurrent systems. It is frequently used both formally and informally for specifying the behavior of real-time systems, in particular telecommunication switching systems. To ensure that a communication system operates properly, the verification process showing the correctness of system's behavior formally is necessary. One of the verification methods is a finite-state method. In the finite-state method, the global state transition graph (GSTG) is constructed and then safety and liveness properties of systems are verified through a well-known method such as model checking. In this paper, we forcus on the construction of GSTG from the specifications of telecommunication software written in MSC. We suggest Action Dependency Graph (ADG) which can present the semantics of MSC intuitively and also provide a GSTG construction method from ADG. MSC specifications are translated to ADGs and, in turns, the GSTGs are constructed by using these ADGs.

FolkRank++: An Optimization of FolkRank Tag Recommendation Algorithm Integrating User and Item Information

  • Zhao, Jianli;Zhang, Qinzhi;Sun, Qiuxia;Huo, Huan;Xiao, Yu;Gong, Maoguo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.1
    • /
    • pp.1-19
    • /
    • 2021
  • The graph-based tag recommendation algorithm FolkRank can effectively utilize the relationships between three entities, namely users, items and tags, and achieve better tag recommendation performance. However, FolkRank does not consider the internal relationships of user-user, item-item and tag-tag. This leads to the failure of FolkRank to effectively map the tagging behavior which contains user neighbors and item neighbors to a tripartite graph. For item-item relationships, we can dig out items that are very similar to the target item, even though the target item may not have a strong connection to these similar items in the user-item-tag graph of FolkRank. Hence this paper proposes an improved FolkRank algorithm named FolkRank++, which fully considers the user-user and item-item internal relationships in tag recommendation by adding the correlation information between users or items. Based on the traditional FolkRank algorithm, an initial weight is also given to target user and target item's neighbors to supply the user-user and item-item relationships. The above work is mainly completed from two aspects: (1) Finding items similar to target item according to the attribute information, and obtaining similar users of the target user according to the history behavior of the user tagging items. (2) Calculating the weighted degree of items and users to evaluate their importance, then assigning initial weights to similar items and users. Experimental results show that this method has better recommendation performance.

Empirical approach to Cognitive Process for Problems of Marine Design (해양디자인 문제해결을 위한 인지적 프로세스에 관한 실증적 접근)

  • Kim, Kiesu
    • The Journal of the Korea Contents Association
    • /
    • v.12 no.12
    • /
    • pp.126-134
    • /
    • 2012
  • The researchers of this study closely looked into the methods for cognitive-scientific approach to problems of marine design at a time when the overall values of marine cultures are acknowledged in full scale. To that end, the researchers analyzed the problems and problem-solving process for the initial approach to marine design. At the same time, the researchers made the matrix of the design-developmental directions by cognitive scientific approach. After selecting the subjects, the researchers collected verbal protocol and behavior protocol which were shown in the process of a designer's thinking. This was for the sake of protocol analysis which is the representative research technique of cognitive science. Based on the collected data, the researchers empirically analyzed the behavior patterns shown in the marine design process so as to develop the design behavior-graph pattern of designers in an objective and systematic way. The behavior graph was helpful for looking into the initial developmental directions of design and for predicting cognitive structure of designers. The researchers hope that this study will become a fundamental material for predicting cognitive directions of designer for planning and designing the marine design.

Design and Implementation of Cattle Behavior Detection System based on Internet of Things (사물 인터넷 기반 소 행동 특성 관찰 시스템 설계 및 구현)

  • Lee, Ha-Woon
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.12 no.6
    • /
    • pp.1159-1166
    • /
    • 2017
  • Cattle behavior detection system based on Internet of Things is designed and implemented by using gyroscope and acceleration sensor, Arduino pro-mini and bluetooth module. The implemented system measures cattle's moving and the measured data are transmitted to smart phone by bluetooth module. They are displayed by 2-dimensional graph on the smart phone and the number of cattle's step are calculated from the graph. The detected and gathered data from the system are analyzed by the proposed algorithm to decide which cows are in the estrus or not, and the proposed system can be used to increase the success rate of artificial insemination in normal estrus by detecting cow's behaviors such as the number of steps and jumping. In this paper, the implemented cattle behavior detecting system are strapped on cattle's leg and it measures cattle behaviors for determining that a cattle is estrus or not by the proposed algorithm. In the future research, the system which lengthens communication distance and increases the number of cattle under the test will be considered and also the measured data will be database for cattle research.

An Analytical Synthesis Method of Dynamic Systems in Terms of Bond Graphs (본드선도를 이용한 동적시스템의 해석적 종합방법)

  • Park, Jeon-Su;Kim, Jong-Sik
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.20 no.11
    • /
    • pp.3507-3515
    • /
    • 1996
  • This paper presents an attempt to find the physical structure of dynamic systems which achieves the behavior of a given system function. The scheme pursued by the paper would be regarded as synthesizing dynamic systems, and a method to synthesize them analytically is proposed by means of bond graph prototypes. The method adopts several conceptsused to synthesize networks in the electrical field, but yet deconstrates its own strengths such as the freedom from assigning causality and determining junction types. Also, itis shown that this method has further advantages in reticulating a given specification into feedforward and feedback components relative to network synthesis and the method is examined though an example to trace the outline of the analytical synthesis of dynamic systems using bond graph prototypes.

PAIR DIFFERENCE CORDIALITY OF CERTAIN SUBDIVISION GRAPHS

  • R. PONRAJ;A. GAYATHRI;S. SOMASUNDARAM
    • Journal of applied mathematics & informatics
    • /
    • v.42 no.1
    • /
    • pp.1-14
    • /
    • 2024
  • Let G = (V, E) be a (p, q) graph. Define $$\begin{cases}\frac{p}{2},\:if\:p\:is\:even\\\frac{p-1}{2},\:if\:p\:is\:odd\end{cases}$$ and L = {±1, ±2, ±3, ···, ±ρ} called the set of labels. Consider a mapping f : V → L by assigning different labels in L to the different elements of V when p is even and different labels in L to p - 1 elements of V and repeating a label for the remaining one vertex when p is odd.The labeling as defined above is said to be a pair difference cordial labeling if for each edge uv of G there exists a labeling |f(u) - f(v)| such that |Δf1 - Δfc1| ≤ 1, where Δf1 and Δfc1 respectively denote the number of edges labeled with 1 and number of edges not labeled with 1. A graph G for which there exists a pair difference cordial labeling is called a pair difference cordial graph. In this paper we investigate the pair difference cordial labeling behavior of subdivision of some graphs.

Model Test for the Damage Assessment of Adjacent Frame Structures in Urban Excavation (지반 굴착에 따른 인접 프레임구조물의 손상평가에 관한 모형실험 연구)

  • Kim, Seong-Cheol;Hwang, Eui-Seok;Kim, Zu-Cheol;Kim, Hak-Moon
    • Proceedings of the Korean Geotechical Society Conference
    • /
    • 2005.03a
    • /
    • pp.1490-1495
    • /
    • 2005
  • In this study, Model test of concrete frame structures with various shapes and locations are carried out by means of applying Peck's(1969) settlement method. The results of the model test indicated that important correlations existed between the behavior of frame structure and ground movement. Also, the damage level of frame structure closely influenced by the phase of excavation. Therefore, prediction of damage level at early phase of construction should be very precise. The damage level graph by Cording et al.(2001), the angular distortion provided gradually more serious damage to frame structures for the all cases. But the damage level graph by Burland(1997), was difficult to confirm because of very small amount of deflection ratio.

  • PDF

physical structure of dynamic systems to implement a given system function (시스템함수를 실현하는 동적시스템의 물리구조에 관하여)

  • 박전수;김종식
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1996.04a
    • /
    • pp.294-298
    • /
    • 1996
  • This paper presents an attempt to find the physical structure of dynamic systems which achieves the behavior of a given system function. The scheme pursued by te paper would be regarded as synthesizing dynamic systems, and a method to synthesize them analytically is proposed by means of bond graph prototypes. The method proposed adopts several concepts used to synthesize networks in the electrical field, but yet demonstrates its own strengths such as the freedom from the causality assignment and determination of junction types. Also, it is shown that this method has further advantages in reticulating a given specification into feedforward and feedback expansions relative to electrical network synthesis and the method introduced by Redfield. The proposed method is examined through an example to trace the outline of the analytical synthesis of dynamic systems using bond graph prototypes.

  • PDF

Simulation of Electric Vehicles Combining Structural and Functional Approaches

  • Silva, L.I.;Magallan, G.A.;De La Barrera, P.M.;De Angelo, C.H.;Garcia, G.O.
    • Journal of Electrical Engineering and Technology
    • /
    • v.9 no.3
    • /
    • pp.848-858
    • /
    • 2014
  • In this paper the construction of a model that represents the behavior of an Electric Vehicle is described. Both the mechanical and the electric traction systems are represented using Multi-Bond Graph structural approach suited to model large scale physical systems. Then the model of the controllers, represented with a functional approach, is included giving rise to an integrated model which exploits the advantages of both approaches. Simulation and experimental results are aimed to illustrate the electromechanical interaction and to validate the proposal.

Movement Simulation on the Path Planned by a Generalized Visibility Graph (일반화 가시성그래프에 의해 계획된 경로이동 시뮬레이션)

  • Yu, Kyeon-Ah;Jeon, Hyun-Joo
    • Journal of the Korea Society for Simulation
    • /
    • v.16 no.1
    • /
    • pp.31-37
    • /
    • 2007
  • The importance of NPC's role in computer games is increasing. An NPC must perform its tasks by perceiving obstacles and other characters and by moving through them. It has been proposed to plan a natural-looking path against fixed obstacles by using a generalized visibility graph. In this paper we develop the execution module for an NPC to move efficiently along the path planned on the generalized visibility graph. The planned path consists of line segments and arc segments, so we define steering behaviors such as linear behaviors, circular behaviors, and an arriving behavior for NPC's movements to be realistic and utilize them during execution. The execution module also includes the collision detection capability to be able to detect dynamic obstacles and uses a decision tree to react differently according to the detected obstacles. The execution module is tested through the simulation based on the example scenario in which an NPC interferes the other moving NPC.

  • PDF