Projecte d’ampliació de la L3 i la L5 de metro al Baix Llobregat

Treball de recerca realitzat per un alumne d’ensenyament secundari i guardonat amb un Premi CIRIT per fomentar l'esperit científic del Jovent l’any 2006. Projecte d'ampliació de les línies L3 i L5 del metro de Barcelona per tal de resoldre les mancances en matèria de mobilitat detectades al Baix Llobregat. Comença per l'anàlisi de la situació quant a tots els aspectes relatius a la mobilitat en què s'observa una deficiència considerable en el sistema de transport ferroviari. La proposta de l’ampliació consta d'una exhaustiva descripció del recorregut i de les diverses estacions que el constitueixen, juntament amb les actuacions complementàries que s'han de dur a terme per tal de millorar l'aspecte urbanístic. A més, es presenta una explicació dels diferents mètodes que es poden escollir per fer servir a l'hora de construir els túnels i les estacions, un repàs per diversos models de disseny que es poden aplicar a les estacions que s'han de construir, i també pels diferents sistemes de sosteniment i revestiment final de l'obra i la resta d'instal•lacions que s'han de crear. Per acabar, la resta de punts del projecte, tractats de forma resumida, inclouen els diferents tipus d'estudis i la memòria, les previsions de servei i la relació oferta-demanda, el material mòbil, el pressupost de l'obra i la tramitació final del projecte. L’acompanyen annexos com les fotos de l'emplaçament de cadascuna de les estacions i els plànols amb el recorregut que ha de seguir la línia.

Codes of best practice in competitive markets for managers

We study firms' corporate governance in environments where possibly heterogeneous shareholders compete for possibly heterogeneous managers. A firm, formed by a shareholder and a manager, can sign either an incentive contract or a contract including a Code of Best Practice. A Code allows for a better manager's control but makes manager's decisions hard to react when market conditions change. It tends to be adopted in markets with low volatility and in low-competitive environments. The firms with the best projects tend to adopt the Code when managers are not too heterogeneous while the best managers tend to be hired through incentive contracts when the projects are similar. Although the matching between shareholders and managers is often positively assortative, the shareholders with the best projects might be willing to renounce to hire the best managers, signing contracts including Codes with lower-ability managers.

Estudi d'impacte acústic de les obres d'un intercanviador de metro

En el territori del Barcelonès les obres han estat a l’ordre del dia. Abans de l’inici de la crisi es van encetar i programar nombroses obres tan d’immobles com de grans infraestructures com la que aquí es presenta: un intercanviador de metro. L’alta densitat demogràfica d’aquesta regió ha fet que aquests treballs realitzats a les obres siguin poc compatibles amb el benestar i la salut de la població. Un dels principals factors causants del malestar als veïns és el soroll. Mitjançant estudis de modelització acústica, com el realitzat en aquest projecte, es pretén preveure i evitar que l’afecció acústica derivada de les obres sigui perjudicial per la persona per tal de compatibilitzar al màxim possible les feines de l’obra amb el benestar general. Mitjançant el programa de monitorització acústica Cadna‐A i nombroses mesures acústiques in situ s’ha pogut preveure la futura afecció sonora de 6 fases d’obra considerades com les més sorolloses i s’han proposat un seguit de mesures preventives i/o correctores per tal d’assolir uns nivells acústics assequibles amb la legislació vigent.

QRP: An improved secure authentication method using QR codes

This paper presents the design and implementation of QRP, an open source proof-of-concept authentication system that uses a two-factorauthentication by combining a password and a camera-equipped mobile phone, acting as an authentication token. QRP is extremely secure asall the sensitive information stored and transmitted is encrypted, but it isalso an easy to use and cost-efficient solution. QRP is portable and can be used securely in untrusted computers. Finally, QRP is able to successfully authenticate even when the phone is offline.

Reliable and persistent storage for CoDeS a distributed collaborative system

This research is aimed to find a solution for a distributed storage system adapted for CoDeS. By studying how DSSs work and how they are implemented, we can conclude how we can implement a DSS compatible with CoDeS requirements.

