Scalable and efficient data processing in networked control systems

Network control systems (NCSs) are spatially distributed systems in which the communication between sensors, actuators and controllers occurs through a shared band-limited digital communication network. However, the use of a shared communication network, in contrast to using several dedicated independent connections, introduces new challenges which are even more acute in large scale and dense networked control systems. In this paper we investigate a recently introduced technique of gathering information from a dense sensor network to be used in networked control applications. Obtaining efficiently an approximate interpolation of the sensed data is exploited as offering a good tradeoff between accuracy in the measurement of the input signals and the delay to the actuation. These are important aspects to take into account for the quality of control. We introduce a variation to the state-of-the-art algorithms which we prove to perform relatively better because it takes into account the changes over time of the input signal within the process of obtaining an approximate interpolation.

Correlation modeling for a distributed scalable video codec based on the HEVC standard

The growing heterogeneity of networks, devices and consumption conditions asks for flexible and adaptive video coding solutions. The compression power of the HEVC standard and the benefits of the distributed video coding paradigm allow designing novel scalable coding solutions with improved error robustness and low encoding complexity while still achieving competitive compression efficiency. In this context, this paper proposes a novel scalable video coding scheme using a HEVC Intra compliant base layer and a distributed coding approach in the enhancement layers (EL). This design inherits the HEVC compression efficiency while providing low encoding complexity at the enhancement layers. The temporal correlation is exploited at the decoder to create the EL side information (SI) residue, an estimation of the original residue. The EL encoder sends only the data that cannot be inferred at the decoder, thus exploiting the correlation between the original and SI residues; however, this correlation must be characterized with an accurate correlation model to obtain coding efficiency improvements. Therefore, this paper proposes a correlation modeling solution to be used at both encoder and decoder, without requiring a feedback channel. Experiments results confirm that the proposed scalable coding scheme has lower encoding complexity and provides BD-Rate savings up to 3.43% in comparison with the HEVC Intra scalable extension under development. © 2014 IEEE.

Time-bounded distributed QoS-aware service configuration in heterogeneous cooperative environments

The scarcity and diversity of resources among the devices of heterogeneous computing environments may affect their ability to perform services with specific Quality of Service constraints, particularly in dynamic distributed environments where the characteristics of the computational load cannot always be predicted in advance. Our work addresses this problem by allowing resource constrained devices to cooperate with more powerful neighbour nodes, opportunistically taking advantage of global distributed resources and processing power. Rather than assuming that the dynamic configuration of this cooperative service executes until it computes its optimal output, the paper proposes an anytime approach that has the ability to tradeoff deliberation time for the quality of the solution. Extensive simulations demonstrate that the proposed anytime algorithms are able to quickly find a good initial solution and effectively optimise the rate at which the quality of the current solution improves at each iteration, with an overhead that can be considered negligible.

Perceptually driven video error protection using a distributed source coding approach

In video communication systems, the video signals are typically compressed and sent to the decoder through an error-prone transmission channel that may corrupt the compressed signal, causing the degradation of the final decoded video quality. In this context, it is possible to enhance the error resilience of typical predictive video coding schemes using as inspiration principles and tools from an alternative video coding approach, the so-called Distributed Video Coding (DVC), based on the Distributed Source Coding (DSC) theory. Further improvements in the decoded video quality after error-prone transmission may also be obtained by considering the perceptual relevance of the video content, as distortions occurring in different regions of a picture have a different impact on the user's final experience. In this context, this paper proposes a Perceptually Driven Error Protection (PDEP) video coding solution that enhances the error resilience of a state-of-the-art H.264/AVC predictive video codec using DSC principles and perceptual considerations. To increase the H.264/AVC error resilience performance, the main technical novelties brought by the proposed video coding solution are: (i) design of an improved compressed domain perceptual classification mechanism; (ii) design of an improved transcoding tool for the DSC-based protection mechanism; and (iii) integration of a perceptual classification mechanism in an H.264/AVC compliant codec with a DSC-based error protection mechanism. The performance results obtained show that the proposed PDEP video codec provides a better performing alternative to traditional error protection video coding schemes, notably Forward Error Correction (FEC)-based schemes. (C) 2013 Elsevier B.V. All rights reserved.

Analysis of the domain of applicability of an algorithm for a resources system selection problem for Distributed/Agile/Virtual Enterprises integration

