Academiclub.com
 
Member Sign-In | Register Now  
 
Call us : + 91- 7840008585
Email Id : info@academiclub.com
Untitled Document
 
 

 

 
UPES Assignment 2014 Quantitative Techniques for Management Applications-2-2014J
 
Product Name : Quantitative Techniques for Management Applications-2-2014J
Product Code : AC2
Category : UPES
Soft Copy Type B  : Rs. 1000   img
 
      Share |
Description :

Section A (20 Marks)

Write short notes on any four of the following:

  1. Types of Markov models
  2. Difference between primary and secondary data
  3. Features of sampling techniques
  4. Coefficient of variation
  5. Utility and Advantages of Diagrammatic Presentation

 

Section B (30 marks)

(Attempt any three)

  1. Explain game and its types. What are the assumptions made in the theory of games?
  2. What are the characteristics of data? Why data is required in the organizations? What are the key problems in data collections?
  3. Define average. What are the different types of averages and their implication?

4.  Employment figures in thousands for Neo-Classical City and suburbs are given below. Perform the required analysis.

a.  Using linear forecasts, predict the year in which employment will be the same for the two locations.

b. Construct the NCC confidence interval for that year.

c.  Correlate the employment figures for the two areas using both parametric and non-parametric methods and test the significance of the correlation coefficients.

d.    Fit a modified exponential trend to SUB data and discuss the results in terms of your findings in (1) above.

e.   Are NCC employment figures uniformly distributed over the period 1994 through 2000?

YEAR            1994    1995    1996    1997    1998    1999    2000

NYC   64.1     60.2     59.2     59.0     57.6     54.4     50.9

SUB    20.7     21.4     22.1     23.8     24.5     26.3     26.5

 

Section C (50 marks)

(Attempt all questions. Every question carries 10 marks)

Read the case “DSP Tricks: Smoothing impulsive noise” and answer the following questions:

DSP Tricks: Smoothing impulsive noise

In many electronic systems designs we may be required to make precise measurements in the presence of high noise or interference. Without some sort of analog signal conditioning, or digital signal processing, it can be difficult to obtain stable and repeatable, measurements.

This impulsive-noise smoothing trick, originally developed to detect microampere changes in milliampere signals, describes a smoothing algorithm that improves the stability of precision measurements in the presence of impulsive noise.

Practical noise reduction methods often involve multiple-sample averaging (block averaging) of a sequence of measured values, x(n), to compute a sequence of N-sample arithmetic means, M(q). As such, the block averaged sequence M(q) is defined by:

 

where the time index of the averaging process is q = 0, 1, 2, 3, etc. When N = 10 for example, for the first block of data (q = 0), time samples x(0) through x(9) are averaged to compute M(0). For the second block of data (q = 1), time samples x(10) through x(19)are averaged to compute M(1), and so on.

The following impulsive-noise smoothing algorithm processes a block of time-domain samples, obtained through periodic sampling, and the number of samples, N, may be varied according to individual needs and processing resources.

The processing of a single block of N time samples proceeds as follows: collect N+2 samples of x(n), discard the maximum (most positive) and minimum (most negative) samples to obtain an N-sample block of data, and compute the arithmetic mean, M(q), of the N samples. Each sample in the block is then compared to the mean.

The direction of each sample relative to the mean (greater than, or less than) is accumulated, as well as the cumulative magnitude of the deviation of the samples in one direction (which, by definition of the mean, equals that of the other direction). This data is used to compute a correction term that is added to the mean according to the following formula:

 

where A(q) is the corrected mean, M(q) is the arithmetic mean (average) from Eq. (1), Pos is the number of samples greater than M(q), and Neg is the number of samples less than M(q), and Dtotal is the sum of deviations from the mean (absolute values and one direction only). Dtotal, then, is the sum of the differences between the Pos samples and M(q).

For an example, consider a system acquiring 10 measured samples of 10, 10, 11, 9, 10, 10, 13, 10, 10, and 10. The mean is M = 10.3, the total number of samples positive is Pos = 2, and the total number of samples negative is Neg = 8 (so Pos"Neg = "6).

The total deviation in either direction from the mean is 3.4 [using the eight samples less than the mean, (10.3"10) times 7 plus (10.3"9); or using the two samples greater than the mean, (13"10.3) plus (11"10.3)]. With Dtotal = 3.4, Eq. (2) yields an improved result of A = 10.096.

The smoothing algorithm's performance, relative to traditional block averaging, can be illustrated by example. Figure below shows a measured 300-sample x(n)signal sequence comprising a step signal of amplitude one contaminated with random noise (with a variance of 0.1) and two large impulsive-noise spike samples.

Figure: Noise smoothing for N = 10: (a) input x(n) signal; (b) block average output (white) and impulsive-noise smoothing algorithm output (solid).

A few meaningful issues regarding this noise smoothing process are:

1) The block size (N) used in the smoothing algorithm can be any integer, but for real-time fixed binary-point implementations it's beneficial to set N equal to an integer power of two.

In that case the compute-intensive division operations in Eq. (1) and Eq. (2) can be accomplished by binary arithmetic right shifts to reduce the computational workload.

2) If there's a possibility that more than two large noise spikes are contained in a block of input samples, then we collect more than N+2 samples of x(n) and discard the appropriate number of maximum and minimum samples to eliminate the large impulsive noise samples.

3) We could forego the Eq. (2) processing and merely perform Eq. (1) to compute the mean M(q). In that case, for a given N, the standard deviation of M(q)would be roughly 15-20% greater than A(q).

Used with the permission of the publisher, Prentice Hall, this on-going series of articles on Embedded.com is based on copyrighted material from "Understanding Digital Signal Processing, Second Edition" by Richard G. Lyons. The book can be purchased on line.

Richard Lyons is a consulting systems engineer and lecturer with Besser Associates. As a lecturer with Besser and an instructor for the University of California Santa Cruz Extension, Lyons has delivered digitasl signal processing seminars and training course at technical conferences as well at companies such as Motorola, Freescale, Lockheed Martin, Texas Instruments, Conexant, Northrop Grumman, Lucent, Nokia, Qualcomm, Honeywell, National Semiconductor, General Dynamics and Infinion.

 

Questions:

  1. What is the work of impulsive-noise smoothing trick?
  2. Write a formula to find corrected mean A(q).
  3. Write a formula to find arithmetic mean (average) M(q).
  4. What are the issues regarding noise smoothing process?
  5. Summarize the case-study in your own words.
 
Academiclub.com
 
  Useful Links
Home
Sample Work
Services
Projects
  Useful Links
How It Work
Enquiry
Contact Us
FAQ's
  Links
Terms & Condition
Privacy Policy
Customer Care : +91-7840008585
Email Consumer Care


 
Connect with us
Copyright © 2013 Academiclub.com