Relevant bibliographies by topics / Construction de graphes

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Construction de graphes'

Author: Grafiati
Published: 25 May 2024

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Construction de graphes.'

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.

Journal articles on the topic "Construction de graphes"

1

Díaz Villalba, Alejandro. "Comment outiller l’étude des autorités avec l’analyse de réseaux dans les grammaires françaises des XVIe et XVIIe siècles." SHS Web of Conferences 138 (2022): 03003. http://dx.doi.org/10.1051/shsconf/202213803003.

Full text
Abstract:
L’article propose d’outiller, par le recours à l’analyse de réseaux, l’étude des références, c’est-à-dire les mentions et les citations d’autorités dans les textes métalinguistiques. Il s’agit, d’une part, de présenter les principes méthodologiques qui ont présidé à l’élaboration d’une visualisation sous forme de graphes de réseau : la modélisation et la construction d’une base de données de références et la génération du graphe dans un logiciel approprié. Il est question, d’autre part, de décrire les aspects liés à l’interprétation des graphes de réseaux, le but étant d’explorer le potentiel de l’outil dans l’histoire des idées linguistiques.
APA, Harvard, Vancouver, ISO, and other styles
2

Pigeon, Émilie. "Réseaux sociaux catholiques et construction identitaire dans les Pays d’en haut : l’exemple du fort Michilimackinac (1741-1821)." Francophonies d'Amérique, no. 40-41 (March 8, 2018): 83–112. http://dx.doi.org/10.7202/1043699ar.

Full text
Abstract:
Cet article explore le rôle clé qu’ont joué les femmes dans la construction de réseaux sociaux catholiques en marge du commerce des fourrures dans les Pays d’en haut entre 1741 et 1821. Nous constatons que le rite du baptême au fort Michilimackinac devint à la fois un outil religieux et économique. En mariant l’histoire sociale aux humanités numériques, nous observons, par l’entremise de graphes, la construction de liens idéologiques et commerciaux au sein de nombreux réseaux sociaux historiques. Nous dépassons la métaphore du réseau en utilisant un logiciel d’analyse de réseaux sociaux (nommé visone) qui permet de voir et de comprendre comment une femme en particulier, Louise Dubois, se servit du catholicisme pour améliorer sa situation sociale dans la région des Grands Lacs. Les femmes autochtones et allochtones devinrent marraines à plusieurs reprises dans les Pays d’en haut. Ce faisant, elles tissèrent des liens stratégiques, se rapprochant des communautés autochtones avoisinantes grâce au baptême, premier sacrement d’initiation à la religion catholique.
APA, Harvard, Vancouver, ISO, and other styles
3

CHABI, Tayeb. "Identification des scenarios à la performance de l’entreprise par la productivité, rentabilité et compétitivité suivant le modèle Morphol : Cas d’un échantillon d’entreprise." Dirassat Journal Economic Issue 6, no. 1 (January 1, 2015): 291–307. http://dx.doi.org/10.34118/djei.v6i1.547.

Full text
Abstract:
L’objet de la présente recherche empirique est d’identifier les scénarios clés à la réalisation de la performance au d’une entreprise. L’étude est réalisée sur un échantillon d’entreprises de la région de la Soummam. Pour mener notre étude, nous avons élaboré un questionnaire pour formuler un champ d’hypothèses et leurs évaluations par les entreprises enquêtées, ensuite un champ utile de réponses est réalisé suivant le modèle « Morphol » GODET. M, (2001). Les résultats de notre enquête ont permis la construction d’un système de variables et d’indicateurs, la visualisation des résultats sur des graphes et des plans de proximité et ensuit procéder à leur analyse et à l’identification des scénarios clés à la performance dans les entreprises enquêtées.
APA, Harvard, Vancouver, ISO, and other styles
4

Garcia-Debanc, Claudine, Myriam Bras, and Laure Vieu. "Annotation de la cohérence dans des textes d’élèves et jugements de cohérence d’enseignants du primaire." SHS Web of Conferences 186 (2024): 03003. http://dx.doi.org/10.1051/shsconf/202418603003.

Full text
Abstract:
Au croisement des tâches « cohérence » et « formation des enseignants » de l’ANR ECalm, cette contribution porte sur la cohérence de textes d’élèves d’école primaire et de début de collège. Elle met en regard des annotations discursives prenant appui sur une extension de la SDRT (Segmented Discourse Representation Theory) permettant l’annotation de points d’incohérence et des jugements de cohérence formulés par des enseignant.e.s du premier degré dans le cadre d’une session de formation continue. La cohérence est envisagée comme une propriété de la représentation de discours que se construit celui qui interprète le texte tout au long de sa lecture. Le corpus analysé est issu du corpus RESOLCO, l’un des corpus de textes scolaires collectés, transcrits et annotés dans le cadre de l’ANR E-Calm. Ce corpus est constitué de textes en réponse à une même consigne d’écriture : une tâche-problème demandant aux élèves la rédaction d’un texte narratif impliquant la résolution d’anaphores de divers types. Cette analyse comparative vise tout d’abord à mettre à l’épreuve le modèle d’annotation discursive. Les incohérences visualisées dans les représentations sémantiques issues de l’analyse linguistique sous forme de graphes sont également perçues par les enseignant.e.s confronté.e.s à la lecture de ces mêmes textes, ce qui permet de valider le modèle. L’analyse des échanges à l’intérieur d’un groupe d’enseignants fait apparaitre que l’un des deux dispositifs proposés favorise la mise en place chez les enseignants d’une posture de lecteur à la recherche de la construction de la cohérence et non d’évaluateur en référence à une norme linguistique et leur permet d’interroger les calculs interprétatifs permettant de formuler des jugements de cohérence. La présentation des graphes aux enseignant.e.s les aide ensuite à objectiver leurs intuitions linguistiques et leurs jugements de cohérence.
APA, Harvard, Vancouver, ISO, and other styles
5

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

