Log in

Relevant bibliographies by topics / Graph-diagram / Journal articles

To see the other types of publications on this topic, follow the link: Graph-diagram.

Journal articles on the topic 'Graph-diagram'

Author: Grafiati

Published: 3 June 2025

Last updated: 19 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Graph-diagram.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Hammack, Richard H., and Paul C. Kainen. "Graph Bases and Diagram Commutativity." Graphs and Combinatorics 34, no. 4 (2018): 523–34. http://dx.doi.org/10.1007/s00373-018-1891-y.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Ibănescu, Radu, and Cătălin Ungureanu. "Lagrange's Equations versus Bond Graph Modeling Methodology by an Example of a Mechanical System." Applied Mechanics and Materials 809-810 (November 2015): 914–19. http://dx.doi.org/10.4028/www.scientific.net/amm.809-810.914.

Full text

Abstract:

The bond graph modeling method was discovered by Henry Painter in 1959 and has quickly become a wide spread method all over the modeling engineering world. The method is based on the analysis of power circulation in systems and has some indisputable advantages over other modeling methods, based in principle on mathematical aspects. The paper proposes a comparison between the bond graph method and Lagrange's equations method, by applying both methods to model a mechanical system. The bond graph model is a graphical model. There are three possibilities to exploit the bond-graph diagram. The first one consists in deducing a system of differential or algebraic-differential equations from the diagram. The second one consists in obtaining the block diagram model from the bond graph diagram, without additionally writing any equations, followed by the block diagram implementation in the appropriate software, which permits to perform simulations at once. The third one consists in implementing the bond graph diagram directly in the appropriate software, where simulations can immediately run. The advantages and the disadvantages of the methods are emphasized, but the decision about the most appropriate method is up to the modeler.

APA, Harvard, Vancouver, ISO, and other styles

3

Proctor, Robert A. "Two Amusing Dynkin Diagram Graph Classifications." American Mathematical Monthly 100, no. 10 (1993): 937. http://dx.doi.org/10.2307/2324217.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Göttler, Herbert. "Diagram editors = graphs + attributes + graph grammars." International Journal of Man-Machine Studies 37, no. 4 (1992): 481–502. http://dx.doi.org/10.1016/0020-7373(92)90006-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Erwig, Martin. "The graph Voronoi diagram with applications." Networks 36, no. 3 (2000): 156–63. http://dx.doi.org/10.1002/1097-0037(200010)36:3<156::aid-net2>3.0.co;2-l.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Ibănescu, Radu, and Mihaela Ibănescu. "A systematic procedure to obtain the block diagram model from the bond graph model." MATEC Web of Conferences 178 (2018): 05006. http://dx.doi.org/10.1051/matecconf/201817805006.

Full text

Abstract:

The bond-graph method for the analysis of systems dynamics is very widespread in engineering and, because of its simplicity and its advantages, it has been developed a lot in the last decades. The bond graph model is a diagram which describes the manner of transmitting and transforming the power in a system, starting from the source up to the final elements. One of the most preferred ways of using the bond-graph diagram is the construction of the block diagram, appropriate for an adequate soft, the most frequently used one being MATLAB-SIMULINK. The block diagram model has a wide range of application in the study of systems dynamics because of its great advantages in case of numerical simulations. The manner of obtaining the block diagram from the bond-graph diagram is left at researcher choice, because there are no clear and well-defined procedures. The work presents a systematic procedure which contains several well-defined steps that lead to an exact and unitary approach of this problem.

APA, Harvard, Vancouver, ISO, and other styles

7

MIYAZAWA, YASUYUKI. "A LINK INVARIANT DOMINATING THE HOMFLY AND THE KAUFFMAN POLYNOMIALS." Journal of Knot Theory and Its Ramifications 19, no. 11 (2010): 1507–33. http://dx.doi.org/10.1142/s0218216510008492.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Lechniak, Juliusz, and Krzysztof Kamiński. "Generating Interaction Curve Graph Based on the Rotation Angle of Strain Diagram, According to EN 1992." Applied Mechanics and Materials 797 (November 2015): 61–68. http://dx.doi.org/10.4028/www.scientific.net/amm.797.61.

Full text

Abstract:

The most comfortable way to present capacity is M-N interaction curve diagram (bending moment and longitudinal force). Graph of M-N most commonly appears as a function, where an axial force is the argument and the bending moment is the value. This work introduce a formation of the curve way, where the the rotation angle of the strain diagram is the argument, and the full strain diagram is the value. Using the complete state of the strain of the cross section, enables easy calculation the M-N forces using stress-strain diagram for a given material. Interaction graph is based on parabola-rectangle diagram for concrete and the graph with inclined top branch with strain limit for reinforcing steel. The method has no restrictions due to the concrete class.

APA, Harvard, Vancouver, ISO, and other styles

9

SAKAMOTO, MARISA, та KOUKI TANIYAMA. "PLANE CURVES IN AN IMMERSED GRAPH IN ℝ2". Journal of Knot Theory and Its Ramifications 22, № 02 (2013): 1350003. http://dx.doi.org/10.1142/s021821651350003x.

Full text

Abstract:

For any chord diagram on a circle there exists a complete graph on sufficiently many vertices such that any generic immersion of it to the plane contains a plane-closed curve whose chord diagram contains the given chord diagram as a sub-chord diagram. For any generic immersion of the complete graph on six vertices to the plane, the sum of averaged invariants of all Hamiltonian plane curves in it is congruent to one quarter modulo one-half.

