In each step the LZSS algorithm sends either a character or a <position, length> pair. Among these, perhaps character "e" appears more frequently than "x", and a <position, length> pair of length 3 might be commoner than one of length 18, say. Thus, if we encode the more frequent in fewer bits and the less frequent in more bits, the total length of the encoded text will be diminished. This consideration suggests that we use Huffman or arithmetic coding, preferably of adaptive kind, along with LZSS.
标签： algorithm character position either
上传时间： 2014-01-27
上传用户：wang0123456789
The Kannel Open Source WAP and SMS gateway works as both an SMS gateway, for implementing keyword based services via GSM text messages, and a WAP gateway, via UDP. The SMS part is fairly mature, the WAP part is early in its development. In this release, the GET request for WML pages and WMLScript files via HTTP works, including compilation for WML and WMLScript to binary forms. Only the data call bearer (UDP) is supported, not SMS.
标签： gateway implementing SMS keyword
上传时间： 2014-01-11
上传用户：2525775
java写的局域网广播系统．本软件包括2个部分：局域网广播系统——服务端，局域网广播系统——接收端，服务端是通过网络连接，与一些固定的计算机相连形成局域网进行彼此间的信息发送，实现通信功能。可以发送计算机中存储的文本文件，只对以文本文挡（text）上文字进行识别；接收端是通过网络连接，在指定的局域网中接收固定计算机播放的消息。
上传时间： 2015-03-29
上传用户：tuilp1a
关于tts语音引擎的使用方法!很多软件具有英文发音和朗读功能，它们都使用了MSTTS（Microsoft Text To Speech）技术。微软遵照COM的标准，提供了一套Speech API来对MSTTS进行编程。要在程序中使用这套API，必须确保系统已经安装了MSTTS和Spchapi软件包。 Speech API可以作为类型库引用到Delphi中，方法是：打开Project选单下的Import Type Litrary，点击“Add”加入Windows\Speech目录下的Vtxauto.tlb文件，在Delphi的Import目录中就会生成VTxtAuto—TLB.pas文件，其中定义了VTxtAuto—TLB单元，把它加到Uses成员中来。设计如图2所示的窗口，定义全局变量： var VoTxt：IVTxtAuto 然后在Form的OnCreate事件中加入： VoTxt：=CoVTxtAuto_.Create VoTxt.Register(′′,′Speech Test′) {注册} “Read”按钮代码为： VoTxt.Speak(Memo1.Lines.Text,10) {朗读} “Stop”按钮代码为： VoTxt.StopSpeaking {停止朗读} 至此，应用程序已具有朗读功能，10表示使用普通语气。借住VoTxt的属性和方法，我们还可以控制阅读速度和语气，实现暂停、跳句等功能，Speech API编程就这么简单。
上传时间： 2014-01-21
上传用户：13681659100
Contains a complete archiver by Haruhiko Okumura. The archiver uses an LZ engine whose output is compressed with static Huffman. The file is chopped into pieces which all get their own independent set of Huffman tree s. ARJ 2.41, ZIP 2.0 and PKZIP 2.04g use essentially the same method. ZOO and LHA even use excactly the same method.
标签： archiver Contains complete Haruhiko
上传时间： 2014-01-17
上传用户：himbly
The GRLIB IP Library is an integrated set of reusable IP cores, designed for system-on-chip (SOC) development. The IP cores are centered around the common on-chip bus, and use a coherent method for simulation and synthesis. The library is vendor independent, with support for different CAD tools and target technologies. A unique plug&play method is used to configure and connect the IP cores without the need to modify any global resources.
标签： system-on-chip integrated designed reusable
上传时间： 2013-12-20
上传用户：小眼睛LSL
ICA can be used in brain activation studies to reduce the number of dimension and filter out independent and interesting activations. This demonstration shows two studies. One provided by Hvidovre Universitets Hospital, Denmark, that consists of fMRI scannings of humans. Another provided by the EU sponsored MAPAWAMO project from fMRI scannings of monkeys. In the demo comparison between icaMS, icaML, icaMF, icaMF (positive sources) and PCA can be made. More detailes can found in [2].
标签： activation dimension studies indepen
上传时间： 2015-04-19
上传用户：zukfu
The Molgedey and Schuster decorrelation algorithm, having square mixing matrix and no noise . Truncation is used for the time shifted matrix, and it is forced to be symmetric . The delay Tau is estimated . The number of independent components are calculated using Bayes Information Criterion (BIC), with PCA for dimension reduction.
标签： decorrelation and algorithm Molgedey
上传时间： 2013-12-13
上传用户：c12228
这用java语言模拟一个银行的操作系统，main-class:run 图形界面模式：加参数-graphic 文字模式：加参数-text Client.txt存放客户信息 Compte.txt存放账户信息 Operation.txt账号使用信息 这个版本是法语版的
上传时间： 2015-05-09
上传用户：hzy5825468
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
