Code

说明：  局部阴影下的最大功率点追踪，实现mppt功能(Maximum power point tracking under local shadow to achieve MPPT function)

采用生死单元技术模拟焊接动态过程的ansys源程序-With life and death cell technology, dynamic process simulation of welding source of ansys

PHLILPS RC500 读写函数原代码 -PHLILPS RC500 original code reader function

2004年重写的甲虫2拼图游戏，仍然使用VB编写。甲虫2的定位仍然是MiniGame，以第一版为蓝本重新编写了代码，用时一天，不包含测试。操作除保留上一代的键盘方向键（←↑↓→）外，更加入鼠标支持。游戏规则仍旧是将玩家自选的凌乱图片复原到原貌。可作为VB编写拼图游戏的一个范本来参考。

能在MDT5/6环境下对已经存在地曲面进行全部和局部区域展开，同时能进行源曲面和展开平面上点和线地相互映射-in MDT5/6 right environment to surface already exists for all regional and local begin and can be the source for surface and start Plane dots and lines to the mutual mapping

A book named Matlab/Simulink for power system , writted by YuQun.

Addressbook using double-linked list. This example shows the use of a double-linked list by implementing an addressbook for the console. It has features like inserting, searching(linear), sorting(bubble sort), deleting and load/save to a file. I wrote this during my study of Applied Computer Science so it s intended mainly for students who want to know about some advanced programming techniques in C. The Code was compiled with MSVC++ 6.0 but it should compile with any ANSI-compliant compiler.

胞映射程序，可以用来计算胞映射方法，matlab编写(Cell mapping program)

说明：  STM32初级教程16课时，掌握软件技巧，实现快速入门开发，(STM32 Primary Course, Quick Start Development.)

1. There are at least 10 nodes in the simulation and each node has at least two neighbors within its transmission area. 2. Every node periodically broadcasts a ”request” packet to its neighbors. Meantime, this node sets a timer with t time interval to wait for its neighbors ”re- sponse” packets. When receiving all responses from its neighbors during t, it prints ”success”; oth- erwise, it prints ”failure”. Assume that the broadcast periodical interval is bigger than t. 3. A neighbor that receives a ”request” packet, sends a ”response” packet after a random time τ , τ = random(0, 2t).(There are at least 10 nodes in the simulation and each node has at least two neighbors within its transmission area. Every node periodically broadcasts a request packet to its neighbors. Meantime, this node sets a timer with t time interval to wait for its neighbors response packets. When receiving all responses from its neighbors during t, it prints success oth- erwise, it prints failure. Assume that the broadcast periodical interval is bigger than t.)