APA, Harvard, Vancouver, ISO, and other styles

10

TRALDI, LORENZO, and LOUIS ZULLI. "A BRACKET POLYNOMIAL FOR GRAPHS, I." Journal of Knot Theory and Its Ramifications 18, no. 12 (2009): 1681–709. http://dx.doi.org/10.1142/s021821650900766x.

Full text

Abstract:

A knot diagram has an associated looped interlacement graph, obtained from the intersection graph of the Gauss diagram by attaching loops to the vertices that correspond to negative crossings. This construction suggests an extension of the Kauffman bracket to an invariant of looped graphs, and an extension of Reidemeister equivalence to an equivalence relation on looped graphs. The graph bracket polynomial can be defined recursively using the same pivot and local complementation operations used to define the interlace polynomial, and it gives rise to a graph Jones polynomial VG(t) that is invariant under the graph Reidemeister moves.

APA, Harvard, Vancouver, ISO, and other styles

11

Köth, Oliver, and Mark Minas. "Abstraction in Graph-Transformation Based Diagram Editors." Electronic Notes in Theoretical Computer Science 50, no. 3 (2001): 295–301. http://dx.doi.org/10.1016/s1571-0661(04)00182-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Kim, Jieon, Yewon Joung, and Sang Youl Lee. "On generating sets of Yoshikawa moves for marked graph diagrams of surface-links." Journal of Knot Theory and Its Ramifications 24, no. 04 (2015): 1550018. http://dx.doi.org/10.1142/s0218216515500182.

Full text

Abstract:

A marked graph diagram is a link diagram possibly with marked 4-valent vertices. S. J. Lomonaco, Jr. and K. Yoshikawa introduced a method of representing surface-links by marked graph diagrams. Specially, K. Yoshikawa suggested local moves on marked graph diagrams, nowadays called Yoshikawa moves. It is now known that two marked graph diagrams representing equivalent surface-links are related by a finite sequence of these Yoshikawa moves. In this paper, we provide some generating sets of Yoshikawa moves on marked graph diagrams representing unoriented surface-links, and also oriented surface-links. We also discuss independence of certain Yoshikawa moves from the other moves.

APA, Harvard, Vancouver, ISO, and other styles

13

Kundu, Debasish, Debasis Samanta, and Rajib Mall. "An Approach to Convert XMI Representation of UML 2.x Interaction Diagram into Control Flow Graph." ISRN Software Engineering 2012 (March 7, 2012): 1–22. http://dx.doi.org/10.5402/2012/265235.

Full text

Abstract:

For automation of many software engineering tasks such as program analysis, testing, and coverage analysis, it is necessary to construct a control flow graph. With the advancement of UML, software practitioners advocate to construct control flow graph from some of the UML design artifacts. UML 2.x supports the modeling of control flow information in interaction diagram by means of message sequences and different types of fragments like alt, opt, break, loop, and so forth. Leading UML modeling tools, namely MagicDraw, IBM's Rational, and so forth export models in XMI format. Construction of control flow graph from the XMI representation of an interaction diagram is not straightforward as model elements of interaction diagram are captured in XMI by means of values of attributes of multiple tagged elements and correlations among these tagged elements is not explicitly specified. This paper proposes an approach for construction of control flow graph from XMI representation of UML 2.x interaction diagram. A prototype tool based on our approach has been developed which can be plugged in any computer-aided software engineering tool.

APA, Harvard, Vancouver, ISO, and other styles

14

Kim, Jieon, Yewon Joung, and Sang Youl Lee. "On the Alexander biquandles of oriented surface-links via marked graph diagrams." Journal of Knot Theory and Its Ramifications 23, no. 07 (2014): 1460007. http://dx.doi.org/10.1142/s0218216514600074.

Full text

Abstract:

Carrell defined the fundamental biquandle of an oriented surface-link by a presentation obtained from its broken surface diagram, which is an invariant up to isomorphism of the fundamental biquandle. Ashihara gave a method to calculate the fundamental biquandle of an oriented surface-link from its marked graph diagram (ch-diagram). In this paper, we discuss the fundamental Alexander biquandles of oriented surface-links via marked graph diagrams, derived computable invariants and their applications to detect non-invertible oriented surface-links.

APA, Harvard, Vancouver, ISO, and other styles

15

Munawaroh, Hidayatul. "Pengukuran Keserupaan pada Communication Diagram menggunakan Metode Graph Edit Distance." Jurnal Teknologi Dan Sistem Informasi Bisnis 5, no. 4 (2023): 460–67. http://dx.doi.org/10.47233/jteksis.v5i4.900.

Full text

Abstract:

