Easy installation Support servers like Tomcat, Resin, WebSphere, WebLogic etc. Multi-languages(English/Chinese...) Support RSS 2.0 RSS syndication Unlimited XML news source Customizable fetch time interval Customizable max entry count Customizable max content size
標(biāo)簽： Multi-languages installation WebSphere WebLogic
上傳時(shí)間： 2014-01-03
上傳用戶(hù)：懶龍1988
10分鐘學(xué)會(huì)SQl第三版 Sams Teach Yourself SQL in 10 Minutes has established itself as the gold standard for introductory SQL books, offering a fast-paced accessible tutorial to the major themes and techniques involved in applying the SQL language. Forta s examples are clear and his writing style is crisp and concise. As with earlier editions, this revision includes coverage of current versions of all major commercial SQL platforms. New this time around is coverage of MySQL, and PostgreSQL. All examples have been tested against each SQL platform, with incompatibilities or platform distinctives called out and explained.
標(biāo)簽： established Yourself standard Minutes
上傳時(shí)間： 2014-07-07
上傳用戶(hù)：Pzj
物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location Vehicle routing: VRP, VRP with time windows, traveling salesman problem (TSP) Networks: Shortest path, min cost network flow, minimum spanning tree problems Geocoding: U.S. city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting Layout: Steepest descent pairwise interchange (SDPI) heuristic for QAP Material handling: Equipment selection General purpose: Linear programming using the revised simplex method, mixed-integer linear programming (MILP) branch and bound procedure Data: U.S. cities with populations of at least 10,000, U.S. highway network (Oak Ridge National Highway Network), U.S. 3- and 5-digit ZIP codes
標(biāo)簽： location location-allocation Continuous alternate
上傳時(shí)間： 2015-05-17
上傳用戶(hù)：kikye
Although there has been a lot of AVL tree libraries available now, nearly all of them are meant to work in the random access memory(RAM). Some of them do provide some mechanism for dumping the whole tree into a file and loading it back to the memory in order to make data in that tree persistent. It serves well when there s just small amount of data. When the tree is somewhat bigger, the dumping/loading process could take a lengthy time and makes your mission-critical program less efficient. How about an AVL tree that can directly use the disk for data storage ? If there s something like that, we won t need to read through the whole tree in order to pick up just a little bit imformation(a node), but read only the sectors that are neccssary for locating a certain node and the sectors in which that node lies. This is my initial motivation for writing a storage-media independent AVL Tree. However, as you step forth, you would find that it not only works fine with disks but also fine with memorys, too.
標(biāo)簽： available libraries Although nearly
上傳時(shí)間： 2014-01-22
上傳用戶(hù)：zhoujunzhen
解決時(shí)鐘問(wèn)題，acm競(jìng)賽題 A weird clock marked from 0 to 59 has only a minute hand. It won t move until a special coin is thrown into its box. There are different kinds of coins as your options. However once you make your choice, you cannot use any other kind. There are infinite number of coins of each kind, each marked with a number d ( 0 <= 1000 ), meaning that this coin will make the minute hand move d times clockwise the current time. For example, if the current time is 45, and d = 2. Then the minute hand will move clockwise 90 minutes and will be pointing to 15. Now you are given the initial time s ( 0 <= s <= 59 ) and the coin s type d. Write a program to find the minimum number of d-coins needed to turn the minute hand back to 0.
標(biāo)簽： 時(shí)鐘
上傳時(shí)間： 2015-05-21
上傳用戶(hù)：rishian
c8051單片機(jī)源程序，包括adc。time等
標(biāo)簽： c8051 單片機(jī)源程序
上傳時(shí)間： 2013-12-08
上傳用戶(hù)：tedo811
his folder contains the following files: 1. 02490rxP802-15_SG3a-Channel-Modeling-Subcommittee-Report-Final.doc: This is the final report of the channel modeling sub-committee. 2. cmx_imr.csv (x=1, 2, 3, and 4) represent the files containing the actual 100 channel realizations for CM1, CM2, CM3, and CM4. The columns are organized as (time, amp, time, amp,...) 3. cmx_imr_np.csv (x=1, 2, 3, and 4) represent the files containing the number of paths in each of the 100 multipath realizations. 4. cmx_imr.mat (x=1, 2, 3, and 4) are the .mat files that can be loaded directly into Matlab (TM). 5. *.m files are the Matlab (TM) files used to generate the various channel realizations.
標(biāo)簽： a-Channel-Modeling-Subcommittee-R following contains folder
上傳時(shí)間： 2013-12-21
上傳用戶(hù)：hxy200501
Evaluate a sequence of Bessel functions of the first and second kinds and their derivatives with integer orders and real arguments
標(biāo)簽： derivatives functions and Evaluate
上傳時(shí)間： 2015-05-27
上傳用戶(hù)：685
改寫(xiě)的qtopia錄音放音程序，好用。下到板子上要調(diào)試一下，如果max time等于0需改源碼
上傳時(shí)間： 2015-05-28
上傳用戶(hù)：hasan2015
這里有2組圖，“1000.0.05”這一組是運(yùn)行結(jié)果比較好的一組圖，但是當(dāng)時(shí)修改了時(shí)間間隔而沒(méi)有改坐標(biāo)說(shuō)明，所以db1000.0.05.fig這幅圖的坐標(biāo)說(shuō)明后來(lái)做了人工改正（應(yīng)該是“time(0～250ms分成5000組,步長(zhǎng)0.05ms”）。
標(biāo)簽：
上傳時(shí)間： 2015-06-01
上傳用戶(hù)：haohaoxuexi
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
