Thematische Bibliographien / Network analyze

Inhaltsverzeichnis

Zeitschriftenartikel
Dissertationen
Bücher
Buchteile
Konferenzberichte
Berichte der Organisationen

Auswahl der wissenschaftlichen Literatur zum Thema „Network analyze“

Autor: Grafiati

Veröffentlicht am 28. Juni 2021

Zuletzt aktualisiert am 10. Februar 2022

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

Wählen Sie eine Art der Quelle aus:

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

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

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

Zeitschriftenartikel zum Thema "Network analyze"

PELLEGRINI, Lilla, Monica LEBA und Alexandru IOVANOVICI. „CHARACTERIZATION OF URBAN TRANSPORTATION NETWORKS USING NETWORK MOTIFS“. Acta Electrotechnica et Informatica 20, Nr. 4 (21.01.2020): 3–9. http://dx.doi.org/10.15546/aeei-2020-0019.

Der volle Inhalt der Quelle

Annotation:

We use tools and techniques specific to the field of complex networks analysis for the identification and extraction of key parameters which define ”good” patterns and practices for designing public transportation networks. Using network motifs we analyze a set of 18 cities using public data sets regarding the topology of network and discuss each of the identified motifs using the concepts and tools of urban planning.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Chen, Guobin, Jun Qi, Chao Tang, Ying Wang, Yongzhong Wu und Xiaolong Shi. „Analysis and Research of Key Genes in Gene Expression Network Based on Complex Network“. Complexity 2020 (10.12.2020): 1–12. http://dx.doi.org/10.1155/2020/8816633.

Der volle Inhalt der Quelle

Annotation:

Gene expression network is also a type of complex network. It is challenging to analyze the gene expression network through relevant knowledge and algorithms of a complex network. In this paper, the existing characteristics of genes are analyzed from various indexes of the gene expression network to analyze key genes and TOP genes. Firstly, gene chip data are screened, gene data with obvious characteristics are selected, and relevant clustering characteristics are analyzed. Then, the complex gene network structure is established, and gene networks with different threshold shapes and different sizes are selected. Finally, the relevant indexes and PR values after the PageRank algorithm are analyzed for complex networks under different thresholds, thus establishing the TOP gene and PR sequence.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Chongwatpol, Jongsawas, und Ramesh Sharda. „SNAP: A DSS to analyze network service pricing for state networks“. Decision Support Systems 50, Nr. 1 (Dezember 2010): 347–59. http://dx.doi.org/10.1016/j.dss.2010.05.009.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

LANDSPERGER, JOHANNES, PATRICK SPIETH und SVEN HEIDENREICH. „HOW NETWORK MANAGERS CONTRIBUTE TO INNOVATION NETWORK PERFORMANCE“. International Journal of Innovation Management 16, Nr. 06 (30.11.2012): 1240009. http://dx.doi.org/10.1142/s1363919612400099.

Der volle Inhalt der Quelle

Annotation:

Innovation networks that aim at the joint development of products, services or processes represent a particular form of inter-organizational business networks. In order to yield useful results from these collaborations, networks need to be managed thoroughly. By appointing a dedicated network manager to administrate, coordinate, and regulate, the management of tasks is bundled and centralized within a single entity. However, to the best knowledge of the authors, no empirical research has yet been conducted, investigating the impact of a network manager's availability, relevance, and influence on network performance. Using the interaction-oriented network approach as conceptual foundation, we analyze network managers' direct and indirect influence on the network's relational and goal achievement performance. Our results suggest that a network manager enhances innovation network's core management functions, which in turn improve the relational performance (RP). Moreover, RP was found to significantly drive the goal achievement performance (GAP).

APA, Harvard, Vancouver, ISO und andere Zitierweisen

MingHsiung Ying, und HaoHsuan Huang. „Item Selection Strategic via Social Network Analyze“. International Journal of Digital Content Technology and its Applications 5, Nr. 3 (31.03.2011): 333–42. http://dx.doi.org/10.4156/jdcta.vol5.issue3.33.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Niederberger, Craig S., Larry I. Lipshultz und Dolores J. Lamb. „A neural network to analyze fertility data *†‡“. Fertility and Sterility 60, Nr. 2 (August 1993): 324–30. http://dx.doi.org/10.1016/s0015-0282(16)56106-8.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Du, Yan Ping, Fang Fang Chen und Zhen Hua Zhang. „Analysis of Urban Rail Transit Based on Complex Network“. Applied Mechanics and Materials 90-93 (September 2011): 770–73. http://dx.doi.org/10.4028/www.scientific.net/amm.90-93.770.

