Calculates if the brackets in a sentence are correctly close. Input consists, one per line, sentences with brackets, and output say YES if its correctly close, or NO int if its not saying where is the error. Input: ()[]<>(**) (*) (ASA Output: YES NO 2 NO 4
標(biāo)簽： Calculates correctly brackets consists
上傳時間： 2013-12-13
上傳用戶：aig85
Pattern-MAC (PMAC) protocol, instead of having fixed sleepwakeups, the sleep-wakeup schedules of the sensor nodes are adaptively determined. The schedules are decided based on a node’s own traffic and that of its neighbors.
標(biāo)簽： sleepwakeups sleep-wakeup Pattern-MAC schedules
上傳時間： 2017-08-28
上傳用戶：cainaifa
IntroToCrypto英文原版，第一版，Copyright 1990-1999 Network Associates, Inc. and its Affiliated Companies. All Rights Reserved. PGP*, Version 6.5.1
標(biāo)簽： IntroToCrypto 英文
上傳時間： 2014-01-21
上傳用戶：lps11188
RSA ( Rivest Shamir Adleman )is crypthograph system that used to give a secret information and digital signature . its security based on Integer Factorization Problem (IFP). RSA uses an asymetric key. RSA was created by Rivest, Shamir, and Adleman in 1977. Every user have a pair of key, public key and private key. Public key (e) . You may choose any number for e with these requirements, 1< e <Æ (n), where Æ (n)= (p-1) (q-1) ( p and q are first-rate), gcd (e,Æ (n))=1 (gcd= greatest common divisor). Private key (d). d=(1/e) mod(Æ (n)) Encyption (C) . C=Mª mod(n), a = e (public key), n=pq Descryption (D) . D=C° mod(n), o = d (private key
標(biāo)簽： crypthograph information Adleman Rivest
上傳時間： 2017-09-01
上傳用戶：chfanjiang
This book is about writing TinyOS systems and applications in the nesC language. This chapter gives a brief overview of TinyOS and its intended uses. TinyOS is an open-source project which a large number of research universities and companies contribute to. The main TinyOS website, http://www.tinyos.net, has instructions for downloading and installing the TinyOS programming environment. The website has a great deal of useful information which this book doesn’t cover, such as common hardware platforms and how to install code on a node.
標(biāo)簽： This applications language chapter
上傳時間： 2017-09-04
上傳用戶：253189838
The running time of quicksort can be improved in practice by taking advantage of the fast running time of insertion sort when its input is “nearly” sorted. When quicksort is called on a subarray with fewer than k elements, let it simply return without sorting the subarray. After the top-level call to quicksort returns, run insertion sort on the entire array to finish the sorting process.
標(biāo)簽： running advantage quicksort improved
上傳時間： 2013-12-01
上傳用戶：梧桐
to study the example of creation of tables, formative DB, and filling with their information. Using this example to create DB, satisfying a logical structure, to developed in previous laboratory work and to fill with its information. To study a command SQL SELECT.
標(biāo)簽： information formative creation example
上傳時間： 2017-09-15
上傳用戶：dengzb84
FP + OOP = Haskell. The programming language Haskell adds object-oriented functionality (using a concept known as type classes ) to a pure functional programming framework. This paper describes these extensions and analyzes its accomplishments as well as some problems.
標(biāo)簽： Haskell object-oriented functionality programming
上傳時間： 2014-09-02
上傳用戶：zhenyushaw
openssl源碼 The OpenSSL Project is a collaborative effort to develop a robust, commercial-grade, full-featured, and Open Source toolkit implementing the Secure Sockets Layer (SSL v2/v3) and Transport Layer Security (TLS) protocols as well as a full-strength general purpose cryptography library. The project is managed by a worldwide community of volunteers that use the Internet to communicate, plan, and develop the OpenSSL toolkit and its related documentation.
標(biāo)簽： ssl、openssl、網(wǎng)絡(luò)、安全
上傳時間： 2015-02-26
上傳用戶：cjm3345
The object detector described below has been initially proposed by P.F. Felzenszwalb in [Felzenszwalb2010]. It is based on a Dalal-Triggs detector that uses a single filter on histogram of oriented gradients (HOG) features to represent an object category. This detector uses a sliding window approach, where a filter is applied at all positions and scales of an image. The first innovation is enriching the Dalal-Triggs model using a star-structured part-based model defined by a “root” filter (analogous to the Dalal-Triggs filter) plus a set of parts filters and associated deformation models. The score of one of star models at a particular position and scale within an image is the score of the root filter at the given location plus the sum over parts of the maximum, over placements of that part, of the part filter score on its location minus a deformation cost easuring the deviation of the part from its ideal location relative to the root. Both root and part filter scores are defined by the dot product between a filter (a set of weights) and a subwindow of a feature pyramid computed from the input image. Another improvement is a representation of the class of models by a mixture of star models. The score of a mixture model at a particular position and scale is the maximum over components, of the score of that component model at the given location.
標(biāo)簽： 計算機(jī)視覺
上傳時間： 2015-03-15
上傳用戶：sb_zhang
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
