Description: 我们学校的选课系统（http://202.207.16.59）真气人啊，我还没接到通知呢，别人就把选修课都选满了，选不到我心爱的选修课，怎么办？
为了解决这个问题，我特意编写了这个玩艺，因为很多人都没有改默认密码（默认密码就是学号），所以我就可以利用穷举搜索出大部分人都选的什么课，然后。。。。呵呵。。。就参考一下。
估计大家下到这个软件的时候，学校就应该有反应了，也许软件会失效，但是，可以参考一下里面的代码，也许稍微改改，就能适用于你们自己的学校哦。-the Course of our school system (http://202.207.16.59) qi people ah, I have not yet received notification, and people are put optional full elections, not chosen my beloved elective courses, how do? To solve this problem, I deliberately prepared this thing, because a lot of people have not changed the default password (the default password is the school), so I can use exhaustive search out most of the people have elected to the classes and then. . . . Ha ha. . . On reference. We estimate that under this software, the schools would be a reaction, perhaps software failure, but can take a look inside the code, may slightly change it, we can apply to your own school, oh. Platform: |
Size: 3354 |
Author:啊啊 |
Hits:
Description: 电脑下子实际上是分两个步骤的，第一个步骤是尽可能的收集棋盘格局的信息，并且使这些信息以一定的格式存放再内存中，以便于第二步的处理。第二个步骤就是，对收集到的信息进行分析处理，即要给出一个规则，用穷举搜索的办法遍历所有收集到的信息，搜索的过程实际上是用所定下的规则去衡量每一点的权值，搜索的目的是为了找到一个权值最大的点，这个点就是当前的最优解，也就是应该下的子。 -computer is actually two steps, the first step is to collect as much as possible of the chessboard pattern of information and to make this information in a certain format storage memory again, to the second step of treatment. The second step is to collect information for analysis, that is, to give a rule, using exhaustive search approach to traverse all of the information gathered, the search process has been used by the set of rules to assess each and every point of weights, search the aim is to find a maximum value of the right to the point, this point is the current optimal solution, is the son should. Platform: |
Size: 288191 |
Author:朱芳芳 |
Hits:
Description: 我们学校的选课系统（http://202.207.16.59）真气人啊，我还没接到通知呢，别人就把选修课都选满了，选不到我心爱的选修课，怎么办？
为了解决这个问题，我特意编写了这个玩艺，因为很多人都没有改默认密码（默认密码就是学号），所以我就可以利用穷举搜索出大部分人都选的什么课，然后。。。。呵呵。。。就参考一下。
估计大家下到这个软件的时候，学校就应该有反应了，也许软件会失效，但是，可以参考一下里面的代码，也许稍微改改，就能适用于你们自己的学校哦。-the Course of our school system (http://202.207.16.59) qi people ah, I have not yet received notification, and people are put optional full elections, not chosen my beloved elective courses, how do? To solve this problem, I deliberately prepared this thing, because a lot of people have not changed the default password (the default password is the school), so I can use exhaustive search out most of the people have elected to the classes and then. . . . Ha ha. . . On reference. We estimate that under this software, the schools would be a reaction, perhaps software failure, but can take a look inside the code, may slightly change it, we can apply to your own school, oh. Platform: |
Size: 3072 |
Author:啊啊 |
Hits:
Description: 电脑下子实际上是分两个步骤的，第一个步骤是尽可能的收集棋盘格局的信息，并且使这些信息以一定的格式存放再内存中，以便于第二步的处理。第二个步骤就是，对收集到的信息进行分析处理，即要给出一个规则，用穷举搜索的办法遍历所有收集到的信息，搜索的过程实际上是用所定下的规则去衡量每一点的权值，搜索的目的是为了找到一个权值最大的点，这个点就是当前的最优解，也就是应该下的子。 -computer is actually two steps, the first step is to collect as much as possible of the chessboard pattern of information and to make this information in a certain format storage memory again, to the second step of treatment. The second step is to collect information for analysis, that is, to give a rule, using exhaustive search approach to traverse all of the information gathered, the search process has been used by the set of rules to assess each and every point of weights, search the aim is to find a maximum value of the right to the point, this point is the current optimal solution, is the son should. Platform: |
Size: 2452480 |
Author:朱芳芳 |
Hits:
Description: 用C语言写的100行DES加密算法.
DES算法具有极高安全性，到目前为止，除了用穷举搜索法对DES算法进行攻击外，还没有发现更有效的办法。而56位长的密钥的穷举空间为256，这意味着如果一台计算机的速度是每一秒种检测一百万个密钥，则它搜索完全部密钥就需要将近2285年的时间，可见，这是难以实现的，当然，随着科学技术的发展，当出现超高速计算机后，我们可考虑把DES密钥的长度再增长一些，以此来达到更高的保密程度。-Using C language to write 100 lines of the DES encryption algorithm. DES algorithm has high security, so far, except by exhaustive search attack on the DES algorithm, but also found no more effective way. And 56 long exhaustive key space for the 256, which means that if a computer s speed is detected every second of one million keys, it searches entirely on the needs of key Department of nearly 2285 time can be seen, it is difficult to realize, of course, with the development of science and technology, when the emergence of ultra-high-speed computer, we can consider the DES key length and then some growth in order to achieve higher levels of security. Platform: |
Size: 7168 |
Author:JohnBill |
Hits:
Description: 穷举搜索法是对可能是解的众多候选解按某种顺序进行逐一枚举和检验，并从众找出那些符合要求的候选解作为问题的解。
-Exhaustive search method may be the solution of the many candidate solutions one by one according to some order of enumeration and testing, and conformity to identify candidates who meet the requirements of the solution as the solution. Platform: |
Size: 5120 |
Author:wyj |
Hits:
Description: 标准三步搜索法，用matlab实现，经过实验效果还可以-Standard three-step search method, using matlab to achieve, after the experimental effect can also be Platform: |
Size: 2048 |
Author:张居正 |
Hits:
Description: This program gives solution to the Travelling Salesman problem (TSP). I use genetic algorithm, tabu search, exhaustive search. It all combine in a windows application. Platform: |
Size: 60416 |
Author:yyavuz |
Hits:
Description: This paper (and accompanying MATLAB source code) is a review of the block matching algorithms used for motion estimation in video compression. It implements and compares 7 different types of block matching algorithms that range from the very basic Exhaustive Search to the recent fast adaptive algorithms like Adaptive Rood Pattern Search. The algorithms that are evaluated in this paper are widely accepted by the video compressing community and have been used in implementing various standards, ranging from MPEG1 / H.261 to MPEG4 / H.263. The paper also presents a very brief introduction to the entire flow of video compression.
by Aroh Barjatya
original found here http://www.mathworks.com/matlabcentral/fileexchange/8761-This paper (and accompanying MATLAB source code) is a review of the block matching algorithms used for motion estimation in video compression. It implements and compares 7 different types of block matching algorithms that range from the very basic Exhaustive Search to the recent fast adaptive algorithms like Adaptive Rood Pattern Search. The algorithms that are evaluated in this paper are widely accepted by the video compressing community and have been used in implementing various standards, ranging from MPEG1/H.261 to MPEG4/H.263. The paper also presents a very brief introduction to the entire flow of video compression.
by Aroh Barjatya
original found here http://www.mathworks.com/matlabcentral/fileexchange/8761
Platform: |
Size: 121856 |
Author:hbx |
Hits:
Description: sar is a Rough Set-based Attribute Reduction (aka Feature Selection) implementation. This is an implementation of ideas described, among other places, in the following paper:
Qiang Shen and Alexios Chouchoulas, A Modular Approach to Generating Fuzzy Rules with Reduced Attributes for the Monitoring of Complex Systems. Engineering Applications of Artificial Intelligence, 13(3):263-278, 2000.
rsar reads in a MIMO (Multiple Input, Multiple Output) dataset, performs RS-based feature selection on it, and returns the selected feature subset.
Four versions of the QuickReduct algorithm are supported, QuickReduct, QuickReduct III, QuickReduct IV and QuickReduct V (progressively faster implementations). QuickReduct II is a backward elimination version of QuickReduct and is not supported yet neither is exhaustive search for reducts. -sar is a Rough Set-based Attribute Reduction (aka Feature Selection) implementation. This is an implementation of ideas described, among other places, in the following paper:
Qiang Shen and Alexios Chouchoulas, A Modular Approach to Generating Fuzzy Rules with Reduced Attributes for the Monitoring of Complex Systems. Engineering Applications of Artificial Intelligence, 13(3):263-278, 2000.
rsar reads in a MIMO (Multiple Input, Multiple Output) dataset, performs RS-based feature selection on it, and returns the selected feature subset.
Four versions of the QuickReduct algorithm are supported, QuickReduct, QuickReduct III, QuickReduct IV and QuickReduct V (progressively faster implementations). QuickReduct II is a backward elimination version of QuickReduct and is not supported yet neither is exhaustive search for reducts. Platform: |
Size: 730112 |
Author:NH |
Hits:
Description: 运动估计块匹配算法
以下是工程中m文件的简单注释：
main.m 可通过主函数调用各种基本的块匹配算法
FullSearch.m 全搜索法（又称为Exhaustive Search）
ThreeStepSearch.m 三步搜索法（Three Step Search）
NewTSS.m 新三步搜索法（New Three Step Search Algorithm）
SESTSS.m 简便高效的三步搜索法（Simple And Efficient TSS）
FourSS.m 四步搜索法（Four Step Search）
DS.m 菱形搜索法（Diamond Search）
ARPS.m 自适应路径搜索法（Adaptive Root Pattern Search）
costFuncMAD.m 绝对误差均值函数
minCost.m 宏块间代价最小块
motionComp.m 图像重建
imgPSNR.m 计算图像的PSNR值-Block matching motion estimation algorithm The following is a simple project m file comments: main.m calls through the main function of basic block matching algorithm FullSearch.m full search method (also known as the Exhaustive Search) ThreeStepSearch.m three-step search method (Three Step Search) NewTSS.m new three-step search method (New Three Step Search Algorithm) SESTSS.m simple and efficient three-step search method (Simple And Efficient TSS) FourSS.m four-step search method (Four Step Search) DS. m diamond search method (Diamond Search) ARPS.m adaptive path search method (Adaptive Root Pattern Search) costFuncMAD.m mean absolute error between the cost of the function minCost.m macroblock most small motionComp.m calculated image reconstruction imgPSNR.m image PSNR value Platform: |
Size: 4724736 |
Author:alan |
Hits:
Description: 有关穷举回溯搜索的内容 更好的掌握ACM的学习-The exhaustive search for the contents of the back better grasp of the ACM study Platform: |
Size: 28672 |
Author:xinxin |
Hits:
Search - Exhaustive Search