牛顿

实现数学中的warshall算法，既完成对传递闭包的求解-To achieve in mathematics warshall algorithm, both to complete the transitive closure of the solution

 采用MFC建立框架，可以对条形码进行扫描，相同则可通过，不同就不能正确通过扫描

介绍了二分法求解非线性方程的算法，欢迎大家提出宝贵意见。-Introduced the dichotomy of the algorithm for solving nonlinear equations, welcome you to give valuable advice.

应用背景On the Design of ZF and MMSE Tomlinson-Harashima Precoding in Multiuser MIMO Amplify-and-Forward Relay System,it is main described the mimo system in the multi-user  scenario.the main precoding algrithm is combined the zf precoding and the MMSE precoding.关键技术we design a zero-forcing (ZF) Tomlinson-Harashima precoding (THP) and a minimum mean square error (MMSE) THP for multiuser MIMO relay system with direct link. Based on these precoding structures, we propose the optimal combining weights of the ZF THP and the MMSE THP in half duplex relay system, and the sub-optimal weights of MMSE THP to reduce feedback channel state information(CSI). Through the Monte Carlo simulation, we verify that the optimal weights combining method outperforms the constant weights combining method. In addition, we confirm that the performance of the sub-optimal weights combining method is&

基本矩阵运算 : + - *, power, transpose, trace, determinant, minor, matrix of minor, cofactor, matrix of cofactor, adjoint, inverse, gauss, gaussjordan, linear transformation, LU decomposition , Gram-Schmidt process, similarity. b) Basic vectors functions : norm, distance, innerproduct,coldim, rowdim, rank, nullity. *-basic matrix calculation :-*, power, transpose, trace, determinant, minor, matrix of minor, cofactor, the matrix of cofactor, adjoint, inverse, Gauss, gaussjordan, linear transformation, LU decomposition, Gram-Schmidt process, the similarity. B ) Basic vectors functions : norm, distance, innerproduct, coldim, rowdim, rank, nullity.*

本代码演示了马走日棋盘搜索算法。-demonstration of the code Ma days away chessboard search algorithm.

资源描述世界上最著名的多旋翼姿态滤波算法，包含源代码和PDF原理说明、使用说明

Gryphon is a Java-based computational fluid dynamics code written to solve the quasi 1-D Euler equations.

我使用该区域提取从 chr10 基因组和基因组样品 36bp 读取 ； 基因组的读取的计数也遵循泊松分布。所有处理基因组的方法是在它。

用BP网络完成函数的逼近源程序- Completes the function with the BP network to approach the source program