Log in

Relevant bibliographies by topics / Networks dynamic / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Networks dynamic.

Dissertations / Theses on the topic 'Networks dynamic'

Author: Grafiati

Published: 25 May 2024

Last updated: 19 July 2025

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

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Networks dynamic.'

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.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Horsch, Michael C. "Dynamic Bayesian networks." Thesis, University of British Columbia, 1990. http://hdl.handle.net/2429/28909.

Full text

Abstract:

Given the complexity of the domains for which we would like to use computers as reasoning engines, an automated reasoning process will often be required to perform under some state of uncertainty. Probability provides a normative theory with which uncertainty can be modelled. Without assumptions of independence from the domain, naive computations of probability are intractible. If probability theory is to be used effectively in AI applications, the independence assumptions from the domain should be represented explicitly, and used to greatest possible advantage. One such representation is a

APA, Harvard, Vancouver, ISO, and other styles

2

Fard, Pedram J. "Dynamic reconfiguration of network topology in optical networks." College Park, Md. : University of Maryland, 2007. http://hdl.handle.net/1903/7412.

Full text

Abstract:

Thesis (Ph. D.) -- University of Maryland, College Park, 2007.<br>Thesis research directed by: Electrical Engineering. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.

APA, Harvard, Vancouver, ISO, and other styles

3

Robinson, Anthony John. "Dynamic error propagation networks." Thesis, University of Cambridge, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.303145.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Al-Dujaily, Ra'ed. "Embedded dynamic programming networks for networks-on-chip." Thesis, University of Newcastle upon Tyne, 2013. http://hdl.handle.net/10443/1884.

Full text

Abstract:

Relentless technology downscaling and recent technological advancements in three dimensional integrated circuit (3D-IC) provide a promising prospect to realize heterogeneous system-on-chip (SoC) and homogeneous chip multiprocessor (CMP) based on the networks-onchip (NoCs) paradigm with augmented scalability, modularity and performance. In many cases in such systems, scheduling and managing communication resources are the major design and implementation challenges instead of the computing resources. Past research efforts were mainly focused on complex design-time or simple heuristic run-time ap

APA, Harvard, Vancouver, ISO, and other styles

5

Hellmann, Tim. "Stable networks in static and dynamic models of network formation." Hamburg Kovač, 2009. http://d-nb.info/1001547497/04.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Ho, Koki. "Dynamic network modeling for spaceflight logistics with time-expanded networks." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/98557.

Full text

Abstract:

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Aeronautics and Astronautics, 2015.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Cataloged from student-submitted PDF version of thesis.<br>Includes bibliographical references (pages 139-145).<br>This research develops a dynamic logistics network formulation for high-level lifecycle optimization of space mission sequences in order to find an optimal space transportation architecture considering its technology trades ove

APA, Harvard, Vancouver, ISO, and other styles

7

Bienkowski, Marcin. "Page migration in dynamic networks." [S.l. : s.n.], 2005. http://deposit.ddb.de/cgi-bin/dokserv?idn=976779188.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

May, Alex. "Tensor networks for dynamic spacetimes." Thesis, University of British Columbia, 2017. http://hdl.handle.net/2429/62730.

Full text

Abstract:

Tensor networks give simple representations of complex quantum states. They have proven useful in the study of condensed matter systems and conformal fields, and recently have provided toy models of AdS/CFT. Underlying the tensor network - AdS/CFT connection is the association of a graph geometry with the tensor network. This geometry is most easily understood as containing only spatial directions. In the context of the AdS/CFT correspondence this limits tensor network toy models to describing static spacetimes. Here we look to extend tensor network models of AdS/CFT by capturing the geometry

APA, Harvard, Vancouver, ISO, and other styles

9

Lesiuk, Bryan Cameron. "Dynamic routing for measurement networks." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp05/MQ62556.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Afsariardchi, Niloufar. "Community detection in dynamic networks." Thesis, McGill University, 2013. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=114565.

Full text

Abstract:

A reasonable representation of some complex systems such as social and biological systems is a network topology that allows its components and interactions among them to change over time. Understanding the time-dependence of these networks can lead to invaluable insight about characteristics and structure of time-varying networks. In this thesis, several classes of static and dynamic clustering algorithms and ideas are reviewed. A challenge arising in dynamic clustering schemes is that the detected communities are not independent over time and the identified clusters at one point of time shou

APA, Harvard, Vancouver, ISO, and other styles

11

Laws, Christopher Neil. "Dynamic routing in queueing networks." Thesis, University of Cambridge, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.385435.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Cairns, David Edward. "Synchronization in dynamic neural networks." Thesis, University of Stirling, 1993. http://hdl.handle.net/1893/21611.

Full text

Abstract:

This thesis is concerned with the function and implementation of synchronization in networks of oscillators. Evidence for the existence of synchronization in cortex is reviewed and a suitable architecture for exhibiting synchronization is defined. A number of factors which affect the performance of synchronization in networks of laterally coupled oscillators are investigated. It is shown that altering the strength of the lateral connections between nodes and altering the connective scope of a network can be used to improve synchronization performance. It is also shown that complete connective

APA, Harvard, Vancouver, ISO, and other styles

13

Clegg, Richard G. "The statistics of dynamic networks." Thesis, University of York, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.412635.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Pensuwon, Wanida. "Stochastic dynamic hierarchical neural networks." Thesis, University of Hertfordshire, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.366030.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Ou, Jihong. "Dynamic scheduling of queueing networks." Thesis, Massachusetts Institute of Technology, 1991. http://hdl.handle.net/1721.1/13479.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Rajagopalan, Shreevatsa. "Distributed averaging in dynamic networks." Thesis, Massachusetts Institute of Technology, 2010. http://hdl.handle.net/1721.1/62315.

Full text

Abstract:

Thesis (S.M.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2010.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Cataloged from student-submitted PDF version of thesis.<br>Includes bibliographical references (p. 39-40).<br>The question of computing average of numbers present at nodes in a network in a distributed manner using gossip or message-passing algorithms has been of great recent interest across disciplines -- algorithms, control and

APA, Harvard, Vancouver, ISO, and other styles

17

Turcotte, Melissa. "Anomaly detection in dynamic networks." Thesis, Imperial College London, 2013. http://hdl.handle.net/10044/1/24673.

Full text

Abstract:

Anomaly detection in dynamic communication networks has many important security applications. These networks can be extremely large and so detecting any changes in their structure can be computationally challenging; hence, computationally fast, parallelisable methods for monitoring the network are paramount. For this reason the methods presented here use independent node and edge based models to detect locally anomalous substructures within communication networks. As a first stage, the aim is to detect changes in the data streams arising from node or edge communications. Throughout the thesis

APA, Harvard, Vancouver, ISO, and other styles

18

Dong, Dawei Hopfield John J. Hopfield John J. "Dynamic properties of neural networks /." Diss., Pasadena, Calif. : California Institute of Technology, 1991. http://resolver.caltech.edu/CaltechETD:etd-06202007-092922.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Dickison, Mark E. "Dynamic and interacting complex networks." Thesis, Boston University, 2012. https://hdl.handle.net/2144/31536.

Full text

Abstract:

Thesis (Ph.D.)--Boston University<br>PLEASE NOTE: Boston University Libraries did not receive an Authorization To Manage form for this thesis or dissertation. It is therefore not openly accessible, though it may be available by request. If you are the author or principal advisor of this work and would like to request open access for it, please contact us at open-help@bu.edu. Thank you.<br>This thesis employs methods of statistical mechanics and numerical simulations to study some aspects of dynamic and interacting complex networks. The mapping of various social and physical phenomena to comple

APA, Harvard, Vancouver, ISO, and other styles

20

Stapelberg, Dieter. "Link failure recovery among dynamic routes in telecommunication networks." Thesis, Stellenbosch : University of Stellenbosch, 2009. http://hdl.handle.net/10019.1/2591.

Full text

Abstract:

Thesis (MSc (Mathematical Sciences. Computer Science))--University of Stellenbosch, 2009.<br>ENGLISH ABSTRACT: Since 2002 data tra c has overtaken voice tra c in volume [1]. Telecom / Network operators still generate most of their income carrying voice tra c. There is however a huge revenue potential in delivering reliable guaranteed data services. Network survivability and recovery from network failures are integral to network reliability. Due to the nature of the Internet, recovery from link failures needs to be distributed and dynamic in order to be scalable. Link failure recovery sch

APA, Harvard, Vancouver, ISO, and other styles

21

Avidan, Lenoy. "Dynamic Shifting of Virtual Network Topologies for Network Attack Prevention." DigitalCommons@CalPoly, 2019. https://digitalcommons.calpoly.edu/theses/1986.

Full text

Abstract:

Computer networks were not designed with security in mind, making research into the subject of network security vital. Virtual Networks are similar to computer networks, except the components of a Virtual Network are in software rather than hardware. With the constant threat of attacks on networks, security is always a big concern, and Virtual Networks are no different. Virtual Networks have many potential attack vectors similar to physical networks, making research into Virtual Network security of great importance. Virtual Networks, since they are composed of virtualized network components, h

APA, Harvard, Vancouver, ISO, and other styles

22

Holzhauer, Sascha [Verfasser]. "Dynamic Social Networks in Agent-based Modelling : Increasingly Detailed Approaches of Network Initialisation and Network Dynamics / Sascha Holzhauer." Kassel : Kassel University Press, 2017. http://d-nb.info/1137030445/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Kachani, Soulaymane, and Georgia Perakis. "Modeling Travel Times in Dynamic Transportation Networks; A Fluid Dynamics Approach." Massachusetts Institute of Technology, Operations Research Center, 2001. http://hdl.handle.net/1721.1/5224.

Full text

Abstract:

In this paper, we take a fluid dynamics approach to determine the travel time in traversing a network's link. We propose a general model for travel time functions that utilizes fluid dynamics laws for compressible flow to capture a variety of flow patterns such as the formation and dissipation of queues, drivers' response to upstream congestion or decongestion and drivers' reaction time. We examine two variants of the model, in the case of separable velocity functions, which gives rise to two families of travel time functions for the problem; a polynomial and an exponential family. We analyze

APA, Harvard, Vancouver, ISO, and other styles

24

Alfred, Asterjadhi. "Network Coding for Cognitive Radio Networks." Doctoral thesis, Università degli studi di Padova, 2011. http://hdl.handle.net/11577/3422021.

Full text

Abstract:

Cognitive Radio Networks are a promising technology likely to be deployed in the very near future as a viable solution to the spectrum shortage problems faced by traditional wireless systems. Technological breakthroughs in the field of Software Defined Radios enabled the development of flexible cognitive radio transceivers capable of dynamically changing their transmission parameters in order to efficiently exploit the available wireless resources. This increased capability of cognitive radios to self adapt based on interactions with the surrounding environment makes them the perfect candidate

APA, Harvard, Vancouver, ISO, and other styles

25

Ewell, Cris Vincent. "Detection of Deviations From Authorized Network Activity Using Dynamic Bayesian Networks." NSUWorks, 2011. http://nsuworks.nova.edu/gscis_etd/146.

Full text

Abstract:

This research addressed one of the hard problems still plaguing the information security profession; detection of network activity deviations from authorized accounts when the deviations are similar to normal network activity. Specifically, when user and administrator type accounts are used for malicious activity, harm can come to the organization. Accurately modeling normal user network activity is hard to accomplish and detecting misuse is a complex problem. Much work has been done in the past with intrusion detection systems, but being able to detect masquerade events with high accuracy and

APA, Harvard, Vancouver, ISO, and other styles

26

Junuthula, Ruthwik Reddy. "Modeling, Evaluation and Analysis of Dynamic Networks for Social Network Analysis." University of Toledo / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=toledo1544819215833249.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Bradford, Robert D. "Solving dynamic battlespace movement problems using dynamic distributed computer networks /." Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2000. http://handle.dtic.mil/100.2/ADA380802.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Bradford, Robert D. III. "Solving dynamic battlespace movement problems using dynamic distributed computer networks." Thesis, Monterey, California. Naval Postgraduate School, 2000. http://hdl.handle.net/10945/7794.

Full text

Abstract:

Approved for public release, distribution is unlimited<br>This thesis develops an architecture for dynamic distributed military operations research. This architecture assumes that a network of heterogeneous computing devices connects forces throughout the battlespace. Both the raw data about the battlespace and the operations research models used to analyze this data are accessible to devices on this network. The thesis designs a system using this architecture that invokes operations research network optimization algorithms to solve problems involving movement of people and equipment over dyna

APA, Harvard, Vancouver, ISO, and other styles

29

Periorellis, Panayiotis. "Dynamic enterprise modelling : a methodology for animating dynamic social networks." Thesis, University of Newcastle Upon Tyne, 2000. http://hdl.handle.net/10443/2134.

Full text

Abstract:

Since the introduction of the Internet and the realisation of its potential companies have either transformed their operation or are in the process of doing so. It has been observed, that developments in I.T., telecommunications and the Internet have boosted the number of enterprises engaging into e-commerce, e-business and virtual enterprising. These trends are accompanied by re-shaping, transformation and changes in an enterprise's boundaries. The thesis gives an account of the research into the area of dynamic enterprise modelling and provides a modelling methodology that allows different r

APA, Harvard, Vancouver, ISO, and other styles

30

Eriksson, Kristoffer. "Dynamic Resource Allocation in Wireless Networks." Thesis, Linköping University, Communication Systems, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-56776.

Full text

Abstract:

<p>In this thesis we investigate different algorithms for dynamic resource allocation in wireless networks. We introduce a general framework for modeling systems whichis applicable to many scenarios. We also analyze a specific scenario with adaptivebeamforming and show how it fits into the proposed framework. We then studytwo different resource allocation problems: Quality-of-Service (QoS) constraineduser scheduling and sum-rate maximization. For user scheduling, we select some“good” set of users that is allowed to use a specific resource. We investigatedifferent algorithms with varying comple

APA, Harvard, Vancouver, ISO, and other styles

31

Lin, Wuqin. "Dynamic Control in Stochastic Processing Networks." Diss., Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/7105.

Full text

Abstract:

A stochastic processing network is a system that takes materials of various kinds as inputs, and uses processing resources to produce other materials as outputs. Such a network provides a powerful abstraction of a wide range of real world, complex systems, including semiconductor wafer fabrication facilities, networks of data switches, and large-scale call centers. Key performance measures of a stochastic processing network include throughput, cycle time, and holding cost. The network performance can dramatically be affected by the choice of operational policies. We propose a family of operat

APA, Harvard, Vancouver, ISO, and other styles

32

Baldine, Ilia. "Dynamic Reconfiguration in Broadcast WDM Networks." NCSU, 1998. http://www.lib.ncsu.edu/theses/available/etd-19980723-230505.

Full text

Abstract:

<p>In this research we study the problems associated with dynamic reconfiguration of broadcast WDM networks.Adaptability to the changing traffic conditions is viewed as one of the key features of multiwavelength optical networks, and this is the first comprehensive in-depth study of this problem area.Our contribution consists of identifying the three main questions related to network reconfiguration: a) how to balance the load across multiple wavelengths; b) deciding when it is best to reconfigure the network and c) performing the actual reconfiguration in an efficient manner, that minimizes c

APA, Harvard, Vancouver, ISO, and other styles

33

Li, Caiwei. "Dynamic scheduling of multiclass queueing networks." Diss., Georgia Institute of Technology, 2000. http://hdl.handle.net/1853/24339.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Garside, Simon. "Dynamic prediction of road traffic networks." Thesis, Lancaster University, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.387431.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Alnwaimi, Ghassen R. "Dynamic spectrum sharing in heterogeneous networks." Thesis, University of Surrey, 2013. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.606694.

Full text

Abstract:

The increasing demands for wireless spectrum and limited radio resources emphasise the need. for more efficient spectrum sharing mechanisms. Dynamic spectrum sharing (DSS) has been cited as a promising mechanism for managing the radio spectrum. The objectives are to achieve flexible spectrum usage, improve spectrum efficiency, and combat spectrum scarcity problem, which constitute the main motivations setting out the scope of. this thesis_ This thesis, first, presents a comprehensive survey of the general principles of current and state of art spectrum sharing practices, and approaches to futu

APA, Harvard, Vancouver, ISO, and other styles

36

Neophytou, Constantinos. "Dynamic Tree Switching for IP Networks." Thesis, Queen Mary, University of London, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.498910.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Wright, Robert John. "Water distribution networks with dynamic topology." Thesis, Imperial College London, 2015. http://hdl.handle.net/10044/1/58191.

Full text

Abstract:

The subdivision of water distribution networks (WDN) into zones, known as district metered areas (DMAs), is a popular approach to leakage management used by water companies. The DMAs are formed by permanently closing isolation valves at the boundaries of each zone (known as boundary valves). By forming discrete zones in the WDN, leakage estimates can be made at night when demand is low, which is used to prioritise pipe repair and replacement programmes. However, the permanent closure of boundary valves has also caused several disadvantages, including reduced network resilience to failure, sub-

APA, Harvard, Vancouver, ISO, and other styles

38

Klu, Joyce Kafui. "Opinion formation in dynamic social networks." Thesis, University of Oxford, 2017. https://ora.ox.ac.uk/objects/uuid:6418f526-5cda-41a2-9eb5-842ab40ca5f2.

Full text

Abstract:

Opinion dynamics in a society of interacting agents may lead to consensus or to the coexistence of different opinions. The interplay between social network change and opinion formation is complex, because the agents, their social interactions and the changing social structure over time, are themselves complex. DeGroot proposed a prescriptive model for achieving consensus, where agents revise their opinions at each time step by taking a weighted average of the opinions of neighbours. This thesis contains three main contributions. First, we introduce a generalisation of the DeGroot model and exa

APA, Harvard, Vancouver, ISO, and other styles

39

Pavone, Marco Ph D. Massachusetts Institute of Technology. "Dynamic vehicle routing for robotic networks." Thesis, Massachusetts Institute of Technology, 2010. http://hdl.handle.net/1721.1/59665.

Full text

Abstract:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2010.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (p. 149-156).<br>Recent years have witnessed great advancements in the sciences and technology of autonomy, robotics and networking. This dissertation develops concepts and algorithms for dynamic vehicle routing (DVR), that is, for the automatic planning of optimal multi-vehicle routes to provide service to demands (or more generally to perform tasks) that are generated over time by an exogenous process. We consider

APA, Harvard, Vancouver, ISO, and other styles

40

Moose, Robert Lewis. "Analysis of networks with dynamic topologies." Diss., Virginia Polytechnic Institute and State University, 1987. http://hdl.handle.net/10919/49862.

Full text

Abstract:

Dynamic hierarchical networks represent an architectural strategy for employing adaptive behavior in applications sensitive to highly variable external demands or uncertain internal conditions. The characteristics of such architectures are described, and the significance of adaptive capability is discussed. The necessity for assessing cost/benefit tradeoffs leads to the use of queueing network models. The general model, a network of M/M/1 queues in a random environment, is introduced and then is simplified so that the links may be treated as isolated M/M/1 queues in a random environment. This

APA, Harvard, Vancouver, ISO, and other styles

41

McCallen, Scott J. "Mining Dynamic Structures in Complex Networks." Kent State University / OhioLINK, 2007. http://rave.ohiolink.edu/etdc/view?acc_num=kent1204154279.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Robinson, Jace D. "A Model for Seasonal Dynamic Networks." Wright State University / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=wright1525195522616039.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Ashibani, Majdi Ali Atoomi. "Dynamic bandwidth allocation in ATM networks." Doctoral thesis, University of Cape Town, 2002. http://hdl.handle.net/11427/12572.

Full text

Abstract:

Includes bibliographical references.<br>This thesis investigates bandwidth allocation methodologies to transport new emerging bursty traffic types in ATM networks. However, existing ATM traffic management solutions are not readily able to handle the inevitable problem of congestion as result of the bursty traffic from the new emerging services. This research basically addresses bandwidth allocation issues for bursty traffic by proposing and exploring the concept of dynamic bandwidth allocation and comparing it to the traditional static bandwidth allocation schemes.

APA, Harvard, Vancouver, ISO, and other styles

44

Von, Dassow George Robert Hartmann. "How dynamic networks animate living embryos /." Thesis, Connect to this title online; UW restricted, 2000. http://hdl.handle.net/1773/5237.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Dib, Omar. "Dynamic rerouting in multimodal transportation networks." Thesis, Bourgogne Franche-Comté, 2017. http://www.theses.fr/2017UBFCA015/document.

Full text

Abstract:

La mobilité humaine s'organise de nos jours dans un contexte multimodal avec des systèmes de transport particulièrement complexes. Le nombre d'usagers va croissant et de nouveaux modes de transport émergent jour après jour en même temps que de nouveaux comportements de mobilité. En conséquence, les utilisateurs se trouvent généralement confrontés à la nécessité de choisir entre plusieurs possibilités pour se rendre d'un point d'origine à leur lieu de destination. Dans le but de les aider à naviguer facilement à travers ces réseaux complexes, un système efficace d'information voyageurs doit êtr

APA, Harvard, Vancouver, ISO, and other styles

46

Alt, Eric Allen. "Structural modeling of dynamic polymer networks." Thesis, Massachusetts Institute of Technology, 2019. https://hdl.handle.net/1721.1/122711.

Full text

Abstract:

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Chemistry, 2019<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 125-131).<br>Polymer network based gels are an important class of materials with a wide range of applications. Dynamic polymer networks, which crosslink via the formation of reversible bonds, in particular have great potential as stimuli responsive, mechanically tunable, and self-healing materials. Many important emergent properties of these materials, such as mechanical strength, are mediated by their underlying network str

APA, Harvard, Vancouver, ISO, and other styles

47

Aliye, Kuerban <1988&gt. "Dynamic modelling trophic networks with BioPEPA." Master's Degree Thesis, Università Ca' Foscari Venezia, 2016. http://hdl.handle.net/10579/8140.

Full text

Abstract:

We consider a process algebra for modelling and the analysis of biochemical network, called Bio-PEPA. It is based on PEPA, a process algebra originally defined for the performance analysis of computer systems, and extended in order to handle some features of biochemical networks, such as stoichiometry and different kinds of kinetic laws. In Bio-PEPA we can make different kinds of analysis, static and dynamic. In this thesis we focus on the dynamic analysis of trophic networks. A trophic network represents an ecological community of organisms and their feeding relations. We will first consider

APA, Harvard, Vancouver, ISO, and other styles

48

Wion, Adrien. "Control plane in dynamic software networks." Electronic Thesis or Diss., Institut polytechnique de Paris, 2021. http://www.theses.fr/2021IPPAT007.

Full text

Abstract:

Au cours de ces dernières années, les réseaux se sont transformés passant d'une infrastructure à base de matériel dédié implémentant des fonctions statiques à des solutions logicielles plus flexibles. D'un côté, le SDN (Software Defined Networks) permet de contrôler les opérations de transmission, alors que de l'autre le NFV (Network Function Virtualization) crée des fonctions élastiques qui peuvent s'adapter à la demande. Jusqu'à présent, ces solutions ont été utilisées pour simplifier la gestion et l'exploitation des réseaux mais elles laissent également envisager un réseau qui peut automati

APA, Harvard, Vancouver, ISO, and other styles

49

Favier, Arnaud. "Eventual Leader Elections in Dynamic Networks." Electronic Thesis or Diss., Sorbonne université, 2022. http://www.theses.fr/2022SORUS059.

Full text

Abstract:

L'élection de leader est importante pour les services tolérants aux pannes dans les systèmes distribués asynchrones. En coordonnant les actions d'un ensemble de processus, elle permet de résoudre des problèmes d'accord comme le consensus, un problème fondamental en informatique distribuée. Des algorithmes de consensus, tel que Paxos, s'appuient sur un service d'élection de leader ultime, également appelé Omega. Omega renvoie l'identité d'un processus du système et garantit qu'après un certain temps, l'identité du même processus correct est toujours renvoyée. Plusieurs algorithmes d'élection de

APA, Harvard, Vancouver, ISO, and other styles

50

Petersen, Erick. "Dynamic link networks : Emulation and validation." Electronic Thesis or Diss., Institut polytechnique de Paris, 2024. http://www.theses.fr/2024IPPAS028.

Full text

Abstract:

À mesure que la demande de services interactifs, de multimédia et de capacités de réseau augmente dans les réseaux modernes, de nouveaux logiciels et/ou composants matériels devraient être intégrés. Par conséquent, le processus d'évaluation et de validation de ces nouvelles solutions est essentiel pour déterminer si elles sont performantes, fiables et robustes avant d'être déployées dans un réseau réel. L'émulation de réseau est de plus en plus utilisée pour répliquer le comportement de réseau réel à faible coût d'infrastructure et avec un niveau de réalisme plus élevé que les simulations. Cet

APA, Harvard, Vancouver, ISO, and other styles

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!