• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2447
  • 633
  • 299
  • 286
  • 96
  • 68
  • 48
  • 34
  • 34
  • 31
  • 26
  • 26
  • 26
  • 26
  • 26
  • Tagged with
  • 4886
  • 1011
  • 719
  • 570
  • 548
  • 541
  • 534
  • 521
  • 494
  • 411
  • 404
  • 398
  • 390
  • 379
  • 378
  • 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.

Stability, approximation and decomposition in two- and multistage stochastic programming

Kuchler, Christian. January 2009 (has links)
Dissertation--Humboldt-Universität zu Berlin, 2009. / Includes bibliographical references and index.

Contiguity of probability measures associated with continuous time stochastic processes

Akritas, Michael Georgiou. January 1978 (has links)
Thesis--Wisconsin. / Vita. Includes bibliographical references (leaves 142-147).

The design and analysis of discrete systems using orthogonalized random variables

Schweppe, Frederic C., January 1958 (has links)
Thesis (Ph. D.)--University of Wisconsin--Madison, 1958. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaf [109]).

On two problems concerning doubly stochastic matrices

Sinkhorn, Richard Dennis, January 1900 (has links)
Thesis (Ph. D.)--University of Wisconsin--Madison, 1962. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references.

Stochastic and simulation models of maritime intercept operations capabilities

Sato, Hiroyuki. January 2005 (has links) (PDF)
Thesis (M.S. in Operations Research)--Naval Postgraduate School, December 2005. / Thesis Advisor(s): Patricia A. Jacobs, Donald P. Gaver. Includes bibliographical references (p.117-119). Also available online.


Ceekala, Mithun 23 April 2013 (has links)
This thesis presents a new architecture of stochastic Analog-to-Digital converter (ADC). A standard Stochastic ADC uses comparator random offset as the trip point while all the comparators have the same reference voltages. Since the offset of a basic comparator depends on a number of independent random variables, the offset will follow randomly distributed Gaussian function. The input dynamic range of this standard stochastic ADC is ±?. For 90nm technology ? value is around 153mV. A technique is presented that converts overall transfer function of a stochastic ADC i.e. Gaussian distribution into almost uniformly distribution with a wider range. With the proposed technique, an input dynamic range of ± 153mV and ENOB of 4bits of standard stochastic ADC are increased to variable input dynamic range of ±250mV to ±500mV and ENOB of 6bits.

Spectral analysis of two-variate stochastic processes

Meyer-plate, Ingolf Albert 08 1900 (has links)
No description available.

Stochastic Approximation and Its Application in MCMC

Cheng, Yichen 16 December 2013 (has links)
Stochastic approximation has been widely used since first proposed by Herbert Robbins and Sutton Monro in 1951. It is an iterative stochastic method that attempts to find the zeros of functions that cannot be computed directly. In this thesis, we used the technique in several different aspects. It was used in the analysis of large geostatistical data, in the improvement of simulated annealing algorithm also, as well as for NMR protein structure determination. 1. We proposed a resampling based Stochastic approximation method for the analysis of large geostatistical data. The main difficulty that lies in the analysis of geostatistical data is the computation time is extremely long when the sample size becomes large. Our proposed method only use a small portion of the data at each iteration. Each time, we update our estimators based on a randomly selected subset of the data using stochastic approximation. In this way, we use the information from the whole data set while keep the computation time almost irrelevant to the sample size. We proved the consistency of our estimator and showed by simulation study that the computation time is much reduced compared to other existing methods. 2. Simulated Annealing algorithm has been widely used for optimization problems. However, it can not guarantee the global optima to be located unless a logarithmic cooling schedule is used. However, the logarithm rate is so slow that no one can afford such a long cpu time. We proposed a new stochastic optimization algorithm, the so-called simulated stochastic approximation annealing (SAA) algorithm, which is a combination of simulated annealing and the stochastic approximation Monte Carlo (SAMC) algorithm. It is shown that the new algorithm can work with a cooling schedule that decreases much faster than in the logarithmic cooling schedule while guarantee the global optima to be reached when temperature tends to zero. 3. Protein Structure determination is a very important topic in computational biology. It aims to determine different conformations for each protein, which helps to understand biological functions such as protein-protein interactions, protein-DNA interactions and so on. Protein structure determination consists of a series of steps and peak picking is a very important step. It is the prerequisite for all other steps. Manually pick the peaks is very time consuming. To automate this process, several methods have been proposed. However, due to the complexity of NMR spectra, the existing method is hard to distinguish false peaks and true peaks perfectly. The main difficulty lies in identifying true peaks with low intensity and overlapping peaks. We propose to model the spectrum as a mixture of bivariate Gaussian densities and used stochastic approximation Monte Carlo (SAMC) method as the computational approach to solve this problem. Essentially, by putting the peak picking problem into a Bayesian framework, we turned it into a model selection problem. Because Bayesian method will automatically penalize including too much component into the model, our model will distinguish true peaks from noises without pre-process of the data.

Stochastic resonance in nanoscale systems

Saha, Aditya Unknown Date
No description available.

Random sum limit theorems

Belinsky, M. M. (Morton Morris) January 1968 (has links)
No description available.

Page generated in 0.0387 seconds