Asynchronous distributed parallelization of mobile network optimization algorithms

It has been years since the introduction of the Dynamic Network Optimization (DNO) concept, yet the DNO development is still at its infant stage, largely due to a lack of breakthrough in minimizing the lengthy optimization runtime. Our previous work, a distributed parallel solution, has achieved a significant speed gain. To cater for the increased optimization complexity pressed by the uptake of smartphones and tablets, however, this paper examines the potential areas for further improvement and presents a novel asynchronous distributed parallel design that minimizes the inter-process communications. The new approach is implemented and applied to real-life projects whose results demonstrate an augmented acceleration of 7.5 times on a 16-core distributed system compared to 6.1 of our previous solution. Moreover, there is no degradation in the optimization outcome. This is a solid sprint towards the realization of DNO.

Good practices in the Enred@te Pilot Project: a digital social network for older adults and Spanish Red Cross volunteers

The Enred@te initiative, created by Red Cross, the Vodafone Foundation and the TECSOS Foundation, emerged as an evolution of a previous project that developed and piloted a video-communication solution with older adults, using a system installed in their own televisions. Following the success of this first initiative, it was decided to advance toward a more flexible, robust, easy-to-use and high-quality solution, producing a social network accessible through tablets. Older adults can use the network to video-communicate with other older adults and stay informed on various topics of interest. Additionally, a new innovation incorporates the participation of virtual volunteers, a part of the network that promotes its use in an inclusive and participative manner. This solution was also piloted in 2014 with positive results and work to turn it into a service that can reach older adults through the Red Cross is currently on-going.

Programas de tertulia política en Twitter: un modelo neurocomunicativo de análisis del discurso

En este trabajo aplicamos a la red social Twitter un modelo de análisis del discurso político y mediático desarrollado en publicaciones previas, que permite hacer compatible el estudio de los datos discursivos con propuestas explicativas surgidas a propósito de la comunicación política (neurocomunicación) y de la comunicación digital (la red como quinto estado, convergencia, inteligencia colectiva). Asumimos que hay categorías del encuadre discursivo (frame) que pueden ser tratadas como indicadores de habilidades cognitivas y comunicativas. Analizamos estas categorías agrupándolas en tres dimensiones fundamentales: la intencional (ilocutividad del tuit, encuadre interpretativo de las etiquetas), referencial (temas, protagonistas), e interactiva (alineamiento estructural, predictibilidad; marcas de intertextualidad y dialogismo; afiliación partidista). El corpus consta de 4116 tuits: 3000 tuits pertenecientes a los programas Al Rojo Vivo (La Sexta: A3 Media), Las Mañanas Cuatro (Cuatro: Mediaset) y Los Desayunos de TVE (RTVE), 1116 tuits de seguidores de los programas, que corresponden a 45 tuits de cada programa. Los resultados confirman que el modelo permite establecer diferentes perfiles de subjetividad política en las cuentas de Twitter.

Of Marx and Makers: an Historical Perspective on Generative Justice

In Marxist frameworks “distributive justice” depends on extracting value through a centralized state. Many new social movements—peer to peer economy, maker activism, community agriculture, queer ecology, etc.—take the opposite approach, keeping value in its unalienated form and allowing it to freely circulate from the bottom up. Unlike Marxism, there is no general theory for bottom-up, unalienated value circulation. This paper examines the concept of “generative justice” through an historical contrast between Marx’s writings and the indigenous cultures that he drew upon. Marx erroneously concluded that while indigenous cultures had unalienated forms of production, only centralized value extraction could allow the productivity needed for a high quality of life. To the contrary, indigenous cultures now provide a robust model for the “gift economy” that underpins open source technological production, agroecology, and restorative approaches to civil rights. Expanding Marx’s concept of unalienated labor value to include unalienated ecological (nonhuman) value, as well as the domain of freedom in speech, sexual orientation, spirituality and other forms of “expressive” value, we arrive at an historically informed perspective for generative justice. 

Model-driven development of sensor network applications with optimization of non-functional constraints

