vo

Designing Interactive Applications Distinguish the phrases wishes evaluation and requirements analysis. Provide an example to illustrate the distinction. [3 marks] What is a robust requirement? Provide counter-examples and provide an explanation for why every instance isn't a robust requirement. [4 marks] What role does a purposeful specification play in a necessities specification? Give a one-sentence instance. [3 marks] The receptionist at a small studies laboratory is required to subject incoming messages and ensure that they attain the recipient in a well timed manner. Some messages arrive by means of phrase of mouth, others via telephone, courier, e-mail or FAX. There are about 100 recipients, maximum of whom are researchers. They spend a massive percentage in their time in meetings of 1 type or any other, a number of which might be held in places of work, the remainder in convention rooms. The receptionist endeavours to avoid interrupting crucial meetings unnecessarily. It is proposed to construct a system based upon Active Badge technology to enhance message dealing with sports in the laboratory. Each member of group of workers wears an active badge. An present Location Server presents patron applications with up to date records about the region and movements of every lively badge. Sketch out the methods you'll appoint to set up the users' wishes for the proposed system. Describe the kinds of records you would skip on to the designer and illustrate each with one or examples.

Consider the variations used within the production and rendering of a threedimensional model on a display screen. (a) List the three fundamental alterations inside the processing pipeline and provide an explanation for their roles. [6 marks] (b) Why is it convenient to represent the adjustments as matrices? [2 marks] (c) What are homogeneous coordinates? Explain how they may be used in modelling these variations as matrices. (d) Derive the matrix to represent a attitude transformation for a viewer at the foundation of a point in 3 dimensions to some extent on a display within the aircraft z = d.

(e) Perspective in classical artwork has vanishing points in the direction of which parallel traces converge. Explain mathematically why that is the case and show the way to calculate the vicinity on the display of the vanishing point for strains in a selected route. [5 marks] [Hint: It may be helpful to represent lines parametrically in vector form as P(s) = A + sV where V is a direction and A is any point on the line.] four Computer Graphics and Image Processing Consider a curve described through polynomial parametric segments Pi(s) for i = 1, 2, . . . M that interpolates a fixed of factors Ai0im in 3 dimensions. (a) What is supposed by way of Ck continuity at the junction of two segments? [3 marks] (b) What is the least order of the polynomials that must be used to obtain Ck continuity on the junctions? [2 marks] (c) Derive the Overhauser formulation for a set of weighting features w2(s), w1(s), w0(s) and w1(s) in order that the cubic curve section joining Ai1 and Ai may be expressed as Pi(s) = w2(s)Ai2 + w1(s)Ai1 + w0(s)Ai + w1(s)Ai+1 for 1 < i < m. [10 marks] (d) Extend this formulation to present a fixed of parametric patches Pi,j (s, t) for 1 < i < m and 1 < j < n interpolating a surface via an array of points Ai,jzeroim,0jn. [5 marks]

A full adder for a unmarried bit has three inputs, a, b and cin, and two outputs, s and cout for the sum and convey-out. State the formulae for s and cout in disjunctive everyday form. [2 marks] (b) Explain the operation of the following three procedures for managing bring in n-bit phrase adders, deriving formulae for the indicators concerned and explaining the restricting factors on their pace: (i) ripple deliver, [2 marks] (ii) convey-skip with constant-size blocks, and [6 marks] (iii) carry-bypass with variable-length blocks. [4 marks] (c) Assuming a put off of for a round of combinational logic along with negation, conjunction and disjunction, estimate the delays for the 3 designs applied to a forty eight-bit adder. [3 2 marks] three Digital Communication II (a) In the context of Quality of Service (QoS) in networking, what will we imply through elastic and inelastic applications? [2 marks] (b) Give two examples of every form of software and talk the application attributes and QoS requirements. [8 marks] (c) Discuss the issues faced with the aid of traditional Internet routers in managing inelastic site visitors. [6 marks] (d) How do the IntServ and DiffServ architectures differ in providing QoS, and how may they be hired together to offer an end-to-stop QoS? [4 marks] three (TURN OVER) CST.2008.9.Four 4 Quantum Computing (a) The no-cloning theorem is a declaration that is often stated to show that a quantum nation can not be exactly duplicated. (i) Give a mathematically precise statement of the no-cloning theorem. [2 marks] (ii) Give a proof of the no-cloning theorem. [4 marks] (b) The quantum teleportation protocol is a way by way of which one celebration, Alice, can ship a quantum state to any other celebration, Bob, with the aid of transmitting just two classical bits, provided that the 2 already percentage an entangled 2-qubit country. Explain how the quantum teleportation protocol works, sketching any circuit that can be used. [6 marks] (c) The Deutsch-Jozsa problem assumes that we're given a characteristic f : 0, 1 0, 1 in the shape of a quantum black field performingabi 7 only one use of Uf that determines whether f is consistent or balanced. Explain carefully what dimension is accomplished and why it gives the favored end result.

