Thematische Bibliographien / Graphs Construction

Auswahl der wissenschaftlichen Literatur zum Thema „Graphs Construction“

Autor: Grafiati

Veröffentlicht am 25. Mai 2024

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Inhaltsverzeichnis

Zeitschriftenartikel
Dissertationen
Bücher
Buchteile
Konferenzberichte
Berichte der Organisationen

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Graphs Construction" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Graphs Construction"

Antalan, John Rafael Macalisang, und Francis Joseph Campena. „A Breadth-first Search Tree Construction for Multiplicative Circulant Graphs“. European Journal of Pure and Applied Mathematics 14, Nr. 1 (31.01.2021): 248–64. http://dx.doi.org/10.29020/nybg.ejpam.v14i1.3884.

Der volle Inhalt der Quelle

Annotation:

In this paper, we give a recursive method in constructing a breadth-first search tree for multiplicative circulant graphs of order power of odd. We then use the proposed construction in reproving some results concerning multiplicative circulant graph's diameter, average distance and distance spectral radius. We also determine the graph's Wiener index, vertex-forwarding index, and a bound for its edge-forwarding index. Finally, we discuss some possible research works in which the proposed construction can be applied.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Akwu, A. D. „On Strongly Sum Difference Quotient Labeling of One-Point Union of Graphs, Chain and Corona Graphs“. Annals of the Alexandru Ioan Cuza University - Mathematics 61, Nr. 1 (01.01.2015): 101–8. http://dx.doi.org/10.2478/aicu-2014-0026.

Der volle Inhalt der Quelle

Annotation:

Abstract In this paper we study strongly sum difference quotient labeling of some graphs that result from three different constructions. The first construction produces one- point union of graphs. The second construction produces chain graph, i.e., a concatenation of graphs. A chain graph will be strongly sum difference quotient graph if any graph in the chain, accepts strongly sum difference quotient labeling. The third construction is the corona product; strongly sum difference quotient labeling of corona graph is obtained.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Zhang, Xiaoling, und Chengyuan Song. „The Distance Matrices of Some Graphs Related to Wheel Graphs“. Journal of Applied Mathematics 2013 (2013): 1–5. http://dx.doi.org/10.1155/2013/707954.

Der volle Inhalt der Quelle

Annotation:

LetDdenote the distance matrix of a connected graphG. The inertia ofDis the triple of integers (n+(D), n0(D), n-(D)), wheren+(D),n0(D), andn-(D)denote the number of positive, 0, and negative eigenvalues ofD, respectively. In this paper, we mainly study the inertia of distance matrices of some graphs related to wheel graphs and give a construction for graphs whose distance matrices have exactly one positive eigenvalue.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Lorenzen, Kate. „Cospectral constructions for several graph matrices using cousin vertices“. Special Matrices 10, Nr. 1 (28.06.2021): 9–22. http://dx.doi.org/10.1515/spma-2020-0143.

Der volle Inhalt der Quelle

Annotation:

Abstract Graphs can be associated with a matrix according to some rule and we can find the spectrum of a graph with respect to that matrix. Two graphs are cospectral if they have the same spectrum. Constructions of cospectral graphs help us establish patterns about structural information not preserved by the spectrum. We generalize a construction for cospectral graphs previously given for the distance Laplacian matrix to a larger family of graphs. In addition, we show that with appropriate assumptions this generalized construction extends to the adjacency matrix, combinatorial Laplacian matrix, signless Laplacian matrix, normalized Laplacian matrix, and distance matrix. We conclude by enumerating the prevelance of this construction in small graphs for the adjacency matrix, combinatorial Laplacian matrix, and distance Laplacian matrix.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

FARKAS, CATHERINE, ERICA FLAPAN und WYNN SULLIVAN. „UNRAVELLING TANGLED GRAPHS“. Journal of Knot Theory and Its Ramifications 21, Nr. 07 (07.04.2012): 1250074. http://dx.doi.org/10.1142/s0218216512500745.

Der volle Inhalt der Quelle

Annotation:

Motivated by proposed entangled molecular structures known as ravels, we introduce a method for constructing such entanglements from 2-string tangles. We then show that for most (but not all) arborescent tangles this construction yields either a planar θ4 graph or contains a knot.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Princess Rathinabai, G., und G. Jeyakumar. „CONSTRUCTION OF COLOR GRAPHS“. Advances in Mathematics: Scientific Journal 9, Nr. 5 (04.07.2020): 2397–406. http://dx.doi.org/10.37418/amsj.9.5.3.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ligong, Wang, Li Xueliang und Zhang Shenggui. „Construction of integral graphs“. Applied Mathematics-A Journal of Chinese Universities 15, Nr. 3 (September 2000): 239–46. http://dx.doi.org/10.1007/s11766-000-0046-z.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Dutta, Supriyo, und Bibhas Adhikari. „Construction of cospectral graphs“. Journal of Algebraic Combinatorics 52, Nr. 2 (24.09.2019): 215–35. http://dx.doi.org/10.1007/s10801-019-00900-y.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Haythorpe, M., und A. Newcombe. „Constructing families of cospectral regular graphs“. Combinatorics, Probability and Computing 29, Nr. 5 (30.06.2020): 664–71. http://dx.doi.org/10.1017/s096354832000019x.