E-learning merupakan sistem pembelajaran elektronik yang dibuat sebagai media belajar sehingga penyampaian materi pembelajaran dan penilaian jawaban soal latihan maupun ujian secara online. Pembelajaran dengan metode e-learning memberikan kesempatan bagi peserta didik untuk mengikuti pembelajaran di lokasi dan waktu yang fleksibel. Model e-learning banyak digunakan pada pembelajaran, sehingga diperlukan peningkatan kebutuhan untuk mengotomatisasi proses evaluasi pada e-learning. Dalam penerapannya, beberapa topik pembelajaran menyertakan jawaban deskriptif atau gambar dalam bentuk diagram Unified Modeling Language (UML) seperti soal ujian pada Rekayasa Kebutuhan Perangkat Lunak (RKPL). Sehingga diperlukan pengembangan metode evaluasi jawaban dalam bentuk diagram UML. Penelitian ini menggunakan pemodelan graf pada communication diagram untuk melakukan pengukuran keserupaan antara dua buah diagram dan pengukuran keserupaan antara dua communication diagram. Setelah dilakukan pemodelan graf, kemudian diukur keserupaannya dengan metode Graph Edit Distance. Dari hasil penelitian ini terbukti bahwa keserupaan communication diagram dapat diukur dengan metode Graph Edit Distance dengan memodelkan diagram kedalam bentuk graf sebelumnya.

APA, Harvard, Vancouver, ISO, and other styles

16

HUGGETT, STEPHEN, IAIN MOFFATT, and NATALIA VIRDEE. "On the Seifert graphs of a link diagram and its parallels." Mathematical Proceedings of the Cambridge Philosophical Society 153, no. 1 (2012): 123–45. http://dx.doi.org/10.1017/s0305004112000102.

Full text

Abstract:

AbstractRecently, Dasbach, Futer, Kalfagianni, Lin and Stoltzfus extended the notion of a Tait graph by associating a set of ribbon graphs (or, equivalently, cellularly embedded graphs) to a link diagram. Here we focus on Seifert graphs, which are the ribbon graphs of a knot or link diagram that arise from Seifert states. We provide a characterization of Seifert graphs in terms of Eulerian subgraphs. This characterization can be viewed as a refinement of the fact that Seifert graphs are bipartite. We go on to examine the family of ribbon graphs that arises by forming the parallels of a link diagram and determine how the genus of the ribbon graph of ar-fold parallel of a link diagram is related to that of the original link diagram.

APA, Harvard, Vancouver, ISO, and other styles

17

Hayano, Kenta, Ayaka Shimizu, and Reiko Shinjo. "Region crossing change on spatial-graph diagrams." Journal of Knot Theory and Its Ramifications 24, no. 08 (2015): 1550045. http://dx.doi.org/10.1142/s0218216515500455.

Full text

Abstract:

Region crossing change at a region of a knot, link or spatial-graph diagram is a local transformation which changes all the crossings on the boundary of the region. In this paper, we show that we can make any crossing change by a finite number of region crossing changes on any diagram of a connected spatial graph which has no cutting circles.

APA, Harvard, Vancouver, ISO, and other styles

18

MELLOR, BLAKE. "TREE DIAGRAMS FOR STRING LINKS II: DETERMINING CHORD DIAGRAMS." Journal of Knot Theory and Its Ramifications 17, no. 06 (2008): 649–64. http://dx.doi.org/10.1142/s0218216508006336.

Full text

Abstract:

In previous work [7], we defined the intersection graph of a chord diagram associated with a string link (as in the theory of finite type invariants). In this paper, we look at the case when this graph is a tree, and we show that in many cases these trees determine the chord diagram (modulo the usual 1-term and 4-term relations).

APA, Harvard, Vancouver, ISO, and other styles

19

Kamada, Seiichi, Jieon Kim, and Sang Youl Lee. "Computations of quandle cocycle invariants of surface-links using marked graph diagrams." Journal of Knot Theory and Its Ramifications 24, no. 10 (2015): 1540010. http://dx.doi.org/10.1142/s0218216515400106.

Full text

Abstract:

By using the cohomology theory of quandles, quandle cocycle invariants and shadow quandle cocycle invariants are defined for oriented links and surface-links via broken surface diagrams. By using symmetric quandles, symmetric quandle cocycle invariants are also defined for unoriented links and surface-links via broken surface diagrams. A marked graph diagram is a link diagram possibly with 4-valent vertices equipped with markers. Lomonaco, Jr. and Yoshikawa introduced a method of describing surface-links by using marked graph diagrams. In this paper, we give interpretations of these quandle cocycle invariants in terms of marked graph diagrams, and introduce a method of computing them from marked graph diagrams.

APA, Harvard, Vancouver, ISO, and other styles

20

Zhang, Xiujun, Muhammad Ibrahim, Syed Bokhary, and Muhammad Siddiqui. "Edge Irregular Reflexive Labeling for the Disjoint Union of Gear Graphs and Prism Graphs." Mathematics 6, no. 9 (2018): 142. http://dx.doi.org/10.3390/math6090142.

Full text

Abstract:

In graph theory, a graph is given names—generally a whole number—to edges, vertices, or both in a chart. Formally, given a graph G = ( V , E ) , a vertex naming is a capacity from V to an arrangement of marks. A diagram with such a capacity characterized defined is known as a vertex-marked graph. Similarly, an edge naming is a mapping of an element of E to an arrangement of marks. In this case, the diagram is called an edge-marked graph. We consider an edge irregular reflexive k-labeling for the disjoint association of wheel-related diagrams and deduce the correct estimation of the reflexive edge strength for the disjoint association of m copies of some wheel-related graphs, specifically gear graphs and prism graphs.

APA, Harvard, Vancouver, ISO, and other styles

21

Peng, Huanchun, and Weidong Yang. "Knowledge Graph Construction Method for Commercial Aircraft Fault Diagnosis Based on Logic Diagram Model." Aerospace 11, no. 9 (2024): 773. http://dx.doi.org/10.3390/aerospace11090773.

