Log in

Relevant bibliographies by topics / Graphe de communication

Contents

Journal articles

Academic literature on the topic 'Graphe de communication'

Author: Grafiati

Published: 28 September 2022

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 'Graphe de communication.'

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 "Graphe de communication"

1

Hilton, N. Zoe, Elke Ham, Kevin L. Nunes, Nicole C. Rodrigues, Cairina Frank, and Michael C. Seto. "Using Graphs to Improve Violence Risk Communication." Criminal Justice and Behavior 44, no. 5 (2016): 678–94. http://dx.doi.org/10.1177/0093854816668916.

Full text

Abstract:

We examined the use of graphs as an aid to communicating statistical risk among forensic clinicians. We first tested four graphs previously used or recommended for forensic risk assessment among 442 undergraduate students who made security recommendations about two offenders whose risk differed by one actuarial category of risk for violent recidivism (Study 1). Effective decision making was defined as actuarially higher risk offenders being assigned to greater security than lower risk offenders. The graph resulting in the largest distinction among less numerate students was a probability bar graph. We then tested this graph among 54 forensic clinicians (Study 2). The graph had no overall effect. Among more experienced staff, however, decisions were insensitive to actuarial risk in the absence of the graph and in the desirable direction with the addition of the graph. Further research into the benefit of graphs in violence risk communication appears viable.

APA, Harvard, Vancouver, ISO, and other styles

2

SHOUBRIDGE, PETER, MIRO KRAETZL, WAL WALLIS, and HORST BUNKE. "DETECTION OF ABNORMAL CHANGE IN A TIME SERIES OF GRAPHS." Journal of Interconnection Networks 03, no. 01n02 (2002): 85–101. http://dx.doi.org/10.1142/s0219265902000562.

Full text

Abstract:

In the management of large enterprise communication networks, it becomes difficult to detect and identify causes of abnormal change in traffic distributions when the underlying logical topology is dynamic. This paper describes a novel approach to abnormal network change detection by representing periodic observations of logical communications within a network as a time series of graphs. A number of graph distance measures are proposed to assess the difference between successive graphs and identify abnormal behaviour. Localisation techniques have also been described to show where in the network most change occurred.

APA, Harvard, Vancouver, ISO, and other styles

3

Kusper, Gábor, and Csaba Biró. "Convert a Strongly Connected Directed Graph to a Black-and-White 3-SAT Problem by the Balatonboglár Model." Algorithms 13, no. 12 (2020): 321. http://dx.doi.org/10.3390/a13120321.

Full text

Abstract:

In a previous paper we defined the black and white SAT problem which has exactly two solutions, where each variable is either true or false. We showed that black and white 2-SAT problems represent strongly connected directed graphs. We presented also the strong model of communication graphs. In this work we introduce two new models, the weak model, and the Balatonboglár model of communication graphs. A communication graph is a directed graph, where no self loops are allowed. In this work we show that the weak model of a strongly connected communication graph is a black and white SAT problem. We prove a powerful theorem, the so called transitions theorem. This theorem states that for any model which is between the strong and the weak model, we have that this model represents strongly connected communication graphs as black and white SAT problems. We show that the Balatonboglár model is between the strong and the weak model, and it generates 3-SAT problems, so the Balatonboglár model represents strongly connected communication graphs as black and white 3-SAT problems. Our motivation to study these models is the following: The strong model generates a 2-SAT problem from the input directed graph, so it does not give us a deep insight how to convert a general SAT problem into a directed graph. The weak model generates huge models, because it represents all cycles, even non-simple cycles, of the input directed graph. We need something between them to gain more experience. From the Balatonboglár model we learned that it is enough to have a subset of a clause, which represents a cycle in the weak model, to make the Balatonboglár model more compact. We still do not know how to represent a SAT problem as a directed graph, but this work gives a strong link between two prominent fields of formal methods: the SAT problem and directed graphs.

APA, Harvard, Vancouver, ISO, and other styles

4

LI, YINKUI, ZONGTIAN WEI, XIAOKUI YUE, and ERQIANG LIU. "TENACITY OF TOTAL GRAPHS." International Journal of Foundations of Computer Science 25, no. 05 (2014): 553–62. http://dx.doi.org/10.1142/s012905411450021x.

Full text

Abstract:

Communication networks must be constructed to be as stable as possible, not only with the respect to the initial disruption, but also with respect to the possible reconstruction. Many graph theoretical parameters have been used to describe the stability of communication networks. Tenacity is a reasonable one, which shows not only the difficulty to break down the network but also the damage that has been caused. Total graphs are the largest graphs formed by the adjacent relations of elements of a graph. Thus, total graphs are highly recommended for the design of interconnection networks. In this paper, we determine the tenacity of the total graph of a path, cycle and complete bipartite graph, and thus give a lower bound of the tenacity for the total graph of a graph.

APA, Harvard, Vancouver, ISO, and other styles

5

Alanazi, A. M., G. Muhiuddin, A. R. Kannan, and V. Govindan. "New Perspectives on Classical Meanness of Some Ladder Graphs." Journal of Mathematics 2021 (June 30, 2021): 1–14. http://dx.doi.org/10.1155/2021/9926350.

Full text

Abstract:

In this study, we investigate a new kind of mean labeling of graph. The ladder graph plays an important role in the area of communication networks, coding theory, and transportation engineering. Also, we found interesting new results corresponding to classical mean labeling for some ladder-related graphs and corona of ladder graphs with suitable examples.

APA, Harvard, Vancouver, ISO, and other styles

6

Eshaghian, Mary Mehrnoosh. "MAPPING ARBITRARY HETEROGENEOUS TASK GRAPHS ONTO ARBITRARY HETEROGENEOUS SYSTEM GRAPH." International Journal of Foundations of Computer Science 12, no. 05 (2001): 599–628. http://dx.doi.org/10.1142/s0129054101000680.

Full text

Abstract:

In this paper, a generic technique for mapping arbitrary heterogeneous task graphs onto arbitrary heterogeneous system graphs is presented. The heterogeneous task and system graphs studied in this paper have nonuniform computation and communication weights associated with the nodes and the edges. Two clustering algorithms have been proposed that can be used to obtain a multilayer clustered graph called a Spec graph from a given task graph and a multilayer clustered graph called a Rep graph from a given system graph. We present a mapping algorithm that produces a suboptimal matching of a given Spec graph containing M task modules onto a Rep graph of N processors, in O(M2) time, where N ≤ M. Our experimental results indicate that our mapping algorithm is the fastest one and generates results that are better than, or similar to, those of other leading techniques, some of which work only for restricted task or system graphs.

APA, Harvard, Vancouver, ISO, and other styles

7

Manjusha, O. T. "Set Domination in Fuzzy Graphs Using Strong Arcs." Pan-American Journal of Mathematics 1 (August 3, 2022): 9. http://dx.doi.org/10.28919/cpr-pajm/1-9.

Full text

Abstract:

Set domination in fuzzy graphs is very useful for solving traffic problems during communication in computer networks and travelling networks. In this article, the concept of set domination in fuzzy graphs using strong arcs is introduced. The strong set domination number of complete fuzzy graph and complete bipartite fuzzy graph is determined. It is obtained the properties of the new parameter and related it to some other known domination parameters of fuzzy graphs. An upper bound for the strong set domination number of fuzzy graphs is also obtained.

APA, Harvard, Vancouver, ISO, and other styles

8

Yang, Chao, Bing Yao, Hong Yu Wang, Xiang'en Chen, and Si Hua Yang. "Graph Colorings Applied in Scale-Free Networks." Advanced Materials Research 760-762 (September 2013): 2199–204. http://dx.doi.org/10.4028/www.scientific.net/amr.760-762.2199.

Full text

Abstract:

Building up graph models to simulate scale-free networks is an important method since graphs have been used in researching scale-free networks and communication networks, such as graph colorings can be used for distinguishing objects of communication and information networks. In this paper we determine the avdtc chromatic numbers of some models related with researching networks.

APA, Harvard, Vancouver, ISO, and other styles

9

RANAWAKE, U. A., P. M. LENDERS, and S. M. GOODNICK. "ON LOWER BOUNDS FOR THE COMMUNICATION VOLUME IN DISTRIBUTED SYSTEMS." Parallel Processing Letters 01, no. 02 (1991): 125–33. http://dx.doi.org/10.1142/s0129626491000070.

Full text

Abstract:

In this paper we derive a lower bound for the total communication volume when mapping arbitrary task graphs onto a distributed processor system. For a K processor system this lower bound can be computed with only the K (possibly) largest eigen values of the adjacency matrix of the task graph and the eigen values of the adjacency matrix of the processor graph. We also derive the eigen values of the adjacency matrix of the processor graph for a hypercube multiprocessor and illustrate the concept with a simple example for the two processor case.

APA, Harvard, Vancouver, ISO, and other styles

10

Manghi, Paolo, Claudio Atzori, Michele De Bonis, and Alessia Bardi. "Entity deduplication in big data graphs for scholarly communication." Data Technologies and Applications 54, no. 4 (2020): 409–35. http://dx.doi.org/10.1108/dta-09-2019-0163.

Full text

Abstract:

PurposeSeveral online services offer functionalities to access information from “big research graphs” (e.g. Google Scholar, OpenAIRE, Microsoft Academic Graph), which correlate scholarly/scientific communication entities such as publications, authors, datasets, organizations, projects, funders, etc. Depending on the target users, access can vary from search and browse content to the consumption of statistics for monitoring and provision of feedback. Such graphs are populated over time as aggregations of multiple sources and therefore suffer from major entity-duplication problems. Although deduplication of graphs is a known and actual problem, existing solutions are dedicated to specific scenarios, operate on flat collections, local topology-drive challenges and cannot therefore be re-used in other contexts.Design/methodology/approachThis work presents GDup, an integrated, scalable, general-purpose system that can be customized to address deduplication over arbitrary large information graphs. The paper presents its high-level architecture, its implementation as a service used within the OpenAIRE infrastructure system and reports numbers of real-case experiments.FindingsGDup provides the functionalities required to deliver a fully-fledged entity deduplication workflow over a generic input graph. The system offers out-of-the-box Ground Truth management, acquisition of feedback from data curators and algorithms for identifying and merging duplicates, to obtain an output disambiguated graph.Originality/valueTo our knowledge GDup is the only system in the literature that offers an integrated and general-purpose solution for the deduplication graphs, while targeting big data scalability issues. GDup is today one of the key modules of the OpenAIRE infrastructure production system, which monitors Open Science trends on behalf of the European Commission, National funders and institutions.

APA, Harvard, Vancouver, ISO, and other styles

More sources

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!