To see the other types of publications on this topic, follow the link: Redundancy (Engineering).

Dissertations / Theses on the topic 'Redundancy (Engineering)'

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

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Redundancy (Engineering).'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

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

1

Tai, Cheng-Tao. "Time dependant redundancy optimization." Thesis, This resource online, 1993. http://scholar.lib.vt.edu/theses/available/etd-01312009-063418/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Pagonakis, Dimitrios. "Volumetric topology optimization under redundancy constraints." Thesis, Massachusetts Institute of Technology, 2016. http://hdl.handle.net/1721.1/104242.

Full text
Abstract:
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Civil and Environmental Engineering, 2016.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 117-120).
With ever-increasing pollution and scarcity of resources, structural optimization, the science of finding the optimal structural arrangements under equilibrium constraints, is becoming an increasing necessity in engineering practice. However, designers are hesitant to adopt a method that is by nature a limit state and thus potentially unreliable. This thesis embeds a level of safety, namely redundancy, within the structural optimization process. Redundancy is the ability to remove a certain number of elements from the structure without losing stability. The thesis translates this constraint into a linear mathematical optimization problem. Then, a topology optimization algorithm is developed that identifies the least volume structure with the ability to remove any element(s) while maintaining stability under the initial loading. Besides the developed algorithm, this thesis shows the relation between the internal forces of redundant structures and their substructures, and in fact shows that it can be expressed linearly when only 1 level of redundancy is provided, and polynomial for higher levels. The algorithm is eventually implemented and extensively analyzed for a series of configurations, showing that redundant optimal shapes have considerably less volume than twice that of the pure volumetric optimal, and hence effectively combine safety with material efficiency. Overall, this thesis constitutes the early stage of a novel structural optimization algorithm that is unique to its volumetric optimization objectives.
by Dimitrios Pagonakis.
M. Eng.
APA, Harvard, Vancouver, ISO, and other styles
3

Arenson, Noga. "Real-time redundancy-resolution schemes for robotic manipulators." Thesis, McGill University, 1998. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=20197.

Full text
Abstract:
This thesis reports work not only on the numerics behind, but also the implementation of real-time redundancy-resolution schemes on a real robot. Furthermore, the robot that was chosen as the experimental platform is, isotropic. Redundant robots have more degrees of freedom than needed to perform a class of tasks. A new performance index is proposed in the thesis, that is quadratic in the joint variables and its weighting function has units of frequency. It is shown how this performance index can produce cyclic trajectories in a simple manner, thereby eliminating the undesired drift of the joint angles upon tracking a closed Cartesian trajectory.
Isotropic robots can be postured in such a way that the condition number of their Jacobian matrices can attain a minimum value of unity. It is shown in the thesis that this feature is closely related to the performance of the robot. It appears that trajectories that are close to the set of isotropic postures are performed with smaller errors than trajectories lying far from that set.
The experiments reported here were conducted on the McGill-IRIS C3 Arm, an isotropic, four-revolute redundant manipulator, used to position the operation point of its end link. (Abstract shortened by UMI.)
APA, Harvard, Vancouver, ISO, and other styles
4

Shiao, Cheng-Mu. "Resolution of kinematic redundancy through local and global optimization /." The Ohio State University, 1988. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487597424137831.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Khoury, Nancy. "Path enumeration & redundancy removal for timing optimization." Related electronic resource: Current Research at SU : database of SU dissertations, recent titles available full text, 2009. http://wwwlib.umi.com/cr/syr/main.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Nowicki, David R. "Reliability allocation and apportionment : addressing redundancy and life-cycle cost /." Thesis, This resource online, 1993. http://scholar.lib.vt.edu/theses/available/etd-08042009-040416/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Lloyd, Jason B. "Internal Redundancy of Mechanically-Fastened Steel Built-Up Axially-Loaded Members." Thesis, Purdue University, 2018. http://pqdtopen.proquest.com/#viewpdf?dispub=10844999.

Full text
Abstract:

The objectives of this research were to determine if mechanically-fastened steel built-up axially-loaded tension members are resistant to complete cross-sectional fracture when a single component suddenly fractures and if so, to develop simplified methods of analysis for post-fracture load redistribution behavior for calculation of remaining fatigue life. The ability to resist complete member failure and perform at a predetermined level of reliability with a failed component is referred to as internal member redundancy (IMR). The experimental program included seven full-scale tests; five were extremely demanding fracture tests, including one specimen with a tack weld placed in the path of a running fracture, and the other two were full-scale specimens removed from a 1940’s era built-up riveted deck truss, which were partially failed and tested to calibrate finite element models. Comprehensive finite element model-based parametric studies were carried out investigating the post-fracture load redistribution behavior and resulting stress amplification for multi-component, angle-only, and two-channel type axial members. Simplified closed-form solutions were developed for members of any geometry that fall within these broad categories of built-up axially-loaded tension members.

The IRM evaluation process is intended to combine the concepts related to probability of detection (POD) of fatigue cracks on steel bridges with the fatigue damage tolerance of mechanically-fastened built-up members. Preliminary results from ongoing POD research at Purdue University suggests that the steel bridge industry has unknowingly been relying on internal redundancy of mechanically-fastened built-up members. In other words, due to the difficulty of finding small cracks in components of built-up members, it is more likely that traditional arms-length inspections of fracture-critical members will find broken components instead. More candidly stated, this research provides the industry with quantitative analysis for the purpose of establishing rational inspection intervals for built-up axial members that are realistic about what can be reliably found during inspections and for what duration undiscovered damage can be safely tolerated due to internal member redundancy of the mechanically-fastened built-up member.

APA, Harvard, Vancouver, ISO, and other styles
8

Baron, Luc. "Contributions to the estimation of rigid-body motion under sensor redundancy." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp03/NQ29886.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Joshi, Gauri. "Efficient redundancy techniques to reduce delay in Cloud systems." Thesis, Massachusetts Institute of Technology, 2016. http://hdl.handle.net/1721.1/105944.

Full text
Abstract:
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2016.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 197-209).
Cloud services are changing the world by providing millions of people low-cost access to the computing power of data centers. Storing and processing data on shared servers in the cloud provides scalability and flexibility to these services. However the large-scale sharing of resources also causes unpredictable fluctuations in the response time of individual servers. In this thesis we use redundancy as a tool to combat this variability. We study three areas of cloud infrastructure: cloud computing, distributed storage, and streaming communication. In cloud computing, replicating a task on multiple machines and waiting for the earliest copy to finish can reduce service delay. But intuitively, it costs additional computing resources, and increases queueing load on the servers. In the first part of this thesis we analyze the eect of redundancy on queues. Surprisingly, there are regimes where replication not only reduces service delay but also reduces queueing load, thus making the system more ecient. Similarly, we can speed-up content download from cloud storage systems by requesting multiple replicas of a le and waiting for any one. In the second part of the thesis we generalize from replication to coding, and propose the (n, k) fork-join model to analyze the delay in accessing an (n, k) erasure-coded storage system. This analysis provides practical insights into how many users can access a piece of content simultaneously, and how fast they can be served. Achieving low latency is even more challenging in streaming communication because the packets need to be delivered fast and in-order. The third part of this thesis develops erasure codes to transmit redundant combinations of packets and ensure smooth playback. This thesis blends a diverse set of mathematical tools from queueing, coding theory, and renewal processes. Although we focus on cloud infrastructure, the techniques and insights are applicable to other systems with stochastically varying components.
by Gauri Joshi.
Ph. D.
APA, Harvard, Vancouver, ISO, and other styles
10

