scholarly journals A Synchronous Self-stabilizing Minimal Domination Protocol in an Arbitrary Network Graph

2003 ◽  
pp. 26-32 ◽  
Author(s):  
Z. Xu ◽  
S. T. Hedetniemi ◽  
W. Goddard ◽  
P. K. Srimani
Keyword(s):  
Network Graph

CASSION 012M - 133 -006 PANEL SERVICE PLATFORM CONSTRUCTION AND TECHNOLOGY DESIGN AND ENGINEERING

2020 ◽  
Author(s):  
Ольга Валентиновна Кузнецова ◽  
Варвара Геннадьевна Кузнецова
Keyword(s):  
3D Model ◽  
3D Modelling ◽  
Network Graph ◽  
Technology Design ◽  
Service Platform ◽  
Ship Structure ◽  
Welding Technology ◽  
Work Duration

В статье рассматривается процесс проектирования, 3D-моделирования, технологии сборки и сварки плоской судовой конструкции. Была создана 3D-модель секции, которая стала основой для ассоциативного чертежа. На основе действующих нормативных актов разработана технология сборки и сварки, рассчитана продолжительность и трудоемкость, построен сетевой график, описывающий процессы производства. The article presents the process of engineering, 3D-modelling, assembling and welding technology of a flat ship structure. A 3D-model of a section was created, which the associative drawing was based on. After the assembling and welding technology was designed according to the regulations and standards, the work duration and activity content was calculated. The network graph was plotted to illustrate the course of production.

What´s driving dermatology: Contribution title analysis of the largest German Dermatology Congress 2019 (Preprint)

2020 ◽  
Author(s):  
Robert Kaczmarczyk ◽  
Felix Bauerdorf ◽  
Alexander Zink
Keyword(s):  
Network Analysis ◽  
Annual Meeting ◽  
Research Network ◽  
Graph Analysis ◽  
Network Graph ◽  
Research Topics ◽  
German Speaking ◽  
Specialist Groups ◽  
Community Meeting ◽  
High Diversity

BACKGROUND Every two years, German-speaking dermatologic specialist groups gather in Berlin to share the latest developments at Germany´s largest dermatologic conference, the Annual Meeting of the Germany Society of Dermatology (DDG). Because this conference has a lasting effect on dermatologic practice and research, understanding what is moving the specialist groups means understanding what is driving dermatology in Germany. OBJECTIVE The objective of the article is to introduce the medical scientific community to a data visualization method, which will help understand more sophisticated data analysis and processing approaches in the future. METHODS We used word network analysis to compile and visualize the information embedded in the contribution titles to the DDG Annual Meeting in 2019. We extracted words, contributing cities and inter-connections. The data was standardized, visualized using network graphs and analyzed using common network analysis parameters. RESULTS A total of 5509 words were extracted from 1150 contribution titles. The most frequently used words were “therapy”, “patients”, and “psoriasis”. The highest number of contributions came from Hamburg, Berlin and Munich. High diversity in research topics was found, as well as a well-connected research network. CONCLUSIONS Focus of the well-connected German-speaking dermatology community meeting 2019 was patient and therapy centered and lies especially on the diseases psoriasis and melanoma. Network graph analysis can provide helpful insights and help planning future congresses. It can facilitate the choice which contributors to include as imbalances become apparent. Moreover, it can help distributing the topics more evenly across the whole dermatologic spectrum.

scholarly journals Multitarget Tracking Algorithm Based on Adaptive Network Graph Segmentation in the Presence of Measurement Origin Uncertainty

Sensors ◽  
2018 ◽  
Vol 18 (11) ◽  
pp. 3791
Author(s):  
Tianli Ma ◽  
Song Gao ◽  
Chaobo Chen ◽  
Xiaoru Song
Keyword(s):  
Shortest Path ◽  
Clustering Algorithm ◽  
Search Algorithm ◽  
Optimal Solution ◽  
Tracking Algorithm ◽  
Multitarget Tracking ◽  
Integer Programming Problem ◽  
Tracking Accuracy ◽  
Network Graph ◽  
Adaptive Network

