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
Class="tags">标签: Classification support machine Ltrain
Class="time">上传时间: 2015-09-04
Class="username">上传用户:问题问题
很多java的小程序,适合初学者。 包括java,Class文件还有部分package的应用。
Class="time">上传时间: 2015-09-07
Class="username">上传用户:朗朗乾坤
自定义一个简单的日期类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() //屏幕输出日期对象的有关数据(年、月、日) }
Class="time">上传时间: 2013-12-22
Class="username">上传用户:songyue1991
1.kruscal_CDT: 在Eclipse里面的CDT和MinGW(提供gcc)的环境下所编写的。 2.kruscal_VC2005: 在VC2005里面编写的。 3.以上两个的代码有点不同,区别主要在于compare函数 4.kruscal算法里面,我有两个不同的实现,一个是最小化堆里面放EdgeNode的指针,一个是最小化堆里面放EdgeNode的Object实例。前者使用了compare函数来比较大小,后者则是在EdgeNode的Class里面重载运算符。
Class="tags">标签: 2005 kruscal_CDT kruscal_VC Eclipse
Class="time">上传时间: 2013-12-19
Class="username">上传用户:稀世之宝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)
Class="tags">标签: input Statement You are
Class="time">上传时间: 2015-09-21
Class="username">上传用户:sunjet
3维的球形体心立方图,Class可以用鼠标旋转,非常方便
Class="tags">标签: 3维
Class="time">上传时间: 2014-01-05
Class="username">上传用户:lo25643
This a A* pathfinding example to illustrate how to implement a A* pathfinding algorithm into your program. It s a port from Patrick Lesters example in BlitzBasic to VB.Net. It uses a Binary Heap Class I made to sort the score values.
Class="tags">标签: pathfinding illustrate algorithm implement
Class="time">上传时间: 2013-12-25
Class="username">上传用户:shawvi
This prj demonstrates how to use the SROM memory Classes for the Dallas DS80C400. This example uses the memcpy function to copy a function in the SROM memory Class (which is located in CODE memory) to von Neumann mapped XDATA (starting at 0x110000) for execution.
Class="tags">标签: This demonstrates the Classes
Class="time">上传时间: 2013-12-22
Class="username">上传用户:tuilp1a
LISTVIEW + DATABASE PROGRAMMING FUNCTIONS IN A NUTSHELL This solution contains a ClassLibrary project and a WindowsApplication project. The Classlibrary project has only one Class which has almost all the necessary functions and subs one may need during programming with a listview.
Class="tags">标签: ClassLibrary PROGRAMMING FUNCTIONS LISTVIEW
Class="time">上传时间: 2014-01-12
Class="username">上传用户:zukfu
软件开发工程是有趣的、多产的,甚至是大胆的。同时,它也能源源不断地带来商业价值,并保持在我们的掌控之下。 极限编程(XP)的构思和发展是针对小型团队进行软件开发时,在面对不确知的、变化的需求时所产生的特定需要的。这一新的、轻量级的方法学对许多传统思维提出了挑战,这其中包括一个一直以来的假设,即在软件开发过程中,对软件进行一个小小的改动就必然会使其开发成本大大增加。极限编程认可软件开发工程应该节约成本,而且一旦实现了某种节约就应该加以开发利用。 你可以喜欢XP,也可以恨它,但是本书将会使你对如何开发软件有一个全新的认识。KentBeck拥有并经营着First Class软件公司,在这里他把主要精力放在两个最大的兴趣上——模式和极限编程。他一直在研究软件开发的先驱模式、CRC卡、HotDraw画图编辑器框架、xUnit单元测试框架以及测试为先的编程。他发表了五十多篇关于编程的文章,并出版了《The Smalltalk Best Practice Patterns》(Prentice-Hall出版社)和《Kent Beck’s Guide to Better Smalltalk:A Sorted Collection》(剑桥大学出版社)两本著作,同时他还是超级畅销书《重构——改善既有代码的设计》(中英文版皆由中国电力出版社出版)的特约撰稿人。
Class="time">上传时间: 2015-10-02
Class="username">上传用户:邶刖