vmware-SIOC

fem nonlinear source code using weighted residuals

说明：  1.1 背包问题 有一个徒步旅行者，已知他能承受的旅行背包的重量不超过a（kg）。设有n种物品可供他选择装入背包，这n种物品分别编号为1，2，…，n。其中第i种物品每件的重量为ai（kg），其使用价值（指一件第i种物品对旅行者来说所带来的好处的一种数量指标）为ci（i＝1，2，…，n）。问这位旅行者应如何选择携带这n种物品的件数，使得总价值最大？ (1.1 knapsack problem is a hikers. he is known to travel to withstand the weight of the backpack not exceed a (kg). N Species with articles for his choice loaded backpack, n product were numbered 1, 2, ..., n. I first of which product each ai of the weight (kg), its value (i refers to a section of the types of items travelers the benefits brought by a number of indicators) for the ci (i = 1, 2, ..., n). Asked how travelers who choose to bring this product to the n pieces, making the total value of the largest?)

ACO for tsp. this file will be helpful in executing the code in Matlab in order to find TSP answer using ACO

桥梁桩基工后沉降计算程序，基于Mesri蠕变模型(Program for post-construction settlement of brige pile foundation)

Sample Important Resampling Particle Filter(SIR Particle Filter)

User Activity Monitoring program in POS Application.

这是一个决策树的matlab实现，已经测试通过(This is a matlab implementation of decision tree, have the test pass)

利用头脑风暴算法，求解cec——2017 benchmark，是史玉回老师的源代码进行的修改(brain storm algorithm)

定位算法中泰勒级数迭代，其是以最小二乘法为初值的算法(Taylor series iterative positioning algorithm, which is based on least squares algorithm for the initial value)

说明：  无线传感器网络路由算法，采用最短路径，先搜索节点的一跳范围的距离，再搜索两跳的距离，仿真效果良好。(Wireless sensor network routing algorithm, using the shortest path first jump of the scope of the search node distance, and then search for the two jump distance, simulation results were very good.)