搜索：each - 虫虫下载站

matlab例程  Basic function to locate and measure the positive peaks in a noisy data sets. Detects peaks by loo

Basic function to locate and measure the positive peaks in a noisy data sets. Detects peaks by looking for downward zero-crossings in the smoothed third derivative that exceed SlopeThreshold and peak amplitudes that exceed AmpThreshold. Determines, position, height, and approximate width of e ...

https://www.eeworm.com/dl/665/432373.html

下载: 93

查看: 1041

其他书籍  Picking Up Perl is a freely redistributable tutorial book on Perl that can be downloaded in pdf, pos

Picking Up Perl is a freely redistributable tutorial book on Perl that can be downloaded in pdf, postscript, or textinfo format. It can also be viewed online in html format, either as one large file or as separate files for each chapter.

https://www.eeworm.com/dl/542/432583.html

下载: 79

查看: 1053

电子书籍  This volume is an instructor鈥檚 manual for the 4th edition of Database System Concepts by Abraham Si

This volume is an instructor鈥檚 manual for the 4th edition of Database System Concepts by Abraham Silberschatz, Henry F. Korth and S. Sudarshan. It contains answers to the exercises at the end of each chapter of the book.

https://www.eeworm.com/dl/cadence/ebook/433824.html

下载: 37

查看: 1089

其他数据库  How to restruct paradox DB when you encounter pb whith indexes. You have to use this mecanism to re

How to restruct paradox DB when you encounter pb whith indexes. You have to use this mecanism to repair your DB. You might use it in each prg when you close your Delphi programs.

https://www.eeworm.com/dl/645/434584.html

下载: 163

查看: 1073

数值算法/人工智能  Maya Calendar During his last sabbatical, professor M. A. Ya made a surprising discovery about the

Maya Calendar During his last sabbatical, professor M. A. Ya made a surprising discovery about the old Maya calendar. From an old knotted message, professor discovered that the Maya civilization used a 365 day long year, called Haab, which had 19 months. Each of the first 18 months was 20 days long ...

https://www.eeworm.com/dl/518/434758.html

下载: 146

查看: 1484

其他数据库  A Perl-based statistics management system designed for academic competition tournaments. These tourn

A Perl-based statistics management system designed for academic competition tournaments. These tournaments, which are called "College Bowl," "quiz bowl," and a variety of other names, involve teams playing against each other in either timed or untime The latest file releases

https://www.eeworm.com/dl/645/438019.html

下载: 99

查看: 1033

人工智能/神经网络  Traveling Salesperson Problem Our branch-and-strategy splits a branch and bound solution into two

Traveling Salesperson Problem Our branch-and-strategy splits a branch and bound solution into two groups: one group including a particular arc and the other excluding this arc. 1.Each splitting incurs a lower bound and we shall traverse the searching tree with the "lower" lower bound. 2.If a const ...

https://www.eeworm.com/dl/650/444394.html

下载: 111

查看: 1046

CA认证  Playfair Cipher 1.not even the large number of keys in a monoalphabetic cipher provides security 2

Playfair Cipher 1.not even the large number of keys in a monoalphabetic cipher provides security 2.one approach to improving security was to encrypt multiple letters 3.the Playfair Cipher is an example 4.invented by Charles Wheatstone in 1854,but named after his friend Baron Playfair Playfair Key M ...

https://www.eeworm.com/dl/640/444418.html

下载: 143

查看: 1070

Java编程  Generate Possion Dis. step1:Generate a random number between [0,1] step2:Let u=F(x)=1-[(1/

Generate Possion Dis. step1:Generate a random number between [0,1] step2:Let u=F(x)=1-[(1/e)x] step3:Slove x=1/F(u) step4:Repeat Step1~Step3 by using different u,you can get x1,x2,x3,...,xn step5:If the first packet was generated at time [0], than the second packet will be generated at time ...

https://www.eeworm.com/dl/633/444481.html

下载: 109

查看: 1142

压缩解压  ) Compression using huffman code -with a number of bits k per code word -provide huffma

) Compression using huffman code -with a number of bits k per code word -provide huffman table Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code table for encoding a source symbol. The table is d ...

https://www.eeworm.com/dl/617/446746.html