MCA图像分解

工程应用中，往往会涉及到简单的排序算法，尤其是在采样过程中，一般都会先采集一定点的数据，然后进行排序，最终取中间的数据进行平均。

考试系统，选择题。用Java实现的多层BP神经网络，用于颜色和字符识别javaForManyLayerBp.z - 用Java实现的多层BP神经网络，用于颜色和字符识别-using Java multi-storey BP neural network, for the color and character recognition标签：Java, AI-NN-PR 评论：0条 添加评论基于web的动物识别系统，开发环境为Eclipse+Tomcat+MySQL。animal.rar - 基于web的动物识别系统，开发环境为Eclipse+Tomcat+MySQL。-Web-based animal identification system development environment for Eclipse+ Tomcat+ MySQL

三次样条插值函数的具体应用程序，主要应用于热敏电阻的温度和阻值之间的换算-Cubic spline interpolation function of the specific applications, mainly used in thermistor temperature and resistance of the conversion between

资源描述 PIXhawk飞控是3DR公司在APM飞控的基础上开发的PX4飞控后的改进版也就是第二版将PMU和PMIO合在一体的多旋翼固定翼以及车，船等航模车模开源控制系统 代码运行在STM32硬件上，内置RTOS系统Nuttx，pix飞控的前身是苏黎世理工大学创立，后SDR等公司成为其中一员。 本代码全部开源，包括硬件资源，详细信息请参考开源网站如下所示： http://pixhawk.org/start http://ardupilot.com/

xc836芯片控制带霍尔传感器直流无刷电机驱动程序，能够实现直流无刷电机的启动停止换向及pid调速等功能，对于直流无刷电机的研究入门人员有很大的帮助 

资源描述GD32F103 FOC无传感器代码，全部开放源代码可以方便移植到其他平台

POJ是北大在线测评系统这里有一些经典试题。跳蚤是一道经典试题代码给出了Accepted算法。

pdnMesh is an automatic mesh generator and solver for Finite Element problems. It will also do post-processing to generate contour plots and Postscript printouts. GUI support using GTK or MFC (Win32) is available. The problem definition can be done in any form and given to pdnMesh as an input data file. Drawing Exchange Format (DXF) files can be directly imported to pdnmesh. The quality and the coarseness of the mesh can be controlled by giving input parameters.

这是对一维时间序列进行归一化计算的matlab程序-This is the one-dimensional time series to a calculation procedure of Matlab

旅行商问题，即TSP问题（Travelling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 -Traveling Salesman Problem, or TSP problem (Travelling Salesman Problem) is a well-known field of mathematics problems. Assuming there is a travel business to visit n cities, he must choose which path to go, via the restriction is to visit each city only once and the last to go back to the original departure city. Path selection objective is to get the path distance for all paths are the minimum.