zyp

可以进行简单的数学运算：加、减、乘、除,sin(),cos(),tan()等，还可以对数字进行取余和开方的运算。但仅限于十进制下，还可以进行数的正、负之间的相互转换，exit表示退出, clear表示初始化，有一个 TextField用于显示传来的计算结果；Server端用于监听连接请求、计算发送过来的两数的和、送回数据结果。(Can perform simple arithmetic: add, subtract, multiply, divide, sin (), cos (), tan (), etc. can also figure to take over and prescribing arithmetic. But only under the metric system can also be used for a number of positive and negative between the conversion, exit, said exit, clear that the initialization, there is a TextField to display the results from the calculation Server client connection requests for eavesdropping, calculated sent the two and the number of returned data.)

最小二乘递推算法及其matlab实现（计算估计值）(least squares method)

说明：  利用matlab伪谱法实现火箭发射最优控制(Optimal control of rocket launching based on MATLAB pseudospectral method)

细梁的振动，无量纲振动控制方程关于梁的动力响应(Beam power with applications from mechanical aerospace electrical and civil engineering free vibration nondimendional frequency coefficients on the dynamic behaviour of the beam)

考普森教授在这本书中，使用经典的分析方法，给出了严谨的一阶和二阶线性偏微分方程理论方面的知识。(in this book， professor copson gives a rigorous account of the theory of partial differential equations of the first order and of linear partial differential equations of the second order， using the methods of classical analysis.)

通过完整ansys命令流，模拟分析悬索桥变形。希望对学习ansys有限元及桥梁工程的技术人员有所帮助。(无)

复化求积公式计算定积分 包括 复化梯形 复化辛普森 等(complexification quadrature formula to calculate definite integration)

Description 设a[0…n-1]是一个包含n个数的数组，若在i<j的情况下，有a[i]>a[j]，则称(i, j)为a数组的一个逆序对（inversion）。 比如 <2,3,8,6,1> 有5个逆序对。请采用类似“合并排序算法”的分治思路以O(nlogn)的效率来实现逆序对的统计。 一个n个元素序列的逆序对个数由三部分构成： （1）它的左半部分逆序对的个数，（2）加上右半部分逆序对的个数，（3）再加上左半部分元素大于右半部分元素的数量。 其中前两部分（1）和（2）由递归来实现。要保证算法最后效率O(nlogn)，第三部分（3）应该如何实现？ 此题请勿采用O(n^2)的简单枚举算法来实现。 并思考如下问题： （1）怎样的数组含有最多的逆序对？最多的又是多少个呢？ （2）插入排序的运行时间和数组中逆序对的个数有关系吗？什么关系？ 输入格式 第一行：n，表示接下来要输入n个元素，n不超过10000。 第二行：n个元素序列。 输出格式 逆序对的个数。 输入样例 5 2 3 8 6 1 输出样例 5(Set a[0... N-1] is a n array containing n numbers. If there is a [i] > a [j] i n the case of I < j, then (i, j) is a n inversion pair of a array. For example, <2,3,8,6,1> has five reverse pairs. Please use the idea of "merge sorting algorithm" to achieve the statistics of inverse pairs with O (nlogn) efficiency. The number of inverse pairs of a sequence of n elements consists of three parts: (1) The number of reverse pairs in the left half, (2) the number of reverse pairs in the right half, (3) the number of elements in the left half is greater than that in the right half. The first two parts (1) and (2) are implemented by recursion. To ensure the final efficiency of the algorithm O (nlogn), how should the third part (3) be implemented? Do not use O (n ^ 2) simple enumeration algorithm to solve this problem.)

正交变换源程序，带vc工程。 学习正交变换算法的有力工具。(Orthogonal transformation source code, with vc works. Orthogonal transformation algorithm to learn a powerful tool.)

清华大学研究生精品课程《钢筋混凝土有限元》教学程序 随动双线性硬化本构模型 (Tsinghua University Graduate Courses " reinforced concrete finite element" teaching program follower bilinear hardening constitutive model)