• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 866
  • 125
  • 116
  • 106
  • 63
  • 24
  • 24
  • 20
  • 12
  • 9
  • 8
  • 6
  • 5
  • 5
  • 5
  • Tagged with
  • 1758
  • 421
  • 358
  • 295
  • 270
  • 260
  • 254
  • 223
  • 211
  • 192
  • 179
  • 171
  • 128
  • 123
  • 121
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
181

Implementing a Resolve Online Prover Using Z3

Bentley, John January 2021 (has links)
No description available.
182

A Nonlinear Mixture Autoregressive Model For Speaker Verification

Srinivasan, Sundararajan 30 April 2011 (has links)
In this work, we apply a nonlinear mixture autoregressive (MixAR) model to supplant the Gaussian mixture model for speaker verification. MixAR is a statistical model that is a probabilistically weighted combination of components, each of which is an autoregressive filter in addition to a mean. The probabilistic mixing and the datadependent weights are responsible for the nonlinear nature of the model. Our experiments with synthetic as well as real speech data from standard speech corpora show that MixAR model outperforms GMM, especially under unseen noisy conditions. Moreover, MixAR did not require delta features and used 2.5x fewer parameters to achieve comparable or better performance as that of GMM using static as well as delta features. Also, MixAR suffered less from overitting issues than GMM when training data was sparse. However, MixAR performance deteriorated more quickly than that of GMM when evaluation data duration was reduced. This could pose limitations on the required minimum amount of evaluation data when using MixAR model for speaker verification.
183

Specifying, Implementing and Verifying Layered Network Protocols

Cwikla, Joseph J. 02 September 2008 (has links)
No description available.
184

The Binary Decision Diagram: Formal Verification of a Reference Implementation

Rumreich, Laine 04 October 2021 (has links)
No description available.
185

Real Time Drag Minimization

Jacobsen, Marianne January 2006 (has links)
This thesis focuses on the use of multiple redundant control surfaces to increase performance during flight. There is no clear-cut definition of performance. It may differ between applications, but here, the amount of drag for a given flight condition is used. The work is concentrated on minimizing drag with the use of measurements instead of numerical simulations. Measured data contains noise and there are problems with repeatability and hysteresis. These difficulties are considered and a method for drag minimization during flight is presented. In the first study the drag minimization algorithm is discussed. Focus is put on describing the implemented method and the treatment of constraints to the optimization problem. The constraints include keeping the lift constant as well as having bounds on the control surface deflections. In the second work, a more complex wind tunnel model is used to validate the drag optimization algorithm. Drag reduction for different flight conditions is studied, as well as the impact of the number of control surfaces. Different layouts of the control surfaces are also tested. The results show that the constraints are satisfied and that the drag is reduced substantially. / QC 20101116
186

Discrete Function Representations Utilizing Decision Diagrams and Spectral Techniques

Townsend, Whitney Jeanne 03 August 2002 (has links)
All discrete function representations become exponential in size in the worst case. Binary decision diagrams have become a common method of representing discrete functions in computer-aided design applications. For many functions, binary decision diagrams do provide compact representations. This work presents a way to represent large decision diagrams as multiple smaller partial binary decision diagrams. In the Boolean domain, each truth table entry consisting of a Boolean value only provides local information about a function at that point in the Boolean space. Partial binary decision diagrams thus result in the loss of information for a portion of the Boolean space. If the function were represented in the spectral domain however, each integer-valued coefficient would contain some global information about the function. This work also explores spectral representations of discrete functions, including the implementation of a method for transforming circuits from netlist representations directly into spectral decision diagrams.
187

On mesh quality considerations for the discontinuous Galerkin method

Collins, Eric M 08 August 2009 (has links)
It is widely accepted that the accuracy and efficiency of computational fluid dynamics (CFD) simulations is heavily influenced by the quality of the mesh upon which the solution is computed. Unfortunately, the computational tools available for assessing mesh quality remain rather limited. This report describes a methodology for rigorously investigating the interaction between a flow solver and a variety of mesh configurations for the purposes of deducing which mesh properties produce the best results from the solver. The techniques described herein permit a more detailed exploration of what constitutes a quality mesh in the context of a given solver and a desired flow regime. In the present work, these newly developed tools are used to investigate mesh quality as it pertains to a high-order accurate discontinuous Galerkin solver when it is used to compute inviscid and high-Reynolds number flows in domains possessing smoothly curving boundaries. For this purpose, two flow models have been generated and used to conduct parametric studies of mesh configurations involving curved elements. The results of these studies allow us to make some observations regarding mesh quality when the discontinuous Galerkin method is used to solve these types of problems. Briefly, we have found that for inviscid problems, the mesh elements used to resolve curved boundaries should be at least third order accurate. For viscous problems, the domain boundaries must be approximated by mesh elements that are of the same order as the polynomial approximation of the solution if the theoretical order of accuracy of the scheme is to be maintained. Increasing the accuracy of the boundary elements to at least one order higher than the solution approximation typically results in a noticeable improvement in the computed error norms. It is also noted that C1-continuity of the mesh is not required at element interfaces along the boundary.
188

Hardware Emulation of Sequential ATPG-Based Bounded Model Checking

Ford, Gregory Fick 21 February 2014 (has links)
No description available.
189

A Balanced Verification Effort for the Java Language

Zaccai, Diego Sebastian 27 September 2016 (has links)
No description available.
190

Increasing Accuracy in the Confidence Level during Functional Verification of Combinational Logic Circuits

Radhakrishnan, Ramsundar 08 September 2011 (has links)
No description available.

Page generated in 0.1063 seconds