Why J2ME Projects Fail
上傳時間： 2013-12-03
上傳用戶：zhuoying119
實現二個文件的比較功能.如b文件的每行在a文件中找到,則比較ok.否則比較Fail.
上傳時間： 2013-12-29
上傳用戶：851197153
FPFilter is a sample disk filter driver that demonstrates how a disk Failure prediction filter driver could be implemented. A Failure prediction filter driver can predict when a disk may Fail and notify the disk driver stack of this condition.
標簽： filter disk demonstrates prediction
上傳時間： 2015-03-30
上傳用戶：變形金剛
檢測windows下rootkit對文件的隱藏。some usermode overwrites first few bytes of ZwQueryDirectoryFile and that trick will Fail then :( So, you will probably need a small database of the correct indexes for all Windows versions
標簽： ZwQueryDirectoryFile overwrites usermode windows
上傳時間： 2014-12-08
上傳用戶：lps11188
Displaying large amounts of technical data in a chart can be a frustrating task. You can find tons of charting controls with fancy effects and useless features, but when it comes to displaying many curves at once, independently scaled on different axes, most of them Fail.
標簽： frustrating Displaying can technical
上傳時間： 2014-01-05
上傳用戶：exxxds
BNB20 Finds the constrained minimum of a function of several possibly integer variables. ％ Usage: [errmsg,Z,X,t,c,Fail] = ％ BNB20(fun,x0,xstatus,xlb,xub,A,B,Aeq,Beq,nonlcon,settings,options,P1,P2,...) ％ ％ BNB solves problems of the form: ％ Minimize F(x) subject to: xlb <= x0 <=xub ％ A*x <= B Aeq*x=Beq ％ C(x)<=0 Ceq(x)=0 ％ x(i) is continuous for xstatus(i)=0 ％ x(i) integer for xstatus(i)= 1 ％ x(i) fixed for xstatus(i)=2 ％
標簽： constrained variables function possibly
上傳時間： 2014-01-13
上傳用戶：youth25
This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may Fail. Given the demand d, we try to evaluate the system reliability that the maximum #ow of the network is not less than d. A simple algorithm is proposed "rstly to generate all lower boundary points for d, and then the system reliability can be calculated in terms of such points. One computer example is shown to illustrate the solution procedure.
標簽： capacities stochastic addresses network
上傳時間： 2015-12-03
上傳用戶：xfbs821
This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may Fail. Given the demand d, we try to evaluate the system reliability that the maximum #ow of the network is not less than d. A simple algorithm is proposed "rstly to generate all lower boundary points for d, and then the system reliability can be calculated in terms of such points. One computer example is shown to illustrate the solution procedure.
標簽： capacities stochastic addresses network
上傳時間： 2013-12-25
上傳用戶：ggwz258
This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may Fail. Given the demand d, we try to evaluate the system reliability that the maximum #ow of the network is not less than d. A simple algorithm is proposed "rstly to generate all lower boundary points for d, and then the system reliability can be calculated in terms of such points. One computer example is shown to illustrate the solution procedure.
標簽： capacities stochastic addresses network
上傳時間： 2014-01-09
上傳用戶：二驅蚊器
This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may Fail. Given the demand d, we try to evaluate the system reliability that the maximum #ow of the network is not less than d. A simple algorithm is proposed "rstly to generate all lower boundary points for d, and then the system reliability can be calculated in terms of such points. One computer example is shown to illustrate the solution procedure.
標簽： capacities stochastic addresses network
上傳時間： 2013-12-28
上傳用戶：獨孤求源
