Results 1  10
of
101
Uniform Random Generation of Decomposable Structures Using FloatingPoint Arithmetic
 THEORETICAL COMPUTER SCIENCE
, 1997
"... The recursive method formalized by Nijenhuis and Wilf [15] and systematized by Flajolet, Van Cutsem and Zimmermann [8], is extended here to floatingpoint arithmetic. The resulting ADZ method enables one to generate decomposable data structures  both labelled or unlabelled  uniformly at random, ..."
Abstract

Cited by 39 (3 self)
 Add to MetaCart
The recursive method formalized by Nijenhuis and Wilf [15] and systematized by Flajolet, Van Cutsem and Zimmermann [8], is extended here to floatingpoint arithmetic. The resulting ADZ method enables one to generate decomposable data structures  both labelled or unlabelled  uniformly at random
Uniform Random Generation of . . .
, 1997
"... The recursive method formalized by Nijenhuis and Wilf [15] and systematized by Flajolet, Van Cutsem and Zimmermann [8], is extended here to floatingpoint arithmetic. The resulting ADZ method enables one to generate decomposable data structures  both labelled or unlabelled  uniformly at random ..."
Abstract
 Add to MetaCart
The recursive method formalized by Nijenhuis and Wilf [15] and systematized by Flajolet, Van Cutsem and Zimmermann [8], is extended here to floatingpoint arithmetic. The resulting ADZ method enables one to generate decomposable data structures  both labelled or unlabelled  uniformly
rvgtest Error Detection in NonUniform Random Variate Generators
, 2010
"... Nonuniform random variate generators are of fundamental importance in MonteCarlo methods and stochastic simulation. They are based on the assumption that a source of uniformly distributed random numbers is available that produces real and truely random numbers. In practice, however, we have to use ..."
Abstract
 Add to MetaCart
to use pseudorandom numbers which are generated by means of floating point numbers. Thus there are deviations from the theoretical framework caused by roundoff errors which are due to the limitations of floating point arithmetic. In addition algorithm have to developed and implemented. As human can err
Generating Unlabeled Connected Cubic Planar Graphs Uniformly at Random
"... We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, i.e., we count connected cubic planar graphs up to isomorphisms that fix a certain directed edge. Based on decompositi ..."
Abstract
 Add to MetaCart
in the plane, we switch to the dual and count rooted triangulations. Since all these numbers can be evaluated in polynomial time using dynamic programming, rooted connected cubic planar graphs can be generated uniformly at random in polynomial time by inverting the decomposition along the connectivity
Network analysis of the state space of chaotic map in digital domain
"... Complex dynamics of chaotic maps under an infiniteprecision mathematical framework have been well known. The case in a finiteprecision computer remains to be further explored. Previous work treated a digital chaotic map as a black box and gave different explanations according to the test results o ..."
Abstract
 Add to MetaCart
directed edge. The scalefree properties of the state network are quantitatively proven. The obtained results can be extended to the scenario of floatingpoint arithmetic and to other chaotic maps. Understanding the real network structure of the state space of a chaotic map in the digital domain will help
On ReverseEngineering SBoxes with Hidden Design Criteria or Structure
 In Advances in Cryptology – CRYPTO 2015, Lecture Notes in Computer Science
, 2015
"... Abstract. SBoxes are the key components of many cryptographic primitives and designing them to improve resilience to attacks such as linear or differential cryptanalysis is well understood. In this paper, we investigate techniques that can be used to reverseengineer Sbox design and illustrate th ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
general Sbox decomposition problems and propose new methods for decomposing SBoxes built from arithmetic operations or as a Feistel Network of up to 5 rounds. Finally, we develop an Sbox generating algorithm which can fix a large number of DDT entries to the values chosen by the designer. We
Sampling unlabeled biconnected planar graphs
 IN THE PROCEEDINGS OF THE 16TH ANNUAL INTERNATIONAL SYMPOSIUM ON ALGORITHMS AND COMPUTATION (ISAAC’05), 2005, SPRINGER LNCS 3827, 593 – 603
"... We present an expected polynomial time algorithm to generate a 2connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the exact number of rooted 2connected planar graphs, based on a decomposition along the connectivity structure. For 3conn ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
again be decomposed along their connectivity structure. All the numbers can be evaluated in polynomial time by dynamic programming. To generate 2connected unlabeled planar graphs without a root uniformly at random we apply rejection sampling and obtain an expected polynomial time algorithm.
ECONOMIC DISPATCH SOLUTION USING A REALCODED GENETIC ALGORITHM
"... In this paper, an efficient and practical realcoded genetic algorithms (RCGAs) has been proposed for solving the economic dispatch problem. The objective is to minimize the total generation fuel cost and keep the power flows within the security limits. For each problem of optimization in genetic al ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
, and there is greater freedom to use different genetic operators. A nonuniform arithmetic crossover operator was introduced into the RCGAs [1][2]. We used a nonuniform arithmetic crossover operator produces a complimentary pair of linear combinations produced from random proportions of the parents. The nonuniform
Using BubbleStorm Accepted MasterThesis from Marcel Lucas
"... Hiermit versichere ich, die vorliegende MasterThesis ohne Hilfe Dritter nur mit den angegebenen Quellen und Hilfsmitteln angefertigt zu haben. Alle Stellen, die aus Quellen entnommen wurden, sind als solche kenntlich gemacht. Diese Arbeit hat in gleicher oder ähnlicher Form noch keiner Prüfungsbehö ..."
Abstract
 Add to MetaCart
NVEs. The unstructured P2P system BubbleStorm offers flexible and scalable means and is therefore used as a fundamental base for the developed Pub/Sub system. As the evaluation of the subscription is performed
Results 1  10
of
101