To deal with the problem of multitarget tracking with measurement origin uncertainty, the paper presents a multitarget tracking algorithm based on Adaptive Network Graph Segmentation (ANGS). The multitarget tracking is firstly formulated as an Integer Programming problem for finding the maximum a posterior probability in a cost flow network. Then, a network structure is partitioned using an Adaptive Spectral Clustering algorithm based on the Nyström Method. In order to obtain the global optimal solution, the parallel A* search algorithm is used to process each sub-network. Moreover, the trajectory set is extracted by the Track Mosaic technique and Rauch–Tung–Striebel (RTS) smoother. Finally, the simulation results achieved for different clutter intensity indicate that the proposed algorithm has better tracking accuracy and robustness compared with the A* search algorithm, the successive shortest-path (SSP) algorithm and the shortest path faster (SPFA) algorithm.

scholarly journals Molecular analysis of the dengue virus type 1 and 2 in Brazil based on sequences of the genomic envelope-nonstructural protein 1 junction region

2004 ◽  
Vol 46 (3) ◽  
pp. 145-152 ◽  
Author(s):  
Cecília Luiza S. Santos ◽  
Maria Anice M. Sallum ◽  
Peter G. Foster ◽  
Iray Maria Rocco
Keyword(s):  
Sequence Data ◽  
Nonstructural Protein ◽  
Phylogenetic Analyses ◽  
Decomposition Analysis ◽  
Structural Protein ◽  
Network Graph ◽  
Junction Region ◽  
Split Decomposition ◽  
Genotype Iii ◽  
Nonstructural Protein 1

The genomic sequences of the Envelope-Non-Structural protein 1 junction region (E/NS1) of 84 DEN-1 and 22 DEN-2 isolates from Brazil were determined. Most of these strains were isolated in the period from 1995 to 2001 in endemic and regions of recent dengue transmission in São Paulo State. Sequence data for DEN-1 and DEN-2 utilized in phylogenetic and split decomposition analyses also include sequences deposited in GenBank from different regions of Brazil and of the world. Phylogenetic analyses were done using both maximum likelihood and Bayesian approaches. Results for both DEN-1 and DEN-2 data are ambiguous, and support for most tree bipartitions are generally poor, suggesting that E/NS1 region does not contain enough information for recovering phylogenetic relationships among DEN-1 and DEN-2 sequences used in this study. The network graph generated in the split decomposition analysis of DEN-1 does not show evidence of grouping sequences according to country, region and clades. While the network for DEN-2 also shows ambiguities among DEN-2 sequences, it suggests that Brazilian sequences may belong to distinct subtypes of genotype III.

scholarly journals Robustez de las redes urbanas densamente pobladas en relación con la propagación del tráfico / Robustness of densely populated urban networks in relation to the spread of traffic

2019 ◽  
Vol 8 (1) ◽  
pp. 1-10
Author(s):  
Hugo Alatrista-Salas ◽  
Miguel Núñez del Prado Cortez ◽  
Manuel Guillermo Rodríguez-López
Keyword(s):  
Adverse Events ◽  
Computational Algorithms ◽  
Network Graph ◽  
Urban Networks ◽  
Targeted Attacks ◽  
Graph Properties

ABSTRACTAnalyzing, the morphology, robustness or vulnerability of densely populated cities is a challenge for contemporary researchers. Studies on the resilience of urban infrastructures are given by the presence of recurrent adverse events or sporadic disasters. These events force the interruption of intersections or sections of streets momentarily or permanently. For measurements we use network graph properties and computational algorithms, simulating random and targeted attacks. Finally, in the results we identify the location of critical places that contain intersections and sections of street with greater centrality of intermediation and lower average of proximity.RESUMENAnalizar, la morfología, robustez o vulnerabilidad de ciudades densamente pobladas es un desafío para los investigadores contemporáneos. Los estudios sobre la resiliencia de infraestructuras urbanas se dan por la presencia de eventos adversos recurrentes o desastres esporádicos. Estos acontecimientos, obligan a interrumpir intersecciones o tramos de calles momentánea o permanentemente. Para las mediciones usamos las propiedades de grafos de redes y algoritmos computacionales, simulando ataques aleatorios y dirigidos. Finalmente, en los resultados identificamos la ubicación de lugares críticos que contienen intersecciones y secciones de calle con mayor centralidad de intermediación y menor promedio de cercanía.

Sign in / Sign up

Export Citation Format

Share Document