Search - max m - CodeBus

Search - max m - List

[Other] 银行家算法 2 DL : 0: ．数据结构假设有M个进程N类资源，则有如下数据结构： MAX[M*N] M个进程对N类资源的最大需求量 AVAILABLE[N] 系统可用资源数 ALLOCATION[M*N] M个进程已经得到N类资源的资源量 NEED[M*N] M个进程还需要N类资源的资源量 2．银行家算法设进程I提出请求Request[N]，则银行家算法按如下规则进行判断。 (1)如果Request[N]<=NEED[I，N]，则转(2)；否则，出错。 (2)如果Request[N]<=AVAILABLE，则转(3)；否则，出错。 (3)系统试探分配资源，修改相关数据： AVAILABLE=AVAILABLE-REQUEST ALLOCATION=ALLOCATION+REQUEST NEED=NEED-REQUEST (4)系统执行安全性检查，如安全，则分配成立；否则试探险性分配作废，系统恢复原状，进程等待。 3．安全性检查 (1)设置两个工作向量WORK=AVAILABLE；FINISH[M]=FALSE (2)从进程集合中找到一个满足下述条件的进程， FINISH[i]=FALSE NEED<=WORK 如找到，执行(3)；否则，执行(4) (3)设进程获得资源，可顺利执行，直至完成，从而释放资源。 WORK=WORK+ALLOCATION FINISH=TRUE GO TO 2 (4)如所有的进程Finish[M]=true，则表示安全；否则系统不安全。
Update : 2008-10-13 Size : 2.76kb Publisher : 王国强
[Other] 银行家算法的二解 DL : 0: 数据结构假设有M个进程N类资源，则有如下数据结构： MAX[M*N] M个进程对N类资源的最大需求量 AVAILABLE[N] 系统可用资源数 ALLOCATION[M*N] M个进程已经得到N类资源的资源量 NEED[M*N] M个进程还需要N类资源的资源量 2．银行家算法设进程I提出请求Request[N]，则银行家算法按如下规则进行判断。 (1)如果Request[N]<=NEED[I，N]，则转(2)；否则，出错。 (2)如果Request[N]<=AVAILABLE，则转(3)；否则，出错。 (3)系统试探分配资源，修改相关数据： AVAILABLE=AVAILABLE-REQUEST ALLOCATION=ALLOCATION+REQUEST NEED=NEED-REQUEST (4)系统执行安全性检查，如安全，则分配成立；否则试探险性分配作废，系统恢复原状，进程等待。 3．安全性检查 (1)设置两个工作向量WORK=AVAILABLE；FINISH[M]=FALSE (2)从进程集合中找到一个满足下述条件的进程， FINISH[i]=FALSE NEED<=WORK 如找到，执行(3)；否则，执行(4) (3)设进程获得资源，可顺利执行，直至完成，从而释放资源。 WORK=WORK+ALLOCATION FINISH=TRUE GO TO 2 (4)如所有的进程Finish[M]=true，则表示安全；否则系统不安全。 -data structure assumptions M N Resources process, the following data structure : MAX [M * N] M N process to the largest category of resources demand AVAILABLE [N] system available funding several sources ALLOCATION [M * N] M N process has been kind of resources RESOURCES NEED [M * N] M N process also needs the resources to resources such as volume two. Bankers algorithm based process I request Request [N], the banker's algorithm as follows rules of judgment. (1) If the Request [N]
Update : 2008-10-13 Size : 2.76kb Publisher : 王国强
[Other resource] qiufeixianxingfangchengzuzuixiaoerchengjiedeguangy DL : 2: 1.功能利用广义逆求解无约束条件下的优化问题(C语言) 2.参数说明 int m : 非线性方程组中方程个数 int n : 非线性方程组中未知数个数 double eps1 : 控制最小二乘解的精度要求 double eps2 : 用于奇异值分解中的控制精度要求 double x[n] : 存放非线性方程组解的初始近似值X(0),要求各分量不全为0 int ka : Ka＝max{m,n}+1 void (*f)() : 指向计算非线性方程组中各方程左端函数值的函数名(用户自编) void (*s)() : 指向计算雅可比矩阵的函数名 int ngin() : 函数返回一个标志值 3.文件说明 ngin.c函数文件 ngin0.c主函数文件-1. Using generalized inverse function for non-binding under the conditions of optimization problems (C) 2. Parameter Description int m : nonlinear equation group number int n equation : nonlinear equations were unknown number of double eps1 : Least Squares Solutions of control precision double eps2 : for the singular value decomposition of the control precision double x [n] : Nonlinear storage solutions of equations initial approximation of X (0), the requirements for the component failure 0 int ka : Ka = max (m, n) a void (* f) () : Calculation of nonlinear equations at the Group of the equation extreme value of the function name (user self) void (* s) () : at the Jacobian matrix calculation of the function name ngin int () : function returns a value of three signs. This document explains
Update : 2008-10-13 Size : 2.34kb Publisher : 罗坤
[Windows Develop] max DL : 0: //本程序随机赋值范围1-1000，解决伪随机 //采用动态分配空间用户输入数组大小，动态生成数组空间。然后从大到小排序 //输出第M大的数 //作者：赵俊 06计科班 //本程序所计算时间包括用户输入阶段的时间，单位以秒计算 //本程序采用VC6.0编译运行
Update : 2008-10-13 Size : 1.23kb Publisher : 赵俊
[Other] 银行家算法 2 DL : 0: ．数据结构假设有M个进程N类资源，则有如下数据结构： MAX[M*N] M个进程对N类资源的最大需求量 AVAILABLE[N] 系统可用资源数 ALLOCATION[M*N] M个进程已经得到N类资源的资源量 NEED[M*N] M个进程还需要N类资源的资源量 2．银行家算法设进程I提出请求Request[N]，则银行家算法按如下规则进行判断。 (1)如果Request[N]<=NEED[I，N]，则转(2)；否则，出错。 (2)如果Request[N]<=AVAILABLE，则转(3)；否则，出错。 (3)系统试探分配资源，修改相关数据： AVAILABLE=AVAILABLE-REQUEST ALLOCATION=ALLOCATION+REQUEST NEED=NEED-REQUEST (4)系统执行安全性检查，如安全，则分配成立；否则试探险性分配作废，系统恢复原状，进程等待。 3．安全性检查 (1)设置两个工作向量WORK=AVAILABLE；FINISH[M]=FALSE (2)从进程集合中找到一个满足下述条件的进程， FINISH[i]=FALSE NEED<=WORK 如找到，执行(3)；否则，执行(4) (3)设进程获得资源，可顺利执行，直至完成，从而释放资源。 WORK=WORK+ALLOCATION FINISH=TRUE GO TO 2 (4)如所有的进程Finish[M]=true，则表示安全；否则系统不安全。 -Banker s Algorithm
Update : 2025-02-19 Size : 2kb Publisher : 王国强
[Other] 银行家算法的二解 DL : 0: 数据结构假设有M个进程N类资源，则有如下数据结构： MAX[M*N] M个进程对N类资源的最大需求量 AVAILABLE[N] 系统可用资源数 ALLOCATION[M*N] M个进程已经得到N类资源的资源量 NEED[M*N] M个进程还需要N类资源的资源量 2．银行家算法设进程I提出请求Request[N]，则银行家算法按如下规则进行判断。 (1)如果Request[N]<=NEED[I，N]，则转(2)；否则，出错。 (2)如果Request[N]<=AVAILABLE，则转(3)；否则，出错。 (3)系统试探分配资源，修改相关数据： AVAILABLE=AVAILABLE-REQUEST ALLOCATION=ALLOCATION+REQUEST NEED=NEED-REQUEST (4)系统执行安全性检查，如安全，则分配成立；否则试探险性分配作废，系统恢复原状，进程等待。 3．安全性检查 (1)设置两个工作向量WORK=AVAILABLE；FINISH[M]=FALSE (2)从进程集合中找到一个满足下述条件的进程， FINISH[i]=FALSE NEED<=WORK 如找到，执行(3)；否则，执行(4) (3)设进程获得资源，可顺利执行，直至完成，从而释放资源。 WORK=WORK+ALLOCATION FINISH=TRUE GO TO 2 (4)如所有的进程Finish[M]=true，则表示安全；否则系统不安全。 -data structure assumptions M N Resources process, the following data structure : MAX [M* N] M N process to the largest category of resources demand AVAILABLE [N] system available funding several sources ALLOCATION [M* N] M N process has been kind of resources RESOURCES NEED [M* N] M N process also needs the resources to resources such as volume two. Bankers algorithm based process I request Request [N], the banker's algorithm as follows rules of judgment. (1) If the Request [N]
Update : 2025-02-19 Size : 2kb Publisher : 王国强
[Algorithm] qiufeixianxingfangchengzuzuixiaoerchengjiedeguangy DL : 0: 1.功能利用广义逆求解无约束条件下的优化问题(C语言) 2.参数说明 int m : 非线性方程组中方程个数 int n : 非线性方程组中未知数个数 double eps1 : 控制最小二乘解的精度要求 double eps2 : 用于奇异值分解中的控制精度要求 double x[n] : 存放非线性方程组解的初始近似值X(0),要求各分量不全为0 int ka : Ka＝max{m,n}+1 void (*f)() : 指向计算非线性方程组中各方程左端函数值的函数名(用户自编) void (*s)() : 指向计算雅可比矩阵的函数名 int ngin() : 函数返回一个标志值 3.文件说明 ngin.c函数文件 ngin0.c主函数文件-1. Using generalized inverse function for non-binding under the conditions of optimization problems (C) 2. Parameter Description int m : nonlinear equation group number int n equation : nonlinear equations were unknown number of double eps1 : Least Squares Solutions of control precision double eps2 : for the singular value decomposition of the control precision double x [n] : Nonlinear storage solutions of equations initial approximation of X (0), the requirements for the component failure 0 int ka : Ka = max (m, n) a void (* f) () : Calculation of nonlinear equations at the Group of the equation extreme value of the function name (user self) void (* s) () : at the Jacobian matrix calculation of the function name ngin int () : function returns a value of three signs. This document explains
Update : 2025-02-19 Size : 2kb Publisher : 罗坤
[Algorithm] chmmbox_1_2 DL : 0: CHMMBOX, version 1.2, Iead Rezek, Oxford University, Feb 2001 Matlab toolbox for max. aposteriori estimation of two chain Coupled Hidden Markov Models. -CHMMBOX, version 1.2, Iead Rezek, Oxford University, Feb 2001 Matlab toolbox for max. aposteriori es timation of two chain Coupled Hidden Markov Mod els.
Update : 2025-02-19 Size : 804kb Publisher : Joyce
[Fax program] lloydmax DL : 0: 一个基于Lloyd-Max算法的最优量化器程序，其中lloydmax为主程序-Lloyd-Max quantization algorithm for the optimal procedure, lloydmax which mainly procedures
Update : 2025-02-19 Size : 2kb Publisher : gongchao
[matlab] algorithms-LMS-adaptive-filtering DL : 0: adaptive filter and its M atlab simulation based on LM S algorithm.-adaptive filter and its simulation M atlab S based on LM algorithm.
Update : 2025-02-19 Size : 49kb Publisher : 上将
[Windows Develop] max DL : 0: //本程序随机赋值范围1-1000，解决伪随机 //采用动态分配空间用户输入数组大小，动态生成数组空间。然后从大到小排序 //输出第M大的数 //作者：赵俊 06计科班 //本程序所计算时间包括用户输入阶段的时间，单位以秒计算 //本程序采用VC6.0编译运行 -//This procedure range 1-1000 random assignment to address the pseudo-random// dynamic allocation of space for the user to enter the array size, array space dynamically generated. Smallest and then sort// output the first of several big M// Author: Jun-06 classes of// this procedure to calculate time, including user input phase of the time, units in seconds// This procedure using VC6.0 compiler run
Update : 2025-02-19 Size : 1kb Publisher : 赵俊
[OpenGL program] OpenGL DL : 0: 利用opengl和3ds max 做的荷兰风车
Update : 2025-02-19 Size : 494kb Publisher : xiaozhang
[Delphi VCL] StereoImage1.0 DL : 0: 这是我用Delphi和Matlab写的一个程序，可以生成立体图像（3DS Max 脚本）、将平面图像立体化、基本矩阵计算、极线校正。作者保留所有权利。请勿用于商业用途。欢迎大家对它进行完善。-This is what I use Delphi and a program written in Matlab, can generate three-dimensional images (3DS Max script), will be three-dimensional planar images, the basic matrix calculation, epipolar rectification. Author All rights reserved. Do not for commercial purposes. Welcome to perfect it.
Update : 2025-02-19 Size : 950kb Publisher : 刘然
[DirextX] Md2 DL : 0: 载入由3ds max生成的md2模型，进行动作控制-3ds max load generated by the MD2 model for motion control
Update : 2025-02-19 Size : 1.73mb Publisher : 刘阳
[OpenGL program] 3DEditor DL : 0: vc++和opengl编程导入.max文件，并实现对象的选择，渲染，平移，旋转等功能-vc++ and opengl import programming. max file, and select the object implementation, rendering, translation, rotation and other functions
Update : 2025-02-19 Size : 6.69mb Publisher : 张杰
[3D Graphic] ms3dImportExport_ver1_0 DL : 0: milkshape的.ms3d文件和3ds max的文件之间的转换工具，另外还支持gmax-A utility for importing and exporting .ms3d files into 3ds Max and Gmax. This is used in conjunction with GrumpyOldMan s meshconverter to get models from .mesh files into 3ds Max (and Gmax) which preserves all the mesh, bone, vertex weighting, etc. information and to export them out again. Also supports animations in that ms3d files which have merged animation files with them through the animmerge function of the Python animation utilities are supported for both import and export. This has been tested for regular units, mounts, and siege engines, but is still intended as an alpha release.
Update : 2025-02-19 Size : 50kb Publisher : 许志腾
[Data structs] second_max DL : 0: 以高效率的方法查找一个数组中的第二大数，数组中的数可以相同.同时对各种可能发生的错误返回相应得错误代码。-find second max number in a high effective method.The number in the array could be the same.meanwhile ,the program return special error code
Update : 2025-02-19 Size : 1kb Publisher : 龙熹
[Communication-Mobile] vij1 DL : 0: function ber_ml=Alamoudi(snr,soglia) This function simulates a Alamouti scheme. The input variables are soglia and snr. Soglia: is the number of errors after which the iterations stop. For better results, put high value of soglia, but the simulation is longer. snr: the signal to noise ratio (if u don t know what is a signal to noise ratio, well, come back to your high school!). Note: U should use this function with a main function in wich u chose different value of snr. That s because this function work just with one value of snr. If u have problem with this code, write me at m.allegritti@email.it. Take care! Max
Update : 2025-02-19 Size : 1kb Publisher : dasu
[matlab] Quantizer-lloyd DL : 0: 有关标量量化的lloyd-max方法及信噪比，信息熵，最小平方距离的度量方法-The scalar quantization of the lloyd-max method and signal to noise ratio, information entropy, least squares method of distance measurement
Update : 2025-02-19 Size : 23kb Publisher : zhaotao
[matlab] SphereDecoder DL : 0: 用于MIMO检测的sphere decoder程序- This function implements a soft output sphere decoder. Based on the paper: C. Studer, M. Wenk, A. Burg, and H. Blocskei: "Soft-Output Sphere Decoding: Performance and Implementation Aspects", Asilomar 2006 R ... is an upper triangular matrix obtained from the QR decomposition of the MIMO channel H s ... received symbol (column) vector, s=Q^H*y dist_ZF ... Distance for the zero forcing solution symbols_ZF ... ZF solution M ... number of bits encoded in every layer [1 x nTA] symbol_alphabet ... for the demapping [nTA x 2^max(M)], filled with zeros for smaller symbol alphabets bittable ... matrix containing the bits according to the symbol_alphabet [sum(M) x 2^max(M)]
Update : 2025-02-19 Size : 3kb Publisher : bennytang

« 12 3 4 5 »