This driver is based on the 2.6.3 version of drivers/usb/usb-skeleton.c but has been rewritten to be easy to read and use, as no locks are now needed anymore.
标签： usb-skeleton rewritten drivers version
上传时间： 2015-11-20
上传用户：talenthn
Abstract The Lucene Server project is an attempt to extend the Jakarta Lucene tool with server capabilities. Lucene is a robust Java API that enables you creating indexes from text sources and perform powerful searches on these indexes. With Lucene, creating an index must be done programmatically and there are almost no possibilities of integrating index management in a distributed environment. In other words, out of the box, Lucene is suitable for integrating indexing and searching possibilities in a single application but not for providing index/search services for multiple applications. The Lucene Server project comes with a Java API that propose the following make it easy to create indexes in a declarative way by simply providing an XML configuration document. make it easy to personalize the way Lucene must handle different kind of data sources. provide services for index management and searching that can be accessed from several applications. enable batch tasks scheduling.
标签： Lucene Abstract Jakarta project
上传时间： 2016-01-10
上传用户：songrui
jSP编写的了BBS系统 架設方法 : 解壓縮dzbbs.zip後，打開dzbbs/set.jsp,修改以下 try{ cn=DriverManager.getConnection("jdbc:mysql://localhost/mysql?useUnicode=true&characterEncoding=big5","root","pass") // mysql為資料庫名稱，root 為用戶帳號 , pass為用戶密碼 }catch(Exception e){ } String bbs_name="DzBBS" //論壇名稱 String temple="default" //風格模版 String adminpass="pass" //管理員密碼 設定好後運行http://user.net/dzbbs，然後再注冊成為會員即可，密碼需要和上面所設定的一樣 免費論壇空間推荐 MyJavaServer+db4free 完美組合 MyJavaServer是國外免費5mb空間 如何申請請看 http://blog.csdn.net/leafxx/archive/2006/10/02/1317960.aspx db4free是國外免費Mysql空間
上传时间： 2013-12-10
上传用户：yimoney
考验你的观察力和判断力的时候到了，挑战自己，就在狗口脱险。 游戏说明: 游戏规则为在牙齿咬到小怪物以前找到牙齿中的缺牙处，逃避灭顶之灾，左右方向键对应左右操作，赶快行动吧。 按键说明: f1~f4为游戏模式选择. F1:记分模式,过关加500分，死亡一次减250分，在没找到缺口之前一直扣分。 F2：过关模式，只有一次机会，挑战者的选择。 F3：连续模式，记分规则同记分模式,死亡时不用找缺牙。 F4：极限模式，未完成。 左右方向键对应左右操作，回车为重新开始。 easy OutofMouth.exe 最低难度。 normal OutofMouth.exe 普通难度，7颗牙。 8 OutofMouth.exe 8 颗牙。 10 OutofMouth.exe 10 颗牙。 15 OutofMouth.exe 15 颗牙。 19 OutofMouth.exe 最高难度，19 颗牙。
标签：
上传时间： 2016-01-24
上传用户：xuanchangri
图像处理，利用bilt 函数 Description: This example shows how to edit (cut,paste,copy) a selection of a bitmap using BitBlt function just like Microsoft Photo Editor does. It s really EASY! Take a look to the sample if you don t believe me and don t forget to VOTE FOR ME! Note: comments are in italian...i hadn t enough time to translate them all. Sorry..(VOTE!)
标签： 图像处理
上传时间： 2013-12-18
上传用户：851197153
Solving Engineering Problems Using MATLAB C++ Math Library Introduction In the previous article, we studied how can use MATLAB C API to solve engineering problems. In this article I will show you how can use MATLAB C++ math library. The MATLAB® C++ Math Library serves two separate constituencies: MATLAB programmers seeking more speed or complete independence from interpreted MATLAB, and C++ programmers who need a fast, easy-to-use matrix math library. To each, it offers distinct advantages.
标签： Introduction Engineering Problems previous
上传时间： 2014-12-02
上传用户：13160677563
As all of you know, MATLAB is a powerful engineering language. Because of some limitation, some tasks take very long time to proceed. Also MATLAB is an interpreter not a compiler. For this reason, executing a MATLAB program (m file) is time consuming. For solving this problem, Mathworks provides us C Math Library or in common language, MATLAB API. A developer can employ these APIs to solve engineering problems very fast and easy. This article is about how can use these APIs.
标签： some engineering limitation language
上传时间： 2013-12-06
上传用户：huql11633
How the K-mean Cluster work Step 1. Begin with a decision the value of k = number of clusters Step 2. Put any initial partition that classifies the data into k clusters. You may assign the training samples randomly, or systematically as the following: Take the first k training sample as single-element clusters Assign each of the remaining (N-k) training sample to the cluster with the nearest centroid. After each assignment, recomputed the centroid of the gaining cluster. Step 3 . Take each sample in sequence and compute its distance from the centroid of each of the clusters. If a sample is not currently in the cluster with the closest centroid, switch this sample to that cluster and update the centroid of the cluster gaining the new sample and the cluster losing the sample. Step 4 . Repeat step 3 until convergence is achieved, that is until a pass through the training sample causes no new assignments.
标签： the decision clusters Cluster
上传时间： 2013-12-21
上传用户：gxmm
精确测试，并保存easy&great try it!
标签： 测试
上传时间： 2016-02-08
上传用户：集美慧
LPC2100专用工程模板,在ADS1.2下使用，周立功EASY ARM开发套件中必备模板。
上传时间： 2016-02-12
上传用户：shawvi