Wireless sensor networks (WSNs) differ from conventional distributed systems in many aspects. The resource limitation of sensor nodes, the ad-hoc communication and topology of the network, coupled with an unpredictable deployment environment are difficult non-functional constraints that must be carefully taken into account when developing software systems for a WSN. Thus, more research needs to be done on designing, implementing and maintaining software for WSNs. This thesis aims to contribute to research being done in this area by presenting an approach to WSN application development that will improve the reusability, flexibility, and maintainability of the software. Firstly, we present a programming model and software architecture aimed at describing WSN applications, independently of the underlying operating system and hardware. The proposed architecture is described and realized using the Model-Driven Architecture (MDA) standard in order to achieve satisfactory levels of encapsulation and abstraction when programming sensor nodes. Besides, we study different non-functional constrains of WSN application and propose two approaches to optimize the application to satisfy these constrains. A real prototype framework was built to demonstrate the developed solutions in the thesis. The framework implemented the programming model and the multi-layered software architecture as components. A graphical interface, code generation components and supporting tools were also included to help developers design, implement, optimize, and test the WSN software. Finally, we evaluate and critically assess the proposed concepts. Two case studies are provided to support the evaluation. The first case study, a framework evaluation, is designed to assess the ease at which novice and intermediate users can develop correct and power efficient WSN applications, the portability level achieved by developing applications at a high-level of abstraction, and the estimated overhead due to usage of the framework in terms of the footprint and executable code size of the application. In the second case study, we discuss the design, implementation and optimization of a real-world application named TempSense, where a sensor network is used to monitor the temperature within an area.

Team Member’s Centrality, Cohesion, Conflict, and Performance in Multi-University Geographically Distributed Project Teams

This study examined team processes and outcomes among 12 multi-university distributed project teams from 11 universities during its early and late development stages over a 14-month project period. A longitudinal model of team interaction is presented and tested at the individual level to consider the extent to which both formal and informal network connections—measured as degree centrality—relate to changes in team members’ individual perceptions of cohesion and conflict in their teams, and their individual performance as a team member over time. The study showed a negative network centrality-cohesion relationship with significant temporal patterns, indicating that as team members perceive less degree centrality in distributed project teams, they report more team cohesion during the last four months of the project. We also found that changes in team cohesion from the first three months (i.e., early development stage) to the last four months (i.e., late development stage) of the project relate positively to changes in team member performance. Although degree centrality did not relate significantly to changes in team conflict over time, a strong inverse relationship was found between changes in team conflict and cohesion, suggesting that team conflict emphasizes a different but related aspect of how individuals view their experience with the team process. Changes in team conflict, however, did not relate to changes in team member performance. Ultimately, we showed that individuals, who are less central in the network and report higher levels of team cohesion, performed better in distributed teams over time.

Disentangling trade-offs and synergies around ecosystem services with the influence network framework: illustration from a consultative process over the French Alps

An important aspect of sustainability is to maintain biodiversity and ecosystem functioning while improving human well-being. For this, the ecosystem service (ES) approach has the potential to bridge the still existing gap between ecological management and social development, especially by focusing on trade-offs and synergies between ES and between their beneficiaries. Several frameworks have been proposed to account for trade-offs and synergies between ES, and between ES and other components of social-ecological systems. However, to date, insufficient explicit attention has been paid to the three facets encompassed in the ES concept, namely potential supply, demand, and use, leading to incomplete descriptions of ES interactions. We expand on previous frameworks by proposing a new influence network framework (INF) based on an explicit consideration of influence relationships between these three ES facets, biodiversity, and external driving variables. We tested its ability to provide a comprehensive view of complex social-ecological interactions around ES through a consultative process focused on environmental management in the French Alps. We synthetized the interactions mentioned during this consultative process and grouped variables according to their overall propensity to influence or be influenced by the system. The resulting directed sequence of influences distinguished between: (1) mostly influential variables (dynamic social variables and ecological state variables), (2) target variables (provisioning and cultural services), and (3) mostly impacted variables (regulating services and biodiversity parameters). We discussed possible reasons for the discrepancies between actual and perceived influences and proposed options to overcome them. We demonstrated that the INF holds the potential to deliver collective assessments of ES relations by: (1) including ecological as well as social aspects, (2) providing opportunities for colearning processes between stakeholder groups, and (3) supporting communication about complex social-ecological systems and consequences for environmental management.

Role for cell-to-cell communication in stem cell specification toward pancreatic progenitors: relevance to the design of novel therapies for diabetes.

Thesis (Ph.D.)--University of Washington, 2016-08

Security and Trust in Distributed Computation

