Dissertations / Theses on the topic 'Speed independent'

With continued advancement in semiconductor manufacturing tech- nologies, process variations become more and more severe. These variations not only impair circuit performance but may also cause po- tential hazards in integrated circuits (IC). Asynchronous IC design, which does not rely on the use of an explicit clock, is more robust to process variations compared to synchronous design and is suggested to be a promising design approach in deep-submicron age, especially for low-power or harsh environment applications. However, the correctness of asynchronous circuits is also becoming challenged by the shrinking technology. The increased wire delays compared to gate delays and threshold variations could bring glitches into the circuit. This work proposes a method to generate a set of su cient timing constraints for a given speed-independent circuit to work correctly when the isochronic fork timing assumption is lifted into a weaker timing assumption. The complexity of the entire process is polyno- mial to the number of gates. The generated timing constraints are relative orderings between the transition events at the input of each gate and the circuit is guaranteed to work correctly by ful lling these constraints under the timing assumption. The benchmarks show that both the number of total constraints and the constraints that are only needed to eliminate strong adversary paths are reduced by around 40% compared to those suggested in the current literature, thus claiming the weakest formally proved condi- tions.

This thesis describes work completed on the application of H controller synthesis to the design of controllers for single axis high speed independent drive design examples. H controller synthesis was used in a single controller format and in a self-tuning regulator, a type of adaptive controller. Three types of industrial design examples were attempted using H controller synthesis, both in simulation and on a Drives Test Facility at Aston University. The results were benchmarked against a Proportional, Integral and Derivative (PID) with velocity feedforward controller (VFF), the industrial standard for this application. An analysis of the differences between a H and PID with VFF controller was completed. A direct-form H controller was determined for a limited class of weighting function and plants which shows the relationship between the weighting function, nominal plant and the controller parameters. The direct-form controller was utilised in two ways. Firstly it allowed the production of simple guidelines for the industrial design of H controllers. Secondly it was used as the controller modifier in a self-tuning regulator (STR). The STR had a controller modification time (including nominal model parameter estimation) of 8ms. A Set-Point Gain Scheduling (SPGS) controller was developed and applied to an industrial design example. The applicability of each control strategy, PID with VFF, H, SPGS and STR, was investigated and a set of general guidelines for their use was determined. All controllers developed were implemented using standard industrial equipment.

STG decomposition is a promising approach to tackle the complexity problems arising in logic synthesis of speed independent circuits, a robust asynchronous (i.e. clockless) circuit type. Unfortunately, STG decomposition can result in components that in isolation have irreducible CSC conflicts. Generalising earlier work, it is shown how to resolve such conflicts by introducing internal communication between the components via structural techniques only.
STG-Dekomposition ist ein bewährter Ansatz zur Bewältigung der Komplexitätsprobleme bei der Logiksynthese von SI (speed independent) Schaltungen – ein robuster asynchroner (d.h. ohne Taktsignal arbeitender digitaler) Schaltungstyp. Allerdings können dabei Komponenten mit irreduziblen CSC-Konflikten entstehen. Durch Verallgemeinerung früherer Arbeiten wird gezeigt, wie solche Konflikte durch Einführung interner Kommunikation zwischen den Komponenten gelöst werden können, und zwar ausschließlich durch Verwendung an der Graphenstruktur ansetzender Verfahren.

This diploma thesis deals with problem of water hammer in pipes affected by viscoelastic behavior of pipe material. Mathematical model uses pressure dependent speed of sound in water air mixture. For purpose of numerical solution the Method of Characteristics with independent time step is introduced. This method is compared with commonly used methods such as Method of Characteristics (MOC) and Lax Wendroff scheme. Derived model, solved with Method of Characteristics with independent time step, is verified with experimental simulation.

