机器学习实战

说明：  讲解了如何三维视觉的一些介绍，包括如何理解坐标变换。(Some introductions on how to use three-dimensional vision, including how to understand coordinate transformation, are explained.)

本文详细介绍了一类重要的方程-福克普朗克方程，是一本针对研究生的好书(This paper describes an important class of equations- Fokker-Planck equation, is a good book for graduate students)

文本挖掘道在分类，聚类上的应用。包含理论与实例。英文影印版。(Application for text mining on classification and clustering, including theory and examples.)

复杂网络的英文书籍，对于研究复杂网络的科研人员具有一定的参考价值。(English books in complex networks have a certain reference value for researchers studying complex networks.)

主要描述了MIMO-OFDM系统中的各项技术的介绍以及仿真代码，比如分集技术，无线信道模型、信道估计等。(This paper mainly describes the introduction of various technologies and simulation codes in mimo-ofdm system, such as diversity technology, wireless channel model, channel estimation, etc.)

How to work with Computer Tomography scans.

gwt in practice 的英文原版电子书(gwt in practice of the English original e-books)

雷达对抗原理-该ppt详细地介绍了雷达电子战原理，详细地介绍了雷达各种干扰的形成机理以及对抗方法(Radar principle Zhao Guoqing)

说明：  模糊数学+变分法+Matlab基础教程,是一个通俗易懂的教材(Variational method of fuzzy mathematics++ Matlab-based tutorial is a user-friendly materials)

说明：  本书示例丰富,图文并茂,以简明易懂的方式阐释了算法,旨在帮助程序员在日常项目中更好地利用 算法为软件开发助力。前三章介绍算法基础,包括二分查找、大 O 表示法、两种基本的数据结构以及递归 等。余下的篇幅将主要介绍应用广泛的算法,具体内容包括 :面对具体问题时的解决技巧,比如何时采用 贪婪算法或动态规划 ;散列表的应用 ;图算法 ;K 最近邻算法。 本书适合所有程序员、计算机专业相关师生以及对算法感兴趣的读者(This book is rich in examples and illustrates algorithms in a concise and easy-to-understand way. It aims to help programmers make better use of algorithms in daily projects to help software development. The first three chapters introduce the basic algorithms, including binary search, large O representation, two basic data structures and recursion. The rest of the paper will focus on the widely used algorithms, including: when to use greedy algorithm or dynamic programming, hash table application, graph algorithm, K nearest neighbor algorithm when facing specific problems. This book is suitable for all programmers, computer-related teachers and students, and readers interested in algorithms.)