Der volle Inhalt der Quelle

Annotation:

The development of urban rail transit plays the more and more important role in the public transit. It’s significant to analyze the urban rail transit network characteristics and its stability. The basic statistics parameters of Beijing metro network are computed in the paper based on the theory of complex networks, and its network characteristic is analyzed through the comparison to characteristic parameters of four typical networks.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Yuan, Ming Hui, und Yan Qing Gong. „A Novel Monitoring Network System of Wireless Sensor Network“. Applied Mechanics and Materials 241-244 (Dezember 2012): 908–11. http://dx.doi.org/10.4028/www.scientific.net/amm.241-244.908.

Der volle Inhalt der Quelle

Annotation:

A novel WSNS (wireless sensor network sniffer) is used to analyze and evaluate the Wireless Sensor Networks (WSN) effectively, which is designed to monitor IEEE 802.15.4 protocol frame of the Ethernet. Unlike the existed monitoring system, this design has higher efficiency and needs less resource. It is analyzed in this paper that the monitor network framework, time synchronization, and analysis program design. The results show that WSNS can real time display the monitored frame and dynamic changes of WSN topology.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Gómez-Vela, Francisco, Norberto Díaz-Díaz, José A. Lagares, José A. Sánchez und Jesús S. Aguilar-Ruiz. „Using graph theory to analyze gene network coherence“. EMBnet.journal 18, B (09.11.2012): 32. http://dx.doi.org/10.14806/ej.18.b.541.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Xu, Jin Jin, Sheng Jun Su und Ming Hui Yuan. „A Simple Monitoring Network System of Wireless Sensor Network“. Applied Mechanics and Materials 278-280 (Januar 2013): 689–92. http://dx.doi.org/10.4028/www.scientific.net/amm.278-280.689.

Der volle Inhalt der Quelle

Annotation:

A SSNS (simple sensor network sniffer) is used to analyze and evaluate the Wireless Sensor Networks (WSN) effectively. SSNS is designed to monitor IEEE 802.15.4 protocol frame, which based on the Ethernet. Unlike the existed monitoring system, our design is much simpler and needs less resource. It is analyzed in this paper that the monitor network framework, time synchronization, and analysis program design. The results show that SSNS works stably, and can real-time display the frame monitored and reflect the dynamic change of WSN.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Dissertationen zum Thema "Network analyze"

Nath, Madhurima. „Application of Network Reliability to Analyze Diffusive Processes on Graph Dynamical Systems“. Diss., Virginia Tech, 2019. http://hdl.handle.net/10919/86841.

Der volle Inhalt der Quelle

Annotation:

Moore and Shannon's reliability polynomial can be used as a global statistic to explore the behavior of diffusive processes on a graph dynamical system representing a finite sized interacting system. It depends on both the network topology and the dynamics of the process and gives the probability that the system has a particular desired property. Due to the complexity involved in evaluating the exact network reliability, the problem has been classified as a NP-hard problem. The estimation of the reliability polynomials for large graphs is feasible using Monte Carlo simulations. However, the number of samples required for an accurate estimate increases with system size. Instead, an adaptive method using Bernstein polynomials as kernel density estimators proves useful. Network reliability has a wide range of applications ranging from epidemiology to statistical physics, depending on the description of the functionality. For example, it serves as a measure to study the sensitivity of the outbreak of an infectious disease on a network to the structure of the network. It can also be used to identify important dynamics-induced contagion clusters in international food trade networks. Further, it is analogous to the partition function of the Ising model which provides insights to the interpolation between the low and high temperature limits.
Ph. D.
The research presented here explores the effects of the structural properties of an interacting system on the outcomes of a diffusive process using Moore-Shannon network reliability. The network reliability is a finite degree polynomial which provides the probability of observing a certain configuration for a diffusive process on networks. Examples of such processes analyzed here are outbreak of an epidemic in a population, spread of an invasive species through international trade of commodities and spread of a perturbation in a physical system with discrete magnetic spins. Network reliability is a novel tool which can be used to compare the efficiency of network models with the observed data, to find important components of the system as well as to estimate the functions of thermodynamic state variables.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Isik, Zerrin. „Network Structure Based Pathway Enrichment System To Analyze Pathway Activities“. Phd thesis, METU, 2011. http://etd.lib.metu.edu.tr/upload/12612951/index.pdf.

Der volle Inhalt der Quelle

Annotation:

Current approaches integrating large scale data and information from a variety of sources to reveal molecular basis of cellular events do not adequately benefit from pathway information. Here, we portray a network structure based pathway enrichment system that fuses and exploits model and data: signalling pathways are taken as the biological models while microarray and ChIP-seq data are the sample input data sources among many other alternatives. Our model- and data-driven hybrid system allows to quantitatively assessing the biological activity of a cyclic pathway and simultaneous enrichment of the significant paths leading to the ultimate cellular response. Signal Transduction Score Flow (SiTSFlow) algorithm is the fundamental constituent of proposed network structure based pathway enrichment system. SiTSFlow algorithm converts each pathway into a cascaded graph and then gene scores are mapped onto the protein nodes. Gene scores are transferred to en route of the pathway to form a final activity score describing behaviour of a specific process in the pathway while enriching of the gene node scores. Because of cyclic pathways, the algorithm runs in an iterative manner and it terminates when the node scores converge. The converged final activity score provides a quantitative measure to assess the biological significance of a process under the given experimental conditions. The conversion of cyclic pathways into cascaded graphs is performed by using a linear time multiple source Breadth First Search Algorithm. Furthermore, proposed network structure based pathway enrichment system works in linear time in terms of nodes and edges of given pathways. In order to explore various biological responses of several processes in a global signalling network, the selected small pathways have been unified based on their common gene and process nodes. The merge algorithm for pathways also runs in linear time in terms of nodes and edges of given pathways. In the experiments, SiTSFlow algorithm proved the convergence behaviour of activity scores for several cyclic pathways and for a global signalling network. The biological results obtained by assessing of experimental data by described network structure based pathway enrichment system were in correlation with the expected cellular behaviour under the given experimental conditions.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Oliveira, Homero Fernandes. „Design and implementation of a toolbox of modularized C programs to construct, analyze and test network optimization algorithms“. Thesis, Monterey, California. Naval Postgraduate School, 1991. http://hdl.handle.net/10945/26452.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

THOMAS, VINEET SUNNY. „A Multiscale Framework to Analyze Tricuspid Valve Biomechanics“. University of Akron / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=akron1542255754172363.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Tobolka, Lukáš. „Problematika návrhu síťové infrastruktury“. Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2021. http://www.nusl.cz/ntk/nusl-442356.

Der volle Inhalt der Quelle

Annotation:

The aim of this diploma thesis is to look at the design of network infrastructure in practice. There are individual procedures, brands, standards that must be followed when designing. It includes a brief general overview of terminal elements, cable systems and related matters. In general, methods for measuring optical lines and parameters for measuring metallic networks are described here. The possible complications that accompany it are briefly described in the implementation. The network design methodology is also described here on the example of a specific object. Before the actual handover of the work, the entire infrastructure is analyzed and measured with output protocols within the certification of the entire system together with outputs in the form of a measurement protocol.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Nassani, Sararose. „An Application of Statistics and Random Graphs to Analyze Local Heroin Markets“. Case Western Reserve University School of Graduate Studies / OhioLINK, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=case155440032815001.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Vu, Xuan Thang. „Joint Network / Channel Decoding over Noisy Wireless Networks“. Phd thesis, Université Paris Sud - Paris XI, 2014. http://tel.archives-ouvertes.fr/tel-01060330.

Der volle Inhalt der Quelle

Annotation:

Network coding (NC) has gained much research attention as a potential candidate to solve the demand for higher spectral e ciency of modern wireless communications. Many research papers have investigated the performance of NC-aided networks such as throughput and outage capacity. However, the analysis of NC in practical systems where NC is combined with other techniques such as channel coding is still immature to fully understand its potential performance. In this thesis, we aim to design high performance receivers and analyze its performance for network-coded cooperative networks in practical scenarios. Firstly, we propose two Iterative Network/Channel Decoding (INCD) algorithms for the Multiple-Access Relay Channel (MARC) with two notable relaying schemes named Decode-and-Forward (DF) and Demodulate-and-Forward (DMF). The INCD algorithm operates based on turbo-like decoding methods and reduces the impact of the error propagation problem with the aid of a channel-aware receiver design. Both perfect Channel State Information (CSI) and imperfect CSI at the receiver side are investigated. We propose a practical method that forwards the quantized version of the relay decoding errors to the destination. It is shown that the proposed algorithms achieve full diversity gain and signi cantle outperforms solutions which do not take care of error propagation. We also show that the number of pilot symbols a ects only the coding gain but has a negligible impact on the diversity order, while the quantization level a cts both the diversity and coding gain. Secondly, we propose a Near Optimal Joint Network/Channel Decoding (NOJNCD) algorithm for the MARC that allows to analyze the system Bit Error Rate (BER). The NOJNCD algorithm performs network decoding and channel decoding in one decoding step of the super code, which comprises of all trellis states of individual code at the sources via NC. Furthermore, NC combined with Relay Selection (RS) is considered and the achievable diversity order is studied with the aid of outage analysis. We analytically show that Single Relay Selection (SRS) always achieves a diversity order two and Multiple Relay Selection (MRS) can achieve full diversity gain only when the number of selected relays exceeds the number of the sources. Last but not least, we propose a so-called partial relaying protocol to improve the spectral e ciency for channel coding assisted relay networks. Closed-form expression of the BER and the system diversity order are computed for partial relaying. We show, by analysis and simulations, that with a proper Convolutional Code (CC), partial relaying can achieve full diversity gain and same coding gain as the classical (full) relaying protocol in nite signal-to-noise ratio region while it obtains a better spectrum usage. Moreover, we propose a new protocol based on partial relaying in opportunistic relaying cooperative networks and show that this protocol signi cantly outperforms the NC-based cooperation in some circumstances.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Caruba, Thibaut. „Analyses médico-économiques de la prise en charge de la maladie coronarienne stable : méta-analyse en réseau et modélisation“. Phd thesis, Université René Descartes - Paris V, 2013. http://tel.archives-ouvertes.fr/tel-00921072.

