reinitialize the random number generator

báo cáo hóa học:" Research Article An FPGA Implementation of a Parallelized MT19937 Uniform Random Number Generator" pptx

Ngày tải lên : 21/06/2014, 20:20

... that the problem is not the parallelization of the generation of the uniform random numbers but is the storing of seeds in multiple BRAMs Thus if the seeds were to be stored in registers rather ... uniform random numbers per clock cycle In a reconfigurable computing implementation, where only the random number generation is accelerated in hardware, like all of the other FPGA-based random number ... was later identified that the effectiveness, that is, the randomness of the numbers produced, of this algorithm was dependent on the selection of initial seeds Furthermore, the algorithm required...

6
483
0

Đề tài " The two possible values of the chromatic number of a random graph " pot

Ngày tải lên : 29/03/2014, 07:20

... convexity, Jk is the maximizer of the entropy over Bk and the minimizer of the 2-norm By the same token, the permutation matrices are minimizers of the entropy and maximizers of the 2-norm The constant ... and ψ(a) − ψ(b) = λ(a − b) Combined, these imply ψ (a) = ψ (b) = ψ(a) − ψ(b) a−b 1347 THE CHROMATIC NUMBER OF A RANDOM GRAPH By the Mean Value Theorem, there exists θ ∈ (b, a) such that ψ (θ) ... k-colorability, Random Structures Algorithms 14 (1999), 63–70 [2] N Alon and M Krivelevich, The concentration of the chromatic number of random graphs, Combinatorica 17 (1997), 303–313 THE CHROMATIC NUMBER...

18
510
0

Báo cáo toán học: "On the Domination Number of a Random Graph" docx

Ngày tải lên : 07/08/2014, 06:22

... concentration for the domination number Dn of the subgraph G(n, p) of G( +, p), p fixed Specifically, we shall prove Theorem Consider the infinite random graph G( +, p), where p is fixed Let È be the measure ... everywhere sense of measure theory.) The main results are proved using the so-called second moment method [1] together with the Borel Cantelli lemma from probability theory We consider our results ... ((Ä n)(log n)) and Dn denoting the domination number, we have È(Dn ≤ r) = È(Xr ≥ 1) ≤ (Xr ) → (n → ∞) We have thus proved Lemma The domination number Dn of the random graph G(n, p) satisfies,...

13
362
0

Tài liệu Báo cáo khoa học: "Selecting the “Right” Number of Senses Based on Clustering Criterion Functions" pdf

Ngày tải lên : 22/02/2014, 02:20

... experiments The results are shown in Tables 1, 2, and In these tables, the actual numbers of senses are in the columns, and the predicted number of senses are in the rows We see that the predicted ... introduces the L measure This tries to find the point of maximum curvature in the criterion function graph, by fitting a pair of lines to the curve (where the intersection of these lines represents the ... single threshold The graph of the P K1 scores shown in Figure illustrates the difficulty - the slope of these scores is nearly linear, and as such the threshold (as shown by the horizontal line)...

4
361
0

Đề tài " The kissing number in four dimensions " pdf

Ngày tải lên : 06/03/2014, 08:21

... about the kissing number in four dimensions Namely, the equality k(4) = 24 is proved The proof is based on a modiﬁcation of Delsarte’s method Introduction The kissing number k(n) is the highest number ... Annals of Mathematics, 168 (2008), 1–32 The kissing number in four dimensions By Oleg R Musin Abstract The kissing number problem asks for the maximal number k(n) of equal size ... [−1, z], then μ(n, z, f ) = 0, i.e hmax = h0 = f (1) Therefore, this theorem yields the Delsarte bound M ≤ f (1)/c0 4-B The class of functions Φ(t0 , z) The problem of evaluating hmax in the general...

33
300
0

Báo cáo khoa học: "Improving the Performance of the Random Walk Model for Answering Complex Questions" pptx

Ngày tải lên : 23/03/2014, 17:20

... similarity with the query and takes the average of these measures 5.2 Evaluation Results The comparison between the systems in terms of their F-scores is given in Table The SYN system improves the ROUGE-1, ... [ARG0 the Vatican][TARGET use][ARG1 the Italian lira][ARG2 as their currency] In order to calculate the semantic similarity between the sentences, we ﬁrst represent the annotated sentence using the ... 2001) computes the number of common subtrees between two trees Such subtrees are subject to the constraint that their nodes are taken with all or none of the children they have in the original...