The process of resources systems selection takes an important part in Distributed/Agile/Virtual Enterprises (D/A/V Es) integration. However, the resources systems selection is still a difficult matter to solve in a D/A/VE, as it is pointed out in this paper. Globally, we can say that the selection problem has been equated from different aspects, originating different kinds of models/algorithms to solve it. In order to assist the development of a web prototype tool (broker tool), intelligent and flexible, that integrates all the selection model activities and tools, and with the capacity to adequate to each D/A/V E project or instance (this is the major goal of our final project), we intend in this paper to show: a formulation of a kind of resources selection problem and the limitations of the algorithms proposed to solve it. We formulate a particular case of the problem as an integer programming, which is solved using simplex and branch and bound algorithms, and identify their performance limitations (in terms of processing time) based on simulation results. These limitations depend on the number of processing tasks and on the number of pre-selected resources per processing tasks, defining the domain of applicability of the algorithms for the problem studied. The limitations detected open the necessity of the application of other kind of algorithms (approximate solution algorithms) outside the domain of applicability founded for the algorithms simulated. However, for a broker tool it is very important the knowledge of algorithms limitations, in order to, based on problem features, develop and select the most suitable algorithm that guarantees a good performance.

A debugging engine for parallel and distributed programs

Dissertação apresentada para a obtenção do Grau de Doutor em Informática pela Universidade Nova de Lisboa, Faculdade de Ciências e Tecnologia.

Optimization of multi-stage amplifiers in deep-submicron CMOS using a distributed/parallel genetic algorithm

IEEE International Symposium on Circuits and Systems, pp. 724 – 727, Seattle, EUA

An Intelligent Distributed System for Environmental Management

Environmental management is a complex task. The amount and heterogeneity of the data needed for an environmental decision making tool is overwhelming without adequate database systems and innovative methodologies. As far as data management, data interaction and data processing is concerned we here propose the use of a Geographical Information System (GIS) whilst for the decision making we suggest a Multi-Agent System (MAS) architecture. With the adoption of a GIS we hope to provide a complementary coexistence between heterogeneous data sets, a correct data structure, a good storage capacity and a friendly user’s interface. By choosing a distributed architecture such as a Multi-Agent System, where each agent is a semi-autonomous Expert System with the necessary skills to cooperate with the others in order to solve a given task, we hope to ensure a dynamic problem decomposition and to achieve a better performance compared with standard monolithical architectures. Finally, and in view of the partial, imprecise, and ever changing character of information available for decision making, Belief Revision capabilities are added to the system. Our aim is to present and discuss an intelligent environmental management system capable of suggesting the more appropriate land-use actions based on the existing spatial and non-spatial constraints.

Mobile device-to-device distributed computing using data sets

The rapidly increasing computing power, available storage and communication capabilities of mobile devices makes it possible to start processing and storing data locally, rather than offloading it to remote servers; allowing scenarios of mobile clouds without infrastructure dependency. We can now aim at connecting neighboring mobile devices, creating a local mobile cloud that provides storage and computing services on local generated data. In this paper, we describe an early overview of a distributed mobile system that allows accessing and processing of data distributed across mobile devices without an external communication infrastructure. Copyright © 2015 ICST.

Distributed Forest Fire Monitoring Using Wireless Sensor Networks

Disaster management is one of the most relevant application fields of wireless sensor networks. In this application, the role of the sensor network usually consists of obtaining a representation or a model of a physical phenomenon spreading through the affected area. In this work we focus on forest firefighting operations, proposing three fully distributed ways for approximating the actual shape of the fire. In the simplest approach, a circular burnt area is assumed around each node that has detected the fire and the union of these circles gives the overall fire’s shape. However, as this approach makes an intensive use of the wireless sensor network resources, we have proposed to incorporate two in-network aggregation techniques, which do not require considering the complete set of fire detections. The first technique models the fire by means of a complex shape composed of multiple convex hulls representing different burning areas, while the second technique uses a set of arbitrary polygons. Performance evaluation of realistic fire models on computer simulations reveals that the method based on arbitrary polygons obtains an improvement of 20% in terms of accuracy of the fire shape approximation, reducing the overhead in-network resources to 10% in the best case.

Distributed Linear Precoding and User Selection in Coordinated Multicell Systems

In this manuscript we tackle the problem of semidistributed user selection with distributed linear precoding for sum rate maximization in multiuser multicell systems. A set of adjacent base stations (BS) form a cluster in order to perform coordinated transmission to cell-edge users, and coordination is carried out through a central processing unit (CU). However, the message exchange between BSs and the CU is limited to scheduling control signaling and no user data or channel state information (CSI) exchange is allowed. In the considered multicell coordinated approach, each BS has its own set of cell-edge users and transmits only to one intended user while interference to non-intended users at other BSs is suppressed by signal steering (precoding). We use two distributed linear precoding schemes, Distributed Zero Forcing (DZF) and Distributed Virtual Signalto-Interference-plus-Noise Ratio (DVSINR). Considering multiple users per cell and the backhaul limitations, the BSs rely on local CSI to solve the user selection problem. First we investigate how the signal-to-noise-ratio (SNR) regime and the number of antennas at the BSs impact the effective channel gain (the magnitude of the channels after precoding) and its relationship with multiuser diversity. Considering that user selection must be based on the type of implemented precoding, we develop metrics of compatibility (estimations of the effective channel gains) that can be computed from local CSI at each BS and reported to the CU for scheduling decisions. Based on such metrics, we design user selection algorithms that can find a set of users that potentially maximizes the sum rate. Numerical results show the effectiveness of the proposed metrics and algorithms for different configurations of users and antennas at the base stations.

