Search - Make - CodeBus

Search - Make - List

[Mathimatics-Numerical algorithms] 牛顿插值 DL : 0: 用C语言来实现的。牛顿插值法对一些函数作近似的替代，是N个节点数的插值函数。-use c language to make a Newton interpolation arithmetic.Newton interpolation arithmetic make a approximation of the function witch have N interpolation points
Date : 2008-10-13 Size : 18.17kb User : luo
[Mathimatics-Numerical algorithms] Jacobi迭代法 DL : 0: 用C语言来实现的。求解线性方程组的迭代，是一种简单的迭代法，可不如 Gauss-Seidel迭代法收敛速度快。-Use c language to make a Jacobi iterative arithmetic which could solve the linear equation group, but it s may be more slower than the Gauss-Seidel iterative arithmetic.
Date : 2008-10-13 Size : 19.94kb User : luo
[Mathimatics-Numerical algorithms] fivephilosopher DL : 0: 假如所有的哲学家都同时拿起左侧叉子，看到右侧叉子不可用，又都放下左侧叉子，等一会儿，又同时拿起左侧叉子，如此这般，永远重复。对于这种情况，即所有的程序都在无限期地运行，但是都无法取得任何进展，即出现饥饿，所有哲学家都吃不上饭。所以规定奇数号的哲学家先拿起他左边的叉子,然后再去拿他右边的叉子而偶数号的哲学家则相反.按此规定,将是0,1号哲学家竞争0号叉子,2,3号哲学家竞争2号叉子.即五个哲学家都竞争奇数号叉子,获得后,再去竞争偶数号叉子,最后总会有一个哲学家能获得两支叉子而进餐。而申请不到的哲学家进入等待，当吃完饭的哲学家放下叉子后其他哲学家便可以拿到叉子，因此不会出现饿死的哲学家。-If all philosophers have also picked up the left fork, the right fork to see is not available, they are both down the left fork, wait a little longer, at the same time, pick up the left fork, and so on, never repeat. In this case, all the procedures that are in operation indefinitely, but are unable to make any progress, there is hunger, all philosophers have not afford enough food. Therefore, the provisions of odd philosopher he first took up the left fork, then plain his right fork, and even philosophers, on the contrary. accordingly, will be 0. philosopher competition on the 1st fork 0, 2, on the 3rd philosopher competition on the 2nd fork. that is five philosophers competition odd, fork, access, even longer competitive, fork, they will eventually have access to a philosopher two fork a
Date : 2008-10-13 Size : 1.56kb User : 林茜
[Mathimatics-Numerical algorithms] REPEAT_S DL : 0: 本附录中的所有源程序文件可通过e-mail向读者发送，如有任何问题、要求或建议，欢迎给作者发e-mail，作者的e-mail地址是 bxjsyjs@hotmail.com。请读者注明e-mail接// 为了保证每个程序的完整性，使得都能单独运行，下列各节中不同的程序之间有很多重复的代-the appendix of all source documents are available through e-mail sent to the readers, if any, requests or proposals are welcome to the authors e-mail, the author's e-mail address is bxjsyjs@hotmail.com. Readers with e-mail access / / procedures to ensure the integrity of each and can make a separate operation, the following sections between different procedure a lot of repetitions generation
Date : 2008-10-13 Size : 929byte User : 小柔
[Mathimatics-Numerical algorithms] du DL : 0: 对队列操作,可以让人简单了解还可以加深对队列的理解-right queue operation, can make simple understanding can also deepen the understanding of the Queue
Date : 2008-10-13 Size : 1.13kb User : 李阳光
[Mathimatics-Numerical algorithms] FILE_CRC DL : 0: 计算文件的32位CRC校验码.比较简单实用,Demo中一次性读完整个文件是不可取的,您需要作些修改以应用于所有大小的文件CRC.-calculations of 32 of CRC. Relatively simple and practical, Demo one time reading the entire document is undesirable, You need to make some changes to apply to all size of the CRC document.
Date : 2008-10-13 Size : 23.16kb User : 阿乱
[Mathimatics-Numerical algorithms] tlsf DL : 0: 算法的许多例子都是最优化问题（ optimization problem），每个最优化问题都包含一组限制条件（ c o n s t r a i n t）和一个优化函数（ optimization function），符合限制条件的问题求解方案称为可行解（ feasible solution），使优化函数取得最佳值的可行解称为最优解（optimal solution）。-algorithm are many examples of optimization problems (optimization problem). Each issue contains a set of optimized constraints (c o n s t r a n t i), and an optimization function (opti mization function). meet the restrictions in the problem-solving program called feasible solution (feasible solution). make optimal function to achieve the best possible value of the solution as the optimal solution (optimal solution).
Date : 2008-10-13 Size : 40kb User : john
[Mathimatics-Numerical algorithms] dtgh DL : 0: 和贪婪算法一样，在动态规划中，可将一个问题的解决方案视为一系列决策的结果。不同的是，在贪婪算法中，每采用一次贪婪准则便做出一个不可撤回的决策，而在动态规划中，还要考察每个最优决策序列中是否包含一个最优子序列。-and the greedy algorithm, the dynamic programming, can be a solution to the problem as the result of a series of policy decisions. The difference is that the greedy algorithm, each using a greedy norms will make an irrevocable decision, and the dynamic programming, it is also necessary to study each optimal decision whether sequence contains an optimal sequences.
Date : 2008-10-13 Size : 37.46kb User : john
[Mathimatics-Numerical algorithms] VB_RS232_COM_CONTROL DL : 0: 使用 RS232串列通訊和機器人連結，並且給予Output指令去使Robot去移動-use RS232 serial link communications and robotics, Output and give instructions to make to Mobile Robot
Date : 2008-10-13 Size : 6.19kb User : Wei-cheng
[Mathimatics-Numerical algorithms] xianxing DL : 0: 计算方法c线性插值函数-function using c languange to make an algorithmic method of linear interpolation
Date : 2008-10-13 Size : 810byte User : 刘磊
[Mathimatics-Numerical algorithms] 计算服务器 DL : 0: CPU是计算机系统中一个十分重要的资源，本章主要介绍处理机的调度目标、策略以及评价方法等。因为处理机调度程序不可能选择全部驻留在外存的进程，因此，在调度一个进程占有处理机之前，系统必须按某种策略把外存中处于后备状态的作业选择出来，并创建进程和分配内存，为进程执行准备必需的资源。这一步称为作业调度或高级调度。作业调度的目标是尽量做到公平合理，能执行尽可能多的作业、尽快地响应时间以及高的设备利用率等。任一调度算法要同时满足这些调度目标是不可能的。大多数操作系统都是根据用户需要而采用兼顾某些目标的方法。比较常用的作业调度算法有：FCFS（先来先服务）、方法、SJP(最短作业优先)法、HRN(最高响应比)法等。这-CPU computer systems is a very important resource, this chapter introduces processor scheduling objectives, strategies and evaluation methods. Because the processor scheduling procedures could not choose Disk presence in all the process, and therefore, in the process of scheduling a possession before the processor, the system must be some kind of strategy to Disk backup were at the operational state of choice out and the process of creation and distribution of memory, the process of preparing the implementation of the necessary resources. This step as job scheduling or senior scheduling. Job Scheduling goal is to try to make it fair and reasonable to carry out the operation as much as possible, as soon as possible to response time and high efficiency in the use of equipment. As a schedulin
Date : 2008-10-13 Size : 7.35kb User : jane
[Mathimatics-Numerical algorithms] 离散牛顿法 DL : 2: 解非线性方程组的一种方法：先用一种优化方法将给定初值（它有可能会使得后续的牛顿法发散）通过一条比较快的途径收敛到精确解附近，得到一个新的初始点，然后再通过牛顿法将新的初始点迭代到精确解（一定的误差范围内）。这种方法的优点在于：它可以将牛顿法快速收敛的优势发挥出来，同时又避免了该方法收敛域比较窄的缺点。-solving nonlinear equations in a way : by using a method of optimizing initial Givens (it might make follow-up to Newton's law divergence) adopted a relatively fast convergence to the channel near the exact solution, to be a new starting point, and then Newton's law of the new iteration of the initial point of the exact solution ( some of error). This method has the advantage : it can be rapid convergence of Newton's method to exploit the advantages while avoiding convergence of the method is relatively narrow domain shortcomings.
Date : 2008-10-13 Size : 32.61kb User : 王廷
[Mathimatics-Numerical algorithms] 2002410_214420 DL : 0: 这是我用课余时间做的一个Flash播放器，在网上看到一些网友做了一些自已的播放器，可是还要注册，（对于我们这些穷学生来说哪有钱呀^_^　）于是自已做了一个，她不仅是完全免费，而且还代码公开。希望广大网友支持自由软件。里面有一个BUG不得不说出来，就是对多个文件进行播放时，必须远择多个文件，则否会出错，由于上学期马哲没及格，这学期要补考，所以没有花时间来修正它。对VB感兴趣的朋友们自已改改吧。*_*，如果有什么其他的建议，欢迎来信：fhjeipje@163.com-This what I used to do after school hours a Flash player, on the Internet to see some netizens do some of their own players, but also the registration (for those of us poor students which money ah ^ _ ^) So, do own one, and she is not only free but also code open. Netizens hope that the majority of support for free software. There are a BUG forced out, which is to broadcast a number of documents, must choose from a number of documents, but it was not to be wrong, as the last semester MA did not pass this semester to the make-up exam, there was no time to fix it. Right VB interested friends Redirection own it. * _ *, If any other suggestions are welcome letter : fhjeipje@163.com
Date : 2008-10-13 Size : 325.65kb User : 丁莉
[Mathimatics-Numerical algorithms] xianxing DL : 0: 计算方法c线性插值函数-function using c languange to make an algorithmic method of linear interpolation
Date : 2025-12-16 Size : 1kb User : 刘磊
[Mathimatics-Numerical algorithms] 计算服务器 DL : 0: CPU是计算机系统中一个十分重要的资源，本章主要介绍处理机的调度目标、策略以及评价方法等。因为处理机调度程序不可能选择全部驻留在外存的进程，因此，在调度一个进程占有处理机之前，系统必须按某种策略把外存中处于后备状态的作业选择出来，并创建进程和分配内存，为进程执行准备必需的资源。这一步称为作业调度或高级调度。作业调度的目标是尽量做到公平合理，能执行尽可能多的作业、尽快地响应时间以及高的设备利用率等。任一调度算法要同时满足这些调度目标是不可能的。大多数操作系统都是根据用户需要而采用兼顾某些目标的方法。比较常用的作业调度算法有：FCFS（先来先服务）、方法、SJP(最短作业优先)法、HRN(最高响应比)法等。这-CPU computer systems is a very important resource, this chapter introduces processor scheduling objectives, strategies and evaluation methods. Because the processor scheduling procedures could not choose Disk presence in all the process, and therefore, in the process of scheduling a possession before the processor, the system must be some kind of strategy to Disk backup were at the operational state of choice out and the process of creation and distribution of memory, the process of preparing the implementation of the necessary resources. This step as job scheduling or senior scheduling. Job Scheduling goal is to try to make it fair and reasonable to carry out the operation as much as possible, as soon as possible to response time and high efficiency in the use of equipment. As a schedulin
Date : 2025-12-16 Size : 16kb User : jane
[Mathimatics-Numerical algorithms] 离散牛顿法 DL : 0: 解非线性方程组的一种方法：先用一种优化方法将给定初值（它有可能会使得后续的牛顿法发散）通过一条比较快的途径收敛到精确解附近，得到一个新的初始点，然后再通过牛顿法将新的初始点迭代到精确解（一定的误差范围内）。这种方法的优点在于：它可以将牛顿法快速收敛的优势发挥出来，同时又避免了该方法收敛域比较窄的缺点。-solving nonlinear equations in a way : by using a method of optimizing initial Givens (it might make follow-up to Newton's law divergence) adopted a relatively fast convergence to the channel near the exact solution, to be a new starting point, and then Newton's law of the new iteration of the initial point of the exact solution ( some of error). This method has the advantage : it can be rapid convergence of Newton's method to exploit the advantages while avoiding convergence of the method is relatively narrow domain shortcomings.
Date : 2025-12-16 Size : 32kb User : 王廷
[Mathimatics-Numerical algorithms] 2002410_214420 DL : 0: 这是我用课余时间做的一个Flash播放器，在网上看到一些网友做了一些自已的播放器，可是还要注册，（对于我们这些穷学生来说哪有钱呀^_^　）于是自已做了一个，她不仅是完全免费，而且还代码公开。希望广大网友支持自由软件。里面有一个BUG不得不说出来，就是对多个文件进行播放时，必须远择多个文件，则否会出错，由于上学期马哲没及格，这学期要补考，所以没有花时间来修正它。对VB感兴趣的朋友们自已改改吧。*_*，如果有什么其他的建议，欢迎来信：fhjeipje@163.com-This what I used to do after school hours a Flash player, on the Internet to see some netizens do some of their own players, but also the registration (for those of us poor students which money ah ^ _ ^) So, do own one, and she is not only free but also code open. Netizens hope that the majority of support for free software. There are a BUG forced out, which is to broadcast a number of documents, must choose from a number of documents, but it was not to be wrong, as the last semester MA did not pass this semester to the make-up exam, there was no time to fix it. Right VB interested friends Redirection own it.* _*, If any other suggestions are welcome letter : fhjeipje@163.com
Date : 2025-12-16 Size : 325kb User : 丁莉
[Mathimatics-Numerical algorithms] 牛顿插值 DL : 0: 用C语言来实现的。牛顿插值法对一些函数作近似的替代，是N个节点数的插值函数。-use c language to make a Newton interpolation arithmetic.Newton interpolation arithmetic make a approximation of the function witch have N interpolation points
Date : 2025-12-16 Size : 18kb User : luo
[Mathimatics-Numerical algorithms] Jacobi迭代法 DL : 0: 用C语言来实现的。求解线性方程组的迭代，是一种简单的迭代法，可不如 Gauss-Seidel迭代法收敛速度快。-Use c language to make a Jacobi iterative arithmetic which could solve the linear equation group, but it s may be more slower than the Gauss-Seidel iterative arithmetic.
Date : 2025-12-16 Size : 20kb User : luo
[Mathimatics-Numerical algorithms] fivephilosopher DL : 0: 假如所有的哲学家都同时拿起左侧叉子，看到右侧叉子不可用，又都放下左侧叉子，等一会儿，又同时拿起左侧叉子，如此这般，永远重复。对于这种情况，即所有的程序都在无限期地运行，但是都无法取得任何进展，即出现饥饿，所有哲学家都吃不上饭。所以规定奇数号的哲学家先拿起他左边的叉子,然后再去拿他右边的叉子而偶数号的哲学家则相反.按此规定,将是0,1号哲学家竞争0号叉子,2,3号哲学家竞争2号叉子.即五个哲学家都竞争奇数号叉子,获得后,再去竞争偶数号叉子,最后总会有一个哲学家能获得两支叉子而进餐。而申请不到的哲学家进入等待，当吃完饭的哲学家放下叉子后其他哲学家便可以拿到叉子，因此不会出现饿死的哲学家。-If all philosophers have also picked up the left fork, the right fork to see is not available, they are both down the left fork, wait a little longer, at the same time, pick up the left fork, and so on, never repeat. In this case, all the procedures that are in operation indefinitely, but are unable to make any progress, there is hunger, all philosophers have not afford enough food. Therefore, the provisions of odd philosopher he first took up the left fork, then plain his right fork, and even philosophers, on the contrary. accordingly, will be 0. philosopher competition on the 1st fork 0, 2, on the 3rd philosopher competition on the 2nd fork. that is five philosophers competition odd, fork, access, even longer competitive, fork, they will eventually have access to a philosopher two fork a
Date : 2025-12-16 Size : 1kb User : 林茜

« 12 3 4 5 6 7 »