Explain the key elements in "FaceNet" that enabled it to achieve a major breakthrough in face recognition performance, with impressive pose-invariance as illustrated below, and illumination invariance. [5 marks] (b) Explain the Bayer pattern of colour separation used in many sensors for image acquisition, with reference to its effects on spatial resolution, the relative importance of luminance versus chrominance resolution, and the relative pixel densities of the various colour planes. [3 marks] (c) Consider the following pair of (6 6) filter kernels Why do these two kernels constitute a quadrature pair? [2 marks] (ii) To what kinds of image structure, and which orientations, are these detector kernels most sensitive? [2 marks] (iii) How would these kernels be applied directly to an image for filtering or feature extraction? [2 marks] (iv) How could their respective Fourier Transforms alternatively be applied to an image, to achieve the same effect as in (iii) but faster? [2 marks] (v) What is the "DC" response of each of the kernels, and what is the significance of this? [2 marks] (vi) How could these kernels be combined to locate facial features? [2 marks]

10 Foundations of Functional Programming

Give as direct a lot of rules as you can for changing lambda math to a construction

where there are no bound elements referred to, but where there are numerous events

of the three standard combinator constants S, K and I. [6 marks]

Portray tree-revamps sensible for reducing verbalizations composed similarly as

combinators. [6 marks]

Figure out how you could deal with the issue of observing the potential gains of bound

factors assuming you some way or another happened to clearly unravel lambda investigation. [8 marks]

5

For all of the given arrangements of terms, give a most expansive unififier or show why

none exists. (Here x, y, z are factors while a, b are consistent pictures.)

h(x, y, x) and

h(y, z, u)

h(x, y, z) and

h(f(y), z, x)

h(x, y, b) and

h(a, x, y)

h(x, y, z) and

h(g(y, y), g(z, z), g(u, u))

[4 marks]

A standard unifification computation takes a few terms t1 and t2 and returns a

substitution so much that t1 = t2. Show how this computation can be used to fifind

the unififier of a couple (n > 2) terms t1, t2, . . . , tn: a supplanting with the ultimate objective that

t1 = t2 = = tn. Show how the unififier is created from the unififiers

of n 1 arrangements of terms. (Expect that all important unififiers exist and ignore the

question of whether the unififiers are by and large expansive.) [6 marks]

Exhibit using objective the formula

To build a user-friendly tool for organizing your problem ideas. In particular, you want to build a form-based GUI program that will: (a) collect your ideas along with bits of evidence you can use to assess their worth; and (b) roughly rank the ideas based on their respective value. NOTE: There are going to be some basic requirements to the GUI, but the actual scene design is entirely up to you. The JavaFX module on Canvas provides a foundation on the basics of GUI building. Feel free to explore some other fun aspects of JavaFX! It is perfectly fine and essentially expected that you look up documentation on specific JavaFX classes. This homework is intentionally more open-ended, and we grade most of it manually.

Before starting, make sure to install JavaFX. The instructions for that can be found on Canvas - Module 10.

As part of your solution, you'll be provided two files

FileUtil.java - A utility class to help with saving startup ideas into a file so that you can later view

StartUpIdea.java - A class that represents a problem space to base your startup around. This class implements Comparable, so different startup ideas can be compared and sorted based on the attributes that will be described later. The toString method is used in FileUtil to save each idea.

You are to make a JavaFX class called StarterUpper. The class must meet the following requirements:

The title of the window must be "Problem Ideation Form." Any submissions without this title will not be considered. It must have one label (javafx.scene.control.Label) with your name anywhere in the main window. Any submissions without this label will not be considered.