graph_in_3d

32 bit FFT implementation

calculates the shortest path and distance between two nodes on a map

2016年数学建模-A 系泊系统设计中的第二问详细解答程序(Mathematical Modeling 2016-A Mooring System Design)

游戏的过程应该是一部分棋子“主动”去翻转，另一部分可以通过其周围的棋子来“被动”翻转。而每一个棋子的状态逻辑值根据引言可知只有翻转和不翻转两种状态(不必考虑多次翻转的情况)，因此可以用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.)

称它为“驱动程序超级宝典“一点也不过分，因为它是被译为中文的MSDN DDK文档。这个文档不是我翻译的，我只不过将它编辑了一下。翻译它的同志是个高手，非常专业，在此先谢谢他给我们作的工作。 ( Called it is "the driver super precious book" not excessively, because it is translated for Chinese MSDN the DDK documents. This documents are not I translate, I only have edited it. Translates it comrade is a master, extremely specialized, first thanks him in this the work which does to us. )

java实现的坦克大战游戏源码，学习javaa游戏源码编程与开发的能参考参考。 可直接使用。 (Battle City game source code, implemented in Java learning javaa game source programming and development can refer to the reference. Can be used directly.)

说明：  STSK系统仿真，使用BPSK/QPSK调制(STSK system simulation using BPSK/QPSK modulation)

此.txt 包含完整的源代码的 frame2d.frm，将转换为.txt 文件。 Frame2d 是一个示例 （示例 8.2 要具体） 问题 介绍的有限元方法在工程 (第三版) by Tirupathi R.Chandrupatla 和阿肖克 D.Belegundu . 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报

图书馆管理系统，里面都有提示！ 登陆页是：/adminLogin.aspx 默认管理帐号/密码：51aspx/51aspx 普通用户帐号/密码：test/51aspx DB_51aspx下为数据库文件，附加即可

方程计算器 一元一次，一元二次，二元一次皆可，自动报错。 (One dollar equation calculator, a quadratic, binary one can be, automatic error.)