嵌入式文件系統ucfs.zip This project should serve as an "easy start" with /FS. All paths are relative to the project file. You should therefore be able to copy the entire directory (including all subdirectories) to any location on your harddrive.
標簽： relative project should paths
上傳時間： 2015-04-28
上傳用戶：zhliu007
．數據結構 假設有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，則表示安全；否則系統不安全。
上傳時間： 2014-01-05
上傳用戶：moshushi0009
數據結構 假設有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，則表示安全；否則系統不安全。
上傳時間： 2013-12-24
上傳用戶：alan-ee
Attributes, Constraints, and Carry Logic Overview Information for Mentor Customers Schematic Syntax UCF/NCF File Syntax Attributes/Logical Constraints Placement Constraints Relative Location (RLOC) Constraints Timing Constraints Physical Constraints Relationally Placed Macros (RPM) Carry Logic in XC4000 FPGAs Carry Logic in XC5200 FPGAs
標簽： Constraints Information Attributes Customers
上傳時間： 2015-05-12
上傳用戶：cc1015285075
abel Tool Sample Requires: Visual Basic 6 and MapObjects 2.x Data: redlands.shp (Redlands sample data set from MO 2.x) Interactive Labeling Tool If the check box is checked, then the mouse down location will search for the closest line, and label it with the street name. If the check box is not checked, then the mouse down will turn into a pan/zoom tool. There is a slider bar to control the search tolerance in screen pixels for the labeling.
標簽： MapObjects Requires Redlands redlands
上傳時間： 2013-12-17
上傳用戶：sunjet
使用pso求最小化一函數 matlab程式碼，寫的非常簡潔(不到100行)，且還包括了2維的圖形展示，和大家分享參考!!! 一起學習matlab和各種optimize methods 最小化：(x-15)^2+(y-20)^2 The swarm matrix is swarm(index, [location, velocity, best position, best value], [x, y components or the value component]) Author: Wesam ELSHAMY (wesamelshamy@yahoo.com) MSc Student, Electrical Enginering Dept., Faculty of Engineering Cairo University, Egypt
上傳時間： 2013-12-18
上傳用戶：zhaiye
maven 2.0 The following instructions show how to install Maven 2: 1) Unpack the archive where you would like to store the binaries, eg: tar zxvf maven-2.0.tar.gz or unzip maven-2.0.zip 2) A directory called "maven-2.0" will be created. 3) Add the bin directory to your PATH, eg: export PATH=/usr/local/maven-2.0/bin:$PATH or set PATH="c:\program files\maven-2.0\bin" ％PATH％ 4) Make sure JAVA_HOME is set to the location of your JDK 5) Run "mvn --version" to verify that it is correctly installed.
標簽： instructions following archive install
上傳時間： 2014-01-19
上傳用戶：weiwolkt
This project should serve as an "easy start" with uC/FS. All pathes are relative to the project file. You should therefore be able to copy the entire directory (including all ubdirectories) to any location on your harddrive.
標簽： project relative pathes should
上傳時間： 2015-08-13
上傳用戶：開懷常笑
英文論文78頁，Dynamic Storage Allocation -A Survey and Critical Review by PaulR.Wilson at CS Dept.德州奧斯丁 講動態存儲分配，個人感覺不錯
上傳時間： 2015-11-10
上傳用戶：z1191176801
In addition to all the people who contributed to the first edition, we would like to thank the following individuals for their generous help in writing this edition. Very special thanks go to Jory Prather for verifying the code samples as well as fixing them for consistency. Thanks to Dave Thaler, Brian Zill, and Rich Draves for clarifying our IPv6 questions, Mohammad Alam and Rajesh Peddibhotla for help with reliable multicasting, and Jeff Venable for his contributions on the Network Location Awareness functionality. Thanks to Vadim Eydelman for his Winsock expertise. And finally we would like to thank the .NET Application Frameworks team (Lance Olson, Mauro Ottaviani, and Ron Alberda) for their help with our questions about .NET Sockets.
標簽： the contributed addition to
上傳時間： 2015-12-17
上傳用戶：dongqiangqiang