Huang, Mingzen. "Force and motion programming in multi-limb robotic systems with redundancy /." The Ohio State University, 1988. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487592050229629.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

Etemadi-Zanganeh, Kourosh. "Kinematics of manipulators with parellelism, modularity and redundancy : analysis and design." Thesis, McGill University, 1995. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=29020.

Full text
Abstract:
A general class of manipulators with hybrid kinematic chains is introduced. These manipulators are modular and can readily lead to kinematically redundant structures. Moreover, they may contain serial subchains as well as subchains of parallel modules, acting in parallel and connecting a base to a common end-effector.
At the onset, a novel formalism is introduced to study modular kinematic structures. This includes some new concepts and definitions. The proposed formalism provides a systematic way to represent a complex hybrid manipulator through a hierarchy of its constituting modules. Next, a formulation is devised to study the instantaneous kinematics of these manipulators. The proposed formulation is general and can be applied to most of the existing parallel and hybrid manipulators. To realize the concept of general hybrid manipulator in practice, a few prototype designs are also introduced. The proposed prototypes are superior to their conventional counterparts in terms of dexterity and the volume of their workspace.
The study is then extended to the theory of hyper-redundant manipulators that comprise, as a subclass, the variable-geometry trusses. A spline-based solution method is proposed for the inverse kinematics of hyper-redundant manipulators. The method is applicable to both extensible and nonextensible cases and includes planar as well as spatial manipulators. Also, a new variable-geometry truss is introduced whose modules themselves are kinematically redundant.
Another practical aspect of redundancy is the use of redundant-sensor data to simplify inherent nonlinear direct kinematics of parallel manipulators. For a six-degree-of-freedom general parallel manipulator, we introduce a formulation of the direct kinematics whereby the positioning and orientation problems are decoupled by introducing two auxiliary parameters in the forms of either two angles or two lengths. This is in accordance with the type of redundant sensors, i.e., rotary or translational, to be used. Moreover, a real-time implementation of extra-sensor data, with a unique direct kinematics solution, is proposed by resorting to an eigenvalue problem. The parallelism in the proposed formulation enables the user to benefit from a parallel-computing environment. Hence, we introduce a parallel-computing algorithm that highly increases the robustness of the computational algorithm.
The concept of kinematic isotropy has been used as a criterion in the design of serial and parallel robotic manipulators. However, all notions adopted to express isotropy in parallel manipulators have been based on the structure of the Jacobian matrices of serial manipulators. Here, we introduce a definition of kinematic isotropy that is well-suited to parallel manipulators. This is done by identifying the special structure of the Jacobian matrices involved in the differential kinematics of such manipulators. This leads to a partitioning of the Jacobian matrices into submatrices with dimensionally homogeneous entries. Moreover, based on the proposed definitions of isotropy and kinematic optimality, a set of conditions is derived that provides a systematic way for the optimum kinematic design of parallel manipulators, with or without structural constraints.
APA, Harvard, Vancouver, ISO, and other styles
12

Baldwin, Andrew Lockett. "A Fault-Tolerant Alternative to Lockstep Triple Modular Redundancy." PDXScholar, 2012. https://pdxscholar.library.pdx.edu/open_access_etds/331.

Full text
Abstract:
Semiconductor manufacturing defects adversely affect yield and reliability. Manufacturers expend vast resources to reduce defects within their processes. As the minimum feature size get smaller, defects become increasingly difficult to prevent. Defects can change the behavior of a logic circuit resulting in a fault. Manufacturers and designers may improve yield, reliability, and profitability by using design techniques that make products robust even in the presence of faults. Triple modular redundancy (TMR) is a fault tolerant technique commonly used to mask faults using voting outcomes from three processing elements (PE). TMR is effective at masking errors as long as no more than a single processing element is faulty. Time distributed voting (TDV) is proposed as an active fault tolerant technique. TDV addresses the shortcomings of triple modular redundancy (TMR) in the presence of multiple faulty processing elements. A faulty PE may not be incorrect 100% of the time. When a faulty element generates correct results, a majority is formed with the healthy PE. TDV observes voting outcomes over time to make a statistical decision whether a PE is healthy or faulty. In simulation, fault coverage is extended to 98.6% of multiple faulty PE cases. As an active fault tolerant technique, TDV identifies faulty PE's so that actions may be taken to replace or disable them in the system. TDV may provide a positive impact to semiconductor manufacturers by improving yield and reliability even as fault frequency increases.
APA, Harvard, Vancouver, ISO, and other styles
13

Xie, Wei. "RROS reliability redundancy optimization solver: A Microsoft Excel add-in." Thesis, University of Ottawa (Canada), 2008. http://hdl.handle.net/10393/27610.

Full text
Abstract:
This thesis proposes an implementation of an improved algorithm for solving nonlinear separable integer programming problems, as they arise in the field of system reliability. The reliability redundancy optimization solver (RROS) improves on a hybrid technique of dynamic programming with depth first search with tighter variable bounds. The implementation takes the form of an Excel add-in, which will be familiar to users with little formal OR/MS training. The user interface design is discussed. Example applications with benchmarks show that the RROS offers accurate solutions in a comparatively efficient way. This thesis further introduces a surrogate method to solve nonlinear problems with non-separable objectives, where a separable constraint is used as a surrogate objective. This is shown to yield solutions to a number of difficult cases.
APA, Harvard, Vancouver, ISO, and other styles
14

Tang, Jennifer (Jennifer Susan). "Physical redundancy for defect tolerance : example designs and fundamental limits." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/101588.

Full text
Abstract:
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.
Cataloged from PDF version of thesis.
Includes bibliographical references (page 75).
This project analyzes designs for physical redundancy which are modeled abstractly as a bipartite graph. The goal is to determine the characteristics of graph structures which optimize the trade-off between the number of edges and the number of redundant components or nodes needed while correcting a deterministic number of worst-case errors. This thesis looks at finite-sized designs, asymptotically large designs with finite error correcting values, and designs with asymptotically large error correcting values. Results include some small optimal graph structures and fundamental limits on what the optimal design structure can achieve for the cases where a small number of errors are corrected and for where the number of errors to be correctly grows asymptotically.
by Jennifer Tang.
S.M.
APA, Harvard, Vancouver, ISO, and other styles
15

Pettersson, Robert. "Safety analysis on digital hydraulics : Redundancy study for aviation applications." Thesis, Linköpings universitet, Fluida och mekatroniska system, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-150540.

Full text
Abstract:
Digital hydraulic actuators (DHA) are an interesting new technology that couldreplace todays system with inefficient proportional valves. By using an arrayof on/off valves the hydraulic pressures are discretised. This gives a fixed setof force outputs that can be used to control the actuator. DHA systems havebeen proven to drastically reduce the energy consumption at the cost of highersystem complexity. More components and more advanced controllers are neededto maintain an equal system performance.Previous research has been mentioning the fault tolerance of the DHA systemwithout analysing the actual requirements to achieve it. In this thesis a safetyanalysis is made. One first approach of making an active fault tolerant system ispresented and the effects of using this is analysed. In total, over four million failuremodes are analysed and grouped into 2402 system outputs. The thesis is also thefirst within the research of DHA system to present a chamber wise analysis, whereall four chambers are analysed independently.The thesis also presents a method to calculate reliability for the system. Themethod is a new computational way of creating and reducing fault trees. Fromthe fault trees the probability of system failure can be calculated.The conclusion of this thesis is that DHA is not fault tolerant by default butcan be if designed correctly. The thesis also concludes that if the componentsin the DHA system have the same reliability as the components used in today’ssystem the reliability is similar.
APA, Harvard, Vancouver, ISO, and other styles
16

