L297 应用文档 讲述L297 和L298 配合 作步进电机的细分

设T[0:n-1]是n个元素的一个数组。对任一元素x，设S(x)={i|T[i]=x}。当|S(x)|>n/2时，称x为T的主元素。设计一个线性时间算法，确定T[0:n]是否有一个主元素。-Set T [0: n-1] is the n elements of an array. Of any element x, set S (x) = (i | T [i] = x). When | S (x) |> n/2 when x for T said the main element. Design a linear time algorithm to determine the T [0: n] whether there is a main element.

一些经典的VC源代码（5）

c语言用顶点数做的浮点运算，java封装了一下-vertices do with the floating-point operations, a little java Packaging

控件动态生成，可以按照用户要求大小生成。开发者只要扩展一下，完全可以自定义动态生成控件。-controls dynamically generated, according to the size of user requirements generation. Developers as long as the expansion that can dynamically generated from the definition of control.

该程序实现简单  操作容易  处理起来比较方便   实用性强   相信会有很大帮助对我们   呵呵。

用C++实现视力表的程序，很不错的哦-C realization of the vision chart procedures, very good oh! !

获得一些系统信息例子-been some examples of system information

for： Root of a Polynomial --- --- --- --- -- Time Limit: 1 Second Memory Limit: 32768 KB -------------------------------------------------------------------------------- A polynomial of degree n has the common form as . Your task is to write a function to find a root of a given polynomial in a given interval. Format of function double Polynomial_Root(int n, double c[], double a, double b, double EPS) where int n is the degree of the polynomial double c[] is an array of n +1 coefficients , , ..., , and of the given polynomial double a and b are the two end-points of the given interval and double EPS is the accuracy of the root. The function must return the root. Note: It is guaranteed that a unique real number r exists in the given interval such that p(r) = 0. -for: Root of a Polynomial---------------------- Time Limit: 1 Second Memory Limit: 32768 KB-------------------------------------------------------------------------------- A polynomi

WPF图片切换效果 canvas,image等切换 20+ 种效果 翻页百叶窗 等3D效果

根据原始彩色图和对应的深度图，通过DIBR合成方法得到立体图片。首先对深度图像进行形态学处理，以减少视点变换产生的空洞，平滑目标视点内部的物体轮廓；利用视点变换方程生成目标视点；对含有空洞的目标视点采用图像修复算法进行后处理，设计了含有深度项的代价函数，在深度的约束下进行纹理搜索，将最佳匹配块填补到空洞；在修复空洞的过程中采用亮度优先的策略以适应不同的色度采样格式。