LVDS开发文档,好用的工具书,大家都可以下载

代码阅读方法与实践，希腊Diomidis Spinellis著，赵学良译-Code Reading: The Open Source Perspective，By Diomidis Spinellis

该文章介绍了支持向量机在图书馆建设中的应用和研究-The article introduces the support vector machine in the library building in the application and research

CSharp参考 CSS2参考 正则表达式系统教程 ADO参考-CSharp reference CSS2 reference regular expression system reference guide ADO

本资料是与彭国论编写的fortran95编程一书中相对应的所有源程序-This information is prepared with the Peng fortran95 programming on a book that corresponds to all the source code

北大青鸟内部教程,很难得,我希望能提供给想要的人,多努力把, 这个是第二年下学期的教程-Beida Jade Bird-house tutorials, it is difficult to get, I hope I have provided to those who want more and strive to, this is the second year of the curriculum next semester

arccatalog帮助文档-arccatalog using help。。。。。。。。。。。。。。。。。。。。

这些技术文章不是原创，均是本人从网上逐一收集来的，作品及出处一般文章里面都有，因为是自己重新整理的，所以不能保证有所疏漏；也有一小部分是自己在论坛里的问答！-these technologies is not original article, I will be collected from the Internet to each of the entries and the provenance of the article inside is generally because of their readjustments, there are no guarantees some omissions; There is also a small part of a forum in the quiz!

A*（A-Star)算法是一种静态路网中求解最短路最有效的方法。 公式表示为： f(n)=g(n)+h(n), 其中f(n) 是节点n从初始点到目标点的估价函数， g(n) 是在状态空间中从初始节点到n节点的实际代价， h(n)是从n到目标节点最佳路径的估计代价。 -A* (A-Star) algorithm is a static network shortest path in solving the most effective way. Formula is expressed as: f (n) = g (n)+ H (n), in which f (n) is a node n from the initial point to the target point of the valuation function, g (n) in state space from the initial node to node n of the actual cost, h (n) from n to the target node of the estimated cost of the best path.

Struts2・0API参考手册开发指南

基于非负矩阵分解算法进行盲信号分离-based on non-negative matrix factorization algorithm for Blind Signal Separation