Selek, I. (István). "Novel evolutionary methods in engineering optimization—towards robustness and efficiency." Doctoral thesis, University of Oulu, 2009. http://urn.fi/urn:isbn:9789514291579.

Full text
Abstract:
Abstract In industry there is a high demand for algorithms that can efficiently solve search problems. Evolutionary Computing (EC) belonging to a class of heuristics are proven to be well suited to solve search problems, especially optimization tasks. They arrived at that location because of their flexibility, scalability and robustness. However, despite their advantages and increasing popularity, there are numerous opened questions in this research area, many of them related to the design and tuning of the algorithms. A neutral technique called Pseudo Redundancy and related concepts such as Updated Objective Grid (UOG) is proposed to tackle the mentioned problem making an evolutionary approach more suitable for ''real world'' applications while increasing its robustness and efficiency. The proposed UOG technique achieves neutral search by objective function transformation(s) resulting several advantageous features. (a) Simplifies the design of an evolutionary solver by giving population sizing principles and directions to choose the right selection operator. (b) The technique of updated objective grid is adaptive without introducing additional parameters, therefore no parameter tuning required for UOG to adjust it for different environments, introducing robustness. (c) The algorithm of UOG is simple and computationally cheap. (d) It boosts the performance of an evolutionary algorithm on high dimensional (constrained and unconstrained) problems. The theoretical and experimental results from artificial test problems included in this thesis clearly show the potential of the proposed technique. In order to demonstrate the power of the introduced methods under "real" circumstances, the author additionally designed EAs and performed experiments on two industrial optimization tasks. Although, only one project is detailed in this thesis while the other is referred. As the main outcome of this thesis, the author provided an evolutionary method to compute (optimal) daily water pump schedules for the water distribution network of Sopron, Hungary. The algorithm is currently working in industry.
APA, Harvard, Vancouver, ISO, and other styles
17

Tosun, Levent. "Dynamically adding redundancy for improved error concealment in packet voice coding." Thesis, McGill University, 2004. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=82640.

Full text
Abstract:
Data is sent in packets of bits over the Internet. However, packets may not arrive in order or in time for playout. Packet loss is a frequently encountered problem in Voice-over-IP (VoIP) applications. Modern speech coders use past information to decode current packets in order to reach very low bit-rates. Therefore, when a packet is lost, the effect of this packet loss propagates over several subsequent packets.
In this thesis, a new redundancy-based packet-loss-concealment scheme is presented. Many redundancy-based packet-loss-concealment schemes send a fixed amount of extra information about the current packet as part of the subsequent packet, but not every packet is equally important for packet loss concealment. We have developed an algorithm to determine the importance of packets and we propose that extra information should only be sent for the important packets. This provides a lower average bit-rate compared to sending the same amount of extra information for each and every packet. We use a linear prediction (LP) based speech coder (ITU-T G.723.1) as a test platform and we propose that only the excitation parameters should be sent as extra information since LP parameters of a frame can be estimated using the LP parameters of the previous frame. Furthermore, we propose that excitation parameters of an important frame that are sent as redundant information should be used in the reconstruction of the lost waveform---as a consequence, the states of the subsequent frame will also be updated.
APA, Harvard, Vancouver, ISO, and other styles
18

Pham, Huy V. "Evaluation of Redundancy of Twin Steel Box-Girder Bridges." FIU Digital Commons, 2016. http://digitalcommons.fiu.edu/etd/2720.

Full text
Abstract:
Based on the definition given in the AASHTO LRFD Bridge Design Specifications, twin steel box-girder bridges are classified as bridges with fracture critical members (FCMs), in which a failure of a tension member is expected to lead to a collapse of the bridge. However, a number of such bridges with either a partial or full-depth crack in one girder have been reported and are still providing service without collapsing. The main objective of this research project is to understand the behavior of twin steel box-girder bridges and to develop methods for evaluating their redundancy level in the event of the fracture of one tension member. The research project included an experimental investigation on a small-scale steel twin box-girder bridge, field testing of a full-scale twin box-girder, analysis of existing research and design data, and an extensive amount of numerical analyses carried out on calibrated 3-D nonlinear finite element models. The results from this study provide in-depth understanding of twin steel box-girder bridge behavior before and after a fracture in the tension member occurs. In addition to the experimentally verified finite element method, the report also proposes simplified methods for evaluating the load-carrying capacity of twin steel box-girder bridges under vii concentrated loads and provides a list of important factors that could control the reserve capacity of the damaged bridge. The main conclusion of this research is that the redundancy exists in twin steel boxgirder bridges in an event that a fracture of a tension member(s) takes place. This research project also provides a comprehensive roadmap for assessing the redundancy of twin steel box-girder bridges in which the elements of the roadmap are identified, and solutions for several of the steps are provided. The development of solutions for remaining steps of the roadmap is proposed for a future research.
APA, Harvard, Vancouver, ISO, and other styles
19

Abdallah, Samer Adel. "Towards music perception by redundancy reduction and unsupervised learning in probabilistic models." Thesis, Queen Mary, University of London, 2002. http://qmro.qmul.ac.uk/xmlui/handle/123456789/3801.

Full text
Abstract:
The study of music perception lies at the intersection of several disciplines: perceptual psychology and cognitive science, musicology, psychoacoustics, and acoustical signal processing amongst others. Developments in perceptual theory over the last fifty years have emphasised an approach based on Shannon’s information theory and its basis in probabilistic systems, and in particular, the idea that perceptual systems in animals develop through a process of unsupervised learning in response to natural sensory stimulation, whereby the emerging computational structures are well adapted to the statistical structure of natural scenes. In turn, these ideas are being applied to problems in music perception. This thesis is an investigation of the principle of redundancy reduction through unsupervised learning, as applied to representations of sound and music. In the first part, previous work is reviewed, drawing on literature from some of the fields mentioned above, and an argument presented in support of the idea that perception in general and music perception in particular can indeed be accommodated within a framework of unsupervised learning in probabilistic models. In the second part, two related methods are applied to two different low-level representations. Firstly, linear redundancy reduction (Independent Component Analysis) is applied to acoustic waveforms of speech and music. Secondly, the related method of sparse coding is applied to a spectral representation of polyphonic music, which proves to be enough both to recognise that the individual notes are the important structural elements, and to recover a rough transcription of the music. Finally, the concepts of distance and similarity are considered, drawing in ideas about noise, phase invariance, and topological maps. Some ecologically and information theoretically motivated distance measures are suggested, and put in to practice in a novel method, using multidimensional scaling (MDS), for visualising geometrically the dependency structure in a distributed representation.
APA, Harvard, Vancouver, ISO, and other styles
20