The master thesis deals with the engineering design and realization of a sports electric vehicle for disabled people. The first part of thesis summarize competitive vehicles on market and also the necessary theoretical knowledge for the design phase. After analyzing the research and determine the resulting vehicle concept follows the draft design. In this section based on calculations was chosen the solutions and necessary components for a vehicle. The following section describes the structure of the vehicle in implementing selected components. In conclusion, the evaluation of the proposed solution.

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 2010.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 135-146).
As progress in molecular biology and nanotechnology continues, demand for rapid and high quality image acquisition has increased to the point where the limitations of atomic force microscopes (AFM) become impediments to further discovery. Many biological processes of interest occur on time scales faster than the observation capability of conventional AFMs, which are typically limited to imaging rates on the order of minutes. Imaging at faster scan rates excite resonances in the mechanical scanner that can distort the image, thereby preventing higher speed imaging. Although traditional robust feedforward controllers and input shaping have proven effective at minimizing the influence of scanner distortions, the lack of direct measurement and use of model-based controllers has required disassembling the microscope to access lateral motion with external sensors in order to perform a full system identification experiment, which places excessive demands on routine microscope operators. This work represents a new way to characterize the lateral scanner dynamics without addition of lateral sensors, and shape the commanded input signals in such a way that disturbing dynamics are not excited in an automatic and user-independent manner. Scanner coupling between the lateral and out-of-plane directions is exploited and used to build a minimal model of the scanner that is also sufficient to describe the source of the disturbances. This model informs the design of an online input shaper used to suppress components of the high speed command signals. The method presented is distinct from alternate approaches in that neither an information-complete system identification experiment, nor microscope modification are required. This approach has enabled an increase in the scan rates of unmodified commercial AFMs from 1-4 lines/second to over 100 lines/second and has been successfully applied to a custom-built high speed AFM, unlocking scan rates of over 1,600 lines/second. Images from this high speed AFM have been taken at more than 10 frames/second. Additionally, bulky optical components for sensing cantilever deflection and low bandwidth actuators constrain the AFM's potential observations, and the increasing instrument complexity requires operators skilled in optical alignment and controller tuning. Recent progress in MEMS fabrication has allowed the development of a new type of AFM cantilever with an integrated sensor and actuator. Such a fully instrumented cantilever enables direct measurement and actuation of the cantilever motion and interaction with the sample, eliminating the need for microscope operators to align the bulky optical components. This technology is expected to not only allow for high speed imaging but also the miniaturization of AFMs and expand their use to new experimental environments. Based on the complexity of these integrated MEMS devices, a thorough understanding of their behavior and a specialized controls approach is needed to guide non-expert users in their operation and extract high performance. The intrinsic properties of such MEMS cantilevers are investigated, and a combined approach is developed for sensing and control, optimized for high speed detection and actuation.
by Daniel J. Burns.
Ph.D.

Der Beitrag stellt eine Verallgemeinerung der Ergebnisse dar, die in den Informationen/07; 1976,05 veröffentlicht wurden. Sei F_n(x) die Verteilungsfunktion der Summe X_1+X_2+...+X_n, wobei X_1, X_2, ...,X_n unabhängige und nicht notwendig identisch verteilte Zufallsgrößen mit endlichen absoluten Momenten c_m, m>2, sind, und sei Phi die standardisierte Normalverteilungsfunktion. Es werden absolute Konstanten L_m derart berechnet, dass wir Fehlerabschätzungen im unleichmäßigen zentralen Grenzwertsatz explizit angeben können. Als Spezialfall ergibt sich die ungleichmäßige Fehlerschranke von A.BIKELIS (1966) im Fall der Existenz dritter absoluter Momente. Weiterhin werden Grenzwertsätze unter Voraussetzung einseitiger Momente betrachtet. Es werden einige Literaturhinweise angegeben
The paper is a generalization of the results, published by the author in Informationen/07; 1976,05. Let F_n(x) be the cdf of X_1+X_2+...+X_n, where X_1, X_2, ...,X_n are non iid random variables with m-th absolute moment c_m, m>2, and Phi the cdf of the unit normal law. Explicit universal constants L_m are computed such that we have some error estimates in the nonuniform central limit theorem. A special case is the nonuniform error bound by A.BIKELIS (1966) in the case of existence of third absolute moments. Furthermore limit theorems with assumption of onesided moments are considered. Some references are given

Der Beitrag unterteilt sich in zwei Teile: Teil 1 (vgl. Informationen/07; 1976,05) und Teil 2 (cp. Informationen/07; 1976,06). Teil 1 enthält eine Einleitung und Grenzwertsätze für unabhängige und identisch verteilte Zufallsgrößen und die Übertragung der betrachteten Grenzwertsätze auf den Fall der Existenz einseitiger Momente. Teil 2 enthält Grenzwertsätze für mittlere Abweichungen für Summen unabhängiger nichtidentisch verteilter Zufallsgrößen (Serienschema) und eine Diskussion der erhaltenen Ergebnisse und schließlich einige Literaturangaben. Sei F_n(x) die Verteilungsfunktion der Summe X_1+X_2+...+X_n, wobei X_1, X_2, ...,X_n unabhängige und identisch verteilte Zufallsgrößen mit Erwartungswert 0 und Streuung 1 und endlichen absoluten Momenten c_m, m>2, sind, und sei Phi die standardisierte Normalverteilungsfunktion. Es werden absolute Konstanten L_i derart berechnet, dass wir Fehlerabschätzungen im unleichmäßigen zentralen Grenzwertsätzen in verschiedenen Fällen angeben können, wobei sich der Index i in L_i auf folgende fünf Fälle bezieht: kleine x, mittlere Abweichungen für x, große Abweichungen für x, kleine n und große n. Im Fall der Existenz einseitiger Momente werden obere Schanken für 1-F_n(x) angegeben für x>D_m*n^(1/2)*ln(n) bzw. x>D_m*n^(1/2)*(ln(n))^(1/2), womit Ergebnisse von S.V.NAGAEV(1965) präzisiert werden
The paper is divided in two parts: part 1 (cp. Informationen/07; 1976,05) and part 2 (cp. Informationen/07; 1976,06). Part 1 contains an introduction and limit theorems for iid random variables and the transfer of the considered limit theorems to the case of the existence of onesided moments. Part 2 contains limit theorems of moderate deviations for sums of series of non iid random variables and a discussion of all obtained results in part 1 and 2 and finally some references. Let F_n(x) be the cdf of X_1+X_2+...+X_n, where X_1, X_2, ...,X_n are iid random variables with mean 0 and variance 1 and with m-th absolute moment c_m, m>2, and Phi the cdf of the unit normal law. Explicit universal constants L_i are computed such that we have an error estimate in the nonuniform central limit theorem with the L_i, where i corresponds to the five cases considered: small x, moderate deviations for x, large deviations for x, small n , large n. Additional upper bounds for 1-F_n(x) are obtained if the one-sided moments of order m, m>2, are finite and if x>D_m*n^(1/2)*ln(n) and x>D_m*n^(1/2)*(ln(n))^(1/2) respectively improving results by S.V.NAGAEV (1965)

