Abstract
This paper presents an active fault diagnosis (AFD) method with reduced excitation for detection and identification of sensor faults of vehicles in a platoon formation. By introducing a probing signal into the platooning, it will allow an active excitation of the system, reveling a residual component, with the same frequency, that can be explored to obtain a fault identification of specific system faults. A supervisor is introduced to monitor the platoon behavior and activate the auxiliary input whenever the system natural excitation is insufficient for a clear fault diagnosis. This solution will allow the fault diagnosis to behave as active or passive through the adaptive signal provided by the supervisor. A dual Youla-Jabr-Bongiorno-Kucera (YJBK) matrix transfer function, also known as fault signature matrix (FSM) is investigated to get a fault diagnosis. In order to obtain an online identification of specific faults in the system, a Taylor approximation of the FSM is pursued. Computational simulations with a high-fidelity full-vehicle model, provided by CarSim, are carried out to demonstrate the effectiveness of the proposed active approach. A direct comparison between an active and a passive behavior in the same scenario shows that the active fault diagnosis method outperforms the passive approach whenever the dynamic behavior does not provide sufficient excitation. Furthermore, the excitation supervisor is able to significantly reduce the amount of artificial excitation introduced into the system ensuring a more energy efficient active fault diagnosis.

Abstract
Gastric Cancer (GC) is one of the most common and deadliest types of cancer in the world. To improve GC prognosis, increasing efforts are being made to develop new targeted therapies. Although FGFR2 genetic amplification and protein overexpression in GC have been targeted in clinical trials, so far no improvement in patient overall survival has been found. To address this issue, we studied genetic and epigenetic events affecting FGFR2 and its splicing regulator ESRP1 in GC that could be used as new therapeutic targets or predictive biomarkers. We performed copy number variation (CNV), DNA methylation, and RNA expression analyses of FGFR2/ESRP1 across several cohorts. We discovered that both genes were frequently amplified and demethylated in GC, resulting in increased ESRP1 expression and of a specific FGFR2 isoform: FGFR2-IIIb. We also showed that ESRP1 amplification in GC correlated with a significant decreased expression of FGFR2-IIIc, an alternative FGFR2 splicing isoform. Furthermore, when we performed a survival analysis, we observed that patients harboring diffuse-type tumors with low FGFR2-IIIc expression revealed a better overall survival than patients with FGFR2-IIIc high-expressing diffuse tumors. Our results encourage further studies on the role of ESRP1 in GC and support FGFR2-IIIc as a relevant biomarker in GC.

Abstract
Device identity management and authentication are one of the critical and primary security challenges in IoT. In order to decrease the IoT attack surface and provide protection from security threats such as introduction of fake IoT nodes and identity theft, IoT requires scalable device identity management systems and resilient device authentication mechanisms. Existing mechanisms for device identity management and device authentication were not designed for huge number of devices and therefore are not suitable for IoT environments. This work presents results of a blockchain-based identity management approach with consensus authentication, as a scalable solution for IoT device authentication management. Our identity management approach relies on having a blockchain secure tamper proof registry and lightweight consensus-based identity authentication.

Abstract

Abstract
Over the years, workers have joined in producer organizations to face the difficulties that the capitalist market poses to them. Together they can gain efficiency and equity compared to big companies, and they can gain bargaining power over the product market. In our case, we target smallholder farmers who face many difficulties in increasing their welfare. To overcome them, they group together in producer organizations such as cooperatives. With the development of technology, it became possible for these cooperatives of workers to use the Web to operate - such type of organization and operation is called a Platform Cooperative (PC). This paper presents a multi-agent based modeling of Farmers' Coalition Formation (FCF) for smallholder farmers so that they can operate by means of a Platform cooperative. We present the design of a characteristic function that calculates the coalition values in this context, finds the best way of partitioning the farmers into smaller groups and divides the payoff in a stable manner. We empirically analyze the model using value distributions. The results show that forming coalitions is profitable for farmers. We also proved that the model ensures a fair distribution of the payoff among the farmers.

Abstract
Graphs with a large number of nodes and edges are difficult to visualize. Semantic graphs add to the challenge since their nodes and edges have types and this information must be mirrored in the visualization. A common approach to cope with this difficulty is to omit certain nodes and edges, displaying sub-graphs of smaller size. However, other transformations can be used to summarize semantic graphs and this research explores a particular one, both to reduce the graph's size and to focus on its path patterns. A-graphs are a novel kind of graph designed to highlight path patterns using this kind of summarization. They are composed of a-nodes connected by a-edges, and these reflect respectively edges and nodes of the semantic graph. A-graphs trade the visualization of nodes and edges by the visualization of graph path patterns involving typed edges. Thus, they are targeted to users that require a deep understanding of the semantic graph it represents, in particular of its path patterns, rather than to users wanting to browse the semantic graph's content. A-graphs help programmers querying the semantic graph or designers of semantic measures interested in using it as a semantic proxy. Hence, a-graphs are not expected to compete with other forms of semantic graph visualization but rather to be used as a complementary tool. This paper provides a precise definition both of a-graphs and of the mapping of semantic graphs into a-graphs. Their visualization is obtained with a-graphs diagrams. A web application to visualize and interact with these diagrams was implemented to validate the proposed approach. Diagrams of well-known semantic graphs are presented to illustrate the use of agraphs for discovering path patterns in different settings, such as the visualization of massive semantic graphs, the codification of SPARQL or the definition of semantic measures. The validation with large semantic graphs is the basis for a discussion on the insights provided by a-graphs on large semantic graphs: the difference between a-graphs and ontologies, path pattern visualization using a-graphs and the challenges posed by large semantic graphs.