lease read your package and describe it at least 40 bytes. System will automatically delete the directory of debug and release, so please do not put files on these two directory
标签： automatically describe package System
上传时间： 2017-03-28
上传用户：baiom
lease read your package and describe it at least 40 bytes. System will automatically delete the directory of debug and release, so please do not put files on these two directory
标签： automatically describe package System
上传时间： 2014-02-28
上传用户：dongbaobao
This book is an introduction to Ada 95. It uses an example-driven approach which gradually develops small trivial programs into large case-study type programs. The main emphasis of this book is on maintenance problems, and using object-oriented technology to write maintainable, extensible programs. Program design is introduced throughout the book, with hypothetical maintenance scenarios used to shoe design shortcomings. and revise them to accomodate maintenance needs. Practical issues such as debugging programs are tackled, and important Ada features not found in other languages are dealt with practically and early on in the text. These include exception handling, user-defined types, procedures, functions, packages and child packages.
标签： example-driven introduction gradually approach
上传时间： 2014-01-12
上传用户：koulian
CnCodeFormater Readme Author: passos Email: passos@cnpack.orgpassos@21cn.com Last Update:2003-12-16 Directories \CnParser Object Pascal 璇硶瑙ｆ瀽鍣? \DCU 娴嬭瘯宸ョ▼DCU杈撳嚭鐩綍 \Test 娴嬭瘯宸ョ▼ Surpport Simple Stamtment can work The others language future need to be test ... not Surpport Class type declare still cause error. And so on ... TODO Modify TCnCodeFormater s Class declare section. Add Scaner.ForwardToken future. any thing that I forget ...
标签： passos CnCodeFormater orgpassos Author
上传时间： 2013-12-10
上传用户：541657925
Introduction Sometimes you may collide with the following problem: a third-party binary component or control embedded into your application displays windows (usually message boxes) that hang your code until they are closed. If you do not have the source code of this binary and one does not have a good API to change one’s bad behaviour programmatically, it can be a real headache using the one. A famous example of such a binary is the WebBrowser control in .NET.
标签： Introduction third-party Sometimes following
上传时间： 2013-12-31
上传用户：pinksun9
The double-density DWT is an improvement upon the critically sampled DWT with important additional properties: (1) It employs one scaling function and two distinct wavelets, which are designed to be offset from one another by one half, (2) The double-density DWT is overcomplete by a factor of two, and (3) It is nearly shift-invariant. In two dimensions, this transform outperforms the standard DWT in terms of denoising however, there is room for improvement because not all of the wavelets are directional. That is, although the double-density DWT utilizes more wavelets, some lack a dominant spatial orientation, which prevents them from being able to isolate those directions.
标签： double-density improvement additional critically
上传时间： 2017-04-03
上传用户：dongbaobao
OpenOffice.org document containing: List of codes i have tested on a JinPeng C2000 mobile and their results. Some works, others not it is explained what code does if work. They are introduced where you type digits when making a call, unless specify it is not necesary to press call, like for wellknown *#06# -> that shows IMEI.
标签： OpenOffice containing document JinPeng
上传时间： 2013-12-13
上传用户：BIBI
OpenOffice.org document containing: List of codes i have tested on a JinPeng C2000 mobile and their results. Some works, others not it is explained what code does if work. They are introduced where you type digits when making a call, unless specify it is not necesary to press call, like for wellknown *#06# -> that shows IMEI.
标签： OpenOffice containing document JinPeng
上传时间： 2017-04-05
上传用户：13517191407
c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlying assumption that there are possibly distinct network paths between a source-destination pair. Given a directed graph as input, write a program that uses depth-first search to determine all such paths. note that, these paths are not vertex-disjoint i.e., the vertices may repeat but they are all edge-disjoint i.e., no two paths have the same edges. The input is the adjacency matrix of a directed acyclic graph and a pair(s) of source and destination vertices and the output should be the number of such disjoint paths and the paths themselves on separate lines. In case of multiple paths the output should be in order of paths with minimum vertices first. In case of tie the vertex number should be taken in consideration for ordering.
标签： fault-tolerant algorithms redundant underlyin
上传时间： 2013-12-18
上传用户：jkhjkh1982
This is a PHP search engine. It searches for text and then displays results. At the time I completed it it was the first of its kind. I spent many hours looking for something like it, but could not find anything. It searches the directory you put it in.
标签： displays searches complet results
上传时间： 2013-12-25
上传用户：dave520l
