Improved Gridded Precipitation Data Derived from Microwave Link Attenuation

The motivation for improving gridded precipitation data lies in weather now-casting and flood forecasting. Therefore, over the past decade, Commercial Microwave Link (CML) attenuation data have been used to determine rain rates between microwave antennas, and to produce more accurate countrywide precipitation grids. CML networks offer a unique advantage for precipitation measurements due to their high density. However, these data experience uncertainty from several sources as reported in earlier research. This current work determines the reliability of rainfall measurements for each link by comparing CML-derived rain rates to adjusted weather radar rainfall at the link location, over three months. Dynamic Time Warping (DTW) is applied to the pair of CML/radar time-series data in two study areas, Israel and Netherlands. Based on the DTW amplitude and temporal distance, unreliable links are identified and flagged, and interpolated gridded precipitation data are derived in each country after filtering out those unreliable links. Correlations between CML-derived grids and rain observations from an independent set of gauges, tested over several rain events in both study areas, are higher for the reliable subset of CML than the full set. For certain storm events, the Kendall rank correlation for the set of reliable CML is almost double that of the complete set, demonstrating that improved gridded precipitation data can be obtained by removing unreliable links.

Reliability-Aware Multipath Routing of Time-Triggered Traffic in Time-Sensitive Networks

With the development of industrial networks, the demands for strict timing requirements and high reliability in transmission become more essential, which promote the establishment of a Time-Sensitive Network (TSN). TSN is a set of standards with the intention of extending Ethernet for safety-critical and real-time applications. In general, frame replication is used to achieve fault-tolerance, while the increased load has a negative effect on the schedule synthesis phase. It is necessary to consider schedulability and reliability jointly. In this paper, a heuristic-based routing method is proposed to achieve fault tolerance by spatial redundancy for TSNs containing unreliable links. A cost function is presented to evaluate each routing set, and a heuristic algorithm is applied to find the solution with higher schedulability. Compared to the shortest path routing, our method can improve the reliability and the success rate of no-wait scheduling by 5–15% depending on the scale of topology.

Recommending research articles to consumers of online vaccination information

Online health communications often provide biased interpretations of evidence and have unreliable links to the source research. We tested the feasibility of a tool for matching web pages to their source evidence. From 207,538 eligible vaccination-related PubMed articles, we evaluated several approaches using 3,573 unique links to web pages from Altmetric. We evaluated methods for ranking the source articles for vaccine-related research described on web pages, comparing simple baseline feature representation and dimensionality reduction approaches to those augmented with canonical correlation analysis (CCA). Performance measures included the median rank of the correct source article; the percentage of web pages for which the source article was correctly ranked first (recall@1); and the percentage ranked within the top 50 candidate articles (recall@50). While augmenting baseline methods using CCA generally improved results, no CCA-based approach outperformed a baseline method, which ranked the correct source article first for over one quarter of web pages and in the top 50 for more than half. Tools to help people identify evidence-based sources for the content they access on vaccination-related web pages are potentially feasible and may support the prevention of bias and misrepresentation of research in news and social media.

Data Reconstructing Algorithm in Unreliable Links Based on Matrix Completion for Heterogeneous Wireless Sensor Networks

In heterogeneous wireless sensor networks, the data collection method based on compressed sensing technology is susceptible to packet loss and noise, which leads to a decrease in data reconstruction accuracy in unreliable links. Combining compressed sensing and matrix completion, we propose a clustering optimization algorithm based on structured noise matrix completion, in which the cluster head transmits the compressed sampling data and compression strategy to the base station. The algorithm we proposed can reduce the energy consumption of the node in the process of data collection, redundant data and transmission delay. The rank-1 matrix completion algorithm constructs an extremely sparse observation matrix, which is adopted by the sink node to complete the reconstruction of the whole network data. Simulation experiments show that the proposed algorithm reduces network transmission data, balances node energy consumption, improves data transmission efficiency and reconstruction accuracy, and extends the network life cycle.