Der Beitrag unterteilt sich in zwei Teile: Teil 1 (vgl. Informationen/07; 1976,05) und Teil 2 (cp. Informationen/07; 1976,06). Teil 1 enthält eine Einleitung und Grenzwertsätze für unabhängige und identisch verteilte Zufallsgrößen und die Übertragung der betrachteten Grenzwertsätze auf den Fall der Existenz einseitiger Momente. Teil 2 enthält Grenzwertsätze für mittlere Abweichungen für Summen unabhängiger nichtidentisch verteilter Zufallsgrößen (Serienschema) und eine Diskussion der erhaltenen Ergebnisse und schließlich einige Literaturangaben. Sei F_n(x) die Verteilungsfunktion der Summe X_1+X_2+...+X_n, wobei X_1, X_2, ...,X_n unabhängige und identisch verteilte Zufallsgrößen mit Erwartungswert 0 und Streuung 1 und endlichen absoluten Momenten c_m, m>2, sind, und sei Phi die standardisierte Normalverteilungsfunktion. Es werden absolute Konstanten L_i derart berechnet, dass wir Fehlerabschätzungen im unleichmäßigen zentralen Grenzwertsätzen in verschiedenen Fällen angeben können, wobei sich der Index i in L_i auf folgende fünf Fälle bezieht: kleine x, mittlere Abweichungen für x, große Abweichungen für x, kleine n und große n. Im Fall der Existenz einseitiger Momente werden obere Schanken für 1-F_n(x) angegeben für x>D_m*n^(1/2)*ln(n) bzw. x>D_m*n^(1/2)*(ln(n))^(1/2), womit Ergebnisse von S.V.NAGAEV(1965) präzisiert werden. Der Beitrag unterteilt sich in zwei Teile: Teil 1 (vgl. Informationen/07; 1976,05) und Teil 2 (cp. Informationen/07; 1976,06). Teil 1 enthält eine Einleitung und Grenzwertsätze für unabhängige und identisch verteilte Zufallsgrößen und die Übertragung der betrachteten Grenzwertsätze auf den Fall der Existenz einseitiger Momente. Teil 2 enthält Grenzwertsätze für mittlere Abweichungen für Summen unabhängiger nichtidentisch verteilter Zufallsgrößen (Serienschema) und eine Diskussion der erhaltenen Ergebnisse und schließlich einige Literaturangaben. Sei F_n(x) die Verteilungsfunktion der Summe X_1+X_2+...+X_n, wobei X_1, X_2, ...,X_n unabhängige und identisch verteilte Zufallsgrößen mit Erwartungswert 0 und Streuung 1 und endlichen absoluten Momenten c_m, m>2, sind, und sei Phi die standardisierte Normalverteilungsfunktion. Es werden absolute Konstanten L_i derart berechnet, dass wir Fehlerabschätzungen im unleichmäßigen zentralen Grenzwertsätzen in verschiedenen Fällen angeben können, wobei sich der Index i in L_i auf folgende fünf Fälle bezieht: kleine x, mittlere Abweichungen für x, große Abweichungen für x, kleine n und große n. Im Fall der Existenz einseitiger Momente werden obere Schanken für 1-F_n(x) angegeben für x>D_m*n^(1/2)*ln(n) bzw. x>D_m*n^(1/2)*(ln(n))^(1/2), womit Ergebnisse von S.V.NAGAEV(1965) präzisiert werden
The paper is divided in two parts: part 1 (cp. Informationen/07; 1976,05) and part 2 (cp. Informationen/07; 1976,06). Part 1 contains an introduction and limit theorems for iid random variables and the transfer of the considered limit theorems to the case of the existence of onesided moments. Part 2 contains limit theorems of moderate deviations for sums of series of non iid random variables and a discussion of all obtained results in part 1 and 2 and finally some references. Let F_n(x) be the cdf of X_1+X_2+...+X_n, where X_1, X_2, ...,X_n are iid random variables with mean 0 and variance 1 and with m-th absolute moment c_m, m>2, and Phi the cdf of the unit normal law. Explicit universal constants L_i are computed such that we have an error estimate in the nonuniform central limit theorem with the L_i, where i corresponds to the five cases considered: small x, moderate deviations for x, large deviations for x, small n , large n. Additional upper bounds for 1-F_n(x) are obtained if the one-sided moments of order m, m>2, are finite and if x>D_m*n^(1/2)*ln(n) and x>D_m*n^(1/2)*(ln(n))^(1/2) respectively improving results by S.V.NAGAEV (1965)

