• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 70
  • 29
  • 17
  • 6
  • 3
  • 2
  • 1
  • 1
  • 1
  • Tagged with
  • 152
  • 48
  • 43
  • 41
  • 36
  • 27
  • 24
  • 24
  • 24
  • 24
  • 21
  • 20
  • 20
  • 19
  • 18
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
11

An Incremental Trace-Based Debug System for Field-Programmable Gate-Arrays

Keeley, Jared Matthew 07 November 2013 (has links) (PDF)
Modern society increasingly relies upon integrated circuits (ICs). It can be very costly if ICs do not function properly, and large portions of designer effort are spent on their verification. The use of field-programmable gate arrays (FPGAs) for verification and debug of ICs is increasing. FPGAs are faster than simulation and cost less than fabricating an ASIC prototype. However, the major challenge of using FPGAs for verification and debug is observability. Designers must use special techniques to observe the values of FPGA's internal signals. This thesis proposes a new method for increasing the observability of FPGAs and demonstrates its feasibility. The new method incrementally inserts trace buffers controlled by a trigger into already placed-and-routed FPGA designs. Incremental insertion allows several drawbacks of typical trace-based approaches to be avoided such as influencing the placing and routing of the design, large area overheads, and slow turnaround times when changes must be made to the instrumentation. It is shown that it is possible to observe every flip flop in Xilinx Virtex-5 designs using the method, given that enough trace buffer capacity is available. We investigate factors that influence the results of the method. It is shown that making the trace buffers wide may lead to routing failures. Congested areas of the circuit must be avoided when placing the trigger or this may also lead to routing failures. A drawback of the method is that it may increase the minimum period of the design, but we show that pipelining can reduce these effects. The method proves to be a promising way to observe thousands of signals in a design, potentially allowing designers to fully reconstruct the internal values of an FPGA over multiple clock cycles to assist in verification and debug.
12

A Practical Comprehensive Approach to PMU Placement for Full Observability

Altman, James Ross 27 March 2008 (has links)
In recent years, the placement of phasor measurement units (PMUs) in electric transmission systems has gained much attention. Engineers and mathematicians have developed a variety of algorithms to determine the best locations for PMU installation. But often these placement algorithms are not practical for real systems and do not cover the whole process. This thesis presents a strategy that is practical and addresses three important topics: system preparation, placement algorithm, and installation scheduling. To be practical, a PMU strategy should strive for full observability, work well within the heterogeneous nature of power system topology, and enable system planners to adapt the strategy to meet their unique needs and system configuration. Practical considerations for the three placement topics are discussed, and a specific strategy based on these considerations is developed and demonstrated on real transmission system models. / Master of Science
13

Abstrakčių automatų stebimumo nustatymo bei padidinimo tyrimas / Observability determinition and observability increasing of abstracts research

Afonin, Andrej 27 May 2005 (has links)
A circuit testing nowadays is expensive and complex process. That’s why circuits testing, errors finding and fixing require more and more investments. One of possible ways of reducing cost and speed up testing process is increasing controllability and observability of circuits. It takes a lot of time to find out circuit’s controllability and observability that’s why that process have to be computerized. For that purpose was decided to create software which will be helpful for circuit designers in that process. As a result it will help designers in making design for testability schemes. Research and training action for system on chip using internet software is dedicated for users that have C/C++ system on chip code from every place in the world, using only web browser, would be able put that code in to the server, test it and retrieve it‘s observability results in text and visual modes and also increase system’s on chip observability level. And as well review and get acquainted with systems on chip that are already on the server and are stored on it. Software architecture uses client-server mode. All computations are performed on a server side. System is realized on Apache server with Linux OS. System modules are realized using HTML, JAVA, PHP, JavaScript, C++ and CGI programming languages. Web page is working independent from users OS, user needs only web browser (Internet Explorer not older than 3.0 ver., Opera not older than 6.0 ver., Netscape Navigator not older... [to full text]
14

Symbolic Decentralized Supervisory Control

Agarwal, Urvashi 04 1900 (has links)
<p>A decentralized discrete-event system (DES) consists of supervisors that are physically distributed. Co-observability is one of the necessary and sufficient conditions for the existence of a decentralized supervisors that correctly solve the control problem. In this thesis we present a state-based definition of co-observability and introduce algorithms for its verification. Existing algorithms for the verification of co-observability do not scale well, especially when the system is composed of many components. We show that the implementation of our state-based definition leads to more efficient algorithms.</p> <p>We present a set of algorithms that use an existing structure for the verification of state-based co-observability (SB Co-observability). A computational complexity analysis of the algorithms show that the state-based implementation of algorithms result in quadratic complexity. Further improvements come from using a more compact way of representing finite-state machines namely Binary Decision Diagrams (BDD).</p> / Master of Science (MSc)
15

Particle tracking using the unscented Kalman filter in high energy physics experiments

Akhtar, Jahanzeb January 2015 (has links)
The extended Kalman lter (EKF) has a long history in the field of non-linear tracking. More recently, statistically-based estimators have emerged that avoid the need for a deterministic linearisation process. The Unscented Kalman filter (UKF) is one such technique that has been shown to perform favourably for some non-linear systems when compared to an EKF implementation, both in terms of accuracy and robustness. In this Thesis, the UKF is applied to a high energy physics particle tracking problem where currently the EKF is being implemented. The effects of measurement redundancy are investigated to determine improvements in accuracy of particle track reconstruction. The relationship between measurement redundancy and relative observability is also investigated through an experimental and theoretical analysis. Smoothing (backward filtering), in the high energy physics experiments, is implementedusing the Rauch Tung Striebel (RTS) smoother with the EKF , however, in Unscented Kalman filter algorithms, the Jacobian matrices required by the RTS method, are not available. The Unscented Rauch Tung Striebel (URTS) smoother addresses this problem by avoiding the use of Jacobian matrices but is not effi cient for large dimensional systems such as high energy physics experiments. A technique is implemented in the RTS smoother to make it suitable for the UKF. The method is given the name the Jacobian Equivalent Rauch Tung Striebel (JE-RTS) smoother. The implementation of this method is quite straight forward when the UKF is used as an estimator.
16

Trajectographie Passive sans manœuvre de l’observateur / Target motion analysis without maneuver of the observer

Clavard, Julien 18 December 2012 (has links)
Les méthodes de trajectographie conventionnelles par mesures d’angle supposent que la source est en mouvement rectiligne uniforme tandis que l’observateur est manœuvrant. Dans cette thèse, nous remettons en cause cette hypothèse en proposant un autre modèle de cinématique de la source : le mouvement circulaire uniforme. Nous prouvons qu’une telle trajectoire est observable à partir d’un observateur en mouvement rectiligne uniforme. Puis, nous étudions l’apport de mesures additionnelles de fréquence ou la faisabilité de la trajectographie par mesures de distances. Le cas d’une source en mouvement rectiligne uniforme et d’un observateur manœuvrant est étudié pour ce dernier type de mesures. Chaque cas donne lieu à une analyse de l’observabilité de la trajectoire de la source et à la mise au point de l’estimateur du maximum de vraisemblance. Nous montrons que ce dernier s’avère le plus souvent efficace. / The conventional bearings-only target motion analysis methods assume that the source is in constant velocity motion (constant speed and heading) while the observer maneuvers. In this thesis, we reassess this hypothesis and propose another model of the kinematics of the source: the constant turn motion (an arc of circle followed at constant speed). We prove that this kind of trajectory is observable by an observer in constant velocity motion. Then, we study the contribution of the addition of frequency measurements or the feasibility of target motion analysis methods that use range only measurements. The case of a source in constant velocity motion with a maneuvering observer is examined for this last type of measurements. Each case leads to an analysis of the observability of the trajectory of the source and to the development of the associated maximum likelihood estimator. We show that this estimator often appears to be efficient.
17

Análise de observabilidade para o estimador de estados e parâmetros do sistema elétrico / Observability analysis for state and parameter estimator

Pereira, Fernando Silva 11 January 2005 (has links)
Neste trabalho propõe-se um método de análise de observabilidade para estimação de estados e parâmetros em sistemas elétricos de potência, baseado nas equações normais. O método fundamenta-se na fatoração triangular da matriz ganho aumentada e nos conceitos de caminhos de fatoração. O mesmo utiliza rotinas já existentes no processo de estimação, sendo simples, de fácil implementação, rápida execução e não exige a solução de equações algébricas. Para comprovar a sua eficiência vários testes foram realizados, utilizando os sistemas de 6, 14 e 30 barras do IEEE, tendo sido satisfatórios os resultados obtidos. / In this work we propose a method of observability analysis for states and parameters estimation in electric power systems, based on the Normal Equations. The method is based on triangular factoration of the augmented gain matrix and on the concepts of factoration paths. It uses routines that there exist in the estimation process. These routines are simple, of easy implementation, fast execution and it doesn\'t demand the solution of algebraic equations. To prove your efficiency several tests were accomplished, using the 6, 14 and 30-bus IEEE test systems. The obtained results were satisfactory.
18

Método para locação de medidores e UTRs para efeito de estimação de estados em sistemas elétricos de potência / not available

Brito, George Lauro Ribeiro de 15 October 2003 (has links)
Desenvolveu-se neste trabalho um método para projeto e fortalecimento de planos de medição, para efeito de estimação de estados. O método proposto permite a obtenção de planos de medição que além de isentos de medidas críticas e de conjuntos críticos de medidas, garantem a observabilidade do sistema, mesmo com a perda simultânea de 1 ou 2 medidas quaisquer, ou, até mesmo, com a perda de 1 UTR. É um método numérico simples, de fácil implantação, que se baseia na análise da estrutura da matriz resultante da decomposição LDU, que é obtida através da fatoração triangular da matriz Jacobiana. Para comprovar a sua eficiência, vários testes foram realizados, utilizando os sistemas de 14 e 30 barras do IEEE, o sistema de 121 barras da ELETROSUL e o sistema de 383 barras da CHESF. / In this work a method to design and to upgrade Measurements Placement Plan for state estimation is proposed. The proposed method allows the obtention of measurements placement plans that, besides free of both critical measurements and critical sets, maintain the system observability when 1 or 2 measurements are lost, at same time, or even when a Remote Terminal Unit (RTU) is lost. It is a simple numerical method, easy to implement and based on the analysis of the structure of the resultant matrix of the decomposition LDU, that it is obtained through a triangular factorization of the Jacobian matrix. To prove the efficiency of the proposed method, several tests were made using the IEEE 14 and 30-bus systems, a 121-bus system from ELETROSUL and a 383-bus system from CHESF.
19

Some Results On Optimal Control for Nonlinear Descriptor Systems

Sjöberg, Johan January 2006 (has links)
<p>I denna avhandling studeras optimal återkopplad styrning av olinjära deskriptorsystem. Ett deskriptorsystem är en matematisk beskrivning som kan innehålla både differentialekvationer och algebraiska ekvationer. En av anledningarna till intresset för denna klass av system är att objekt-orienterade modelleringsverktyg ger systembeskrivningar på denna form. Här kommer det att antas att det, åtminstone lokalt, är möjligt att eliminera de algebraiska ekvationerna och få ett system på tillståndsform. Teoretiskt är detta inte så inskränkande för genom att använda någon indexreduktionsmetod kan ganska generella deskriptor\-system skrivas om så att de uppfyller detta antagande.</p><p>För system på tillståndsform kan Hamilton-Jacobi-Bellman-ekvationen användas för att bestämma den optimala återkopplingen. Ett liknande resultat finns för deskriptor\-system där istället en Hamilton-Jacobi-Bellman-liknande ekvation ska lösas. Denna ekvation innehåller dock en extra term för att hantera de algebraiska ekvationerna. Eftersom antagandena i denna avhandling gör det möjligt att skriva om deskriptorsystemet som ett tillståndssystem, undersöks hur denna extra term måste väljas för att båda ekvationerna ska få samma lösning.</p><p>Ett problem med att beräkna den optimala återkopplingen med hjälp av Hamilton-Jacobi-Bellman-ekvationen är att det leder till att en olinjär partiell differentialekvation ska lösas. Generellt har denna ekvation ingen explicit lösning. Ett lättare problem är att beräkna en lokal optimal återkoppling. För analytiska system på tillståndsform löstes detta problem på 1960-talet och den optimala lösningen beskrivs av serieutvecklingar. I denna avhandling generaliseras detta resultat så att även deskriptor-system kan hanteras. Metoden illustreras med ett exempel som beskriver en faslåsande krets.</p><p>I många situationer vill man veta om ett område är möjligt att nå genom att styra på något sätt. För linjära tidsinvarianta system fås denna information från styrbarhetgramianen. För olinjära system används istället styrbarhetsfunktionen. Tre olika metoder för att beräkna styrbarhetsfunktionen har härletts i denna avhandling. De framtagna metoderna är också applicerade på några exempel för att visa beräkningsstegen.</p><p>Dessutom har observerbarhetsfunktionen studerats. Observerbarhetsfunktionen visar hur mycket utsignalenergi ett visst initial tillstånd svarar mot. Ett par olika metoder för att beräkna observerbarhetsfunktionen för deskriptorsystem tagits fram. För att beskriva en av metoderna, studeras ett litet exempel bestående av en elektrisk krets.</p> / <p>In this thesis, optimal feedback control for nonlinear descriptor systems is studied. A descriptor system is a mathematical description that can include both differential and algebraic equations. One of the reasons for the interest in this class of systems is that several modern object-oriented modeling tools yield system descriptions in this form. Here, it is assumed that it is possible to rewrite the descriptor system as a state-space system, at least locally. In theory, this assumption is not very restrictive because index reduction techniques can be used to rewrite rather general descriptor systems to satisfy this assumption.</p><p>The Hamilton-Jacobi-Bellman equation can be used to calculate the optimal feedback control for systems in state-space form. For descriptor systems, a similar result exists where a Hamilton-Jacobi-Bellman-like equation is solved. This equation includes an extra term in order to incorporate the algebraic equations. Since the assumptions made here make it possible to rewrite the descriptor system in state-space form, it is investigated how the extra term must be chosen in order to obtain the same solution from the different equations.</p><p>A problem when computing the optimal feedback law using the Hamilton-Jacobi-Bellman equation is that it involves solving a nonlinear partial differential equation. Often, this equation cannot be solved explicitly. An easier problem is to compute a locally optimal feedback law. This problem was solved in the 1960's for analytical systems in state-space form and the optimal solution is described using power series. In this thesis, this result is extended to also incorporate descriptor systems and it is applied to a phase-locked loop circuit.</p><p>In many situations, it is interesting to know if a certain region is reachable using some control signal. For linear time-invariant state-space systems, this information is given by the controllability gramian. For nonlinear state-space systems, the controllabilty function is used instead. Three methods for calculating the controllability function for descriptor systems are derived in this thesis. These methods are also applied to some examples in order to illustrate the computational steps.</p><p>Furthermore, the observability function is studied. This function reflects the amount of output energy a certain initial state corresponds to. Two methods for calculating the observability function for descriptor systems are derived. To describe one of the methods, a small example consisting of an electrical circuit is studied.</p> / Report code: LiU-TEK-LIC-2006:8
20

Some Results On Optimal Control for Nonlinear Descriptor Systems

Sjöberg, Johan January 2006 (has links)
I denna avhandling studeras optimal återkopplad styrning av olinjära deskriptorsystem. Ett deskriptorsystem är en matematisk beskrivning som kan innehålla både differentialekvationer och algebraiska ekvationer. En av anledningarna till intresset för denna klass av system är att objekt-orienterade modelleringsverktyg ger systembeskrivningar på denna form. Här kommer det att antas att det, åtminstone lokalt, är möjligt att eliminera de algebraiska ekvationerna och få ett system på tillståndsform. Teoretiskt är detta inte så inskränkande för genom att använda någon indexreduktionsmetod kan ganska generella deskriptor\-system skrivas om så att de uppfyller detta antagande. För system på tillståndsform kan Hamilton-Jacobi-Bellman-ekvationen användas för att bestämma den optimala återkopplingen. Ett liknande resultat finns för deskriptor\-system där istället en Hamilton-Jacobi-Bellman-liknande ekvation ska lösas. Denna ekvation innehåller dock en extra term för att hantera de algebraiska ekvationerna. Eftersom antagandena i denna avhandling gör det möjligt att skriva om deskriptorsystemet som ett tillståndssystem, undersöks hur denna extra term måste väljas för att båda ekvationerna ska få samma lösning. Ett problem med att beräkna den optimala återkopplingen med hjälp av Hamilton-Jacobi-Bellman-ekvationen är att det leder till att en olinjär partiell differentialekvation ska lösas. Generellt har denna ekvation ingen explicit lösning. Ett lättare problem är att beräkna en lokal optimal återkoppling. För analytiska system på tillståndsform löstes detta problem på 1960-talet och den optimala lösningen beskrivs av serieutvecklingar. I denna avhandling generaliseras detta resultat så att även deskriptor-system kan hanteras. Metoden illustreras med ett exempel som beskriver en faslåsande krets. I många situationer vill man veta om ett område är möjligt att nå genom att styra på något sätt. För linjära tidsinvarianta system fås denna information från styrbarhetgramianen. För olinjära system används istället styrbarhetsfunktionen. Tre olika metoder för att beräkna styrbarhetsfunktionen har härletts i denna avhandling. De framtagna metoderna är också applicerade på några exempel för att visa beräkningsstegen. Dessutom har observerbarhetsfunktionen studerats. Observerbarhetsfunktionen visar hur mycket utsignalenergi ett visst initial tillstånd svarar mot. Ett par olika metoder för att beräkna observerbarhetsfunktionen för deskriptorsystem tagits fram. För att beskriva en av metoderna, studeras ett litet exempel bestående av en elektrisk krets. / In this thesis, optimal feedback control for nonlinear descriptor systems is studied. A descriptor system is a mathematical description that can include both differential and algebraic equations. One of the reasons for the interest in this class of systems is that several modern object-oriented modeling tools yield system descriptions in this form. Here, it is assumed that it is possible to rewrite the descriptor system as a state-space system, at least locally. In theory, this assumption is not very restrictive because index reduction techniques can be used to rewrite rather general descriptor systems to satisfy this assumption. The Hamilton-Jacobi-Bellman equation can be used to calculate the optimal feedback control for systems in state-space form. For descriptor systems, a similar result exists where a Hamilton-Jacobi-Bellman-like equation is solved. This equation includes an extra term in order to incorporate the algebraic equations. Since the assumptions made here make it possible to rewrite the descriptor system in state-space form, it is investigated how the extra term must be chosen in order to obtain the same solution from the different equations. A problem when computing the optimal feedback law using the Hamilton-Jacobi-Bellman equation is that it involves solving a nonlinear partial differential equation. Often, this equation cannot be solved explicitly. An easier problem is to compute a locally optimal feedback law. This problem was solved in the 1960's for analytical systems in state-space form and the optimal solution is described using power series. In this thesis, this result is extended to also incorporate descriptor systems and it is applied to a phase-locked loop circuit. In many situations, it is interesting to know if a certain region is reachable using some control signal. For linear time-invariant state-space systems, this information is given by the controllability gramian. For nonlinear state-space systems, the controllabilty function is used instead. Three methods for calculating the controllability function for descriptor systems are derived in this thesis. These methods are also applied to some examples in order to illustrate the computational steps. Furthermore, the observability function is studied. This function reflects the amount of output energy a certain initial state corresponds to. Two methods for calculating the observability function for descriptor systems are derived. To describe one of the methods, a small example consisting of an electrical circuit is studied. / Report code: LiU-TEK-LIC-2006:8

Page generated in 0.0643 seconds