Library of C functions that allows a program to use WinSock 2 functionality if it is available or fall back to WinSock 1.1 if it isn t.
标签： functionality functions available Library
上传时间： 2015-01-18
上传用户：LIKE
MP3播放器： 利用API函数[mciSendString]可以轻松实现MP3音乐文件的播放。下面这段程序实现了MP3播放的大部分常规操作，对其稍加修改，做一个100KB大小的MP3播放器轻而易举 启动VB程序，在窗体上放置6个命令按钮，三个标签，一个公用对话框、一个进度条、一个状态栏和一个计时器，窗本的布置请参考附图 按钮"Open MP3 File"是用来打开对话框选择MP3文件，其他5个按钮分别为Play(播放)、Pause(暂停)、Stopplay(停止播放)、back(向后跳跃)、Prew(向前跳跃)。Label1用来表示歌曲当前时间；label2放在时度条的最左边，Caption属性为"00：00"；lable3放在时度条的右边，用来表示歌曲总长。
标签： MP3 mciSendString API 播放
上传时间： 2014-11-12
上传用户：silenthink
华为 Quidway 系列多协议路由器，支持 PPP、FR、X25、SLIP、HDLC 等网络协议，用户可通过各种广域网线路接入 Internet 及互联互访。 路由器内置安全防火墙、NAT、RADIUS 安全认证，以及 CALL back 等多项互联安全防护功能；并通过 CA 认证协议的验证和 IPSec 隧道协议，在 Internet 上构建安全可靠的网络通道，基于硬件的数据加密，将保密数据加密后在隧道上传输，加密数据有可靠的保密性但牺牲了效率；非保密数据可以通过一般性安全处理在隧道上传输，保证较高的转发速率。硬件加密的算法采用专门的芯片（经过国家相关部门批准）进行加密，密钥长度大于 128 位，并提供高强度的一次一密功能。配合完全自主知识产权的软硬件平台，提供网络的安全互联和数据的安全传输的安全解决方案。 而 "备份中心"的可靠性备份解决方案，实现多种线路之间的任意备份和业务分担，为网络提供业界最坚固的保护屏障，保证网络的可靠运行。
上传时间： 2013-12-05
上传用户：zsjinju
This code implements the basic functions for an I2C slave device using the SSP module. All I2C functions are handled in an ISR. Bytes written to the slave are stored in a buffer. After a number of bytes have been written, the master device can then read the bytes back from the buffer.
标签： implements I2C functions the
上传时间： 2015-04-02
上传用户：邶刖
Copyright© 2004 Sergiu Dumitriu, Marta Gî rdea, Că tă lin Hriţ cu Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation with no Invariant Sections, no Front-Cover Texts, and no back-Cover Texts. A copy of the license is included in the section entitled "GNU Free Documentation License" All brand names, product names, or trademarks belong to their respective holders.
标签： Permission Copyright 259 Dumitriu
上传时间： 2015-04-02
上传用户：jackgao
OXCC is a multipass, interpreting C compiler with several language extensions. It generates an Architecture Neutral Format (ANF) output and comes with a couple of example back ends. Programmers are expected to write additional back ends for their specific needs.
标签： interpreting extensions generates multipass
上传时间： 2015-04-12
上传用户：大三三
呵呵，交大网络作业；可靠的数据传输，go back to N；呵呵，错过了就可惜了
标签：
上传时间： 2015-04-19
上传用户：zhuoying119
刚才兴起试用了一下opera的语音控制功能，插上mic，在opera的语音控制里面选择性别，点确定就可以用了。 对着mic，并按下语音控制键，说出back，opera果然后退了一页，哈哈！以后连手都不用了。靠嘴就成。 不过这E文的发音可要好好锻炼一下了。
上传时间： 2015-05-10
上传用户：tonyshao
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.
标签： least-squares unconstrained Statisti Applied
上传时间： 2015-05-14
上传用户：aig85
Although there has been a lot of AVL tree libraries available now, nearly all of them are meant to work in the random access memory(RAM). Some of them do provide some mechanism for dumping the whole tree into a file and loading it back to the memory in order to make data in that tree persistent. It serves well when there s just small amount of data. When the tree is somewhat bigger, the dumping/loading process could take a lengthy time and makes your mission-critical program less efficient. How about an AVL tree that can directly use the disk for data storage ? If there s something like that, we won t need to read through the whole tree in order to pick up just a little bit imformation(a node), but read only the sectors that are neccssary for locating a certain node and the sectors in which that node lies. This is my initial motivation for writing a storage-media independent AVL Tree. However, as you step forth, you would find that it not only works fine with disks but also fine with memorys, too.
标签： available libraries Although nearly
上传时间： 2014-01-22
上传用户：zhoujunzhen