Full text

Abstract:

Commercial aircraft fault diagnosis is an important means to ensure the reliability and safety of commercial aircraft. Traditional knowledge-driven and data-driven fault diagnosis methods lack interpretability in engineering mechanisms, making them difficult to promote and apply. To address the issue of lack of interpretability, this paper conducts a fault knowledge graph for commercial aircraft fault diagnosis, using the fault logic in the logic diagram to increase the interpretability of diagnostic work. Firstly, to avoid the inefficiency of logic diagram applications, an executable logic diagram model is established, which can perform mathematical analysis and achieve fault diagnosis and localization using operational data as input. Then, the logic diagram is sorted out to obtain the hidden fault knowledge in the logic diagram, which is used to construct a fault knowledge graph to help achieve cause localization and rapid troubleshooting. The methods proposed in this paper are all validated through case studies of abnormal low-pressure faults in domestic commercial aircraft hydraulic systems. The results show that the logic diagram model can perform model simulation and fault diagnosis based on operational data, and the fault knowledge graph can quickly locate abnormal monitoring parameters and guide troubleshooting work based on existing information.

APA, Harvard, Vancouver, ISO, and other styles

22

Van Erven, Gustavo Cordeiro Galvão, Rommel Novaes Carvalho, Waldeyr Mendes Cordeiro da Silva, Sergio Lifschitz, Harley Vera-Olivera, and Maristela Holanda. "Designing Graph Databases With GRAPHED." Journal of Database Management 30, no. 1 (2019): 41–60. http://dx.doi.org/10.4018/jdm.2019010103.

Full text

Abstract:

In recent years, graph database systems have become very popular and been deployed mainly in situations where the relationship between data is significant, such as in social networks. Although they do not require a particular schema design, a data model contributes to their consistency. Designing diagrams is an approach to satisfying this demand for a conceptual data model. While researchers and companies have been developing concepts and notations for graph database modeling, their notations focus on their specific implementations. In this article, the authors propose a diagram to address this lack of a generic and comprehensive notation for graph databases modeling, named GRAPHED (Graph Description Diagram for Graph Databases). The authors verified the effectiveness and compatibility of GRAPHED in two case studies: fraud identification, and a biological network model.

APA, Harvard, Vancouver, ISO, and other styles

23

OHYAMA, YOSHIYUKI. "LOCAL MOVES ON A GRAPH IN R3." Journal of Knot Theory and Its Ramifications 05, no. 02 (1996): 265–77. http://dx.doi.org/10.1142/s0218216596000187.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Jian, Pengpeng, Fucheng Guo, Cong Pan, Yanli Wang, Yangrui Yang, and Yang Li. "Interpretable Geometry Problem Solving Using Improved RetinaNet and Graph Convolutional Network." Electronics 12, no. 22 (2023): 4578. http://dx.doi.org/10.3390/electronics12224578.

Full text

Abstract:

This paper proposes an interpretable geometry solution based on the formal language set of text and diagram. Geometry problems are solved using machines; however, machines encounter challenges in natural language processing and computer vision. Significant progress has improved existing methods in the extraction of geometric formal languages. However, the neglect of the graph structure information in the formal language and the lack of further refinement of the extracted language set can lead to poor theorem prediction and poor accuracy in problem solving. In this paper, a formal language graph is constructed using the extracted formal language set and applied to theorem prediction using a graph convolutional network. To better extract the relationship set of diagram elements, an improved diagram parser is proposed. The test results indicate that the improved method has good results when solving interpretable geometry problems.

APA, Harvard, Vancouver, ISO, and other styles

25

Oku, Toshinobu. "Voronoi Diagram by Square Grid Limited Random Graph." Journal of the City Planning Institute of Japan 43.3 (2008): 79–84. http://dx.doi.org/10.11361/journalcpij.43.3.79.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Oku, Toshinobu. "Voronoi Diagram by Hexagonal Grid Limited Random Graph." Journal of the City Planning Institute of Japan 44.3 (2009): 799–804. http://dx.doi.org/10.11361/journalcpij.44.3.799.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Oku, Toshinobu. "Voronoi Diagram by Square Grid Limited Random Graph." Journal of the City Planning Institute of Japan 43 (2008): 14. http://dx.doi.org/10.11361/cpij1.43.0.14.0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

OKU, TOSHINOBU. "Voronoi Diagram by Hexagonal Grid Limited Random Graph." Journal of the City Planning Institute of Japan 44 (2009): 134. http://dx.doi.org/10.11361/cpij1.44.0.134.0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Chyu, C. C. "Decomposable Probabilistic Influence Diagrams." Probability in the Engineering and Informational Sciences 5, no. 2 (1991): 229–43. http://dx.doi.org/10.1017/s0269964800002035.

Full text

Abstract:

Probabilistic influence diagrams are a useful stochastic modeling tool. To calculate probabilities of interest relative to a probabilistic influence diagram efficiently, it will be helpful for us to use an associated decomposable-directed graph. We first explore and discuss some graph-theoretic and conditional independence properties of decomposable probabilistic influence diagrams. These properties are helpful in providing an efficient algorithm for obtaining a posterior decomposable probabilistic influence diagram given the state of one or more observed nodes. The connection between Shachter's “sequential creation of conditionally barren nodes” concept and Lauritzen and Spiegeihalter's “moralization and triangulation” algorithm for calculating probabilities relative to a probabilistic influence diagram is made explicit. We also discuss how to use wisely the concepts of “sequential creation of conditionally barren nodes” and “merging nodes” together with the graph-theoretic properties of decomposable directed graphs to compute probabilities relative to probabilistic influence diagrams.

