伪随机数生成器，Implementation of the Quasi-Random Number generator currently hardwired to no more than 52 dimensions
上传时间： 2013-12-20
上传用户：teddysha
1) Write a function reverse(A) which takes a matrix A of arbitrary dimensions as input and returns a matrix B consisting of the columns of A in reverse order. Thus for example, if A = 1 2 3 then B = 3 2 1 4 5 6 6 5 4 7 8 9 9 8 7 Write a main program to call reverse(A) for the matrix A = magic(5). Print to the screen both A and reverse(A). 2) Write a program which accepts an input k from the keyboard, and which prints out the smallest fibonacci number that is at least as large as k. The program should also print out its position in the fibonacci sequence. Here is a sample of input and output: Enter k>0: 100 144 is the smallest fibonacci number greater than or equal to 100. It is the 12th fibonacci number.
标签： dimensions arbitrary function reverse
上传时间： 2016-04-16
上传用户：waitingfy
北京大学ACM比赛题目 In 1742, Christian Goldbach, a German amateur mathematician, sent a letter to Leonhard Euler in which he made the following conjecture: Every even number greater than 4 can be written as the sum of two odd prime numbers. For example: 8 = 3 + 5. Both 3 and 5 are odd prime numbers. 20 = 3 + 17 = 7 + 13. 42 = 5 + 37 = 11 + 31 = 13 + 29 = 19 + 23. Today it is still unproven whether the conjecture is right. (Oh wait, I have the proof of course, but it is too long to write it on the margin of this page.) Anyway, your task is now to verify Goldbach s conjecture for all even numbers less than a million.
标签： mathematician Christian Goldbach Leonhard
上传时间： 2016-04-22
上传用户：wangchong
北京大学ACM比赛题目 Write a program to read four lines of upper case (i.e., all CAPITAL LETTERS) text input (no more than 72 characters per line) from the input file and print a vertical histogram that shows how many times each letter (but not blanks, digits, or punctuation) appears in the all-upper-case input. Format your output exactly as shown.
标签： CAPITAL LETTERS program Write
上传时间： 2014-01-17
上传用户：410805624
*** *** *** *** *** *** *** *** *** *** *** *** *** * assniffer v0.1 alpha, Copyright (C) 2004, Cockos Incorporated ******************************************************************************* Usage: assniffer output_directory [-d deviceindex] [flags (see below)] -nopromisc disables promiscuous mode -allports watches ports other than 80/8080 (slower) -nosubdirs does not create subdirectories, uses filename for whole url Default MIME extension replaces URL s extension, or: -nomime does not make extensions based on MIME type -addmime makes MIME extensions appended to URL -debugfn adds debug info to filenames
标签： assniffer Copyright alpha 2004
上传时间： 2014-01-24
上传用户：yyyyyyyyyy
Huo Chess by Spiros (Spyridon) Kakos (http://www.kakos.com.gr) is a micro chess program in CLI C++ v8.0 that attempts to be smaller in size than the Commodore-era Microchess. The goal is to create the smallest chess program that exists. More versions are to come in the future.
标签： Spyridon program Spiros Chess
上传时间： 2016-05-05
上传用户：hfmm633
This LDPC software is intended as an introduction to LDPC codes computer based simulation. The pseudo-random irregular low density parity check matrix is based on Radford M. Neal’s programs collection, which can be found in [1]. While Neal’s collection is well documented, in my opinion, C source codes are still overwhelming, especially if you are not knowledgeable in C language. My software is written for MATLAB, which is more readable than C. You may also want to refer to another MATLAB based LDPC source codes in [2], which has different flavor of code-writing style (in fact Arun has error in his log-likelihood decoder).
标签： LDPC introduction simulation software
上传时间： 2014-01-14
上传用户：大融融rr
I ve written some many years ago dynamic Huffman algorithm to compress and decompress data. It is mainly targeted to data with some symbols occuring more often than the rest (e.g. having some data file consisted of 3 different symbols and their total number of occurence in that file s1(1000), s2(200), s3(30) so the total length of file is 1000+200+30=1230 bytes, it will be encoded assigning one bit to s1 and 2 bits to s2, s3 so the encoded length will be 1*1000+2*(200+30)=1460 bits=182 bytes). In the best case the file consisted of just one symbol will be encoded with compression ratio as 1:8. Huffman coding is used in image compression, however in JPEG2000 arithmetic codec is imployed.
标签： decompress algorithm compress Huffman
上传时间： 2016-05-16
上传用户：aysyzxzm
Sequential Monte Carlo without Likelihoods 粒子滤波不用似然函数的情况下 本文摘要:Recent new methods in Bayesian simulation have provided ways of evaluating posterior distributions in the presence of analytically or computationally intractable likelihood functions. Despite representing a substantial methodological advance, existing methods based on rejection sampling or Markov chain Monte Carlo can be highly inefficient, and accordingly require far more iterations than may be practical to implement. Here we propose a sequential Monte Carlo sampler that convincingly overcomes these inefficiencies. We demonstrate its implementation through an epidemiological study of the transmission rate of tuberculosis.
标签： Likelihoods Sequential Bayesian without
上传时间： 2016-05-26
上传用户：离殇
This LDPC software is intended as an introduction to LDPC codes computer based simulation. The pseudo-random irregular low density parity check matrix is based on Radford M. Neal’s programs collection, which can be found in [1]. While Neal’s collection is well documented, in my opinion, C source codes are still overwhelming, especially if you are not knowledgeable in C language. My software is written for MATLAB, which is more readable than C. You may also want to refer to another MATLAB based LDPC source codes in [2], which has different flavor of code-writing style (in fact Arun has error in his log-likelihood decoder).
标签： LDPC introduction simulation software
上传时间： 2014-12-05
上传用户：change0329
