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
