Augmented LDPC Graph for Distributed Video Coding with Multiple Side Information

The advances made in channel-capacity codes, such as turbo codes and low-density parity-check (LDPC) codes, have played a major role in the emerging distributed source coding paradigm. LDPC codes can be easily adapted to new source coding strategies due to their natural representation as bipartite graphs and the use of quasi-optimal decoding algorithms, such as belief propagation. This paper tackles a relevant scenario in distributedvideo coding: lossy source coding when multiple side information (SI) hypotheses are available at the decoder, each one correlated with the source according to different correlation noise channels. Thus, it is proposed to exploit multiple SI hypotheses through an efficient joint decoding technique withmultiple LDPC syndrome decoders that exchange information to obtain coding efficiency improvements. At the decoder side, the multiple SI hypotheses are created with motion compensated frame interpolation and fused together in a novel iterative LDPC based Slepian-Wolf decoding algorithm. With the creation of multiple SI hypotheses and the proposed decoding algorithm, bitrate savings up to 8.0% are obtained for similar decoded quality.

The dark side of DEMMON: what is behind the scene in engineering large-scale wireless sensor networks

Most research work on WSNs has focused on protocols or on specific applications. There is a clear lack of easy/ready-to-use WSN technologies and tools for planning, implementing, testing and commissioning WSN systems in an integrated fashion. While there exists a plethora of papers about network planning and deployment methodologies, to the best of our knowledge none of them helps the designer to match coverage requirements with network performance evaluation. In this paper we aim at filling this gap by presenting an unified toolset, i.e., a framework able to provide a global picture of the system, from the network deployment planning to system test and validation. This toolset has been designed to back up the EMMON WSN system architecture for large-scale, dense, real-time embedded monitoring. It includes network deployment planning, worst-case analysis and dimensioning, protocol simulation and automatic remote programming and hardware testing tools. This toolset has been paramount to validate the system architecture through DEMMON1, the first EMMON demonstrator, i.e., a 300+ node test-bed, which is, to the best of our knowledge, the largest single-site WSN test-bed in Europe to date.

An integer programming framework for sequencing cutting patterns based on interval graph completion

We derived a framework in integer programming, based on the properties of a linear ordering of the vertices in interval graphs, that acts as an edge completion model for obtaining interval graphs. This model can be applied to problems of sequencing cutting patterns, namely the minimization of open stacks problem (MOSP). By making small modifications in the objective function and using only some of the inequalities, the MOSP model is applied to another pattern sequencing problem that aims to minimize, not only the number of stacks, but also the order spread (the minimization of the stack occupation problem), and the model is tested.

An integer programming model for the minimum interval graph completion problem

The minimum interval graph completion problem consists of, given a graph G = ( V, E ), finding a supergraph H = ( V, E ∪ F ) that is an interval graph, while adding the least number of edges |F| . We present an integer programming formulation for solving the minimum interval graph completion problem recurring to a characteri- zation of interval graphs that produces a linear ordering of the maximal cliques of the solution graph.

A Fractional Perspective to the Bond Graph Modelling of World Economies

Inspired in dynamic systems theory and Brewer’s contributions to apply it to economics, this paper establishes a bond graph model. Two main variables, a set of inter-connectivities based on nodes and links (bonds) and a fractional order dynamical perspective, prove to be a good macro-economic representation of countries’ potential performance in nowadays globalization. The estimations based on time series for 50 countries throughout the last 50 decades confirm the accuracy of the model and the importance of scale for economic performance.

Leveraging facebook’s open graph to develop an environmental persuasive application

Dissertação para obtenção do Grau de Mestre em Engenharia Informática

Graph usage in financial reports: Evidence from Portuguese listed companies

When assessing investment options, investors focus on the graphs of annual reports, despite lack of auditing. If poorly constructed, graphs distort perceptions and lead to inaccurate decisions. This study examines graph usage in all the companies listed on Euronext Lisbon in 2013. The findings suggest that graphs are common in the annual reports of Portuguese companies and that, while there is no evidence of Selectivity Distortion, both Measurement and Orientation Distortions are pervasive. The study recommends the auditing of financial graphs, and urges preparers and users of annual reports to be wary of the possibility of graph distortion.