APA, Harvard, Vancouver, ISO, and other styles

30

Tyler, Jason. "Every AF-algebra is Morita equivalent to a graph algebra." Bulletin of the Australian Mathematical Society 69, no. 2 (2004): 237–40. http://dx.doi.org/10.1017/s0004972700035978.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

S., Rajmeet. "DESIGN AND ANALYSIS OF THE PHYSICAL SYSTEMS USING BOND GRAPH." International Journal of Advances in Engineering & Scientific Research 1, no. 5 (2014): 142–44. https://doi.org/10.5281/zenodo.10725185.

Full text

Abstract:

<em>Abstract</em>—Bond graph is used to analysis of Electrical and Mechanical system. Bond graph is a graphical technique for modeling and analysis of the any physical systems. The complex systems are analysis by using bond graph tool. In this paper the fundamental theory of bond graph and electro-mechanical model with simulation using symbol Shakti software is explored. Keywords:- Bond graph, Iconic Diagram, Simulation, Symbol Shakti.

APA, Harvard, Vancouver, ISO, and other styles

32

Burlyaeva, E. V., V. V. Burlyaev, and V. S. Tsekhanovich. "SET-THEORETIC DESCRITPION OF FUNCTIONAL MODELS OF CHEMICAL MANUFACTURING." Fine Chemical Technologies 12, no. 5 (2017): 71–78. http://dx.doi.org/10.32362/2410-6593-2017-12-5-71-78.

Full text

Abstract:

The technique for the formalized description of functional models of chemical manufacturing is developed. The technique is based on graph theory. The model is described as a set of oriented labeled graphs that are hierarchically organized by the decompose relationship. First we describe the conversion of a single diagram to a labeled graph, including adding new nodes and edges. The nodes of the graph correspond to boxes, borders and branching points of the arrows at the diagram. The edges of the graph correspond to the arrows at the diagram. The graph descriptions of the model of base functional relationships such as output-input, output-control, output-mechanism are represented. We develop procedures to convert the border arrows and branch arrows. Conversion of branch arrows is performed depending on changes of the labels of branches. Branching of each arrow corresponds to a subgraph including several edges and perhaps additional nodes. Oriented labeled graphs are described by set-theoretic notation that contains the labels of the edges and the roles of nodes. The hierarchy of diagrams is specified by a decompose relationship, which includes the parent chart, the child chart and the decomposed box. As an example, we present the set-theoretic description of the functional model of vinyl acetate manufacturing. The application of mathematical apparatus built within the framework of graph theory for verification and analysis of functional diagrams based on the proposed formal description is an area for further research.

APA, Harvard, Vancouver, ISO, and other styles

33

Yu, Jing Hua, Meng Hua Wu, and Shao Chuan Ren. "The Research on Automatic Generation of Process Diagram in CAPP System for Shaft Parts." Applied Mechanics and Materials 391 (September 2013): 624–27. http://dx.doi.org/10.4028/www.scientific.net/amm.391.624.

Full text

Abstract:

Automatic generation of process diagram is developed in CAPP for shaft parts. The processing code to express the processing is used as a link to get the information of process diagram from the parts and processing information, so the topological relationship is established between the various components of surface on parts. The parts diagram, the rough diagram and process diagram are drawn by graphics sub-module with the shape feature flatten based on graph theory and the diagram related marking is also completed. Practical instances are given to analyze and verify.

APA, Harvard, Vancouver, ISO, and other styles

34

Hansen, Eric A., Jinchuan Shi, and James Kastrantas. "Strategy Graphs for Influence Diagrams." Journal of Artificial Intelligence Research 75 (November 30, 2022): 1177–221. http://dx.doi.org/10.1613/jair.1.13865.

Full text

Abstract:

An influence diagram is a graphical model of a Bayesian decision problem that is solved by finding a strategy that maximizes expected utility. When an influence diagram is solved by variable elimination or a related dynamic programming algorithm, it is traditional to represent a strategy as a sequence of policies, one for each decision variable, where a policy maps the relevant history for a decision to an action. We propose an alternative representation of a strategy as a graph, called a strategy graph, and show how to modify a variable elimination algorithm so that it constructs a strategy graph. We consider both a classic variable elimination algorithm for influence diagrams and a recent extension of this algorithm that has more relaxed constraints on elimination order that allow improved performance. We consider the advantages of representing a strategy as a graph and, in particular, how to simplify a strategy graph so that it is easier to interpret and analyze.

APA, Harvard, Vancouver, ISO, and other styles

35

Zahra, N., and M. Ibrahim. "ON VE-DEGREE AND EV-DEGREE BASED TOPOLOGICAL INDICES OF CERTAIN OTIS BISWAPPED NETWORK." Advances in Mathematics: Scientific Journal 10, no. 6 (2021): 2887–908. http://dx.doi.org/10.37418/amsj.10.6.15.

Full text

Abstract:

The optical transpose interconnection system (OTIS) arrange has numerous application in designed for equal just as in conveyed arrange. Distinctive interconnection networks has contemplated identified with topological descriptors in [\cite{25,26}]. The present article is a contribution to Ve-degree and Ev-degree base topological indices of biswapped network with premise diagram as path and complete graph. In addition, some delicated recipes are too gotten for various kinds of topological records for the OTIS biswapped network by taking the path and complete graph on $n$ vertices as premise of diagram.

APA, Harvard, Vancouver, ISO, and other styles

36

Gupta, K., and P. Goyal. "Implementation of Test Suites using Enhanced State Chart Diagrams: A Case Study." Journal of Scientific Research 15, no. 3 (2023): 637–49. http://dx.doi.org/10.3329/jsr.v15i3.63787.

Full text

Abstract:

An essential part of software engineering is testing. A series of pre-testing tasks should be completed before performing testing tasks. Implementing test suites is one of the pre-testing phases. In this work, a case study has been used to implement the suggested method for implementing test suites. The strategy is based on an analysis of UML (Unified Modelling Language) enhanced state chart diagrams (SCDs). UML state chart diagram analysis, AD (activity diagram) conversion into a graph, AG (activity graph) simplification, and test suite implementation are all steps in the generating process.

APA, Harvard, Vancouver, ISO, and other styles

37

Popova, Anastasiya Aleksandrovna. "Global route planning for a mobile robot based on graph methods." Vestnik of Astrakhan State Technical University. Series: Management, computer science and informatics 2024, no. 2 (2024): 57–67. http://dx.doi.org/10.24143/2072-9502-2024-2-57-67.

Full text

Abstract:

The problem of global route planning for a mobile robot between two given points in a known area with static obstacles is considered. To solve the problem of constructing a route in an area with a large number of obstacles of complex shape, an integrated approach based on graph theory methods is proposed. It includes the Voronoi diagram, visibility graph and the Dijkstra's algorithm. At the first stage, the study area is represented as a polygonal object, the space outside the object is considered as obstacles. Next, to get a safe distance from obstacles, an internal buffer of the polygonal object is built using the Minkowski difference. Then the vertices of the polygon are compacted, and the Voronoi polygons are constructed from the resulting vertices. The median axis of the polygon is calculated from the Voronoi polygons. Then the Dijkstra's algorithm is applied to calculate the shortest path. The resulting path is used to construct a visibility graph, and the Dijkstra's algorithm is reapplied to the resulting graph. The proposed approach allows to build a route that is optimal in terms of length and distance to obstacles. It significantly reduces the computational complexity of constructing a visibility graph. The approach was implemented in the freely distributed QGIS geographic information system for planning the route of a mobile robot in an aquatic environment. The results of the experiment showed that the Voronoi diagram reduced the number of vertices required to construct the visibility graph by 8.3 times, while the visibility graph improved the path obtained from the Voronoi diagram by 8%. The proposed approach can be used for global planning of routes for mobile robots in various environments.

APA, Harvard, Vancouver, ISO, and other styles

38

Ibănescu, Radu, and Cătălin Ungureanu. "Approach of a Particle Statics Problem by Using the Bond-Graph Modeling Method." Applied Mechanics and Materials 657 (October 2014): 599–603. http://dx.doi.org/10.4028/www.scientific.net/amm.657.599.

Full text

Abstract:

The paper presents a new approach to the numerical solution of a particle in equilibrium lying on a circle and subjected to the action of a linear spring. The difficulties of solving such a problem and the Mathcad and Simulink based solutions are presented in [1, 2, 3]. The most important difficulties consist in symbolically solving a forth degree trigonometric equation or in solving a complicated trigonometric inequality. This is why a numerical solution is preferred. The use of the bond graph modelling method for solving this problem of equilibrium is presented in this paper. The bond-graph modelling method is designed only for dynamics and the paper presents the possibility of its adaptation for solving this problem of statics of a particle. This approach can be then applied to solve other problems of statics. From the bond graph model the equilibrium equation and the block diagram model can be obtained. The block diagram model is usually preferred in engineering and, for this reason, the block diagram model obtained from the bond-graph model is shown in the paper together with the numerical results obtained after performing the simulations. The results are compared with those previously obtained in [2, 3].

APA, Harvard, Vancouver, ISO, and other styles

39

Carlsen, Lars, and Rainer Bruggemann. "Assessing and Grouping Chemicals Applying Partial Ordering Alkyl Anilines as an Illustrative Example." Combinatorial Chemistry & High Throughput Screening 21, no. 5 (2018): 349–57. http://dx.doi.org/10.2174/1386207321666180604103942.

Full text

Abstract:

Aim and Objective: In chemistry, there is a long tradition in classification. Usually, methods are adopted from the wide field of cluster analysis. The present study focusses on the application of partial ordering methodology for the classification of 21 alkyl substituted anilines. Materials and Methods: The analyses are based on the concepts from partial order methodology and cluster analyses. Here, with the example of 21 alkyl anilines, we show that concepts taken out from the mathematical discipline of partially ordered sets may be applied for classification. The chemical compounds are described by a multi-indicator system. For the present study four indicators, mainly taken from the field of environmental chemistry were applied and a graph of the ordering (Hasse diagram) was constructed. Results: A Hasse diagram is an acyclic, transitively reduced, triangle-free graph that may have several graph-theoretical components. The Hasse diagram has been directed from a structural chemical point of view. Two cluster analysis methods are applied (K-means and a hierarchical cluster method) and compared with the results from the Hasse diagram. In both cases, the partitioning of the set of 21 compounds by the component structure of the Hasse diagram appears to be better interpretable. Conclusion: It is shown that the partial ordering approach indeed can be used for classification in the present case. However, it must be clearly stated that a guarantee for meaningful results, in general, cannot be given. For that, further theoretical work is needed.

