Hot Search : Source embeded web remote control p2p game More...
Location : Home Search - reactor
Search - reactor - List
一个学生信息管理系统,使用了多中数值算法,有HASH查找,归并排序,堆排序,快速排序,界面也不错-a student information management system, using a number of numerical algorithms, hash search, merging, in order of ranking reactor, rapid sequencing, and the interface is good
Update : 2008-10-13 Size : 750411 Publisher : 哈哈哈

三点式振荡器是指LC回路的三个端点与晶体管的三个电极分别连接而成的电路,如图4-1(a)所示。图中三个电抗元件X1、X2、X3构成了决定振荡频率的并联谐振回路,同时也构成了正反馈所需的反馈网络。从相位条件看,要构成振荡器,必须满足: (1)极相连的两个电抗X1、X2性质相同。 (2)X1与X2、X3的电抗性质相反。-three-point refers to LC oscillator circuit with three transistors endpoint of three electrodes were connected with the circuit, Figure 4-1 (a) below. Figure 3 reactor components X1, X2, X3 decision constitutes a frequency of the oscillation parallel resonant circuit, but also constitutes a positive feedback for the feedback network. From Phase conditions, to constitute an oscillator, to be met : (a) very connected to the two reactor X1, X2 the same nature. (2) X1 and X2, X3 nature of the resistance -- contrary.
Update : 2008-10-13 Size : 16081 Publisher : 张枫

DL : 0
用数组表示堆从而实现优先队列 存储紧凑,空间利用率高-array reactor used to achieve priority queue storage compact, space utilization high
Update : 2008-10-13 Size : 17140 Publisher : 刘通学

huffman_f 在huffman_e的基础上,将排序改为利用堆排序原理选择最小的两个权值。也即,将所有元素的权值组织成堆后,每次堆内的根结点就是最小值了。每取出一个根结点后,就把堆尾元素调到根结点重建堆。取出两个最小值合并成一个子树后,再把子树作为叶子结点放到堆中,并让其上升到合适的位置,保持堆性质不变。因为每次不必完成整个排序过程,而只是组织成堆,因此,这种方法要比使用快速排序更快。上述算法参考了mg-1.2.1中Huffman编码的实现,见http://www.cs.mu.oz.au/mg-huffman_f in huffman_e, on the basis of order to use Heap Sort tenets of the two smallest choose the right values. That is, all the elements of the weights organizations piles, each pile of Root is a minimum. Root out every one after, they pile tail elements transferred Root reconstruction reactor. Two out minimum son into a tree, then the tree-leaf nodes as into rubble, and allowed to rise to a suitable location, to maintain the nature of sculpture. Because each time without complete the entire sequencing process, and the only organization piles, therefore, this method than using the rapid sequencing faster. Reference to the above algorithm mg-1.2.1 Huffman coding to achieve, see http://www.cs.mu.oz.au/mg
Update : 2008-10-13 Size : 2201 Publisher : 真实

几种排序算法的C语言实现 用函数实现如下算法: (1) 直接插入排序, 希尔排序 (2) 冒泡排序, 快速排序 (3) 选择排序, 堆排序 (4) 归并排序 (5) 基数排序 -several algorithm using C language function algorithm to achieve the following : (a) direct insertion sort, Hill sequencing (2) Bubble Sort, rapid sequencing (3) choose, in order of ranking reactor (4) Merging Sort (5) Sort base
Update : 2008-10-13 Size : 4008 Publisher : 丘方

DL : 1
实例(java) 1. 编写一个程序,列出1 到1000 以内的,求59 的余后为1 质数。 2. 试编写程序解下面的问题。猴子吃桃问题:猴子第一天摘下若干个桃子,当即吃了 一半,还不瘾,又多吃了一个 第二天早上又将剩下的桃子吃掉一半,又多吃了一个。 以后每天早上都吃了前一天剩下的一半零一个。到第10 天早上想再吃时,见只剩 下一个桃子了。求第一天共摘了多少。 3. 编写一个程序求1+2!+3!+...+20!的和。 4. 试编写程序求解下面的问题:海滩上有一堆桃子,五只猴子来分。第一只猴子把这堆桃子凭据分为五份,多了一个,这只猴子把多的一个扔入海中,拿走了一份。第二只猴子把剩下的桃子又平均分成五份,又多了一个,它同样把多的一个扔入海中, 拿走了一份,第三、第四、第五只猴子都是这样做的,问海滩上原来最少有多少个桃子?(请列举出1000000 以内的最小总数) -Example (java) 1. Preparation of a procedure set out within 1-1000, I seek 59 after a prime number. 2. Test preparation procedures solution to the problem below. The monkeys eat peaches : monkeys became the first several days of peaches, a half-eaten immediately, not addiction, Also eat a morning of the second day will eat the remaining peach half, eat one. The morning after the day before telling the remaining half of a zero. Article 10 days served, when the morning to see only one of the peach. For the first days of the number of extraction. 3. Process for the preparation of a 1 2! Three! ... 20! And. 4. Test preparation procedures to solve the following problems : on the beach with a pile of peaches, five minutes to monkeys. First monkeys peaches evidence of this reactor were divided in
Update : 2008-10-13 Size : 1658 Publisher : wangqi

数据结构----常用算法的堆排序算法,完整版可直接编译运行,教学实验中常用!-data structure-the reactor algorithm commonly used algorithm, a complete version can be run directly translated, Teaching experiment used!
Update : 2008-10-13 Size : 57566 Publisher : popandsmtp

DL : 1
实现大整数的加减乘除及堆运算-achieving large integer arithmetic and the Reactor Operators
Update : 2008-10-13 Size : 25693 Publisher : 杨向前

DL : 0
Microsoft RPCSS DCERPC DCOM对象激活包长度堆破坏漏洞-RPCSS DCERPC Microsoft DCOM object activation packet length damaged reactor loophole
Update : 2008-10-13 Size : 5214 Publisher : 尹天

本程序以哈尔滨工业大学为例,用堆结构实现了校园内导航图这一功能,用户输入自己在校园内的所在地和目的地,程序会自动给出路线。-procedures to the Harbin Industrial University as an example, the use of the reactor structure to achieve campus navigation map of this function, Users input their campus, the location and the destination, the program will automatically given route.
Update : 2008-10-13 Size : 19562 Publisher : xiaoyu

DL : 0
OpenWFE是一个开放源码的Java工作流引擎。它是一个完整的业务处理管理套件:一个引擎,一个工作列表,一个Web界面和一个反应器(存放自动代理)。它可以可以跟你的程序很好的给合。 初步尝试这个东东,从WEB页面上感觉是一个很好的东东,也是一个比较理想的工作流设计的东东,也没有像uengine这个工作流复杂,是一个自由派的工作流引擎技术。现在正在学习当中 -OpenWFE is an open source Java workflow engine. It is a complete business process management suite : an engine, a list, a Web interface and a reactor (automatic storage agent). It can tell you the procedures for the good cooperation. The initial attempt to Eastern, from the Web pages is a very good impression of the Eastern, is an ideal work flow design of the Eastern nor as uengine this complex work flow, is the work of a liberal engine technology. Which is now learning
Update : 2008-10-13 Size : 26525094 Publisher : 何天

堆和栈的区别 一、预备知识—程序的内存分配 一个由c/C++编译的程序占用的内存分为以下几个部分 1、栈区(stack)— 由编译器自动分配释放 ,存放函数的参数值,局部变量的值等。其操作方式类似于数据结构中的栈。 2、堆区(heap) — 一般由程序员分配释放, 若程序员不释放,程序结束时可能由OS回收 。注意它与数据结构中的堆是两回事,分配方式倒是类似于链表,呵呵。 3、全局区(静态区)(static)—,全局变量和静态变量的存储是放在一块的,初始化的全局变量和静态变量在一块区域, 未初始化的全局变量和未初始化的静态变量在相邻的另一块区域。 - 程序结束后有系统释放 4、文字常量区—常量字符串就是放在这里的。 程序结束后由系统释放 5、程序代码区—存放函数体的二进制代码。 二、例子程序 -reactors and the distinction between a stack, prior knowledge-memory allocation procedures from a c / C compiler procedures occupied by the memory is divided into the following sections 1, Stack (stack) - automatically by the compiler release distribution, storage function parameters, local variables, such as the value. Their mode of operation similar to the data structure of the stack. 2, the reactor (heap) - General to release the allocation by programmers, programmers if not released at the end of proceedings by the OS may recall. Attention to its data structure and the reactor are two different things, but similar to the distribution chain, Ha ha. 3, the overall situation (static) (static) -, global variables and static variables are stored on one, initialize the global variables and s
Update : 2008-10-13 Size : 14949 Publisher : stevephen

DL : 0
假设定义堆为满足如下性质的完全三叉树:(1)空树为堆;(2)根结点的值不小于所有子树根的值,且所有子树均为堆。编写利用上述定义的堆进行排序的算法,并分析推导算法的时间复杂度。-assumptions to meet the definition of reactor following the complete nature of the trigeminal tree : (1) Air trees reactor; (2) The root node is not less than the value of all the value-roots, and all the sub-trees are heap. Prepared using the above definition of the heap for sorting algorithm and analysis derived algorithm's time complexity.
Update : 2008-10-13 Size : 72637 Publisher : liujing

自已写的源码库,包含有,日志,反应器,主动器,和一个简单的HTTP服务器!写这个库的目的,主要是为了自己的软件工程思想(合理安排资源所处的位置)! 这是很久以前写的,现在回头看看,感觉还有很多需要改进的地方!-write their own code libraries, includes, log, reactor, on the initiative, and a simple HTTP server! This was the purpose is mainly to the software engineering (of reasonable arrangements resources are located)! This was written a long time ago, and now look back and feel there is a need to improve the lot!
Update : 2008-10-13 Size : 31802 Publisher : 王雷

DL : 0
通过堆(heap)排序法对关键字成员为实数的结构体一维数组进行排序计算和数值模拟。-through the reactor (heap) the keyword method of ranking members of the real structure of the one-dimensional array by calculated and Numerical simulation.
Update : 2008-10-13 Size : 1506 Publisher : lsx

J. Mark Steber的psk解调的经典文章中第一部分,希望堆大家有帮助-J. Mark Steber psk demodulation of the classic article, the first part, we hope that the reactor help
Update : 2008-10-13 Size : 83349 Publisher : hxl

autocad中关于实体选择集反应器使用的示例源码。-autocad entities on the choice set reactor examples of the use of the source code.
Update : 2008-10-13 Size : 36899 Publisher : zhifeng

本程序主要实现内存管理的演示说明功能,利用MFC将七个部分综合在一起来说明内存管理的相关知识,包含1:内存空间分配,2:分配失败,3:堆区学习,4:虚拟内存,5:内存泄漏,6:内存池,7:智能指针等七部分,现已实现分配失败,堆区学习,内存泄漏等三部分,其他的演示对话框已经完成,但是功能还未实现-this procedure main memory management functions of the presentations, MFC will use some combination of seven to illustrate the memory management of the relevant knowledge, including one : memory space allocation, 2 : allocation failures, 3 : Reactor Region on the Study, 4 : virtual memory, 5 : Memory Leak, 6 : memory pool, 7 : smart pointer in seven parts, is the failure to achieve distribution stacked Region on the Study, three memory leak, Other presentations dialog has been completed, but have not yet been realized function
Update : 2008-10-13 Size : 223671 Publisher : 罗恺

基于ace和wxWidgets结合使用的c/s结构的例子,server广播后,client对server发起连接,然后server启动接收线程,并将收到的数据通过单独的线程进行处理;该代码有以下特点:wxWidgets事件循环和ace的Reactor事件循环并行处理,定时器以及读写的并行处理,udp和tcp通信的并行处理,ui线程和通信线程的并行处理;有此例子,开发跨平台跨编译器的带图形界面的c/s程序易如反掌。-wxWidgets based ace and the combined use of c / s structure of the examples, After the broadcast server, client connect to server initiated, then start receiving threaded server and the data received through a separate thread processing; The code has the following characteristics : wxWidgets ace incident cycle and the cycle of Reactor incident parallel processing, Timer and writable parallel processing, tcp and udp communications parallel processing, Got threads and the threads in parallel communications; this example, Cross-platform development of cross-compiler with the graphical interface c / s procedures as easy.
Update : 2008-10-13 Size : 2088889 Publisher : wuyan

de4dot-Reactor5.0-wuhensoft 支持NET Reactor 4.9 5.0 反混淆工具(De4dot-Reactor5.0-wuhensoft supports NET Reactor 4.9 5 anti aliasing tool.)
Update : 2024-05-06 Size : 849920 Publisher : wang0591
« 1 23 4 5 6 7 8 9 10 ... 14 »
DSSZ is the largest source code store in internet!
Contact us :
1999-2046 DSSZ All Rights Reserved.