Graph usage in annual reports, evidence from Norwegian listed companies

As investors and other users of annual reports often focus their attention on graphs, it is important that they portray accurate and reliable information. However, previous studies show that graphs often distort information and mislead users. This study analyses graph usage in annual reports from the 52 most traded Norwegian companies. The findings suggest that Norwegian companies commonly use graphs, and that the graph distortions, presentational enhancement and measurement distortion, are present. No evidence of selectivity was found. This study recommends development of guidelines for graphical disclosure, and advises preparers and users of annual reports to be aware of misleading graphs.

Mercados emergentes en el escenario africano: oportunidades y desafíos para la política exterior argentina. Emergent markets in the African scene: opportunities and challenges for the Argentine foreign policy.

Este trabajo parte de la inquietud de cómo organizar y articular los recursos diplomáticos, económicos, tecnológicos y culturales que cuenta la Argentina en África, para incentivar e incrementar las vinculaciones entre ambas regiones. Teniendo en cuenta los nuevos escenarios emergentes del espacio africano y los lineamientos de política exterior ensayados por nuestro país en los últimos años, nuestro período de análisis se concentrará entre los años 2002 y 2007. Sostenemos que el desarrollo de una estrategia articulada y permanente hacia el África requiere un aprovechamiento más eficaz y eficiente de los recursos humanos, financieros y tecnológicos existentes. De esto modo, la Argentina podría posicionarse como un socio relevante en la agenda de los países africanos, proveyendo productos, tecnología y servicios a mercados complementarios y en expansión. El objetivo general del proyecto es reconocer las transformaciones recientes del diseño exterior argentino hacia los mercados emergentes, en particular hacia África.El abordaje de esta investigación tiene características tanto cualitativas como cuantitativas, al tiempo que pretende alcanzar un nivel de explicación debido al tipo de propuesta. Nuestras unidades de observación son aquellas instituciones y personalidades vinculadas a la elaboración e implementación de la política exterior de Argentina hacia los estados africanos en su conjunto (tanto de África Subsahariana como de África del Norte). En cuanto a las técnicas aplicadas se pueden reconocer diversas fases. En primera instancia se llevará adelante una exploración documental en la Cancillería argentina destinada a cubrir los principales lineamientos respecto al tema. Luego se revisarán documentos producidos por organismos privados y por investigadores científicos. Al mismo tiempo se realizarán entrevistas semiestructuradas a los actores claves que participaron en el proceso de toma de decisiones.Con este trabajo nos proponemos concretar un manual que contenga de forma sistemática las normativas y las prácticas que ejercen cada uno de los actores, tanto públicos como privados, en torno a las vinculaciones entre Argentina y los países de África. Este ordenamiento nos permitirá ofrecer a los responsables de tomas de decisiones un marco articulado, accesible y didáctico para el diseño y la ejecución de futuras políticas hacia la región. Actualmente, los lazos políticos, culturales y de cooperación entre los países de ambas regiones manifiestan un creciente dinamismo, poniendo en juego nuevos terrenos de colaboración como las Cumbres América del Sur-África, las reuniones inter-ministeriales, la firma de acuerdos de comercio entre el Mercosur y algunos estados africanos, entre otros. Sin embargo a pesar de estas señales auspiciosas, los mercados africanos no han sido explorados con la suficiente constancia y profundidad. El desarrollo de este proyecto permitirá, en primer lugar, constituir un corpus de información sobre las normativas y las prácticas en torno los vínculos argentino-africanos. Por otro lado, será una herramienta indispensable para la planificación y concreción de futuras políticas en torno al área. Cabe aclarar que no se limita a organismos del Estado sino también involucraría a actores privados implicados o interesados con los mercados emergentes africanos.

Beeinflussung von auditorischer Objektbildung durch visuelle Stimulation

Streaming, Auditory Scene Analysis, Mismatch Negativity, Auditorische Szenenanalyse, Stream-Segregation

Testing Cayley graph densities

We present a computer-assisted analysis of combinatorial properties of the Cayley graphs of certain finitely generated groups: Given a group with a finite set of generators, we study the density of the corresponding Cayley graph, that is, the least upper bound for the average vertex degree (= number of adjacent edges) of any finite subgraph. It is known that an m-generated group is amenable if and only if the density of the corresponding Cayley graph equals to 2m. We test amenable and non-amenable groups, and also groups for which amenability is unknown. In the latter class we focus on Richard Thompson’s group F.

Conference scene: Immune signatures in the tumor and beyond.

Led by key opinion leaders in the field, the Cancer Immunotherapy Consortium of the Cancer Research Institute 2012 Scientific Colloquium included 179 participants who exchanged cutting-edge information on basic, clinical and translational cancer immunology and immunotherapy. The meeting revealed how rapidly this field is advancing. The keynote talk was given by Wolf H Fridman and it described the microenvironment of primary and metastatic human tumors. Participants interacted through oral presentations and panel discussions on topics that included host reactions in tumors, advances in imaging, monitoring therapeutic immune modulation, the benefit and risk of immunotherapy, and immune monitoring activities. In summary, the annual meeting gathered clinicians and scientists from academia, industry and regulatory agencies from around the globe to interact and exchange important scientific advances related to tumor immunobiology and cancer immunotherapy.

Scene classifier for real time road detection

L’objectiu principal del projecte és el de classificar escenes de carretera en funció del contingut de les imatges per així poder fer un desglossament sobre quin tipus de situació tenim en el moment. És important que fixem els paràmetres necessaris en funció de l’escenari en què ens trobem per tal de treure el màxim rendiment possible a cada un dels algoritmes. La seva funcionalitat doncs, ha de ser la d’avís i suport davant els diferents escenaris de conducció. És a dir, el resultat final ha de contenir un algoritme o aplicació capaç de classificar les imatges d’entrada en diferents tipus amb la màxima eficiència espacial i temporal possible. L’algoritme haurà de classificar les imatges en diferents escenaris. Els algoritmes hauran de ser parametritzables i fàcilment manejables per l’usuari. L’eina utilitzada per aconseguir aquests objectius serà el MATLAB amb les toolboxs de visió i xarxes neuronals instal·lades.

Theoretical aspects of graph models for MANETs

We survey the main theoretical aspects of models for Mobile Ad Hoc Networks (MANETs). We present theoretical characterizations of mobile network structural properties, different dynamic graph models of MANETs, and finally we give detailed summaries of a few selected articles. In particular, we focus on articles dealing with connectivity of mobile networks, and on articles which show that mobility can be used to propagate information between nodes of the network while at the same time maintaining small transmission distances, and thus saving energy.

A linear optimization technique for graph pebbling

Graph pebbling is a network model for studying whether or not a given supply of discrete pebbles can satisfy a given demand via pebbling moves. A pebbling move across an edge of a graph takes two pebbles from one endpoint and places one pebble at the other endpoint; the other pebble is lost in transit as a toll. It has been shown that deciding whether a supply can meet a demand on a graph is NP-complete. The pebbling number of a graph is the smallest t such that every supply of t pebbles can satisfy every demand of one pebble. Deciding if the pebbling number is at most k is NP 2 -complete. In this paper we develop a tool, called theWeight Function Lemma, for computing upper bounds and sometimes exact values for pebbling numbers with the assistance of linear optimization. With this tool we are able to calculate the pebbling numbers of much larger graphs than in previous algorithms, and much more quickly as well. We also obtain results for many families of graphs, in many cases by hand, with much simpler and remarkably shorter proofs than given in previously existing arguments (certificates typically of size at most the number of vertices times the maximum degree), especially for highly symmetric graphs. Here we apply theWeight Function Lemma to several specific graphs, including the Petersen, Lemke, 4th weak Bruhat, Lemke squared, and two random graphs, as well as to a number of infinite families of graphs, such as trees, cycles, graph powers of cycles, cubes, and some generalized Petersen and Coxeter graphs. This partly answers a question of Pachter, et al., by computing the pebbling exponent of cycles to within an asymptotically small range. It is conceivable that this method yields an approximation algorithm for graph pebbling.