LwIP是瑞士计算机科学院(Swedish Institute of Computer Science)的AdamDunkels等开发的一套用于嵌入式系统的开放源代码TCP/IP协议栈。LwIP的含义是Light Weight(轻型)IP协议。LwIP可以移植到操作系统上，也可以在无操作系统的情况下独立运行。LwIP协议的基础是在减少对硬件资源占用的前提下完成TCP/IP协议的主要功能
标签： LwIP AdamDunkels Institute Computer
上传时间： 2014-11-04
上传用户：love1314
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 constant subtracted from any row or any column of the cost matrix, an optimal solution does not change.
标签： branch-and-strategy Salesperson Traveling solution
上传时间： 2013-12-29
上传用户：璇珠官人
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 Matrix 1.a 5X5 matrix of letters based on a keyword 2.fill in letters of keyword (sans duplicates) 3.fill rest of matrix with other letters Encrypting and Decrypting -plaintext is encrypted two letters at a time 1. if a pair is a repeated letter, insert filler like X’ 2. if both letters fall in the same row, replace each with letter to right (wrapping back to start from end) 3. if both letters fall in the same column, replace each with the letter below it (again wrapping to top from bottom) 4. otherwise each letter is replaced by the letter in the same row and in the column of the other letter of the pair
标签： monoalphabetic Playfair provides security
上传时间： 2017-05-25
上传用户：变形金刚
This is program with source code to convert ascii text files to the maxicode barcode standard. The input file consists of two columns. The first column represents a code and the second column is a string enclosed in quotes. The codes for the first column are as follows: PM, SM, CC, MO, SC, and PC.
标签： maxicode standard barcode convert
上传时间： 2017-06-07
上传用户：ardager
The code performs a number (ITERS) of iterations of the Bailey s 6-step FFT algorithm (following the ideas in the CMU Task parallel suite). 1.- Generates an input signal vector (dgen) with size n=n1xn2 stored in row major order In this code the size of the input signal is NN=NxN (n=NN, n1=n2=N) 2.- Transpose (tpose) A to have it stored in column major order 3.- Perform independent FFTs on the rows (cffts) 4.- Scale each element of the resulting array by a factor of w[n]**(p*q) 5.- Transpose (tpose) to prepair it for the next step 6.- Perform independent FFTs on the rows (cffts) 7.- Transpose the resulting matrix The code requires nested Parallelism.
标签： iterations performs Bailey number
上传时间： 2014-01-05
上传用户：libenshu01
QuickSteps books are recipe books for computer users. They answer the question 揌ow do I...??by providing a quick set of steps to accomplish the most common tasks with a particular program. The sets of steps are the central focus of the book. Sidebar QuickSteps provide information on how to do quickly many small functions or tasks that are in support of the primary functions. Sidebar QuickFacts supply information that you need to know about a subject. Notes, Tips, and Cautions augment the steps, but they are presented in a separate column to not interrupt the fl ow. Brief introductions are present, but there is minimal narrative otherwise. Many illustrations and fi gures, a number with callouts, are also included where they support the steps.
标签： books QuickSteps computer question
上传时间： 2013-12-11
上传用户：ljt101007
NN Functions a program in Lisp to demonstrate working of an artificial neuron. (Enter an input vector X and weight vector W. Calculate weighted sum XW. Transform this using signal or activation functions like logistic, threshold, hyperbolic-tangent, linear, exponential, sigmoid or some other functions (syntax provided) and display the output).
标签： demonstrate artificial Functions program
上传时间： 2013-12-30
上传用户：hfmm633
This control is another extension to the now standard and widely used ListView control. I have included some of the more common features: shaded columns, column sorting (with data type), but the real addition is the FILTERBAR features of the header. This implementation eliminates all of the work of dealing with the filter messages and item filtering by incorporating it into the control. This could have been implemented as delegates, but we create controls to do the work for us, don t we? I would like to thank Carlos H. Perez since a lot of the implementation came from examples he set with his ListViewEx control.
标签： control extension ListView standard
上传时间： 2013-12-05
上传用户：royzhangsz
Implementation of Edmonds Karp algorithm that calculates maxFlow of graph. Input: For each test case, the first line contains the number of vertices (n) and the number of arcs (m). Then, there exist m lines, one for each arc (source vertex, ending vertex and arc weight, separated by a space). The nodes are numbered from 1 to n. The node 1 and node n should be in different sets. There are no more than 30 arcs and 15 nodes. The arc weights vary between 1 and 1 000 000. Output: The output is a single line for each case, with the corresponding minimum size cut. Example: Input: 7 11 1 2 3 1 4 3 2 3 4 3 1 3 3 4 1 3 5 2 4 6 6 4 5 2 5 2 1 5 7 1 6 7 9 Output: 5
标签： Implementation calculates algorithm Edmonds
上传时间： 2014-01-04
上传用户：kiklkook
在图形中若于个边(edge)上加上一些值，此数值称为比重( weight ) 。而此图形称为比重图形(Weight Graph ) ，若weight是成本( cost )或距离( distance ) ，则称此图形为网路( Network )。根据Spanning Tree的定义，知一个图形可有许多不同spanning tree ，在network中找出一个具有最小成本( Cost )的Spanning tree ，则此Spanning tree称为最小成本生成树。
上传时间： 2013-12-28
上传用户：Shaikh