Der volle Inhalt der Quelle

Annotation:

AbstractA set of graphs are called cospectral if their adjacency matrices have the same characteristic polynomial. In this paper we introduce a simple method for constructing infinite families of cospectral regular graphs. The construction is valid for special cases of a property introduced by Schwenk. For the case of cubic (3-regular) graphs, computational results are given which show that the construction generates a large proportion of the cubic graphs, which are cospectral with another cubic graph.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

HALPERN, M. B., und N. A. OBERS. „NEW SUPERCONFORMAL CONSTRUCTIONS ON TRIANGLE-FREE GRAPHS“. International Journal of Modern Physics A 07, Nr. 29 (20.11.1992): 7263–86. http://dx.doi.org/10.1142/s0217751x92003331.

Der volle Inhalt der Quelle

Annotation:

It is known that the superconformal master equation has an ansatz which contains a graph theory of superconformal constructions. In this paper, we study a subansatz which is consistent and solvable on the set of triangle-free graphs. The resulting super-conformal level-families have rational central charge and the constructions are generically unitary. The level-families are generically new because irrational conformal weights occur in the generic construction, and the central charge of the generic level-family cannot be obtained by coset construction. The standard rational superconformal constructions in the subansatz are a subset of the constructions on edge-regular triangle-free graphs, and we call attention to the nonstandard constructions on these graphs as candidates for new rational superconformal field theories. We also find superconformal quadratic deformations at particular levels on almost all edge-regular triangle-free graphs.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Dissertationen zum Thema "Graphs Construction"

Small, Benjamin Luke. „On alpha-critical graphs and their construction“. Thesis, Washington State University, 2015. http://pqdtopen.proquest.com/#viewpdf?dispub=3717480.

Der volle Inhalt der Quelle

Annotation:

A graph G is α-critical (or removal-critical) if α(G–e) = α(G)+1 for all edges ∈ 2 E(G), where α( G) is the vertex independence number of G. Similarly, a graph G is contraction-critical if α(G\e ) = α(G) – 1 for all edges e ∈ (G). This document discusses certain properties of removal-critical and contractioncritical graphs, and the enumeration of such graphs (up to 13 vertices and 17 vertices, respectively). It also discusses methods of constructing removal-critical graphs from smaller removal-critical graphs, including vertex duplication, splicing, buckling, and 1-joining. Finally, it discusses the number of removal-critical graphs that can or cannot be produced using these constructions.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Casamento, Katherine Imhoff. „Correct-by-Construction Typechecking with Scope Graphs“. PDXScholar, 2019. https://pdxscholar.library.pdx.edu/open_access_etds/5272.

Der volle Inhalt der Quelle

Annotation:

Dependently-typed languages are well-known for the ability to enforce program invariants through type signatures, and previous work establishes the effectiveness of this style of program verification in the implementation of type-safe interpreters for a wide class of languages with a variety of interesting scoping semantics, offering an account of dynamic semantics. This thesis covers the complementary topic of static semantics, in the form of a pattern for constructing verified typechecking procedures in a dependently-typed setting. Implementations are given for simply-typed lambda calculus and a small procedural language as well as a module system with unrestricted cyclic module dependency semantics that are traditionally hard to formalize, parameterized over the choice of base language. A library of finite graphs and decision procedures for path search queries is presented and used in the construction of the example language implementations to resolve variable references. The resulting development is suitable as a static analysis phase ("middle end") in a hypothetical end-to-end verified interpreter developed in a dependently-typed setting.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Gasquoine, Sarah Louise. „Finite and infinite extensions of regular graphs“. Thesis, Queen Mary, University of London, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.313750.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Johansson, David. „Construction of Superimposed Codes Using Graphs and Galois Fields“. Thesis, Karlstads universitet, Institutionen för matematik och datavetenskap (from 2013), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-62862.

Der volle Inhalt der Quelle

Annotation:

In this thesis some constructions of superimposed codes are presented. Many of the known nontrivial constructions arise from t−designs, and the constructions discussed in this thesis is also based on a block design idea. Superimposed codes are rather combinatorial in nature, so the connection to t−designs is not too surprising. What may be a little surprise, however, is the connection between superimposed codes and linear codes and Galois elds. Linear codes are quite intuitive and have nice properties, as is the case for Galois elds; combinatorial structures are quite often the contrary, not intuitive and quite dicult to understand. Because of this, it is interesting that a combinatorial structure like superimposed codes can be constructed from structures like linear codes and Galois elds. The main goal of this thesis is to present two possibly new approaches to construct superimposed codes. The constructions are described, but not proved to be correct. The rst construction presented is using graphs. In practice, this is not a good way to construct codes, since it requires the construction of a graph and nding certain cycles in the graph. It is still an interesting construction, however, since it provides a connection between constant weight codes and superimposed codes. Another construction is presented, one that seems much more useful when constructing codes. In [7] one particular superimposed code is constructed from a Galois eld. In this thesis we will see that this construction using Galois elds can be generalized.
I denna uppsats presenteras några konstruktioner av överlagrade koder. Många av de redan kända konstruktionerna har sitt ursprung i t-designer, och även konstruktionerna som behandlas i denna uppsats är baserade på en blockdesignsidé. Överlagrade koder är tämligen kombinatoriska till sin natur, så kopplingen mellan överlagrade koder och t-designer är inte speciellt överraskande. Däremot kan kopplingen mellan överlagrade koder, linjära koder och Galoiskroppar vara överraskande. Linjära koder är ganska intuitiva och har trevliga egenskaper, likaså Galoiskroppar; kombinatoriska strukturer är ofta tvärt om, inte intuitiva och svåra att förstå. På grund av detta är det intressant att kombinatoriska strukturer som överlagrade koder kan konstrueras med hjälp av strukturer som linjära koder och Galoiskroppar. Det primära målet med denna uppsats är att presentera två möjligen nya konstruktioner av överlagrade koder. Konstruktionerna beskrivs men deras korrekthet bevisas inte. Den första konstruktionen som presenteras är baserad på grafer. I praktiken är denna konstruktionen inte bra för att skapa koder, eftersom den kräver konstruktion av en graf och sedan att hitta vissa cykler i grafen. Det är dock fortfarande en intressant konstruktion, eftersom den bidrar till en intressant koppling mellan konstantvikt koder och överlagrade koder. En annan konstruktion presenteras, och den är mycket mer praktiskt användbar. I [7] skapas en specik överlagrad kod med hjälp av en Galoiskropp. I denna uppsats ser vi hur denna konstruktion med Galoiskroppar kan generaliseras.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kamat, Vineet Rajendra. „Enabling 3D Visualization of Simulated Construction Operations“. Thesis, Virginia Tech, 2000. http://hdl.handle.net/10919/35470.

Der volle Inhalt der Quelle

Annotation:

Simulation modeling and visualization can substantially help in designing complex construction operations and in making optimal decisions where traditional methods prove ineffective or are unfeasible. However, there has been limited use of simulation in planning construction operations due to the unavailability of appropriate visual communication tools that can provide users with a more realistic and comprehensible feedback from simulation analyses. Visualizing simulated construction operations in 3D can significantly help in establishing the credibility of simulation models. In addition, 3D visualization can provide valuable insight into the subtleties of construction operations that are otherwise non-quantifiable and presentable. New software development technologies emerge at incredible rates that allow engineers and scientists to create novel, domain-specific applications. This study capitalized on a computer graphics technology based on the concept of the "Scene Graph" to design and implement a general-purpose 3D Visualization System that is Simulation and CAD-software independent. This system, the "Dynamic Construction Visualizer", enables realistic visualization of modeled construction operations and the resulting products in 3D and can be used in conjunction with a wide variety of simulation tools. This thesis describes the "Dynamic Construction Visualizer" as well as the "Scene Graph" architecture and the Frame Updating algorithms used in its design.
Master of Science

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bricage, Marie. „Modélisation et Algorithmique de graphes pour la construction de structures moléculaires“. Thesis, Université Paris-Saclay (ComUE), 2018. http://www.theses.fr/2018SACLV031/document.

Der volle Inhalt der Quelle

Annotation:

Dans cette thèse, nous présentons une approche algorithmique permettant la génération de guides de construction de cages moléculaires organiques. Il s'agit d'architectures semi-moléculaires possédant un espace interne défini capable de piéger une molécule cible appelée substrat. De nombreuses œuvres proposent de générer des cages organiques moléculaires obtenues à partir de structures symétriques, qui ont une bonne complexité, mais elles ne sont pas spécifiques car elles ne prennent pas en compte des cibles précises. L'approche proposée permet de générer des guides de construction de cages moléculaires organiques spécifiques à un substrat donné. Afin de garantir la spécificité de la cage moléculaire pour le substrat cible, une structure intermédiaire, qui est une expansion de l'enveloppe du substrat cible, est utilisée. Cette structure définie la forme de l'espace dans lequel est piégé le substrat. Des petits ensembles d'atomes, appelés motifs moléculaires liants, sont ensuite intégrés à cette structure intermédiaire. Ces motifs moléculaires sont les ensembles d'atomes nécessaires aux cages moléculaires pour leur permettre d’interagir avec le substrat afin de le capturer
In this thesis, we present an algorithmic approach allowing the generation of construction guides of organic molecular cages. These semi-molecular architectures have a defined internal space capable of trapping a target molecule called substrate. Many works propose to generate molecular organic cages obtained from symmetrical structures, which have a good complexity, but they are not specific because they do not take into account precise targets. The proposed approach makes it possible to generate guides for the construction of organic molecular cages specific to a given substrate. In order to ensure the specificity of the molecular cage for the target substrate, an intermediate structure, which is an expansion of the envelope of the target substrate, is used. This structure defines the shape of the space in which the substrate is trapped. Small sets of atoms, called molecular binding patterns, are then integrated into this intermediate structure. These molecular patterns are the sets of atoms needed by molecular cages to allow them to interact with the substrate to capture it

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Pereira, Gabriel Maier Fernandes Vidueiro. „Test-case-based call graph construction in dynamically typed programming languages“. reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2015. http://hdl.handle.net/10183/134355.

