搜索资源列表
BiTree
- 输入一个字符串，并建成一棵二叉树，满足左子树的字符都要小于根结点的字符，右字树的字符都要大于根结点的字符，每个结点值有字符和字符的出现次数，并用三种遍历方法打印，比较是否与自己想象的相一致。再求树的深度、叶子结点数、最大结点值。-Enter a string, and the completion of a binary tree, to meet the characters in the left subtree must be less than the root node of the
base64
- by mx30 (Coremail) with SMTP id UMCowKB76wTsL6pLACLYXw--.16680S2 Wed, 24 Mar 2010 23:29:48 +0800 (CST) Received: from SJSWT46-175.opi.com (SJSWT46-175.opi.com [10.3.18.175]) by TJSJHL212-13.opi.com (Postfix) with ESMTP id 1CB87168CEA for
s3c6410_minimal_rootfs
- S3C6410(ARM11) minimal root file system using uclibc.
BaseAutopanoramareserch
- 别对两幅图像提取广义特征点后， 利用基于根均方误差和交叉相关的两级匹配算法完成同名控制点的建立。并以局部加权直线拟合方法来校正图像 的几何畸变。最后建立两幅图像之间的函数映射关系，完成图像的配准。实验结果证明了该方法的有效性。-Do the two images extracted generalized characteristic point, the root mean square error-based and cross-correlation of the two cont
gabor
- The real and imaginary components of a complex Gabor filter are phase sensitive, i.e., as a consequence their response to a sinusoid is another sinusoid (see Figure 1.2). By getting the magnitude of the output (square root of the sum of squared
BinarySearchTree
- A binary search tree is a binary tree that is either empty or in which each node contains a key that satisfies the following conditions: 1) All keys (if any) in the left subtree of the root precede (are less than or equal to) the key of the
HM
- 二分法的计算程序，程序中的f为被积分的函数,程序的使用者可以自行修改，可以用来求复杂函数的近似根-Dichotomy of the calculation program, the program has been integral in the function f is, the user can modify the program can be used to find an approximate root of complex functions
branchandbound
- The basis of branch and bound algorithms is a ranking function. The ranking function assigns a value to each node in the graph. At each step, a branch and bound algorithm uses the ranking function to decide which node to expand next. In contrast, the
genguijifa
- 这个文件是关于根轨迹方法的，这个文件对于学习自动控制课程的同学很有帮助。-This file is on the root locus method, the file for the automatic control of the course students learn helpful.
Visual-Fortran2002
- 有数值计算中常用的Visual Fortran子过程近200个，内容包括：解线性代数方程组、插值、数值积分、特殊函数、函数逼近、随机数、排序、特征值问题、数据拟合、方程求根和非线性方程组求解、函数的极值和最优化、傅里叶变换谱方法、数据的统计描述、解常微分方程组、两点边值问题的解法和解偏微分方程组，每一个子程序都包括功能、方法、使用说明、子程序和例子五部分。本书的所有子过程都在Visual Fortran 5.0版本上进行过验证，程序都能正确运行。同时配书发行光盘，包括所有子过程、验证过程及所有验
XWKDD_insecure
- i9100 root 的文件，ROOT时候可以用到的东东。-i9100 root
jianshudianlutu
- 无线键盘、鼠标、接收器电路和源程序 全套文件设计及代码- CY4672 PRoC LP KBM RDK v1.00 The CD contains a self-extracting installer at the root of the CD: "Install_CY4672_RDK.exe" The CD also contains individual copies of all of the files contained
2003
- 管理功能 系统管理无线功能扩展 服务器设置问题-system,rootsystem,rootsystem rootsystem,rootsystem,rootsystem rootsystem,root
aic
- system at91 laset table root
FTC-FCS-against-CSImairments
- report on SDRE based control of a root.
calculater
- 根据Java中所学的图形用户界面，事件处理等知识编一个功能齐全的计算器,能够实现数字的加减乘除开方等功能-Digital addition and subtraction, multiplication and division and square root
pool
- 新增横向排名函数（股池专用） 新版专用DLL 名称 POOL.DLL 六个函数 POOL1 POOL2 POOL3 POOL4 POOL5 POOL6 每个函数可以支持同时一百个股池交集，六个函数最大能支持600个股池交集 。 但不是同一输出的交集，必须改变函数。 包内DLL放入大智慧根目录，包内有一个测试用股池，放入\dzh2\userdata\Pool\ 目录下 设计股池或运行股池就能看到效果。测试用股池仅仅是一个例子，帮助大家学会运用这些函数。 如：包内三个
java
- 计算器实现的功能包括加减乘除，开平方，求倒数，也实现了连续运算的的功能-Calculator implemented functions include addition, subtraction, multiplication and division, square root, reciprocal, and continuous operation
linux-Application-Development
- 本书全面介绍了嵌入式 Linux 系统开发过程中，从底层系统支持到上层 GUI 应用的方方面面，内容涵盖 Linux 操作系统的安装及相关工具的使用、配置，嵌入式编程所需要的基础知识，硬件部件的使用及编程，，U-Boot、Linux 内核的分析、配置和移植，根文件系统的构造，内核调试技术，驱动程序编写及移植，GUI系统的移植，应用程序调试技术。 -The book is a comprehensive introduction to embedded Linux system developme
VFS-ERRO
- VFS: Cannot open root device "mtdblock2" or unknown-block(2,0)问题解决，亲测通过-VFS: Can not open root device the " mtdblock2 or unknown-block (2,0) to solve the problem, pro-test by