Der volle Inhalt der Quelle

Annotation:

La maladie coronaire stable est une maladie chronique pour laquelle de nombreuses stratégies thérapeutiques sont disponibles, dont le traitement par médicaments seuls et les traitements invasifs par angioplastie avec stent ou par pontage aortocoronaire. Face aux résultats de plusieurs méta-analyses mettant en évidence un taux de mortalité comparable entre ces traitements, nous avons décidé d'effectuer un travail de recherche comparant leurs coûts. Dans la première partie de mon travail, nous avons comparé, après une période de un an et une autre de 3 ans de suivi des patients, les données cliniques et économiques publiées pour 5 traitements de l'angor stable : les médicaments seuls, le pontage aortocoronaire, l'angioplastie sans stent, l'angioplastie avec stent nu et l'angioplastie avec stent actif. La mortalité et le taux d'IDM étaient nos critères de jugement clinique. Les coûts directs, liés au traitement effectué et liés à la prise en charge des éventuelles complications, ont été uniformisés via la parité de pouvoir d'achat et exprimés en US $ 2008. Il s'agissait de notre critère de jugement économique. Un total de 19 études cliniques a été retenu dans notre méta-analyse en réseau. Nos résultats mettent en évidence une absence de différence significative sur le critère clinique. En revanche, nous avons observé une différence concernant le coût moyen de chaque traitement après un an et 3 ans de suivi. Le traitement le moins onéreux était le traitement par médicaments seuls, après un an et 3 ans de suivi, avec respectivement un coût moyen par patient de 3 069 US $ et 13 854 US $. Le coût moyen le plus élevé a toujours été obtenu avec le traitement par pontage aortocoronaire : 27 003 US $ après un an et 28 670 US $ après 3 ans de suivi. Cependant, nos conclusions sont limitées d'une part, par la variabilité des méthodes économiques utilisées dans les études sélectionnées dans notre méta-analyse et, d'autre part, par l'évolution des traitements dans le temps. Dans la seconde partie de mon travail de recherche, nous avons calculé le coût de prise en charge d'un patient angoreux stable traité par l'une des 4 stratégies thérapeutiques suivantes : médicaments seuls, pontage aortocoronaire, angioplastie avec stent nu et angioplastie avec stent actif. Pour se faire, nous avons défini d'une part 6 situations cliniques correspondant aux possibles états cliniques du patient un an après l'instauration du traitement étudié et, d'autre part, déterminé les quantités de soins consommés pour chacune de ces situations cliniques. La perspective retenue était celle de l'Assurance Maladie. Les coûts calculés étaient liés aux hospitalisations, aux soins ambulatoires et aux moyens de transport utilisés pour accéder à l'hôpital. La stratégie médicamenteuse était la moins onéreuse avec un coût moyen annuel de 1 518 € ; ce coût prenant en compte les probabilités de survenue des 6 états cliniques. Le traitement par pontage aortocoronaire était le plus onéreux des 4 traitements étudiés, avec un coût moyen annuel de 15 237 €. La perspective de mes travaux est de modéliser la prise en charge d'un patient angoreux stable en envisageant un second traitement si le premier traitement effectué conduit à une situation d'échec thérapeutique. Les arbres que nous avons construits nous permettront ensuite d'effectuer une analyse coût-efficacité de deux stratégies thérapeutiques avec une durée totale de suivi des patients de 2 ans. Enfin, si nos travaux mettent en avant l'intérêt économique du traitement par médicaments, nous soulignons que ces résultats sont obtenus après avoir suivi les patients sur une courte durée (études à un an et à 3 ans), alors que l'angor stable est une maladie chronique où les stratégies thérapeutiques peuvent se succéder en cas d'échec à l'un des traitements...

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Rodriguez, Ramón. „Network Analyzer Functionality Simulator“. Thesis, University of Gävle, Department of Technology and Built Environment, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:hig:diva-704.

