This document specifies a subset of the C programming language which is intended to be suitable
for embedded automotive systems up to and including safety integrity level 3 (as defined in the
MISRA Guidelines). It contains a list of rules concerning the use of the C programming language
together with justifications and examples.
pdf格式的英文文獻(xiàn)，是關(guān)于認(rèn)知無線電網(wǎng)絡(luò)的，編者是加拿大桂爾夫大學(xué)的Qusay H. Mahmoud。ISBN：978-0-470-06196-1
章節(jié)內(nèi)容：
1 Biologically Inspired Networking
2 The Role of Autonomic Networking in Cognitive Networks
3 Adaptive Networks
4 Self-Managing Networks
5 Machine Learning for Cognitive Networks: Technology Assessment
and Research Challenges
6 Cross-Layer Design and Optimization in Wireless Networks
等，共計(jì)13章，全書348頁，pdf文件383頁。
This is a simple algorithm that downloads trading data from yahoo database. It is basically a large scale application of sqq.m which was originally submitted by Michael Boldin, link at acknowledgements.
Some of the functionalities of the package:
- User defined ticker list.
- Function for downloading most recent SP500 composition in ticker list.
- Control for bad data (e.g. a certain percentage of prices missing).
- Choice of frequency of data (e.g. weekly prices).
- Choice of starting and ending data.
- Function for saving the whole data in a pre-formatted excel file together with a full reports on missing data.
Exceptional C++ shows by example how to go about solid software engineering. Along with a lot of other material, this book includes expanded versions of the first 30 issues of the popular Internet C++ feature Guru of the Week (or, in its short form, GotW), a series of self-contained C++ engineering problems and solutions that illustrate specific design and coding techniques.
This code proposes genetic algorithm (GA) to optimize the point-to-point trajectory planning for a 3-link robot arm. The objective function for the proposed GA is to minimizing traveling time and space, while not exceeding a maximum
pre-defined torque, without collision with any obstacle in the robot workspace.
wxPython In Action，By combining introductions, overviews, and how-to examples, the In Action
books are designed to help learning and remembering. According to research in
cognitive science, the things people remember are things they discover during
self-motivated exploration.
A fractal is generally "a rough or fragmented geometric shape that can be split into parts, each of which is (at least approximately) a reduced-size copy of the whole,"[1] a property called self-similarity. The term was coined by Benoî t Mandelbrot in 1975 and was derived from the Latin fractus meaning "broken" or "fractured." A mathematical fractal is based on an equation that undergoes iteration, a form of feedback based on recursion.[2]
Because WDM networks are circuit switched loss networks blocking may occur because of lack of resources. Also in circuit switched networks many paths use the same links. This toolbox answers the question how different paths with different loads influence on each other and what is the blocking on each of the defined path. Toolbox is capable of computing blocking for three different WDM network types: with no wavelength conversion, with full wavelength conversion and with limited range wavelength conversion. It is worth noting that case for full conversion can be usefull for any circuit switched network without additional constraints (i.e. wavelength continuity constraint in WDM), for example telephone network.
Toolbox contains also scripts for defining network structures (random networks, user defined networks) and traffic matrixes. Three graph algorithms for shortest path computation are also in this toolbox (they are used for traffic matrix creation).
A certification path is an ordered list of certificates starting with a certificate issued by the relying
party s trust root, and ending with the target certificate that needs to be validated. Certification
path validation procedures are based on the algorithm supplied in ITU-T Recommendation X.509
and further defined in Internet Engineering Task Force (IETF) Request for Comments (RFC)
3280. Certification path processing verifies the binding between the subject distinguished name
and/or subject alternative name and the subject public key defined in the target certificate. The
binding is limited by constraints, which are specified in the certificates that comprise the path,
and inputs that are specified by the relying party. To ensure secure interoperation of PKI-enabled
applications, the path validation must be done in accordance with the X.509 and RFC 3280
specifications. This document provides the test assertions and the test cases for testing path
validation software against these specifications.