4
456
0

Đề tài " A new construction of the moonshine vertex operator algebra over the real number field " pot

Ngày tải lên : 28/03/2014, 22:20

... √ then (M ⊕ −1M , Y ) is the other SVOA They are isomorphic together as M -modules We already have a VOA structure on CM ⊕ CM and the √ isomorphism v (0) + −1v (1) → v (0) + v (1) deﬁnes another ... , then MF ⊕ IndF (W δ ) is an (F, δ )-framed VOA Before D D we prove Theorem 3.21, we note that the conditions of Theorem 3.21 including the fusion rule (3.21) follow from the conditions of Theorem ... properties, the original construction essentially depends on the actions of the centralizer CM (θ) ∼ 21+24 Co.1 of a = 2B-involution θ of M and it is hard to see the actions of the other elements...

63
423
0

The Random Oracle Methodology, Revisited

Ngày tải lên : 23/04/2014, 20:49

... is, there is no attempt to “understand” or “interpret” the code) Rather, they only use the fact that such a short code exists On another failure of the Random Oracle Methodology As stated in Theorem ... output the secret key) Otherwise, the scheme behaves as the original (secure) scheme does The former case (i.e., ﬁnding a pair in the relation) will occur rarely in the Random Oracle Model, thus the ... real-world systems not have access to a random oracle, there is a need to “implement” the random oracle aspect of the ideal systems from above The soundness of the random oracle methodology depends...

37
282
0

Báo cáo hóa học: " A class of small deviation theorems for the random fields on an m rooted Cayley tree" docx

Ngày tải lên : 20/06/2014, 23:20

... deviation theorems for the random fields relative to homogeneous Markov chains indexed by a homogeneous tree Shi and Yang [2] have studied the strong law of large numbers and Shannon-McMillan for the ... implies (16) immediately This completes the proof of the theorem □ Theorem Let Ht = 2b/e2 (t − 1)2 , < t < (29) Let fn(ω) be defined by (2) Under the conditions of Theorem 1, when ≤ c ≤ t2Ht, we have ... Page of 15 There have been some works on limit theorems for tree-indexed stochastic process Benjamini and Peres [3] have given the notion of the tree-indexed Markov chains and studied the recurrence...

15
354
0

Báo cáo hóa học: " Research Article Pseudorandom Recursions: Small and Fast Pseudorandom Number Generators for Embedded Applications" pptx

Ngày tải lên : 22/06/2014, 22:20

