Log in

Relevant bibliographies by topics / Algorithmic Number Generation / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Algorithmic Number Generation.

Dissertations / Theses on the topic 'Algorithmic Number Generation'

Author: Grafiati

Published: 2 June 2025

Last updated: 31 July 2025

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

Select a source type:

Consult the top 26 dissertations / theses for your research on the topic 'Algorithmic Number Generation.'

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

Epstein, Peter Carleton University Dissertation Computer Science. "Generating geometric objects at random." Ottawa, 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Stewart, Robert Grisham. "A Statistical Evaluation of Algorithms for Independently Seeding Pseudo-Random Number Generators of Type Multiplicative Congruential (Lehmer-Class)." Digital Commons @ East Tennessee State University, 2007. https://dc.etsu.edu/etd/2049.

Full text

Abstract:

To be effective, a linear congruential random number generator (LCG) should produce values that are (a) uniformly distributed on the unit interval (0,1) excluding endpoints and (b) substantially free of serial correlation. It has been found that many statistical methods produce inflated Type I error rates for correlated observations. Theoretically, independently seeding an LCG under the following conditions attenuates serial correlation: (a) simple random sampling of seeds, (b) non-replicate streams, (c) non-overlapping streams, and (d) non-adjoining streams. Accordingly, 4 algorithms (each sa

APA, Harvard, Vancouver, ISO, and other styles

3

Mor, Stefano Drimon Kurz. "Analysis of synchronizations in greedy-scheduled executions and applications to efficient generation of pseudorandom numbers in parallel." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2015. http://hdl.handle.net/10183/130529.

Full text

Abstract:

Nous présentons deux contributions dans le domaine de la programmation parallèle. La première est théorique : nous introduisons l’analyse SIPS, une approche nouvelle pour dénombrer le nombre d’opérations de synchronisation durant l’exécution d’un algorithme parallèle ordonnancé par vol de travail. Basée sur le concept d’horloges logiques, elle nous permet : d’une part de donner de nouvelles majorations de coût en moyenne; d’autre part de concevoir des programmes parallèles plus efficaces par adaptation dynamique de la granularité. La seconde contribution est pragmatique : nous présentons une p

APA, Harvard, Vancouver, ISO, and other styles

4

Hauser, Michael A., and Wolfgang Hörmann. "The Generation of Stationary Gaussian Time Series." Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business, 1997. http://epub.wu.ac.at/1630/1/document.pdf.

Full text

Abstract:

Three different algorithms for the generation of stationary Gaussian time series with given autocorrelation function are presented in this paper. The algorithms have already been suggested in the literature but are not well known and have never been compared before. Interrelations between the different methods, advantages and disadvantages with respect to speed and memory requirements and the range of autocorrelation functions for which the different methods are stable are discussed. The time-complexity of the algorithms and the comparisons of their implementations show that the method twice u

APA, Harvard, Vancouver, ISO, and other styles

5

Greiner, Johannes N. [Verfasser], and Jörg [Akademischer Betreuer] Wrachtrup. "Algorithms and resources for quantum technology, sensing and random number generation / Johannes N. Greiner ; Betreuer: Jörg Wrachtrup." Stuttgart : Universitätsbibliothek der Universität Stuttgart, 2020. http://d-nb.info/1233681265/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Andersson, Anton. "On Generating Complex Numbers for FFT and NCO Using the CORDIC Algorithm." Thesis, Linköping University, Department of Electrical Engineering, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-15556.

Full text

Abstract:

<p>This report has been compiled to document the thesis work carried out by Anton Andersson for Coresonic AB. The task was to develop an accelerator that could generate complex numbers suitable for fast fourier transforms (FFT) and tuning the phase of complex signals (NCO). Of many ways to achieve this, the CORDIC algorithm was chosen. It is very well suited since the basic implementation allows rotation of 2D-vectors using only shift and add operations. Error bounds and proof of convergence are derived carefully The accelerator was implemented in VHDL in such a way that all critical parameter

APA, Harvard, Vancouver, ISO, and other styles

7

Hörmann, Wolfgang, and Josef Leydold. "Continuous Random Variate Generation by Fast Numerical Inversion." Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business, 2002. http://epub.wu.ac.at/664/1/document.pdf.

Full text

Abstract:

The inversion method for generating non-uniform random variates has some advantages compared to other generation methods, since it monotonically transforms uniform random numbers into non-uniform random variates. Hence it is the method of choice in the simulation literature. However, except for some simple cases where the inverse of the cumulative distribution function is a simple function we need numerical methods. Often inversion by ``brute force" is used, applying either very slow iterative methods or linear interpolation of the CDF and huge tables. But then the user has to accept unnecessa

APA, Harvard, Vancouver, ISO, and other styles

8

Leydold, Josef, and Wolfgang Hörmann. "Universal Algorithms as an Alternative for Generating Non-Uniform Continuous Random Variates." Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business, 2000. http://epub.wu.ac.at/844/1/document.pdf.

Full text

Abstract:

This paper presents an overview of the most powerful universal methods. These are based on acceptance/rejection techniques where hat and squeezes are constructed automatically. Although originally motivated to sample from non-standard distributions these methods have advantages that make them attractive even for sampling from standard distributions and thus are an alternative to special generators tailored for particular distributions. Most important are: the marginal generation time is fast and does not depend on the distribution. They can be used for variance reduction techniques, and they p

APA, Harvard, Vancouver, ISO, and other styles

9

Hörmann, Wolfgang, and Josef Leydold. "Automatic Random Variate Generation for Simulation Input." Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business, 2000. http://epub.wu.ac.at/534/1/document.pdf.

Full text

Abstract:

We develop and evaluate algorithms for generating random variates for simulation input. One group called automatic, or black-box algorithms can be used to sample from distributions with known density. They are based on the rejection principle. The hat function is generated automatically in a setup step using the idea of transformed density rejection. There the density is transformed into a concave function and the minimum of several tangents is used to construct the hat function. The resulting algorithms are not too complicated and are quite fast. The principle is also applicable to random vec

APA, Harvard, Vancouver, ISO, and other styles

10

Xu, Jinzhong. "Stream Cipher Analysis Based on FCSRs." UKnowledge, 2000. http://uknowledge.uky.edu/gradschool_diss/320.

Full text

Abstract:

Cryptosystems are used to provide security in communications and data transmissions. Stream ciphers are private key systems that are often used to transform large volumn data. In order to have security, key streams used in stream ciphers must be fully analyzed so that they do not contain specific patterns, statistical infomation and structures with which attackers are able to quickly recover the entire key streams and then break down the systems. Based on different schemes to generate sequences and different ways to represent them, there are a variety of stream cipher analyses. The most import

APA, Harvard, Vancouver, ISO, and other styles

11

Barajas, Leandro G. "Process Control in High-Noise Environments Using A Limited Number Of Measurements." Diss., Georgia Institute of Technology, 2003. http://hdl.handle.net/1853/7741.

Full text

Abstract:

The topic of this dissertation is the derivation, development, and evaluation of novel hybrid algorithms for process control that use a limited number of measurements and that are suitable to operate in the presence of large amounts of process noise. As an initial step, affine and neural network statistical process models are developed in order to simulate the steady-state system behavior. Such models are vitally important in the evaluation, testing, and improvement of all other process controllers referred to in this work. Afterwards, fuzzy logic controller rules are assimilated into a mathe

APA, Harvard, Vancouver, ISO, and other styles

12

Tolunay, John. "Parallel gaming related algorithms for an embedded media processor." Thesis, Linköpings universitet, Informationskodning, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-86154.

Full text

Abstract:

A new type of computing architecture called ePUMA is under development by the ePUMA Research Team at the Department of Electrical Engineering at Linköping University in Linköping. This contains several single instruction multiple data (SIMD) cores, which are called SIMD Units, where up to 64 computations can be done in parallel. The goal with the architecture is to create a low-power chip with good performance for embedded applications. One possible application is video games. In this work we have studied a selected set of video game related algorithms, including a Pseudo-Random Number Generat

APA, Harvard, Vancouver, ISO, and other styles

13

Hörmann, Wolfgang, and Gerhard Derflinger. "Rejection-Inversion to Generate Variates from Monotone Discrete Distributions." Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business, 1996. http://epub.wu.ac.at/1176/1/document.pdf.

Full text

Abstract:

For discrete distributions a variant of rejection from a continuous hat function is presented. The main advantage of the new method, called rejection-inversion, is that no extra uniform random number to decide between acceptance and rejection is required which means that the expected number of uniform variates required is halved. Using rejection-inversion and a squeeze, a simple universal method for a large class of monotone discrete distributions is developed. It can be used to generate variates from the tails of most standard discrete distributions. Rejection-inversion applied to the Zipf (o

APA, Harvard, Vancouver, ISO, and other styles

14

Leydold, Josef, Erich Janka, and Wolfgang Hörmann. "Variants of Transformed Density Rejection and Correlation Induction." Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business, 2001. http://epub.wu.ac.at/1554/1/document.pdf.

Full text

Abstract:

In this paper we present some variants of transformed density rejection (TDR) that provide more flexibility (including the possibility to halve the expected number of uniform random numbers) at the expense of slightly higher memory requirements. Using a synchronized first stream of uniform variates and a second auxiliary stream (as suggested by Schmeiser and Kachitvichyanukul (1990)) TDR is well suited for correlation induction. Thus high positive and negative correlation between two streams of random variates with same or different distributions can be induced. The software can be downloaded

APA, Harvard, Vancouver, ISO, and other styles

15

Vychodil, Petr. "Softwarová podpora výuky kryptosystémů založených na problému faktorizace velkých čísel." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2009. http://www.nusl.cz/ntk/nusl-218146.

Full text

Abstract:

This thesis deals with new teaching software, which supports asymmetric encryption algorithms based on the issue of large numbers´ factorization. A model program was created. It allows to carry out operations related to encryption and decryption with an interactive control. There is a simple way to understand the principle of the RSA encryption method with its help. The encryption of algorithms is generally analysed in chapters 1,2. Chapters 3 and 4 deals with RSA encryption algorithm in much more details, and it also describes the principles of the acquisition, management and usage of encrypt

APA, Harvard, Vancouver, ISO, and other styles

16

Salviano, Leandro Oliveira. "Optimization of vortex generators positions and angles in fin-tube compact heat exchanger at low Reynolds number." Universidade de São Paulo, 2014. http://www.teses.usp.br/teses/disponiveis/3/3150/tde-26122014-120408/.

Full text

Abstract:

In the last few decades, augmentation of heat transfer has emerged as an important research topic. Although many promising heat transfer enhancement techniques have been proposed, such as the use of longitudinal vortex generators, few researches deal with thermal optimization. In the present work, it was conducted an optimization of delta winglet vortex generators position and angles in a fin-tube compact heat exchanger with two rows of tubes in staggered tube arrangement. Two approaches were evaluated: Response Surface Methodology (Neural Networking) and Direct Optimization. Finite-Volume bas

APA, Harvard, Vancouver, ISO, and other styles

17

Pospíšilík, Šimon. "Optimalizace návrhových parametrů bezpečnostního přelivu." Master's thesis, Vysoké učení technické v Brně. Fakulta stavební, 2019. http://www.nusl.cz/ntk/nusl-391881.

Full text

Abstract:

The diploma thesis is focused on the program development. The program is aimed at finding optimal design parameters for a two-pole emergency spillway. These parameters are the lengths of the spillway edges and their relative height arrangement. The program is based on the flood wave transformation simulation. Multi – gradient algorithm was used for optimization design parameters of a two-pole safety spillway.

APA, Harvard, Vancouver, ISO, and other styles

18

Julis, Guenaëlle de. "Analyse d'accumulateurs d'entropie pour les générateurs aléatoires cryptographiques." Thesis, Grenoble, 2014. http://www.theses.fr/2014GRENM075.

Full text

Abstract:

En cryptographie, l'utilisation de nombres aléatoires est fréquente (graine, token, ...) et une mauvaise génération d'aléa peut compromettre toute la sécurité d'un protocole, comme en témoigne régulièrement l'actualité. Les générateurs de nombres aléatoires à usage cryptographique sont des composants formés de trois modules : la source brute qui produit de l'aléa (un algorithme ou un phénomène physique), un retraitement pour corriger les défauts de la source, et un retraitement cryptographique pour obtenir l'aléa final. Cette thèse se focalise sur l'analyse des générateurs issus d'une source p

APA, Harvard, Vancouver, ISO, and other styles

19

Mazzotti, Bruno Franciscon. "Co-projeto de hardware/software do filtro de partículas para localização em tempo real de robôs móveis." Universidade de São Paulo, 2010. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-14052010-164204/.

Full text

Abstract:

Sofisticadas técnicas para estimação de modelos baseadas em simulação, os filtros de partículas ou métodos de Monte Carlo Seqüenciais, foram empregadas recentemente para solucionar diversos problemas difícieis no campo da robótica móvel. No entanto, o sucesso dos fitros de partículas limitou-se à computação de parâmetros em espaços de baixa dimensionalidade. Os atuais esforços de pesquisa em robótica móvel têm comecado a explorar certas propriedades estruturais de seus domnios de aplicação que envolvem a utilização de filtros de partculas em espacos de maior dimensão, aumentando consideravelme

APA, Harvard, Vancouver, ISO, and other styles

20

Škrabal, Ondřej. "Genetické algoritmy a rozvrhování." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2010. http://www.nusl.cz/ntk/nusl-229180.

Full text

Abstract:

This work deals with scheduling problem in particular plastic production service. The solution is based on heuristic algorithms, programming languages C + +, C # and is built on the .NET framework and LINQ to XML. It provides the users with comparisons of the heuristic approach with genetic algorithms applied to production problem. All methods results are compared in relation to hand-arranged plans.

APA, Harvard, Vancouver, ISO, and other styles

21

Spa, Carvajal Carlos. "Time-domain numerical methods in room acoustics simulations." Doctoral thesis, Universitat Pompeu Fabra, 2009. http://hdl.handle.net/10803/7565.

Full text

Abstract:

L'acústica de sales s'encarrega de l'estudi del comportament de les ones sonores en espais tancats.La informació acústica de qualsevol entorn, coneguda com la resposta impulsional, pot ser expressada en termes del camp acústic com una funció de l'espai i el temps. En general, és impossible obtenir solucions analítiques de funcions resposta en habitacions reals. Per tant, en aquests últims anys, l'ús d'ordinadors per resoldre aquest tipus de problemes ha emergit com una solució adecuada per calcular respostes impulsionals.<br/>En aquesta Tesi hem centrat el nostre anàlisis en els mètodes basat

APA, Harvard, Vancouver, ISO, and other styles

22

MIJARES, CHAN JOSE JUAN. "True random number generation using genetic algorithms on high performance architectures." 2016. http://hdl.handle.net/1993/31619.

Full text

Abstract:

Many real-world applications use random numbers generated by pseudo-random number and true random number generators (TRNG). Unlike pseudo-random number generators which rely on an input seed to generate random numbers, a TRNG relies on a non-deterministic source to generate aperiodic random numbers. In this research, we develop a novel and generic software-based TRNG using a random source extracted from compute architectures of today. We show that the non-deterministic events such as race conditions between compute threads follow a near Gamma distribution, independent of the architecture, mult

APA, Harvard, Vancouver, ISO, and other styles

23

Bird, William Herbert. "Graph Distinguishability and the Generation of Non-Isomorphic Labellings." Thesis, 2013. http://hdl.handle.net/1828/4839.

Full text

Abstract:

A distinguishing colouring of a graph G is a labelling of the vertices of G with colours such that no non-trivial automorphism of G preserves all colours. The distinguishing number of G is the minimum number of colours in a distinguishing colouring. This thesis presents a survey of the history of distinguishing colouring problems and proves new bounds and computational results about distinguishability. An algorithm to generate all labellings of a graph up to isomorphism is presented and compared to a previously published algorithm. The new algorithm is shown to have performance competitive wi

APA, Harvard, Vancouver, ISO, and other styles

24

Kao, Yung-Sheng, and 高泳生. "Algorithm and Design of Threshold Table Minimization for Random Number Generator." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/3wjr73.

Full text

Abstract:

碩士<br>國立彰化師範大學<br>電子工程學系<br>102<br>Look-up table is used to search data or enhance the speed of function evaluation. In this thesis the random number generator with a minimum table adopts the concept which is similar to traditional Ziggurat algorithm. Calculating the probability density functions(PDF) and storing the parameters in the tables makes the random numbers produced by computing the parameters stored in the tables fitting the distribution of PDF. Comparing the traditional tables, the proposed PDF table minimization algorithm has the advantage of fewer stored data and lower area ove

APA, Harvard, Vancouver, ISO, and other styles

25

Chen, Chun-Yu, and 陳俊宇. "Algorithm of generating chord in numbered musical notation." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/b4jss8.

Full text

Abstract:

碩士<br>景文科技大學<br>視覺傳達設計系數位文創設計碩士在職專班<br>102<br>Simplified music notation is nowadays most highly used in writting music notation due to its easy way of numeral written. However,chord applying is mainly involved in the progress of music composing to an orchestra,compares with simplified music notation to a singular musical performance. Therefore,chord harmonization and connection to a melody is the most considered once working on a sheets music. Usually chord is made up upon or above 3 pitch music notes refers to different varity by the theory,and it really comfused to a music beginer when com

APA, Harvard, Vancouver, ISO, and other styles

26

Tsai, Yun-Feng, and 蔡勻豐. "Security Analysis and a Fast Algorithm for the Implementation of Gollmann Cascades Pseudorandom Number Generator." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/74865432684455768754.

Full text

Abstract:

碩士<br>國立雲林科技大學<br>電子與資訊工程研究所<br>93<br>The security of Gollmann Cascades pseudorandom number generator is analyzed in this paper. Additional, an algorithm is proposed to improve the software efficiency for generating keystreams. In the security analysis, Golomb’s three randomness postulates, linear complexity, and profile of linear complexity were utilized to analyze Gollmann Cascades. The degree of randomness by changing the amount of Stage, length of LFSR, and feedback functions is discussed. To attack a pseudorandom number generator is a part of security analysis. Some methods are develo

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!