Der volle Inhalt der Quelle

Annotation:

Evolução de software é uma das atividades mais desafiadoras do processo de desenvolvimento de software. Uma importante questão associada à essa atividade é a correta compreensão do código fonte e outros artefatos que necessitam ser mantidos e evoluídos. Visando auxiliar desenvolvedores na manutenção de código, Integrated Development Environments (IDE’s) proporcionam ferramentas que informam desenvolvedores sobre as dependências e as particularidades do código a ser modificado. No entanto, linguagens dinamicamente tipadas não definem tipos explicitamente no código fonte, o que dificulta a análise estática do código e consequentemente a contrução dessas ferramentas. Como exemplo, a construção de call graphs (grafos de chamadas), utilizados pelas IDE’s para criar ferramentas de navegação de código, é prejudicada pela ausência da definição de tipos. Para abordar o problema da criação de call graphs para linguagens dinamicamente tipadas, propomos uma técnica dividida em passos para a construção de um call graph baseado em informações extraídas da execução de testes. A técnica é dividida em 3 passos, o Passo #1 cria um call graph conservativo e estático que resolve chamadas de métodos baseado apenas em nomes dos métodos, ainda no primeiro passo, testes são executados e seu traço de execução é armazenado para posterior análise. O Passo #2 combina a informação armazenada da execução dos testes e o call graph construído no primeiro passo, o Passo #2 também é responsável pela criação de um conjunto de regras de associação que servirão para guiar desenvolvedores durante a criação de novas partes do código. Nossa avaliação em uma aplicação real de porte grande mostrou que a técnica melhora a precisão do call graph criado removendo arestas desnecessárias (70%), e mostrou-se apta a auxiliar desenvolvedores definindo pontos de navegação no código baseada na análise de regras de associação extraídas do test-case-based call graph.
Evolving enterprise software systems is one of the most challenging activities of the software development process. An important issue associated with this activity is to properly comprehend the source code and other software assets that must be evolved. To assist developers on these evolution tasks, Integrated Development Environments (IDEs) build tools that provides information about the source code and its dependencies. However, dynamically typed languages do not define types explicitly in the source code, which difficult source code analysis and therefore the construction of these tools. As an example, the call graph construction, used by IDE’s to build source code navigation tools, is hampered by the absence of type definition. To address the problem of constructing call graphs for dynamic languages, we propose a technique based on steps to build a call graph based on test runtime information, called test-case-based call graph. The technique is divided in three steps; Step #1 creates a conservative and static call graph that decides target nodes based on method names, and the first step also run tests profiling its execution; Step #2 combines the test runtime information and the conservative call graph built in the first step to create the test-case-based call graph, it also creates a set of association rules to guide developers in the maintenance while creating new pieces of code; Finally, Step #3 uses the test-case-based call graph and the association rules to assist developers in source code navigation tasks. Our evaluation on a large-size real-world software shows that the technique increases call graph precision removing several unnecessary conservative edges ( %70), and assist developers filtering target nodes of method calls based on association rules extracted from the call graph.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

PORRINI, RICCARDO. „Construction and Maintenance of Domain Specific Knowledge Graphs for Web Data Integration“. Doctoral thesis, Università degli Studi di Milano-Bicocca, 2016. http://hdl.handle.net/10281/126789.

Der volle Inhalt der Quelle

Annotation:

A Knowledge Graph (KG) is a semantically organized, machine readable collection of types, entities, and relations holding between them. A KG helps in mitigating semantic heterogeneity in scenarios that require the integration of data from independent sources into a so called dataspace, realized through the establishment of mappings between the sources and the KG. Applications built on top of a dataspace provide advanced data access features to end-users based on the representation provided by the KG, obtained through the enrichment of the KG with domain specific facets. A facet is a specialized type of relation that models a salient characteristic of entities of particular domains (e.g., the vintage of wines) from an end-user perspective. In order to enrich a KG with a salient and meaningful representation of data, domain experts in charge of maintaining the dataspace must be in possess of extensive knowledge about disparate domains (e.g., from wines to football players). From an end-user perspective, the difficulties in the definition of domain specific facets for dataspaces significantly reduce the user-experience of data access features and thus the ability to fulfill the information needs of end-users. Remarkably, this problem has not been adequately studied in the literature, which mostly focuses on the enrichment of the KG with a generalist, coverage oriented, and not domain specific representation of data occurring in the dataspace. Motivated by this challenge, this dissertation introduces automatic techniques to support domain experts in the enrichment of a KG with facets that provide a domain specific representation of data. Since facets are a specialized type of relations, the techniques proposed in this dissertation aim at extracting salient domain specific relations. The fundamental components of a dataspace, namely the KG and the mappings between sources and KG elements, are leveraged to elicitate such domain specific representation from specialized data sources of the dataspace, and to support domain experts with valuable information for the supervision of the process. Facets are extracted by leveraging already established mappings between specialized sources and the KG. After extraction, a domain specific interpretation of facets is provided by re-using relations already defined in the KG, to ensure tight integration of data. This dissertation introduces also a framework to profile the status of the KG, to support the supervision of domain experts in the above tasks. Altogether, the contributions presented in this dissertation provide a set of automatic techniques to support domain experts in the evolution of the KG of a dataspace towards a domain specific, end-user oriented representation. Such techniques analyze and exploit the fundamental components of a dataspace (KG, mappings, and source data) with an effectiveness not achievable with state-of-the-art approaches, as shown by extensive evaluations conducted in both synthetic and real world scenarios.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Balamohan, Balasingham. „Efficient Mechanisms for Exploration of Dangerous Graphs and for Inter-agent Communication“. Thèse, Université d'Ottawa / University of Ottawa, 2013. http://hdl.handle.net/10393/26002.

Der volle Inhalt der Quelle

Annotation:

This thesis deals with the problems of exploration and map construction of a dangerous network by mobile agents, and it introduces new general mechanisms for inter-agent communication, which could be applied to other mobile agents' problems. A dangerous network contains a harmful process called Black Hole that destroys all agents entering the node where it resides, without leaving any observable trace. The task for the agents, which are moving asynchronously, is to construct a map of the network with edges incident on the black hole unambiguously identified. Two types of communication mechanisms are considered: whiteboards and tokens. In the whiteboard model every node provides a shared memory on which agents can read and write. When communication occurs through tokens, instead, the agents have some pebbles that can be placed on and picked up from the nodes. Four different costs for comparing the efficiency of the protocols are taken into account: the number of agents required, the number of moves performed, the size of the whiteboard (or the token capacity at a node), and time. The black hole search problem is considered first in ring networks with whiteboards, and optimal exact time and move complexities are established improving all existing results. The same problem is then studied in arbitrary unknown graphs and it is solved in the token model by using a constant number of tokens in total. The protocol improves on existing results and is based on a novel technique for communicating using tokens. Finally, the new method of communicating using tokens described in the context of black hole search is generalized to propose a novel communication mechanism among the agents that could possibly be employed for any distributed algorithm by mobile agents.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Eshghi, Kourosh. „The existence and construction of Ã-valuations of 2-regular graphs with three components“. Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp02/NQ27919.pdf.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Bücher zum Thema "Graphs Construction"

Isakov, Vladimir. Speak the language of schemes. ru: INFRA-M Academic Publishing LLC., 2022. http://dx.doi.org/10.12737/1860649.

Der volle Inhalt der Quelle

Annotation:

Schematization and visualization are the necessary means to ensure the activity of a modern specialist. Schematization allows you to highlight the main thing in an object, to discover its constituent elements, to show their relationship, gives impetus to the construction of conceptual approaches. Visualization "dresses" schematic concepts in a bright, expressive artistic and graphic form. The handbook provides descriptions of the most popular means of analytical graphics - maps, graphs, tables, graphs, diagrams, flowcharts (algorithms), chronolents, maps, methodological schemes, etc. The ways of using schemes for analyzing goals, causes, problems, versions are considered. A thematic dictionary of terms and definitions, a "hot twenty" useful schematization are given. For students, undergraduates, postgraduates, teachers of law schools and faculties, as well as for representatives of other specialties - everyone who draws diagrams and works with them.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Eshghi, Kourosh. The existence and construction of gas-valuations of 2-regular graphs with three components. Ottawa: National Library of Canada = Bibliothèque nationale du Canada, 1997.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Nash, G. F. J. Bridges to BS5400: Tables and graphs for simply supported beam and slab design. Croydon: Constrado, 1985.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Muralt, Arnold. The design of switched-capacitor ladder filters: Based on doubly- terminated two-pair signal-flow graphs. Konstanz: Hartung-Gorre Verlag, 1993.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kejriwal, Mayank. Domain-Specific Knowledge Graph Construction. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-12375-8.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Dudek, Gregory. Robotic exploration as graph construction. Toronto: University of Toronto, Dept. of Computer Science, 1988.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Qin, Bing, Zhi Jin, Haofen Wang, Jeff Pan, Yongbin Liu und Bo An, Hrsg. Knowledge Graph and Semantic Computing: Knowledge Graph Empowers New Infrastructure Construction. Singapore: Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-16-6471-7.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Egar, John W. Construction of normative decision models using abstract graph grammars. Stanford, Calif: Dept. of Computer Science, Stanford University, 1994.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Dodge, Diane Trister. Constructing curriculum for the primary grades. Washington: Teaching Strategies, 1994.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Pan, Jeff Z., Diego Calvanese, Thomas Eiter, Ian Horrocks, Michael Kifer, Fangzhen Lin und Yuting Zhao, Hrsg. Reasoning Web: Logical Foundation of Knowledge Graph Construction and Query Answering. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-49493-7.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Buchteile zum Thema "Graphs Construction"

Beneš, Nikola, Luboš Brim, Samuel Pastva und David Šafránek. „Symbolic Coloured SCC Decomposition“. In Tools and Algorithms for the Construction and Analysis of Systems, 64–83. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72013-1_4.

