Run the SQL script given to you to create a Library database. Note that each row in the Book table denotes a book copy. Thus, if the library carries three copies of the title "DBMS", there will be three rows in the Book table, one for each copy. Write the SQL statements to do the following against the database
標簽： the database Library script
上傳時間： 2014-08-29
上傳用戶：nanxia
libsvm is a simple, easy-to-use, and efficient software for SVM classification and regression. It solves C-SVM classification, nu-SVM classification, one-class-SVM, epsilon-SVM regression, and nu-SVM regression. It also provides an automatic model selection tool for C-SVM classification. This document explains the use of libsvm.
標簽： classification easy-to-use regression and
上傳時間： 2013-12-18
上傳用戶：253189838
300 km 傳輸線和功率補償仿真 The circuit below represents an equivalent power system feeding a 300 km transmission line. The line is compensated by a shunt inductor at its receiving end. A circuit breaker allows energizing and de-energizing of the line. To simplify matters, only one of the three phases is represented. The parameters shown in the figure are typical of a 735 kV power system.
標簽： equivalent represents 300 transmis
上傳時間： 2016-07-14
上傳用戶：15736969615
電力系統(tǒng)向量和連續(xù)暫態(tài)分析實例This circuit is a simplified model of a 60 Hz, 230 kV three-phase power system where only one phase is represented.
標簽： three-phase simplified circuit system
上傳時間： 2013-12-14
上傳用戶：ayfeixiao
Digital Signature Algorithm (DSA)是Schnorr和ElGamal簽名算法的變種，被美國NIST作為DSS(DigitalSignature Standard)。算法中應用了下述參數(shù)： p：L bits長的素數(shù)。L是64的倍數(shù)，范圍是512到1024； q：p - 1的160bits的素因子； g：g = h^((p-1)/q) mod p，h滿足h < p - 1, h^((p-1)/q) mod p > 1； x：x < q，x為私鑰 ； y：y = g^x mod p ，( p, q, g, y )為公鑰； H( x )：One-Way Hash函數(shù)。DSS中選用SHA( Secure Hash Algorithm )。 p, q, g可由一組用戶共享，但在實際應用中，使用公共模數(shù)可能會帶來一定的威脅。簽名及驗證協(xié)議如下： 1. P產生隨機數(shù)k，k < q； 2. P計算 r = ( g^k mod p ) mod q s = ( k^(-1) (H(m) + xr)) mod q 簽名結果是( m, r, s )。 3. 驗證時計算 w = s^(-1)mod q u1 = ( H( m ) * w ) mod q u2 = ( r * w ) mod q v = (( g^u1 * y^u2 ) mod p ) mod q 若v = r，則認為簽名有效。 DSA是基于整數(shù)有限域離散對數(shù)難題的，其安全性與RSA相比差不多。DSA的一個重要特點是兩個素數(shù)公開，這樣，當使用別人的p和q時，即使不知道私鑰，你也能確認它們是否是隨機產生的，還是作了手腳。RSA算法卻作不到。
標簽： Algorithm Signature Digital Schnorr
上傳時間： 2014-01-01
上傳用戶：qq521
8puzzle game by Java This program can automatically solve 8 puzzle games with Manhattan approach and show each step.
標簽： automatically Manhattan approach 8puzzle
上傳時間： 2016-07-24
上傳用戶：change0329
首先從起始點開始看它的八個方向中有幾個方向可以走，假如有5個方向可走，再看這5個位置下一步分別有幾步可走，把這個值賦給一個數(shù)組s[]，再對數(shù)組進行從小到大排序，然后從5步中s[]值最小的走，依次遞歸，每次從s[]值最小的走，如果步驟號step等于棋盤規(guī)格m*n，則說明全部走完了；如果遇到無路可走的情況，step--，退回到上一步，當一直退到起始點時候，說明無法全部遍歷。
上傳時間： 2016-07-25
上傳用戶：cursor
Advanced UNIX Programming is the long-awaited (19 years!) update to the 1985 original. Maybe "update" isn t the right word--of the 750-or-so pages in the new book, there are maybe two dozen paragraphs that are unchanged. The original covered about 70 system calls, and the new one covers about 300. （這是Advanced UNIX Programming的附書源碼）
標簽： update long-awaited Programming the
上傳時間： 2013-12-19
上傳用戶：xiaoxiang
C/C++ Reference There are no "Introduction to Programming" tutorials here. This site is meant to be used by more-or-less experienced C++ programmers, who have a good idea of what they want to do and simply need to look up the syntax. If you re interested in learning C/C++, try one of these sites: How C Programming Works C Programming C++ Language Tutorial
標簽： Introduction Programming Reference tutorials
上傳時間： 2014-07-26
上傳用戶：ljmwh2000
非常好的優(yōu)化算法的書，詳細介紹了蟻群算法和粒子群算法以及相關的matlab工具箱，講了理論和應用給出了工具箱的下載地址。 Swarm intelligence is an innovative computational way to solve hard problems. In particular, particle swarm optimization, also commonly known as PSO, mimics the behavior of a swarm of insects or a school of fish. If one of the particle discovers a good path to food the rest of the swarm will be able to follow instantly even if they are far away in the swarm. Swarm behavior is modeled by particles in multidimensional space that have two characteristics: a position and a velocity. These particles wander around the hyperspace and remember the best position that they have discovered. They communicate good positions to each other and adjust their own position and velocity based on these good positions.
標簽： 優(yōu)化算法
上傳時間： 2014-01-26
上傳用戶：zgu489
