Illustrate how stochasticity can be utilized in synthetic neural networks to resolve, at least in an asymptotic feel, issues that would in any other case be intractable. Name at the least two such stochastic engines, describe the r?ole of stochasticity in each, and become aware of the varieties of troubles that such synthetic neural gadgets appear capable of remedy. [10 marks] Illustrate the proof for stochasticity in natural apprehensive systems, and remark at the r?ole that it might play in neurobiological feature. What is the case supporting John von Neumann's deathbed prediction that stochasticity is probably a computational engine for the frightened gadget, instead of simply random noise? Describe at least one experiment involving neural tissue in support of this theory. [10 marks] 8 Database Topics Describe the basic structure of the ODMG-ninety three fashionable for Object Database Management. [5 marks] In what manner do those proposals allow database control to be included with Object-Oriented Distributed Programming? [3 marks] Explain the properties of collection types, taking care to distinguish between literals and objects. [6 marks] Describe how an SQL-well suited query language may be defined inside the ODMG widespread. What provision can be made for insertion, replace and deletion? [6 marks] 4 CST.97.7.Five 9 Security Describe the subsequent modes of operation of a block cipher: electronic codebook, cipher block chaining, output remarks, cipher remarks, message authentication code and hash function. [12 marks] With which of these modes would it usually be unwise to use the Data Encryption Standard set of rules? [3 marks] How could you pick a style of operation to shield the confidentiality of statistics site visitors on a radio link with acknowledged charges of (a) bit errors and (b) burst errors inflicting loss of synchronisation?

Define the kinds and terms of the language PCF. Describe the denotational semantics of PCF the use of domain names and non-stop capabilities. In what feel is the denotational semantics of PCF compositional? [12 marks] Explain the stability and adequacy homes of the denotational semantics with recognize to the operational semantics of PCF. (A definition of the PCF operational semantics want not be given.) [4 marks] Define the perception of contextual equivalence for PCF terms. Explain why the compositional, soundness and adequacy properties stated above imply that if closed PCF phrases of the same kind have same denotation, then they're contextually equivalent. [4 marks] eleven Information Theory and Coding The statistics in continuous but bandlimited signals is quantised, in that such non-stop indicators can be absolutely represented by a finite set of discrete numbers. Explain this precept in each of the subsequent 4 critical contexts or theorems. Be as quantitative as possible: (a) The Nyquist Sampling Theorem. [5 marks] (b) Logan's Theorem. [5 marks] (c) Gabor Wavelet Logons and the Information Diagram. [5 marks] (d) The Noisy Channel Coding Theorem (relation among channel bandwidth W, noise electricity spectral density N0, signal power P or signal-to-noise ratio P/N0W, and channel capability C in bits/second). [5 marks] 12 Computer Vision Discuss the r?ole of non-linear operators in imaginative and prescient for the extraction of motion statistics, texture information, shade information, and stereo facts. What are the restrictions of linear operators (inclusive of filters) in comparison with non-linear ones? What is a quadrature pair, and what is a Hilbert pair? What is a Hilbert Transform, and what is a natural manner to build a useful non-linear operator from it?

) Draw the reality tables to demonstrate the reality values of A ? B and A ? B in terms of the reality values of A and B. [2 marks] (ii) By thinking about their fact tables, set up the following equivalences of boolean propositions: 1. A ? (B ? C) = (A ? B) ? C. [5 marks] 2. (F ? B) = B, wherein F is the proposition "fake". [2 marks] 3. (B ? C) = ((B) ? C). [2 marks] (iii) By assigning suitable truth values to propositions B and C, give an explanation for why the equivalence three above fails to keep if "?" is replaced by means of "?". [3 marks] (b) The set S is described to be the least subset of (high quality) herbal numbers N such that: 1 ? S; if n ? S, then 3n ? S; if n ? S and n > 2, then (n ? 2) ? S. Show that S = m ? N zero.

The William Gates Building has a centrally controlled safety gadget, dividing the building into zones to which distinct classes of user can benefit get admission to. All building users are issued with security playing cards that let them bypass thru doors into permitted zones. (a) Imagine you are designing the security device from scratch. Draw two diagrams suitable for discussing the operation of the system with (i) destiny constructing users; (ii) patron engineering team of workers who will approve and control the data version. [4 marks each] (b) Outline a mission plan suitable for the control of this challenge, along with a brief clarification of the sort of activity to be executed in each segment. [6 marks]

4 RSA Encryption The exercise goes over an example of the RSA cryptosystem: 1. If the RSA key generator picks the two primes as p = 5 and q = 7, then what is the public modulus N and what is the private modulus = (N)? 2. Let the public exponent be e = 5. Use Euclidean Algorithm to check that GCD(o, e) = 1, and use the extended version to find d, the multiplicative inverse of e mod . 3. What are the RSA public key and private key resulting from the above choices?