Search for: All records

The rampant occurrence of cybersecurity breaches imposes substantial limitations on the progress of network infras- tructures, leading to compromised data, financial losses, potential harm to individuals, and disruptions in essential services. The current security landscape demands the urgent development of a holistic security assessment solution that encompasses vul- nerability analysis and investigates the potential exploitation of these vulnerabilities as attack paths. In this paper, we propose GRAPHENE, an advanced system designed to provide a detailed analysis of the security posture of computing infrastructures. Using user-provided information, such as device details and software versions, GRAPHENE performs a comprehensive secu- rity assessment. This assessment includes identifying associated vulnerabilities and constructing potential attack graphs that adversaries can exploit. Furthermore, it evaluates the exploitabil- ity of these attack paths and quantifies the overall security posture through a scoring mechanism. The system takes a holistic approach by analyzing security layers encompassing hardware, system, network, and cryptography. Furthermore, GRAPHENE delves into the interconnections between these layers, exploring how vulnerabilities in one layer can be leveraged to exploit vulnerabilities in others. In this paper, we present the end-to-end pipeline implemented in GRAPHENE, showcasing the systematic approach adopted for conducting this thorough security analysis. 

This paper investigates the feasibility of detecting and estimating the rate of internal hemorrhage based on continuous noninvasive hematocrit measurement. A unique challenge in hematocrit-based hemorrhage detection is that hematocrit decreases in response to hemorrhage and resuscitation with fluids, which makes hemorrhage detection during resuscitation challenging. We developed two sequential inference algorithms for detection of internal hemorrhage based on the Luenberger observer and the extended Kalman filter. The sequential inference algorithms use fluid resuscitation dose and hematocrit measurement as inputs to generate signatures to enable detection of internal hemorrhage. In the case of the extended Kalman filter, the signature is nothing but inferred hemorrhage rate, which allows it to also estimate internal hemorrhage rate. We evaluated the proof-of-concept of these algorithms based on in silico evaluation in 100 virtual patients subject to diverse hemorrhage and resuscitation rates. The results showed that the sequential inference algorithms outperformed naïve internal hemorrhage detection based on the decrease in hematocrit when hematocrit noise level was 1% (average F1 score: Luenberger observer 0.80; extended Kalman filter 0.76; hematocrit 0.59). Relative to the Luenberger observer, the extended Kalman filter demonstrated comparable internal hemorrhage detection performance and superior accuracy in estimating the hemorrhage rate. The analysis of the dependence of the sequential inference algorithms on measurement noise and plant parametric uncertainty showed that small (≤1%) hematocrit noise level and personalization of sequential inference algorithms may enable continuous noninvasive detection of internal hemorrhage and estimation of its rate. 

Abstract Mechanical characterization of dynamic DNA nanodevices is essential to facilitate their use in applications like molecular diagnostics, force sensing, and nanorobotics that rely on device reconfiguration and interactions with other materials. A common approach to evaluate the mechanical properties of dynamic DNA nanodevices is by quantifying conformational distributions, where the magnitude of fluctuations correlates to the stiffness. This is generally carried out through manual measurement from experimental images, which is a tedious process and a critical bottleneck in the characterization pipeline. While many tools support the analysis of static molecular structures, there is a need for tools to facilitate the rapid characterization of dynamic DNA devices that undergo large conformational fluctuations. Here, we develop a data processing pipeline based on Deep Neural Networks (DNNs) to address this problem. The YOLOv5 and Resnet50 network architecture were used for the two key subtasks: particle detection and pose (i.e. conformation) estimation. We demonstrate effective network performance (F1 score 0.85 in particle detection) and good agreement with experimental distributions with limited user input and small training sets (~ 5 to 10 images). We also demonstrate this pipeline can be applied to multiple nanodevices, providing a robust approach for the rapid characterization of dynamic DNA devices. 

Model parallelism is conventionally viewed as a method to scale a single large deep learning model beyond the memory limits of a single device. In this paper, we demonstrate that model parallelism can be additionally used for the statistical multiplexing of multiple devices when serving multiple models, even when a single model can fit into a single device. Our work reveals a fundamental trade-off between the overhead introduced by model parallelism and the opportunity to exploit statistical multiplexing to reduce serving latency in the presence of bursty workloads. We explore the new trade-off space and present a novel serving system, AlpaServe, that determines an efficient strategy for placing and parallelizing collections of large deep learning models across a distributed cluster. Evaluation results on production workloads show that AlpaServe can process requests at up to 10× higher rates or 6× more burstiness while staying within latency constraints for more than 99% of requests. 

Cytonuclear disruption may accompany allopolyploid evolution as a consequence of the merger of different nuclear genomes in a cellular environment having only one set of progenitor organellar genomes. One path to reconcile potential cytonuclear mismatch is biased expression for maternal gene duplicates (homoeologs) encoding proteins that target to plastids and/or mitochondria. Assessment of this transcriptional form of cytonuclear coevolution at the level of individual cells or cell types remains unexplored. Using single-cell (sc-) and single-nucleus (sn-) RNAseq data from eight tissues in three allopolyploid species, we characterized cell type–specific variations of cytonuclear coevolutionary homoeologous expression and demonstrated the temporal dynamics of expression patterns across development stages during cotton fiber development. Our results provide unique insights into transcriptional cytonuclear coevolution in plant allopolyploids at the single-cell level. 

Programmable networks are enabling a new class of applications that leverage the line-rate processing capability and on-chip register memory of the switch data plane. Yet the status quo is focused on developing approaches that share the register memory statically. We present NetVRM, a network management system that supports dynamic register memory sharing between multiple concurrent applications on a programmable network and is readily deployable on commodity programmable switches. NetVRM provides a virtual register memory abstraction that enables applications to share the register memory in the data plane, and abstracts away the underlying details. In principle, NetVRM supports any memory allocation algorithm given the virtual register memory abstraction. It also provides a default memory allocation algorithm that exploits the observation that applications have diminishing returns on additional memory. NetVRM provides an extension of P4, P4VRM, for developing applications with virtual register memory, and a compiler to generate data plane programs and control plane APIs. Testbed experiments show that NetVRM generalizes to a diverse variety of applications, and that its utility-based dynamic allocation policy outperforms static resource allocation. Specifically, it improves the mean satisfaction ratio (i.e., the fraction of a network application’s lifetime that it meets its utility target) by 1.6–2.2× under a range of workloads.