Rozprawy doktorskie: „Dynamic Systems”

1

Zhang, Liqian. "Optimal H2 model reduction for dynamic systems /". Hong Kong : University of Hong Kong, 2000. http://sunzi.lib.hku.hk/hkuto/record.jsp?B21841548.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

Piveropoulos, Giannis. "Dynamic object-oriented systems". Thesis, University of York, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.298492.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

張立茜 i Liqian Zhang. "Optimal H2 model reduction for dynamic systems". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2000. http://hub.hku.hk/bib/B31241372.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

4

Gupta, Amit. "Model reduction and simulation of complex dynamic systems /". Online version of thesis, 1990. http://hdl.handle.net/1850/11265.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

5

Rafiliu, Sergiu. "Stability of Adaptive Distributed Real-TimeSystems with Dynamic Resource Management". Doctoral thesis, Linköpings universitet, Programvara och system, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-98721.

Pełny tekst źródła

Streszczenie:

Today's embedded distributed real-time systems, are exposed to large variations in resource usage due to complex software applications, sophisticated hardware platforms, and the impact of their run-time environment. As eciency becomes more important, the applications running on these systems are extended with on-line resource managers whose job is to adapt the system in the face of such variations. Distributed systems are often heterogeneous, meaning that the hardware platform consists of computing nodes with dierent performance, operating systems, and scheduling policies, linked through one or more networks using dierent protocols. In this thesis we explore whether resource managers used in such distributed embedded systems are stable, meaning that the system's resource usage is controlled under all possible run-time scenarios. Stability implies a bounded worst-case behavior of the system and can be linked with classic real-time systems' properties such as bounded response times for the software applications. In the case of distributed systems, the stability problem is particularly hard because software applications distributed over the dierent resources generate complex, cyclic dependencies between the resources, that need to be taken into account. In this thesis we develop a detailed mathematical model of an adaptive, distributed real-time system and we derive conditions that, if satised, guarantee its stability.

Style APA, Harvard, Vancouver, ISO itp.

6

Zhong, Zhian. "Power Systems Frequency Dynamic Monitoring System Design and Applications". Diss., Virginia Tech, 2005. http://hdl.handle.net/10919/28707.

Pełny tekst źródła

Streszczenie:

Recent large-scale blackouts revealed that power systems around the world are far from the stability and reliability requirement as they suppose to be. The post-event analysis clarifies that one major reason of the interconnection blackout is lack of wide area information. Frequency dynamics is one of the most important parameters of an electrical power system. In order to understand power system dynamics effectively, accurately measured wide-area frequency is needed. The idea of building an Internet based real-time GPS synchronized wide area Frequency Monitoring Network (FNET) was proposed to provide the imperative dynamic information for the large-scale power grids and the implementation of FNET has made the synchronized observations of the entire US power network possible for the first time. The FNET system consists of Frequency Disturbance Recorders (FDR), which work as the sensor devices to measure the real-time frequency at 110V single-phase power outlets, and an Information Management System (IMS) to work as a central server to process the frequency data. The device comparison between FDR and commercial PMU (Phasor Measurement Unit) demonstrate the advantage of FNET. The web visualization tools make the frequency data available for the authorized users to browse through Internet. The research work addresses some preliminary observations and analyses with the field-measured frequency information from FNET. The original algorithms based on the frequency response characteristic are designed to process event detection, localization and unbalanced power estimation during frequency disturbances. The analysis of historical cases illustrate that these algorithms can be employed in real-time level to provide early alarm of abnormal frequency change to the system operator. The further application is to develop an adaptive under frequency load shedding scheme with the processed information feed in to prevent further frequency decline in power systems after disturbances causing dangerous imbalance between the load and generation.
Ph. D.

Style APA, Harvard, Vancouver, ISO itp.

7

Hughes, Jonathan L. "Applications of Stability Analysis to Nonlinear Discrete Dynamical Systems Modeling Interactions". VCU Scholars Compass, 2015. http://scholarscompass.vcu.edu/etd/3819.

Pełny tekst źródła

Streszczenie:

Many of the phenomena studied in the natural and social sciences are governed by processes which are discrete and nonlinear in nature, while the most highly developed and commonly used mathematical models are linear and continuous. There are significant differences between the discrete and the continuous, the nonlinear and the linear cases, and the development of mathematical models which exhibit the discrete, nonlinear properties occurring in nature and society is critical to future scientific progress. This thesis presents the basic theory of discrete dynamical systems and stability analysis and explores several applications of this theory to nonlinear systems which model interactions involving economic agents and biological populations. In particular we will explore the stability properties of equilibria associated with inter-species and intergenerational population dynamics in biology and market price and agent composition dynamics in economics.

Style APA, Harvard, Vancouver, ISO itp.

8

Monga, Pavinder. "A System Dynamics Model of the Development of New Technologies for Ship Systems". Thesis, Virginia Tech, 2001. http://hdl.handle.net/10919/35258.

Pełny tekst źródła

Streszczenie:

System Dynamics has been applied to various fields in the natural and social sciences. There still remain countless problems and issues where understanding is lacking and the dominant theories are event-oriented rather than dynamic in nature. One such research area is the application of the traditional systems engineering process in new technology development. The Navy has been experiencing large cost overruns in projects dealing with the implementation of new technologies on complex ship systems. We believe that there is a lack of understanding of the dynamic nature of the technology development process undertaken by aircraft-carrier builders and planners. Our research effort is to better understand the dynamics prevalent in the new technology development process and we use a dynamic modeling technique, namely, System Dynamics in our study.