Govindaraj, Santhosh. "Calculation of sensor redundancy degree for linear sensor systems." Thesis, University of Iowa, 2010. https://ir.uiowa.edu/etd/503.

Full text
Abstract:
The rapid developments in the sensor and its related technology have made automation possible in many processes in diverse fields. Also sensor-based fault diagnosis and quality improvements have been made possible. These tasks depend highly on the sensor network for the accurate measurements. The two major problems that affect the reliability of the sensor system/network are sensor failures and sensor anomalies. The usage of redundant sensors offers some tolerance against these two problems. Hence the redundancy analysis of the sensor system is essential in order to clearly know the robustness of the system against these two problems. The degree of sensor redundancy defined in this thesis is closely tied with the fault-tolerance of the sensor network and can be viewed as a parameter related to the effectiveness of the sensor system design. In this thesis, an efficient algorithm to determine the degree of sensor redundancy for linear sensor systems is developed. First the redundancy structure is linked with the matroid structure, developed from the design matrix, using the matroid theory. The matroid problem equivalent to the degree of sensor redundancy is developed and the mathematical formulation for it is established. The solution is obtained by solving a series of l1-norm minimization problems. For many problems tested, the proposed algorithm is more efficient than other known alternatives such as basic exhaustive search and bound and decomposition method. The proposed algorithm is tested on problem instances from the literature and wide range of simulated problems. The results show that the algorithm determines the degree of redundancy more accurately when the design matrix is dense than when it is sparse. The algorithm provided accurate results for most problems in relatively short computation times.
APA, Harvard, Vancouver, ISO, and other styles
21

Larin, Sergei Yurievich. "Exploiting Program Redundancy to Improve Performance, Cost and Power Consumtion in Embedded Systems." NCSU, 2000. http://www.lib.ncsu.edu/theses/available/etd-20000707-124409.

Full text
Abstract:

During the last 15 years embedded systems have grown rapidly in complexity and performance to a point where theynow rival the design challenges of desktop systems. Embedded systems are now targets for contradictory requirements: they are expected to occupy a small amount of physical space (e.g., low package count), be inexpensive, consume low power and be highly reliable. Regardless of the decades of intensive research and development, there are still areas that can promise significant benefits if further researched. One such area is the quality of the data which embedded system operates upon. This includes both code and data segments of an embedded system application. This work presents a unified, compiler-driven approach to solving the redundancy problem. It attempts toincrease the quality of the data stream that embedded systems are operating upon while preserving the original functionality. The code size reduction is achieved by Huffman compressing or tailor encoding the ISA of the original program. The data segment size reduction is accomplished by modified Discrete Dynamic Huffman encoding. This work is the first such study that also details the design of instruction fetch mechanisms for the proposed compression schemes.

APA, Harvard, Vancouver, ISO, and other styles
22

Chang, Albert Hsu Ting. "Low-power high-performance SAR ADC with redundancy and digital background calibration." Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/82177.

Full text
Abstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2013.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (p. 195-199).
As technology scales, the improved speed and energy eciency make the successive- approximation-register (SAR) architecture an attractive alternative for applications that require high-speed and high-accuracy analog-to-digital converters (ADCs). In SAR ADCs, the key linearity and speed limiting factors are capacitor mismatch and incomplete digital-to-analog converter (DAC)/reference voltage settling. In this the- sis, a sub-radix-2 SAR ADC is presented with several new contributions. The main contributions include investigation of using digital error correction (redundancy) in SAR ADCs for dynamic error correction and speed improvement, development of two new calibration algorithms to digitally correct for manufacturing mismatches, design of new architecture to incorporate redundancy within the architecture itself while achieving 94% better energy eciency compared to conventional switching algorithm, development of a new capacitor DAC structure to improve the SNR by four times with improved matching, joint design of the analog and digital circuits to create an asynchronous platform in order to reach the targeted performance, and analysis of key circuit blocks to enable the design to meet noise, power and timing requirements. The design is fabricated in standard 1P9M 65nm CMOS technology with 1.2V supply. The active die area is 0.083mm² with full rail-to-rail input swing of 2.4V p-p . A 67.4dB SNDR, 78.1dB SFDR, +1.0/-0.9 LSB₁₂ INL and +0.5/-0.7 LSB₁₂ DNL are achieved at 50MS/s at Nyquist rate. The total power consumption, including the estimated calibration and reference power, is 2.1mW, corresponding to 21.9fJ/conv.- step FoM. This ADC achieves the best FoM of any ADCs with greater than 10b ENOB and 10MS/s sampling rate.
by Albert Hsu Ting Chang.
Ph.D.
APA, Harvard, Vancouver, ISO, and other styles
23

Del, Gobbo Diego. "Formal specification of requirements for analytical redundancy based fault tolerant flight control systems." Morgantown, W. Va. : [West Virginia University Libraries], 2000. http://etd.wvu.edu/templates/showETD.cfm?recnum=1629.

Full text
Abstract:
Thesis (Ph. D.)--West Virginia University, 2000.
Title from document title page. Document formatted into pages; contains ix, 185 p. : ill. Includes abstract. Includes bibliographical references (p. 87-91).
APA, Harvard, Vancouver, ISO, and other styles
24

Espina, Miguel Angel. "Integration of fault tolerance and hardware redundancy techniques into the design of mobile platforms." FIU Digital Commons, 1998. http://digitalcommons.fiu.edu/etd/3155.

Full text
Abstract:
This work addresses the development of a fault-tolerant mobile platform. Fault-tolerant mechanical system design is an emerging technology that attempts to build highly reliable systems by incorporating hardware and software architectures. For this purpose, previous work in fault-tolerant were reviewed. Alternate architectures were evaluated to maximize the fault tolerance capabilities of the driving and steering systems of a mobile platform. The literature review showed that most of the research work on fault tolerance has been done in the area of kinematics and control systems of robotic arms. Therefore, hardware redundancy and fault tolerance in mobile robots is an area to be researched. The prototype constructed as part of this work demonstrated basic principles and uses of a fault-tolerant mechanism, and is believed to be the first such system in its class. It is recommended that different driving and steering architectures, and the fault-tolerant controllers' performance be tested on this prototype.
APA, Harvard, Vancouver, ISO, and other styles
25

Chen, Yuan. "Joint Design of Redundancy and Maintenance for Parallel-Series Continuous-State Systems." Ohio University / OhioLINK, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1628594957896883.

Full text
APA, Harvard, Vancouver, ISO, and other styles
26

Chen, Yuan. "Joint Design of Redundancy and Maintenance for Parallel-Series Continuous-State Systems." Ohio University / OhioLINK, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1628594957896883.

Full text
APA, Harvard, Vancouver, ISO, and other styles
27

Akbari, Mohsen. "Strategies for changing the redundancy of sub-band signals in oversampled filter banks." Thesis, McGill University, 2012. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=107809.