Full text
Abstract:
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, and other styles
6

HALPERN, M. B., and N. A. OBERS. "NEW SUPERCONFORMAL CONSTRUCTIONS ON TRIANGLE-FREE GRAPHS." International Journal of Modern Physics A 07, no. 29 (November 20, 1992): 7263–86. http://dx.doi.org/10.1142/s0217751x92003331.

Full text
Abstract:
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, and other styles
7

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, no. 1 (January 1, 2015): 101–8. http://dx.doi.org/10.2478/aicu-2014-0026.

Full text
Abstract:
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, and other styles
8

Lorenzen, Kate. "Cospectral constructions for several graph matrices using cousin vertices." Special Matrices 10, no. 1 (June 28, 2021): 9–22. http://dx.doi.org/10.1515/spma-2020-0143.

Full text
Abstract:
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, and other styles
9

Regonati, F., and N. Zagaglia Salvi. "Some constructions of $\lambda$-minimal graphs." Czechoslovak Mathematical Journal 44, no. 2 (1994): 315–23. http://dx.doi.org/10.21136/cmj.1994.128459.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Haythorpe, M., and A. Newcombe. "Constructing families of cospectral regular graphs." Combinatorics, Probability and Computing 29, no. 5 (June 30, 2020): 664–71. http://dx.doi.org/10.1017/s096354832000019x.

Full text
Abstract:
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, and other styles
More sources

Dissertations / Theses on the topic "Construction de graphes"

1

Barakat-Barbieri, Bruno. "Vers une construction automatique de graphes de concepts." Châtenay-Malabry, Ecole centrale de Paris, 1992. http://www.theses.fr/1992ECAP0416.

Full text
Abstract:
Ce travail propose une méthode de construction automatique de graphes de concepts à partir d'une base de données en texte intégral. La terminologie significative est extraite et normalisée à l'aide d'un traitement linguistique automatique. Le graphe de concepts ainsi construit est un arbre dont les nœuds sont les termes retenus. Les relations sont de nature générique-spécifique. Dans un premier temps, après une étude de la détermination de l'unité sémantique optimale, on introduit la notion de champ sémantique fondée sur la notion de concurrence de termes au sein de cette unité. Puis, après avoir mis en évidence les inconvénients de cette première approche, une nouvelle notion est présentée: les ensembles sémantiques. Ceux-ci sont moins dépendants de la répartition par thèmes des documents. L'étude du recouvrement de ces ensembles sémantiques nous permet de mettre en évidence les liens unissant les concepts entre eux. Une solution pour l'identification des polysèmes est également proposée. Enfin, l'auteur présente une discussion sur la qualité des résultats et les limites de cette approche
APA, Harvard, Vancouver, ISO, and other styles
2

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.

Full text
Abstract:
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, and other styles
3

Bloyet, Nicolas. "Caractérisation et plongement de sous-graphes colorés : application à la construction de modèles structures à activité (QSAR)." Thesis, Lorient, 2019. http://www.theses.fr/2019LORIS546.

Full text
Abstract:
Dans le domaine de la chimie, il est intéressant de pouvoir estimer des propriétés physico- chimiques de molécules, notamment pour des applications industrielles. Celles-ci sont difficiles à estimer par simulations physique, présentant une complexité temporelle prohibitive. L'émergence des données (publiques ou privées) ouvre toutefois de nouvelles perspectives pour le traitement de ces problèmes par des méthodes statistiques et d'apprentissage automatique. La principale difficulté réside dans la caractérisation des molécules : celles-ci s'apparentent davantage à un réseau d'atomes (autrement dit un graphe coloré) qu'à un vecteur. Or, les méthodes de modélisation statistiques traitent usuellement avec des observations encodées comme telles, d'où la nécessité de méthodes spécifiques, nommées relations structures-activité, traitant des observations encodées sous forme de graphes. Le but de cette thèse est de tirer parti des corpus publics pour apprendre les meilleures représentations possibles de ces structures, et de transférer cette connaissance globale vers des jeux de données plus restreints. Nous nous inspirons pour ce faire de méthodes utilisées en traitement automatique des langages naturels. Pour les mettre en œuvre, des travaux d'ordre plus théorique ont été nécessaires, notamment sur le problème d'isomorphisme de graphes. Les résultats obtenus sur des tâches de classification/régression sont au moins compétitifs avec l'état de l'art, voire meilleurs, en particulier sur des jeux de données restreints, attestant des possibilités d'apprentissage par transfert sur ce domaine
In the field of chemistry, it is interesting to be able to estimate the physicochemical properties of molecules, especially for industrial applications. These are difficult to estimate by physical simulations, as their implementation often present prohibitive time complexity. However, the emergence of data (public or private) opens new perspectives for the treatment of these problems by statistical methods and machine learning. The main difficulty lies in the characterization of molecules: these are more like a network of atoms (in other words a colored graph) than a vector. Unfortunately, statistical modeling methods usually deal with observations encoded as such, hence the need for specific methods able to deal with graphs- encoded observations, called structure-activity relationships. The aim of this thesis is to take advantage of public corpora to learn the best possible representations of these structures, and to transfer this global knowledge to smaller datasets. We adapted methods used in automatic processing of natural languages to achieve this goal. To implement them, more theoretical work was needed, especially on the graph isomorphism problem. The results obtained on classification / regression tasks are at least competitive with the state of the art, and even sometimes better, in particular on restricted data sets, attesting some opportunities for transfer learning in this field
APA, Harvard, Vancouver, ISO, and other styles
4

Said, Bilal. "Réécriture de graphes pour la construction de modèles en logique modale." Phd thesis, Université Paul Sabatier - Toulouse III, 2010. http://tel.archives-ouvertes.fr/tel-00466115.

Full text
Abstract:
Pour modéliser le fonctionnement d'un système, décrire une situation ou représenter des idées, on se met intuitivement à dessiner des bulles et les lier par des flèches sous forme de graphes étiquetés. Les logiques modales constituent un cadre formel expressif et extensible qui permet de définir ces graphes sous forme de « modèles », et d'exprimer certaines propriétés de ces graphes sous forme de « formules » afin de pouvoir raisonner là-dessus: model checking, test de satisfiabilité ou de validité, etc. Pour des formules et modèles de tailles importantes, ces tâches deviennent compliquées. De ce fait, un outil permettant de les réaliser automatiquement s'avère nécessaire. LoTREC en est un exemple. Il permet à son utilisateur de créer sa propre méthode de preuve, grâce à un langage simple et de haut niveau, sans avoir besoin d'aucune expertise spécifique en programmation. Durant ma thèse, j'ai revu le travail qui était déjà accompli dans LoTREC et j'ai apporté de nouvelles extensions qui s'avéraient nécessaires pour pouvoir traiter de nouvelles logiques (K.alt1, universal modality, Hybrid Logic HL(@),Intuitionistic logic, Public Announcement Logic, ...) et offrir à l'utilisateur certaines nouvelles techniques. D'autre part, j'ai examiné les origines de LoTREC dans le monde de réécriture de graphes et j'ai spécifié la sémantique de son moteur de réécriture. Cela a permis d'éclaircir comment l'on peut hériter dans nos méthodes de preuve des résultats et des propriétés théoriques déjà bien établies dans le domaine de la réécriture de graphes.
APA, Harvard, Vancouver, ISO, and other styles
5

Jin, Xiong. "Construction et analyse multifractale de fonctions aléatoires et de leurs graphes." Phd thesis, Université Paris Sud - Paris XI, 2010. http://tel.archives-ouvertes.fr/tel-00841501.

Full text
Abstract:
Cette thèse est consacrée à la construction et l'analyse multifractale de fonctions aléatoires et de leurs graphes. La construction de ces objets se fait dans le cadre de la théorie des T-martingales de Kahane, et plus spécifiquement des [0, 1]-martingales. Cette théorie est fréquemment utilisée pour construire des martingales à valeurs dans les mesures de Borel positives dont la limite soit presque sûrement singulière par rapport à la mesure de Lebesgue. Ceci se fait en perturbant cette dernière à l'aide d'une suite de densités aléatoires qui sont des martingales positives d'espérance 1. Ici, nous autorisons ces martingales à prendre des valeurs complexes, et plutôt que des martingales à valeurs dans les mesures, nous considérons des martingales à valeurs dans les fonctions continues à valeurs complexes, puis la question de leur convergence uniforme presque sûre. Nous obtenons une condition suffisante de convergence pour les éléments d'une large classe de [0, 1]-martingales complexes. Les limites non dégénérées sont toutes candidates à être des fonctions multifractales. L'étude de leur nature multifractale révèle de nouvelles diffiultés. Nous la menons de façon complète dans le cas des "cascades b-adiques indépendantes" complexes. Ceci conduit à de nouveaux phénomènes. En particulier, nous construisons des fonctions continues statistiquement autosimilaires dont le spectre de singularité est croissant et entièrement supporté par l'intervalle [0;\infty]. Nous considérons également de nouveaux spectres de singularité associés au graphe, à l'image, ainsi qu'aux ensembles de niveau d'une fonction multifractale f donnée. Ces spectres s'obtiennent de la façon suivante. Soit Eh l'ensemble iso-Hölder de f associé à l'exposant h. Soit h le sous-ensemble du graphe de f obtenu en y relevant Eh. Pour tout h, on cherche la dimension de Hausdorff de h, celle de f(Eh), et celle des ensembles du type h \ Ly, où Ly est l'ensemble de niveau y de f. Pour les cascades b-adiques indépendantes non conservatives à valeurs réelles, nous obtenons presque sûrement les spectres associés au graphe et à l'image, et pour les spectres associés aux ensembles de niveau, nous obtenons un résultat en regardant des lignes de niveau dans "Lebesgue presque toute direction". Enfin, nous considérons les mêmes questions que précédemment pour une autre classe de foncions aléatoires multifractales obtenues comme séries d'ondelettes pondérées par des mesures de Gibbs. Nous obtenons presque sûrement les spectres associés au graphe et à l'image.
APA, Harvard, Vancouver, ISO, and other styles
6

