Distributed Data Aggregation for Sparse Recovery in Wireless Sensor Networks

We consider the approximate sparse recovery problem in Wireless Sensor Networks (WSNs) using Compressed Sensing/Compressive Sampling (CS). The goal is to recover the n \mbox{-}dimensional data values by querying only $m \ll n$ sensors based on some linear projection of sensor readings. To solve this problem, a two-tiered sampling model is considered and a novel distributed compressive sparse sampling (DCSS) algorithm is proposed based on sparse binary CS measurement matrix. In the two-tiered sampling model, each sensor first samples the environment independently. Then the fusion center (FC), acting as a pseudo-sensor, samples the sensor network to select a subset of sensors ($m$ out of $n$) that directly respond to the FC for data recovery purpose. The sparse binary matrix is designed using unbalanced expander graph which achieves the state-of-the-art performance for CS schemes. This binary matrix can be interpreted as a sensor selection matrix-whose fairness is analyzed. Extensive experiments on both synthetic and real data set show that by querying only the minimum amount of $m$ sensors using the DCSS algorithm, the CS recovery accuracy can be as good as dense measurement matrices (e.g., Gaussian, Fourier Scrambles). We also show that the sparse binary measurement matrix works well on compressible data which has the closest recovery result to the known best k\mbox{-}term approximation. The recovery is robust against noisy measurements. The sparsity and binary properties of the measurement matrix contribute, to a great extent, the reduction of the in-network communication cost as well as the computational burden

Compressed Sensing in Resource-Constrained Environments: From Sensing Mechanism Design to Recovery Algorithms

Compressed Sensing (CS) is an emerging field based on the revelation that a small collection of linear projections of a sparse signal contains enough information for reconstruction. It is promising that CS can be utilized in environments where the signal acquisition process is extremely difficult or costly, e.g., a resource-constrained environment like the smartphone platform, or a band-limited environment like visual sensor network (VSNs). There are several challenges to perform sensing due to the characteristic of these platforms, including, for example, needing active user involvement, computational and storage limitations and lower transmission capabilities. This dissertation focuses on the study of CS in resource-constrained environments. First, we try to solve the problem on how to design sensing mechanisms that could better adapt to the resource-limited smartphone platform. We propose the compressed phone sensing (CPS) framework where two challenging issues are studied, the energy drainage issue due to continuous sensing which may impede the normal functionality of the smartphones and the requirement of active user inputs for data collection that may place a high burden on the user. Second, we propose a CS reconstruction algorithm to be used in VSNs for recovery of frames/images. An efficient algorithm, NonLocal Douglas-Rachford (NLDR), is developed. NLDR takes advantage of self-similarity in images using nonlocal means (NL) filtering. We further formulate the nonlocal estimation as the low-rank matrix approximation problem and solve the constrained optimization problem using Douglas-Rachford splitting method. Third, we extend the NLDR algorithm to surveillance video processing in VSNs and propose recursive Low-rank and Sparse estimation through Douglas-Rachford splitting (rLSDR) method for recovery of the video frame into a low-rank background component and sparse component that corresponds to the moving object. The spatial and temporal low-rank features of the video frame, e.g., the nonlocal similar patches within the single video frame and the low-rank background component residing in multiple frames, are successfully exploited

Gamma-Glutamyl Transpeptidase to Platelet Ratio Is a Novel and Independent Prognostic Marker for Resectable Lung Cancer: A Propensity Score Matching Study.

BACKGROUND We report this propensity score matching (PSM) analysis to assess prognostic roles of preoperative gamma-glutamyl transpeptidase to platelet ratio (GPR) in video-assisted thoracoscopic (VATS) lobectomy for stage I-II non-small-cell lung cancer (NSCLC). METHODS The PSM-based study conducted on our single-center prospectively collected database from January 2014 to August 2015 provided Kaplan-Meier survival analyses using the log-rank test to discriminate differences in overall survival (OS) and disease-free survival (DFS) between patients stratified by preoperative GPR. RESULTS Our study includes 379 patients diagnosed with operable primary stage I-II NSCLC. A GPR value at 0.16 was recognized as the optimal cutoff point for prognostic prediction. Both OS and DFS of patients with GPR ≥0.16 were significantly shortened when compared to those of patients with GPR <0.16. Patients with GPR ≥0.16 had significantly lower 5-year rates of OS and DFS than those of patients with GPR <0.16 (P <0.001). Significant associations between GPR and unfavorable survival still are validated in the PSM analysis. Multivariable Cox regression models on both the entire cohort and the PSM cohort consistently demonstrated that an elevated preoperative GPR could be an independent prognostic marker for both OS and DFS of resectable NSCLC. CONCLUSIONS GPR may be an effective and noninvasive prognostic biomarker in VATS lobectomy for surgically resectable NSCLC

Burden of liver cancer due to hepatitis C from 1990 to 2019 at the global, regional, and national levels

BackgroundLiver cancer due to hepatitis C (LCDHC) is one of the leading causes of cancer-related deaths worldwide, and the burden of LCDHC is increasing. We aimed to report the burden of LCDHC at the global, regional, and national levels in 204 countries from 1990 to 2019, stratified by etiology, sex, age, and Sociodemographic Index.MethodsData on LCDHC were available from the Global Burden of Disease, Injuries, and Risk Factors (GBD) study 2019. Numbers and age-standardized mortality, incidence, and disability-adjusted life year (DALY) rates per 100,000 population were estimated through a systematic analysis of modeled data from the GBD 2019 study. The trends in the LCDHC burden were assessed using the annual percentage change.ResultsGlobally, in 2019, there were 152,225 new cases, 141,810 deaths, and 2,878,024 DALYs due to LCDHC. From 1990 to 2019, the number of incidences, mortality, and DALY cases increased by 80.68%, 67.50%, and 37.20%, respectively. However, the age-standardized incidence, mortality, and DALY rate had a decreasing trend during this period. In 2019, the highest age-standardized incidence rates (ASIRs) of LCDHC were found in high-income Asia Pacific, North Africa and the Middle East, and Central Asia. At the regional level, Mongolia, Egypt, and Japan had the three highest ASIRs in 2019. The incidence rates of LCDHC were higher in men and increased with age, with a peak incidence in the 95+ age group for women and the 85–89 age group for men in 2019. A nonlinear association was found between the age-standardized rates of LCDHC and sociodemographic index values at the regional and national levels.ConclusionsAlthough the age-standardized rates of LCDHC have decreased, the absolute numbers of incident cases, deaths, and DALYs have increased, indicating that LCDHC remains a significant global burden. In addition, the burden of LCDHC varies geographically. Male and older adult/s individuals have a higher burden of LCDHC. Our findings provide insight into the global burden trend of LCDHC. Policymakers should establish appropriate methods to achieve the HCV elimination target by 2030 and reducing the burden of LCDHC