scriptManual_en_v3.5

关于JESS的教程-tutorials on JESS

说明：  游戏的过程应该是一部分棋子“主动”去翻转，另一部分可以通过其周围的棋子来“被动”翻转。而每一个棋子的状态逻辑值根据引言可知只有翻转和不翻转两种状态(不必考虑多次翻转的情况)，因此可以用0和1来表示。一次翻转操作相当于五个相关单元的逻辑值取反。(The process of the game should be one part of the chess pieces "active" to flip, and the other part can be "passive" to flip through the chess pieces around them. According to the introduction, the logical value of the state of each chess piece can be expressed as 0 and 1, because there are only two states: flip and non-flip (without considering the situation of multiple flips). A flip operation is equivalent to the logical value reversal of five related units.)

使用重心法来计算光斑的中心，方法简单易懂，并附有光斑图一张。(The center of the spot is calculated using the center of gravity method)

Convert .H C++ headers to ASM .INC

CSAPP PPTCSAPP PPTCSAPP PPT

编写编译程序实现多行表达式的表达式序列的文法语言的编译执行(To write the compiler to achieve the expression sequence of multi-line expression grammar language compiler execution )

说明：  轨道电路移频信号是用来控制列车的行驶状态．对其参数的检测需要达到较高的频率分辨率，分析了国产18信息和ZPW一2000型两种制式移频轨道电路的移频信号的频谱特点，提出r采用CZT线性调频z变换和时域测量相结合的方法检测移频信号的参数。在MATLAB环境下编写CZT算法进行仿真，仿真结果表明。(Track circuit frequency-shift signal is used to control the train operation, and the parameter detection should achieve high frequency resolution requirements. According to the sampling theorem knowledge, we know that it needs longer sampling time. In order to attain high frequency resolution in a relatively short period of sampling time, the paper analyzed the spectrum characteristics of the frequency-shift signaling in the two formats track circuit. At last, we compiled CZT algorithm in the MATLAB environment.)

说明：  粒子群算法，也称粒子群优化算法或鸟群觅食算法（Particle Swarm Optimization），缩写为 PSO， 是由J. Kennedy和R. C. Eberhart等开发的一种新的进化算法(Evolutionary Algorithm - EA)。PSO 算法属于进化算法的一种，和模拟退火算法相似，它也是从随机解出发，通过迭代寻找最优解，它也是通过适应度来评价解的品质，但它比遗传算法规则更为简单，它没有遗传算法的“交叉”(Crossover) 和“变异”(Mutation) 操作，它通过追随当前搜索到的最优值来寻找全局最优。这种算法以其实现容易、精度高、收敛快等优点引起了学术界的重视，并且在解决实际问题中展示了其优越性。粒子群算法是一种并行算法(Particle Swarm Optimization (PSO), also known as Particle Swarm Optimization (PSO), is a new evolutionary algorithm developed by J. Kennedy and R. C. Eberhart. PSO is a kind of evolutionary algorithm, which is similar to simulated annealing algorithm. It starts from random solution and searches for the best solution by iteration. It also evaluates the quality of solution by fitness. But it is simpler than genetic algorithm rules. It has no Crossover and Mutation operation of genetic algorithm. As a result, it searches for global optimum by following the optimal value currently searched. This algorithm has attracted the attention of academia for its advantages of easy implementation, high accuracy and fast convergence, and has shown its superiority in solving practical problems. Particle swarm optimization is a parallel algorithm)

vc++的视频，用flash player播放，例如175其中17代表第17章，而5代表第17章的第5个视频(vc++ the video, use flash player to play, for example, 175 of which 17 on behalf of Chapter 17, and 5 on behalf of Chapter 17 of the first five video)

多态性实验，强烈建议大家来下载(Polymorphism of the experiment, we strongly recommend you to download)