/* Check_SST_39VF400A Check manufacturer and device ID /* CFI_Query CFI Query Entry/Exit command sequence /* Erase_One_Sector Erase a sector of 2048 words /* Erase_One_Block Erase a block of 32K words /* Erase_Entire_Chip Erase the contents of the entire chip /* Program_One_Word Alter data in one word /* Program_One_Sector Alter data in 2048 word sector /* Program_One_Block Alter data in 32K word block
标签： manufacturer Check_SST CFI_Query command
上传时间： 2013-12-15
上传用户：jjj0202
support vector classification machine ％ soft margin ％ uses "kernel.m" ％ ％ xtrain: (Ltrain,N) with Ltrain: number of points N: dimension ％ ytrain: (Ltrain,1) containing class labels (-1 or +1) ％ xrun: (Lrun,N) with Lrun: number of points N: dimension ％ atrain: alpha coefficients (from svcm_train on xtrain and ytrain) ％ btrain: offest coefficient (from svcm_train on xtrain and ytrain) ％ ％ ypred: predicted y (Lrun,1) containing class labels (-1 or +1) ％ margin: (signed) separation from the separating hyperplane (Lrun,1
标签： classification support machine Ltrain
上传时间： 2015-09-04
上传用户：问题问题
Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search main.cpp Then you can run it: ./search The input is loaded from a input file in.txt Here is the format of the input file: The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm. The second line of input file shoud be an integer m indicate the number of connections for the map. Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist. The following input are for A* The following line contains two chars indicate the source and destination city for A* algorithm. Then there is an integer h indicate the number of heuristic. The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.
标签： Implemented following compile command
上传时间： 2014-01-01
上传用户：lhc9102
Securing Apache 2: Step-by-Step When choosing a web server, Apache very often wins against its competitors because of stability, performance, that fact that it s open source, and many other advantages. But when deciding on which version of Apache to use, the choice is not always so simple. On the one hand there is a very popular, stable version used by millions of users, version 1.3, and on the other hand, there is an enhanced and re-designed version 2.0.
标签： Apache Step-by-Step Securing choosing
上传时间： 2015-09-06
上传用户：gundamwzc
很多java的小程序，适合初学者。 包括java，class文件还有部分package的应用。
上传时间： 2015-09-07
上传用户：朗朗乾坤
Hard-decision decoding scheme Codeword length (n) : 31 symbols. Message length (k) : 19 symbols. Error correction capability (t) : 6 symbols One symbol represents 5 bit. Uses GF(2^5) with primitive polynomial p(x) = X^5 X^2 + 1 Generator polynomial, g(x) = a^15 a^21*X + a^6*X^2 + a^15*X^3 + a^25*X^4 + a^17*X^5 + a^18*X^6 + a^30*X^7 + a^20*X^8 + a^23*X^9 + a^27*X^10 + a^24*X^11 + X^12. Note: a = alpha, primitive element in GF(2^5) and a^i is root of g(x) for i = 19, 20, ..., 30. Uses Verilog description with synthesizable RTL modelling. Consists of 5 main blocks: SC (Syndrome Computation), KES (Key Equation Solver), CSEE (Chien Search and Error Evaluator), Controller and FIFO Register.
标签： symbols length Hard-decision Codeword
上传时间： 2014-07-08
上传用户：曹云鹏
自定义一个简单的日期类DateType，它具有数据成员y、m、d，用来表示当前日期的年、月、日。而后设计该类欲实现（完成）的功能，进而设计出相应的类成员函数。 例如，下面给出的“雏形”可用来实现对天的增加，比较两个日期是否相等，以及对日期的输出等操作。请完成各类成员函数，并编制主函数，说明DateType类对象，对定义的各成员函数进行调用，以验证它们的正确性。 class DateType { //自定义的日期类DateType int y,m,d //数据成员，表示当前日期的年、月、日 public: DateType(int y0=1, int m0=1, int d0=1) //构造函数，设定年、月、日；并设置参数默认值 void incrementDay() //增加1天 bool equal(DateType dt2) //判断二日期是否相等 void printDate() //屏幕输出日期对象的有关数据（年、月、日） }
上传时间： 2013-12-22
上传用户：songyue1991
1.kruscal_CDT: 在Eclipse里面的CDT和MinGW(提供gcc)的环境下所编写的。 2.kruscal_VC2005: 在VC2005里面编写的。 3.以上两个的代码有点不同,区别主要在于compare函数 4.kruscal算法里面，我有两个不同的实现，一个是最小化堆里面放EdgeNode的指针，一个是最小化堆里面放EdgeNode的Object实例。前者使用了compare函数来比较大小，后者则是在EdgeNode的class里面重载运算符。
标签： 2005 kruscal_CDT kruscal_VC Eclipse
上传时间： 2013-12-19
上传用户：稀世之宝039
Problem Statement You are given a string input. You are to find the longest substring of input such that the reversal of the substring is also a substring of input. In case of a tie, return the string that occurs earliest in input. Definition Class: ReverseSubstring Method: findReversed Parameters: string Returns: string Method signature: string findReversed(string input) (be sure your method is public) Notes The substring and its reversal may overlap partially or completely. The entire original string is itself a valid substring (see example 4). Constraints input will contain between 1 and 50 characters, inclusive. Each character of input will be an uppercase letter ( A - Z ). Examples 0) "XBCDEFYWFEDCBZ" Returns: "BCDEF" We see that the reverse of BCDEF is FEDCB, which appears later in the string. 1)
上传时间： 2015-09-21
上传用户：sunjet
3维的球形体心立方图，class可以用鼠标旋转，非常方便
标签： 3维
上传时间： 2014-01-05
上传用户：lo25643
