搜索资源列表
Appjxc
- 本系统源程序路径下包括两个文件夹，分别为“PigClient”和“PigServer”。在使用本程序前，需要将“PigServer”文件夹拷贝到Tomcat安装路径下的“webapps”文件夹中，将“PigClient”文件夹下的“deployed”文件夹拷贝到磁盘根目录下。-Source path of the system consists of two folders, namely " PigClient" and " PigServer" . In t
win32fi
- 在不使用 MFC 的程序中获得某个目录下的所有文件名称，包括子目录。把文件名称以一个固定的程度放入一个缓冲中，这个缓冲要足够的大，能容下所有的文件名称。函数的输入为要查找的根目录，输出为存放所有文件名称的缓冲-Do not use MFC in the process of access to a directory under the name of all documents, including subdirectories. The name of the document to the
ndxsf
- 用牛顿下山法解方程x^3-x-1=0 （初值为0.6） 输入：初值，误差限，迭代最大次数，下山最大次数 输出：近似根各步下山因子 -Solution using Newton' s law equation down x ^ 3-x-1 = 0 (initial value 0.6) input: initial value, the error limit, the maximum number of iterations, the maximum number of se
square
- 给你n根木棒，请问使用这些木棒，是否有可能让它们头尾相连组成一个正方形？所 有的木棒都必须使用。 深度优先搜索的正方形问题-N root stick to you, will use the stick, is it possible so that they linked to the formation of a square head? All must use the stick. Depth-first search of the square problem
rafson-num
- A code for Newton-Rafson root Finder in matlab. The program was defined to find the roots of function y=z^3-1
mTree
- 快速、小巧、功能强大的树 var tree=new Tree("根节点") var nodei=new TreeNode("节点1") tree.appendChild( nodei ) tree.expandAll() 支持checkbox 一个页面可以有多个树，代码干净 现在在公司的项目中广泛应用-Fast, compact and powerful tree var tree = new Tree ( " root" ) var
sqrt(x)
- 用汇编语言及牛顿迭代法编写的求一个数的平方根的源代码，环境windlx-Using assembly language and the Newton iterative method for the preparation of a number of the square root of the source code, the environment windlx
szjs
- 几种数值代数中求解线性方程组的方法，包括平方根法，列选主元，全选主元等-Several numerical linear algebra to solve equations, including the square root law, the election out PCA, PCA, etc. Select All
cannon
- cannon 并行程序 Matrix multiplication with the Cannon Algorithm: The matrices A and B are stored in files. The file names have to be specified as parameter. The root process reads the matrices and distributes the respective values to all processes,
image
- 并行计算程序 Descr iption: This program blurs an image file in a parallelized computation The root process reads the file and distributes a part of the image file to other processes. Each process makes the filter operation on the part of the image
jacobi
- Write an MPI program that solves a set of linear equations Ax = b with the 并行计算 Jacobi method. The root process reads the matrix A and the vector b from files. The file names have to be specified by the user as parameters.-Write an MPI p
canon2
- 主要还是让A(i,j) B(i,j)进行移动A(i,i+j),B(i+j,j)，然后进能直接相乘。具体的内容可以看并行算法导论，-Matrix multiplication with the Cannon Algorithm: The Cannon Algorithm for matrix multiplication was presented in the course “Parallel and Distributed Algorithms “by Dr. Klauck. Sh
WoodPolishing
- 这是一个求木材抛光最短时间的程序。就是一根木材有长度和重量，两根木材的这两个属性按照一定顺序排列进行抛光是时间最短，要求解很多根木材以什么顺序进行排列才能使抛光时间最短。-This is a timber for the shortest period of time polishing procedures. There is a length and weight of the timber, the timber 2 in accordance with these two attribu
DiGui
- 一个递归算法，通过类组装一个从根级到最后一个子集的现实。-A recursive algorithm, the assembly adopted a type of root class from a subset of the final reality.
NEWTON_Introducing_the_root_of_equation
- 牛顿法求方程根的介绍，PPT格式。未附代码。-Newton s method of introducing the root of an equation, PPT format. Not accompanied by a code.
busybox_rootfs
- 926x开发板文档---使用busybox制作根文件系统-Development board--- 926x documents produced using busybox root file system
yaffs2_rootfs
- 926x开发板文档---创建yaffs2格式的根文件系统---- 926x development board to create the document format yaffs2 the root file system
chengxu
- 常用的单片机子程序库： 目前已有若干版本的子程序库公开发表,它们各有特色。本程序库中的开平方算法为快速逼近算法,它能达到牛顿迭代法同样的精度,而速度加快二十倍左右,超过双字节定点除法的速度。-Single-chip common subroutine library: there are a number of versions of the subroutine library published, they have their own characteristics. Library in
fakeroot_1.6.5.tar
- 类似sudo,fakeroot只是伪装成root，它不能改变需要root权限才能改变的文件，它只是让程序执行时按照有root权限的情况来运行-类似sudo,fakeroot只是伪装成root，它不能改变需要root权限才能改变的文件，它只是让程序执行时按照有root权限的情况来运行
flyingants_01.tar(1)
- 飞蚁路由协议的实现,需要root的权限运行-implementation of Flying ants routing protocol