We propose three research problems to explore the relations between trust and security in the setting of distributed computation. In the first problem, we study trust-based adversary detection in distributed consensus computation. The adversaries we consider behave arbitrarily disobeying the consensus protocol. We propose a trust-based consensus algorithm with local and global trust evaluations. The algorithm can be abstracted using a two-layer structure with the top layer running a trust-based consensus algorithm and the bottom layer as a subroutine executing a global trust update scheme. We utilize a set of pre-trusted nodes, headers, to propagate local trust opinions throughout the network. This two-layer framework is flexible in that it can be easily extensible to contain more complicated decision rules, and global trust schemes. The first problem assumes that normal nodes are homogeneous, i.e. it is guaranteed that a normal node always behaves as it is programmed. In the second and third problems however, we assume that nodes are heterogeneous, i.e, given a task, the probability that a node generates a correct answer varies from node to node. The adversaries considered in these two problems are workers from the open crowd who are either investing little efforts in the tasks assigned to them or intentionally give wrong answers to questions. In the second part of the thesis, we consider a typical crowdsourcing task that aggregates input from multiple workers as a problem in information fusion. To cope with the issue of noisy and sometimes malicious input from workers, trust is used to model workers' expertise. In a multi-domain knowledge learning task, however, using scalar-valued trust to model a worker's performance is not sufficient to reflect the worker's trustworthiness in each of the domains. To address this issue, we propose a probabilistic model to jointly infer multi-dimensional trust of workers, multi-domain properties of questions, and true labels of questions. Our model is very flexible and extensible to incorporate metadata associated with questions. To show that, we further propose two extended models, one of which handles input tasks with real-valued features and the other handles tasks with text features by incorporating topic models. Our models can effectively recover trust vectors of workers, which can be very useful in task assignment adaptive to workers' trust in the future. These results can be applied for fusion of information from multiple data sources like sensors, human input, machine learning results, or a hybrid of them. In the second subproblem, we address crowdsourcing with adversaries under logical constraints. We observe that questions are often not independent in real life applications. Instead, there are logical relations between them. Similarly, workers that provide answers are not independent of each other either. Answers given by workers with similar attributes tend to be correlated. Therefore, we propose a novel unified graphical model consisting of two layers. The top layer encodes domain knowledge which allows users to express logical relations using first-order logic rules and the bottom layer encodes a traditional crowdsourcing graphical model. Our model can be seen as a generalized probabilistic soft logic framework that encodes both logical relations and probabilistic dependencies. To solve the collective inference problem efficiently, we have devised a scalable joint inference algorithm based on the alternating direction method of multipliers. The third part of the thesis considers the problem of optimal assignment under budget constraints when workers are unreliable and sometimes malicious. In a real crowdsourcing market, each answer obtained from a worker incurs cost. The cost is associated with both the level of trustworthiness of workers and the difficulty of tasks. Typically, access to expert-level (more trustworthy) workers is more expensive than to average crowd and completion of a challenging task is more costly than a click-away question. In this problem, we address the problem of optimal assignment of heterogeneous tasks to workers of varying trust levels with budget constraints. Specifically, we design a trust-aware task allocation algorithm that takes as inputs the estimated trust of workers and pre-set budget, and outputs the optimal assignment of tasks to workers. We derive the bound of total error probability that relates to budget, trustworthiness of crowds, and costs of obtaining labels from crowds naturally. Higher budget, more trustworthy crowds, and less costly jobs result in a lower theoretical bound. Our allocation scheme does not depend on the specific design of the trust evaluation component. Therefore, it can be combined with generic trust evaluation algorithms.

Connecting: the use of information and communication technologies by older adults in a retirement community

This is a long-term study of the use of information and communication technologies by 30 older adults (ages 70–97) living in a large retirement community. The study spanned the years of 1996 to 2008, during which time the research participants grappled with the challenges of computer use while aging 12 years. The researcher, herself a ‘mature learner,’ used a qualitative research design which included observations and open-ended interviews. Using a strategy of “intermittent immersion,” she spent an average of two weeks per visit on site and participated in the lives of the research population in numerous ways, including service as their computer tutor. With e-mail and telephone contact, she was able to continue her interactions with participants throughout the 12-year period. A long-term perspective afforded the view of the evolution, devolution or cessation of the technology use by these older adults, and this process is chronicled in detail through five individual “profiles.” Three research questions dominated the inquiry: What function do computers serve in the lives of older adults? Does computer use foster or interfere with social ties? Is social support necessary for success in the face of challenging learning tasks? In answer to the first question, it became clear that computers were valued as a symbol of competence and intelligence. Some individuals brought their computers with them when transferred to the single-room residences of assisted living or nursing care facilities. Even when use had ceased, their computers were displayed to signal that their owners were or had once been keeping up to date. In answer to the second question, computer owners socialized around computing use (with in-person family members or friends) more than, or as much as, they socialized through their computers in the digital realm of the Internet. And in answer to the third question, while the existence of social support did facilitate computer exploration, more important was the social support network generated and developed among fellow computer users.

