搜索资源列表
fama
- 砝码称重问题! 用1,2,5,10,20,50的砝码称出1到88的物重-weight problem! With 1, said 2,5,10,20,50 weight 1-88 out of the weight
该代码可以拾取屏幕上的颜色并显示RGB分
- 该代码可以拾取屏幕颜色,显示rgb分量!-The code can pick up color screen, showing rgb weight!
自己写的俄罗斯方块
- 学C#的时候写的俄罗斯方块的程序,全凭自己的想象写的,错误挺多,不过基本的功能实现了,-C#, the Russian ideographic written procedures, used their imaginations to write the wrong initial weight, but the basic function of the realization, huh
javasom_1[1].0.0
- Kohonen网络的学习过程可描述为:对于每一个网络的输入,只调整一部分权值,使权向量更接近或更偏离输入矢量,这一调整过程就是竞争学习。随着不断的学习过程,所有输入矢量都在输入矢量空间相互分离,形成了各自代表输入空间的一类模式,这就是Kohonen网络的特征自动识别的聚类功能。请解压缩后按照readme提示进行操作。-Kohonen network learning process can be described as follows : for each one network input,
SQLDirect.v4.2.8
- SQLDirect Component Library is a light-weight Borland Database Engine replacement for Borland Delphi v.4 - 9(2005) and C++Builder v.4 - 6. It uses the native application programming interfaces to access to the following SQL-servers: * Centura (former
模拟月球围绕地球旋转Flash程序
- 该Flash模拟月球围绕地球旋转 假设地球重量和月球能量可调,然后计算出月球的轨迹并显示-Flash simulation of the moon revolving around the Earth weight assumptions Earth and the Moon energy adjustable, and then calculate the trajectory and the moon show
xinchengxu
- 包括GRAY码,工作分配问题,会场安排,石子,行数字三角形,最长递增子序列和最小重量机器算法。利用动态规划、回溯法和贪心法-including GRAY code, work assignment, venue arrangements, gravel, and digital triangle, the longest sequences and increase the minimum weight machine algorithm. Using dynamic programming,
砝码问题
- 若允许天平两边放砝码,times应从-num[index]开始,并且分段计算sum,本例只放天平一边.?? -if allowed to put weight on both sides of scales, from the times-num [index], and sub-calculated sum, the cases take only balance the side.
my0-1knapsack
- 给定n 个物品, 物品i重为wi 并且价值为 vi ,背包所能承载的最大容量为 W. 0-1 背包问题即是选择含有着最大总价值的物品的子集且它的容量 ≤W . 用动态规划实现-given n goods, items i weight of wi and value of vi, the backpack can carry a maximum capacity of W. 0-1 knapsack problem that is a choice with a maximum tot
颜色矩
- 基于颜色矩特征的图像检索:首先RGB颜色空间转换到HSV颜色空间;针对HSV三个分量计算颜色矩作为图像的内容特征;计算查询图像与图像库中每幅图像的相似距离,排序后给出检索结果。-Moment features based on color image retrieval : First RGB color space conversion to HSV color space; Three weight against HSV color calculated moments as images
平分七筐鱼
- 甲、乙、丙三位鱼夫出海打鱼,他们随船带了21只箩筐。当晚返航时,他们发现有七筐装满了鱼,还有七筐装了半筐鱼,另外七筐则是空的,由于他们没有秤,只好通过目测认为七个满筐鱼的重量是相等的,7个半筐鱼的重量是相等的。在不将鱼倒出来的前提下,怎样将鱼和筐平分为三份? -A, B, C 3 fisherman fishing, they brought on board 21 baskets. That night back, they found seven baskets full of fish
可称1~40磅的4块砝码
- 法国数学家梅齐亚克在他著名的《数字组合游戏》(1962)中 提出了一个问题:一位商人有一个重40磅的砝码,一天不小心将 砝码摔成了四块。后来商人称得每块的重量都是整磅数,而且发 现这四块碎片可以在天平上称1至40磅之间的任意重量。请问这 四块碎片各重多少?-Meijieke French mathematician in the famous "number combinations Game" (1962), presented a
wavework
- Matlab中非小波工具箱的应用小波变换处理图像,可以copy,cut,paste小波分量。-Matlab toolbox to the Central African Wavelet Transform Image processing can copy, cut, paste wavelet weight.
调色程序
- 该程序能够帮助您 方便的进行调色并提取出r g b分量。-the program to help you facilitate the conduct palette and extracted b r g weight.
aplib-0.43
- aPLib is a 32-bit compression library based on the compression algorithm used in aPACK (my executable packer). aPLib is an easy-to-use alternative to many of the heavy-weight compression libraries available.-aPLib is a 32-bit compression libra
glouton
- 以贪吃为基础算法解决背包问题,附加功能允许物品重量为0。在linux环境下用makefile进行编译。-to Dandelion-based algorithm to solve knapsack problem, additional feature allows weight to 0. Linux environment in the makefile used computer.
背包问题程序
- 在0 / 1背包问题中,需对容量为c 的背包进行装载。从n 个物品中选取装入背包的物品,每件物品i 的重量为wi ,价值为pi 。对于可行的背包装载,背包中物品的总重量不能超过背包的容量,最佳装载是指所装入的物品价值最高,即Σpi*xi 取得最大值。-0 / 1 knapsack problem, the need for the capacity of the c loaded backpack. N items from the selected load backpack items, e
Problem2_6
- 使用VB.net编写的对24位位图进行简单图像处理的程序,包括RGB与YIQ数据的相互变换,绘制亮度分布统计图,拉普拉斯滤波。 该程序是我学习图像处理算法是编写的,因此在操作界面方面的考虑较少,你可以按照以下步骤操作:选择一个文件后单击读取BMP文件,然后就可以单击“根据RGB数据绘图”,接着可以单击“RGB to YIQ”将RGB数据转化为YIQ数据,有了YIQ数据后就可以单击“绘制YIQ数据的Y分量”,对于YIQ数据,可以使用拉普拉斯滤波,然后再将Y分量显示出来-use VB.net p
HumanMotionTrack_skeleton
- 用OPENGL使三围人体重显: 一个读取3DS文件的原代码!-use OpenGL to enable Body weight were significant : one to read the original documents 3DS code!