Please carefully read the many features of your package and then write the specific function (at least 20 words). As far as possible not to let the station master of the time spent in the
標(biāo)簽： carefully the features function
上傳時(shí)間： 2013-12-16
上傳用戶：ouyangtongze
I want to provide an example file system driver for Windows NT/2000/XP. For some time I have worked on an implementation of RomFs. RomFs is a small filesystem originally implemented in Linux, because of its simple disk layout its a good choice for an example driver. The current status is a working read-only driver that supports caching of file data, the create functionallity still needs some work but I m releasing it due to the high public demand.
標(biāo)簽： provide Windows example driver
上傳時(shí)間： 2013-12-19
上傳用戶：zsjzc
The combinatorial core of the OVSF code assignment problem that arises in UMTS is to assign some nodes of a complete binary tree of height h (the code tree) to n simultaneous connections, such that no two assigned nodes (codes) are on the same root-to-leaf path. Each connection requires a code on a specified level. The code can change over time as long as it is still on the same level. We consider the one-step code assignment problem: Given an assignment, move the minimum number of codes to serve a new request. Minn and Siu proposed the so-called DCAalgorithm to solve the problem optimally. We show that DCA does not always return an optimal solution, and that the problem is NP-hard. We give an exact nO(h)-time algorithm, and a polynomial time greedy algorithm that achieves approximation ratio Θ(h). Finally, we consider the online code assignment problem for which we derive several results
標(biāo)簽： combinatorial assignment problem arises
上傳時(shí)間： 2014-01-19
上傳用戶：BIBI
The software is capable to simulate space time code [1] for QPSK modulation using different number of state. Examples of generator matrix up to 256 stetes are provided. Variable signal to noise ratio (SNR) might be applied to produce bit error rate (BER) or frame error rate (FER) curves.
標(biāo)簽： modulation different software simulate
上傳時(shí)間： 2014-01-22
上傳用戶：qq1604324866
Input : A set S of planar points Output : A convex hull for S Step 1: If S contains no more than five points, use exhaustive searching to find the convex hull and return. Step 2: Find a median line perpendicular to the X-axis which divides S into SL and SR SL lies to the left of SR . Step 3: Recursively construct convex hulls for SL and SR. Denote these convex hulls by Hull(SL) and Hull(SR) respectively. Step 4: Apply the merging procedure to merge Hull(SL) and Hull(SR) together to form a convex hull. Time complexity: T(n) = 2T(n/2) + O(n) = O(n log n)
標(biāo)簽： contains Output convex planar
上傳時(shí)間： 2017-02-19
上傳用戶：wyc199288
Custom Visual Basic Packager and Installer for Visual Basic Developers. This is a group of standard exe projects 1. Packager 2. Setup1 The packager works like Visual basic Application deployment Wizard. And the setup1 project is used for the installation of the package. This project demonstrates how to compile visual basic project without launching the Vb6 kit and retrieving the dependency Files of any Visual basic project (although roughly done without any specific algorithm), Somebody can help me with this. I don’ t have time for the project, so I don’ t want any comment on the code indentation or arrangement and variable scoping. Comments are in the code therefore it would not be a problem to understand the code. If anyone wants to vote, I will like it Oh! I found some of the setup1 code and modify it with new features, so i have no or less credit for the setup1 project I felt like sharing code with PSCites. Thats why I made it
標(biāo)簽： Visual Basic Developers Installer
上傳時(shí)間： 2017-02-26
上傳用戶：FreeSky
Easy implementation of PRIM and DIJKSTRA algorims for graph sorting. It also permit comparison of time betwen both algoritm.
標(biāo)簽： implementation comparison DIJKSTRA algorims
上傳時(shí)間： 2013-12-29
上傳用戶：王慶才
This is an implementation of double-array structure for representing trie, as proposed by Junichi Aoe [1]. Trie is a kind of digital search tree, an efficient indexing method with O(1) time complexity for searching. Comparably as efficient as hashing, trie also provides flexibility on incremental matching and key spelling manipulation. This makes it ideal for lexical analyzers, as well as spelling dictionaries. See the details of the implementation at [2]: http://linux.thai.net/~thep/datrie/datrie.html Historically, this was first implemented as C++ classes in a library called midatrie [2], but later simplified and rewritten from scratch in C.
標(biāo)簽： implementation double-array representing structure
上傳時(shí)間： 2013-12-10
上傳用戶：shinesyh
RTOS ThreadX Real-Time Embedded Multithreading: Using ThreadX and ARM Designations used by companies to distinguish their products are often claimed as trademarks. In all instances where CMP is aware of a trademark claim, the product name appears in initial capital letters, in all capital letters, or in accordance with the vendor鈥檚 capitalization preference. Readers should contact the appropriate companies for more complete information on trademarks and trademark registrations. All trademarks and registered trademarks in this book are the property of their respective holders.
標(biāo)簽： ThreadX Multithreading Designations Real-Time
上傳時(shí)間： 2013-12-18
上傳用戶：ZJX5201314
learning English The following appeared in a memorandum written by the vice president of Nature s Way, a chain of stores selling health food and other health-related products. "Previous experience has shown that our stores are most profitable in areas where residents are highly concerned with leading healthy lives. We should therefore build our next new store in Plainsville, which has many such residents. Plainsville merchants report that sales of running shoes and exercise clothing are at all-time highs. The local health club, which nearly closed five years ago due to lack of business, has more members than ever, and the weight training and aerobics classes are always full. We can even anticipate a new generation of customers: Plainsville s schoolchildren are required to participate in a fitness for life program, which emphasizes the benefits of regular exercise at an early age.
標(biāo)簽： memorandum following president learning
上傳時(shí)間： 2017-03-06
上傳用戶：youth25
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
