并行随机数生成方法

1.进行一系列的 experimentsto 确定图像的对比度如何影响性能的 harris，，然后再培养理念如何，您可能会自动确定图像内容 parametertH。具体来说，解释在自述文件中，你学到了从你关于图像对比度对哈里斯探测器性能的影响的实验。然后还实现对原哈里斯检测器代码进行修改并创建自动确定根据 imagecontent 改性的哈里斯 detectormodified_harris_detector.java。方法确定参数时，parametercontrast 是低于 10，放火了 10000 的门槛。当参数 contrastis 30 岁以上，我将阈值设置为 40000。< 跨风格 ="字体-大小： 10.5 p t; 字体系列：""> 当参数是 10 和 30 之间，我将阈值设置为 20000。

用matlab求解的一个Lagrange插值多项式问题-Using matlab to solve the problem of a Lagrange interpolation polynomial

A source code of function which convert image from RGB scale - space into normalized RGB scale - space, using Visual C++ 2008 and OpenCV library. Normalized RGB scale - space can be used in color detection techniques, because this is independent of illuminance change.

计算两个日期间的天数差-calculate the day interval between two datetime value

此代码可用于打破数字。它的一个例子： 让说，用户输入"561365"作为输入，现在程序将放置在数组中的每个位数的这一数字。所以以后你可以做任何需要使用此 number 位数的操纵。

应用背景The MOEA Framework is a free and open source Java library for developing and experimenting with multiobjective evolutionary algorithms (MOEAs) and other general-purpose multiobjective optimization algorithms. The MOEA Framework supports genetic algorithms, differential evolution, particle swarm optimization, genetic programming, grammatical evolution, and more. A number of algorithms are provided out-of-the-box, including NSGA-II, NSGA-III, ε-MOEA, GDE3 and MOEA/D. In addition, the MOEA Framework provides the tools necessary to rapidly design, develop, execute and statistically test optimization algorithms.关键技术Its key features includes:   * Fast, reliable implementations of many state-of-the-art algorithms   * Extensible with custom algorithms, problems and operators   * Supports master-slave, island-model, and hybrid parallelization &n

It s a simple Parser That calculates mathematic operations.You give an input and it starts the calculation by showing you the parsing operation in real-time.

包含 排序，堆，二叉树，二进制，括号匹配，简易word，四则运算，银行叫号系统等 编程实例  有利于初学者进行学习

三角形网格划分器-triangular mesh device

一个模拟游戏中最短路径的算法 从一个点,到另一个点的最短路径,中间可以设置障碍 看是如果绕过障碍获得最短路径