Virtualized Network Graph Design and Embedding Model

Author(s):  
Takehiro Sato ◽  
Takashi Kurimoto ◽  
Shigeo Urushidani ◽  
Eiji Oki
Keyword(s):  
Author(s):  
Ольга Валентиновна Кузнецова ◽  
Варвара Геннадьевна Кузнецова

В статье рассматривается процесс проектирования, 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.


2020 ◽  
Author(s):  
Robert Kaczmarczyk ◽  
Felix Bauerdorf ◽  
Alexander Zink

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.


2015 ◽  
Vol 31 (4) ◽  
pp. 723-736 ◽  
Author(s):  
Marinus Spreen ◽  
Stefan Bogaerts

Abstract Link-tracing designs are often used to estimate the size of hidden populations by utilizing the relational links between their members. A major problem in studies of hidden populations is the lack of a convenient sampling frame. The most frequently applied design in studies of hidden populations is respondent-driven sampling in which no sampling frame is used. However, in some studies multiple but incomplete sampling frames are available. In this article, we introduce the B-graph design that can be used in such situations. In this design, all available incomplete sampling frames are joined and turned into one sampling frame, from which a random sample is drawn and selected respondents are asked to mention their contacts. By considering the population as a bipartite graph of a two-mode network (those from the sampling frame and those who are not on the frame), the number of respondents who are directly linked to the sampling frame members can be estimated using Chao’s and Zelterman’s estimators for sparse data. The B-graph sampling design is illustrated using the data of a social network study from Utrecht, the Netherlands.


2021 ◽  
pp. 108626
Author(s):  
Yexiao He ◽  
Xiaoning Zhang ◽  
Zixiang Xia ◽  
Yutao Liu ◽  
Keshav Sood ◽  
...  

Sensors ◽  
2018 ◽  
Vol 18 (11) ◽  
pp. 3791
Author(s):  
Tianli Ma ◽  
Song Gao ◽  
Chaobo Chen ◽  
Xiaoru Song

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.


Sign in / Sign up

Export Citation Format

Share Document