Andriyanova, Iryna. "Etude d'une certaine construction des codes definis par les graphes: codes TLDPC." Phd thesis, Télécom ParisTech, 2006. http://pastel.archives-ouvertes.fr/pastel-00002465.

Full text
Abstract:
Ce travail est consacr'e `a l'analyse et la construction de codes d´efinis par des graphes dans le but d'obtenir des familles de codes ayant, pour une complexit´e de d´ecodage faible, de tr`es bonnes performances pour une large plage de rapports signal-`a-bruit. Nous nous int´eressons `a une famille de codes que nous appelons TLDPC (pour Tailbiting Trellis Low-Density Parity Check) qui contient, comme sous-familles, `a la fois les Turbo codes de Berrou et Glavieux et les codes de Gallager appel´es aussi codes LDPC. La premi`ere partie de cette th`ese est consacr´ee `a l'´etude des codes TLDPC binaires. Nous nous sommes int´eress´es au caract`ere asymptotiquement bon de ces codes et avons obtenus des conditions n´ecessaires ou suffisantes en ´etudiant les polyn
APA, Harvard, Vancouver, ISO, and other styles
7

Loi, Michel. "Outils pour la construction de graphes de tâches acycliques à gros grain." Lyon 1, 1996. http://www.theses.fr/1996LYO10260.

Full text
Abstract:
L'objet de cette these est de creer un lien entre les techniques d'ordonnancement basees sur les graphes de taches acycliques a gros grain, et celles utilisees en parallelisation automatique. Dans une premiere partie une etude des techniques existantes est proposee. La seconde partie presente differents algorithmes de generation de code et de comptage d'iteration. Une methode permettant de generer des bornes de boucles efficaces est proposee. La troisieme partie presente un modele de calcul parallele, le graphe de taches parametre, qui est une representation independante de la taille du probleme, de graphes de taches acycliques frequemment utilises. Differentes techniques qui permettent d'automatiser la construction du graphe de taches parametre : partir d'un programme sequentiel a controle de flot statique annote par l'utilisateur sont ensuite proposees. Nous montrons comment des informations necessaires a l'ordonnancement peuvent etre derivees. Une annexe presente pluspyr, un outil d'aide au developpement d'applications paralleles integrant les differentes techniques exposees dans cette these
APA, Harvard, Vancouver, ISO, and other styles
8

Andriyanova, Iryna. "Etude d'une certaine construction des codes définis par les graphes : codes TLDPC." Paris, ENST, 2006. http://www.theses.fr/2006ENST0042.

Full text
Abstract:
Ce travail est consacré à l’analyse et à la construction de codes définis par des graphes dans le but d’obtenir des familles de codes ayant, pour une complexité de décodage faible, de trés bonnes performances pour une large plage de rapports signal-à-bruit. Nous nous intéressons à une famille de codes TLDPC (Tail-biting Trellis Low-Density Parity Check) qui contient, comme sous-familles, à la fois les Turbo codes de Berrou et Glavieux et les codes de Gallager appelés aussi codes LDPC. La première partie de la thèse est consacrée à l'étude du caractère asymptotiquement bon des codes TLDPC binaires. Nous avons obtenu des conditions nécessaires et suffisantes sur ce caractère qui nous ont donné des bornes sur la proportion des noeuds de degré 2. Nous avons ensuite optimisé la distribution des noeuds des autres variables et nous obtenons de trés bonnes performances. Dans la deuxième partie, nous étudions certains codes LDPC et TLDPC non-binaires. Nous y présentons une famille de codes TLDPC non-binaires, avec une structure simple dont la pente des courbes de taux d'erreur dans la région de faible rapport signal-à-bruit est plus forte que pour les codes binaires correspondants. Notons qu’un code LDPC ayant au moins deux symboles de degré 2 par équation de parité peut être vu et décodé comme un code TLDPC avec des symboles de degré 1. Pour les codes de cycles d’un graphe, cette façon de faire nécessite beaucoup moins d'itérations de décodage. En introduisant dans la structure des codes de cycles d’un graphe des noeuds de degré 1, nous obtenons pour le canal à effacements en autorisant une petite fraction de symboles effacés aprés décodage, une famille de codes dont les performances se rapprochent encore des limites théoriques de Shannon
This study is dedicated to the analysis and the design of sparse-graph codes in order to construct codes having high performances both in waterfall and error-floor regions under an iterative decoding algorithm of low complexity. In particular, we explore a class of Tail-biting trellis LDPC (TLDPC) codes involving the class of turbo codes of Berrou and Glavieux as well as the class of codes of Gallager known as LDPC codes. In the first part of the thesis, binary TLDPC codes are investigated. We found sufficient and necessary conditions to ensure that they are asymptotically good by calculating their average weight enumerator and studying a certain graph in which the cycles correspond to potentially low weight codewords. These conditions give us an upper bound on the fraction of degree-2 nodes in the Tanner graph. By keeping the fraction of degree-2 nodes below the upper bound, we optimised the degree distribution of other variable nodes by EXIT chart techniques and thus we obtained good performances under standard iterative decoding algorithm (belief propagation). In the second part of the thesis, some non-binary TLDPC and LDPC codes are investigated. We propose a family of non-binary TLDPC codes with a very simple structure and a steep waterfall region. We also noticed that any LDPC code with at least two degree-2 symbols per parity-check equation can be represented as a TLDPC code with symbols in degree 1 in its structure. Thus, it can be decoded like a TLDPC code. In the case of cycle codes, such a decoding decreases significantly the number of iterations while the iterative decoding threshold does not seem to change. Moreover, by allowing a constant fraction of degree 1 symbols for this class of codes and a small fraction of erased bits after decoding over binary erasure channel, we obtained codes with improved iterative decoding performances
APA, Harvard, Vancouver, ISO, and other styles
9

Andriyanova, Iryna. "Étude d'une certaine construction des codes définis par les graphes : codes TLDPC /." Paris : École nationale supérieure des télécommunications, 2007. http://catalogue.bnf.fr/ark:/12148/cb41087138x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Vonseel, Audrey. "Hyperbolicité et bouts des graphes de Schreier." Thesis, Strasbourg, 2017. http://www.theses.fr/2017STRAD025/document.

Full text
Abstract:
Cette thèse est consacrée à l'étude de la topologie à l'infini d'espaces généralisant les graphes de Schreier. Plus précisément, on considère le quotient X/H d'un espace métrique géodésique propre hyperbolique X par un groupe quasi-convexe-cocompact H d'isométries de X. On montre que ce quotient est un espace hyperbolique. Le résultat principal de cette thèse indique que le nombre de bouts de l'espace quotient X/H est déterminé par les classes d'équivalence sur une sphère de rayon explicitement calculable. Dans le cadre de la théorie des groupes, on montre que l'on peut construire explicitement des groupes et des sous-groupes pour lesquels il n'existe pas d'algorithme permettant de déterminer le nombre de bouts relatifs. Si le sous-groupe est quasi-convexe, on donne un algorithme permettant de calculer le nombre de bouts relatifs
This thesis is devoted to the study of the topology at infinity of spaces generalizing Schreier graphs. More precisely, we consider the quotient X/H of a geodesic proper hyperbolic metric space X by a quasiconvex-cocompact group H of isometries of X. We show that this quotient is a hyperbolic space. The main result of the thesis indicates that the number of ends of the quotient space X/H is determined by equivalence classes on a sphere of computable radius. In the context of group theory, we show that one can construct explicitly groups and subgroups for which there are no algorithm to determine the number of relative ends. If the subgroup is quasiconvex, we give an algorithm to compute the number of relative ends
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Construction de graphes"

1

Guide des sciences et technologies industrielles: Dessin industriel et graphes, matériaux, éléments de construction ou de machines... [La Plaine-Saint-Denis]: AFNOR, 2004.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

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

Full text
Abstract:
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, and other styles
3

D, Mahoney William, and R. S. Means Company, eds. Means graphic construction standards. Kingston, MA: R.S. Means Co., 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Graphic guide to frame construction. 3rd ed. Newtown, CT: Taunton Press, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kang, Kaffee. Graphic guide to frame construction. Upper Saddle River, N.J: Prentice Hall, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

name, No. Architectural graphic standards for residential construction. New York, NY: John Wiley & Sons, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Architects, American Institute of, ed. Architectural graphic standards for residential construction. 2nd ed. Hoboken, N.J: Wiley, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Janet, Rumbarger, Vitullo Richard, and Ramsey Charles George 1884-1963, eds. Architectural graphic standards for residential construction. New York: John Wiley & Sons, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

1893-1960, Sleeper Harold Reeve, Ambrose James E, Ramsey Charles George 1884-1963, and American Institute of Architects, eds. Construction details from Architectural graphic standards. New York: J. Wiley, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

M, Giglio Nina, ed. Graphic Standards Field Guide to Residential Construction. Hoboken, New Jersey: John Wiley & Sons, Inc., 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Construction de graphes"

1

Beneš, Nikola, Luboš Brim, Samuel Pastva, and 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.

Full text
Abstract:
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, and other styles
2

Mohan, Anshuman, Wei Xiang Leow, and 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.

Full text
Abstract:
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, and other styles
3

Holzinger, Andreas, Anna Saranti, Anne-Christin Hauschild, Jacqueline Beinecke, Dominik Heider, Richard Roettger, Heimo Mueller, Jan Baumbach, and Bastian Pfeifer. "Human-in-the-Loop Integration with Domain-Knowledge Graphs for Explainable Federated Deep Learning." In Lecture Notes in Computer Science, 45–64. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-40837-3_4.

Full text
Abstract:
AbstractWe explore the integration of domain knowledge graphs into Deep Learning for improved interpretability and explainability using Graph Neural Networks (GNNs). Specifically, a protein-protein interaction (PPI) network is masked over a deep neural network for classification, with patient-specific multi-modal genomic features enriched into the PPI graph’s nodes. Subnetworks that are relevant to the classification (referred to as “disease subnetworks”) are detected using explainable AI. Federated learning is enabled by dividing the knowledge graph into relevant subnetworks, constructing an ensemble classifier, and allowing domain experts to analyze and manipulate detected subnetworks using a developed user interface. Furthermore, the human-in-the-loop principle can be applied with the incorporation of experts, interacting through a sophisticated User Interface (UI) driven by Explainable Artificial Intelligence (xAI) methods, changing the datasets to create counterfactual explanations. The adapted datasets could influence the local model’s characteristics and thereby create a federated version that distils their diverse knowledge in a centralized scenario. This work demonstrates the feasibility of the presented strategies, which were originally envisaged in 2021 and most of it has now been materialized into actionable items. In this paper, we report on some lessons learned during this project.
APA, Harvard, Vancouver, ISO, and other styles
4

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Mitchell, Charles F. "Graphic Statics." In Building Construction and Drawing 1906, 396–426. 4th ed. London: Routledge, 2022. http://dx.doi.org/10.1201/9781003261674-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Larsen, Casper Abild, Simon Meldahl Schmidt, Jesper Steensgaard, Anna Blume Jakobsen, Jaco van de Pol, and Andreas Pavlogiannis. "A Truly Symbolic Linear-Time Algorithm for SCC Decomposition." In Tools and Algorithms for the Construction and Analysis of Systems, 353–71. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30820-8_22.

Full text
Abstract:
AbstractDecomposing a directed graph to its strongly connected components (SCCs) is a fundamental task in model checking. To deal with the state-space explosion problem, graphs are often represented symbolically using binary decision diagrams (BDDs), which have exponential compression capabilities. The theoretically-best symbolic algorithm for SCC decomposition is Gentilini et al’s $$\textsc {Skeleton}$$ S K E L E T O N algorithm, that uses O(n) symbolic steps on a graph of n nodes. However, $$\textsc {Skeleton}$$ S K E L E T O N uses $$\Theta (n)$$ Θ ( n ) symbolic objects, as opposed to (poly-)logarithmically many, which is the norm for symbolic algorithms, thereby relinquishing its symbolic nature. Here we present $$\textsc {Chain}$$ C H A I N , a new symbolic algorithm for SCC decomposition that also makes O(n) symbolic steps, but further uses logarithmic space, and is thus truly symbolic. We then extend $$\textsc {Chain}$$ C H A I N to $$\textsc {ColoredChain}$$ C O L O R E D C H A I N , an algorithm for SCC decomposition on edge-colored graphs, which arise naturally in model-checking a family of systems. Finally, we perform an experimental evaluation of $$\textsc {Chain}$$ C H A I N among other standard symbolic SCC algorithms in the literature. The results show that $$\textsc {Chain}$$ C H A I N is competitive on almost all benchmarks, and often faster, while it clearly outperforms all other algorithms on challenging inputs.
APA, Harvard, Vancouver, ISO, and other styles
7

Meyer, Roland, Thomas Wies, and Sebastian Wolff. "Make Flows Small Again: Revisiting the Flow Framework." In Tools and Algorithms for the Construction and Analysis of Systems, 628–46. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30823-9_32.

Full text
Abstract:
AbstractWe present a new flow framework for separation logic reasoning about programs that manipulate general graphs. The framework overcomes problems in earlier developments: it is based on standard fixed point theory, guarantees least flows, rules out vanishing flows, and has an easy to understand notion of footprint as needed for soundness of the frame rule. In addition, we present algorithms for automating the frame rule, which we evaluate on graph updates extracted from linearizability proofs for concurrent data structures. The evaluation demonstrates that our algorithms help to automate key aspects of these proofs that have previously relied on user guidance or heuristics.
APA, Harvard, Vancouver, ISO, and other styles
8

Zohhadi, Nima, Nirupam Aich, Fabio Matta, Navid B. Saleh, and Paul Ziehl. "Graphene Nanoreinforcement for Cement Composites." In Nanotechnology in Construction, 265–70. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-17088-6_34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Fraga López, Francisco Javier. "Detailed Knowledge of Territory: Construction and Army." In Graphic Horizons, 181–89. Cham: Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-57583-9_23.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Construction de graphes"

1

Fu, Xiaoyi, Jie Zhang, Hao Yu, Jiachen Li, Dong Chen, Jie Yuan, and 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.

Full text
Abstract:
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, and other styles
2

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.

Full text
Abstract:
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, and other styles
3

Hahn, Elad, and 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.

Full text
Abstract:
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, and other styles
4

Stewart, Michael, and Wei Liu. "Seq2KG: An End-to-End Neural Model for Domain Agnostic Knowledge Graph (not Text Graph) Construction from Text." In 17th International Conference on Principles of Knowledge Representation and Reasoning {KR-2020}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/kr.2020/77.

Full text
Abstract:
Knowledge Graph Construction (KGC) from text unlocks information held within unstructured text and is critical to a wide range of downstream applications. General approaches to KGC from text are heavily reliant on the existence of knowledge bases, yet most domains do not even have an external knowledge base readily available. In many situations this results in information loss as a wealth of key information is held within "non-entities". Domain-specific approaches to KGC typically adopt unsupervised pipelines, using carefully crafted linguistic and statistical patterns to extract co-occurred noun phrases as triples, essentially constructing text graphs rather than true knowledge graphs. In this research, for the first time, in the same flavour as Collobert et al.'s seminal work of "Natural language processing (almost) from scratch" in 2011, we propose a Seq2KG model attempting to achieve "Knowledge graph construction (almost) from scratch". An end-to-end Sequence to Knowledge Graph (Seq2KG) neural model jointly learns to generate triples and resolves entity types as a multi-label classification task through deep learning neural networks. In addition, a novel evaluation metric that takes both semantic and structural closeness into account is developed for measuring the performance of triple extraction. We show that our end-to-end Seq2KG model performs on par with a state of the art rule-based system which outperformed other neural models and won the first prize of the first Knowledge Graph Contest in 2019. A new annotation scheme and three high-quality manually annotated datasets are available to help promote this direction of research.
APA, Harvard, Vancouver, ISO, and other styles
5

Schatz, Y., and B. Domer. "Optimizing IFC-structured Data Graph for Code Compliance Checking." In The 29th EG-ICE International Workshop on Intelligent Computing in Engineering. EG-ICE, 2022. http://dx.doi.org/10.7146/aul.455.c208.

Full text
Abstract:
Construction code compliance checking requires applying specific computerinterpretable rules on datasets. A proposed solution is to represent IFC data as an RDF graph and perform rule-checking using a rule engine. However, the generated graph has a complicated structure since it follows the IFC data model. Consequently, the definition of compliance rules can be challenging, and rules are sensitive to variations of input graphs structure. A methodology is proposed to optimize graphs by giving them a predefined or "standardized" structure. A case study shows that optimization allows the formulation of more straightforward and easier-to-write compliance rules, applicable to all standardized graphs regardless of the initially used BIM authoring tool. In addition, graph size is significantly reduced.
APA, Harvard, Vancouver, ISO, and other styles
6

León, Jared. "A generalization of the block decomposition for k-connected graphs." In Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2022. http://dx.doi.org/10.5753/etc.2022.223106.

Full text
Abstract:
The decomposition of a connected graph by the set of its cut-vertices, sometimes called the "block decomposition" or "block tree" of a graph, is a well known and basic concept in graph theory. This decomposition, however, does not provide any meaningful information when applied to a $k$-connected graph for $k \geq 2$. There has been a number of attempts to generalize the construction of the block decomposition of a graph for the case of $k$-connected graphs. In this work, we present an outline of one such attempt by Karpov. We also present some applications of this decomposition to the study of planarity, the chromatic number, and critically $2$-connected graphs.
APA, Harvard, Vancouver, ISO, and other styles
7

Hahn, Elad, and Offer Shai. "A Single Universal Construction Rule for the Structural Synthesis of Mechanisms." 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-59133.

Full text
Abstract:
In the field of structural synthesis of mechanisms several synthesis methods have been developed using different approaches. One of the more interesting approaches was that of bottom-up construction via the combination of modular structural groups, known as Assur groups. This approach is combined with new graph representations of mechanisms taken from rigidity theory, capable of representing all the different types of planar and spatial mechanisms. With the strong mathematical base of rigidity theory, a new synthesis method is proposed based on Assur groups, which are reformulated in terms of graph theory and renamed Assur Graphs. Using a single universal construction rule, Assur Graphs of different types and of any number of links are constructed, creating a complete set of building blocks for the synthesis of feasible mechanisms. As its name implies, the single universal construction is applicable for mechanisms of all types of joints and links, for planar or spatial motion.
APA, Harvard, Vancouver, ISO, and other styles
8

Hahn, Elad, Adnan Sljoka, and Andreas Mueller. "Applications of Constraint Graphs and Assur Groups in Mechanism Analysis and Synthesis." In ASME 2017 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2017. http://dx.doi.org/10.1115/detc2017-67925.

Full text
Abstract:
Assur groups and correspondingly Assur graphs have key attributes that make them important for the analysis and synthesis of linkages. The topology of linkages (more precisely the existence of constraints between links) in general can be represented by various types of constraint graphs. The concept of Assur graphs applies to any such graph and thus their peculiar features can be exploited. Despite of these potential benefits the relevant methods and tools are scattered in the literature. The aim of this paper is to provide an overview of the use of constraint graphs including recent results on the construction of Assur graphs.
APA, Harvard, Vancouver, ISO, and other styles
9

Vajapeyam, Sridhar, and Michael Keefe. "Triangulated Surface Construction From Scattered 3-D Points." In ASME 1992 International Computers in Engineering Conference and Exposition. American Society of Mechanical Engineers, 1992. http://dx.doi.org/10.1115/cie1992-0087.

Full text
Abstract:
Abstract A three-dimensional analog to the Gabriel Graph structure is defined and an algorithmic procedure for the construction of a triangulated surface from scattered data points in three dimensions is developed based on the concept on three-dimensional Gabriel Graphs. The algorithm does not require the points to be in the form of a grid or on contours. The closest point 3-D Delaunay triangulation of the points is first constructed and the Delaunay triangles that satisfy the Gabriel Graph criterion are identified. From this set of triangles, extraneous triangles are removed, resulting in a triangulated open surface passing through all the given data points. This surface can then be subjected to smoothing algorithms if necessary and a smooth surface of the desired continuity can be constructed using available interpolation techniques. The algorithm can be used for constructing surfaces from scattered data in mechanical design, geographic terrain modeling and modeling biological surfaces from CT scans and MRI scans.
APA, Harvard, Vancouver, ISO, and other styles
10

Galiana, Mercedes, Nuria Rosa, and Eloísa González. "TEACHING ARCHITECTURAL CONSTRUCTIONS THROUGH DIGITALIZED HAND DRAWING: CONSTRUCTION DETAILS WITH GRAPHIC TABLET." In 13th annual International Conference of Education, Research and Innovation. IATED, 2020. http://dx.doi.org/10.21125/iceri.2020.0788.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Construction de graphes"

1

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

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

Full text
Abstract:
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, and other styles
4

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Spangler, Stephen, Roger Fujan, Gerald Piotrowski, and 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.

Full text
Abstract:
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, and other styles
6

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.

Full text
Abstract:
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, and other styles
7

Küsters, Ralf, and 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.

Full text
Abstract:
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, and other styles
8

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Chuchel, B. A. TURBOSEIS---An interactive program for constructing and editing models of seismic refraction traveltime data using a color-graphics terminal. Office of Scientific and Technical Information (OSTI), December 1989. http://dx.doi.org/10.2172/138346.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Makhachashvili, Rusudan K., Svetlana I. Kovpik, Anna O. Bakhtina, and Ekaterina O. Shmeltser. Technology of presentation of literature on the Emoji Maker platform: pedagogical function of graphic mimesis. [б. в.], July 2020. http://dx.doi.org/10.31812/123456789/3864.

Full text
Abstract:
The article deals with the technology of visualizing fictional text (poetry) with the help of emoji symbols in the Emoji Maker platform that not only activates students’ thinking, but also develops creative attention, makes it possible to reproduce the meaning of poetry in a succinct way. The application of this technology has yielded the significance of introducing a computer being emoji in the study and mastering of literature is absolutely logical: an emoji, phenomenologically, logically and eidologically installed in the digital continuum, is separated from the natural language provided by (ethno)logy, and is implicitly embedded into (cosmo)logy. The technology application object is the text of the twentieth century Cuban poet José Ángel Buesa. The choice of poetry was dictated by the appeal to the most important function of emoji – the expression of feelings, emotions, and mood. It has been discovered that sensuality can reconstructed with the help of this type of meta-linguistic digital continuum. It is noted that during the emoji design in the Emoji Maker program, due to the technical limitations of the platform, it is possible to phenomenologize one’s own essential-empirical reconstruction of the lyrical image. Creating the image of the lyrical protagonist sign, it was sensible to apply knowledge in linguistics, philosophy of language, psychology, psycholinguistics, literary criticism. By constructing the sign, a special emphasis was placed on the facial emogram, which also plays an essential role in the transmission of a wide range of emotions, moods, feelings of the lyrical protagonist. Consequently, the Emoji Maker digital platform allowed to create a new model of digital presentation of fiction, especially considering the psychophysiological characteristics of the lyrical protagonist. Thus, the interpreting reader, using a specific digital toolkit – a visual iconic sign (smile) – reproduces the polylaterial metalinguistic multimodality of the sign meaning in fiction. The effectiveness of this approach is verified by the poly-functional emoji ousia, tested on texts of fiction.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Construction de graphes' for particular source types:
Journal articles Dissertations / Theses Books
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!

To the bibliography