Achieving Minimum Coverage Breach under Bandwidth Constraints in Wireless Sensor Networks

This paper addresses the coverage breach problem in wireless sensor networks with limited bandwidths. In wireless sensor networks, sensor nodes are powered by batteries. To make efficient use of battery energy is critical to sensor network lifetimes. When targets are redundantly covered by multiple sensors, especially in stochastically deployed sensor networks, it is possible to save battery energy by organizing sensors into mutually exclusive subsets and alternatively activating only one subset at any time. Active nodes are responsible for sensing, computing and communicating. While the coverage of each subset is an important metric for sensor organization, the size of each subset also plays an important role in sensor network performance because when active sensors periodically send data to base stations, contention for channel access must be considered. The number of available channels imposes a limit on the cardinality of each subset. Coverage breach happens when a subset of sensors cannot completely cover all the targets. To make efficient use of both energy and bandwidth with a minimum coverage breach is the goal of sensor network design. This paper presents the minimum breach problem using a mathematical model, studies the computational complexity of the problem, and provides two approximate heuristics. Effects of increasing the number of channels and increasing the number of sensors on sensor network coverage are studied through numerical simulations. Overall, the simulation results reveal that when the number of sensors increases, network lifetimes can be improved without loss of network coverage if there is no bandwidth constraint; with bandwidth constraints, network lifetimes may be improved further at the cost of coverage breach

Mitochondrial nutrients improve immune dysfunction in the type 2 diabetic Goto-Kakizaki rats.

The development of type 2 diabetes is accompanied by decreased immune function and the mechanisms are unclear. We hypothesize that oxidative damage and mitochondrial dysfunction may play an important role in the immune dysfunction in diabetes. In the present study, we investigated this hypothesis in diabetic Goto-Kakizaki rats by treatment with a combination of four mitochondrial-targeting nutrients, namely, R-alpha-lipoic acid, acetyl-L-carnitine, nicotinamide and biotin. We first studied the effects of the combination of these four nutrients on immune function by examining cell proliferation in immune organs (spleen and thymus) and immunomodulating factors in the plasma. We then examined, in the plasma and thymus, oxidative damage biomarkers, including lipid peroxidation, protein oxidation, reactive oxygen species, calcium and antioxidant defence systems, mitochondrial potential and apoptosis-inducing factors (caspase 3, p53 and p21). We found that immune dysfunction in these animals is associated with increased oxidative damage and mitochondrial dysfunction and that the nutrient treatment effectively elevated immune function, decreased oxidative damage, enhanced mitochondrial function and inhibited the elevation of apoptosis factors. These effects are comparable to, or greater than, those of the anti-diabetic drug pioglitazone. These data suggest that a rational combination of mitochondrial-targeting nutrients may be effective in improving immune function in type 2 diabetes through enhancement of mitochondrial function, decreased oxidative damage, and delayed cell death in the immune organs and blood

New Graph Model for Channel Assignment in Ad Hoc Wireless Networks

The channel assignment problem in ad hoc wireless networks is investigated. The problem is to assign channels to hosts in such a way that interference among hosts is eliminated and the total number of channels is minimised. Interference is caused by direct collisions from hosts that can hear each other or indirect collisions from hosts that cannot hear each other, but simultaneously transmit to the same destination. A new class of disk graphs (FDD: interFerence Double Disk graphs) is proposed that include both kinds of interference edges. Channel assignment in wireless networks is a vertex colouring problem in FDD graphs. It is shown that vertex colouring in FDD graphs is NP-complete and the chromatic number of an FDD graph is bounded by its clique number times a constant. A polynomial time approximation algorithm is presented for channel assignment and an upper bound 14 on its performance ratio is obtained. Results from a simulation study reveal that the new graph model can provide a more accurate estimation of the number of channels required for collision avoidance than previous models

Texture evolution induced by twinning and dynamic recrystallization in dilute Mg-1Sn-1Zn-1Al alloy during hot compression

Texture evolution of an extruded dilute Mg-1Sn-1Zn-1Al alloy was thoroughly investigated based on the twinning and dynamic recrystallization (DRX) behavior via hot compression at a strain rate of 10 s−1 and temperature of 225°C. It was found that the types and intensities of the texture are strongly dependent on the fraction of twins and DRX modes as well as regions where sub-grain boundaries (sub-GBs) are intensively accumulated. At the initial stage of deformation, the formation of compression direction (CD)-tilted basal texture was mainly determined by the occurrence of {101¯2} extension twins. As the strain increases, the variation in the texture intensity was greatly dominated by the DRX modes but the type of main texture remained unchanged. These findings are of great importance for texture modification of wrought Mg-Sn-based alloys during post-deformation

Path Signature Neural Network of Cortical Features for Prediction of Infant Cognitive Scores

Studies have shown that there is a tight connection between cognition skills and brain morphology during infancy. Nonetheless, it is still a great challenge to predict individual cognitive scores using their brain morphological features, considering issues like the excessive feature dimension, small sample size and missing data. Due to the limited data, a compact but expressive feature set is desirable as it can reduce the dimension and avoid the potential overfitting issue. Therefore, we pioneer the path signature method to further explore the essential hidden dynamic patterns of longitudinal cortical features. To form a hierarchical and more informative temporal representation, in this work, a novel cortical feature based path signature neural network (CF-PSNet) is proposed with stacked differentiable temporal path signature layers for prediction of individual cognitive scores. By introducing the existence embedding in path generation, we can improve the robustness against the missing data. Benefiting from the global temporal receptive field of CF-PSNet, characteristics consisted in the existing data can be fully leveraged. Further, as there is no need for the whole brain to work for a certain cognitive ability, a top K selection module is used to select the most influential brain regions, decreasing the model size and the risk of overfitting. Extensive experiments are conducted on an in-house longitudinal infant dataset within 9 time points. By comparing with several recent algorithms, we illustrate the state-of-the-art performance of our CF-PSNet (i.e., root mean square error of 0.027 with the time latency of 518 milliseconds for each sample)

Localized primary gastrointestinal diffuse large B cell lymphoma received a surgical approach: an analysis of prognostic factors and comparison of staging systems in 101 patients from a single institution

Clinical characteristics and survival rate of patients with localized PG-DLBCL. It shows the clinical characteristics and Rituximab treatment between localized PG-DLBCL patients with surgery and those with chemotherapy alone. (PDF 276 kb

Exploring Unconfirmed Transactions for Effective Bitcoin Address Clustering

peer reviewe