搜索资源列表
sum
- code segment assume cs:code sum_p proc near jcxz exit add ax,cx dec cx call sum_p exit: ret sum_p endp start: mov ax,2000h mov ds,ax mov ax,0 mov si,0 mov cx,7 call sum_p mov [si]
Bezier1
- 可调整控制点位置的Bezier曲线生成.在控制点附近按下右键并拖动可以调整曲线形状。-adjustable control the location of Bezier curve generation. The control point near the press right and drag curve shape can be adjusted.
myself
- this a linear near map old
DportV1
- The next generation of display interface. It will replace HDMI/DVI/VGA etc. in near future.
1c
- We rigorously analyze the dispersion function and the curvature of the dispersion surface of a photonic crystal to explore the fundamental limit of its angular sensitivities. With insight gained from group theory, we
2e
- We have used phase-sensitive ultrashort-pulse interferometry to study the modifi cation of optical pulse propagation near the photonic band edges in colloidal crystals consisting of polystyrene spheres in water.
fresnel
- near field localization
H265_2008_8_23
- ZPAV (H.265) is audio-visual codec protocol, very different from H264/MPEG4, ZPAV (H.265) basic algorithm is wavelets, SPIHT, BSW, MMW, ...... ZPAV (H.265) basic algorithm : 1, analysis/synthesis : wavelet
MSDN-UI-dotnetui2
- 提供了类似MSDN的停靠与构架的MFC类 其功能接近完美。-provide a similar call MSDN with the architecture of its functional category MFC near perfect.
h.264的源代码
- 无线通信压缩协议h.264算法的源代码，是刚提出来不久的一种基于无线通信的压缩协议-wireless communications agreement h.264 compression algorithm source code is just made to a near-based wireless communications compression agreement
二维最近点
- 该程序实现对二维数据轴上的最临近点的求解问题 采用方法：分治方法-procedures to achieve the two-dimensional data of the axis points near the methodology used to solve the problem : the administration
一维最近点（分治法）1
- 该程序实现对一维数据轴上的最临近点的求解问题 采用方法：分治方法1（该方法在递归时由于使用数组的值，使得递归进栈的数据很多，消耗系统空间很大，所以处理的个数经测试不超过70个，可见在设计程序时，考虑空间的使用也是很必要的！）-the process of achieving a dimensional data axis near the point of the methodology used to solve the proble
一维最近点（分治法）2
- 该程序实现对一维数据轴上的最临近点的求解问题 采用方法：分治方法(找出中位数,两边递归）-the process of achieving a dimensional data axis near the point of the methodology used to solve the problem : the administration (to identify the median on both sides, the re
一维最近点（传统法）1
- 该程序实现对一维数据轴上的最临近点的求解问题 采用方法：计算每对顶点间的距离，比较之 效率为O(n2)-the process of achieving a dimensional data axis near the point of the methodology used to solve the problem : for each pair of vertices the distance, a comparison of t
一维最近点（传统法）2
- 该程序实现对一维数据轴上的最临近点的求解问题 采用方法：传统方法2:先排序，然后一次线性扫描，得到最近距离，时间复杂性O（nlogn）-the process of achieving a dimensional data axis near the point of the methodology used to solve the problem : The traditional two methods : first order
功能齐全的单片机音乐程序
- 单片机最小系统，两位LED数码管由串口输出接两个164驱动，Lout,Rout为左右声道输出，SET， ALT0， ALT1为三个按键，也可自己在开始的I/O定义改成你想用的I/O口；12M晶振若用89C51则只可装下约14首歌曲，用89C52则可装下近40曲-smallest SCM system, two LED digital serial output from the pipe then two 164-driven, Lou
走近 STL
- 走进stl的内容,介绍了stl的各种功能.请各位-Near to the content of STL,introduce all kinds of function,please look through.
离散牛顿法
- 解非线性方程组的一种方法：先用一种优化方法将给定初值（它有可能会使得后续的牛顿法发散）通过一条比较快的途径收敛到精确解附近，得到一个新的初始点，然后再通过牛顿法将新的初始点迭代到精确解（一定的误差范围内）。这种方法的优点在于：它可以将牛顿法快速收敛的优势发挥出来，同时又避免了该方法收敛域比较窄的缺点。-solving nonlinear equations in a way : by using a method of optimizi
2-1
- bookshop目录是JSP页面文件 WEB-INF中是编译之后的bookshop包,系统用到的bean，用此目录覆盖Root下的web-inf即可。 ------------------------------------------------ 在IE中输入：http://localhost:8080/bookshop/ 系统测试用户名见登录框附近 数据库用户名/密码： root/（空） 若需要修改数据库密码，请修改WEB-INF\
本网站为编程资源及源代码搜集、介绍的搜索网站，版权归原作者所有！ 沪ICP备09016508号
1999-2046 源码中国 All Rights Reserved.