A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Binary Prime Tableau Sequences
[article]
2017
arXiv
pre-print
Preserved Fulltext
This paper proposes a new class of random sequences called binary primes tableau (PT) sequences that have potential applications in cryptography and communications. ...
We also examine the dual to the PT sequences obtained by adding the rows of the tableau. It is shown that PT sequences have excellent autocorrelation properties. ...
Here we go beyond that idea and generate pseudorandom sequences by folding the binary primes sequences using p columns. ...
arXiv:1704.08718v1
fatcat:uhtxmbe5dbfeffg4ioxwwe2o2a
Natural sorting over permutation spaces
1968
Mathematics of Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
of pseudorandom x, 0 < x < 1. ...
Now, if at the ¿th step, the first i entries of the sequence have been used in the developing tableau then at the next step the element x¿+i is inserted into the first row of the tableau by displacing ...
doi:10.1090/s0025-5718-1968-0228216-8
fatcat:gjtl65k66jfffianhi4biweazq
Natural Sorting Over Permutation Spaces
1968
Mathematics of Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
of pseudorandom x, 0 < x < 1. ...
Now, if at the ¿th step, the first i entries of the sequence have been used in the developing tableau then at the next step the element x¿+i is inserted into the first row of the tableau by displacing ...
doi:10.2307/2004668
fatcat:tbvhv46rmfcmxjm6vvclxgecli
Fast and accurate protein substructure searching with simulated annealing and GPUs
2010
BMC Bioinformatics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Results: We developed an improved heuristic for tableau-based protein structure and substructure searching using simulated annealing, that is as fast or faster and comparable in accuracy, with some widely ...
AUC versus elapsed time for SA Tableau Search on different platforms for the 200 query set against the ASTRAL SCOP 95% sequence identity non-redundant database. ...
Because the CUDA library does not contain an equivalent of the standard C library function rand() or similar, we use the CUDA SDK implementation [59] of the Mersenne Twister [60] pseudorandom number ...
doi:10.1186/1471-2105-11-446
pmid:20813068
pmcid:PMC2944279
fatcat:hienecc67nfppfz3etiwn5fitu
The Winnability of Klondike Solitaire and Many Other Patience Games
[article]
2023
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2023; you can also visit the original URL.
The file type is application/pdf.
Other Versions
For example, we discuss in Section 7.2 that this allowed us to identify and fix a bug in our pseudorandom instance generator. ...
sequence. ...
SP: What card may be put in a free space in the tableau, or sequence if MG allows it. ...
arXiv:1906.12314v4
fatcat:btabu5rqpbfgfeowp2bilv4fmq
Plactic signatures
[article]
2021
IACR Cryptology ePrint Archive
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Plactic signatures use the plactic monoid (Knuth multiplication of semistandard tableaus) and full-domain hashing (SHAKE). ...
More generally, every sequence (with entries in same finite ordered set as entries of the tableaus) represents a unique tableau, via application of the Robinson-Schensted algorithm. ...
Each tableau has multiple sequence representations, but the standard representation is the row reading of the tableau. The values d and e must be communicated in standard representation. ...
dblp:journals/iacr/Brown21c
fatcat:35ahrbvftrglfdqhhjpobu5leu
Step size control in the numerical solution of stochastic differential equations
1998
Journal of Computational and Applied Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We use an inversive congruential generator (with parameters p=231 -1, a=b= 1, see [8] ) for generating a sequence of independent uniformly distributed pseudorandom numbers in the interval [0, 1 ). ...
By the polar method [7] , we transform in each step two successive pseudorandom numbers into two independent standard normally distributed pseudorandom numbers and we obtain two pseudorandom numbers which ...
doi:10.1016/s0377-0427(98)00139-3
fatcat:3eet7k5wm5d73k2f77suuop3vy
Tighter Bounds on the Independence Number of the Birkhoff Graph
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2020 pre-print arXiv:2007.05841v1 fatcat:hrbgerrg5vgmngvbzitpdzqxc4
Recall that a partition of n, λ ⊢ n, is a tuple λ := (λ 1 , . . . , λ s ) of positive integers with λ 1 ≥ · · · ≥ λ s and s i=1 λ i = n; the length s of λ as a sequence is called the height of λ and denoted ...
A standard tableau of shape λ ⊢ n is a filling of the Young diagram of λ, where each box is filled with a distinct number from [n] so that each row and each column is increasing (see Fig. 1b ). ...
If A ⊆ S n is (k, r)pseudorandom and K λ,h n k = 0, then Proof. ...
arXiv:2007.05841v2
fatcat:7e6yfx5e2rgzfjnk2p3j5vg3zy
Set partitions, tableaux, and subspace profiles under regular split semisimple matrices
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Other Versions
For partitions whose parts are at most two, these polynomials are the non-zero entries of the Catalan triangle associated to the q-Hermite orthogonal polynomial sequence. ...
The definition of a splitting subspace can be traced back to the work of Niederreiter [24] on pseudorandom number generation. ...
Thus a sequence of i non-empty Dyck paths, followed by a non-empty prefix Dyck path is obtained. 4. Change the last step of each Dyck path from SE to NE and concatenate. ...
arXiv:2112.00479v2
fatcat:yrh7vc5furejfm5nj7za6nse2u
Survey: Recent Modifications in Vigenere Cipher
2014
IOSR Journal of Computer Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The Vigenère cipher consists of several simple substitution ciphers in sequence with different shift values. ...
In extended Vigenere cipher a new symbol is added into the row and column of the Vigenere Tableau. The new symbol can be used to represent or to locate the blank space in the plaintext. ...
doi:10.9790/0661-16294953
fatcat:roqzjiphqfg27grwwl5tlg6zdy
Concave Minimization Via Collapsing Polytopes
1986
Operations Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In addition to these small examples used primarily for feasibility testing, the major test effort involved the pseudorandom generation of polytopes coupled with the generation of concave objective functions ...
Neighbors satisfying (1) can be identified from the tableau representing v'. ...
doi:10.1287/opre.34.6.919
fatcat:fththmwr2bf3dmks5ls5u63z4m
Realistic analysis of some randomized algorithms
1991
Journal of computer and system sciences (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
(xi, . . . . x,, xr+i ) be a liar contained in E,*, and consider the following tableau, which represents the action of the primality test on input xobservation is this: row V,in -1 of this tableau contains ...
The performance of Monte Carlo integration procedures using pseudorandom numbers has been studied by Niederreiter [23] . ...
doi:10.1016/0022-0000(91)90038-7
fatcat:7vlmjmjltfbuza4haclyl42vmi
Realistic analysis of some randomized algorithms
1987
Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
(xi, . . . . x,, xr+i ) be a liar contained in E,*, and consider the following tableau, which represents the action of the primality test on input xobservation is this: row V,in -1 of this tableau contains ...
The performance of Monte Carlo integration procedures using pseudorandom numbers has been studied by Niederreiter [23] . ...
doi:10.1145/28395.28444
dblp:conf/stoc/Bach87
fatcat:uwtwwg53djh37jbmdtpxfvsx3i
Fourier Analysis of Uniform Random Number Generators
1967
Journal of the ACM
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
Any general sequence C as defined above is periodic; that is, the sequences C and X are periodic from some point on at least. ...
The method is that of Fourier analysis off the output sequences of such generators. ...
We arbitrarily take as a figure of merit (for uniformity of distribution of (p+ l)4uples of consecutive pseudorandom numbers) the squared reciprocal of the wavde~gth of the longest wave, denoting it by ...
doi:10.1145/321371.321379
fatcat:2yz5dmjfdrg7xcihtnbvehio44
Improved Efficient Arguments
[chapter]
1995
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
However, we can use pseudorandom generators to conserve bits in a straightforward manner. ...
Finally, we show how to save random bits by using cryptographically secure pseudorandom generators. ...
doi:10.1007/3-540-44750-4_25
fatcat:v45yljjhjbf2lcl2fhxdmnjyjq
« Previous
Showing results 1 — 15 out of 90 results