This mini-dissertation reviews present literature to define ICT and SMEs and determine the current situation in South Africa with regard to the use of ICT by SMEs, including possible benefits to SMEs as well as stumbling blocks to adopting ICT. The research consists of collecting data from ten SMEs in Gauteng in South Africa using questionnaires and interviews, to determine how SMEs can use ICT to become more competitive. The mini-dissertation will have a number of chapters: the first chapter will give an overview of the subject. The second chapter will explain the research motivation and methodology while the third chapter will be the literature review, which will explore the topic of ICT and SMEs in depth, with a focus on South Africa. Chapter four will deal with data collection and analysis; the main source of data will be interviews based on structured questions. The fifth chapter will be the discussion and recommendations based on the results of the analysis and the literature review. Chapter Six will be the conclusion.
Dissertation (MIT)--University of Pretoria, 2008.
Informatics
unrestricted

Mit der vorgelegten Arbeit werden neue Beiträge zur Grundlagenforschung auf dem Gebiet der Grenzwertsätze der Wahrscheinlichkeitstheorie vorgelegt. Grenzwertsätze für Summen unabhängiger Zufallsgrößen nehmen unter den verschiedenartigsten Forschungsrichtungen der Wahrscheinlichkeitstheorie einen bedeutenden Platz ein und sind in der heutigen Zeit nicht mehr allein von theoretischem Interesse. In der Arbeit werden Ergebnisse zu neuere Problemstellungen aus der Summationstheorie unabhängiger Zufallsgrößen vorgestellt, die erstmalig in den fünfziger bzw. sechzger Jahren des 20. Jahrhunderts in der Literatur auftauchten und in den zurückliegenden Jahren mit großem Interesse untersucht wurden. International haben sich in der Theorie der Grenzwertsätze zwei Hauptrichtungen herauskristallisiert: Zum Einen die Fragen zur Konvergenzgeschwindigkeit, mit der eine Summenverteilungsfunktion gegen eine vorgegebene Grenzverteilungsfunktion konvergiert, und zum Anderen die Fragen nach einer Fehlerabschätzung zur Grenzverteilungsfunktion bei einem endlichen Summationsprozeß. Zuerst werden unbegrenz teilbare Grenzverteilungsfunktionen betrachtet und dann wird speziell die Normalverteilung als Grenzverteilung diskutiert. Als charakteristische Kenngrößen werden sowohl Momente oder einseitige Momente bzw. Pseudomomente benutzt. Die Fehlerabschätzungen werden sowohl als gleichmäßige wie auch ungleichmäßige Restgliedabschätzungen angegeben, einschließlich einer Beschreibung der dabei auftretenden absoluten Konstanten. Als Beweismethoden werden sowohl die Methode der charakteristischen Funktionen als auch direkte Methoden (Faltungsmethode) weiter ausgebaut. Für eine 1965 von Bikelis angegebene Fehlerabschätzung gelang es nun erstmalig, die auftretende absolute Konstante C mit C=114,667 numerisch abzuschätzen. Weiterhin werden in der Arbeit sogenannte Grenzwertsätze für mittlere Abweichungen studiert. Hier werden erstmalig auch Restgliedabschätzungen abgeleitet. Der in den letzten Jahren zum Beweis von Grenzwertsätzen eingeschlagene Weg über die Faltung von Verteilungsfunktionen erwies sich als bahnbrechend und bestimmte die Entwicklung sowohl der Theorie der Grenzwertsätze für mittlere und große Abweichungen als auch der Untersuchung zu den ungleichmäßigen Abschätzungen im zentralen Grenzwertsatz bedeutend. Die Faltungsmethode stellt in der vorliegenden Dissertationsschrift das hauptsächliche Beweisinstrument dar. Damit gelang es, eine Reihe neuer Ergebnisse zu erhalten und insbesondere mittels der elektronischen Datenverarbeitung neue numerische Resultate zu erhalten
With the presented work new contributions to basic research in the field of limit theorems of probability theory are given. Limit theorems for sums of independent random variables taking on the most diverse lines of research in probability theory an important place in modern times and are no longer only of theoretical interest. In the work results are presented to newer problems on the summation theory of independent random variables, at first time in the fifties and sixties of the 20th Century appeared in the literature and have been studied in the past few years with great interest. International two main directions have emerged in the theory of limit theorems: Firstly, the questions on the convergence speed of a cumulative distribution function converges to a predetermined limit distribution function, and on the other hand the questions on an error estimate for the limit distribution function at a finite summation process. First indefinite divisible limit distribution functions are considered, then the normal distribution is specifically discussed as a limit distribution. As characteristic parameters both moments or one-sided moments or pseudo-moments are used. The error estimates are stated both in uniform as well as non-uniform residual bounds including a description of the occurring absolute constants. Both the method of characteristic functions as well as direct methods (convolution method) can be further expanded as proof methods. Now for the error estimate, 1965 given by Bikelis, was the first time to estimate the appearing absolute constant C with C = 114.667 numerically. Furthermore, in the work of so-called limit theorems for moderate deviations are studied. Here also remainder estimates are derived for the first time. In recent years to the proof of limit theorems the chosen way of the convolution of distribution functions proved to be groundbreaking and determined the development of both the theory of limit theorems for moderate and large deviations as well as the investigation into the nonuniform estimates in the central limit theorem significantly. The convolution method is in the present thesis, the main instrument of proof. Thus, it was possible to obtain a series of results and obtain new numerical results in particular by means of electronic data processing

Most of the microelectronic circuits fabricated today are synchronous, i.e. they are driven by one or several clock signals. Synchronous circuit design faces several fundamental challenges such as high-speed clock distribution, integration of multiple cores operating at different clock rates, reduction of power consumption and dealing with voltage, temperature, manufacturing and runtime variations. Asynchronous or clockless design plays a key role in alleviating these challenges, however the design and test of asynchronous circuits is much more difficult in comparison to their synchronous counterparts. A driving force for a widespread use of asynchronous technology is the availability of mature EDA (Electronic Design Automation) tools which provide an entire automated design flow starting from an HDL (Hardware Description Language) specification yielding the final circuit layout. Even though there was much progress in developing such EDA tools for asynchronous circuit design during the last two decades, the maturity level as well as the acceptance of them is still not comparable with tools for synchronous circuit design. In particular, logic synthesis (which implies the application of Boolean minimisation techniques) for the entire system's control path can significantly improve the efficiency of the resulting asynchronous implementation, e.g. in terms of chip area and performance. However, logic synthesis, in particular for asynchronous circuits, suffers from complexity problems. Signal Transitions Graphs (STGs) are labelled Petri nets which are a widely used to specify the interface behaviour of speed independent (SI) circuits - a robust subclass of asynchronous circuits. STG decomposition is a promising approach to tackle complexity problems like state space explosion in logic synthesis of SI circuits. The (structural) decomposition of STGs is guided by a partition of the output signals and generates a usually much smaller component STG for each partition member, i.e. a component STG with a much smaller state space than the initial specification. However, decomposition can result in component STGs that in isolation have so-called irreducible CSC conflicts (i.e. these components are not SI synthesisable anymore) even if the specification has none of them. A new approach is presented to avoid such conflicts by introducing internal communication between the components. So far, STG decompositions are guided by the finest output partitions, i.e. one output per component. However, this might not yield optimal circuit implementations. Efficient heuristics are presented to determine coarser partitions leading to improved circuits in terms of chip area. For the new algorithms correctness proofs are given and their implementations are incorporated into the decomposition tool DESIJ. The presented techniques are successfully applied to some benchmarks - including 'real-life' specifications arising in the context of control resynthesis - which delivered promising results.
Moderner Schaltungsentwurf fokussiert hauptsächlich synchrone Schaltungstechnik mit allen inhärenten Problemen. Asynchone (d.h. ungetaktete) Schaltungen zeichnen sich jedoch nicht nur durch das Fehlen der Taktversatzproblematik gegenüber ihren synchronen Pendents aus, sondern auch insbesondere durch geringeren Energieverbrauch, günstigere EMV-Eigenschaften, hohe Performance, Modularität und Robustheit gegenüber Schwankungen in der Spannungsversorgung, im Herstellungsprozess sowie Temperaturunterschieden. Diese Vorteile werden mit höherer Integration sowie höheren Taktraten signifikanter. Jedoch ist der Entwurf und auch der Test asynchroner Schaltungen erheblich schwieriger verglichen mit synchronen Schaltungen. Entwurfswerkzeuge zur Synthese asynchroner Schaltungen aus Hochsprachen-Spezifikationen sind zwar inzwischen verfügbar, sie sind jedoch noch nicht so ausgereift und bei weitem noch nicht so akzeptiert in der Industrie, wie ihre Äquivalente für den synchronen Schaltungsentwurf. Insbesondere fehlt es an Werkzeugunterstützung im Bereich der Logiksynthese komplexer Steuerungen („Controller“), welche kritisch für die Effizienz – z.B. in Bezug auf Chipfläche und Geschwindigkeit – der resultierenden Schaltungen oder Systeme ist. Zur Spezifikation von Steuerungen haben sich Signalflankengraphen („signal transition graphs“, STGs) bewährt, die auch als Entwurfseinstieg für eine Logiksynthese von SI-Schaltungen („speed independent“) verwendet werden. (SI-Schaltungen gelten als sehr robuste asynchrone Schaltungen.) Aus den STGs werden zwecks Logiksynthese Automaten abgeleitet werden, deren Zustandszahl aber oft prohibitiv groß werden kann. Durch sogenannte STG-Dekomposition wird die Logiksynthese einer komplexen Schaltung ermöglicht, was bislang aufgrund von Zustandsexplosion oft nicht möglich war. Dabei wird der Spezifikations-STG laut einer gegebenen Partition von Ausgangssignalen in viele kleinere Teilnetze dekomponiert, wobei zu jedem Partitionsblock ein Teilnetz – mit normalerweise signifikant kleinerem Zustandsraum im Vergleich zur Spezifikation – erzeugt wird. Zu jedem Teilnetz wird dann eine Teilschaltung (Komponente) mittels Logiksynthese generiert. Durch die Anwendung von STG-Dekomposition können jedoch Teilnetze erzeugt werden, die sogenannte irreduzible CSC-Konflikte aufweisen (d.h. zu diesen Teilnetzen kann keine SI-Schaltung erzeugt werden), obwohl die Spezifikation keine solchen Konflikte hatte. Diese Arbeit präsentiert einen neuen Ansatz, welcher die Entstehung solcher irreduziblen Konflikte vermeidet, und zwar durch die Einführung interner Kommunikation zwischen den (zu den Teilnetzen gehörenden) Schaltungskomponenten. Bisher werden STG-Dekompositionen total durchgeführt, d.h. pro resultierender Komponente wird ein Ausgangssignal erzeugt. Das führt gewöhnlich nicht zu optimalen Schaltungsimplementierungen. In dieser Arbeit werden Heuristiken zur Bestimmung gröberer Ausgabepartitionen (d.h. Partitionsblöcke mit mehreren Ausgangssignalen) vorgestellt, die zu kleineren Schaltungen führen. Die vorgestellten Algorithmen werden formal abgesichert und wurden in das bereits vorhandene Dekompositionswerkzeug DESIJ integriert. An praxisrelevanten Beispielen konnten die vorgestellten Verfahren erfolgreich erprobt werden.

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior
This work aims to analyze the dynamic performance of a synchronous generator and its controls in a distributed generation system, as well as evaluate the impacts of its operation when connected to the distribution grid, using for this task the ATPDraw interface/tool of software ATP. Within this context, it is firstly necessary to obtain suitable models to represent the synchronous machine control systems (voltage regulator, speed governor and stabilizer system) in ATPDraw. Furthermore, for stability analysis, it is developed a mathematical technique to calculate the machine power angle which is represented in ATPDraw by a device (icon). The adjustments of voltage and speed control system parameters are performed by some adopted procedures which are verified using two electric systems: the first one with a synchronous generator connected to the distribution grid; and the second with three distinct generators forming a multimachine system. In these systems some disturbances are applied such as load shedding and short-circuit to accomplish the studies. Finally, with the previous results, it is carried out some dynamic performance studies of a synchronous generator of an independent producer connected to a distribution grid so as to assess aspects of power quality (voltage magnitude), stability and to evaluate the influence of machine controls during the system response for a given load shedding.
Este trabalho tem como objetivo analisar o desempenho dinâmico de um gerador síncrono e seus controles, num sistema de geração distribuída, assim como avaliar os impactos causados por este quando da sua operação conectado às redes de distribuição, utilizando a interface ATPDraw do software ATP. Neste contexto, é primeiramente necessário obter modelos adequados para representar os sistemas de controle da máquina síncrona (regulador de tensão e regulador de velocidade e estabilizador do sistema) no ATPDraw. Além disso, para análise de estabilidade é desenvolvido uma técnica matemática para o cálculo do ângulo de potência da máquina a qual é representada no ATPDraw por um dispositivo (ícone). Para ajustar os parâmetros dos sistemas de controle de tensão e de velocidade são apresentados alguns procedimentos adotados, sendo estes verificados por meio de dois sistemas elétricos: o primeiro com um gerador síncrono conectado a uma rede de distribuição; e o segundo composto por três geradores distintos formando um sistema multimáquinas. Nesses sistemas são aplicados distúrbios do tipo rejeição de carga e curto-circuito para realização dos estudos. Finalmente, com os resultados obtidos anteriormente, são realizados estudos do desempenho dinâmico de um gerador síncrono de um produtor independente, conectado a rede de distribuição, para avaliar aspectos de qualidade de energia (magnitude de tensão), de estabilidade e verificar as influências dos controles da máquina durante a resposta do sistema para uma dada rejeição de carga.
Mestre em Ciências

In der Arbeit wird das asymptotische Verhalten von geeignet normierten und zentrierten Summen von Zufallsgrößen untersucht, die entweder unabhängig sind oder im Falle der Abhängigkeit als Martingaldifferenzfolge oder stark multiplikatives System auftreten. Neben der klassischen Summationstheorie werden die Limitierungsverfahren mit einer unendlichen Summationsmatrix oder einer angepaßten Folge von Gewichtsfunktionen betrachtet. Es werden die Methode der charakteristischen Funktionen und besonders die direkte Methode der konjugierten Verteilungsfunktionen weiterentwickelt, um quantitative Aussagen über gleichmäßige und ungleichmäßige Restgliedabschätzungen in zentralen Grenzwertsatz zu beweisen. Die Untersuchungen werden dabei in der Lp-Metrik, 1
In the work the asymptotic behavior of suitably centered and normalized sums of random variables is investigated, which are either independent or occur in the case of dependence as a sequence of martingale differences or a strongly multiplicative system. In addition to the classical theory of summation limiting processes are considered with an infinite summation matrix or an adapted sequence of weighting functions. It will be further developed the method of characteristic functions, and especially the direct method of the conjugate distribution functions to prove quantitative statements about uniform and non-uniform error estimates of the remainder term in central limit theorem. The investigations are realized in the Lp metric, 1

The work of this thesis was focused on the development of high-performance algorithms for a new generation of molecular descriptors, with many advantages with respect to its predecessors, suitable for diverse applications in the field of drug design, as well as its implementation in commercial grade scientific software (Pentacle). As a first step, we developed a new algorithm (AMANDA) for discretizing molecular interaction fields which allows extracting from them the most interesting regions in an efficient way. This algorithm was incorporated into a new generation of alignmentindependent molecular descriptors, named GRIND-2. The computing speed and efficiency of the new algorithm allow the application of these descriptors in virtual screening. In addition, we developed a new alignment-independent encoding algorithm (CLACC) producing quantitative structure-activity relationship models which have better predictive ability and are easier to interpret than those obtained with other methods.
El trabajo que se presenta en esta tesis se ha centrado en el desarrollo de algoritmos de altas prestaciones para la obtención de una nueva generación de descriptores moleculares, con numerosas ventajas con respecto a sus predecesores, adecuados para diversas aplicaciones en el área del diseño de fármacos, y en su implementación en un programa científico de calidad comercial (Pentacle). Inicialmente se desarrolló un nuevo algoritmo de discretización de campos de interacción molecular (AMANDA) que permite extraer eficientemente las regiones de máximo interés. Este algoritmo fue incorporado en una nueva generación de descriptores moleculares independientes del alineamiento, denominados GRIND-2. La rapidez y eficiencia del nuevo algoritmo permitieron aplicar estos descriptores en cribados virtuales. Por último, se puso a punto un nuevo algoritmo de codificación independiente de alineamiento (CLACC) que permite obtener modelos cuantitativos de relación estructura-actividad con mejor capacidad predictiva y mucho más fáciles de interpretar que los obtenidos con otros métodos.

博士
國立成功大學
電機工程學系碩博士班
91
Asynchronous circuits promise a number of important advantages over its synchronous counterparts for the design of digital circuits. These advantages, including elimination of clock skew problem, potential low-power consumption, average-case performance, modularity, and automatic adaptation to physical changes, have also encouraged an extensive research in recent years. Asynchronous circuits must be not only functionally equivalent to the specification but also free from hazards. Speed-independent (SI) circuits, relying on the unbounded gate delay model, are a broadly adopted design style for asynchronous applications. Our implementation structure for SI circuits is based on the standard C-implementation, which uses Muller C-elements as its asynchronous latches. After an SI circuit is synthesized from its specification, logic decomposition is then performed for technology mapping. The decomposition of a gate into smaller gates must again preserve not only the functional correctness but also speed independence, i.e., hazard freedom. 　　In this thesis, the modeling of an SI circuit is based on a class of interpreted free-choice Petri nets (PNs) named signals transition graphs (STGs). PNs are a powerful model to describe the behavior of a concurrent system that gracefully captures the behavior of causality, concurrency, and conflict between events. The proposed synthesis and decomposition techniques are based on the analysis of the concurrent and interleave relations between signal transitions in an STG, and the generation of covering cubes that cover the reachable markings. This STG-based approach can eliminate the state explosion problem by avoiding the explicit generation of all the markings. 　　The work in this thesis starts by synthesizing a hazard-free implementation from the STG specification of an SI circuit. Then a hazard-free combinational decomposition is performed to decompose each high-fanin gate into lower-fanin ones, carried down to two-input gates, on which technology mapping techniques operate. For those gates that cannot be hazard-freely decomposed, two signal-adding methods constructed at the STG level are developed for resynthesis. This decomposition and resynthesis process is iterated until all high-fanin gates are successfully decomposed or no solution can be found. The time efficiency of our method has been demonstrated in the experimental results conducted on the asynchronous benchmarks.

博士
國立臺灣大學
電機工程學研究所
84
Asynchronous design has received the resurgence of interest and been expected to become an important alternative to synchronous design. In this thesis, we presents an automatic synthesis sys- tem which adopts the Signal Transition Graphs (STGs) as input specifications and results in hazard-free asynchronous circuits. Our synthesized circuits from STGs are speed independent, which can operate correctly regardless of variations in delays of elementary gates. To realize such circuits, we firstly propose a realization circuit model based on a practical configuration and prove that a signal implemented with this circuit model is speed-independent.Then, we propose a novel graph transformation, Characteristic Graph (CG), to encapsulate all feasible solutions of the original STG in reduced size, which compares favorably to the state graph. Based on the CG, we can verify the hazard-freeness of circuits and explore the exact optimization of circuit realization without restoring to the state graph. We will propose a necessary and sufficient condition for an STG to have hazard-free implementation, which has not yet been reported. Furthermore, we will formulate the problems of exact-optimization as well-known graph problems and proved their complexities to be NP-hard. A heuristic method is thus proposed and evaluated with examples from $sis$ and a set of STGs with thousands of states. We obtain significant improvement over previous works in CPU time.

碩士
國立臺灣科技大學
機械工程系
101
In this research, we design a four-wheel drive electric vehicle is instructed with FPGA control kernel for the whole vehicle system. The vehicle control system includes motor driver, driving controller and sensor feedback module. The performance of the vehicle velocity control based on two kinds of intelligent control schemes is compared. They are self-adjusting fuzzy sliding mode control and functional approximation based adaptive control. For constant speed cruising, the motors driver mode can be changed to reduce the energy consumption. The vehicle deceleration is controlled by the electric brake of motor driver. This brake system can also be used in speed control for improving the tracking situation which the actual velocity faster than the target velocity. When vehicle is driving on the low friction road, the controller will calculate the velocity error and the error change of the vehicle speed with respect to command and provide on speed appropriate wheel speed. The electric brake can be used to suppress the increasing of the rotational speed for improving the safety or handling, and reducing conserve the energy consumption.

碩士
國立成功大學
電機工程學系
85
In this thesis, we present a systematic method for the synthesis of asynchronous speed-independent circuits using basic gates and C-elements. Our synthesis system also integrates the technology mapping and logic optimization procedure during synthesis so that the resulting circuits will be near-optimal in accordance with gates supported by the cell library. To reduce the time complexity associated with the combination of both synthesis and technology mapping, our task will be done entirely on the signal transition graph (STG) domain. This method has been implemented and shown efficient by the experiments carried out on several academic and industrial benchmarks. Moreover, all the results have also been verified to be correct by the speed-independent verification tool. Thus, the reliability of our synthesis system also can be approved.

碩士
明新科技大學
電子工程研究所
96
The skills concerned with computer have been advancing considerably over recent decades. Nowadays, both enterprises and individuals rely on computer more than they ever did, and with the computer data growing, the saving devices turn from 360KB, 1.44MB and 100MB to hundreds of GB and even TB. Once any problems such as deficient room and damaged data come up, things will be very troublesome. Therefore, the issues about saving and safety of computer data become paramount. In the medium and large-scaled enterprises, due to the more complete staff and system, the MIS and relevant departments will cope with this kind of problems. However, for the small-scaled companies, SOHO and individuals and families, a simple saving and back-up system is relatively indispensable. This article is going to introduce the saving system plan that combines the Ethernet function and RAID (Redundant Arrays of Independent Disks). Through the most convenient connection channel, Ethernet, the whole company and family can easily manipulate and connect the computers. In addition, it is unnecessary to change the original Network line greatly, and both the safety and convenience of saving room can simultaneously upgrade. This plan includes the function able to extend the hard discs. Users can extend the capacity and back up data according to their using styles and needs. In this article, we will explain the generally RAID level. And the power source management of the system and some important IC. Then propose the function block of system. We will give a full description of the design of hardware. Finally, we will prove that this kind of hardware can actually be put into practice and this equipment can be a simple back up tool for computer data.

In der Arbeit wird das asymptotische Verhalten von geeignet normierten und zentrierten Summen von Zufallsgrößen untersucht, die entweder unabhängig sind oder im Falle der Abhängigkeit als Martingaldifferenzfolge oder stark multiplikatives System auftreten. Neben der klassischen Summationstheorie werden die Limitierungsverfahren mit einer unendlichen Summationsmatrix oder einer angepaßten Folge von Gewichtsfunktionen betrachtet. Es werden die Methode der charakteristischen Funktionen und besonders die direkte Methode der konjugierten Verteilungsfunktionen weiterentwickelt, um quantitative Aussagen über gleichmäßige und ungleichmäßige Restgliedabschätzungen in zentralen Grenzwertsatz zu beweisen. Die Untersuchungen werden dabei in der Lp-Metrik, 1In the work the asymptotic behavior of suitably centered and normalized sums of random variables is investigated, which are either independent or occur in the case of dependence as a sequence of martingale differences or a strongly multiplicative system. In addition to the classical theory of summation limiting processes are considered with an infinite summation matrix or an adapted sequence of weighting functions. It will be further developed the method of characteristic functions, and especially the direct method of the conjugate distribution functions to prove quantitative statements about uniform and non-uniform error estimates of the remainder term in central limit theorem. The investigations are realized in the Lp metric, 1