APA, Harvard, Vancouver, ISO, and other styles

40

Burlyaeva, E. V., and V. V. Kononenko. "GENERALIZED FUNCTIONAL MODEL OF CHEMICAL MANUFACTURING AND ITS SETTHEORETIC REPRESENTATION." National Association of Scientists 1, no. 29(56) (2020): 44–48. http://dx.doi.org/10.31618/nas.2413-5291.2020.1.56.232.

Full text

Abstract:

The mechanism of constructing functional models in the IDEF0 notation is considered. The process of creating a marked graph is described, it includes adding service vertices and arcs by converting the graph from a separate diagram. A generalized functional model of one-stage chemical production has been developed. A settheoretic description of a graph describing a top-level functional model is presented.

APA, Harvard, Vancouver, ISO, and other styles

41

KISELEVA, L. A., and I. V. SHARUN. "THE SOLUTION OF THE PROBLEM OF THE LOADS DISTRIBUTION IN THE BUSINESS-PROCESS DIAGRAM BASED ON THE ACTOR MODEL ANDTHEORY OF GRAPHS." Applied Mathematics and Fundamental Informatics 10, no. 3 (2023): 26–32. https://doi.org/10.25206/2311-4908-2023-10-3-26-32.

Full text

Abstract:

Graph theory algorithms are studied for finding critical paths in actor systems to determine the most problematic places. An algorithm for converting a process diagram into a directed graph is used to study and improve the operation of business process models. Ant colony algorithms are investigated to determine the frequency usage of a graph node in shortest paths between other nodes.

APA, Harvard, Vancouver, ISO, and other styles

42

Shimizu, Ayaka, and Rinno Takahashi. "Region crossing change on spatial theta-curves." Journal of Knot Theory and Its Ramifications 29, no. 05 (2020): 2050028. http://dx.doi.org/10.1142/s0218216520500285.

Full text

Abstract:

A region crossing change at a region of a spatial-graph diagram is a transformation changing every crossing on the boundary of the region. In this paper, it is shown that every spatial graph consisting of theta-curves can be unknotted by region crossing changes.

APA, Harvard, Vancouver, ISO, and other styles

43

Stapleton, Gem, John Howse, and Peter Rodgers. "A graph theoretic approach to general Euler diagram drawing." Theoretical Computer Science 411, no. 1 (2010): 91–112. http://dx.doi.org/10.1016/j.tcs.2009.09.005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Yaagoubi, Reda, Yehia Miky, and Ahmed El Shouny. "AccessVOR: A Semantically Enriched Voronoï-Based Approach for Navigation Assistance of Wheelchair Users in Indoor Environments." Journal of Navigation 73, no. 1 (2019): 172–91. http://dx.doi.org/10.1017/s037346331900047x.

Full text

Abstract:

People with physical disabilities often face many challenges due to the non-compliance of public buildings to accessibility standards. Hence, it is necessary to provide them with relevant information about the quality of access associated with the environment they plan to visit. In this paper, we propose ‘AccessVOR’ (Accessibility assessment based on VORonoï Diagram), a novel approach that aims to automatically generate an indoor navigation network and to assess its accessibility for people moving with wheelchairs based on the American with Disabilities Act Accessibility Guidelines (ADAAG). A semantically enriched spatial database is developed based on ADAAG and the Indoor Geography Markup Language (IndoorGML) standard. A Three-Dimensional (3D) navigation-graph is then generated from the various components of an indoor environment using a Voronoï Diagram. The semantics of ADAAG allow assessing the accessibility of each segment of this navigation graph. Next, a navigation cost is allocated to this graph based on the accessibility of each segment of the network graph for navigation purposes.

APA, Harvard, Vancouver, ISO, and other styles

45

Gokan, Yusuke, Hayato Katsumata, Katsuya Nakajima, Ayaka Shimizu, and Yoshiro Yaguchi. "A note on the cross-index of a complete graph based on a linear tree." Journal of Knot Theory and Its Ramifications 27, no. 11 (2018): 1843010. http://dx.doi.org/10.1142/s0218216518430101.

Full text

Abstract:

In this paper, it is shown that a complete graph with [Formula: see text] vertices has an optimal diagram, i.e. a diagram whose crossing number equals the value of Guy’s formula, with a free maximal linear tree and without free Hamiltonian cycles for any odd integer [Formula: see text].

APA, Harvard, Vancouver, ISO, and other styles

46

Gomon, Petro. "APPROXIMATIONS OF THE TORQUE-CURVITY DIAGRAM RECTANGULAR CROSS-SECTION WOODEN REINFORCED AND NONREINFORCED BEAMS." Urban development and spatial planning, no. 78 (October 29, 2021): 157–65. http://dx.doi.org/10.32347/2076-815x.2021.78.157-165.

Full text

Abstract:

