freq_100M

说明：  用python编的爬虫小程序，希望大家喜欢，谢谢大家！(python internet reptile book)

卫星工具包（STK）的英文版说明及中文版教程(Satellite Toolkit (STK) in English and Chinese versions of tutorials that)

有限差分法，求解NS方程，对x，y不同方向进行离散(The finite difference method is used to solve the NS equation, and the X and y are discretized in different directions)

这是计算机网络的可后习题的答案，希望有大家用的着的地方！-This is the computer network can answer the questions after, we want to use the place!

本题编写程序模拟人进行连连看游戏，电脑模拟人玩连连看的过程如下： 1、分析本局游戏，将本局游戏转化成一个二位数组。0表示空白区域，数字表示该游戏牌为出现在游戏中的第几类游戏牌。 2、利用广度优先搜索算法，判断两个游戏牌是否可以消除。 3、程序模拟人点击可以消除的一对游戏牌进行消除。 对某局游戏转化成二维数组如下： 0 0 0 0 0 0 1 2 0 0 0 0 3 4 0 0 0 0 1 0 输入二位数组的行、列，二位数组、起始元素的的坐标、终止元素的坐标，判断起始游戏牌和终止游戏牌是否可以消除。 对上例输入 4 5 0 0 0 0 0 0 1 2 0 0 0 0 3 4 0 0 0 0 1 0 1 1 3 3 输出 TRUE(The writing program simulates the game, and the computer simulates the process of watching the game as follows: 1. Analyze the game and convert the game into a two - bit array. 0 is the blank area, the number indicates that the game card is the number of game cards that appear in the game. 2. Use the breadth first search algorithm to judge whether the two game cards can be eliminated. 3, the program simulates a pair of game cards that can be eliminated by clicking. A game of a game is transformed into a two-dimensional array as follows: 00000 01200 00340 00010 Input the row and column of the two bit array, the coordinates of two bit array, the initial element, and the coordinates of the termination elements, so as to determine whether the initial game card and the ending game card can be eliminated. For example input 45 0000001200 0034000010 11 33 Output TRUE)

Ajax JSP留言本实例，只是实现了基本的留言功能，主要是想表现Ajax在JSP中的应用，学习JSP环境中的Ajax技术，是一个范例程序。

使用软件matlab2014b，采用GUI设计的一个进制转换，能够使输入的任意十进制数转化为其他进制的数并输出(Using the software MATLAB 2014 B and a binary conversion designed by GUI, the input decimal number can be converted into other decimal numbers and output.)

matlab谐波源仿真，作APF电流检测以及控制所需(matlab Harmonic source simulation)

QM算法是用来最小化卡诺图的一个算法，其大概思路是，对蕴含项中1的个数进行分组，只有1的个数相差为1的蕴含项才可能相邻，所以可以通过循环来穷举出所有的主蕴含项。(The QM algorithm is an algorithm used to minimize the Kano map. The idea is that the number of 1 of the implying items is grouped and only 1 of the implication items with a difference of 1 may be adjacent, so that all the main implication items can be given out through the cycle.)

说明：  此程序是利用经纬度时间等信息，计算特定时间特定地点的太阳天顶角。(This program uses information such as latitude and longitude time to calculate the solar zenith angle at a specific location at a specific time.)