Distributed and compressed MIKEY mode to secure end-to-end communications in the Internet of things.

Multimedia Internet KEYing protocol (MIKEY) aims at establishing secure credentials between two communicating entities. However, existing MIKEY modes fail to meet the requirements of low-power and low-processing devices. To address this issue, we combine two previously proposed approaches to introduce a new distributed and compressed MIKEY mode for the Internet of Things. Indeed, relying on a cooperative approach, a set of third parties is used to discharge the constrained nodes from heavy computational operations. Doing so, the preshared mode is used in the constrained part of network, while the public key mode is used in the unconstrained part of the network. Furthermore, to mitigate the communication cost we introduce a new header compression scheme that reduces the size of MIKEY’s header from 12 Bytes to 3 Bytes in the best compression case. Preliminary results show that our proposed mode is energy preserving whereas its security properties are preserved untouched.

An immune inspired Network Intrusion Detection System utilising correlation

Network Intrusion Detection Systems (NIDS) are computer systems which monitor a network with the aim of discerning malicious from benign activity on that network. While a wide range of approaches have met varying levels of success, most IDSs rely on having access to a database of known attack signatures which are written by security experts. Nowadays, in order to solve problems with false positive alerts, correlation algorithms are used to add additional structure to sequences of IDS alerts. However, such techniques are of no help in discovering novel attacks or variations of known attacks, something the human immune system (HIS) is capable of doing in its own specialised domain. This paper presents a novel immune algorithm for application to the IDS problem. The goal is to discover packets containing novel variations of attacks covered by an existing signature base.

Strategic Context, Organizational Features and Network Performances: A Survey on Collaborative Networked Organizations of Italian SMEs

Part 15: Performance Management Frameworks

Immunoregulation in human malaria: the challenge of understanding asymptomatic infection

Asymptomatic Plasmodium infection carriers represent a major threat to malaria control worldwide as they are silent natural reservoirs and do not seek medical care. There are no standard criteria for asymptomatic Plasmodium infection; therefore, its diagnosis relies on the presence of the parasite during a specific period of symptomless infection. The antiparasitic immune response can result in reduced Plasmodium sp. load with control of disease manifestations, which leads to asymptomatic infection. Both the innate and adaptive immune responses seem to play major roles in asymptomatic Plasmodium infection; T regulatory cell activity (through the production of interleukin- 10 and transforming growth factor-β) and B-cells (with a broad antibody response) both play prominent roles. Furthermore, molecules involved in the haem detoxification pathway (such as haptoglobin and haeme oxygenase-1) and iron metabolism (ferritin and activated c-Jun N-terminal kinase) have emerged in recent years as potential biomarkers and thus are helping to unravel the immune response underlying asymptomatic Plasmodium infection. The acquisition of large data sets and the use of robust statistical tools, including network analysis, associated with welldesigned malaria studies will likely help elucidate the immune mechanisms responsible for asymptomatic infection.

Distributed optimization in transportation and logistics networks

Many important problems in communication networks, transportation networks, and logistics networks are solved by the minimization of cost functions. In general, these can be complex optimization problems involving many variables. However, physicists noted that in a network, a node variable (such as the amount of resources of the nodes) is connected to a set of link variables (such as the flow connecting the node), and similarly each link variable is connected to a number of (usually two) node variables. This enables one to break the problem into local components, often arriving at distributive algorithms to solve the problems. Compared with centralized algorithms, distributed algorithms have the advantages of lower computational complexity, and lower communication overhead. Since they have a faster response to local changes of the environment, they are especially useful for networks with evolving conditions. This review will cover message-passing algorithms in applications such as resource allocation, transportation networks, facility location, traffic routing, and stability of power grids.