Description: 原理 1 截取屏幕，从而取得方块数据，然后搜索算法. 2 通过鼠标键盘钩子发送消息来消去. 3 腾讯反外挂作的很牛,连连看程序在接到鼠标点击消息的同时从驱动层判断有没有 点击消息,所以把0x00403291地址的内存锁定为0x00就可以让腾讯的凡外挂系统失效。 4 在消除过程中因为烟雾等特效的影响,中途按F9键分析结果很可能错误,谁有办法 解决这个问题一定要告诉我啊! 最好能取消动画特效,直接消去. 5 因为时间仓促,利用周末匆匆写完这个程序,所以代码极不规范,还请大家谅解.-screen, thereby obtaining the data block, then search algorithm. 2 hook through a mouse and keyboard to send messages eliminated. Tencent three anti - pylon for the very cattle, in the 1000 block of Terry Avenue procedures mouse clicks received information from the driver layer judgment has to click on, and hence to 0x00403291 the site of the 0x00 memory lock on the Tencent allow any external system failure. 4 in the elimination process because of the effects of smoke and other effects, halfway by F9 key results of the analysis may mistake, who has a solution to this problem must tell me ah! The best animation effects can be canceled, direct elimination. 5 because of the limited time, finished a weekend rush this process, substituting yards were highly irregular, please understanding. Platform: |
Size: 218456 |
Author:地地地 |
Hits:
Description: Buddy（伙伴）算法每次分配包含一个或者多个物理页面的内存块，页面以2的次幂的内存块来分配。首先搜寻满足请求大小的页面，它从满足当前申请大小的Buddy数据结构的m_ freePages域着手沿链来搜索空闲页面。如果没有这样请求大小的空闲页面，则它搜索两倍于请求大小的内存块。这个过程一直将持续到所有的Buddy 被搜索完或找到满足要求的内存块为。如果找到的页面块大于请求的块则对其进行分割以使其大小与请求块匹配。由于块大小都是2的次幂所以分割过程十分简单：空闲块（低地址）被连进相应大小的队列而这个页面块被分配给调用者。 释放时，先检查该块的伙伴的使用情况，如果没有被使用，则合并这对Buddy，再检查该两倍大小的块的Buddy，一直持续到合并后的块没有Buddy为止，并将之链到该大小的freepage队列中。-Buddy (partners) each allocation algorithm contains a number of physical pages or blocks of memory, two pages to the Powers of the block of memory to allocate. First of all search requests to meet the size of pages, from the application to meet the current size of the data structure Buddy 8 freePages domain proceed along the chain to search leisure pages. If no such request size spare pages, which then search request twice the size of a memory block. This process has to continue until all the Buddy Search End or were found to meet the requirements for the memory block. If found in the pages block greater than the requested block is divided in its size and make it the request block matching. As pieces are the two Powers So segmentation process is very simple : free block (low-address) was e Platform: |
Size: 4311 |
Author:npu |
Hits:
Description: QQ连连看外挂源码 20050609qq
连连看外挂简介
原理
1 截取屏幕，从而取得方块数据，然后搜索算法.
2 通过鼠标键盘钩子发送消息来消去.
3 腾讯反外挂作的很牛,连连看程序在接到鼠标点击消息的同时从驱动层判断有没有
点击消息,所以把0x00403291地址的内存锁定为0x00就可以让腾讯的凡外挂系统失效。
4 在消除过程中因为烟雾等特效的影响,中途按F9键分析结果很可能错误,谁有办法
解决这个问题一定要告诉我啊! 最好能取消动画特效,直接消去.
5 因为时间仓促,利用周末匆匆写完这个程序,所以代码极不规范,还请大家谅解.-QQ Lianliankan extrapolated source 20050609qq Lianliankan pylon on an interception principle screen, obtain data box, Then search algorithm. 2 mouse through the keyboard hook Send Message to eliminate. 3 Tencent anti - pylon for the very cattle, Lianliankan procedures for the receipt of information a mouse click at the same time from the driver layer judgment it is not news. Therefore 0 x00403291 address to the memory lock on the 0x00 allows Tencent Van extrapolated system failure. Four in the elimination process because of the smoke, and other effects, according to the F9 key halfway analysis it is very likely wrong. who has the solution to this problem must tell me ah! best to abolish the animation effects, direct elimination. 5 because of the time constraints, the use of hastily finishe Platform: |
Size: 222180 |
Author:wancb |
Hits:
Description: This function computes Euclidean distance transform for 3D binary image with non-trivial aspect ratio (i.e. anisotropic pixels). The algorithm uses fast optimized line-scans and is actually faster than MATLAB s BWDIST implementation of search on optimized kd-tree for many cases. It also uses cell-array representation for internal data, and thus is less demanding to physical memory. Platform: |
Size: 49720 |
Author:fangfei |
Hits:
Description: 1.本程序由本人采用vc++ 6.0编写，包括了排序平衡二叉树的整套算法（包括插入、删除、查找以及其测试算法）。 2.运行myavl_vc.exe输入树的初始结点个数，确定后本程序将在内存中生成一棵相应结点数的二叉树，在此基础上你可以进行各种操作（插入、删除、查找以及测试其平衡性、排序性等） 3.每一个结点信息包括\"商品编码\"、\"商品名称\",且以\"商品编码\"作为关键字 4.初始生成的树的结点的商品编码为从1按顺序递增，商品名称为\"生成的商品\"加上商品编码 5.程序中的随机插入与随机删除是为了更好的测试程序的正确性和可靠性 6.随机插入（删除）时，程序将不断向（从）树中随机插入（删除）结点，每次随机插入（删除）都会进行平衡性与排序性的检查，如果树已经失去了有序性或平衡性，则会弹出树已失去了有序性或平衡性的提示并停止插入（删除）操作，当然你可以随时中断随机操作-1. The procedure I used vc 6.0 preparation, including the sequencing of the entire balanced binary tree algorithm (including insert, delete, search and test algorithm). 2. Running myavl_vc.exe importation of the initial tree node number, the procedures established in the memory of the formation of a corresponding nodes of a binary tree, and on this basis you can conduct various operations (insert, delete, search and testing their balance, sorting etc.) 3. each node information including "Product Codes," "trade names," and the "commodity codes" as the keyword 4. initial production of the tree node for the coding of goods from a sequential increase trade names as "Generation of goods" with commodity coding 5. procedures the random insertion and deletio Platform: |
Size: 17097 |
Author:avltree |
Hits:
Description: 原理 1 截取屏幕，从而取得方块数据，然后搜索算法. 2 通过鼠标键盘钩子发送消息来消去. 3 腾讯反外挂作的很牛,连连看程序在接到鼠标点击消息的同时从驱动层判断有没有 点击消息,所以把0x00403291地址的内存锁定为0x00就可以让腾讯的凡外挂系统失效。 4 在消除过程中因为烟雾等特效的影响,中途按F9键分析结果很可能错误,谁有办法 解决这个问题一定要告诉我啊! 最好能取消动画特效,直接消去. 5 因为时间仓促,利用周末匆匆写完这个程序,所以代码极不规范,还请大家谅解.-screen, thereby obtaining the data block, then search algorithm. 2 hook through a mouse and keyboard to send messages eliminated. Tencent three anti- pylon for the very cattle, in the 1000 block of Terry Avenue procedures mouse clicks received information from the driver layer judgment has to click on, and hence to 0x00403291 the site of the 0x00 memory lock on the Tencent allow any external system failure. 4 in the elimination process because of the effects of smoke and other effects, halfway by F9 key results of the analysis may mistake, who has a solution to this problem must tell me ah! The best animation effects can be canceled, direct elimination. 5 because of the limited time, finished a weekend rush this process, substituting yards were highly irregular, please understanding. Platform: |
Size: 218112 |
Author:地地地 |
Hits:
Description: Buddy（伙伴）算法每次分配包含一个或者多个物理页面的内存块，页面以2的次幂的内存块来分配。首先搜寻满足请求大小的页面，它从满足当前申请大小的Buddy数据结构的m_ freePages域着手沿链来搜索空闲页面。如果没有这样请求大小的空闲页面，则它搜索两倍于请求大小的内存块。这个过程一直将持续到所有的Buddy 被搜索完或找到满足要求的内存块为。如果找到的页面块大于请求的块则对其进行分割以使其大小与请求块匹配。由于块大小都是2的次幂所以分割过程十分简单：空闲块（低地址）被连进相应大小的队列而这个页面块被分配给调用者。 释放时，先检查该块的伙伴的使用情况，如果没有被使用，则合并这对Buddy，再检查该两倍大小的块的Buddy，一直持续到合并后的块没有Buddy为止，并将之链到该大小的freepage队列中。-Buddy (partners) each allocation algorithm contains a number of physical pages or blocks of memory, two pages to the Powers of the block of memory to allocate. First of all search requests to meet the size of pages, from the application to meet the current size of the data structure Buddy 8 freePages domain proceed along the chain to search leisure pages. If no such request size spare pages, which then search request twice the size of a memory block. This process has to continue until all the Buddy Search End or were found to meet the requirements for the memory block. If found in the pages block greater than the requested block is divided in its size and make it the request block matching. As pieces are the two Powers So segmentation process is very simple : free block (low-address) was e Platform: |
Size: 4096 |
Author:npu |
Hits:
Description: QQ连连看外挂源码 20050609qq
连连看外挂简介
原理
1 截取屏幕，从而取得方块数据，然后搜索算法.
2 通过鼠标键盘钩子发送消息来消去.
3 腾讯反外挂作的很牛,连连看程序在接到鼠标点击消息的同时从驱动层判断有没有
点击消息,所以把0x00403291地址的内存锁定为0x00就可以让腾讯的凡外挂系统失效。
4 在消除过程中因为烟雾等特效的影响,中途按F9键分析结果很可能错误,谁有办法
解决这个问题一定要告诉我啊! 最好能取消动画特效,直接消去.
5 因为时间仓促,利用周末匆匆写完这个程序,所以代码极不规范,还请大家谅解.-QQ Lianliankan extrapolated source 20050609qq Lianliankan pylon on an interception principle screen, obtain data box, Then search algorithm. 2 mouse through the keyboard hook Send Message to eliminate. 3 Tencent anti- pylon for the very cattle, Lianliankan procedures for the receipt of information a mouse click at the same time from the driver layer judgment it is not news. Therefore 0 x00403291 address to the memory lock on the 0x00 allows Tencent Van extrapolated system failure. Four in the elimination process because of the smoke, and other effects, according to the F9 key halfway analysis it is very likely wrong. who has the solution to this problem must tell me ah! best to abolish the animation effects, direct elimination. 5 because of the time constraints, the use of hastily finishe Platform: |
Size: 1850368 |
Author:wancb |
Hits:
Description: This function computes Euclidean distance transform for 3D binary image with non-trivial aspect ratio (i.e. anisotropic pixels). The algorithm uses fast optimized line-scans and is actually faster than MATLAB s BWDIST implementation of search on optimized kd-tree for many cases. It also uses cell-array representation for internal data, and thus is less demanding to physical memory. Platform: |
Size: 49152 |
Author:fangfei |
Hits:
Description: 连连看外挂原理
1 截取屏幕，从而取得方块数据，然后搜索算法.
2 通过鼠标键盘钩子发送消息来消去.
3 腾讯反外挂作的很牛,连连看程序在接到鼠标点击消息的同时从驱动层判断有没有
点击消息,所以把0x00403291地址的内存锁定为0x00就可以让腾讯的凡外挂系统失效。-Lianliankan one interception screen plug-in principle, to obtain the data box, and then search algorithm through the mouse keyboard hook .2 send a message to eliminate the anti-plug for .3 Tencent very cattle, Lianliankan process of receiving messages at the same time the mouse clicks from the drive layer to determine whether there click information, so the memory address 0x00403291 to 0x00 can be locked so that Platform: |
Size: 75776 |
Author:mhs |
Hits:
Description: Trie树既可用于一般的字典搜索，也可用于索引查找。对于给定的一个字符串a1,a2,a3,...,an.则采用TRIE树搜索经过n次搜索即可完成一次查找。不过好像还是没有B树的搜索效率高，B树搜索算法复杂度为logt(n+1/2).当t趋向大，搜索效率变得高效。怪不得DB2的访问内存设置为虚拟内存的一个PAGE大小，而且帧切换频率降低，无需经常的PAGE切换。-Trie tree can be used for general dictionary english, can also be used to search the index. For a given a string a1, a2, a3 ,..., an. Is used TRIE tree english english after n times to complete a search. But they did not like B-tree search efficiency, B tree search algorithm complexity is logt (n+ 1/2). When t trend, and search efficiency becomes efficient. No wonder the DB2 access memory settings for the virtual memory size of a PAGE, and the frame switching frequency to reduce the need for frequent switching PAGE. Platform: |
Size: 1024 |
Author:ruikobe |
Hits:
Description: 流分类中的一种算法：Packet Classification Using Multidimensional Cutting-This paper introduces a classification algorithm called HyperCuts.
Like the previously best known algorithm, HiCuts,
HyperCuts is based on a decision tree structure. Unlike
HiCuts, however, in which each node in the decision tree
represents a hyperplane, each node in the HyperCuts decision
tree represents a k− dimensional hypercube. Using this
extra degree off reedom and a new set of heuristics to find
optimal hypercubes for a given amount of storage, Hyper-
Cuts can provide an order ofma gnitude improvement over
existing classification algorithms. HyperCuts uses 2 to 10
times less memory than HiCuts optimized for memory, while
the worst case search time ofH yperCuts is 50− 500 better
than that ofH iCuts optimized for speed. Compared with
another recent scheme, EGT-PC, HyperCuts uses 1.8 − 7
times less memory space while the worst case search time is
up to 5 times smaller. More importantly, unlike EGT-PC,
HyperCuts can be fully pipelined to provide one Platform: |
Size: 216064 |
Author:Reguse |
Hits:
Description: CAPI多核编程算法库0.21版，里面有分布式队列、分布式查找、分布式内存管理、任务图调度、动态任务调度等多种容器，新增了CWaitTaskScheduler任务调度容器和并行Strassen矩阵乘法等。-CAPI programming algorithm for multi-core library version 0.21, which are distributed queue, distributed search, distributed memory management, task graph scheduling, dynamic task scheduling and many other containers, added CWaitTaskScheduler container and parallel task scheduling Strassen matrix multiplication and so on. Platform: |
Size: 322560 |
Author:zhou |
Hits:
Description: 禁忌搜索法对初始解、邻域个数及禁忌列表的大小等参数有比较严格的要求, 这些参数直接影响着算法的优化能力。文章提出了一种改进的禁忌搜索法, 它用有效空间来压缩搜索范围, 这样可以提高搜索效率和全局搜索能力。用短期和长期禁忌列表存储器来保证算法能搜索到全和分局空间的每一点, 并且不重复搜索。经过验算析, 证明它是一种较好的全局启发式搜索法.-Tabu search method, the initial solution, neighborhood and tabu list size of the number of parameters such as have more stringent requirements, these parameters directly affect the ability to optimize the algorithm. This paper presents an improved tabu search method, it is used effectively to compress the search space, so that can improve search efficiency and global search capabilities. Short-term and long-term memory tabu list to ensure the algorithm can search the whole and the sub-space, each point, and do not repeat the search. After checking analysis to prove that it is a good global heuristic search method. Platform: |
Size: 475136 |
Author:logspace |
Hits:
Description: Dijkstra算法是求解网络中最短路径的精典算法，文中通过改变图的存储结构及搜索方法，减少了内存存储空间，缩短查询时间，以提高该算法在嵌入式GIS系统中路径优化的效率。-Dijkstra algorithm is to solve the classic shortest path network algorithm, the paper map by changing the storage structure and the search for ways to reduce the memory storage space, reduce the query time to improve the algorithm in the embedded GIS system path optimization efficiency. Platform: |
Size: 149504 |
Author:钱程 |
Hits:
Description: IKAnalyzer的源码包，实现中文分词功能，(1) 采用了特有的“正向迭代最细粒度切分算法”，具有60万字/ 秒的高速处理能力。
(2) 采用了多子处理器分析模式，支持：英文字母（ IP 地址、Email、URL ）、数字（日期，常用中文数量词，罗马数字，科学计数法），中文词汇（姓名、地名处理）等分词处理 。
(3) 优化的词典存储，更小的内存占用。支持用户词典扩展定义
(4) 针对 Lucene 全文检索优化的查询分析器 IKQueryParser；采用歧义分析算法优化查询关键字的搜索排列组合，能极大的提高 Lucene 检索的命中率。-IKAnalyzer the source package to achieve Chinese word function, (1) using the unique " forward iteration the most fine-grained segmentation algorithm" , with 60 million characters/second high-speed processing capability. (2) The analysis of multi-mode sub-processor support: letters (IP address, Email, URL), numbers (dates, commonly used in Chinese numeral, roman numerals, scientific notation), Chinese vocabulary (name, place name treatment) segmentation processing. (3) optimization of the dictionary storage, a smaller memory footprint. Support the extended definition of the user dictionary (4) optimized for the Lucene full-text search query analyzer IKQueryParser by ambiguity of keyword search algorithm to optimize query permutations and combinations, can greatly improve the Lucene search hits. Platform: |
Size: 1197056 |
Author:陈雅倩 |
Hits:
Description: 人工免疫算法：基本免疫算法基于生物免疫系统基本机制，模仿了人体的免疫系统。基本免疫算法从体细胞理论和网络理论得到启发，实现了类似于生物免疫系统的抗原识别、细胞分化、记忆和自我调节的功能 。如果将免疫算法与求解优化问题的一般搜索方法相比较，那么抗原、抗体、抗原和抗体之间的亲和性分别对应于优化问题的目标函数、优化解、解与目标函数的匹配程度-Artificial immune algorithm: the basic immune algorithm is based on the basic mechanisms of biological immune system, mimicking the body s immune system. Basic immune algorithm inspired by the somatic theory and network theory, similar to the antigen recognition of the biological immune system, cell differentiation, memory and self-regulating function. If the immune algorithm for solving optimization problems in a general search method, compared to the affinity between antigen, antibody, antigen and antibody correspond to objective function optimization problems, optimal solution, match of the solution with objective function Platform: |
Size: 402432 |
Author:jax |
Hits:
Description: 针对目前图形处理器(GPU) 上的动态数据处理问题，在分析现有并行单源最短路径(SSSP) 算法的基础上，对 GPU上的Moore SSSP算法进行并行化设计与实现。搜索时，综合应用层次化任务分配、层次化工作队列、层次化 Kernel 调用等策略。在不同类型图数据上进行实验测试，实验结果表明，该算法能有效减少空线程开销、访存开销以及同步时间。-For dynamic data processing on the graphics processor (GPU), the analysis of existing parallel single-source shortest path (SSSP) algorithm based on the Moore SSSP algorithm on GPU Parallel design and realization. Search application level task allocation, hierarchical work queue, hierarchical Kernel call strategy. Experimental tests on the different types of map data, experimental results show that the algorithm can effectively reduce the empty thread overhead and memory access overhead and synchronization time. Platform: |
Size: 1076224 |
Author:JIANGLILY |
Hits:
Description: 本.cpp代码主要是收集了一些常用的C++算法相关内容，关键地方都已标记注释，比如链表数据、尾插法利用一个动态指针、迭代斐波那契、循环队列、KMP模式匹配算法，二叉树二叉链表节点结构定义、二叉排序树查找、平衡二叉树 AVL、优化后的冒泡算法、简单的选择排序，依次比较将最小的，然后与第一个位置交换、希尔排序、堆排序、归并排序（内存占用大）等，具体请下载这个源代码文件。-The. Cpp code is a collection of some commonly used C++ algorithms related content, key areas are marked notes, such as linked lists of data, the tail pointer interpolation method utilizes a dynamic, iterative Fibonacci, circular queue, KMP pattern matching algorithm, binary tree the binary tree node structure is defined, binary sort tree search, balanced binary AVL, bubbling optimized algorithm, a simple selection sort, compare the smallest turn, then swap the first position, Hill sort, heap sort, merge sort (large memory footprint), etc. For details, please download the source code files. Platform: |
Size: 9216 |
Author:gxtxtplg |
Hits:
Description: 该算法既保留了遗传算法的搜索特性，又利用了免疫算法的多机制求解多目标函数最优解的自适应特性，在很大程度上避免了“早熟”，收敛于局部极值。
生物体的免疫系统是一个高度进化、复杂的系统，它能自适应地识别和排除入侵肌体的抗原性异物，保护机体免受损害及维持内坏境稳定，并具有学习、记忆和自适应调节的能力。当抗原入侵时，免疫系统通过自体耐受对‘自己’和‘非己’进行识别，并产生最恰当的抗体排除抗原，通过抗体与抗体之间、抗原与抗体之间的相互刺激和抑制关系，降低抗原对免疫细胞的刺激，抑制抗体的过度分化、增殖，保证免疫平衡并维持抗体的多样性。同时在免疫过程中将产生抗体的部分细胞作为记忆细胞保存下来，对于今后侵入的同类抗原，相应的记忆细胞受到激发而产生大量的抗体。为提高生物体的免疫机能，医学上往往根据抗原性异物提取疫苗给生物体接种，接种过的生物体由于免疫细胞预先获得了抗原染色体的特征信息，因而在类似抗原入侵时，能迅速产生亲和度很高的抗体，有效抵御入侵。-The search algorithm only retains the characteristics of genetic algorithms, and use multiple mechanisms of immune algorithm for solving multi-objective characteristics of adaptive optimal solutions, in large part to avoid the " premature" , converge to local minima. Organism' s immune system is a highly evolved, complex system which adaptively identify and remove foreign matter intrusion antigenic body, protecting the body injury and maintain internal stability bad environment, and has learning, memory and adaptive Ability. When the antigen invasion of immune system tolerance to autologous ' own' and ' non-self' to identify and produce the most appropriate antigen antibody excluded by between antibody and antibody, antigen and antibody mutual stimulation and inhibition of the relationship between reduce the antigen to stimulate immune cells, antibodies inhibit excessive differentiation, proliferation, immune balance and ensure the maintenance of antibody dive Platform: |
Size: 110592 |
Author:snowtiger |
Hits:
Search - search algorithm for memory