Der volle Inhalt der Quelle

Annotation:

The objective of this thesis work was to implement all the hardware and software necessary to simulate the functionality of a Vector Network Analyzer (VNA). With equipment that is already available, and is common in a measurement station, the most common functions of a VNA were implemented, using an Vector Signal Generator, that provide the signal for testing, and a Vector Signal Analyzer, to make all the amplitude and phase measurements. With these instruments and the appropriate software that control them, the basic functionality of a Vector Network Analyzer can be achieved with a reasonable accuracy. With this system, we can reduce costs, avoiding the need of a real VNA and take advantage off instruments that are already available in a laboratory. A Complete measurement system of all four scattering parameters is proposed at the end of the report for future implementation. With this implementation all the different S-parameter measurements were made with an acceptable accuracy that can be comparable to a commercial VNA.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Zreik, Rawya. „Analyse statistique des réseaux et applications aux sciences humaines“. Thesis, Paris 1, 2016. http://www.theses.fr/2016PA01E061/document.

Der volle Inhalt der Quelle

Annotation:

Depuis les travaux précurseurs de Moreno (1934), l’analyse des réseaux est devenue une discipline forte, qui ne se limite plus à la sociologie et qui est à présent appliquée à des domaines très variés tels que la biologie, la géographie ou l’histoire. L’intérêt croissant pour l’analyse des réseaux s’explique d’une part par la forte présence de ce type de données dans le monde numérique d’aujourd’hui et, d’autre part, par les progrès récents dans la modélisation et le traitement de ces données. En effet, informaticiens et statisticiens ont porté leurs efforts depuis plus d’une dizaine d’années sur ces données de type réseau en proposant des nombreuses techniques permettant leur analyse. Parmi ces techniques on note les méthodes de clustering qui permettent en particulier de découvrir une structure en groupes cachés dans le réseau. De nombreux facteurs peuvent exercer une influence sur la structure d’un réseau ou rendre les analyses plus faciles à comprendre. Parmi ceux-ci, on trouve deux facteurs importants: le facteur du temps, et le contexte du réseau. Le premier implique l’évolution des connexions entre les nœuds au cours du temps. Le contexte du réseau peut alors être caractérisé par différents types d’informations, par exemple des messages texte (courrier électronique, tweets, Facebook, messages, etc.) échangés entre des nœuds, des informations catégoriques sur les nœuds (âge, sexe, passe-temps, Les fréquences d’interaction (par exemple, le nombre de courriels envoyés ou les commentaires affichés), et ainsi de suite. La prise en considération de ces facteurs nous permet de capturer de plus en plus d’informations complexes et cachées à partir des données. L’objectif de ma thèse été de définir des nouveaux modèles de graphes aléatoires qui prennent en compte les deux facteurs mentionnés ci-dessus, afin de développer l’analyse de la structure du réseau et permettre l’extraction de l’information cachée à partir des données. Ces modèles visent à regrouper les sommets d’un réseau en fonction de leurs profils de connexion et structures de réseau, qui sont statiques ou évoluant dynamiquement au cours du temps. Le point de départ de ces travaux est le modèle de bloc stochastique (SBM). Il s’agit d’un modèle de mélange pour les graphiques qui ont été initialement développés en sciences sociales. Il suppose que les sommets d’un réseau sont répartis sur différentes classes, de sorte que la probabilité d’une arête entre deux sommets ne dépend que des classes auxquelles ils appartiennent
Over the last two decades, network structure analysis has experienced rapid growth with its construction and its intervention in many fields, such as: communication networks, financial transaction networks, gene regulatory networks, disease transmission networks, mobile telephone networks. Social networks are now commonly used to represent the interactions between groups of people; for instance, ourselves, our professional colleagues, our friends and family, are often part of online networks, such as Facebook, Twitter, email. In a network, many factors can exert influence or make analyses easier to understand. Among these, we find two important ones: the time factor, and the network context. The former involves the evolution of connections between nodes over time. The network context can then be characterized by different types of information such as text messages (email, tweets, Facebook, posts, etc.) exchanged between nodes, categorical information on the nodes (age, gender, hobbies, status, etc.), interaction frequencies (e.g., number of emails sent or comments posted), and so on. Taking into consideration these factors can lead to the capture of increasingly complex and hidden information from the data. The aim of this thesis is to define new models for graphs which take into consideration the two factors mentioned above, in order to develop the analysis of network structure and allow extraction of the hidden information from the data. These models aim at clustering the vertices of a network depending on their connection profiles and network structures, which are either static or dynamically evolving. The starting point of this work is the stochastic block model, or SBM. This is a mixture model for graphs which was originally developed in social sciences. It assumes that the vertices of a network are spread over different classes, so that the probability of an edge between two vertices only depends on the classes they belong to

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Bücher zum Thema "Network analyze"

Oliveira, Homero Fernandes. Design and implementation of a toolbox of modularized C programs to construct, analyze and test network optimization algorithms. Monterey, Calif: Naval Postgraduate School, 1991.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Zacharioudakis, Evangelos. Packet analyzer and graphical network. Oxford: Oxford Brookes University, 2003.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Spectrum and network measurements. Englewood Cliffs, N.J: Prentice Hall, 1991.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Witte, Robert A. Spectrum and network measurements. Englewood Cliffs, N.J: Prentice Hall, 1993.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Spectrum and network measurements. Atlanta, Ga: Noble Pub. Corp., 2001.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Lee, Whan Su. The de-embedment of network-analyzer measurements. Monterey, California: Naval Postgraduate School, 1988.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Joseph Norbert Frans Marie à Campo. Sociale netwerk analyse: Begrippen en berekeningen. Rotterdam: Erasmus Universiteit, Faculteit Historische en Kunstwetenschappen, 2002.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Helfrick, Albert D. Electrical spectrum and network analyzers: A practical approach. San Diego: Academic Press, 1991.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Shoaib, Nosherwan. Vector Network Analyzer (VNA) Measurements and Uncertainty Assessment. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-44772-8.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Krumm, Heiko. Funktionelle Analyse von Kommunikationsprotokollen. Berlin: Springer, 1990.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Buchteile zum Thema "Network analyze"

Field, John G., Fredrik Wulff und Kenneth H. Mann. „The Need to Analyze Ecological Networks“. In Network Analysis in Marine Ecology, 3–12. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/978-3-642-75017-5_1.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Palus, Sebastian, Piotr Bródka und Przemysław Kazienko. „How to Analyze Company Using Social Network?“ In Knowledge Management, Information Systems, E-Learning, and Sustainability Research, 159–64. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-16318-0_18.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wang, Yao, und Qin Sun. „Bayesian Network Technology to Analyze Fault Trees“. In Lecture Notes in Electrical Engineering, 87–94. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-642-54233-6_9.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Xie, Feng, und Shuo Bai. „Using Data Field to Analyze Network Intrusions“. In Information Security Practice and Experience, 78–89. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11689522_8.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Diederichsen, Lars, Kim-Kwang Raymond Choo und Nhien-An Le-Khac. „A Graph Database-Based Approach to Analyze Network Log Files“. In Network and System Security, 53–73. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-36938-5_4.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bradley, Gordon, und H. Oliveira. „Network assistant (to construct, test, and analyze graph and network algorithms)“. In DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 75–84. Providence, Rhode Island: American Mathematical Society, 1994. http://dx.doi.org/10.1090/dimacs/015/07.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Fu, Quanquan, Changjun Hu, Wenwen Xu, Xiao He und TieShan Zhang. „Detect and Analyze Flu Outlier Events via Social Network“. In Web Technologies and Applications, 136–47. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-11119-3_13.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wang, Chen, Huaixi Wang, Nina Shu und Han Wang. „Complex Network Approaches to Analyze the Topology of China High Speed Railway Network“. In Advances in Natural Computation, Fuzzy Systems and Knowledge Discovery, 841–51. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-70665-4_91.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Fukushima, Atsushi, und Kozo Nishida. „Using the DiffCorr Package to Analyze and Visualize Differential Correlations in Biological Networks“. In Computational Network Analysis with R, 1–34. Weinheim, Germany: Wiley-VCH Verlag GmbH & Co. KGaA, 2016. http://dx.doi.org/10.1002/9783527694365.ch1.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Khaouja, Imane, Ibtissam Makdoun und Ghita Mezzour. „Using Social Network Analysis to Analyze Development Priorities of Moroccan Institutions“. In Social, Cultural, and Behavioral Modeling, 195–203. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-80387-2_19.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Network analyze"

Hu, Yanjing, Liaojun Pang, Qingqi Pei und Xu An Wang. „Analyze Network Protocol's Hidden Behavior“. In 2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC). IEEE, 2015. http://dx.doi.org/10.1109/3pgcic.2015.68.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Xiao, Xiaochun, Tiange Zhang und Gendu Zhang. „Access Graph to Analyze Network Vulnerabilities“. In 2008 Pacific-Asia Workshop on Computational Intelligence and Industrial Application (PACIIA). IEEE, 2008. http://dx.doi.org/10.1109/paciia.2008.183.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Peuhkuri, Markus. „Toolbox to analyze computer-network interaction“. In Voice, Video, and Data Communications, herausgegeben von Wai Sum Lai und Hisashi Kobayashi. SPIE, 1997. http://dx.doi.org/10.1117/12.290445.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wajahat, Ahsan, Ahsan Nazir, Faheem Akhtar, Sirajuddin Qureshi, Faheem ullah, Fahad Razaque und Anum Shakeel. „Interactively Visualize and Analyze Social Network Gephi“. In 2020 3rd International Conference on Computing, Mathematics and Engineering Technologies (iCoMET). IEEE, 2020. http://dx.doi.org/10.1109/icomet48670.2020.9073812.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Vergara, Arturo, Antolin Moral und Jorge Perez. „COSTA: A model to analyze next generation broadband access platform competition“. In 2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS). IEEE, 2010. http://dx.doi.org/10.1109/netwks.2010.5624919.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bumtsend, Uyangasaikhan, Murodbek Safaraliev, Anvari Ghulomzoda, Bakhtiyor Ghoziev, Javod Ahyoev und Ghulomabdol Ghulomabdolov. „The Unbalanced Modes Analyze Of Traction Loads Network“. In 2020 Ural Symposium on Biomedical Engineering, Radioelectronics and Information Technology (USBEREIT). IEEE, 2020. http://dx.doi.org/10.1109/usbereit48449.2020.9117758.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Hadzialic, Mesud, Mirko Skrbic, Kemal Huseinovic, Irvin Kocan, Jasmin Musovic, Alisa Hebibovic und Lamija Kasumagic. „An approach to analyze security of GSM network“. In 2014 22nd Telecommunications Forum Telfor (TELFOR). IEEE, 2014. http://dx.doi.org/10.1109/telfor.2014.7034366.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Khudoyarova, Anastasia, Mikhail Burlakov und Mikhail Kupriyashin. „Using Machine Learning to Analyze Network Traffic Anomalies“. In 2021 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (ElConRus). IEEE, 2021. http://dx.doi.org/10.1109/elconrus51938.2021.9396246.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Allaymoun, Mohammad Hamad, und Omer Awad Hag Hamid. „Business Intelligence Model to Analyze Social network Advertising“. In 2021 International Conference on Information Technology (ICIT). IEEE, 2021. http://dx.doi.org/10.1109/icit52682.2021.9491635.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wen, Yu, und Bo Yuan. „Use CNN-LSTM network to analyze secondary market data“. In the 2nd International Conference. New York, New York, USA: ACM Press, 2018. http://dx.doi.org/10.1145/3194206.3194226.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "Network analyze"

Nicholson, Mark A. Piecing Together the Network-Centric Puzzle: Using Operational Functions to Analyze Potential Coalition Partners. Fort Belvoir, VA: Defense Technical Information Center, Februar 2005. http://dx.doi.org/10.21236/ada464306.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

LIFE, ROY A., JOSEPH H. MAESTAS und DENNIS B. BATEMAN. Using Modeling and Simulation to Analyze Application and Network Performance at the Radioactive Waste and Nuclear Material Disposition Facility. Office of Scientific and Technical Information (OSTI), Juni 2003. http://dx.doi.org/10.2172/820891.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Al-Qadi, Imad, Egemen Okte, Aravind Ramakrishnan, Qingwen Zhou und Watheq Sayeh. Truck-Platoonable Pavement Sections in Illinois’ Network. Illinois Center for Transportation, Februar 2021. http://dx.doi.org/10.36501/0197-9191/21-002.

Der volle Inhalt der Quelle

Annotation:

Truck platooning has many benefits over traditional truck mobility. Literature shows that platooning improves safety and reduces fuel consumption between 5% and 15% based on platoon configuration. In Illinois, trucks carry more than 50% of freight tonnage and constitute 25% of the traffic on interstates. Deployment of truck platooning within interstate highways would result in significant fuel savings, but may have a direct impact on flexible pavement performance. The channelization of the platoon and reduced rest time between consecutive loads would accelerate the damage accumulation at the channelized position. Ultimately, this would lead to pavement service life reduction and a subsequent increase in maintenance and rehabilitation costs. Therefore, the main objective of this project is to quantify the effects of platooning on flexible pavements and provide guidelines for the state of Illinois by considering the aforementioned factors. Although the benefits of platooning are quantifiable, not every truck route is platoonable. For efficient platooning, trucks need to travel at a constant high speed for extended distances. The integrity of the platoon should be preserved because interfering vehicles would compromise the platooning benefits and road safety. An introduced high-level approach considers the volume/capacity of a roadway and the expected number of highway exit and entry conflicts. Using these parameters, each roadway section is assigned a level of platoonability, ranging from one to five—with five being the highest. A framework was developed to analyze the Illinois highway network. It was found that 89% of the network highway is platoonable under average capacity conditions.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Elliott, M. Report for CS 698-95 ?Directed Research ? Performance Modeling:? Using Queueing Network Modeling to Analyze the University of San Francisco Keck Cluster Supercomputer. Office of Scientific and Technical Information (OSTI), September 2005. http://dx.doi.org/10.2172/883809.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bednar, Amy. Topological data analysis : an overview. Engineer Research and Development Center (U.S.), Juni 2021. http://dx.doi.org/10.21079/11681/40943.

Der volle Inhalt der Quelle

Annotation:

A growing area of mathematics topological data analysis (TDA) uses fundamental concepts of topology to analyze complex, high-dimensional data. A topological network represents the data, and the TDA uses the network to analyze the shape of the data and identify features in the network that correspond to patterns in the data. These patterns extract knowledge from the data. TDA provides a framework to advance machine learning’s ability to understand and analyze large, complex data. This paper provides background information about TDA, TDA applications for large data sets, and details related to the investigation and implementation of existing tools and environments.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Fuentes, Rolando. Distribution Networks Tariff Design in the Era of Decentralization: A Business Model Approach. King Abdullah Petroleum Studies and Research Center, November 2020. http://dx.doi.org/10.30573/ks--2020-dp24.

Der volle Inhalt der Quelle

Annotation:

In this paper we discuss the unexplored two-way relationship between distribution network tariff design and the emergence of new business models in the power sector. Distribution network tariffs have traditionally used a cost accounting method. We suggest, instead, the use of a business model framework to analyze the extent to which emerging business models in the power sector change the way electricity distribution network services are priced and packaged.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Hossain, Niamat Ullah Ibne, Raed Jaradat, Seyedmohsen Hosseini, Mohammad Marufuzzaman und Randy Buchanan. A framework for modeling and assessing system resilience using a Bayesian network : a case study of an interdependent electrical infrastructure systems. Engineer Research and Development Center (U.S.), April 2021. http://dx.doi.org/10.21079/11681/40299.

Der volle Inhalt der Quelle

Annotation:

This research utilizes Bayesian network to address a range of possible risks to the electrical power system and its interdependent networks (EIN) and offers possible options to mitigate the consequences of a disruption. The interdependent electrical infrastructure system in Washington, D.C. is used as a case study to quantify the resilience using the Bayesian network. Quantification of resilience is further analyzed based on different types of analysis such as forward propagation, backward propagation, sensitivity analysis, and information theory. The general insight drawn from these analyses indicate that reliability, backup power source, and resource restoration are the prime factors contributed towards enhancing the resilience of an interdependent electrical infrastructure system.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Leoni, Paolo. Techno-economic comparison of the collected examples. IEA SHC Task 55, November 2020. http://dx.doi.org/10.18777/ieashc-task55-2020-0012.

Der volle Inhalt der Quelle

Annotation:

Subtask A “Network analysis and integration” focuses on the overall aspects of district heating and cooling networks with integrated solar thermal (ST) technologies. Particularly important are the cases in which the solar share is such to significantly influence the operation of the network and the other heat/cold supply units. In the present factsheet, the best-practice examples collected in the factsheet A-D1.1 are analyzed and compared.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Judkins, J. G. Automatic network analyzer procedures for 5045 klystron cavities. Office of Scientific and Technical Information (OSTI), Juli 1991. http://dx.doi.org/10.2172/5275580.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Marriner, J. Measureing the Wall Impedance with the Network Analyzer. Office of Scientific and Technical Information (OSTI), Dezember 1985. http://dx.doi.org/10.2172/948906.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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