Der volle Inhalt der Quelle

Annotation:

AbstractProblems arising in many scientific disciplines are often modelled using edge-coloured directed graphs. These can be enormous in the number of both vertices and colours. Given such a graph, the original problem frequently translates to the detection of the graph’s strongly connected components, which is challenging at this scale.We propose a new, symbolic algorithm that computes all the monochromatic strongly connected components of an edge-coloured graph. In the worst case, the algorithm performs $$O(p\cdot n\cdot \log n)$$ O ( p · n · log n ) symbolic steps, where p is the number of colours and n the number of vertices. We evaluate the algorithm using an experimental implementation based on Binary Decision Diagrams (BDDs) and large (up to $$2^{48}$$ 2 48 ) coloured graphs produced by models appearing in systems biology.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Liang, De-Ming, und Yu-Feng Li. „Learning Safe Graph Construction from Multiple Graphs“. In Communications in Computer and Information Science, 41–54. Singapore: Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-13-2122-1_4.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wallgrün, Jan Oliver. „Simplification and Hierarchical Voronoi Graph Construction“. In Hierarchical Voronoi Graphs, 59–84. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-10345-2_4.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Zhou, Xiang. „CFI Construction and Balanced Graphs“. In Frontiers in Algorithmics, 97–107. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02270-8_12.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mohan, Anshuman, Wei Xiang Leow und Aquinas Hobor. „Functional Correctness of C Implementations of Dijkstra’s, Kruskal’s, and Prim’s Algorithms“. In Computer Aided Verification, 801–26. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81688-9_37.

Der volle Inhalt der Quelle

Annotation:

AbstractWe develop machine-checked verifications of the full functional correctness of C implementations of the eponymous graph algorithms of Dijkstra, Kruskal, and Prim. We extend Wang et al.’s CertiGraph platform to reason about labels on edges, undirected graphs, and common spatial representations of edge-labeled graphs such as adjacency matrices and edge lists. We certify binary heaps, including Floyd’s bottom-up heap construction, heapsort, and increase/decrease priority.Our verifications uncover subtle overflows implicit in standard textbook code, including a nontrivial bound on edge weights necessary to execute Dijkstra’s algorithm; we show that the intuitive guess fails and provide a workable refinement. We observe that the common notion that Prim’s algorithm requires a connected graph is wrong: we verify that a standard textbook implementation of Prim’s algorithm can compute minimum spanning forests without finding components first. Our verification of Kruskal’s algorithm reasons about two graphs simultaneously: the undirected graph undergoing MSF construction, and the directed graph representing the forest inside union-find. Our binary heap verification exposes precise bounds for the heap to operate correctly, avoids a subtle overflow error, and shows how to recycle keys to avoid overflow.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Broß, Jan, Simon Gog, Matthias Hauck und Marcus Paradies. „Fast Construction of Compressed Web Graphs“. In String Processing and Information Retrieval, 116–28. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-67428-5_11.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Park, Sung Gwan, Bastien Cazaux, Kunsoo Park und Eric Rivals. „Efficient Construction of Hierarchical Overlap Graphs“. In String Processing and Information Retrieval, 277–90. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-59212-7_20.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Harutyunyan, Hovhannes A., und Zhiyuan Li. „A Simple Construction of Broadcast Graphs“. In Lecture Notes in Computer Science, 240–53. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-26176-4_20.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Sun, He, und Hong Zhu. „On Construction of Almost-Ramanujan Graphs“. In Combinatorial Optimization and Applications, 197–207. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02026-1_18.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Harutyunyan, Hovhannes A., und Zhiyuan Li. „A New Construction of Broadcast Graphs“. In Algorithms and Discrete Applied Mathematics, 201–11. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-29221-2_17.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Graphs Construction"

Fu, Xiaoyi, Jie Zhang, Hao Yu, Jiachen Li, Dong Chen, Jie Yuan und Xindong Wu. „A Speech-to-Knowledge-Graph Construction System“. In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/777.

Der volle Inhalt der Quelle

Annotation:

This paper presents a HAO-Graph system that generates and visualizes knowledge graphs from a speech in real-time. When a user speaks to the system, HAO-Graph transforms the voice into knowledge graphs with key phrases from the original speech as nodes and edges. Different from language-to-language systems, such as Chinese-to-English and English-to-English, HAO-Graph converts a speech into graphs, and is the first of its kind. The effectiveness of our HAO-Graph system is verified by a two-hour chairman's talk in front of two thousand participants at an annual meeting in the form of a satisfaction survey.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wang, Ruijie, Meng Wang, Jun Liu, Siyu Yao und Qinghua Zheng. „Graph Embedding Based Query Construction Over Knowledge Graphs“. In 2018 IEEE International Conference on Big Knowledge (ICBK). IEEE, 2018. http://dx.doi.org/10.1109/icbk.2018.00009.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bretto, Alain, Luc Gillibert und Bernard Laget. „Symmetric and semisymmetric graphs construction using G-graphs“. In the 2005 international symposium. New York, New York, USA: ACM Press, 2005. http://dx.doi.org/10.1145/1073884.1073895.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Tillman, Bálint, Athina Markopoulou, Carter T. Butts und Minas Gjoka. „Construction of Directed 2K Graphs“. In KDD '17: The 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3097983.3098119.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Harutyunyan, Hovhannes, und Xiangyang Xu. „New Construction of Broardcast Graphs“. In 2007 11th International Conference Information Visualization (IV '07). IEEE, 2007. http://dx.doi.org/10.1109/iv.2007.84.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Hahn, Elad, und Offer Shai. „Construction of Baranov Trusses Using a Single Universal Construction Rule“. In ASME 2016 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2016. http://dx.doi.org/10.1115/detc2016-59134.

Der volle Inhalt der Quelle

Annotation:

The kinematic structure of Baranov trusses has been widely studied in the field of mechanism theory. Baranov trusses are seen as the fundamental planar linkages which are a basis for all other planar linkages. As such, they have been used for synthesis of mechanisms as well as their analysis. However, up until now only a limited number Baranov trusses are known and cataloged. In this paper, a method is proposed for generation of Baranov trusses using a new graph representation suitable for linkages of the sort. This method, named the Universal construction rule, is capable of generating a complete set of all feasible Baranov trusses with any number of links. The method has been proven using a mathematical basis from rigidity theory. It is based on the correspondence between Baranov trusses and Assur groups, which are reformulated in terms of graph theory to be known as Assur graphs.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Shai, Offer. „Topological Synthesis of All 2D Mechanisms Through Assur Graphs“. In ASME 2010 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2010. http://dx.doi.org/10.1115/detc2010-28926.

Der volle Inhalt der Quelle

Annotation:

It is well known that every planar kinematical linkage can be decomposed into basic topological structures referred as Assur Groups. A new reformulation of Assur Group concept into the terminology of rigidity theory, as Assur Graphs, has yielded the development of new theorems and methods. The paper reports on an algorithm for systematic construction of Assur Graph classes, termed fundamental Assur Graphs. From each fundamental Assur Graph it is possible to derive an infinite set of different Assur Graphs. This mapping algorithm is proved to be complete and sound, i.e., all the Assur Graphs appear in the map and each graph in the map is an Assur Graph. Once we possess the mapping of all the Assur Graphs, all valid kinematical linkage topologies can be constructed through various Assur Graph compositions.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Harrold, Mary Jean, Brian Malloy und Gregg Rothermel. „Efficient construction of program dependence graphs“. In the 1993 international symposium. New York, New York, USA: ACM Press, 1993. http://dx.doi.org/10.1145/154183.154268.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Joseph, Shiny, V. Ajitha und Bibin K. Jose. „Construction of some betweenness uniform graphs“. In PROCEEDINGS OF INTERNATIONAL CONFERENCE ON ADVANCES IN MATERIALS RESEARCH (ICAMR - 2019). AIP Publishing, 2020. http://dx.doi.org/10.1063/5.0016847.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Akiba, Takuya, Yoichi Iwata, Yosuke Sameshima, Naoto Mizuno und Yosuke Yano. „Cut Tree Construction from Massive Graphs“. In 2016 IEEE 16th International Conference on Data Mining (ICDM). IEEE, 2016. http://dx.doi.org/10.1109/icdm.2016.0089.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "Graphs Construction"

Casamento, Katherine. Correct-by-Construction Typechecking with Scope Graphs. Portland State University Library, Januar 2000. http://dx.doi.org/10.15760/etd.7145.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Küsters, Ralf, und Ralf Molitor. Computing Most Specific Concepts in Description Logics with Existential Restrictions. Aachen University of Technology, 2000. http://dx.doi.org/10.25368/2022.108.

Der volle Inhalt der Quelle

Annotation:

Computing the most specific concept (msc) is an inference task that can be used to support the 'bottom-up' construction of knowledge bases for KR systems based on description logics. For description logics that allow for number restrictions or existential restrictions, the msc need not exist, though. Previous work on this problem has concentrated on description logics that allow for universal value restrictions and number restrictions, but not for existential restrictions. The main new contribution of this paper is the treatment of description logics with existential restrictions. More precisely, we show that, for the description logic ALE (which allows for conjunction, universal value restrictions, existential restrictions, negation of atomic concepts) the msc of an ABox-individual only exists in case of acyclic ABoxes. For cyclic ABoxes, we show how to compute an approximation of the msc. Our approach for computing the (approximation of the) msc is based on representing concept descriptions by certain trees and ABoxes by certain graphs, and then characterizing instance relationships by homomorphisms from trees into graphs. The msc/approximation operation then mainly corresponds to unraveling the graphs into trees and translating them back into concept descriptions.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Borchmann, Daniel, Felix Distel und Francesco Kriegel. Axiomatization of General Concept Inclusions from Finite Interpretations. Technische Universität Dresden, 2015. http://dx.doi.org/10.25368/2022.219.

Der volle Inhalt der Quelle

Annotation:

Description logic knowledge bases can be used to represent knowledge about a particular domain in a formal and unambiguous manner. Their practical relevance has been shown in many research areas, especially in biology and the semantic web. However, the tasks of constructing knowledge bases itself, often performed by human experts, is difficult, time-consuming and expensive. In particular the synthesis of terminological knowledge is a challenge every expert has to face. Because human experts cannot be omitted completely from the construction of knowledge bases, it would therefore be desirable to at least get some support from machines during this process. To this end, we shall investigate in this work an approach which shall allow us to extract terminological knowledge in the form of general concept inclusions from factual data, where the data is given in the form of vertex and edge labeled graphs. As such graphs appear naturally within the scope of the Semantic Web in the form of sets of RDF triples, the presented approach opens up the possibility to extract terminological knowledge from the Linked Open Data Cloud. We shall also present first experimental results showing that our approach has the potential to be useful for practical applications.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Pinter, Michael R. On Constructing Some Strongly Well-Covered Graphs. Fort Belvoir, VA: Defense Technical Information Center, Januar 1991. http://dx.doi.org/10.21236/ada261848.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Hanish, Sam. The Art of Bond Graph Construction for Transducers. Fort Belvoir, VA: Defense Technical Information Center, September 1999. http://dx.doi.org/10.21236/ada368288.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mathuria, Aakanksha. Approximate Pattern Matching using Hierarchical Graph Construction and Sparse Distributed Representation. Portland State University Library, Januar 2000. http://dx.doi.org/10.15760/etd.7453.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kriegel, Francesco. Learning description logic axioms from discrete probability distributions over description graphs (Extended Version). Technische Universität Dresden, 2018. http://dx.doi.org/10.25368/2022.247.

Der volle Inhalt der Quelle

Annotation:

Description logics in their standard setting only allow for representing and reasoning with crisp knowledge without any degree of uncertainty. Of course, this is a serious shortcoming for use cases where it is impossible to perfectly determine the truth of a statement. For resolving this expressivity restriction, probabilistic variants of description logics have been introduced. Their model-theoretic semantics is built upon so-called probabilistic interpretations, that is, families of directed graphs the vertices and edges of which are labeled and for which there exists a probability measure on this graph family. Results of scientific experiments, e.g., in medicine, psychology, or biology, that are repeated several times can induce probabilistic interpretations in a natural way. In this document, we shall develop a suitable axiomatization technique for deducing terminological knowledge from the assertional data given in such probabilistic interpretations. More specifically, we consider a probabilistic variant of the description logic EL⊥, and provide a method for constructing a set of rules, so-called concept inclusions, from probabilistic interpretations in a sound and complete manner.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Spangler, Stephen, Roger Fujan, Gerald Piotrowski und Brian Baker. A/E/C Graphics Standard : Release 2.2. Engineer Research and Development Center (U.S.), August 2023. http://dx.doi.org/10.21079/11681/47452.

Der volle Inhalt der Quelle

Annotation:

The A/E/C Graphics Standard Release 2.2 has been developed by the Computer-Aided Design/Building Information Modeling Technology Center to document how proper hand-drafting practices can be achieved in advanced modeling. It is through the collection and documentation of these practices that consistent models and drawings shall be achieved throughout the US Army Corps of Engineers (USACE), as well as other federal agencies. In the collection of these practices, various historical USACE District drafting manuals were consulted and compared against practices contained in industry and national standards, with consideration toward whether software can achieve those practices. The documentation of these practices will help to achieve both clear and aesthetically pleasing construction documents.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Amend, Bill. PR-186-123716-R01 Analysis of Line Pipe Manufacturing Materials and Construction Practices. Chantilly, Virginia: Pipeline Research Council International, Inc. (PRCI), August 2017. http://dx.doi.org/10.55274/r0011419.

Der volle Inhalt der Quelle

Annotation:

The objective of this work is to: - Summarize, in spreadsheet format, historical API pipe specification requirements related to metallurgical attributes of the pipe, - Collect pipe property data for a wide range of pipe sizes, grades, and vintages, - Solicit subject matter expert input regarding the likelihood that pipe surface features and other attributes are sufficiently unique to allow pipe manufacturer and/or grade to be unambiguously determined, and to - Describe nondestructive in-situ analysis methods that can be used on operating pipelines to determine metallurgical properties.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Nessim. L51880 Influence of Higher Design Factor on Structural Integrity of X70 and X80 Pipelines. Chantilly, Virginia: Pipeline Research Council International, Inc. (PRCI), August 2001. http://dx.doi.org/10.55274/r0010372.

Der volle Inhalt der Quelle

Annotation:

Most pipelines in Class 1 areas are currently designed to a utilization factor of 0.72 using steel grades of up to X70. Using higher strength steels and/or a higher design factor can reduce the wall thickness and construction cost of such pipelines. High strength steels tend to have high yield-to-tensile ratios and lower overall post-yield tangent stiffness. This raises concerns about the potential for excessive plastic deformations under high hydrostatic test pressures. Combined with a high design factor, high steel grades will also lead to thinner pipe walls and reduced tolerance to thickness-dependent failure mechanisms such as corrosion, cracks, and dent-gouges. This effort evaluates the ability of a newer pipelines to safely operate at higher yield stresses.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!