自动俄罗斯方块，能够自己消行，消行达到15000左右，但有些还待改进...

一个乘法表的简单示例-a simple multiplication table Example

此小程序可以根据IP地址，查询到它的机器的归属地！-This small program can be the basis of IP addresses, inquiries to its attribution to the machine!

HOLA MUNDO EN FORTRAN，独奏干草 QUE COMPILAR EN CUALQUIER 编辑器 DE FORTRAN 崖 INCLUYE EJECUTABLE 段 ABIR Y EJECUTAR

大约有10种排序方法，如堆排序、快速排序、归并排序、插入排序、外壳排序、选择排序、早泡排序、线性排序、地址选择排序和基排序。我自己提出了一种简化的快速排序。-about 10 species of sequencing methods, such as heap sort, quick sort, merge, in order to insert sequencing, shell sort, select, in order of ranking as foam, linear ordering, sequencing and address choice-based ranking. I propose a simplified Quick Sort.

一款埃及学生用Matlab编的的基于PSO的PID整定程序，使用方法详见程序注释。-Tunning of PID controllerusing Bacterial Foraging Orientec by Particle swarm optimization My work hasbeen accpepted in GECCO 2008 as Graduat Student workshop. I have used thistechique in PID tunning and i got better result thatn BG and PSO Author: WaelMansour (wael192@yahoo.com) MSc Student, Electrical Enginering Dept, Faculty ofEngineering Cairo University, Egypt

约瑟夫问题的一种描述是：编号为1，2，…，n的n个人按顺时针方向围坐一圈，没人持有一个密码。一开始人选一个正整数作为报数上限值m，从第一个人开始按顺时针自1开始报数，报到m是停止报数。报m的人出列，将他的密码作为新的m值，从他在顺时针方向上的下一个人开始重新从1报数，如此下去，直至所有人全部出列为止。-a description of the problem is : No. 1, 2, ..., n n clockwise direction by individuals sitting around a circle, no one holding a password. One person started as a positive integer limits on the number of reported m, from the first individuals to embark on the clockwise from a few reportedly started, the report m is reportedly stopped a few. M reported out of the list of his password as a new value m, from a clockwise direction in the next re-started from a newspaper a few, like that, until the total of all listed so far.

STM32F103 设备使用皮质 M3 核心，72 MHz 的最大 CPU 速度。投资组合涵盖了从 16 千字节数到 1 Mb 的闪存与电机控制外围设备，USB 全速接口和罐头。

进行模糊控制逻辑运算，输入为误差和误差变化率，采用三角形隶属函数进行模糊化，采用最大最小法进行模糊推理，采用重心法进行去模糊化。

关于矩阵的运算算法-on matrix arithmetic algorithm

本算法主要针对声卡的声压进行测量并换算成相应的声压级，如A计权，B计权，可以直接在Matlab中进行调用计算