IHS

The travelling salesman problem (TSP) or travelling salesperson problem asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.

digital signal processing lab programs according to some universities

说明：  这是马尔科夫链预测的一个非常好的例子，值得大家学习与借鉴。(This is a very good example of Markov chain prediction, which is worth learning and using for reference.)

显示进程列表，PID等相关信息，是初识windows进程编程的好材料(list shows the process, PID, and other relevant information, recognize the windows of the programming process good materials)

Discrete-Event Modeling and Simulation: A Practitioner s Approach By Gabriel A. Wainer

基于虚拟现实技术创建的仿人机器人双臂协调研究平台。(Based on virtual reality technology to create a humanoid robot arm coordinate research platform.)

its a paper about compression

making admitance matrix

认知无线电中关于频谱感知的相关知识以及源程序(Knowledge on spectrum sensing in cognitive radio as well as source)

本书提供 matlab 环境下的各种命令，包括详细的参数介绍。(book Matlab environment under the various orders, including the detailed parameters introduced.)