We provide a comprehensive knowledge elicitation process in which members from the Newport News Shipbuilding, the Naval Sea Command Cost Estimating Group, and the Virginia Tech System Performance Laboratory take part in a group model building exercise. We build a System Dynamics model based on the information and data obtained from the experts. Our investigation of the dynamics yields two dominant behaviors that characterize the technology development process. These two dynamic behaviors are damped oscillation and goal seeking. Furthermore, we propose and investigate four dynamic hypotheses in the system. For the current structure of the model, we see that an increase in the complexity of new technologies leads to an increase in the total costs, whereas a increase in the technology maturity leads to a decrease in the total costs in the technology development process. Another interesting insight is that an increase in training leads to a decrease in total costs.
Master of Science

Style APA, Harvard, Vancouver, ISO itp.

9

Caronni, Germano. "Dynamic security in communication systems /". [S.l.] : [s.n.], 1999. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=13156.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

Salloum, Mohammed. "Towards dynamic performance measurement systems". Thesis, Mälardalen University, School of Innovation, Design and Engineering, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-10016.

Pełny tekst źródła

Streszczenie:

The purpose of this report is to single out and apply the most critical factors for dynamic performance meausrement systems. The report concludes that the existence in practice of theoretically important aspects are diverse and that the most appropriate way of governing the aspects are through the creation of a performance management process.

The theoretical chapter is established for dual purposes. The first is to give the reader a comprehensive understanding of what has been done in the field of performance measurement and management so far and the second is to answer the first research question imposed.

The empirical chapter investigates to what degree the existence of factors singled out in theory are present in practice. Further, the chapter also answers research question two.

Finally the result and analysis chapters focuses on cross-analysing the case studies made and generate a recommendation. Research question three is answered under these headings.

PREPARE

Style APA, Harvard, Vancouver, ISO itp.

11

Reichenbach, Tobias. "Dynamic patterns of biological systems". Diss., lmu, 2008. http://nbn-resolving.de/urn:nbn:de:bvb:19-84101.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

12

Dabdoub, Margaret-Rose Madeleine. "Intelligent dynamic space management systems". FIU Digital Commons, 1996. http://digitalcommons.fiu.edu/etd/2648.

Pełny tekst źródła

Streszczenie:

The objective of this work is to design, simulate and synthesize a dynamic space controller system. The concept of space allocation and management can be applied to more than physical space. It may also be taken in the contexts of memory, network or bus management. The management and allocation of any space depends mostly on the twin factors of demand and availability. Time, the size and amount of space available, as well as the number of requests for the spaces, must also be considered. The proposed design has the capability to monitor multiple spaces for vacancies, length of time occupied and to dynamically track the number and location of available spaces. This system is easily programmed to adapt to the user’s application and is modular in design in order to facilitate expansion. The specific problem addressed in this work is a parking lot controller.

Style APA, Harvard, Vancouver, ISO itp.

13

Baumann, Andrew Computer Science &amp Engineering Faculty of Engineering UNSW. "Dynamic update for operating systems". Awarded by:University of New South Wales. Computer Science and Engineering, 2007. http://handle.unsw.edu.au/1959.4/28356.

Pełny tekst źródła

Streszczenie:

Patches to modern operating systems, including bug fixes and security updates, and the reboots and downtime they require, cause tremendous problems for system users and administrators. The aim of this research is to develop a model for dynamic update of operating systems, allowing a system to be patched without the need for a reboot or other service interruption. In this work, a model for dynamic update based on operating system modularity is developed and evaluated using a prototype implementation for the K42 operating system. The prototype is able to update kernel code and data structures, even when the interfaces between kernel modules change. When applying an update, at no point is the system's entire execution blocked, and there is no additional overhead after an update has been applied. The base runtime overhead is also very low. An analysis of the K42 revision history shows that approximately 79% of past performance and bug-fix changes to K42 could be converted to dynamic updates, and the proportion would be even higher if the changes were being developed for dynamic update. The model also extends to other systems such as Linux and BSD, that although structured modularly, are not strictly object-oriented like K42. The experience with this approach shows that dynamic update for operating systems is feasible given a sufficiently-modular system structure, allows maintenance patches and updates to be applied without disruption, and need not constrain system performance.

Style APA, Harvard, Vancouver, ISO itp.

14

Gagnon, Gregory. "Dynamic analysis of economic systems". Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0019/NQ53728.pdf.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

15

Qu, Zhihua. "Robust control of dynamic systems". Diss., Georgia Institute of Technology, 1990. http://hdl.handle.net/1853/13452.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

16

McCaskey, Suzanne D. "Robust design of dynamic systems". Thesis, Georgia Institute of Technology, 1994. http://hdl.handle.net/1853/24223.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

17

Crane, John Stephen. "Dynamic binding for distributed systems". Thesis, Imperial College London, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.484185.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

18

Wilhelmij, Gerrit Paul. "Symbolic simulation of dynamic systems". Thesis, University of Cambridge, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.305630.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

19

Roewe, James M. "Fault tolerant dynamic agent systems". Thesis, Massachusetts Institute of Technology, 2005. http://hdl.handle.net/1721.1/33347.

Pełny tekst źródła