Parallel programming in biomedical signal processing

Dissertação para obtenção do Grau de Mestre em Engenharia Biomédica

A distributed platform for the volunteer execution of workflows on a local area network

Thesis submitted in fulfilment of the requirements for the Degree of Master of Science in Computer Science

Characterization of SKI-1/S1P-mediated processing of Arenavirus glycoprotein precursors

Arenaviruses are rodent-born world-wide distributed negative strand RNA viruses that comprise a number of important human pathogens including Lassa virus (LASV) which causes more than 3 00'000 infections annually in Western Africa. Lymphocytic choriomeningitis virus (LCMV) is the prototypic member of the arenavirus family, which is divided in two major subgroups according to serological properties and geographical distribution, the Old World and New World arenaviruses. The envelope glycoprotein precursors (GPCs) of arenaviruses have to undergo proteolytic processing to acquire biological function and to be incorporated into progeny virions. A cellular enzyme is responsible for this processing: the Subtilisin Kexin Isozyme-1 or Site-1 protease (SKI- 1/S1P). In this thesis we have studied the relationship between SKI-1/S1P and the envelope GPs of arenaviruses. In a first project, we investigated the molecular interactions between SKI-1/SIP and arenavirus GPCs. Using SKI-1/SIP mutants, we confirmed previously published observations locating LCMV GPC and LASV GPC processing in the Late Golgi/TGN and ER/cis-Golgi, respectively. A single mutation in the cleavage site of LCMV was sufficient to re-locate SKI- 1/SIP-mediated processing from the late Golgi/TGN to the ER/cis-Golgi. We then demonstrated that the transmembrane domain, the C-terminal tail and the phosphorylation sites of SKI-1/S1P are dispensable for GPC processing. Additionally we identified a SKI- 1/S1P mutant defective for autoprocessing at site Β, B' that was selectively impaired in processing of viral GPCs but not cellular substrates. We also showed that a soluble variant of SKI-1/SIΡ was unable to cleave envelope GPs at the cell surface when added in the culture medium. This study highlighted a new target for small molecule inhibitors that would specifically impair GPC but not cellular substrate processing. In a second project, we identified and characterized two residues: LASV GPC Y253 and SKI-1/S1P Y285 that are important for the SKI-1/SIP-mediated LASV GPC cleavage. An alignment of GPC sequences revealed a conserved aromatic residue in P7 position in the GPCs of Old World and Clade C of New World arenaviruses. Mutations in GPC at position P7 impaired processing efficiency. In SKI-1/S1P, mutating Y285 into A negatively affected processing of substrates containing aromatic residues in P7, without affecting others. This property could be used to develop specific drugs targeting SKI-1/SIP-mediated cleavage of LASV GPC without affecting cellular substrates. As a third project we studied the role of the SKI-1/SIP-mediated processing and the unusual stable signal peptide (SSP) for the folding and secretion of soluble forms of the ectodomain of LASV and LCMV glycoproteins. We provide evidence that the transmembrane domain and the cytosolic tail are crucial for the stability of the prefusion conformation of arenavirus GP and that the SSP is required for transport and processing of full-length GP, but not the soluble ectodomain per se. Taken together, these results will lead to a better understanding of the complex interactions between arenavirus GPCs and SKI-1/S IP, paving the avenue for the development of novel anti-arenaviral therapeutics. - Les Arenavirus sont des virus à ARN négatif distribués mondialement et portés par les rongeurs. Cette famille de virus comprend des virus hautement pathogènes pour l'homme comme le virus de Lassa (LASV) qui cause plus de 300Ό00 infections par année en Afrique de l'Ouest. Le virus de la chorioméningite lymphocytaire (LCMV) est le représentant de cette famille qui est divisée en deux sous-groupes selon des critères sérologiques et de distributions géographiques: arenavirus du Nouveau et de l'Ancien monde. Les glycoprotéines d'enveloppe de ces virus (GPCs) doivent être clivées pour être incorporées dans le virus et ainsi lui permettre d'être infectieux. Une enzyme cellulaire est responsable de ce clivage : la Subtilisin Kexin Isozyme-1 ou protéase Site-1 (SKI-l/SlP). Dans cette thèse, nous avons étudié la relation entre cette enzyme cellulaire et les GPs des arenavirus. Dans un premier temps, nous avons étudié les interactions moléculaires entre SKI- 1/S1P et GPC. A l'aide de mutants de SKI-l/SlP, nous avons confirmé des résultats précédemment publiés montrant que les glycoprotéines d'enveloppe de LASV sont clivés dans le réticulum endoplasmique/cis-Golgi alors que celles de LCMV sont clivées dans le Golgi tardif/TGN. Une seule mutation dans le site de clivage de la glycoprotéine de LCMV est suffisante pour changer le compartiment cellulaire dans lequel est clivée cette glycoprotéine. Ensuite, nous avons démontré que le domaine transmembranaire, la partie cytosolique C-terminale ainsi que les sites de phosphorylations de cette enzyme ne sont pas indispensables pour permettre le clivage de GPC. De plus, nous avons identifié un mutant de SKI-l/SlP dans lequel Γ autoprocessing au site B,B' est impossible, incapable de cliver GPC mais toujours pleinement fonctionnelle envers ses substrats cellulaires. Nous avons également démontré qu'une forme soluble de SKI-l/SlP ajoutée dans le milieu de culture n'est pas capable de couper GPC à la surface de la cellule. Cette étude a défini une nouvelle cible potentielle pour un médicament qui inhiberait le clivage des glycoprotéines des arenavirus sans affecter les processus normaux de la cellule. Dans un second project, nous avons identifié deux acides aminés, LASV GPC Y253 et SKI-l/SlP Y285, qui sont important pour le clivage de LASV GPC. Un alignement des séquences de clivage des GPCs a montré qu'un résidu aromatique est conservé en position P7 du site de clivage chez tous les arenavirus de l'Ancien monde et dans le clade C des arenavirus du Nouveau monde. Une mutation de cet acide aminée dans GPC réduit l'efficacité de clivage par SKI-l/SlP. Mutation de la tyrosine 285 de SKI-l/SlP en alanine affecte négativement le clivage des substrats contenant un résidu aromatique en position P7 sans affecter les autres. Cette propriété pourrait être utilisée pour le développement de médicaments spécifiques ciblant le clivage de GPC. Finalement, nous avons étudié le rôle du processing accomplit par SKI-l/SlP et du signal peptide pour le pliage et la sécrétion de formes solubles des glycoprotéines de LASV et LCMV. Nous avons montré que le domaine transmembranaire et la partie cytosolique de GP sont crucials pour la stabilité de la conformation pre-fusionnelle des GPs et que SSP est nécessaire pour le transport et le processing de GP, mais pas de son ecto-domaine soluble. En conclusion, les résultats obtenus durant cette thèse permettrons de mieux comprendre les interactions complexes entre SKI-l/SlP et les glycoprotéines des arenavirus, ouvrant le chemin pour le développement de nouveaux médicaments anti-arénaviraux.

