Tesis sobre el tema "Time-varying network"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte los 50 mejores tesis para su investigación sobre el tema "Time-varying network".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Explore tesis sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.
Afrasiabi, Rad Amir. "Social Network Analysis and Time Varying Graphs". Thesis, Université d'Ottawa / University of Ottawa, 2016. http://hdl.handle.net/10393/34441.
Texto completoKhan, Asif H. "Analysis of time varying load for minimum loss distribution reconfiguration". Diss., This resource online, 1992. http://scholar.lib.vt.edu/theses/available/etd-06062008-171313/.
Texto completoReber, David Patrick. "Exponential Stability of Intrinsically Stable Dynamical Networks and Switched Networks with Time-Varying Time Delays". BYU ScholarsArchive, 2019. https://scholarsarchive.byu.edu/etd/7136.
Texto completoOlanders, David. "Optimal Time-Varying Cash Allocation". Thesis, KTH, Matematisk statistik, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-273626.
Texto completoEn betalning är den mest fundamentala aspekten av handel som involverar kapital. De senaste åren har utvecklingen av nya betalmedel ökat drastiskt då världen fortsatt att utvecklas genom digitaliseringen. Utvecklingen har lett till en ökad efterfrågan på digitala betalningslösningar som kan hantera handel över hela världen. Då handel idag kan ske när som helst oberoende av var betalaren och betalningsmottagaren befinner sig, måste systemet som genomför betalningen alltid vara tillgängligt för att kunna förmedla handel mellan olika parter. Detta kräver att betalningssystemet alltid måste ha medel tillgängligt i efterfrågade länder och valutor för att handeln ska kunna genomföras. Den här uppsatsen fokuserar på hur kapital kostnadseffektivt kan omallokeras i ett betalsystem för att säkerställa att handel alltid är tillgängligt. Traditionellt har omallokeringen av kapital gjorts på ett regelbaserat sätt, vilket inte tagit hänsyn till kostnadsdimensionen och därigenom enbart fokuserat på själva omallokeringen. Den här uppsatsen använder metoder för att optimalt omallokera kapital baserat på kostnaderna för omallokeringen. Därigenom skapas en möjlighet att flytta kapital på ett avsevärt mer kostnadseffektivt sätt. När omallokeringsbesluten formuleras matematiskt som ett optimeringsproblem är kostnadsfunktionen formulerad som ett linjärt program med både Booleska och reella begränsningar av variablerna. Detta gör att traditionella lösningsmetoder för linjära program inte är användningsbara för att finna den optimala lösningen, varför vidareutveckling av tradtionella metoder tillsammans med mer avancerade metoder använts. Modellen utvärderades baserat på ett stort antal simuleringar som jämförde dess prestanda med det regelbaserade systemet. Den utvecklade modellen presterar en signfikant kostnadsreduktion i jämförelse med det regelbaserade systemet och överträffar därigenom det traditionellt använda systemet. Framtida arbete bör fokusera på att expandera modellen genom att utöka de potentiella överföringsmöjligheterna, att ta ökad hänsyn till osäkerhet genom en bayesiansk hantering, samt slutligen att integrera samtliga kostnadsaspekter i nätverket.
Maråk, Knut Petter. "The Time Varying Elastance Model used as a Boundary Condition in Arterial Network Simulations". Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for konstruksjonsteknikk, 2013. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-23203.
Texto completoNakajima, Natsu. "Genetic Network Completion Using Dynamic Programming and Least-Squares Fitting". 京都大学 (Kyoto University), 2015. http://hdl.handle.net/2433/195987.
Texto completoUnsal, Ahmet Dundar. "Estimation Of Time-dependent Link Costs Using Gps Track Data". Master's thesis, METU, 2006. http://etd.lib.metu.edu.tr/upload/3/12608010/index.pdf.
Texto completothey rarely exist on back roads, secondary roads and streets due to their deployment costs. Today, telematics systems offer fleet operators to track their fleet remotely from a central system. Those systems provide data about the behaviors of vehicles with time information. Therefore, a tracking system can be used as an alternative to detector-based systems on estimating travel speeds on networks. This study aims to provide methods to estimate network characteristics using the data collected directly from fleets consisting of global positioning system (GPS) receiver equipped vehicles. GIS technology is used to process the collected GPS data spatially to match digital road maps. After matching, time-dependent characteristics of roads on which tracked vehicles traveled are estimated. This estimation provides data to perform a time-dependent network analysis. The methods proposed in this study are tested on traffic network of Middle East Technical University campus. The results showed that the proposed methods are capable of measuring time-dependent link-travel times on the network. Peak hours through the network are clearly detected.
Liang, Qingkai. "Survivability of time-varying networks". Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/98694.
Texto completoCataloged from PDF version of thesis.
Includes bibliographical references (pages 81-83).
Time-varying graphs are a useful model for networks with dynamic connectivity such as mmWave networks and vehicular networks, yet, despite their great modeling power, many important features of time-varying graphs are still poorly understood. In this thesis, we study the survivability properties of time-varying networks against unpredictable interruptions. We first show that the traditional definition of survivability is not effective in time-varying networks and propose a new survivability framework. To evaluate survivability of time-varying networks under the new framework, we propose two metrics that are analogous to MaxFlow and MinCut in static networks. We show that some fundamental survivability-related results such as Menger's Theorem only conditionally hold in timevarying networks. Then we analyze the complexity of computing the proposed metrics and develop several approximation algorithms. Finally, we conduct trace-driven simulations to demonstrate the application of our survivability framework in the robust design of a real-world bus communication network.
by Qingkai Liang.
S.M.
Slind, Jillian Rae. "Community detection in sparse time-varying networks". Thesis, University of British Columbia, 2014. http://hdl.handle.net/2429/50043.
Texto completoScience, Faculty of
Computer Science, Department of
Graduate
Demircin, Mehmet Umut. "Robust video streaming over time-varying wireless networks". Diss., Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/24790.
Texto completoCommittee Chair: Yucel Altunbasak; Committee Member: Chuanyi Ji; Committee Member: Ghassan AlRegib; Committee Member: Ozlem Ergun; Committee Member: Russell M. Mersereau.
Rossi, Luca. "Essays on volatility networks and uncertainty". Doctoral thesis, Universitat Pompeu Fabra, 2018. http://hdl.handle.net/10803/565613.
Texto completoAquesta tesi investiga empíricament diferents aspectes de la volatilitat variable. El Capítol 1 estima un TVP-FAVAR i recupera una xarxa de connexions dinàmiques entre les volatilitats de accions europees. Proposem una metodologia d’estimació ad-hoc que es demostri que supera els enfocaments estàndard i els models competidors. El Capítol 2 es centra en el seguiment de la connectivitat dinàmica entre les volatilitats sectorials dels Estats Units mitjançant descomposicions generalitzadas de variància d’errors de previsió amb un model Bayesià. A diferència de les estimacions obtingudes amb finestres enrotllables, permetem que els paràmetres variïn de manera més flexible. Mostrem que existeix una relació estable entre l’estructura de la xarxa i els règims de volatilitat vigents en un moment determinat. El Capítol 3 estima el component variable inesperat de la volatilitat dels pressupostos fiscals a Itàlia. Mostrem que els períodes de major volatilitat fiscal inesperada probablement són recessius. Les polítiques expansives només són efectives quan no s’acompanyen d’increments d’incertesa.
Wilmot, Timothy Allen Jr. "Intelligent Controls for a Semi-Active Hydraulic Prosthetic Knee". Cleveland State University / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=csu1315531357.
Texto completoDoan, William. "Temporal Closeness in Knowledge Mobilization Networks". Thesis, Université d'Ottawa / University of Ottawa, 2016. http://hdl.handle.net/10393/34756.
Texto completoKhanna, Gaurav. "Modelling and Reliability Evaluation of Time Varying Communication Networks". Thesis, Curtin University, 2020. http://hdl.handle.net/20.500.11937/83026.
Texto completoKim, Ha Yang. "Modeling and tracking time-varying clock drifts in wireless networks". Diss., Georgia Institute of Technology, 2014. http://hdl.handle.net/1853/53988.
Texto completoDas, Subhro. "Distributed Linear Filtering and Prediction of Time-varying Random Fields". Research Showcase @ CMU, 2016. http://repository.cmu.edu/dissertations/765.
Texto completoSmetana, Bedřich. "Algebraizace a parametrizace přechodových relací mezi strukturovanými objekty s aplikacemi v oblasti neuronových sítí". Doctoral thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2020. http://www.nusl.cz/ntk/nusl-433543.
Texto completoSu, Jionglong. "Online predictions for spatio-temporal systems using time-varying RBF networks". Thesis, University of Sheffield, 2011. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.578701.
Texto completoYee, George Carleton University Dissertation Information and Systems Science. "Optimal routing in dimensioning communication networks with time-varying traffic demand". Ottawa, 1985.
Buscar texto completoPantelidou, Anna. "Scheduling transmissions in wireless ad-hoc networks with time-varying topologies". College Park, Md. : University of Maryland, 2004. http://hdl.handle.net/1903/2142.
Texto completoThesis research directed by: Dept. of Electrical Engineering and Computer Engineering. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.
Starnini, Michele. "Time-varying networks approach to social dynamics : from individual to collective behavior". Doctoral thesis, Universitat Politècnica de Catalunya, 2014. http://hdl.handle.net/10803/284221.
Texto completoLa revolució de dades en ciències socials ha revelat els complexos patrons de les interaccions en la dinàmica humana, com ara l'heterogeneïtat i la burstiness dels contactes socials. La dimensió temporal recentment descoberta en les interaccions socials demana un esforç renovat en l'anàlisi i la modelització de xarxes empíriques de variables en el temps. Aquesta tesi contribueix a aquest programa, a través d'un doble recorregut: la modelització dels sistemes socials dinàmics i l'estudi de l'impacte de substrats temporalment variables en els processos dinàmics que es desenvolupen sobre ells. En primer lloc, hem introduït els conceptes bàsics i definicions del formalisme de les xarxes de variables en el temps, i presentem i analitzem algunes dades empíriques de les interaccions humanes de proximitat, discutint les seves principals propietats estadístiques. El cos principal de l'exposició es divideix llavors en dues parts. A la primera part ens centrem en els models de dinàmica social, amb un doble objectiu: la reproducció de les propietats de dades empíriques i el tractament analític dels models considerats. Hem presentat i discutit el comportament d'un model simple capaç de replicar les principals propietats estadístiques de les interaccions empíriques cara a cara, a diferents nivells d'agregació: individuals, grupals i d'escala col·lectiva. El model considera els individus que participen en un context social com si realitzaran una caminada a l'atzar en l'espai, i es basa en el concepte de "atractivitat social": persones socialment atractives tenen més probabilitat de que la gent que els envolta interactuï amb ells. Ens hem ocupat també de l'estudi analític del model "activity driven", destinat a capturar la relació entre la dinàmica de les xarxes variables en el temps i les propietats de les seves corresponents xarxes socials agregats. A través d'un mapeig amb el formalisme de variables ocultes, hem obtingut expressions analítiques per a les propietats topològiques de les xarxes integrades en el temps i les propietats de connectivitat de la xarxa en evolució, en funció del temps d'integració i de la forma del potencial d'activitat. A la segona part de la tesi hem estudiat el comportament dels processos difusius sobre xarxes temporals constituïdes per les dades empíriques de interaccions humanes. Primer considerem el procés de "random walk", o camí aleatori, i gràcies a les diferents estratègies de randomització que hem introduït, podem destacar el paper crucial de la correlacions temporals en alentir l'exploració del camí aleatori. Després hem dirigit la nostra atenció a la difusió d'epidèmies, centrant-nos en el cas d'un simple model SI que es desenvolupa a les xarxes temporals, complementat amb l'estudi de l'impacte de diferents estratègies d'immunització sobre la difusió de la infecció. Abordem, en particular, l'efecte de la longitud de la finestra temporal utilitzada per reunir informació per tal de dissenyar l'estratègia d'immunització, sobre l'eficàcia de la mateixa vacunació, descobrint que una quantitat limitada d'informació és suficient per maximitzar l'efecte del protocol de vacunació. El nostre treball obre interessants perspectives per a futures investigacions, en particular pel que fa a la possibilitat d'ampliar el formalisme de xarxes de temps variable a sistemes múltiplex, compostos de diverses capes de xarxes interrelacionades, en la qual els mateixos individus interactuen entre ells en diferents capes. L'anàlisi empírica de les xarxes múltiplex és encara en la seva infantesa, de fet, mentre que la mineria de dades de grans sistemes socials, de diverses capes, és madur per ser explotat, demanant un esforç en l'anàlisi i modelització. La nostra comprensió de l'impacte de la dimensió temporal de les xarxes sobre els processos dinàmics que es desenvolupen sobre ells es pot aplicar a sistemes més complexos de múltiples capes, estudiant l'efecte de la correlació temporal entre les capes en la dinàmica de difusió.
Opasanon, Sathaporn. "On finding paths and flows in multicriteria, stochastic and time-varying networks". College Park, Md. : University of Maryland, 2004. http://hdl.handle.net/1903/2067.
Texto completoThesis research directed by: Civil Engineering. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.
Celik, Guner Dincer. "Scheduling algorithms for throughput maximization in time-varying networks with reconfiguration delays". Thesis, Massachusetts Institute of Technology, 2012. http://hdl.handle.net/1721.1/78442.
Texto completoCataloged from PDF version of thesis.
Includes bibliographical references (p. 247-258).
We consider the control of possibly time-varying wireless networks under reconfiguration delays. Reconfiguration delay is the time it takes to switch network resources from one subset of nodes to another and it is a widespread phenomenon observed in many practical systems. Optimal control of networks has been studied to a great extent in the literature, however, the significant effects of reconfiguration delays received limited attention. Moreover, simultaneous presence of time-varying channels and reconfiguration delays has never been considered and we show that it impacts the system fundamentally. We first consider a Delay Tolerant Network model where data messages arriving randomly in time and space are collected by mobile collectors. In this setting reconfiguration delays correspond to travel times of collectors. We utilize a combination of wireless transmission and controlled mobility to improve the system delay scaling with load [rho] from [theta](1/(1-[rho])²) to [theta](1/1-[rho]), where the former is the delay for the corresponding system without wireless transmission. We propose control algorithms that stabilize the system whenever possible and have optimal delay scaling. Next, we consider a general queuing network model under reconfiguration delays and interference constraints which includes wireless, satellite and optical networks as special cases. We characterize the impacts of reconfiguration delays on system stability and delay, and propose scheduling algorithms that persist with service schedules for durations of time based on queue lengths to minimize negative impacts of reconfiguration delays. These algorithms provide throughput-optimality without requiring knowledge of arrival rates since they dynamically adapt inter-switching durations to stochastic arrivals. Finally, we present optimal scheduling under time-varying channels and reconfiguration delays, which is the main contribution of this thesis. We show that under the simultaneous presence of these two phenomenon network stability region shrinks, previously suggested policies are unstable, and new algorithmic approaches are necessary. We propose techniques based on state-action frequencies of Markov Decision Process theory to characterize the network stability region and propose throughput-optimal algorithms. The state-action frequency technique is applicable to a broad class of systems with or without reconfiguration delays, and provides a new framework for characterizing network stability region and developing throughput-optimal scheduling policies.
by Güner Dinc̦er C̦elik.
Ph.D.
Ortiz, Lugo Alvaro A. Sr. "Qualitative Analysis of Pathogen Dynamics within Cyclic and Time-Varying Water Networks". University of Cincinnati / OhioLINK, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1563872208710325.
Texto completoSurges, Gregory. "Generative Audio Systems| Musical Applications of Time-Varying Feedback Networks and Computational Aesthetics". Thesis, University of California, San Diego, 2015. http://pqdtopen.proquest.com/#viewpdf?dispub=3741016.
Texto completoThis dissertation is focused on the development of generative audio systems - a term used describe generative music systems that generate both formal structure and synthesized audio content from the same audio-rate computational process. In other words, a system wherein the synthesis and organizational processes are inseparable and operate at the sample level.
First, a series of generative software systems are described. These systems each employ a different method to create generativity and, though they are not strictly generative audio systems, they lay important groundwork for the rest of the discussion as ideas from and contributions to the fields of generative algorithmic composition, computational aesthetics, music information dynamics, and digital signal processing are introduced.
Second, the dissertation investigates the use of a novel signal processing technique in which time-varying allpass filters are placed into feedback networks, producing synthesis structures capable of yielding interesting emergent sonic behaviors. Ideas from the field of computational aesthetics are employed to allow a large system built from these synthesis structures to become “aesthetically aware”. Many theories about computational aesthetics center around a favorable balance between order and complexity in a stimulus - a successful artistic work is neither too orderly nor too complex. Using a model of human perception based on the “mere exposure” effect, which describes how listener appreciation and boredom change as they experience repeated exposure to a stimulus, the AAS-4 system autonomously determines when and how to modify its own parameters to avoid repetitions that may lead to boredom in listeners.
The dissertation concludes with objective analysis of the generative system by considering the complexity of its output from an information-theoretic perspective. It was found that the generative audio system described here is capable of producing output with equivalent complexity to that of real-world musical examples. It is also shown that the level of complexity in the generated audio and real-world examples falls in-between the low complexity of silence and sinusoids and the maximal complexity of white noise, corresponding with the theories from computational aesthetics. Future directions of this work are also described. Two appendices describing related topics that would disrupt the flow of the dissertation are included.
Dror, Shahar. "Identification and control of non-linear time-varying dynamical systems using artificial neural networks". Thesis, Monterey, California. Naval Postgraduate School, 1992. http://hdl.handle.net/10945/23693.
Texto completoNeely, Michael J. (Michael James) 1975. "Dynamic power allocation and routing for satellite and wireless networks with time varying channels". Thesis, Massachusetts Institute of Technology, 2003. http://hdl.handle.net/1721.1/16616.
Texto completoIncludes bibliographical references (p. 283-295).
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Satellite and wireless networks operate over time varying channels that depend on attenuation conditions, power allocation decisions, and inter-channel interference. In order to reliably integrate these systems into a high speed data network and meet the increasing demand for high throughput and low delay, it is necessary to develop efficient network layer strategies that fully utilize the physical layer capabilities of each network element. In this thesis, we develop the notion of network layer capacity and describe capacity achieving power allocation and routing algorithms for general networks with wireless links and adaptive transmission rates. Fundamental issues of delay, throughput optimality, fairness, implementation complexity, and robustness to time varying channel conditions and changing user demands are discussed. Analysis is performed at the packet level and fully considers the queueing dynamics in systems with arbitrary, potentially bursty, arrival processes. Applications of this research are examined for the specific cases of satellite networks and ad-hoc wireless networks. Indeed, in Chapter 3 we consider a multi-beam satellite downlink and develop a dynamic power allocation algorithm that allocates power to each link in reaction to queue backlog and current channel conditions. The algorithm operates without knowledge of the arriving traffic or channel statistics, and is shown to achieve maximum throughput while maintaining average delay guarantees. At the end of Chapter 4, a crosslinked collection of such satellites is considered and a satellite separation principle is developed, demonstrating that joint optimal control can be implemented with separate algorithms for the downlinks and crosslinks.
(cont.) Ad-hoc wireless networks are given special attention in Chapter 6. A simple cell- partitioned model for a mobile ad-hoc network with N users is constructed, and exact expressions for capacity and delay are derived. End-to-end delay is shown to be O(N), and hence grows large as the size of the network is increased. To reduce delay, a transmission protocol which sends redundant packet information over multiple paths is developed and shown to provide O(vN) delay at the cost of reducing throughput. A fundamental rate- delay tradeoff curve is established, and the given protocols for achieving O(N) and O(vN) delay are shown to operate on distinct boundary points of this curve. In Chapters 4 and 5 we consider optimal control for a general time-varying network. A cross-layer strategy is developed that stabilizes the network whenever possible, and makes fair decisions about which data to serve when inputs exceed capacity. The strategy is decoupled into separate algorithms for dynamic flow control, power allocation, and routing, and allows for each user to make greedy decisions independent of the actions of others. The combined strategy is shown to yield data rates that are arbitrarily close to the optimally fair operating point that is achieved when all network controllers are coordinated and have perfect knowledge of future events. The cost of approaching this fair operating point is an end-to-end delay increase for data that is served by the network.
by Michael J. Neely.
Ph.D.
Ráček, Tomáš. "Rychlé číslicové filtry pro signály EKG". Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2011. http://www.nusl.cz/ntk/nusl-219241.
Texto completoNatarajan, Anand. "Aeroelasticity of Morphing Wings Using Neural Networks". Diss., Virginia Tech, 2002. http://hdl.handle.net/10919/28267.
Texto completoPh. D.
Kourentzes, Nikolaos. "Input variable selection for time series forecasting with artificial neural networks : an empirical evaluation across varying time series frequencies". Thesis, Lancaster University, 2009. http://eprints.lancs.ac.uk/60234/.
Texto completoQUET, Pierre-Francois D. "A ROBUST CONTROL THEORETIC APPROACH TO FLOW CONTROLLER DESIGNS FOR CONGESTION CONTROL IN COMMUNICATION NETWORKS". The Ohio State University, 2002. http://rave.ohiolink.edu/etdc/view?acc_num=osu1032194223.
Texto completoSkitt, Peter John Christopher. "An assessment of neural networks for the recognition of time-varying signals in engine condition monitoring". Thesis, University of the West of England, Bristol, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.293808.
Texto completoStankovic, Nikola. "Set-based control methods for systems affected by time-varying delay". Thesis, Supélec, 2013. http://www.theses.fr/2013SUPL0025/document.
Texto completoWe considered the process regulation which is based on feedback affected by varying delays. Proposed approach relies on set-based control methods. One part of the thesis examines active control design for compensation of delays in sensor-to controller communication channel. This problem is regarded in a general perspective of the fault tolerant control where delays are considered as a particular degradation mode of the sensor. Obtained results are also adapted to the systems with redundant sensing elements that are prone to abrupt faults. In this sense, an unified framework is proposed in order to address the control design with outdated measurements provided by unreliable sensors.Positive invariance for linear discrete-time systems with delays is outlined in the second part of the thesis. Concerning this class of dynamics, there are two main approaches which define positive invariance. The first one relies on rewriting a delay-difference equation in the augmented state-space and applying standard analysis and control design tools for the linear systems. The second approach considers invariance in the initial state-space. However, the initial state-space characterization is still an open problem even for the linear case and it represents our main subject of interest. As a contribution, we provide new insights on the existence of the positively invariant sets in the initial state-space. Moreover, a construction algorithm for the minimal robust D-invariant set is outlined. Additionally, alternative invariance concepts are discussed
Batista, Edson Anibal de Macedo Reis. "Estudo da topologia de redes de conex?o funcional no c?rtex sensorial prim?rio e hipocampo durante o sono de ondas lentas". Universidade Federal do Rio Grande do Norte, 2013. http://repositorio.ufrn.br:8080/jspui/handle/123456789/15492.
Texto completoCoordena??o de Aperfei?oamento de Pessoal de N?vel Superior
Complex network analysis is a powerful tool into research of complex systems like brain networks. This work aims to describe the topological changes in neural functional connectivity networks of neocortex and hippocampus during slow-wave sleep (SWS) in animals submited to a novel experience exposure. Slow-wave sleep is an important sleep stage where occurs reverberations of electrical activities patterns of wakeness, playing a fundamental role in memory consolidation. Although its importance there s a lack of studies that characterize the topological dynamical of functional connectivity networks during that sleep stage. There s no studies that describe the topological modifications that novel exposure leads to this networks. We have observed that several topological properties have been modified after novel exposure and this modification remains for a long time. Major part of this changes in topological properties by novel exposure are related to fault tolerance
A an?lise da topologia de redes ? uma poderosa ferramenta no estudo de sistemas complexos tal como as redes cerebrais. Este trabalho procura descrever as mudan?as na topologia de redes de conex?o funcional em neur?nios do c?rtex sensorial e do hipocampo durante o sono de ondas lentas (SWS) em animais expostos ? novidade. O sono de ondas lentas ? um importante estado do sono onde h? reverbera??o de padr?es de atividade el?trica ocorridos na vig?lia, tendo com isso papel fundamental na consolida??o de mem?ria. Apesar de sua import?ncia ainda n?o h? estudos que caracterizam a din?mica da topologia de redes de conex?o funcional durante este estado. Tampouco h? estudos que descrevem as modifica??es topol?gicas que a exposi??o ? novidade traz a essas redes. Observamos que v?rias propriedades topol?gicas s?o modificadas ap?s a exposi??o ? novidade e que tais modifica??es se mant?m por um longo per?odo de tempo. A maior parte das propriedades modificadas pela exposi??o ? novidade est? relacionada ? toler?ncia ? falha
Koher, Andreas [Verfasser], Philipp [Akademischer Betreuer] Hövel, Philipp [Gutachter] Hövel y Kathy [Gutachter] Lüdge. "Modelling epidemics on networks with static and time-varying topologies / Andreas Koher ; Gutachter: Philipp Hövel, Kathy Lüdge ; Betreuer: Philipp Hövel". Berlin : Technische Universität Berlin, 2019. http://d-nb.info/1196200041/34.
Texto completoHage-Packhäuser, Sebastian [Verfasser], Michael [Akademischer Betreuer] Dellnitz y Peter [Akademischer Betreuer] Ashwin. "Structural treatment of time-varying dynamical system networks in the light of hybrid symmetries / Sebastian Hage-Packhäuser. Betreuer: Michael Dellnitz ; Peter Ashwin". Paderborn : Universitätsbibliothek, 2012. http://d-nb.info/1036892042/34.
Texto completoMunasib, Abdul B. A. "Lifecycle of social networks: A dynamic analysis of social capital accumulation". The Ohio State University, 2005. http://rave.ohiolink.edu/etdc/view?acc_num=osu1121441394.
Texto completoBarjon, Matthieu. "Autour des groupes tolérants aux délais dans les flottes mobiles communicantes". Thesis, Bordeaux, 2016. http://www.theses.fr/2016BORD0298/document.
Texto completoAmong the major developments in computer science, we distinguish the emergence of mobile wireless technologies. The current development of these technologies allows for direct ad-hoc communications between many types of mobile entities, such as vehicles, land robots or drones. In a network of such devices, the set of communication links that exists at a given instant depends upon the distances between the entities. As a result, the topology of the network changes continuously as the entities move. The common assumption on connectivity may not be relevant in this case, but another kind of connectivity called temporal connectivity is often alvailable over time and space. The goal of this thesis has been the development of algorithms for fleets of mobile devices in the case of delay-tolerant networks. In a simpler way, the delay-tolerant networks are networks where some parts can be isolated during a certain time without problems. We are interested, in particular, in the case where the devices are organised as groups, and where the notion of group itself survives to these deconnections. Hence, a big part of this thesis relates to the notion of delay-tolerant groups (DTN groups). In our case, these deconnections are limited in time and we speak of a "bounded temporal diameter" within the group. The fact of limiting the temporal diameter of the group enables it to distinguish between temporary deconnections and final loss (crash or other) of some nodes
Neggaz, Mohammed Yessin. "Automatic classification of dynamic graphs". Thesis, Bordeaux, 2016. http://www.theses.fr/2016BORD0169/document.
Texto completoDynamic networks consist of entities making contact over time with one another. A major challenge in dynamic networks is to predict mobility patterns and decide whether the evolution of the topology satisfies requirements for the successof a given algorithm. The types of dynamics resulting from these networks are varied in scale and nature. For instance, some of these networks remain connected at all times; others are always disconnected but still offer some kind of connectivity over time and space (temporal connectivity); others are recurrently connected,periodic, etc. All of these contexts can be represented as dynamic graph classes corresponding to necessary or sufficient conditions for given distributed problems or algorithms. Given a dynamic graph, a natural question to ask is to which of the classes this graph belongs. In this work we provide a contribution to the automation of dynamic graphs classification. We provide strategies for testing membership of a dynamic graph to a given class and a generic framework to test properties in dynamic graphs. We also attempt to understand what can still be done in a context where no property on the graph is guaranteed through the distributed problem of maintaining a spanning forest in highly dynamic graphs
Ananduta, Wayan Wicak. "Non-centralized optimization-based control schemes for large-scale energy systems". Doctoral thesis, TDX (Tesis Doctorals en Xarxa), 2019. http://hdl.handle.net/10803/669263.
Texto completoLos esquemas de control no centralizados aplicados a sistemas a gran escala, entre los que se incluyen las redes energéticas, son más flexibles, escalables y fiables que sus equivalentes centralizados. Dichos beneficios pueden obtenerse empleando un conjunto de controladores locales, donde cada uno de ellos es responsable de una parte del sistema, en lugar de una entidad central que controle la totalidad del sistema.Asimismo,el uso de una estructura de control no centralizada podría ser, en algunos casos, necesario, dado el problema de intratabilidad del método centralizado. Por consiguiente, la presente tesis trata sobre el estudio de enfoques de control no centralizados basados en optimización para redes energéticas a gran escala. Principalmente, esta tesis se centra en los procesos de comunicación y cooperación llevados a cabo por los controladores locales , que constituyen partes esenciales de dichos esquemas . A lo largo de esta tesis, el control predictivo basado en modelos se usa para resolver el problema de expedir energia en redes energéticas a gran escala desde un punto de vista económico. En arquitecturas no centralizadas, los controladores locales deben resolver dicho problema de forma cooperativa, el cual se formula como un problema de optimización convexo con restricciones de acoplamiento en los enlaces entre nodos, que debe ser resuelto en cada instante de tiempo. Para ello, el método de Lagrangiano aumentado se utiliza inicialmente para descomponer el problema y diseñar dos métodos de optimización distribuidos , que son iterativos y requieren que los controladores locales intercambien información entre ellos en cada iteración . A continuación, se muestra que la secuencia generada por estos métodos converge a la solución óptima a condición de que se cumplan ciertas condiciones,incluyendo cómo los controladores deben comunicarse y cooperar. Sin embargo, en la práctica,la comunicación no siempre es perfecta, es decir,el supuesto de comunicación requerido no se cumple. En el caso de fallos en los enlaces de comunicación, los métodos distribuidos podrían no ser capaces de proporcionar una solución. Para paliar este problema, se diseña un protocolo de información basado en consenso.l'v1ás aún, los métodos de optimización distribuidos se extienden a fin de que sean capaces de trabajar en redes con comunicaciones aleatorias y actualizaciones asíncronas, es decir,redes en que no todos los controladores realicen las actualizaciones . En esta configuración se muestran la convergencia y el orden de convergencia de dichos algoritmos. Se muestra, además, la implementación de estos métodos en el control predictivo económico basado en modelos para redes energéticas. La discusión incluye las técnicas que pueden usarse para reducir el número de iteraciones, así como el desempeño de los métodos, a través de un estudio numérico. Teniendo en cuenta que los métodos anteriormente mencionados requieren una comunicación intensa,se propone otro esquema no centralizado que proporciona un compromiso entre intensidad de comunicación y suboptimalidad . Dicha estrategia consiste en volver a particionar en línea el sistema con el objetivo de obtener subsistemas autosuficientes,formando coaliciones de subsistemas que no lo sean por separado,y descomponiendo el problema económico de expedición de energía en subproblemas de tipo coalicional. En este esquema ,cada subsistema se comunica únicamente con aquellos otros subsistemas que pertenezcan a la misma coalición, reduciendo asi el tráfico de comunicación. En particular, cuando todos los subsistemas son autosuficientes, el intercambio de información ya no es necesario. Finalmente,se considera el problema de la cooperación durante la implementación de las decisiones Específicamente, algunos subsistemas no acatan las decisiones tomadas con el fin de lograr un desempeño propio superior a expensas de empeorar el desempeño de otros subsistemas. Es por esto que, con el fin de lidiar con este problema, se propone un esquema resiliente, el cual consiste en un método estocástico para hacer las decisiones más robustas frente a tal comportamiento adverso, y un método de identificación y mitigación basado en evaluación de hipótesis usando inferencia bayesiana. En general, el esquema propuesto logra mitigar el efecto de los subsistemas incumplidores sobre el resto, y en un caso concreto, también permite identificar los subsistemas adversos.
Els esquemes de control no centralitzats aplicats a sistemes a gran escala, entre els quals s’inclouen les xarxes energètiques, són més flexibles, escalables i fiables que els seus equivalents centralitzats. Aquests beneficis es poden obtenir fent servir un conjunt de controladors locals, en què cadascun d’ells és responsable d’una part del sistema, en lloc d’una entitat central que controli la totalitat del sistema. Així mateix, l’ús d’una estructura de control no centralitzada podria ser, en alguns casos, necessari, donat el problema d’intractabilitat del mètode centralitzat. Per tant, la present tesi tracta sobre l’estudi d’enfocaments de control no centralitzats basats en optimització per a xarxes energètiques a gran escala. Principalment, aquesta tesi se centra en els processos de comunicació i cooperació duts a terme pels controladors locals, que constitueixen parts essencials d’aquests esquemes. Al llarg d’aquesta tesi, el control predictiu basat en models s’utilitza per a resoldre el problema d’expedició d’energia en xarxes energètiques a gran escala des d’un punt de vista econòmic. En arquitectures no centralitzades, els controladors locals han de resoldre aquest problema de forma cooperativa, formulat com un problema d’optimització convex amb restriccions d’acoblament en els enllaços entre nodes i que ha de ser resolt a cada instant de temps. A tal efecte, el mètode de Lagrangià augmentat s’utilitza inicialment per a descomposar el problema i dissenyar dos mètodes d’optimització distribuïts, que són iteratius i requereixen que els controladors locals intercanviïn informació entre ells a cada iteració. A continuació, es mostra que la seqüència generada per aquests mètodes convergeix a la solució òptima si es compleixen certes condicions, incloent la manera en què els controladors s’han de comunicar i cooperar. No obstant això, a la pràctica, la comunicació no és sempre perfecta, és a dir, el supòsit de comunicació perfecta no es compleix. En el cas de fallades en els enllaços de comunicació, els mètodes distribuïts podrien no ser capaços de proporcionar una solució. Per a resoldre aquest problema, es dissenya un protocol d’informació basat en consens. A més, els mètodes d’optimització distribuïts s’amplien per tal que siguin capaços de treballar en xarxes amb comunicacions aleatòries i actualitzacions asíncrones, és a dir, xarxes en què no tots els controladors realitzin les actualitzacions. En aquestes configuracions es mostren la convergència i l’ordre de convergència d’aquests algoritmes. A més, es mostra també la implementació d’aquests mètodes en el control predictiu econòmic basat en models per a xarxes energètiques. La discussió inclou les tècniques que es poden emprar per a reduir el nombre d’iteracions, així com el rendiment dels mètodes, fent servir un estudi numèric. Tenint en compte que els mètodes anteriorment esmentats requereixen una comunicació intensa, es proposa un altre esquema no centralitzat que proporciona un compromís entre intensitat de comunicació i suboptimalitat. Aquesta estratègia consisteix en tornar a particionar el sistema en línia amb l’objectiu d’obtenir subsistemes autosuficients, formant coalicions de subsistemes que no ho siguin per separat, i descomposant el problema econòmic d’expedició d’energia en subproblemes de tipus coalicional. En aquest esquema, cada subsistema es comunica únicament amb aquells altre subsistemes que pertanyin a la mateixa coalició, reduint així el trànsit de comunicació. En particular, quan tots els sistemes són autosuficients, l’intercanvi d’informació deixa de ser necessari. Finalment, es considera el problema de la cooperació durant la implementació de les decisions. Específicament, alguns subsistemes no acaten les decisions preses amb la finalitat de millorar el propi rendiment a costa de disminuir el d’altres subsistemes. És per això que, a fi de solucionar aquest problema, es proposa un esquema resilient, el qual consisteix en un mètode estocàstic per fer les decisions més robustes davant d’aquest comportament advers, i un mètode d’identificació i mitigació basat en evaluar hipòtesis utilitzant inferència bayesiana. En general, l’esquema proposat aconsegueix mitigar l’efecte que els subsistemes no obedients exerceixen sobre la resta, i en un cas concert, també permet identificar els subsistemes adversos.
ABSTRAKSI (Indfonesian) Skema kendali yang tidak tersentralisasi untuk sistem berskala besar, seperti sistem aringan energi, lebih fleksibel, skalabel, dan reliabel dibandingkan dengan skema tersentralisasi. Keuntungan ini diperoleh dari terdapatnya satu set pengendali lokal, yang hanya bertanggung jawab terhadap satu partisi dari sistem tersebut, daripada jika hanya terdapat satu entitas yang mengendalikan seluruh sistem. Bahkan dalam beberapa sistem, penerapan struktur kendali yang tidak tersentralisasi menjadi keharusan karena adanya permasalahan intraktabilitas dari metode tersentralisasi. Oleh karena itu, disertasi ini bertujuan untuk melakukan studi pada metode kendali berdasarkan optimisasi dengan struktur yang tidak tersentralisasi untuk sistem energi berskala besar. Khususnya, disertasi ini memfokuskan pada proses komunikasi dan kooperasi pengendali‐pengendali lokal, yang merupakan bagian integral dalam skema yang dimaksud. Pada disertasi ini, sistem kontrol prediktif (model predictive control (MPC)) diterapkan untuk menyelesaikan optimisasi economic dispatch pada sistem energi berskala besar. Dalam arsitektur yang tidak tersentralisasi, pengendali‐pengendali lokal harus menyelesaikan permasalahan economic dispatch secara kooperatif. Permasalahan economic dispatch ini diformulasikan sebagai optimisasi yang konveks dan memiliki konstrain terkopling. Oleh karena itu, pendekatan Lagrange yang teraugmentasi diterapkan untuk mendekomposisi permasalahan optimisasi terkait. Pendekatan ini juga digunakan untuk merancang dua metode optimisasi terdistribusi, yang iteratif dan mengharuskan pengendali‐pengendali lokal bertukar informasi satu sama lain pada setiap iterasi. Sekuensi yang dihasilkan dari kedua metode tersebut akan terkonvergensi pada suatu solusi yang optimal apabila beberapa kondisi, yang meliputi bagaimana pengendali harus berkomunikasi dan berkooperasi, terpenuhi. Namun, pada praktiknya, proses komunikasi yang terjadi mungkin tidak selalu sempurna, dalam hal ini asumsi pada proses komunikasi yang dibutuhkan tidak terpenuhi. Pada kasus kegagalan jaringan komunikasi, metode terdistribusi yang dirancang mungkin tidak dapat menemukan solusinya. Oleh karena itu, suatu protokol untuk pertukaran informasi yang berdasarkan pada konsensus dirancang untuk mengatasi permasalahan ini. Selanjutnya, dua metode terdistribusi yang telah dirancang juga dikembangkan lebih jauh sehingga metode‐metode tersebut dapat bekerja pada jaringan komunikasi stokastik dengan proses yang asinkron, yaitu proses dimana tidak semua pengendali selalu melakukan pembaruan. Dalam hal ini, konvergensi dan laju konvergensi dari metode yang dirancang dipertunjukkan. Selain itu, implementasi dari metode terdistribusi pada sistem economic dispatch berbasis MPC juga dibahas. Diskusi pada bagian ini mencakup beberapa teknik yang dapat digunakan untuk mengurangi jumlah iterasi dan performa dari metode‐metode yang dirancang pada suatu studi numerik. Dengan pertimbangan bahwa metode‐metode yang disebut sebelumnya membutuhkan komunikasi yang intensif, maka sebuah skema alternatif, yang memberikan trade‐off antara intensitas komunikasi dan suboptimalitas, juga dirancang. Skema ini terdiri dari repartisi sistem online yang bertujuan untuk mendapatkan subsistemsubsistem yang swasembada, pembentukan koalisi untuk subsistem‐subsistem yang tidak swasembada, dan dekomposisi permasalahan economic dispatch menjadi subproblem berbasis koalisi. Dalam skema ini, tiap subsistem hanya perlu berkomunikasi dengan subsistem‐subsistem lain yang berada pada koalisi yang sama; sehingga mengurangi aliran komunikasi. Jika semua subsistem yang terbentuk swasembada, maka pertukaran informasi tidak dibutuhkan sama sekali. Pada akhirnya, disertasi ini juga membahas mengenai suatu permasalahan koperasi dalam masa implementasi keputusan (solusi). Pada permasalahan kooperasi ini, terdapat beberapa subsistem yang tidak menuruti keputusan (solusi), misalnya dengan tujuan untuk mendapatkan kinerja yang lebih baik dan di saat yang bersamaan memperburuk kinerja subsistem lainnya. Maka, sebuah skema resilien yang dapat mengatasi permasalahan ini dirumuskan. Skema tersebut terdiri dari sebuah metode stokastik untuk merobustifikasi keputusan terhadap perilaku adversari dan sebuah metode identifikasi dan mitigasi yang berdasarkan pada pengujian hipotesis dengan menggunakan inferensi Bayes. Skema yang diusulkan, secara umum, dapat memitigasi pengaruh subsistem yang tidak patuh pada subsistem reguler, dan pada kasus tertentu, juga dapat mengidentifikasi subsistem yang menjadi adversari.
Peñarrocha, Alós Ignacio. "Sensores virtuales para procesos con medidas escasas y retardos temporales". Doctoral thesis, Universitat Politècnica de València, 2008. http://hdl.handle.net/10251/3882.
Texto completoPeñarrocha Alós, I. (2006). Sensores virtuales para procesos con medidas escasas y retardos temporales [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/3882
Palancia
Fiter, Christophe. "Contribution à la commande robuste des systèmes à échantillonnage variable ou contrôlé". Phd thesis, Ecole Centrale de Lille, 2012. http://tel.archives-ouvertes.fr/tel-00773127.
Texto completo"Time-varying network optimization problems". 1999. http://library.cuhk.edu.hk/record=b6073189.
Texto completoThesis (Ph.D.)--Chinese University of Hong Kong, 1999.
Includes bibliographical references (p. 193-206).
Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web.
Mode of access: World Wide Web.
Abstracts in English and Chinese.
Wu, Zong-Xiu y 吳宗修. "Application of Neural Network Adaptive Controller in Time-Varying System". Thesis, 2019. http://ndltd.ncl.edu.tw/handle/r3djyq.
Texto completo龍華科技大學
機械工程系碩士班
107
In traditional adaptive control, the gradient descent method or least square method is used to estimate the parameters of a time-varying system. The singularity problem in numerical analysis is easily caused due to the errors of numerical rounding and external environmental disturbances in computer calculation, which will affect the response and stability of the closed-loop control system. In this paper, a neural network adaptive controller is proposed. The parameters of a time-varying system are estimated online by using the neural network controller. The control parameters of the self-tuning regulator are calculated by using the pole assignment method. Finally, the experimental results show that the neural network adaptive controller has great stability and fault-tolerance in numerical analysis when estimating the parameters of a highly uncertain time-varying system. Moreover, the stability time, overshoot and mean square error are better than the traditional self-tuning regulator, which proves that the proposed neural network adaptive controller has excellent response characteristics and robustness.
Robinson, Joshua Westly. "Modeling Time-Varying Networks with Applications to Neural Flow and Genetic Regulation". Diss., 2010. http://hdl.handle.net/10161/3109.
Texto completoMany biological processes are effectively modeled as networks, but a frequent assumption is that these networks do not change during data collection. However, that assumption does not hold for many phenomena, such as neural growth during learning or changes in genetic regulation during cell differentiation. Approaches are needed that explicitly model networks as they change in time and that characterize the nature of those changes.
In this work, we develop a new class of graphical models in which the conditional dependence structure of the underlying data-generation process is permitted to change over time. We first present the model, explain how to derive it from Bayesian networks, and develop an efficient MCMC sampling algorithm that easily generalizes under varying levels of uncertainty about the data generation process. We then characterize the nature of evolving networks in several biological datasets.
We initially focus on learning how neural information flow networks change in songbirds with implanted electrodes. We characterize how they change in response to different sound stimuli and during the process of habituation. We continue to explore the neurobiology of songbirds by identifying changes in neural information flow in another habituation experiment using fMRI data. Finally, we briefly examine evolving genetic regulatory networks involved in Drosophila muscle differentiation during development.
We conclude by suggesting new experimental directions and statistical extensions to the model for predicting novel neural flow results.
Dissertation
Hsieh, Cheng-sheng y 謝政晟. "Scalable Coding and Network Transmission of Dynamic Time-varying 3D Meshes". Thesis, 2010. http://ndltd.ncl.edu.tw/handle/89172018311112470993.
Texto completoChiang, Wen-Sheng y 江文聲. "Reiable Routing Path Choice in Dynamic and Stochastic Time-Varying in Tansportation Network". Thesis, 2001. http://ndltd.ncl.edu.tw/handle/37794094760596648323.
Texto completo國立臺灣大學
土木工程學研究所
89
The road users not only concern travel time but also care about the probability of reach destination. The study considers stochastic, time-varying transportation network, where the travel time on the network should be represented as random variables. The probability distribution functions vary with time. The paper first identifies a set of relationships between the mean and variance of the travel time that is dynamic and stochastic in network. Upon these relationships, compute the reliability index of arriving destination in time, and use the index as link weight to generate routing decisions. Lastly, analysis the trade-off relation between travel time and reliability, provide different routing paths for users to make decisions.
Hsin-Chang, Huang. "Design and Realization of Stabilizing Network Control Schemes with Uncertain Time-Varying Communication Delays". 2006. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0005-2408200616304700.
Texto completoHsu, Zeng-Wei y 許增尉. "Identification of Instantaneous Modal Parameters of A Time Varying Structure via A Neural Network". Thesis, 2007. http://ndltd.ncl.edu.tw/handle/smfu6h.
Texto completo國立交通大學
土木工程系所
96
Time varying systems find many applications in various fields. In mechanical and civil engineering, a system with active control devices of modifying stiffness or damping of the system is a time varying system. When a structure is damaged under dynamic loading, the structure normally displays changes in stiffness and damping with time. The changes with time in stiffness and damping of a system result in time varying instantaneous model parameters is an important issue in damage assessment of a structure. The present work develops a novel procedure of establishing BP neural network of a time varying system and estimating instantaneous model parameters of the system from established neural network. The connective weights and thresholds in a neural network are assumed as functions of time and are expanded by polynomials. A weighted least-squares approach is applied to determine the coefficients of the polynomials. Because of using the weighted least-squares approach, the coefficients of the polynomials also depend on time. Consequently, only low orders of polynomials are needed to expand the connective weights and thresholds. The feasibility of the proposed procedure is demonstrated by processing numerically simulated dynamic responses of a nonlinear system and a time-varying linear system. It is also performed to investigate the effects of weighting function in the weighted least-square approach, polynomial order, and noise on establishing a suitable neural network and determining instantaneous model parameters. Finally, the proposed procedure is applied to process measured dynamics responses of a RC structure under shaking table tests. The experimental structure has been shaken to perform nonlinear behaviors. When dramatic changes are observed in the slope of the measured relationship between force and displacement for the experimental structure, the identified instantaneous model parameters also show significant changes.
Huang, Hsin-Chang y 黃信彰. "Design and Realization of Stabilizing Network Control Schemes with Uncertain Time-Varying Communication Delays". Thesis, 2006. http://ndltd.ncl.edu.tw/handle/82136762680487121992.
Texto completo國立中興大學
電機工程學系所
94
It is usually difficult to build a real-time (RT) control network using the standard TCP/IP and 10 BASE-T Ethernet, because the medium access control (MAC) protocol of 10 BASE-T Ethernet, the 1-persistent carrier sense multiple access with collision detection (CSMA/CD) protocol, has unpredictable time delay characteristics, and congestion effect caused queueing delay time. When RT packets are transported over an ordinary 10 BASE-T Ethernet, RT packets from a node may experience a large time delay. This may sometimes cause closed-loop instability and performance degradation. To improve the influence of time delays while maintaining performance, we propose a compensating scheme which consists of two compensators- a fuzzy-PID controller and a wavelet neuron network compensator. The proposed design is experimentally verified to show its effectiveness and superiority.