simulates coin tossing. Let the program toss a coin each time the user chooses the “Toss Coin” menu option. Count the Number of times each side of the coin appears. Display the results. The program should call a separate method flip that takes no arguments and returns false for tails and true for heads. [ Note: If the program realistically simulates coin tossing, each side of the coin should appear approximately half the time.]
标签： the coin simulates chooses
上传时间： 2014-08-30
上传用户：pompey
an application that finds the smallest of several integers. Assume that the first value read specifies the Number of values to input from the user
标签： that application the smallest
上传时间： 2016-05-05
上传用户：yiwen213
A simple smtp relay server. Which follows smtp protocol correctly. It receive an email. and relay it out to an email server specified by users. Platform: unix, linux, windows. compilation command: g++ smtpr.c -lsocket -lnsl -o smtpr usage: smtpr <port Number> (<relay server>)
标签： relay smtp correctly protocol
上传时间： 2014-01-01
上传用户：jhksyghr
NAME: u2440mon.c DESC: u2440mon entry point,menu,download HISTORY: Mar.25.2002:purnnamu: S3C2400X profile.c is ported for S3C2410X. Mar.27.2002:purnnamu: DMA is enabled. Apr.01.2002:purnnamu: isDownloadReady flag is added. Apr.10.2002:purnnamu: - Selecting menu is available in the waiting loop. So, isDownloadReady flag gets not needed - UART ch.1 can be selected for the console. Aug.20.2002:purnnamu: revision Number change 0.2 -> R1.1 Sep.03.2002:purnnamu: To remove the power noise in the USB signal, the unused CLKOUT0,1 is disabled.
标签： 2440 mon download purnnamu
上传时间： 2016-05-12
上传用户：wff
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
Exuberant Ctags is a multilanguage reimplementation of the much-underused ctags(1) program and is intended to be the mother of all ctags programs. It generates indexes of source code definitions which are used by a Number of editors and tools. The motivation which drove the development of Exuberant Ctags was the need for a ctags program which supported generation of tags for all possible C language constructs (which no other ctags offers), and because most were easily fooled by a Number of preprocessor contructs.
标签： reimplementation much-underused multilanguage Exuberant
上传时间： 2016-05-18
上传用户：小宝爱考拉
SimpliciTI™ -1.0.3.exe for CC11xx and CC25xx SimpliciTI is a simple low-power RF network protocol aimed at small (<256) RF networks. Such networks typically contain battery operated devices which require long battery life, low data rate and low duty cycle and have a limited Number of nodes talking directly to each other or through an access point or range extenders. Access point and range extenders are not required but provide extra functionality such as store and forward messages. With SimpliciTI the MCU resource requirements are minimal which results in the low system cost.
标签： SimpliciTI low-power network simple
上传时间： 2014-11-05
上传用户：rishian
SimpliciTI™ -1.0.4.exe for CC2430 SimpliciTI is a simple low-power RF network protocol aimed at small (<256) RF networks. Such networks typically contain battery operated devices which require long battery life, low data rate and low duty cycle and have a limited Number of nodes talking directly to each other or through an access point or range extenders. Access point and range extenders are not required but provide extra functionality such as store and forward messages. With SimpliciTI the MCU resource requirements are minimal which results in the low system cost.
标签： SimpliciTI low-power protocol network
上传时间： 2016-05-21
上传用户：R50974
％ EM algorithm for k multidimensional Gaussian mixture estimation ％ ％ Inputs: ％ X(n,d) - input data, n=Number of observations, d=dimension of variable ％ k - maximum Number of Gaussian components allowed ％ ltol - percentage of the log likelihood difference between 2 iterations ([] for none) ％ maxiter - maximum Number of iteration allowed ([] for none) ％ pflag - 1 for plotting GM for 1D or 2D cases only, 0 otherwise ([] for none) ％ Init - structure of initial W, M, V: Init.W, Init.M, Init.V ([] for none) ％ ％ Ouputs: ％ W(1,k) - estimated weights of GM ％ M(d,k) - estimated mean vectors of GM ％ V(d,d,k) - estimated covariance matrices of GM ％ L - log likelihood of estimates ％
标签： multidimensional estimation algorithm Gaussian
上传时间： 2013-12-03
上传用户：我们的船长
GloptiPoly 3: moments, optimization and semidefinite programming. Gloptipoly 3 is intended to solve, or at least approximate, the Generalized Problem of Moments (GPM), an infinite-dimensional optimization problem which can be viewed as an extension of the classical problem of moments [8]. From a theoretical viewpoint, the GPM has developments and impact in various areas of mathematics such as algebra, Fourier analysis, functional analysis, operator theory, probability and statistics, to cite a few. In addition, and despite a rather simple and short formulation, the GPM has a large Number of important applications in various fields such as optimization, probability, finance, control, signal processing, chemistry, cristallography, tomography, etc. For an account of various methodologies as well as some of potential applications, the interested reader is referred to [1, 2] and the nice collection of papers [5].
标签： optimization semidefinite programming GloptiPoly
上传时间： 2016-06-05
上传用户：lgnf