Streszczenie:

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005.
Includes bibliographical references (p. 67-68).
Partial system snapshots reduce the cost per node to only depend on the size of the connected group instead of the size of the full system. These groups can be determined during system operation by using the communication patterns between nodes. The number of nodes that must rollback after a failure is limited to the size of these snapshot groups, reducing the work lost. These changes to snapshot algorithms are necessary because the cost per node for a snapshot increases and the expected time between failures decreases as the size of the system grows.
by James M. Roewe.
M.Eng.

Style APA, Harvard, Vancouver, ISO itp.

20

Singh, Prince Sc D. Massachusetts Institute of Technology. "Neuromorphic control of dynamic systems". Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/119292.

Pełny tekst źródła

Streszczenie:

Thesis: Sc. D., Massachusetts Institute of Technology, Department of Aeronautics and Astronautics, 2018.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 127-145).
Arguably, the agility of a robotic system is dictated by the speed of its processing pipeline, i.e., the speed of data acquisition plus data processing from a robot's on-board vision sensors. Specifically, one ideally hopes that this pipeline offer fresh measurements at a high temporal resolution with low-latency in a computationally-cheap manner for efficient control. This desirable situation may be hard to come by for majority of the current vision-based robotic applications that rely on the traditional CCD-/CMOS-pipeline, as one would be in search for traditional cameras that offer a high sampling rate (thus, high temporal resolution) whose potentially redundant (thus, not fresh) and synchronous output must be processed with low-latency in a computationally-cheap manner. For instance, processing the synchronous series of conventional camera images, which embed possibly redundant levels of intensities may greatly hinder the fast reaction times required by robots while expending power. This issue warrants the need for faster sensors in order to truly address the underlying perception problem for high-performance systems that need to operate under power constraints. To this end, we capitalize upon the merits of a recently introduced biologically inspired and computationally-cheap alternative to traditional cameras-called Neuromorphic Vision Sensors whose pixels independently and asynchronously (thus, high temporal resolution) fire, in the order of micro-seconds (thus, low-latency and high temporal resolution), a stream of non-redundant (thus, fresh) brightness changes represented as binary numbers (±1), termed retinal events, based on a trigger condition that is defined on a logarithmic scale. These properties offer a faster processing pipeline and hint that the Neuromorphic sensor would be a promising candidate to facilitate high-speed robotic applications. However, existing computer-vision based algorithms designed for processing periodic measurements cannot be directly adapted to process retinal events, as these are fired aperiodically, and are ambiguous since they are binary. As an additional challenge, in practice, many retinal events are misfired due to the presence of underlying sensor circuitry noise (not associated to physical brightness changes in the environment) and we term these as spurious events. The merits and operational constraints of this vision sensor mandates the development of a corresponding control-theoretic setup. Thus, the contributions of this dissertation are twofold: 1) to design a control algorithm that processes de-noised retinal events to facilitate a prescribed control task, and 2) to propose a de-noising procedure that mitigates the effect of spuriosity in retinal events. The first part of this dissertation, investigates the problem of controlling (i.e., stabilization and regulation) a Continuous-Time Linear Time Invariant (CT-LTI) system using retinal events generated from an idealistic model of a Neuromorphic Vision Sensor, which is an instance of a broad family of signal change detection sensors frequently encountered in practice. The contribution is to present a novel control design procedure that stabilizes and regulates a hybrid system, consisting of the CT-LTI system and the discrete-event signal change observation model, to a desired set-point. Moreover, the set of thresholds (sufficient conditions) for the given system to fulfill the prescribed control task is provided. The proposed controller is then extended to handle the case of noise in both the system dynamics as well as the observation model; thus, accounts for spurious events in this setting. The second part of this dissertation proposes a de-noising algorithm-Spuriosity Filter (SF)-and is motivated by the practical need to reduce spurious events whilst working with general observation models. The construction of SF is based on the fundamental lack of spatial correlation between spurious events and the algorithm trades off pixel resolution to produce a cleaner event stream on larger spatial scales by seeking a form of 'consensus' between neighboring pixels. At the core of our analysis lies a formal equivalence relation, defined as a means to track brightness, between our filter and a lower-resolution neuromorphic sensor with reduced noise levels. As a consequence of the principled analysis, we highlight important properties that any filter, which processes asynchronous noisy retinal events must respect and have not been accounted for by existing works. The effectiveness of the proposed control-theoretic setup for the illustrative task of heading regulation is illustrated over a range of systems: from numerical experiments to a laboratory testbed.
by Prince Singh.
Sc. D.

Style APA, Harvard, Vancouver, ISO itp.

21

Itani, Sleiman M. "Dynamic systems and subadditive functionals". Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/53282.

Pełny tekst źródła

Streszczenie:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 125-131).
Consider a problem where a number of dynamic systems are required to travel between points in minimum time. The study of this problem is traditionally divided into two parts: A combinatorial part that assigns points to every dynamic system and assigns the order of the traversal of the points, and a path planning part that produces the appropriate control for the dynamic systems to allow them to travel between the points. The first part of the problem is usually studied without consideration for the dynamic constraints of the systems, and this is usually compensated for in the second part. Ignoring the dynamics of the system in the combinatorial part of the problem can significantly compromise performance. In this work, we introduce a framework that allows us to tackle both of these parts at the same time. To that order, we introduce a class of functionals we call the Quasi-Euclidean functionals, and use them to study such problems for dynamic systems. We determine the asymptotic behavior of the costs of these problems, when the points are randomly distributed and their number tends to infinity. We show the applicability of our framework by producing results for the Traveling Salesperson Problem (TSP) and Minimum Bipartite Matching Problem (MBMP) for dynamic systems.
by Sleiman M. Itani.
Ph.D.