On codes, matroids, and secure multiparty computation from linear secret-sharing schemes

Error-correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, the connections between codes, matroids, and a special class of secret sharing schemes, namely, multiplicative linear secret sharing schemes (LSSSs), are studied. Such schemes are known to enable multiparty computation protocols secure against general (nonthreshold) adversaries.Two open problems related to the complexity of multiplicative LSSSs are considered in this paper. The first one deals with strongly multiplicative LSSSs. As opposed to the case of multiplicative LSSSs, it is not known whether there is an efficient method to transform an LSSS into a strongly multiplicative LSSS for the same access structure with a polynomial increase of the complexity. A property of strongly multiplicative LSSSs that could be useful in solving this problem is proved. Namely, using a suitable generalization of the well-known Berlekamp–Welch decoder, it is shown that all strongly multiplicative LSSSs enable efficient reconstruction of a shared secret in the presence of malicious faults. The second one is to characterize the access structures of ideal multiplicative LSSSs. Specifically, the considered open problem is to determine whether all self-dual vector space access structures are in this situation. By the aforementioned connection, this in fact constitutes an open problem about matroid theory, since it can be restated in terms of representability of identically self-dual matroids by self-dual codes. A new concept is introduced, the flat-partition, that provides a useful classification of identically self-dual matroids. Uniform identically self-dual matroids, which are known to be representable by self-dual codes, form one of the classes. It is proved that this property also holds for the family of matroids that, in a natural way, is the next class in the above classification: the identically self-dual bipartite matroids.

On fast-decodable space-time block codes

We focus on full-rate, fast-decodable space–time block codes (STBCs) for 2 x 2 and 4 x 2 multiple-input multiple-output (MIMO) transmission. We first derive conditions and design criteria for reduced-complexity maximum-likelihood (ML) decodable 2 x 2 STBCs, and we apply them to two families of codes that were recently discovered. Next, we derive a novel reduced-complexity 4 x 2 STBC, and show that it outperforms all previously known codes with certain constellations.

On high-rate full-diversity 2x2 space-time codes with low-complexity optimum detection

The 2×2 MIMO profiles included in Mobile WiMAX specifications are Alamouti’s space-time code (STC) fortransmit diversity and spatial multiplexing (SM). The former hasfull diversity and the latter has full rate, but neither of them hasboth of these desired features. An alternative 2×2 STC, which is both full rate and full diversity, is the Golden code. It is the best known 2×2 STC, but it has a high decoding complexity. Recently, the attention was turned to the decoder complexity, this issue wasincluded in the STC design criteria, and different STCs wereproposed. In this paper, we first present a full-rate full-diversity2×2 STC design leading to substantially lower complexity ofthe optimum detector compared to the Golden code with only a slight performance loss. We provide the general optimized form of this STC and show that this scheme achieves the diversitymultiplexing frontier for square QAM signal constellations. Then, we present a variant of the proposed STC, which provides a further decrease in the detection complexity with a rate reduction of 25% and show that this provides an interesting trade-off between the Alamouti scheme and SM.

Low-density parity-check codes for nonergodic block-fading channels

We design powerful low-density parity-check (LDPC) codes with iterative decoding for the block-fading channel. We first study the case of maximum-likelihood decoding, and show that the design criterion is rather straightforward. Since optimal constructions for maximum-likelihood decoding do not performwell under iterative decoding, we introduce a new family of full-diversity LDPC codes that exhibit near-outage-limit performance under iterative decoding for all block-lengths. This family competes favorably with multiplexed parallel turbo codes for nonergodic channels.

Generalized low-density codes with BCH constituents for full-diversity near-outage performance

