系统工程中的平滑预测法，根据一些数据预测为了某一个时期的数值...

资源描述已知两个已经排好序（非减序）的序列X和Y，其中X的长度为m，Y长度为n， 现在请你用分治算法，找出X和Y的第k小的数，算法时间复杂度为O(max{logm, logn})。 此题请勿采用将序列X和Y合并找第k小的O(m+n)的一般方法，要充分利用X和Y已经排好序的这一特性。 输入格式 第一行有三个数，分别是长度m、长度n和k，中间空格相连（1

A code for generating Cartesian grids (multigrid version).

A simple and fast implementation of a Kalman Filter.

本程序由kyungsang基姆制作。如果你有问题或问题，发送电子邮件到me.kssigari@gmail.complease试试这些测试步骤1。模拟器是用于测量投影。2。demo2是解析重建众所周知过滤backprojection3。Demo3 is the iterative reconstruction using the maximum likelihood expectation maximization (MLEM) method.nx: number of image pixels of x-directionny: number of image pixels of y-directionnz: number of image pixels of z-directionsx: real size (length) of x-axis of the image -> resolution of a pixel = sx/nxsx: real size (length) of y-axis of the image -> resolution of a pixel = sy/nysx: real size (length) of z-axis of the image -> resolution of a pixel = sz/nznu: number of detector pixels of x-direction (u)nv: number of detector pixels of z-direction (axial) (v)su: size of real (length) of detector u-direction -> resolution of a pixel = su/nusv: size of real (length) of detector v-direction -> resolution of a pixel = sv/nvDSD: distance between source to detectorDSO: distance between source to iso-center (image center).dir: rota

常微分方程组adams数值解法以及非线性方程的二分法解法-Adams Ordinary Differential Equations Numerical Solution of nonlinear equations as well as the dichotomy method

哈夫曼数的编码，译码和树的打印-The number of Huffman encoding, decoding and tree print

资源描述在opnet的仿真环境下基于RFID的防碰撞仿真算法，程序以及经过了测试，绝对好用，

采用有限元法计算半导体的带隙结构和波函数。-using the finite element method to calculate the bandgap semiconductor structure and the wave function.

用C＋＋实现的高斯混合模型的算法类，方差矩阵是对角矩阵-C++ Gaussian mixture model algorithm category, variance matrix is diagonal matrix

人工智能作业，用遗传算法实现的旅行商问题。-Artificial intelligence, operations, using the genetic algorithm traveling salesman problem.