Random Flashcards
What would be a reasonable sampling frequency for a signal?
Shannon’s theorem suggests a sampling of at least 2xf. However, for a better reconstruction of the signal, a reasonable sampling frequency should be 10 x f
Imagine we want to build a bionic eye that adds X-ray vision to a human and makes it possible to see through the walls. Identify two ethical questions related to this system. [5p]
Imagine we want to build a bionic eye that adds X-ray vision to a human and makes it possible to see through the walls. Identify two ethical questions related to this system. [5p]
What is an ultrasound sensor? What does it measure, and how does it work?
An ultrasound sensor, also known as sonar, makes use of echolocation such that it sends out a beam with a frequency beyond human hearing in order to measure the time needed to receive the echo reflected by the object.
What is a passive opto-sensor? What does it measure?
A passive opto-sensor would sense and measure the ambient light only.
What is an active opto-sensor? What does it measure, and how?
An active opto-sensor would produce a red beam and measure the intensity of light reflected back from the illuminated surface. This also allows it to make a distinction between coloured surfaces.
What is the frequency of a sinusoidal signal with a period of 5 sec?
The formula for calculating the frequency of a sinusoidal signal is f = 1/5. Thus, its frequency is 1/5 Hz.
What is the FFT? Sketch FFT algorithm as a black box, and identify its inputs and outputs.
Fast Fourier Transform (FFT) is a fast and efficient algorithm for Discrete Fourier Transform (DFT), an algorithm to transform a time-domain representation of a digital signal into a frequency-domain signal.
Its inputs are a vector containing the digitised signal samples (x(n)) and the number of samples (N) with an output of a vector containing some amplitudes, ak.
We applied the FFT to a sampled signal with 1000 samples and sampling frequency Fs=8000Hz. What does the vector returned by the FFT contain?
What are the first and last elements? What is the distance between 2 adjacent elements?
The vector returned by FFT contains amplitudes from a0 to a1000.
Each frequency corresponding to each amplitude is calculated by the formula: fk = kFs/N. Thus, for a0 = f0 = 08000/1000 = 0 and a1000 = f1000 = 1000*8000/1000 = 1000
Enumerate the steps in a classification process
· Sense data from the environment.
· Preprocess sensor data.
· Explore data. Define the classes.
· Identify possible attributes (features) which will allow discrimination between classes. They should be compact and have discriminatory power.
· Process data to extract these features.
· Design a classifier and train it. For each training example, provide at least one feature vector.
· Evaluate the classifier. The classifier should be assessed to see how well it can generalize to new examples.
What is a rule-based classifier?
A rule-based classifier distinguishes between different classes by using a collection of this kind of "if...then" decision rules. The general form for a rule is as follows: (Condition) ! y, where Condition is a conjunction of features, and y is the class label.
Define the concept of frequency spectrum.
Frequency spectrum analysis aims to identify which frequencies are present in a time-varying signal, at a given moment.
What are the three waves of computing according to Mark Weiser?
Mainframe, personal computing, ubicomp
Explain Mark Weiser’s vision of Ubiquitous Computing
He envisioned a world where computing and applications are embedded in everyday objects like cars, televisions and clothes.
What does MEMS mean? Give some examples.
Microelectro-mechanical systems are a promising technology which is constantly evolving.
They are microns to millimeter-scale devices that integrate mechanical mechanisms together with the necessary electronic circuits, on a single silicon chip. MEMS can perform two basic functions: sensing and actuation. Examples of MEMS sensors are the accelerometers used to release safety airbags in modern cars.
How is a map represented in a computer-based navigation system?
In a digital road map, the roads are divided into segments, and each road segment is represented by two edges in the graph. The cost associated with each edge is not per definition the distance between the nodes, as you might think, but can be the expected travel time, the amount of money, fuel consumption, or number of traffic lights encountered on the way.
From the graph-theoretical point of view, the route planning in a navigation system is defined as a path-finding problem in a graph. Planning the optimal route from A to B is equivalent to finding a shortest path between the two nodes. Shortest means in this case a path with the lowest possible cost.
The most well-known algorithm for computing shortest paths is the Dijkstra’s algorithm. This algorithm works by visiting all nodes in the graph, beginning at the starting point. The search expands outward until it reaches the goal