INFO2009 Group Assignment (Assignment 2)

Collection of resources and the group poster for INFO2009's Assignment 2.

Assignment on Modulation

Considers Sampling, Pulse Amplitude Modulation, Multiple Access, Quantisation, Pulse Coded Modulation, Manchester Line Coding, Amplitude Modulation, Double SideBand Suppressed Carrier Modulation, Quadrature Amplitude Modulation and M-ary Shift Keying.

INFO2009 Assignment 2 (Group 11) - An Interactive Tutorial on Digital Rights Management

This resource contains an interactive tutorial slide, a set of multiple choice questions and a poster that Group 11 composed for INFO2009 Assignment 2. The topic area for the resource is Digital Rights Management.

Privacy and Security - background grey literature online

Background reading for coursework to prepare a technical report as part of the orientation phase. These items are business documents (i.e. grey literature) which might be read as a prelude or complement to finding information in peer reviewed academic publications. grey literature links and articles to be used in preparation of technical report. See also overview guidance document for this assignment http://www.edshare.soton.ac.uk/8017/

Hiding routing information

This is the original "onion routing" paper, it explains in the details how onions are built and work. This is optional reading, although I strongly advise you to read the Introduction and section 3 "Onions"

INFO2009 CW2 2012-13 Briefing, advice and organisation

Notes on group organisation process and planning

PNP & AHS Assignment podcast

A brief introduction to the nursing assessemnt for the PNP and AHS modules

Assignment Instructions

Draft of assignment specification - to be moderated. also includes marking and feedback forms

On the exhaustiveness of truncation and dropping strategies in many-to-many matching markets

We consider two–sided many–to–many matching markets in which each worker may work for multiple firms and each firm may hire multiple workers. We study individual and group manipulations in centralized markets that employ (pairwise) stable mechanisms and that require participants to submit rank order lists of agents on the other side of the market. We are interested in simple preference manipulations that have been reported and studied in empirical and theoretical work: truncation strategies, which are the lists obtained by removing a tail of least preferred partners from a preference list, and the more general dropping strategies, which are the lists obtained by only removing partners from a preference list (i.e., no reshuffling). We study when truncation / dropping strategies are exhaustive for a group of agents on the same side of the market, i.e., when each match resulting from preference manipulations can be replicated or improved upon by some truncation / dropping strategies. We prove that for each stable mechanism, truncation strategies are exhaustive for each agent with quota 1 (Theorem 1). We show that this result cannot be extended neither to group manipulations (even when all quotas equal 1 – Example 1), nor to individual manipulations when the agent’s quota is larger than 1 (even when all other agents’ quotas equal 1 – Example 2). Finally, we prove that for each stable mechanism, dropping strategies are exhaustive for each group of agents on the same side of the market (Theorem 2), i.e., independently of the quotas.

Congress composition and electoral advantage

In 2003, an electoral reform changed the mechanism to assign seats in the Colombian Congress. I simulate the 2006 Senate elections using the previous assignment mechanism to determine which senators benefited from the reform, i.e. would have not been elected had the reform not been made. With the results of the simulation, I use a regression discontinuity design to compare the senators that would have been barely elected anyways with those who would have lost, but were near to be elected. I check the differences in the amount of law drafts presented, the attendance to voting sessions, and a discipline index for each senator as proxy of their legislative behavior. I find that the senators benefiting from the reform present a different legislative behavior during the 4-year term with respect to the senators that would have been elected anyways. Since the differential legislative behavior cannot be interpreted as being better (worse) politician, I examine if the behavioral difference gives them an electoral advantage. I find no difference in the electoral result of 2010 Senate election in terms of the probability of being (re)elected in 2010, the share of votes, the share of votes within their party list, and the concentration of their votes. Additionally, I check the probability of being investigated for links with paramilitary groups and I find no differences. The results suggest that political reforms can change the composition of governing or legislative bodies in terms of performance, but it does not necessarily translate into an electoral advantage.

Natural resource windfalls and efficiency of local government expenditures: evidence from Peru

We study the role of natural resource windfalls in explaining the efficiency of public expenditures. Using a rich dataset of expenditures and public good provision for 1,836 municipalities in Peru for period 2001-2010, we estimate a non-monotonic relationship between the efficiency of public good provision and the level of natural resource transfers. Local governments that were extremely favored by the boom of mineral prices were more efficient in using fiscal windfalls whereas those benefited with modest transfers were more inefficient. These results can be explained by the increase in political competition associated with the boom. However, the fact that increases in efficiency were related to reductions in public good provision casts doubts about the beneficial effects of political competition in promoting efficiency.

Multi-layer survivability: routing schemes for GMPLS-based networks

En les xarxes IP/MPLS sobre WDM on es transporta gran quantitat d'informacio, la capacitat de garantir que el trafic arriba al node de desti ha esdevingut un problema important, ja que la fallada d'un element de la xarxa pot resultar en una gran quantitat d'informacio perduda. Per garantir que el trafic afectat per una fallada arribi al node desti, s'han definit nous algoritmes d'encaminament que incorporen el coneixement de la proteccio en els dues capes: l'optica (WDM) i la basada en paquets (IP/MPLS). D'aquesta manera s'evita reservar recursos per protegir el trafic a les dues capes. Els nous algoritmes resulten en millor us dels recursos de la xarxa, ofereixen rapid temps de recuperacio, eviten la duplicacio de recursos i disminueixen el numero de conversions del trafic de senyal optica a electrica.

Congestion probability routing in virtual path ATM network

This dissertation focuses on the problem of providing mechanisms for routing point to point and multipoint connections in ATM networks. In general the notion of multipoint connection refers to connections that involve a group of users with more than two members. The main objective of this dissertation is to contribute to design efficient routing protocols with alterative routes in fully connected VP-based ATM Networks for call establishment of point to point and multipoint VC connections. An efficient route should be computed during this connection establishment phase.