Style APA, Harvard, Vancouver, ISO itp.

22

Rodrigues, Rodrigo Seromenho Miragaia 1975. "Robust services in dynamic systems". Thesis, Massachusetts Institute of Technology, 2005. http://hdl.handle.net/1721.1/33927.

Pełny tekst źródła

Streszczenie:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005.
Includes bibliographical references (p. 191-202).
Our growing reliance on online services accessible on the Internet demands highly- available systems that work correctly without interruption. This thesis extends previous work on Byzantine-fault-tolerant replication to meet the new requirements of current Internet services: scalability and the ability to reconfigure the service automatically in the presence of a changing system membership. Our solution addresses two important problems that appear in dynamic replicated services: First, we present a membership service that provides servers and clients in the system with a sequence of consistent views of the system membership (i.e., the set of currently available servers). The membership service is designed to be scalable, and to handle membership changes mostly automatically. Furthermore, the membership service is itself reconfigurable, and tolerates arbitrary faults of a subset of the servers that are implementing it at any instant. The second part of our solution is a generic methodology for transforming replicated services that assume a fixed membership into services that support a dynamic system membership. The methodology uses the output from the membership service to decide when to reconfigure.
(cont.) We built two example services using this methodology: a dynamic Byzantine quorum system that supports read and write operations, and a dynamic Byzantine state machine replication system that supports any deterministic service. The final contribution of this thesis is an analytic study that points out an obstacle to the deployment of replicated services based on a dynamic membership. The basic problem is that maintaining redundancy levels for the service state as servers join and leave the system is costly in terms of network bandwidth. To evaluate how dynamic the system membership can be, we developed a model for the cost of state maintenance in dynamic replicated services, and we use measured values from real-world traces to determine possible values for the parameters of the model. We conclude that certain deployments (like a volunteer-based system) are incompatible with the goals of large- scale reliable services. We implemented the membership service and the two example services. Our performance results show that the membership service is scalable, and our replicated services perform well, even during reconfigurations.
by Rodrigo Seromenho Miragaia Rodrigues.
Ph.D.

Style APA, Harvard, Vancouver, ISO itp.

23

Delamore, David George. "Conceptual models for dynamic systems". Thesis, University of Cambridge, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.608827.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

24

Hsu, Chih-hua. "Dynamic scheduling of manufacturing systems /". Digital version accessible at:, 1998. http://wwwlib.umi.com/cr/utexas/main.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

25

Rushton, Matthew V. "Static and dynamic type systems". Diss., Connect to the thesis Connect to the thesis, 2004. http://hdl.handle.net/10066/1483.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

26

Luo, Jiangtao. "Functional mapping of dynamic systems". [Gainesville, Fla.] : University of Florida, 2009. http://purl.fcla.edu/fcla/etd/UFE0041189.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

27

Chapman, Craig K. "Coarsening dynamical systems : dynamic scaling, universality and mean-field theories". Thesis, University of Glasgow, 2012. http://theses.gla.ac.uk/3255/.

Pełny tekst źródła

Streszczenie:

We study three distinct coarsening dynamical systems (CDS) and probe the underlying scaling laws and universal scaling functions. We employ a variety of computational methods to discover and analyse these intrinsic statistical objects. We consider mean-field type models, similar in nature to those used in the seminal work of Lifshitz, Slyozov and Wagner (LSW theory), and statistical information is then derived from these models. We first consider a simple particle model where each particle possesses a continuous positive parameter, called mass, which itself determines the particle’s velocity through a prescribed law of motion. The varying speeds of particles, caused by their differing masses, causes collisions to take place, in which the colliding particles then merge into a single particle while conserving mass. We computationally discover the presence of scaling laws of the characteristic scale (mean mass) and universal scaling functions for the distribution of particle mass for a family of power-law motion rules. We show that in the limit as the power-law exponent approaches infinity, this family of models approaches a probabilistic min-driven model. This min-driven model is then analysed through a mean-field type model, which yields a prediction of the universal scaling function. We also consider the conserved Kuramoto-Sivashinsky (CKS) equation and provide, in particular, a critique of the effective dynamics derived by Politi and ben-Avraham. We consider several different numerical methods for solving the CKS equation, both on fixed and adaptive grids, before settling on an implicit-explicit hybrid scheme. We then show, through a series of detailed numerical simulations of both the CKS equation and the proposed dynamics, that their particular reduction to a length-based CDS does not capture the effective dynamics of the CKS equation. Finally, we consider a faceted CDS derived from a one-dimensional geometric partial differential equation. Unusually, an obvious one-point mean-field theory for this CDS is not present. As a result, we consider the two-point distribution of facet lengths. We derive a mean-field evolution equation governing the two-point distribution, which serves as a two-dimensional generalisation of the LSW theory. Through consideration of the two-point theory, we subsequently derive a non-trivial one-point sub-model which we analytically solve. Our predicted one-point distribution bears a significant resemblance to the LSW distribution and stands in reasonable agreement with the underlying faceted CDS.

Style APA, Harvard, Vancouver, ISO itp.

28

Al, Shoaili Saoud Humaid Salim. "Internet-based monitoring and controlling of real-time dynamic systems". Thesis, Curtin University, 2005. http://hdl.handle.net/20.500.11937/1123.

Pełny tekst źródła

Streszczenie:

The study in this report mainly focuses on the Internet-based Monitoring and Controlling of a Real-Time Dynamic System interfaced via a dedicated local computer. The main philosophy behind this study is to allow the remote user to conduct an Internet-based Remote Operation (I-bRO) for the dynamic system. The dynamic system has been defined as the system which has its parts interrelated in such a way that a change in one part necessarily affects other parts of the system [I]. In order to achieve this goal, the study has been conducted in a form of an on-line and real-time Virtual Laboratory (VL). Through this form of laboratory, a user can carry out the experiment, perform real-time monitoring and controlling operations of the experiment and collect real and live data from the experiment through the network link as the user was physically in the laboratory. The dynamic system that has been selected for the test-rig of this study is a 3-phase Induction Motor (IM) which is mechanically coupled with a DC-Dynamometer that acts as a variable load to the IM. This system is a common laboratory experiment in the study of the Electrical Engineering for both undergraduate and postgraduate students. The study covers both sides of the I-bRO; the hardware and the software. The hardware side includes the design and the development of a load control box that has been used to interface the DC-Dynamometer and consequently control it from the local computer. The software side covers the design and the development of the Virtual Instrumentation System (VIS) that has replaced successfully the physical Measurement and Test (M&T) instruments of the test-rig. Beside that, the software side includes the development of the internet remote front panel for the remote operation.Furthermore, the software side includes the development of the software that has been used to analyse the system during the I-bRO. In this study, the LabVTEW7 program has been used to design and develop the VIS and the Matlab program has bee used to aualyse the system performance for the remote operations. This study also addresses the issues and problems related to the intranet or the internet to be used as the network for data communication between the test-rig and remote users. This study has been carried out in different stages as follows: 1. Designing and development of the VIS. 2. Interfacing the test-rig apparatus with a local computer. 3. Upload the system from the local computer to the network. 4. Study the performance of the system on the network for the purpose of the remote operations controlled over the internet. The developed system of this study has been used for data acquisition, network communications, instruments monitoring and controlling applications. A user can execute on-line and in the real-time the developed VIS from any point in the university. Due to the fact that the university network is directly integrated to the main internet server. a remote user through the main internet server is able to perform I-bRO of the selected dynamic system. There are many factors associated with the network, the internet or the intranet, and have direct influences on the control system performance throughout the remote operations. The most dominant factors are the random time-delays and the data losses.These factors among others have to be addressed for a proper application of the I-bRO. For this reason, different cases and scenarios of the I-bRO have been investigated and simulated to study the affection of the network on the control system performance. The system is analysed under two control cases, closed loop with random time-delays and open loop when the internet server is disconnected and no communication between the input and the output of the system. In the first case, the closed loop, the internet server is assumed to be closed and subjected to random time-delays. In the second case, the internet server is subjected to random cut-off and thus opens the control loop. The results of both cases have been analysed and discussed. It has been found that, if the control system without the time-delays is stable, it remains stable even with small time-delays up to twenty seconds. This result is different from what has been shown in the literature.

Style APA, Harvard, Vancouver, ISO itp.

29

Kostkova, Patricie. "MAGNET - a dynamic resource management architecture". Thesis, City, University of London, 1999. http://discovery.ucl.ac.uk/10062371/.

Pełny tekst źródła

Streszczenie:

This thesis proposes a new dynamic resource management architecture, Magnet, to meet the requirements of users in flexible and adaptive systems. Computer systems no longer operate in centralized isolated static environments. Technological advances, such as smaller and faster hardware, and higher reliability of networks have resulted in the growth of mobility of computing and the need for run-time reconfigurability. The dynamic management of this diversity of resources is the central issue addressed in this thesis. Applications in environments with frequently changing characteristics are required to participate in dynamic resource management, to adapt to ever-changing conditions, and to express their requirements in terms of quality of service. Magnet enables dynamic trading of resources which can be requested indirectly by the type of service they offer, rather than directly by their name. A dedicated component, the Trader, matches requests for services against demands and establishes a component binding - resource allocation. In addition, the architecture is extensible - it does not constrain the information on services and allows user-customization of the matching process. Consequently, this allows resource definitions to be parametrized (to include QoS-based characteristics), and the matching process to be user-customized (to preform QoS-based negotiation). In order to fulfill the requirements of users relying on ever-changing conditions, Magnet enables runtime adaptation (dynamic rebinding) to changes in the environment, constant monitoring of resources, and scalability of the architecture. The generality of the Magnet architecture is illustrated with several examples of resource allocation in dynamic environments.

Style APA, Harvard, Vancouver, ISO itp.

30

Maree, Charl. "Diagnostic monitoring of dynamic systems using artificial immune systems". Thesis, Stellenbosch : University of Stellenbosch, 2006. http://hdl.handle.net/10019.1/1780.

Pełny tekst źródła

Streszczenie:

Thesis (MScEng (Process Engineering))--University of Stellenbosch, 2006.
The natural immune system is an exceptional pattern recognition system based on memory and learning that is capable of detecting both known and unknown pathogens. Artificial immune systems (AIS) employ some of the functionalities of the natural immune system in detecting change in dynamic process systems. The emerging field of artificial immune systems has enormous potential in the application of fault detection systems in process engineering. This thesis aims to firstly familiarise the reader with the various current methods in the field of fault detection and identification. Secondly, the notion of artificial immune systems is to be introduced and explained. Finally, this thesis aims to investigate the performance of AIS on data gathered from simulated case studies both with and without noise. Three different methods of generating detectors are used to monitor various different processes for anomalous events. These are: (1) Random Generation of detectors, (2) Convex Hulls, (3) The Hypercube Vertex Approach. It is found that random generation provides a reasonable rate of detection, while convex hulls fail to achieve the required objectives. The hypercube vertex method achieved the highest detection rate and lowest false alarm rate in all case studies. The hypercube vertex method originates from this project and is the recommended method for use with all real valued systems, with a small number of variables at least. It is found that, in some cases AIS are capable of perfect classification, where 100% of anomalous events are identified and no false alarms are generated. Noise has, expectedly so, some effect on the detection capability on all case studies. The computational cost of the various methods is compared, which concluded that the hypercube vertex method had a higher cost than other methods researched. This increased computational cost is however not exceeding reasonable confines therefore the hypercube vertex method nonetheless remains the chosen method. The thesis concludes with considering AIS’s performance in the comparative criteria for diagnostic methods. It is found that AIS compare well to current methods and that some of their limitations are indeed solved and their abilities surpassed in certain cases. Recommendations are made to future study in the field of AIS. Further the use of the Hypercube Vertex method is highly recommended in real valued scenarios such as Process Engineering.

Style APA, Harvard, Vancouver, ISO itp.

31

Stockton, Nicklas O. "Hybrid Genetic Fuzzy Systems for Control of Dynamic Systems". University of Cincinnati / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1523635312922039.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

32

Damle, Pushkar Hari. "A system dynamics model of the integration of new technologies for ship systems". Thesis, Virginia Tech, 2003. http://hdl.handle.net/10919/35216.

Pełny tekst źródła

Streszczenie:

System dynamics has been used to better understand the dynamics within complex natural and social systems. This understanding enables us to make decisions and define strategies that help to resolve the problematic behaviors associated within these systems. For example within an operating environment such as the US Navy, decisions taken today can have long lasting impact on system performance. The Navy has experienced large cost overruns during the new technology implementation process on ship systems that can also have an impact on total life cycle performance. The integration phase of the implementation process represents most of the cost overruns experienced in the overall new technology life cycle (development, integration, and operation/support/disposal). We have observed a general concern that there is a lack of understanding for the dynamic behavior of those processes which comprise the integration phase, among ship-builders and planners. One of the goals of our research effort has been to better understand the dynamic behavior of the new technology integration processes, using a dynamic modeling technique known as System Dynamics. Our approach has also been to provide a comprehensive knowledge elicitation process in which members from the shipbuilding industry, the US Navy, and the Virginia Tech System Performance Laboratory take part in group model building exercises. The system dynamics model that is developed in this manner is based on data obtained from the experts. An investigation of these dynamics yields a dominant cost behavior that characterizes the technology integration processes. This behavior is S-shaped growth. The following two dynamic hypotheses relative to lifecycle cost and performance of the inserted new technology were confirmed: (1) For the current structure of the model we observe the more the complexity of the new technology, the less affordable a technology becomes; (2) Integration of immature (less developed) technologies is associated with higher costs. Another interesting insight is that cost is very sensitive to the material procurement. Future research can be addressed to a more detailed level of abstraction for various activities included in the technology integration phase, such as testing and evaluation, cost of rework and risks associated with inadequate testing etc. This will add to our evolving understanding of the behavior of individual activities in the technology integration process.
Master of Science

Style APA, Harvard, Vancouver, ISO itp.

33

Song, Xiaodan. "Exploiting dynamic patterns for recommendation systems /". Thesis, Connect to this title online; UW restricted, 2006. http://hdl.handle.net/1773/5833.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

34

Kunz, Jakob. "Dynamic behavior of district heating systems /". [S.l.] : [s.n.], 1994. http://library.epfl.ch/theses/?nr=1234.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

35

Villalba, Pablo Villalba. "Dynamic Spectrum Management in DSL Systems". Thesis, Norwegian University of Science and Technology, Department of Electronics and Telecommunications, 2007. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-9509.

Pełny tekst źródła

Streszczenie:

The candidate shall study different methods for dynamic spectral management in DSL systems, with main emphasis on autonomeous methods like iterative waterfilling. The methods shall be implemented in Matlab.

Style APA, Harvard, Vancouver, ISO itp.

36

Lindström, Birgitta. "Testability of Dynamic Real-Time Systems". Doctoral thesis, Linköpings universitet, ESLAB - Laboratoriet för inbyggda system, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-16486.

Pełny tekst źródła

Streszczenie:

This dissertation concerns testability of event-triggered real-time systems. Real-time systems are known to be hard to test because they are required to function correct both with respect to what the system does and when it does it. An event-triggered real-time system is directly controlled by the events that occur in the environment, as opposed to a time-triggered system, which behavior with respect to when the system does something is constrained, and therefore more predictable. The focus in this dissertation is the behavior in the time domain and it is shown how testability is affected by some factors when the system is tested for timeliness. This dissertation presents a survey of research that focuses on software testability and testability of real-time systems. The survey motivates both the view of testability taken in this dissertation and the metric that is chosen to measure testability in an experiment. We define a method to generate sets of traces from a model by using a meta algorithm on top of a model checker. Defining such a method is a necessary step to perform the experiment. However, the trace sets generated by this method can also be used by test strategies that are based on orderings, for example execution orders. An experimental study is presented in detail. The experiment investigates how testability of an event-triggered real-time system is affected by some constraining properties of the execution environment. The experiment investigates the effect on testability from three different constraints regarding preemptions, observations and process instances. All of these constraints were claimed in previous work to be significant factors for the level of testability. Our results support the claim for the first two of the constraints while the third constraint shows no impact on the level of testability. Finally, this dissertation discusses the effect on the event-triggered semantics when the constraints are applied on the execution environment. The result from this discussion is that the first two constraints do not change the semantics while the third one does. This result indicates that a constraint on the number of process instances might be less useful for some event-triggered real-time systems.

Style APA, Harvard, Vancouver, ISO itp.

37

Schiller, Benjamin. "Graph-based Analysis of Dynamic Systems". Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2017. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-230611.

Pełny tekst źródła

Streszczenie:

The analysis of dynamic systems provides insights into their time-dependent characteristics. This enables us to monitor, evaluate, and improve systems from various areas. They are often represented as graphs that model the system's components and their relations. The analysis of the resulting dynamic graphs yields great insights into the system's underlying structure, its characteristics, as well as properties of single components. The interpretation of these results can help us understand how a system works and how parameters influence its performance. This knowledge supports the design of new systems and the improvement of existing ones. The main issue in this scenario is the performance of analyzing the dynamic graph to obtain relevant properties. While various approaches have been developed to analyze dynamic graphs, it is not always clear which one performs best for the analysis of a specific graph. The runtime also depends on many other factors, including the size and topology of the graph, the frequency of changes, and the data structures used to represent the graph in memory. While the benefits and drawbacks of many data structures are well-known, their runtime is hard to predict when used for the representation of dynamic graphs. Hence, tools are required to benchmark and compare different algorithms for the computation of graph properties and data structures for the representation of dynamic graphs in memory. Based on deeper insights into their performance, new algorithms can be developed and efficient data structures can be selected. In this thesis, we present four contributions to tackle these problems: A benchmarking framework for dynamic graph analysis, novel algorithms for the efficient analysis of dynamic graphs, an approach for the parallelization of dynamic graph analysis, and a novel paradigm to select and adapt graph data structures. In addition, we present three use cases from the areas of social, computer, and biological networks to illustrate the great insights provided by their graph-based analysis. We present a new benchmarking framework for the analysis of dynamic graphs, the Dynamic Network Analyzer (DNA). It provides tools to benchmark and compare different algorithms for the analysis of dynamic graphs as well as the data structures used to represent them in memory. DNA supports the development of new algorithms and the automatic verification of their results. Its visualization component provides different ways to represent dynamic graphs and the results of their analysis. We introduce three new stream-based algorithms for the analysis of dynamic graphs. We evaluate their performance on synthetic as well as real-world dynamic graphs and compare their runtimes to snapshot-based algorithms. Our results show great performance gains for all three algorithms. The new stream-based algorithm StreaM_k, which counts the frequencies of k-vertex motifs, achieves speedups up to 19,043 x for synthetic and 2882 x for real-world datasets. We present a novel approach for the distributed processing of dynamic graphs, called parallel Dynamic Graph Analysis (pDNA). To analyze a dynamic graph, the work is distributed by a partitioner that creates subgraphs and assigns them to workers. They compute the properties of their respective subgraph using standard algorithms. Their results are used by the collator component to merge them to the properties of the original graph. We evaluate the performance of pDNA for the computation of five graph properties on two real-world dynamic graphs with up to 32 workers. Our approach achieves great speedups, especially for the analysis of complex graph measures. We introduce two novel approaches for the selection of efficient graph data structures. The compile-time approach estimates the workload of an analysis after an initial profiling phase and recommends efficient data structures based on benchmarking results. It achieves speedups of up to 5.4 x over baseline data structure configurations for the analysis of real-word dynamic graphs. The run-time approach monitors the workload during analysis and exchanges the graph representation if it finds a configuration that promises to be more efficient for the current workload. Compared to baseline configurations, it achieves speedups up to 7.3 x for the analysis of a synthetic workload. Our contributions provide novel approaches for the efficient analysis of dynamic graphs and tools to further investigate the trade-offs between different factors that influence the performance.

Style APA, Harvard, Vancouver, ISO itp.

38

Bajic, Mirko M. "Design of dynamic cellular manufacturing systems". Title page, abstract and contents only, 2001. http://web4.library.adelaide.edu.au/theses/09PH/09phb165.pdf.

Pełny tekst źródła

Streszczenie:

Bibliography: leaves 172-184. An analytical approach to the integrated problems of designing the dynamic cellular manufacturing systems layout concurrently with its material flow (handling) requirements, in such a manner that minimises the material handling within the system. The proposed strategy encourages the design of a dynamic layout to identify simultaneously the machine groups, economical machine distribution, and intracell and intercell layouts.

Style APA, Harvard, Vancouver, ISO itp.

39

Kansal, Sachin. "Trajectory optimization for flat dynamic systems". Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ59823.pdf.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

40

Mantri, Parag. "Deployment Dynamic of Space Tether Systems". NCSU, 2007. http://www.lib.ncsu.edu/theses/available/etd-06202007-100101/.

Pełny tekst źródła

Streszczenie:

The purpose of this research is to model and understand the deployment dynamics of space systems with long and short tethers. This research is divided into two parts; in the first part, a model for short and medium length tether systems is developed and simulated by solving equations of motion. A detailed parametric study is conducted after identifying important parameters affecting the deployment and studying the effect of each parameter on the deployment performance. Certain tools are developed to assist mission planners in predicting the deployment performance of a space tether system for a given set of parameters. The second part of the research is motivated by Space Elevator (SE) dynamics. SE is a futuristic and highly challenging technology based on the idea of connecting Earth and Space by an approximately 100,000 km long tether. The tether used for the SE would be deployed from Geostationary Orbit(GEO). With this motivation, the short tether analysis from the previous section is extended to the analysis of long tethers. A model for long tether deployment is developed and governing equations of motions are formulated. Critical parameters are identified and problems involved in SE deployment are investigated. Tether mass is initially included in the model, but it is found that that the mass of the tether has very little effect on the overall qualitative dynamics of the system. Hence, for further analysis, a massless tether model is adapted. Upon simulating the system, it is found that long tethers can be highly unstable during deployment and can crash onto the Earth. However, a considerable fraction of the tether can be deployed successfully without any external control mechanism before the instability manifests itself. Hence, alternate SE designs with shorter tether deployment requirements may be a possibility.

Style APA, Harvard, Vancouver, ISO itp.

41

Cheng, Qi. "Distributed fault detection for dynamic systems". Related electronic resource: Current Research at SU : database of SU dissertations, recent titles available full text, 2006. http://proquest.umi.com/login?COPT=REJTPTU0NWQmSU5UPTAmVkVSPTI=&clientId=3739.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

42

Ding, Huali. "Dynamic wear models for gear systems". Columbus, Ohio : Ohio State University, 2007. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1194025602.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

43

Seetzen, Helge. "High dynamic range display andprojection systems". Thesis, University of British Columbia, 2009. http://hdl.handle.net/2429/7378.

Pełny tekst źródła

Streszczenie:

The human visual system can perceive five orders of magnitude of simultaneous dynamic range of luminance values. Recent advances in image capture and processing have made it possible to create video content at this level of dynamic range but conventional displays are unable show this rich content. Modern display and projection systems cannot deliver more than three or four orders of dynamic range and are usually limited to lower luminance values than those found in real world environments. This dissertation describes high dynamic range display and projection systems which resolve this bottleneck in the video pipeline and deliver luminance ranges to the limit of human perception. The design of these systems is based on the concept of dual modulation which combines several lower dynamic range image modulation components to achieve higher dynamic range. An overview of relevant perceptual mechanisms, viewer preference with respect to higher dynamic range images, and perceptual validation studies are discussed in addition to several implementation examples of dual modulation systems.

Style APA, Harvard, Vancouver, ISO itp.

44

Woodford, Patrick Dominic. "Optimal control of nonsmooth dynamic systems". Thesis, Imperial College London, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.265992.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

45

Bondorowicz, Stefan. "Adaptive control of complex dynamic systems". Thesis, University of Oxford, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.302787.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

46

Galanis, Georgios. "Dynamic polynomial combinants and linear systems". Thesis, City University London, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.527471.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

47

Geitner, Gert-Helge, i Guven Komurgoz. "Power Flow Modelling of Dynamic Systems". Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2015. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-171305.

Pełny tekst źródła

Streszczenie:

As tools for dynamic system modelling both conventional methods such as transfer function or state space representation and modern power flow based methods are available. The latter methods do not depend on energy domain, are able to preserve physical system structures, visualize power conversion or coupling or split, identify power losses or storage, run on conventional software and emphasize the relevance of energy as basic principle of known physical domains. Nevertheless common control structures as well as analysis and design tools may still be applied. Furthermore the generalization of power flow methods as pseudo-power flow provides with a universal tool for any dynamic modelling. The phenomenon of power flow constitutes an up to date education methodology. Thus the paper summarizes fundamentals of selected power flow oriented modelling methods, presents a Bond Graph block library for teaching power oriented modelling as compact menu-driven freeware, introduces selected examples and discusses special features.

Style APA, Harvard, Vancouver, ISO itp.

48

Sturacci, Jean. "MODELLING OF MACHINING SYSTEMS DYNAMIC BEHAVIOUR". Thesis, KTH, Industriell produktion, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-174021.

Pełny tekst źródła

Streszczenie:

The understanding of the static and dynamic behaviour of machine tools and the cutting processes interaction is of the main importance when designing a machining system. Moreover, the endless increase demand on quality and productivity gives even more prominence to that. Actually in machining, a central problem is the one of the stability of the cutting process. The choice of the optimal parameters of cut is a challenge that researchers and companies are facing with different approaches. The traditional method to determine these parameters consists of determining the Stability Lobe Diagram through modal analysis and cutting tests. However, in many applications, this method does not give accurate results. To face that, this thesis presents a computational model, integrated in SimMechanics (Matlab / MathWorks), of a whole machining system to analyse its behaviour and study its stability depending on the cutting parameters and machine tool configuration. The model implementation is shown in this thesis and the results obtained are analysed and evaluated.

Style APA, Harvard, Vancouver, ISO itp.

49

Matthews, Brian Martin. "Dynamic order-sorted term-rewriting systems". Thesis, University of Glasgow, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.337505.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

50

Johnson, Sam. "Analysis of nonlinear dynamic physiological systems". Thesis, University of Newcastle Upon Tyne, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.433132.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Rozprawy doktorskie na temat „Dynamic Systems”

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych