Theory of applied robotics
kuznetsov yu.a. elements of applied bifurcation theory (2ed, springer, 1998)
... Definition of a dynamical system The notion of a dynamical system is the mathematical formalization of the general scientific concept of a deterministic process. The future and past states of many ... of the evo- lution of the system in the course of t + s units of time, starting at a point x ∈ X, is the same as if the system were first allowed to change from the state x over o...
Ngày tải lên: 24/04/2014, 16:50
The theory of financial intermediation: An essay on what it does (not) explain
... by traditional banks. Does the amended theory fully contradict the present one and have the concepts of the present theory become obsolete? The concepts of the present theory of financial intermediation ... industry, of the agency theory, and the theory of imperfect or asymmetric information. Basically, we may distinguish between three lines of reasoning that aim at expla...
Ngày tải lên: 24/10/2012, 09:11
Circuit theory of finance and the role of incentives in financial sector reform
... work of Prof. Augusto Graziani in the field of monetary circuit theory. The author wishes to thank Jerry Caprio, Stjin Claessens, and Larry Promisel for their helpful comments on earlier drafts of ... Structural implications of CTF Circuit theory of finance (CTF) bears important implications in terms of financial market structure, microeconomic imbalances, and the role of sav...
Ngày tải lên: 24/10/2012, 09:33
Theory of stochastic local area channel modeling for wireless communications
... applicable to any type of wireless data transmission, regardless of bandwidth, carrier frequency, or environment of operation. The final chapters of the dissertation deal with applied statistics and ... overview of basic principles. The discussion of the wideband spatio-temporal measurement campaign at 1920 MHz makes an excellent case study in applied channel modeling and ties...
Ngày tải lên: 20/11/2012, 11:36
Handbook of Applied Cryptography - chap9
... that weaknessesof the underlying hash function become known. Algorithm 9.69 is such a tech- nique,constructedusingMD5. It providesperformanceclose to that of MD5(5-20%slower in software). Handbook of Applied ... requirement in some of the proposed applications of §9.5.2. One example where near-collision resistance is necessary is when only half of the output bits of a hash funct...
Ngày tải lên: 17/10/2013, 16:15
Handbook of Applied Cryptography - chap10
... proofs were formalized in 1985 by Gold- wasser, Micali, and Rackoff [481] in the context of an interactive proof of membership of a string x in a language L; they showed that the languages of ... in particular, Feige, Fiat, and Shamir[383] adapted the conceptsof interactiveproofs of membershipto interactiveproofs Handbook of Applied Cryptography by A. Menezes, P. van Oorschot an...
Ngày tải lên: 20/10/2013, 03:15
Handbook of Applied Cryptography - chap11
... message recovery refers to the ratio of the logarithm(base2) of the size of the signingspaceM S to the logarithm (base 2) of the size of M R , the image space of the redundancy function. Hence, ... made independently of the choice of the signing transformations in S A . Example 11.21 provides a specific example of a redundancy function which compromises the security of the...
Ngày tải lên: 20/10/2013, 03:15
Handbook of Applied Cryptography - chap12
... A more precise statement of Fact 12.79 requires con- sideration of entropy; the statement holds if the conference keys in question have m bits of entropy. Handbook of Applied Cryptography by A. ... coalitions of a specified maximum size. The initial keying material as- signed to each user (a row of S, corresponding to k keys) allows computation of a larger number of derived k...
Ngày tải lên: 24/10/2013, 01:15
Complexity Theory of Transforms in Signal Processing
... Introduction Complexity theory of computation attempts to determine how “inherently” difficult are certain tasks. For example, how inherently complex is the task of computing an inner product of two vectors of length ... minimum number of multiplications required for the task. The consequences of Strassen’s algorithm for general matrix multiplication tasks are profound. The task...
Ngày tải lên: 25/10/2013, 02:15