Full text
Abstract:
Communication channels are always vulnerable to noise sources. Thereby, any kind of data transmitted over these channels suffer from errors that happen during transmission which degrades the quality of the signal on the receiver side. To tackle this problem, some amount of redundancy should be added to the input signal so on the receiver side, this redundancy could be exploited to remove the errors. However, most of the existing schemes for adding redundancy to the signal have two main drawbacks. First, they are designed to work decently as long as the channel quality is always above a certain threshold. But when the channel quality falls under that threshold, the system tends to break down completely and is no longer capable of correcting the errors (threshold effect). Second, most of the current error correction schemes lack the inherent adaptability and flexibility for changing the added redundancy which is necessary due to the unavoidable change in channel characteristics.In this thesis, we will explore the methods of signal representation that are naturally amenable to transmission at flexible rates and offer graceful degradation in signal quality with degrading link quality. For such applications, we will consider the insertion of soft, structured redundancy in signals to be transmitted, through the use of Oversampled Filter Banks (OFBs). These codes enable a joint compression and protection of signals through the application of a redundant transform (or frame operator) to the signal, which serves both for signal conditioning for compression and for insertion of redundancy in the signal so as to be able to combat adverse channel effects. More specifically, in this thesis, we extend the framework of redundant expansions to the case where the amount of injected redundancy can be adjusted on the fly. This will be accomplished through two main approaches. The first method is called Adaptive Downsampling. Here, the idea is to change the downsampling rate of the OFB as a response to the changes in channel quality. We investigate the effect of such downsampling variation on filtering the input signal vectors on analysis side and propose suitable signal reconstruction method on the synthesis side of the OFB. In the second method, we introduce the notion of Instantaneous Erasures in OFBs which accounts for a situation when samples of sub-band vectors are erased arbitrarily in different time instances. We find the conditions under which the OFB maintains its perfect reconstruction property using time-domain analysis and we propose structures in order to be able to design implementable OFBs.
Les canaux de communications sont vulnérables aux sources de bruit. De ce fait, n'importe quelle donnée transmise sur ces canaux peut être victime d'erreurs survenant lors de la transmission, dégradant ainsi la qualité du signal à la réception. Afin de résoudre ce problème, une certaine redondance doit être apportée au signal d'entrée pour qu'à la réception elle aide à corriger les erreurs. Cependant, la plupart des schémas ajoutant de la redondance aux signaux ont deux défauts majeurs. Premièrement, ces schémas sont conçus pour fonctionner décemment aussi longtemps que la qualité du canal reste au dessus d'un certain seuil. Mais dés que la qualité du canal tombe en dessous de ce seuil, le système est complètement perturbé et n'est plus capable de corriger les erreurs (effet de seuil). Deuxièmement, la plupart des schémas de correction d'erreurs courantes manquent d'adaptabilité et de flexibilité propres pour modifier la redondance ajoutée, ce qui est nécessaire au vue des changements inévitables des caractéristiques du canal. Dans cette thèse, nous explorons les méthodes de représentation du signal qui se prêtent naturellement à la transmission à des taux flexibles et qui offrent une dégradation graduelle (graceful degradation) en termes de qualité de signal par rapport à la détérioration du canal. Pour de telles applications, nous considérons l'insertion d'une redondance de type soft et structurée dans les signaux à transmettre en utilisant les bancs de filtres sur-échantillonnés (Oversampled Filter Bank : OFB). Ces codes offrent à la fois une compression et une protection des signaux grâce à l'application d'une transformation redondante (ou opérateur de frame) au signal, ce qui sert au prétraitement des signaux pour la compression et pour l'insertion de redondance dans le signal, permettant ainsi de contrer les effets indésirables du canal. Plus précisément, dans cette thèse, nous approfondissons le domaine des expansions redondantes de signal au cas où la quantité de redondance injectée peut être ajustée à la volée. Deux approches principales permettront cette entreprise. La première méthode est appelée sous-échantillonnage adaptatif. L'idée est de changer le taux de sous-échantillonnage de l'OFB en réponse aux variations de la qualité du canal. Nous étudions l'effet d'un tel sous-échantillonnage sur le filtrage des vecteurs du signal d'entrée du coté analyse et nous proposons une méthode de reconstruction du signal appropriée du coté synthèse de l'OFB. Pour la deuxième méthode, nous introduisons la notion d'effacement instantané dans les OFB, qui correspond au cas où les échantillons des vecteurs sous-bande sont effacés avec une distribution arbitraire à différents moments. Nous trouvons les conditions pour lesquelles l'OFB maintient sa propriété de reconstruction parfaite en utilisant une analyse temporelle et nous proposons des structures afin de permettre la conception d'OFB implémentables.
APA, Harvard, Vancouver, ISO, and other styles
28

Hines, J. Wesley. "A hybrid approach to fault detection and isolation merging analytical redundancy and neural network techniques /." The Ohio State University, 1994. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487859313348358.

Full text
APA, Harvard, Vancouver, ISO, and other styles
29

Özenir, Onur. "Redundancy techniques for 5G Ultra Reliable Low Latency Communications." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2022. http://amslaurea.unibo.it/25082/.

Full text
Abstract:
The 5G Core Network architecture is modeled to include instruments that can establish networks built on the same physical infrastructure but serve different service categories for communication types with varying characteristics. Relying on virtualization and cloud technologies, these instruments make the 5G system different from previous mobile communication systems, change the user profile, and allow new business models to be included in the system. The subject of this thesis includes the study of Ultra-reliable low latency communication, which is one of the fundamental service categories defined for the 5G system, and the analysis of the techniques presented in 3GPP’s Release 16, which enhance the service parameters by modifying the core network. In the theoretical part, the 5G system and URLLC are introduced with a particular focus on the user plane on the core network. In the implementation part, redundant transmission support on the N3 interface, one of the techniques presented in the technical specification, is modeled using open source software tools (Open5GS and UERANSIM) and network virtualization instruments. As a result of the tests and measurements performed on the model, it was observed that the implemented technique enhanced the system's reliability.
APA, Harvard, Vancouver, ISO, and other styles
30

Marey, Mohammed. "Contributions to control modeling in visual servoing, task redundancy, and joint limits avoidance." Phd thesis, Université Rennes 1, 2010. http://tel.archives-ouvertes.fr/tel-00589521.

Full text
Abstract:
L'asservissement visuel est devenu une approche classique dans le cadre de la commande de robots exploitant les informations fournies par un capteur de vision dans une boucle de com- mande. La recherche décrite dans cette thèse vise à résoudre des problèmes d'asservissement et à améliorer la capacité de gérer plus efficacement les tâches supplémentaires. Cette thèse présente tout d'abord l'état de l'art en asservissement visuel, redondance et évitement des butées articulaires. Elle propose ensuite les contributions suivantes: Un schéma de commande est obtenu en introduisant un paramètre de comportement dans un contrôle hybride. Il permet un meilleur comportement du système lorsque des valeurs appropriées du paramètre sont sélectionnées. Une étude analytique des lois de commandes les plus courantes et de la nouvelle loi proposée est effectuée dans le cas de mouvements de translation et de rotation selon l'axe optique. De nouveaux schémas de commande sont également proposés pour améliorer le comportement du système lorsque la configuration désirée est singulière. Les contributions théoriques concernant le formalisme de la redondance reposent sur l'élabor- ation d'un opérateur de projection obtenu en ne considérant que la norme de la tâche princi- pale. Cela conduit à un problème moins contraint et permet d'élargir le domaine d'application. De nouvelles stratégies d'évitement des butées articulaires du robot fondées sur la redon- dance sont développées. Le problème d'ajouter des tâches secondaires à la tâche principale, tout en assurant l'évitement des butées articulaires, est également résolu. Tous ces travaux ont été validés par des expérimentations dans le cadre d'applications d'asserv- issement visuel.
APA, Harvard, Vancouver, ISO, and other styles
31

Clamon, Travis. "A-Z Database Discovery using Alma: Eliminate Redundancy and Simplify your Workflow." Digital Commons @ East Tennessee State University, 2017. https://dc.etsu.edu/etsu-works/3959.

Full text
Abstract:
Frustrated by having to maintain an A-Z databases list separately on our library website and in Alma/Primo, East Tennessee State University embarked on a goal to eliminate redundancy by using Alma as our primary source of metadata for eResources. This presentation will cover our entire workflow and the issues we encountered along the way. I'll first go over our process in Alma including MARC record creation, electronic collection setup, and the top level collection module. Next, I'll cover our workflow in Primo including normalization rules, scoping, and PNX display. The last section will cover the Alma API's and how they were used to sync our LibGuides A-Z list.
APA, Harvard, Vancouver, ISO, and other styles
32

Jansuwan, Sarawut. "A Quantitative Framework for Assessing Vulnerability and Redundancy of Freight Transportation Networks." DigitalCommons@USU, 2013. https://digitalcommons.usu.edu/etd/2026.

Full text
Abstract:
Freight transportation networks are an important component of everyday life in modern society. Disruption to these networks can make peoples’ daily lives extremely difficult as well as seriously cripple economic productivity. This dissertation develops a quantitative framework for assessing vulnerability and redundancy of freight transportation networks. The framework consists of three major contributions: (1) a two- stage approach for estimating a statewide truck origin-destination (O-D) trip table, (2) a decision support tool for assessing vulnerability of freight transportation networks, and (3) a quantitative approach for measuring redundancy of freight transportation networks.The dissertation first proposes a two-stage approach to estimate a statewide truck O-D trip table. The proposed approach is supported by two sequential stages: the first stage estimates a commodity-based truck O-D trip table using the commodity flows derived from the Freight Analysis Framework (FAF) database, and the second stage uses the path flow estimator (PFE) concept to refine the truck trip table obtained from the first stage using the truck counts from the statewide truck count program. The model allows great flexibility of incorporating data at different spatial levels for estimating the truck O- D trip table. The results from the second stage provide us a better understanding of truck flows on the statewide truck routes and corridors, and allow us to better manage the anticipated impacts caused by network disruptions.A decision support tool is developed to facilitate the decision making system through the application of its database management capabilities, graphical user interface, GIS-based visualization, and transportation network vulnerability analysis. The vulnerability assessment focuses on evaluating the statewide truck-freight bottlenecks/chokepoints. This dissertation proposes two quantitative measures: O-D connectivity (or detour route) in terms of distance and freight flow pattern change in terms of vehicle miles traveled (VMT). The case study adopts a “what-if” analysis approach by generating the disruption scenarios of the structurally deficient bridges in Utah due to earthquakes. In addition, the potential impacts of disruptions to multiple bridges in both rural and urban areas are evaluated and compared to the single bridge failure scenarios.This dissertation also proposes an approach to measure the redundancy of freight transportation networks based on two main dimensions: route diversity and network spare capacity. The route diversity dimension is used to evaluate the existence of multiple efficient routes available for users or the degree of connections between a specific O-D pair. The network spare capacity dimension is used to quantify the network- wide spare capacity with an explicit consideration of congestion effect. These two dimensions can complement each other by providing a two-dimensional characterization of freight transportation network redundancy. Case studies of the Utah statewide transportation network and coal multimodal network are conducted to demonstrate the features of the vulnerability and redundancy measures and the applicability of the quantitative assessment methodology.
APA, Harvard, Vancouver, ISO, and other styles
33

Johnson, Jonathan Mark. "Synchronization Voter Insertion Algorithms for FPGA Designs Using Triple Modular Redundancy." Diss., CLICK HERE for online access, 2010. http://contentdm.lib.byu.edu/ETD/image/etd3418.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
34

Binneman, Francois J. A. "Network reliability as a result of redundant connectivity." Thesis, Link to the online version, 2007. http://hdl.handle.net/10019/368.

Full text
APA, Harvard, Vancouver, ISO, and other styles
35

Chang, Sanghoan. "Empirical timing analysis of CPUs and delay fault tolerant design using partial redundancy." [College Station, Tex. : Texas A&M University, 2007. http://hdl.handle.net/1969.1/ETD-TAMU-1270.

Full text
APA, Harvard, Vancouver, ISO, and other styles
36

Majewicz, Peter J. "Implementation of a Configurable Fault Tolerant Processor (CFTP) using Internal Triple Modular Redundancy (TMR)." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2005. http://library.nps.navy.mil/uhtbin/hyperion/05Dec%5FMajewicz.pdf.

Full text
Abstract:
Thesis (M.S. in Electrical Engineering)--Naval Postgraduate School, December 2005.
Thesis Advisor(s): Herschel H Loomis, Jr., Alan A. Ross. Includes bibliographical references (p. 85). Also available online.
APA, Harvard, Vancouver, ISO, and other styles
37

Kindle, Jacob, and Travis Clamon. "Eliminating Data Redundancy: Our Solution for Database Discovery using Alma/Primo." Digital Commons @ East Tennessee State University, 2016. https://dc.etsu.edu/etsu-works/3958.

Full text
Abstract:
East Tennessee State University recently adopted Alma & Primo and was suprised by the lack of an A-Z database discovery module. Frustrated by having to maintain electronic resources separately on our library website and in Alma, we embarked on a goal to eliminate redundancy and use Alma/Primo exclusively. This presentation will cover our entire workflow in both Alma & Primo and the issues we encountered along the way. I'll first go over our process in Alma including MARC record creation, electronic collection setup, and the top level collection module. Next, I'll cover our workflow in Primo including normalization rules, scoping, PNX display, facets, and code table changes. The last section will cover the Primo X-Services API and how it was developed into an A-Z Database list.
APA, Harvard, Vancouver, ISO, and other styles
38

Gentilini, Iacopo. "Multi-Goal Path Optimization for Robotic Systems with Redundancy based on the Traveling Salesman Problem with Neighborhoods." Research Showcase @ CMU, 2012. http://repository.cmu.edu/dissertations/154.

Full text
Abstract:
Finding an optimal path for a redundant robotic system to visit a sequence of several goal locations is a complex optimization problem and poses two main technical challenges. Because of the redundancy in the system, the robot can assume an infinite number of goal configurations to reach each goal location. Therefore, not only an optimal sequence of the goals has to be defined, but also, for each goal, an optimal configuration has to be chosen among infinite possibilities. Second, the actual cost for the system to move from one configuration to the next depends on many factors, such as obstacle avoidance or energy consumption, and can be calculated only through the employment of specific path planning techniques. We first address the optimization problem of finding an optimal sequence of optimal configurations, while assuming the cost function to be analytically defined. This problem is modeled as a Traveling Salesman Problem with Neighborhoods (TSPN), which extends the well-known TSP to more general cases where each vertex (goal configuration) is allowed to move in a given region (neighborhood). In the literature, heuristic solution approaches are available for TSPN instances with only circular or spherical neighborhoods. For more general neighborhood topologies, but limited to the Euclidean norm as edge weighting function, approximation algorithms have also been proposed. We present three novel approaches: (1) a global Mixed Integer Non Linear Programming (MINLP) optimizer and (2) a convex MINLP optimizer are modified to solve to optimality TSPN instances with up to 20 convex neighborhoods, and (3) a hybrid random-key Genetic Algorithm (GA) is developed to address more general problems with a larger number of possibly non-convex neighborhoods and with different types of edge weighting functions. Benchmark tests show that the GA is able to find the same optimal tour calculated by the MINLP solvers while drastically reducing the computational cost, and it always improves the best known solutions for available test problems with up to 1,000 neighborhoods. Second, we integrate the GA with a probabilistic path planning technique to apply the proposed procedure to two practical applications. We minimize the time currently required by an industrial vision inspection system to complete a multi-goal cycle, where the neighborhoods are defined using piecewise cubic splines in a seven-dimensional configuration space. Afterwards, we optimize the flight path and the energy consumption of a quadrotor Unmanned Aerial Vehicle (UAV) on an urban survey mission. The specifications of the camera installed on the UAV are used here to define the neighborhoods as three-dimensional polyhedra.
APA, Harvard, Vancouver, ISO, and other styles
39

Persson, Erik. "Omdesign av Intranät : vid Svenska Kyrkan i Norrköping." Thesis, Mittuniversitetet, Avdelningen för informationssystem och -teknologi, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-31958.

Full text
Abstract:
Svenska Kyrkan i Norrköping upplever idag att de har ett virtuellt intranät som skulle kunna fungera bättre. Problematiken tycker de ligger i underliga trafikflöden, utarmning av IP-adresser och hög komplexitet. Därtill undrar de om det inte är hög tid att höja bandbredden ut från flera av byggnaderna. Min målsättning med arbetet är att utifrån de största församlingarna samt Kyrkans Hus – där organisationens IT-kontor och serverfarm är belägna – kunna ge rekommendationer på åtgärder och förändringar som ska kunna avhjälpa denna problematik och förhoppningsvis framtidssäkra några av dessa aspekter. Under mitt arbete har jag tagit ut rudimentära baselinemätningar, IP-adresseringstabeller och sammanställningar av trafikflöden i syfte att skapa en nulägesanalys. Jag har också ämnat illustrera den problematik som låg till grund för arbetets utformning. I min rapport har jag också behandlat moderna IT-trender såsom tunna klienter, virtualiseringsmiljöer och BYOD, Bring Your Own Device. Detta arbete har resulterat i ett generellt designförslag med redundanslänkar, gästnätverk och stöd för Ipv6 med olika alternativ inom samtliga aspekter, vilka kan användas för att skräddarsy implementeringen av de olika teknologierna. För en mer allomfattande, grundlig och slutgiltig design av intranätet som helhet skulle en mer omfattande dokumentation behövas, tillsammans med uppskattning av nätverksanvändning, IP-adressering samt budgetering.
The Church of Sweden in Norrköping are currently faced with a virtual intranet that they feel could be improved. Some of the problems they have identified are unusual traffic forwardin patterns, exhaustion of the IP adress pool and a high level of complexity. In addition, they feel that it might be time to increase the bandwidth that some of the buildings have access to. My goal with this paper – based on the largest parishes and Kyrkan Hus, where the organization’s IT office and server farm lies – is to give recommendations in terms of actions and changes that could mitigate these issues and hopefully provide a more future proof solution. During my work I have taken some rudimentary baseline readings, IP addressing tables and compilations of network flows, in order to create a current situation analysis, which I have used to draw some of my conclusions. I have also aimed to illustrate the problems that have formed the foundation for this work. In my report I have also discussed some modern IT trends, such as thin clients, virtual environments and BYOD, Bring Your Own Device. This assignment has resulted in a general design proposal with redundant links, guest networks and Ipv6 support, with different alternatives withing each aspect, which can be used to further tailor the implementations of the different technologies. For a more all encompassing, thorough design of the intranet as a whole we’d need a more complete documentation, together with approximations and evaluations regarding network usage, IP addressing and budget.
APA, Harvard, Vancouver, ISO, and other styles
40

Croswell, Joseph Adam 1977. "A model for analysis of the effects of redundancy and error correction on DRAM memory yield and reliability." Thesis, Massachusetts Institute of Technology, 2000. http://hdl.handle.net/1721.1/32094.

Full text
Abstract:
Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2000.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Includes bibliographical references (leaf 57).
Manufacturing a DRAM module that is error free is a very difficult process. This process is becoming more difficult when only utilizing the current methods for producing an error free DRAM. Error correction codes (ECCs) and cell replacement are two methods currently used in isolation of each other in order to solve two of the problems with this manufacturing process: increasing reliability and increasing yield, respectively. Possible solutions to this problem are proposed and evaluated qualitatively in discussion. Also, a simulation model is produced in order to simulate the impacts of various strategies in order to evaluate their effectiveness.
by Joseph Adam Croswell.
M.Eng.
APA, Harvard, Vancouver, ISO, and other styles
41

Li, Siyan. "Motion planning and animation of a hyper-redundant planar manipulator." Ohio : Ohio University, 1994. http://www.ohiolink.edu/etd/view.cgi?ohiou1178132146.

Full text
APA, Harvard, Vancouver, ISO, and other styles
42

Bilagi, Vedanth. "Experimental Study Of Fault Cones And Fault Aliasing." PDXScholar, 2012. https://pdxscholar.library.pdx.edu/open_access_etds/64.

Full text
Abstract:
The test of digital integrated circuits compares the test pattern results for the device under test (DUT) to the expected test pattern results of a standard reference. The standard response is typically obtained from simulations. The test pattern and response are created and evaluated assuming ideal test conditions. The standard response is normally stored within automated test equipment (ATE). However the use of ATE is the major contributor to the test cost. This thesis explores an alternative strategy to the standard response. As an alternative to the stored standard response, the response is estimated by fault tolerant technique. The purpose of the fault tolerant technique is to eliminate the need of standard response and enable online/real-time testing. Fault tolerant techniques use redundancy and majority voting to estimate the standard response. Redundancy in the circuit leads to fault aliasing. Fault aliasing misleads the majority voter in estimating the standard response. The statistics and phenomenon of aliasing are analyzed for benchmark circuits. The impact of fault aliasing on test with respect to coverage, test escape and over-kill is analyzed. The results show that aliasing can be detected with additional test vectors and get 100% fault coverage.
APA, Harvard, Vancouver, ISO, and other styles
43

Stolarik, Brian M. "A neural network-based sensor validation scheme within aircraft control laws." Morgantown, W. Va. : [West Virginia University Libraries], 2001. http://etd.wvu.edu/templates/showETD.cfm?recnum=2147.

Full text
Abstract:
Thesis (M.S.)--West Virginia University, 2001.
Title from document title page. Document formatted into pages; contains xiii, 117 p. : ill. (some col.). Vita. Includes abstract. Includes bibliographical references (p. 95-96).
APA, Harvard, Vancouver, ISO, and other styles
44

Sardari, Mohsen. "Network compression via network memory: realization principles and coding algorithms." Diss., Georgia Institute of Technology, 2013. http://hdl.handle.net/1853/50329.

Full text
Abstract:
The objective of this dissertation is to investigate both the theoretical and practical aspects of redundancy elimination methods in data networks. Redundancy elimination provides a powerful technique to improve the efficiency of network links in the face of redundant data. In this work, the concept of network compression is introduced to address the redundancy elimination problem. Network compression aspires to exploit the statistical correlation in data to better suppress redundancy. In a nutshell, network compression enables memorization of data packets in some nodes in the network. These nodes can learn the statistics of the information source generating the packets which can then be used toward reducing the length of codewords describing the packets emitted by the source. Memory elements facilitate the compression of individual packets using the side-information obtained from memorized data which is called ``memory-assisted compression''. Network compression improves upon de-duplication methods that only remove duplicate strings from flows. The first part of the work includes the design and analysis of practical algorithms for memory-assisted compression. These algorithms are designed based on the theoretical foundation proposed in our group by Beirami et al. The performance of these algorithms are compared to the existing compression techniques when the algorithms are tested on the real Internet traffic traces. Then, novel clustering techniques are proposed which can identify various information sources and apply the compression accordingly. This approach results in superior performance for memory-assisted compression when the input data comprises sequences generated by various and unrelated information sources. In the second part of the work the application of memory-assisted compression in wired networks is investigated. In particular, networks with random and power-law graphs are studied. Memory-assisted compression is applied in these graphs and the routing problem for compressed flows is addressed. Furthermore, the network-wide gain of the memorization is defined and its scaling behavior versus the number of memory nodes is characterized. In particular, through our analysis on these graphs, we show that non-vanishing network-wide gain of memorization is obtained even when the number of memory units is a tiny fraction of the total number of nodes in the network. In the third part of the work the application of memory-assisted compression in wireless networks is studied. For wireless networks, a novel network compression approach via memory-enabled helpers is proposed. Helpers provide side-information that is obtained via overhearing. The performance of network compression in wireless networks is characterized and the following benefits are demonstrated: offloading the wireless gateway, increasing the maximum number of mobile nodes served by the gateway, reducing the average packet delay, and improving the overall throughput in the network. Furthermore, the effect of wireless channel loss on the performance of the network compression scheme is studied. Finally, the performance of memory-assisted compression working in tandem with de-duplication is investigated and simulation results on real data traces from wireless users are provided.
APA, Harvard, Vancouver, ISO, and other styles
45

Seddigh, Sorosh. "Link QualityControl (LQC) i GPRS/EGPRS." Thesis, Linköping University, Department of Electrical Engineering, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-1761.

Full text
Abstract:

This master thesis has been done at Enea Epact AB. The purpose of this thesis is to develop and implement a Link Quality Control algorithm for GPRS/EPGRS in the current testing tool. A Link Quality Control (LQC) shall take quality values from mobile stations and base stations and decide a codingsscheme that opimizes the throughput of data.

The Advantage with LQC is that it adapts the used coding scheme to the channel quality. If the channel quality is too bad for the used coding scheme, a slower coding scheme with more redundancy should be selected. On the other hand, if the channel quality is too good for the used coding scheme, LQC should recommend a faster coding scheme with less redundancy.

The testing tool is now using a static coding schme that doesn’t change during a data session. An LQC is therefore necessary for better simulation of the traffic and to make the tests more real.

APA, Harvard, Vancouver, ISO, and other styles
46

Wang, Yu-Cheng. "Dual 7-Degree-of-Freedom Robotic Arm Remote Teleoperation Using Haptic Devices." Scholar Commons, 2015. http://scholarcommons.usf.edu/etd/5793.

Full text
Abstract:
A teleoperated system of dual redundant manipulator will be controlled in this thesis. The robot used with the dual redundant manipulator in this thesis is Baxter. Baxter’s redundant robot arms are 7-degree-of-freedom arms. The problem that will be solved in this thesis is optimization of the 7-degree-of-freedom robot arms. The control algorithm of the 7-degree-of-freedom robot arms will be discussed and built. A simulation program will be built to test the control algorithm. Based on the control algorithm, a teleoperation system will be created for Baxter. The controller used is Omni, which is a six-joint haptic device. Omni will also be used to give force feedback upon collision while the user is controlling the robot. Hence, a collision force feedback system is going to be created and combined with the teleoperation system. The teleoperation system will be tested in common daily applications.
APA, Harvard, Vancouver, ISO, and other styles
47

Swift, James D. "Root Cause Analysis and Classification of Single Point Failures in Designs Applying Triple Modular Redundancy in SRAM FPGAs." BYU ScholarsArchive, 2020. https://scholarsarchive.byu.edu/etd/8744.

Full text
Abstract:
Radiation effects encountered in space or aviation environments can affect the configuration bits in Field Programmable Gate Arrays (FPGA) causing errors in FPGA output. One method of increasing FPGA reliability in radiation environments includes adding redundant logic to mask errors and allow time for repair. Despite the redundancy added with triple modular redundancy (TMR) and configuration scrubbing there exist some configuration bits that individually affect multiple TMR domains causing errors in FPGA output. A new tool called DeBit is introduced that identifies hardware resources associated with a single bit failure. This tool identifies a novel failure mode involving global routing resources and the failure mode is verified through a series of directed tests on global routing resources. Lastly, a mitigation strategy is proposed and tested on a single error in a triple modular redundancy (TMR) design.
APA, Harvard, Vancouver, ISO, and other styles
48

Pratt, Brian Hogan. "Analysis and Mitigation of SEU-induced Noise in FPGA-based DSP Systems." BYU ScholarsArchive, 2011. https://scholarsarchive.byu.edu/etd/2482.

Full text
Abstract:
This dissertation studies the effects of radiation-induced single-event upsets (SEUs) on digital signal processing (DSP) systems designed for field-programmable gate arrays (FPGAs). It presents a novel method for evaluating the effects of radiation on DSP and digital communication systems. By using an application-specific measurement of performance in the presence of SEUs, this dissertation demonstrates that only 5-15% of SEUs affecting a communications receiver (i.e. 5-15% of sensitive SEUs) cause critical performance loss. It also reports that the most critical SEUs are those that affect the clock, global reset, and most significant bits (MSBs) of computation. This dissertation also demonstrates reduced-precision redundancy (RPR) as an effective and efficient alternative to the popular triple modular redundancy (TMR) for FPGA-based communications systems. Fault injection experiments show that RPR can improve the failure rate of a communications system by over 20 times over the unmitigated system at a cost less than half that of TMR by focusing on the critical SEUs. This dissertation contrasts the cost and performance of three different variations of RPR, one of which is a novel variation developed here, and concludes that the variation referred to as "Threshold RPR" is superior to the others for FPGA systems. Finally, this dissertation presents several methods for applying Threshold RPR to a system with the goal of reducing mitigation cost and increasing the system performance in the presence of SEUs. Additional fault injection experiments show that optimizing the application of RPR can result in a decrease in critical SEUs by as much 65% at no additional hardware cost.
APA, Harvard, Vancouver, ISO, and other styles
49

Mwanga, Alifas Yeko. "Reliability modelling of complex systems." Thesis, Pretoria : [s.n.], 2006. http://upetd.up.ac.za/thesis/available/etd-12142006-121528.

Full text
APA, Harvard, Vancouver, ISO, and other styles
50

Batsios, Nicholas. "Design and construction of a multi-segment snake-like wheeled vehicle." Ohio : Ohio University, 1997. http://www.ohiolink.edu/etd/view.cgi?ohiou1177610642.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography