This scheme is initiated by Ziv and Lempel [1]. A slightly modified version is described by Storer and Szymanski [2]. An implementation using a binary tree is proposed by Bell [3]. The algorithm is quite simple: Keep a ring buffer, which initially Contains "space" characters only. Read several letters from the file to the buffer. Then search the buffer for the longest string that matches the letters just read, and send its length and position in the buffer.
標(biāo)簽： initiated described modified slightly
上傳時(shí)間： 2014-01-09
上傳用戶(hù)：sk5201314
Programming the Microsoft Windows Driver Model Copyright © 1999 by Walter Oney General Information。The companion disc for Programming the Microsoft Windows Driver Model Contains more than 20 sample drivers and test programs to illustrate the topics covered by the book.
標(biāo)簽： Programming Microsoft Copyright Informati
上傳時(shí)間： 2015-03-28
上傳用戶(hù)：skfreeman
This is a package to calculate Discrete Fourier/Cosine/Sine Transforms of 1-dimensional sequences of length 2^N. This package Contains C and Fortran FFT codes.
標(biāo)簽： dimensional Transforms calculate sequences
上傳時(shí)間： 2014-01-14
上傳用戶(hù)：LIKE
The module LSQ is for unconstrained linear least-squares fitting. It is based upon Applied Statistics algorithm AS 274 (see comments at the start of the module). A planar-rotation algorithm is used to update the QR- factorization. This makes it suitable for updating regressions as more data become available. The module Contains a test for singularities which is simpler and quicker than calculating the singular-value decomposition. An important feature of the algorithm is that it does not square the condition number. The matrix X X is not formed. Hence it is suitable for ill- conditioned problems, such as fitting polynomials. By taking advantage of the MODULE facility, it has been possible to remove many of the arguments to routines. Apart from the new function VARPRD, and a back-substitution routine BKSUB2 which it calls, the routines behave as in AS 274.
標(biāo)簽： least-squares unconstrained Statisti Applied
上傳時(shí)間： 2015-05-14
上傳用戶(hù)：aig85
This document describes the MPI and MPI standards They are both extensions to the MPI standard The MPI part of the document Contains clarications and corrections to the MPI standard and denes MPI The MPI part of the document describes additions to the MPI standard and denes MPI These include miscellaneous topics process creation and management onesided communications extended collective operations external interfaces IO and additional language bindings
標(biāo)簽： MPI extensions describes the
上傳時(shí)間： 2015-05-15
上傳用戶(hù)：CHENKAI
uc/os-ii for 8051 This package provides the sources required to use the uC/OS-II v2.00 real time kernel on the 8051 processor. To use this package you will need the TASKING C Compiler toolset v6.0r1 or higher. For info on TASKING products you can contact our Web-site at: http://www.tasking.com Unzip the zipfile in the root of the drive where you also installed the uC/OS-II general sources. The following directories will be added: \SOFTWARE\UCOS-II\8051 This directory Contains the microprocessor specific source code \SOFTWARE\UCOS-II\ex1_8051r This directory Contains the project files for the first example \SOFTWARE\UCOS-II\ex2_8051r This directory Contains the project files for the second example
標(biāo)簽： the provides required package
上傳時(shí)間： 2015-05-21
上傳用戶(hù)：ainimao
數(shù)字運(yùn)算，判斷一個(gè)數(shù)是否接近素?cái)?shù) A Niven number is a number such that the sum of its digits divides itself. For example, 111 is a Niven number because the sum of its digits is 3, which divides 111. We can also specify a number in another base b, and a number in base b is a Niven number if the sum of its digits divides its value. Given b (2 <= b <= 10) and a number in base b, determine whether it is a Niven number or not. Input Each line of input Contains the base b, followed by a string of digits representing a positive integer in that base. There are no leading zeroes. The input is terminated by a line consisting of 0 alone. Output For each case, print "yes" on a line if the given number is a Niven number, and "no" otherwise. Sample Input 10 111 2 110 10 123 6 1000 8 2314 0 Sample Output yes yes no yes no
上傳時(shí)間： 2015-05-21
上傳用戶(hù)：daguda
很好的linux內(nèi)核調(diào)試軟件 兼轅馬，沒(méi)有密碼。 The ia64 and ix86 directories contain versions of kdb prior to v2.0 (kdb version v2.0, not the kernel version). Older versions of kdb had complete patches for each architecture it supported, each patch included all the common kdb code. This format was awkward to maintain and use for multiple platforms. Starting with kdb v2.0 there is a common patch against each kernel which Contains all the architecture independent code plus separate architecture dependent patches. Either use an old style (v1.8 or v1.9) kdb patch or use a new style (v2.0) common patch plus the corresponding architecture dependent patch.
標(biāo)簽： linux 內(nèi)核 調(diào)試軟件
上傳時(shí)間： 2014-01-21
上傳用戶(hù)：wyc199288
See Appendix B for a description of the programs included on this companion disk. RESOURCE.WRI identifies other books and resources for Internet programming. WEBHELP.HLP Contains an introduction to the World Wide Web. TCPMAN.HLP provides detailed instructions to help you use the Trumpet Winsock included on this disk. Use the Program Manager s File menu Run option to execute the SETUP.EXE program found on this disk. SETUP.EXE will install the programs on your hard drive and create an Internet Programming group window. Internet編程技術(shù) [配套程序] [涉及平臺(tái)] VC [作者] void [文件大小] 1032K
標(biāo)簽： description companion Appendix RESOURCE
上傳時(shí)間： 2013-12-04
上傳用戶(hù)：asasasas
The government of a small but important country has decided that the alphabet needs to be streamlined and reordered. Uppercase letters will be eliminated. They will issue a royal decree in the form of a String of B and A characters. The first character in the decree specifies whether a must come ( B )Before b in the new alphabet or ( A )After b . The second character determines the relative placement of b and c , etc. So, for example, "BAA" means that a must come Before b , b must come After c , and c must come After d . Any letters beyond these requirements are to be excluded, so if the decree specifies k comparisons then the new alphabet will contain the first k+1 lowercase letters of the current alphabet. Create a class Alphabet that Contains the method choices that takes the decree as input and returns the number of possible new alphabets that conform to the decree. If more than 1,000,000,000 are possible, return -1. Definition
標(biāo)簽： government streamline important alphabet
上傳時(shí)間： 2015-06-09
上傳用戶(hù)：weixiao99
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
