Search - a-w - CodeBus

Search - a-w - List

[source in ebook] 程序设计实践 DL : 0: 本书是Brian W. Kernighan和Rob Pike合著的最新力作。本书从排错、测试、性能、可移植性、设计、界面、风格和记法等方面，讨论了程序设计中实际的、又是非常深刻和具有广泛意义的思想、技术和方法，它的翻译出版将填补国内目前这方面书籍的空白。本书值得每个梦想并努力使自己成为优秀程序员的人参考，值得每个计算机专业的学生和计算机工作者阅读，也可作为程序设计高级课程的教材或参考书。-the book is Brian W. Kernighan and Rob Pike co-authored the latest masterpieces. The book from debugging, testing, performance, portability, design, interface and style, and the law in mind, the discussion of the actual design process, but we were very deep and broad significance of the idea that technology and methods, it will be translated and published fill current gaps in the area of books. The book is worth every dream and strive to become a good programmer reference, it is worth every computer professional students reading and computer workers, as well as procedures for the design of advanced courses or teaching reference books.
Date : 2025-12-29 Size : 8.57mb User : 石争辉
[source in ebook] SingleSelectRadioButtonInDataGrid DL : 0: This article helps in creating a Data Grid with radio button and allows single selection.-This article helps in creating a Data Grid w praxiology radio button and allows single selection.
Date : 2025-12-29 Size : 2kb User : ally
[source in ebook] Floyd-Warshall-c-chengxi DL : 0: Floyd-Warshall算法描述 1)适用范围： a)APSP(All Pairs Shortest Paths) b)稠密图效果最佳 c)边权可正可负 2)算法描述： a)初始化：dis[u,v]=w[u,v] b)For k:=1 to n For i:=1 to n For j:=1 to n If dis[i,j]>dis[i,k]+dis[k,j] Then Dis[I,j]:=dis[I,k]+dis[k,j] c)算法结束：dis即为所有点对的最短路径矩阵 3)算法小结：此算法简单有效，由于三重循环结构紧凑，对于稠密图，效率要高于执行|V|次Dijkstra算法。时间复杂度O(n^3)。考虑下列变形：如(I,j)∈E则dis[I,j]初始为1,else初始为0，这样的Floyd算法最后的最短路径矩阵即成为一个判断I,j是否有通路的矩阵。更简单的，我们可以把dis设成boolean类型，则每次可以用“dis[I,j]:=dis[I,j]or(dis[I,k]and dis[k,j])”来代替算法描述中的蓝色部分，可以更直观地得到I,j的连通情况。 -err
Date : 2025-12-29 Size : 3kb User : 江晨
[source in ebook] ehTETQ8h DL : 0: 自己照TTCP写的一个测试网络的程序还不完善不过这个功能是可以实现的里面是源代码+说明+程序感兴趣的朋友可以试下也希望给我提出建议说明：类似于ping命令的的发包程序需要两台电脑因为是用UDP做的不是ICMP 格式： xyz -p -n 100 -w 100 -l 1000 192.168.1.1 -p 代表ping 还有其他功能的不过目前都没做 -n 代表发包个数 -l 代表包的大小是多少字节简单的格式就是 xyz -p 192.168.1.1 其他参数是可以随便加的需要两台电脑一台发一台收另一台写 xyz -r 就可以了 -A simple tool for sending packet
Date : 2025-12-29 Size : 41kb User : zyg
[source in ebook] lpc_01 DL : 0: The main m-file to be executed is myLPC.m file. The file that contains all calculations is lpc_01.m file, that is a function which returns reconstructed speech signal with LPC-16 coding. Observing Spectrogram of both signals is very instructive and shows that Reconstructed signal from LPC coding has some periodic (with respect to w) signals appearing in it s Spectrogram.
Date : 2025-12-29 Size : 1kb User : jayran
[source in ebook] heshsi DL : 0: 有一些可能的符号K, A, N, C, E, p, q, r, s, t 。一个合式公式是符合以下条件的字符串： • p, q, r, s, 和t 是合式公式 • 如果w 是合式公式，Nw 是合式公式 • 如果w 和x 是合式公式，Kwx, Awx, Cwx, 和Ewx 是合式公式。-There are some of the possible symbols K, A, N, C, E, P, Q, R, S T. A well-formed formula is a string that meets the following conditions: • The p, q, r, s, and t is the well-formed formulas • If w is formed formulas, Nw formed formulas • If w and x is formed formulas Kwx Awx, Cwx The and Ewx formed formulas.
Date : 2025-12-29 Size : 3kb User : wuzhiqiang
[source in ebook] TCPIP-SOCKETS-IN-C DL : 0: C语言的TCP/IP编程书籍，初学者的指导用书，"This book fills a void in the area of networking education. ... an excellent companion to traditional networking textbooks ..." -- Ellen W. Zegura, Georgia Institute of Technology-"This book fills a void in the area of networking education. ... an excellent companion to traditional networking textbooks ..."-- Ellen W. Zegura, Georgia Institute of Technology
Date : 2025-12-29 Size : 6.03mb User : 风
[source in ebook] KFFT DL : 0: 计算离散傅里叶变换的一种快速算法，简称FFT。快速傅里叶变换是1965年由J.W.库利和T.W.图基提出的。采用这种算法能使计算机计算离散傅里叶变换所需要的乘法次数大为减少，特别是被变换的抽样点数N越多，FFT算法计算量的节省就越显著。-A computing discrete Fourier transform fast algorithm, referred to as FFT. Fast Fourier Transform in 1965 by the JW Cooley and TW Tuji Ti out. Using this algorithm enables a computer to calculate the number of multiplications needed for the discrete Fourier transform greatly reduced, especially sampling points N is transformed more and save FFT algorithm to calculate the amount of the more remarkable.
Date : 2025-12-29 Size : 1kb User : 冯短