2Dforce-based-non-prismatic-element

工程数学，积分变换，南京工学院数学教研组，内容包括傅立叶技术展开与拉普拉斯变换两大部分内容。(Engineering mathematics, integral transformation, Nanjing Institute of Technology mathematics teaching and research, including Fourier and Laplace transform technique to expand two parts content.)

同时辨识模型阶次及参数算法。用阶次递推算法，结合AIC法——利用赤池信息准则辨识上例的模型阶次和参数。(At the same time identify model order and parameters algorithm. By order recursive algorithm, combined with AIC method- the use of Akaike information criterion to identify the cases of the model order and parameters.)

改程序可用于绘制热加工图，用于热加工领域(It is a code using for making hot processing maps used to characterize the hot deformation behavior)

可以实现十几位整数的四则运算，效率也较好(Four operations can be more than a dozen integer,and the efficiency is better)

算术编码是用符号的概率和它的编码间隔两俩个基本参数来描述的。算术编码可以是静态的或是自适应的。(Arithmetic coding to both of two basic parameters to describe the probability of the symbol and its coding interval. Arithmetic coding can be static or adaptive.)

matlab计算码头堆场集装箱的操作，集卡，场桥，岸桥(matlab container)

说明：  Description 设a[0…n-1]是一个包含n个数的数组，若在ia[j]，则称(i, j)为a数组的一个逆序对（inversion）。 比如 有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, 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.)

三次样条曲线拟合代码，先训练，后差值，计算非常准确(Three times spline curve fitting, the first training, and after, computation is very accurate)

Fundamentals of matrix computations 矩阵运算的基础(Fundamentals of matrix computations)

根据分好的单元，进行有限元分析。计算每个单元中四个高斯点的应力，应变，主应力以及位移。(According to sub-good unit, finite element analysis. Calculated for each unit in the four Gauss point stress, strain, principal stresses and displacements.)