image-source-method-old

利用混沌系统给图像加密，加密方法简单易懂，对初学者很好理解(Image encryption using chaotic systems ，encryption method is simple and easy to understand, good for beginners to understand)

说明：  利用bp算法对鸢尾花数据进行分类的matlab实现程序(Bp algorithm using iris data classification procedures to achieve matlab)

Numerical Optimization, interior points

Convert array to a text file that can use with LIBSVM library Convert LIBSVM file format to an array Disadv: does not work if missing values are present.

说明：  该代码主要实现matlab中脉冲压缩的仿真算法，主要用于初学者进行初步学习。(This code mainly realizes the simulation algorithm of pulse compression in MATLAB, which is mainly used for beginners to carry out preliminary learning.)

车牌自动识别，采用形态学方法，附带有测试图，适应性较强(Automatic license plate recognition, using morphology, with a test pattern, adaptability)

利用SVM进行多分类的matlab 程序，m文件(Multi classification by using SVM matlab program, the m file)

We consider the scheduling of simple linear deteriorating jobs on parallel machines a new perspective based on game theory. In scheduling, jobs are often controlled by independent and selfish agents, in which each agent tries to a machine for processing that optimizes its own payoff while ignoring the others. We formalize this situation as a game in which the players are job owners, the strategies are machines, and a player’s utility is inversely proportional to the total completion time of the machine selected by the agent. The price of anarchy is the ratio between the worst-case equilibrium makespan and the optimal makespan. In this paper, we design a game theoretic approximation algorithm Aand prove that it converges to a pure-strategy Nash equilibrium in a linear number of rounds. We also derive the upper bound on the price of anarchy of Aand further show that the ratio obtained by Ais tight. Finally, we analyze the time complexity of the proposed algorithm

Estimation of Tool Pose Based on Force–Density Correlation During Robotic Drilling

Very informative Artificial life simulation lectures at IIITA and sworn intelligence presentations at IIITA.