sensores

能合并梦幻西游WAS文件，可以合成动画很好用(Can merge Fantasy Westward WAS file)

说明：  两路ADC+DMA,stm32f103,双通道采集(ADC+DMA,stm32f103,2adc)

说明：  ABAQUS 损伤实例，非常实用的教程，适合于初学者。(ABAQUS. adj;lng;la jlah; jiang shang alhgln;glna;lg)

说明：  机械滑台工艺流程控制系统设计,PLC-200(Design of Process Control System for Mechanical SliderPLC200)

船舶运动控制，PID控制算法,反步积分控制器(PID controller ,ship ,motion)

这本书很可能让你以为又是一个科学幻想，可能你会说，同类的东西已经看得太多了。 因此，你现在也许会错过这本书，但是，将来你一定会拼命去找这本书，而那时就太晚了。 我的同事告诉我，她看过一个关于超级智能机器的影片。一开始，它们随意屠杀人类。我问她，影片后来结局是什么？她说，机器人被人类感动了，成了人类的朋友。于是我再问她，人类会被蚊子感动吗？会和岩石成为朋友吗？想象远远不及真实！于是，她陷入了沉思…… 一般的科幻片中描述的人工智能机器，它们虽然在很多方面强于人类，但是，总体和人类的差距不大，大致也就是人类和狗的差距。那么，它们最后被人类感动，会和人类成为朋友是很合理的。就像人类会被狗感动，和狗成为朋友一样。但是，那也许只是20或者40年后的智能机器的情况。 不远的将来，人工智能机器的智能将是人类的万亿个万亿倍，它们面对我们，并不像我们面对狗，而是如同我们面对蚊子、跳蚤甚至岩石，当它们消灭我们的时候，如同我们将蚊子拍死，将臭虫冲进下水道，谁会在消灭跳蚤的时候觉得这样太残忍了呢？！ 这也许是人类逃脱不了的宿命，也是德·加里斯教授认为有责任写这本书，我们认为有责任出版这本科学伦理图书的原因。(This book is likely to make you think it is a science fiction, perhaps you may say, the same thing has seen too many. Therefore, you may now miss this book, but in the future you will be hard to find this book, and then it s too late. My colleague told me that she saw a movie about super-intelligent machines. Beginning, they are free to slaughter humans. I asked her later what the ending movie? She said that the robot touched by humans, became the friend of mankind. So I ask her, touched by humans by mosquitoes do? Council and rocks become friends? Imagine far less true! So she mused... A general description of science fiction artificial intelligence machines, although in many respects they are stronger than humans, however, little difference between the overall and humans, which is roughly the gap between humans and dogs. Well, they finally touched by humans, and humans will become friends is very reasonable. Just like humans dogs will be moved, and the dog became friends. But that)

说明：  This is the postgraduate course, numerical analysis course design, 7 topics of matlab code.

IDL code from NASA IDL program collection mainly for SPACE SCIENCE

分治法思想，求最邻近点对，考虑将所给的n个点的集合S分成2个子集S1和S2，每个子集中约有n/2个点，然后在每个子集中递归地求其最接近的点对(Divide and conquer ideas, find the nearest point to consider given the set S of n points into two subsets S1 and S2, each subset of about n/2 points, and then recursively find its focus in each sub-the closest point)

FTCS scheme for three-dimensional Navier-Stokes equations