The sequence of approximation of the "torque-curvature" diagram to the function is described for a reinforced and unreinforced bending wooden element of rectangular cross-section. It has been established that for the approximation it is necessary to go through the following sequence: 1) using the hypothesis of flat sections, determine the stress-strain state of the section, taking into account the current models of the work of the materials included in the structure under consideration; 2) build a graph "torque-curvature" according to the previously given algorithms; 3) for a given section, establish the main points of the diagram; 4) to carry out the apromaximization of the diagram to the function using mathematical methods; 5) confirm the convergence of functions to determine the accuracy of their approximation, over the entire diagram and at specific points of the diagram. An example of diagram approximation is given. An example of an approximated function for theoretical and experimental data is given. The sequence of approximation of the diagram to the function is described. The main points of the diagram are established for their reliable description. The possibility of using the function to simulate the work of wood is indicated. A comparison is made between the diagram and the function that describe the "torque-curvature" graph. It was found that this technique can simplify the "torque-curvature" diagram to an elementary power function (in this example, two-degree). It was found that the diagram and the function have an average deviation in the diagram in size , and the total deviation in percentage was less than 1.28%. In this regard, we can conclude that the function has sufficient similarity to use it in further calculations.

APA, Harvard, Vancouver, ISO, and other styles

47

Righolt, Christiaan H., and Salaheddin M. Mahmud. "Attrition Diagrams for Clinical Trials and Meta-analyses in Stata." Stata Journal: Promoting communications on statistics and Stata 18, no. 2 (2018): 387–94. http://dx.doi.org/10.1177/1536867x1801800206.

Full text

Abstract:

In this article, we present attrition, a suite of commands to simplify the maintenance and documentation of implemented exclusion criteria and attrition conditions using standard Stata facilities and to generate an attrition diagram. attrition can be used, both from the command line and in do-files, to keep the diagram up to date with the analysis it documents. Six subcommands (set, exclude, count, tab, list, graph) allow the diagram to be constructed in a versatile way.

APA, Harvard, Vancouver, ISO, and other styles

48

MIYAZAWA, YASUYUKI. "MAGNETIC GRAPHS AND AN INVARIANT FOR VIRTUAL LINKS." Journal of Knot Theory and Its Ramifications 15, no. 10 (2006): 1319–34. http://dx.doi.org/10.1142/s0218216506005135.

Full text

Abstract:

Introducing a type of graph named a virtual magnetic graph diagram, we define a virtual link invariant, which generalizes the Jones-Kauffman polynomial and the 2-variable polynomial invariant defined by N. Kamada and the author. We show that this invariant can evaluate the number of virtual crossings of a virtual link.

APA, Harvard, Vancouver, ISO, and other styles

49

Arifin, Mohammad Nazir, and Daniel Siahaan. "Structural and Semantic Similarity Measurement of UML Use Case Diagram." Lontar Komputer : Jurnal Ilmiah Teknologi Informasi 11, no. 2 (2020): 88. http://dx.doi.org/10.24843/lkjiti.2020.v11.i02.p03.

Full text

Abstract:

Reusing software has several benefits ranging from reducing cost and risk, accelerating development, and its primary purposes are improving software quality. In the early stage of software development, reusing existing software artifacts may increase the benefit of reusing software because it uses mature artifacts from previous artifacts. One of software artifacts is diagram, and in order to assist the reusing diagram is to find the level of similarity of diagrams. This paper proposes a method for measuring the similarity of the use case diagram using structural and semantic aspects. For structural similarity measurement, Graph Edit Distance is used by transforming each factor and use case into a graph, while for semantic similarity measurement, WordNet, WuPalmer,and Levenshtein were used. The experimentation was conducted on ten datasets from variousprojects. The results of the method were compared with the results of assessments from experts.The measurement of agreement between experts and method was done by using Gwet’s AC1 andPearson correlation coefficient. Measurement results with Gwet’s AC1 diagram similarity are 0,60,which were categorized as “moderate" agreement and the result of measurement with Pearsonis 0.506 which means there is a significant correlation between experts and methods. The resultshowed that the proposed method can be used to find the similarity of the diagram, so finding andreuse of the diagram as a software component can be optimized.

APA, Harvard, Vancouver, ISO, and other styles

50

CRISP, JOHN, MICHAH SAGEEV, and MARK SAPIR. "SURFACE SUBGROUPS OF RIGHT-ANGLED ARTIN GROUPS." International Journal of Algebra and Computation 18, no. 03 (2008): 443–91. http://dx.doi.org/10.1142/s0218196708004536.

Full text

Abstract:

We consider the question of which right-angled Artin groups contain closed hyperbolic surface subgroups. It is known that a right-angled Artin group A(K) has such a subgroup if its defining graph K contains an n-hole (i.e. an induced cycle of length n) with n ≥ 5. We construct another eight "forbidden" graphs and show that every graph K on ≤ 8 vertices either contains one of our examples, or contains a hole of length ≥ 5, or has the property that A(K) does not contain hyperbolic closed surface subgroups. We also provide several sufficient conditions for a right-angled Artin group to contain no hyperbolic surface subgroups. We prove that for one of these "forbidden" subgraphs P2(6), the right-angled Artin group A(P2(6)) is a subgroup of a (right-angled Artin) diagram group. Thus we show that a diagram group can contain a non-free hyperbolic subgroup answering a question of Guba and Sapir. We also show that fundamental groups of non-orientable surfaces can be subgroups of diagram groups. Thus the first integral homology of a subgroup of a diagram group can have torsion (all homology groups of all diagram groups are free Abelian by a result of Guba and Sapir).

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!