b-树的增加,因为我看到的资料里的最大关键字数目为m-1,我考虑了一下,2-3树的删除会比较麻烦,后来看了下算法导论,别人的数目是2t-1,所以相同情况下是2-3-4树,我考虑按照这个因子再写一个,增加删除部分,有问题可以联系我,联系方式在程序中已注明.
上传时间： 2017-04-04
上传用户：pkkkkp
b-树的增加,删除,已对八百万个数据进行过测试,而且是对多个M值
上传时间： 2014-01-17
上传用户：nairui21
B-M 算法的matlab实现 密码学中又一重要的算法实现
上传时间： 2017-04-18
上传用户：二驱蚊器
同时由B.W.Kernighan和D.M.Ritchit合著了著名的“THE C PROGRAMMING LANGUAGE”一书。通常简称为《K&R》，也有人称之为《K&R》标准
标签： PROGRAMMING Kernighan LANGUAGE Ritchit
上传时间： 2017-05-29
上传用户：ddddddos
介绍行列划分算法和矩阵相乘并行算法M P I 程序, 给出基于矩阵相乘并行算法的M P I 实现, 分析和讨 论处理器数目、复杂性、矩阵划分、B 子块传递、死锁避免和矩阵数据的获取等问题.
上传时间： 2017-06-03
上传用户：royzhangsz
Ｃ语言是在70年代初问世的。一九七八年由美国电话电报公司(AT&T)贝尔实验室正式发表了Ｃ语言。同时由B.W.Kernighan和D.M.Ritchit合著了著名的“THE C PROGRAMMING LANGUAGE”一书。通常简称为《K&R》，也有人称之为《K&R》标准。但是，在《K&R》中并没有定义一个完整的标准C语言，后来由美国国家标准学会在此基础上制定了一个C 语言标准，于一九八三年发表。通常称之为ANSI C。
标签： PROGRAMMING Kernighan Ritchit THE
上传时间： 2014-11-12
上传用户：思琦琦
c程序设计语言（第二版）版B.W.Kernighan、D.M.Ritchie 著
上传时间： 2014-01-24
上传用户：athjac
m a t l a b 编 程 实 例！
标签：
上传时间： 2013-12-21
上传用户：skfreeman
All inputs of the C16x family have Schmitt-Trigger input characteristics. These Schmitt-Triggers are intended to always provide proper internal low and high levels, even if anundefined voltage level (between TTL-VIL and TTL-VIH) is externally applied to the pin.The hysteresis of these inputs, however, is very small, and can not be properly used in anapplication to suppress signal noise, and to shape slow rising/falling input transitions.Thus, it must be taken care that rising/falling input signals pass the undefined area of theTTL-specification between VIL and VIH with a sufficient rise/fall time, as generally usualand specified for TTL components (e.g. 74LS series: gates 1V/us, clock inputs 20V/us).The effect of the implemented Schmitt-Trigger is that even if the input signal remains inthe undefined area, well defined low/high levels are generated internally. Note that allinput signals are evaluated at specific sample points (depending on the input and theperipheral function connected to it), at that signal transitions are detected if twoconsecutive samples show different levels. Thus, only the current level of an input signalat these sample points is relevant, that means, the necessary rise/fall times of the inputsignal is only dependant on the sample rate, that is the distance in time between twoconsecutive evaluation time points. If an input signal, for instance, is sampled throughsoftware every 10us, it is irrelevant, which input level would be seen between thesamples. Thus, it would be allowable for the signal to take 10us to pass through theundefined area. Due to the sample rate of 10us, it is assured that only one sample canoccur while the signal is within the undefined area, and no incorrect transition will bedetected. For inputs which are connected to a peripheral function, e.g. capture inputs, thesample rate is determined by the clock cycle of the peripheral unit. In the case of theCAPCOM unit this means a sample rate of 400ns @ 20MHz CPU clock. This requiresinput signals to pass through the undefined area within these 400ns in order to avoidmultiple capture events.For input signals, which do not provide the required rise/fall times, external circuitry mustbe used to shape the signal transitions.In the attached diagram, the effect of the sample rate is shown. The numbers 1 to 5 in thediagram represent possible sample points. Waveform a) shows the result if the inputsignal transition time through the undefined TTL-level area is less than the time distancebetween the sample points (sampling at 1, 2, 3, and 4). Waveform b) can be the result ifthe sampling is performed more than once within the undefined area (sampling at 1, 2, 5,3, and 4).Sample points:1. Evaluation of the signal clearly results in a low level2. Either a low or a high level can be sampled here. If low is sampled, no transition willbe detected. If the sample results in a high level, a transition is detected, and anappropriate action (e.g. capture) might take place.3. Evaluation here clearly results in a high level. If the previous sample 2) had alreadydetected a high, there is no change. If the previous sample 2) showed a low, atransition from low to high is detected now.
上传时间： 2013-10-23
上传用户：copu
98年全国大学生数学建模竞赛B题“水灾巡视问题”，是一个推销员问题，本题有53个点，所有可能性大约为exp(53),目前没有好方法求出精确解，既然求不出精确解，我们使用模拟退火法求出一个较优解,将所有结点编号为1到53,1到53的排列就是系统的结构,结构的变化规则是:从1到53的排列中随机选取一个子排列,将其反转或将其移至另一处,能量E自然是路径总长度。具体算法描述如下：步1： 设定初始温度T，给定一个初始的巡视路线。步2 ：步3 --8循环K次步3：步 4--7循环M次步4：随机选择路线的一段步5：随机确定将选定的路线反转或移动，即两种调整方式：反转、移动。步6：计算代价D，即调整前后的总路程的长度之差步7：按照如下规则确定是否做调整：如果D0,则按照EXP(-D/T)的概率进行调整步8:T*0.9-->T,降温
上传时间： 2015-03-14
上传用户：himbly