A new graph-based construction of generalized low density codes (GLD-Tanner) with binary BCH constituents is described. The proposed family of GLD codes is optimal on block erasure channels and quasi-optimal on block fading channels. Optimality is considered in the outage probability sense. Aclassical GLD code for ergodic channels (e.g., the AWGN channel,the i.i.d. Rayleigh fading channel, and the i.i.d. binary erasure channel) is built by connecting bitnodes and subcode nodes via a unique random edge permutation. In the proposed construction of full-diversity GLD codes (referred to as root GLD), bitnodes are divided into 4 classes, subcodes are divided into 2 classes, and finally both sides of the Tanner graph are linked via 4 random edge permutations. The study focuses on non-ergodic channels with two states and can be easily extended to channels with 3 states or more.

Full diversity product codes for block erasure and block fading channels

We show how to build full-diversity product codes under both iterative encoding and decoding over non-ergodic channels, in presence of block erasure and block fading. The concept of a rootcheck or a root subcode is introduced by generalizing the same principle recently invented for low-density parity-check codes. We also describe some channel related graphical properties of the new family of product codes, a familyreferred to as root product codes.

A comparison of full-rate full-diversity 2x2 space-time codes for WiMAX systems

Multiple-input multiple-output (MIMO) techniques have become an essential part of broadband wireless communications systems. For example, the recently developed IEEE 802.16e specifications for broadband wireless access include three MIMOprofiles employing 2×2 space-time codes (STCs), and two of these MIMO schemes are mandatory on the downlink of Mobile WiMAX systems. One of these has full rate, and the other has full diversity, but neither of them has both of the desired features. The third profile, namely, Matrix C, which is not mandatory, is both a full rate and a full diversity code, but it has a high decoder complexity. Recently, the attention was turned to the decodercomplexity issue and including this in the design criteria, several full-rate STCs were proposed as alternatives to Matrix C. In this paper, we review these different alternatives and compare them to Matrix C in terms of performances and the correspondingreceiver complexities.

Outage thresholds of LDPC codes over nonergodic block-fading channels

This paper derives approximations allowing the estimation of outage probability for standard irregular LDPC codes and full-diversity Root-LDPC codes used over nonergodic block-fading channels. Two separate approaches are discussed: a numerical approximation, obtained by curve fitting, for both code ensembles, and an analytical approximation for Root-LDPC codes, obtained under the assumption that the slope of the iterative threshold curve of a given code ensemble matches the slope of the outage capacity curve in the high-SNR regime.

On iterative performance of LDPC and Root-LDPC codes over block-fading channels

This paper presents our investigation on iterativedecoding performances of some sparse-graph codes on block-fading Rayleigh channels. The considered code ensembles are standard LDPC codes and Root-LDPC codes, first proposed in and shown to be able to attain the full transmission diversity. We study the iterative threshold performance of those codes as a function of fading gains of the transmission channel and propose a numerical approximation of the iterative threshold versus fading gains, both both LDPC and Root-LDPC codes.Also, we show analytically that, in the case of 2 fading blocks,the iterative threshold root of Root-LDPC codes is proportional to (α1 α2)1, where α1 and α2 are corresponding fading gains.From this result, the full diversity property of Root-LDPC codes immediately follows.

Metro display: sistema de visualización de información en una red de transporte público

El siguiente proyecto está centrado en el desarrollo de un ambient display para noticias situado en los vagones del Metro de Barcelona y cuya finalidad es establecer una nueva manera de hacer llegar información a la gente que se encuentra en espacios públicos, sin que se requiera de su total atención para ello. El proyecto cubre la concepción de la idea, la extracción de los requerimientos, así como la implementación y evaluación de un prototipo funcional.Los principales retos de este proyecto son comprender las características del entorno de despliegue (en este caso la red de metro), identificar las necesidades e intereses de la gente, y entonces desarrollar un diseño adecuado capaz de integrarse correctamente en ese entorno.Durante este proyecto se ha llevado a cabo un análisis detallado del entorno del Metro de Barcelona y las personas presentes en él, y consecuentemente se han definido los requerimientos del ambient display. El diseño del display se ha desarrollado en base a estos requerimientos y, finalmente, se ha evaluado la integración del display en su entorno. Todo este proceso es explicado en el presente documento.