ATMEL AT89C51SND1 IDE TO USB READER
上传时间： 2014-01-30
上传用户：tzl1975
Liferea is an abbreviation for Linux Feed Reader. It is a news aggregator for online news feeds. It supports a number of different feed formats including RSS/RDF, CDF and Atom. There are many other news readers available, but these others are not available for Linux or require many extra libraries to be installed. Liferea tries to fill this gap by creating a fast, easy to use, easy to install news aggregator for GTK/GNOME. It was last updated for Liferea version 1.4.
标签： news abbreviation aggregator for
上传时间： 2016-12-05
上传用户：luopoguixiong
Problem B:Longest Ordered Subsequence A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where 1 <= i1 < i2 < ... < iK <= N. For example, sequence (1, 7, 3, 5, 9, 4, 8) has ordered subsequences, e. g., (1, 7), (3, 4, 8) and many others. All longest ordered subsequences are of length 4, e. g., (1, 3, 5, 8).
标签： Subsequence sequence Problem Longest
上传时间： 2016-12-08
上传用户：busterman
sovling TSP(Travelling Salesman Problem) with GAs
标签： Travelling Salesman sovling Problem
上传时间： 2014-01-10
上传用户：youmo81
TSP问题（Travelling Salesman Problem）是数学领域中著名问题之一,旅行商的VC算法实现
标签： Travelling Salesman Problem TSP
上传时间： 2014-08-02
上传用户：hjshhyy
We address the problem of predicting a word from previous words in a sample of text. In particular, we discuss n-gram models based on classes of words. We also discuss several statistical algorithms for assigning words to classes based on the frequency of their co-occurrence with other words. We find that we are able to extract classes that have the flavor of either syntactically based groupings or semantically based groupings, depending on the nature of the underlying statistics.
标签： predicting particular previous address
上传时间： 2016-12-26
上传用户：xfbs821
RFID中rc500的读写程序。Firmware for MFRC500 Demo Serial Reader
标签： 500 Firmware Serial Reader
上传时间： 2013-12-18
上传用户：waizhang
int main(int argc,char *argv[]) { char ch while(true) { printf("*************************************\n") printf(" 1.Reader Priority\n") printf(" 2.Writer Priority\n") printf(" 3.Exit to Windows\n") printf("*************************************\n") printf("Enter your choice(1,2,3): ") do{ ch=(char)_getch() }while(ch!= 1 &&ch!= 2 &&ch!= 3 ) system("cls") if(ch== 3 ) return 0 else if(ch== 1 ) ReaderPriority("thread.dat") else WriterPriority("thread.dat") printf("\nPress Any Key to Coutinue:") _getch() system("cls") } return 0
上传时间： 2017-01-06
上传用户：gonuiln
Java I/O操作，字节流InputStream和OutputStream，字符流Reader和Writer，Java I/O库的设计原则，字符集的编码，RandomAccessFile类，管道流，对象的序列化。
上传时间： 2014-01-16
上传用户：Shaikh
using NVIDIA FFT CUDA Library to solve FFT problem
标签： FFT Library problem NVIDIA
上传时间： 2014-01-24
上传用户：duoshen1989