Distributed all-atom simulations of intrinsically unstructured proteins

The Computational Biophysics Group at the Universitat Pompeu Fabra (GRIB-UPF) hosts two unique computational resources dedicated to the execution of large scale molecular dynamics (MD) simulations: (a) the ACMD molecular-dynamics software, used on standard personal computers with graphical processing units (GPUs); and (b) the GPUGRID. net computing network, supported by users distributed worldwide that volunteer GPUs for biomedical research. We leveraged these resources and developed studies, protocols and open-source software to elucidate energetics and pathways of a number of biomolecular systems, with a special focus on flexible proteins with many degrees of freedom. First, we characterized ion permeation through the bactericidal model protein Gramicidin A conducting one of the largest studies to date with the steered MD biasing methodology. Next, we addressed an open problem in structural biology, the determination of drug-protein association kinetics; we reconstructed the binding free energy, association, and dissaciociation rates of a drug like model system through a spatial decomposition and a Makov-chain analysis. The work was published in the Proceedings of the National Academy of Sciences and become one of the few landmark papers elucidating a ligand-binding pathway. Furthermore, we investigated the unstructured Kinase Inducible Domain (KID), a 28-peptide central to signalling and transcriptional response; the kinetics of this challenging system was modelled with a Markovian approach in collaboration with Frank Noe’s group at the Freie University of Berlin. The impact of the funding includes three peer-reviewed publication on high-impact journals; three more papers under review; four MD analysis components, released as open-source software; MD protocols; didactic material, and code for the hosting group.