... mixing of the bits This is veriﬁed with the randomness tests 4.1 Multiple returned numbers The random number generator function or the caller program must remember the last k generated numbers ... all the generators in Tables 1, 2, and on their modes of operation, sorted by the size of the used memory The algorithms are referenced by their number in the corresponding subsection (for the ... of linear equations is even, when there is an even number of There is no nice theory behind most of the discussed generators, so we not know the exact length of their cycles, in general To assure...

13
361
0

Báo cáo hóa học: " THE LEFSCHETZ-HOPF THEOREM AND AXIOMS FOR THE LEFSCHETZ NUMBER" pot

Ngày tải lên : 23/06/2014, 00:20

... characterize the reduced Lefschetz number as follows Theorem 1.1 The reduced Lefschetz number L is the unique function λ from the set of self-maps of spaces in Ꮿ to the integers that satisfies the following ... 1.1 to prove the Lefschetz-Hopf theorem in a quite natural manner by showing that the fixed-point index satisfies the axioms of Theorem 1.1 That is, we prove the following theorem Theorem 1.3 (normalization ... for j = 1, ,k, are the inclusions and projections, Proof The proof is by induction on the dimension n of the spheres The case n = is the wedge of circles axiom If n ≥ 2, then the map f : k Sn →...

11
251
0

The Fibonacci Number Series, by Michael Husted doc

Ngày tải lên : 28/06/2014, 19:20

... The Project Gutenberg EBook of The Fibonacci Number Series, by Michael Husted This eBook is for the use of anyone anywhere at no cost and with almost ... under the terms of the Project Gutenberg License included with this eBook or online at www.gutenberg.org ** This is a COPYRIGHTED Project Gutenberg eBook, Details Below ** ** Please follow the ... Title: The Fibonacci Number Series Author: Michael Husted Posting Date: March 18, 2012 [EBook #302] Release Date: July, 1995 Language: English *** START OF THIS PROJECT GUTENBERG EBOOK THE FIBONACCI...

271
170
0

Rewrite the sentences - number 1

Ngày tải lên : 06/07/2014, 11:00

... one hotel to another , we (even) found one which was not fully booked 14 The trouble with Mr Brown is that he’s so (consist) _ One minute he goes mad when you come late; the next he sayd...

2
1.3K
10

Rewrite the sentences - number 2

Ngày tải lên : 06/07/2014, 11:00

2
774
3

Báo cáo toán học: "Fredholm operators and the continuity of the Lefschetz number " potx

Ngày tải lên : 05/08/2014, 10:20

37
354
0

Báo cáo sinh học: "The small number of journals in which a great number of scientists strive to publish their best work share certain characteristics" doc

Ngày tải lên : 06/08/2014, 18:20

1
376
0

Báo cáo toán học: "The independence number of graphs with large odd girth" ppt

Ngày tải lên : 07/08/2014, 06:20

... bound for the Ramsey number rk (q) k k k+1 q k rk (q) ≤ ln q improving the previous bound provided q is large §2 The independence number of regular graphs In this section we shall introduce the basic ... v, and let p be the vertex furthest from v at which these paths intersect (certainly since they each pass through v there is some intersection) By the minimality of the paths we must have ≤ dG ... Further independence results The use of the method of Section is not solely limited to graphs which are almost regular In the non–regular case we can still ﬁnd bounds for the independence number...

12
356
0

Báo cáo toán học: "THE INDEPENDENCE NUMBER OF DENSE GRAPHS WITH LARGE ODD GIRTH" ppsx

Ngày tải lên : 07/08/2014, 06:20

... (k ≥ 2) Then α(G) ≥ 2−( k−1 k ) n k−1 d k k Proof Immediate from Theorem This improves Denley’s Theorem References Denley, T., The Independence number of graphs with large odd girth, The Electronic ... α(G) ≥ nd2 as claimed ¯ and the preceding remark) Therefore α(G) ≥ nd/2 This improves Denley’s Theorems and It is sharp for the regular complete bipartite graphs Kaa The above results are readily ... 2) Then v∈G + d1 (v) + · · · + dk−1 (v)) + d1 (v) + · · · + dk (v) (1 α(G) ≥ v∈G Proof Randomly label the vertices of G with a permutation of the integers from to n Let A (respectively B) be the...

3
324
0

Báo cáo toán học: "The asymptotic number of set partitions with unequal block sizes" pot

Ngày tải lên : 07/08/2014, 06:20

... of Theorem 2.3 The last part of the theorem, referring to m − k bounded, is the same as in Theorem 2.1 For m − k → ∞ but k = o(m), the theorem is covered by Proposition 2.1 together with the ... together with the check (in the remarks after the statement of the present theorem) that the formula there corresponds with the formula in the present theorem for such k For the rest, we can assume ... parts of the summation in (3.9), one for t close to k and the other for t close to µk For most values of k, one dominates the other, but at the point where they become comparable in magnitude they...

37
312
0

Báo cáo toán học: "An improved bound on the minimal number of edges in color-critical graphs" pot

Ngày tải lên : 07/08/2014, 06:22

... Brooks’ theorem nH > Also, if V (L(G)) = ∅, we are done, therefore we may assume that nL > the electronic journal of combinatorics (1998), #R4 Let r be the number of connected components of H(G), then ... induction on the number of vertices, it follows from the above statement that Lemma ([1], Lemma 4.5) Let k ≥ Let G = (V, E) = Kk be a k-Gallai forest Then |E(G)| ≤ k−2 + |V (G)| − k−1 (1) The second ... high-vertex subgraph H(G) does not exceed the number of connected components of its low-vertex subgraph L(G) Proof of Theorem Let L(G) and H(G) be the low-vertex and the high-vertex subgraphs of G, respectively...

4
344
0