分岔图程序

A jquery. mobile website demo with IOS style realizes image and text mixing similar to QQ space, and the login and registration interface is also very good. The drop-down refresh effect of jquery. mobile version is also very smooth.

JPDA实现程序,该程序是实现多目标跟踪环境下的核心(JPDA implementation process)

多种工况的碰撞预警算法文献，分为直线碰撞与侧面碰撞，不错的文献，一起学习(V2X collsion worming)

基于matlab软件的Ga-bagging-svm程序，包含算例data，编写规范，非常好用(Ga-bagging-svm program based on MATLAB software, including example data, compiling specifications, very useful)

说明：  Differential gray wolf optimization algorithm

该软件实现键盘锁定功能，当你暂时离开不想关机，但又不想让别人动你的电脑的时候可以试着用该软件-The software realize the keyboard lock feature, when you do not want to leave the country temporarily shut down, but do not want others to move the computer when you try to use the software

对于使用Allegro做Layout的同行们来说，使用Skill开发的各种各样的小工具无疑会及大地提高绘图效率，这里提供一款对齐工具，安装方法和使用方法在压缩包里有说明，欢迎使用。

旅行商问题(TravelingSalesmanProblem，TSP)是一个经典的组合优化问题。经典的TSP可以描述为：一个商品推销员要去若干个城市推销商品，该推销员从一个城市出发，需要经过所有城市后，回到出发地。应如何选择行进路线，以使总的行程最短。从图论的角度来看，该问题实质是在一个带权完全无向图中，找一个权值最小的Hamilton回路。由于该问题的可行解是所有顶点的全排列，随着顶点数的增加，会产生组合爆炸，它是一个NP完全问题。(Traveling Salesman Problem (TSP) is a classic combinatorial optimization problem. The classic TSP can be described as: a merchandiser sells goods to several cities. The salesman starts from a city and needs to go through all the cities and return to the starting point. How to choose the route of travel so that the total journey is the shortest. From the point of view of graph theory, the essence of the problem is to find a Hamilton loop with the smallest weight in a completely undirected graph with weights. Since the feasible solution to this problem is the full permutation of all vertices, as the number of vertices increases, a combinatorial explosion occurs, which is an NP-complete problem.)

可用于数字信号处理、离散卷积、有限差分正演模拟(It can be used in digital signal processing, discrete convolution and finite difference forward simulation.)

software interface between a pc keyboard and a PIC18 microchip uprocessor