Search NASA⌕ Search

SEARCH · Search NASA

Results for “consensus algorithm”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 91 records · Page 5

Blockchain Enabled Intelligence of Federated Systems (BELIEFS): An attack-tolerant trustable distributed intelligence paradigm

In this article, a Blockchain Enabled Intelligence of Federated Systems (BELIEFS) is proposed to conduct cooperative control for the multi-regional large-scale power system with a multi-agents system (MAS). By establishing a two levels blockchain, each regional AI agent can simultaneously manage intra-regional controllers and cooperate with other AI agents. Under the consensus mechanism, the agents, which respectively conducted distributed deep reinforcement learning (DDRL) algorithm in multi-regions, can have the tolerant capability of malicious attacks in their training process. The demonstration of the proposed approach is within a multi-regional large-scale interconnected power system. Under the mode of "centralized dispatching and hierarchical management", this article aims to definite a mathematical model to deal with the control problem of the power systems. With the comparison experiments, the effectiveness and efficiency of our proposed method in the training process are verified. In addition, malicious attacks are set on the main chain and shard chains to verify the attack-tolerant capability. We expect that such approach and results can suggest a new paradigm of attack-tolerant trustable distributed AI deployment.

97 MATHEMATICS AND COMPUTING↗

A Secure Learning Control Strategy via Dynamic Camouflaging for Unknown Dynamical Systems under Attacks

This paper presents a secure reinforcement learning (RL) based control method for unknown linear time-invariant cyber-physical systems (CPSs) that are subjected to compositional attacks such as eavesdropping and covert attack. We consider the attack scenario where the attacker learns about the dynamic model during the exploration phase of the learning conducted by the designer to learn a linear quadratic regulator (LQR), and thereafter, use such information to conduct a covert attack on the dynamic system, which we refer to as doubly learning-based control and attack (DLCA) framework. We propose a dynamic camouflaging based attack-resilient reinforcement learning (ARRL) algorithm which can learn the desired optimal controller for the dynamic system, and at the same time, can inject sufficient misinformation in the estimation of system dynamics by the attacker. The algorithm is accompanied by theoretical guarantees and extensive numerical experiments on a consensus multi-agent system and on a benchmark power grid model.

Mukherjee, Sayak↗

Distributed Flexibility Characterization and Resource Allocation Strategies for Multi-zone Commercial Buildings in the Smart Grid

The HVAC (Heating, Ventilation, and Air- Conditioning) system of commercial buildings is a complex system with a large number of dynamically interacting components. In particular, the thermal dynamics of each zone are coupled with those of the neighboring zones. In this paper, we study a multi-agent based approach to model and control commercial building HVAC system for providing grid services. In the multi-agent system (MAS), individual zones are modeled as agents that can communicate, interact, and negotiate with one another to achieve a common objective. We first propose a distributed characterization method on the aggregated airflow (and thus fan power) flexibility that the HVAC system can provide to the ancillary service market. Then, we propose a Nash-bargaining based airflow allocation strategy to track a dispatch signal (that is within the offered flexibility limit) while respecting the preference and flexibility of individual zones. Moreover, we devise a distributed algorithm to obtain the Nash bargaining solution via dual decomposition and average consensus. Numerical simulations illustrate that the proposed distributed protocols are much more scalable than the centralized approaches especially when the system becomes larger and more complex.

Hao, He↗

Matlab Cluster Ensemble Toolbox

This is a Matlab toolbox for investigating the application of cluster ensembles to data classification, with the objective of improving the accuracy and/or speed of clustering. The toolbox divides the cluster ensemble problem into four areas, providing functionality for each. These include, (1) synthetic data generation, (2) clustering to generate individual data partitions and similarity matrices, (3) consensus function generation and final clustering to generate ensemble data partitioning, and (4) implementation of accuracy metrics. With regard to data generation, Gaussian data of arbitrary dimension can be generated. The kcenters algorithm can then be used to generate individual data partitions by either, (a) subsampling the data and clustering each subsample, or by (b) randomly initializing the algorithm and generating a clustering for each initialization. In either case an overall similarity matrix can be computed using a consensus function operating on the individual similarity matrices. A final clustering can be performed and performance metrics are provided for evaluation purposes.

De Sapio, Vincent↗

Matlab Cluster Ensemble Toolbox v. 1.0

This is a Matlab toolbox for investigating the application of cluster ensembles to data classification, with the objective of improving the accuracy and/or speed of clustering. The toolbox divides the cluster ensemble problem into four areas, providing functionality for each. These include, (1) synthetic data generation, (2) clustering to generate individual data partitions and similarity matrices, (3) consensus function generation and final clustering to generate ensemble data partitioning, and (4) implementation of accuracy metrics. With regard to data generation, Gaussian data of arbitrary dimension can be generated. The kcenters algorithm can then be used to generate individual data partitions by either, (a) subsampling the data and clustering each subsample, or by (b) randomly initializing the algorithm and generating a clustering for each initialization. In either case an overall similarity matrix can be computed using a consensus function operating on the individual similarity matrices. A final clustering can be performed and performance metrics are provided for evaluation purposes.

Source record↗

Collaboration and Negotiation

Collaboration and Negotiation is a critical high-level function of an Autonomous Intelligent Cyber-Defense Agent (AICA) that enables communication among agents, central cyber C2, and human operators. Maintaining the Confidentiality, Integrity, and Availability (CIA) triad while achieving mission goals requires stealthy AICA agents to exercise: 1) minimal communication as needed for avoiding detection, 2) verification of information received with possibly limited resources, and 3) active learning during operations to address dynamic conditions. Moreover, negotiations to jointly identify and execute a Course of Action (COA) solution will require building consensus under distributed and/or decentralized multiagent settings with information uncertainties. This chapter presents algorithmic approaches for enabling the collaboration and negotiation function. Strengths and limitations of potential techniques are identified, and a representative example is illustrated. Recommendations for future development are also discussed.

Chatterjee, Samrat↗

International Spine Radiosurgery Consortium Consensus Guidelines for Target Volume Definition in Spinal Stereotactic Radiosurgery

Purpose: Spinal stereotactic radiosurgery (SRS) is increasingly used to manage spinal metastases. However, target volume definition varies considerably and no consensus target volume guidelines exist. This study proposes consensus target volume definitions using common scenarios in metastatic spine radiosurgery. Methods and Materials: Seven radiation oncologists and 3 neurological surgeons with spinal radiosurgery expertise independently contoured target and critical normal structures for 10 cases representing common scenarios in metastatic spine radiosurgery. Each set of volumes was imported into the Computational Environment for Radiotherapy Research. Quantitative analysis was performed using an expectation maximization algorithm for Simultaneous Truth and Performance Level Estimation (STAPLE) with kappa statistics calculating agreement between physicians. Optimized confidence level consensus contours were identified using histogram agreement analysis and characterized to create target volume definition guidelines. Results: Mean STAPLE agreement sensitivity and specificity was 0.76 (range, 0.67-0.84) and 0.97 (range, 0.94-0.99), respectively, for gross tumor volume (GTV) and 0.79 (range, 0.66-0.91) and 0.96 (range, 0.92-0.98), respectively, for clinical target volume (CTV). Mean kappa agreement was 0.65 (range, 0.54-0.79) for GTV and 0.64 (range, 0.54-0.82) for CTV (P<.01 for GTV and CTV in all cases). STAPLE histogram agreement analysis identified optimal consensus contours (80% confidence limit). Consensus recommendations include that the CTV should include abnormal marrow signal suspicious for microscopic invasion and an adjacent normal bony expansion to account for subclinical tumor spread in the marrow space. No epidural CTV expansion is recommended without epidural disease, and circumferential CTVs encircling the cord should be used only when the vertebral body, bilateral pedicles/lamina, and spinous process are all involved or there is extensive metastatic disease along the circumference of the epidural space. Conclusions: This report provides consensus guidelines for target volume definition for spinal metastases receiving upfront SRS in common clinical situations.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

SU-F-J-123: CT-Based Determination of DIBH Variability and Its Dosimetric Impact On Post-Mastectomy Plus Regional Nodal Radiation Therapy

Purpose: Breast cancer radiotherapy delivered using voluntary deep inspiration breath-hold (DIBH) requires reproducible breath holds, particularly when matching supraclavicular fields to tangential fields. We studied the impact of variation in DIBHs on CTV and OAR dose metrics by comparing the dose distribution computed on two DIBH CT scans taken at the time of simulation. Methods: Ten patients receiving 50Gy in 25 fractions to the left chestwall and regional lymph nodes were studied. Two simulation CT scans were taken during separate DIBHs along with a free-breathing (FB) scan. The treatment was planned using one DIBH CT. The dose was recomputed on the other two scans using adaptive planning (Pinnacle 9.10) in which the scans are registered using a cross-correlation algorithm. The chestwall, lymph nodes and OARs were contoured on the scans following the RTOG consensus guidelines. The overall translational and rotational variation between the DIBH scans was used to estimate positional variation between breath-holds. Dose metrics between plans were compared using paired t-tests (p < 0.05) and means and standard deviations were reported. Results: The registration parameters were sub-millimeter and sub-degree. Although DIBH significantly reduced mean heart dose by 2.4Gy compared to FB (p < 0.01), no significant changes in dose were observed for targets or OARs between the two DIBH scans. Nodal coverage as assessed by V90% was 90%±8% and 89%±8% for supraclavicular and 99%±2% and 97%±22% for IM nodes. Though a significant decrease (10.5%±12.4%) in lung volume in the second DIBH CT was observed, the lung V20Gy was unchanged (14±2% and 14±3%) between the two DIBH scans. Conclusion: While the lung volume often varied between DIBHs, the CTV and OAR dose metrics were largely unchanged. This indicates that manual DIBH has the potential to provide consistent dose delivery to the chestwall and regional nodes targets when using matched fields.

60 APPLIED LIFE SCIENCES↗

Distributed finite-time estimation of the bounds on algebraic connectivity for directed graphs

This paper studied distributed estimation of the bounds on algebraic connectivity for a directed graph (i.e., digraph). As is well known, the main challenge of the underlying problem is how to enable local awareness of an entity otherwise prone to global information, in the presence of communication topology. More specifically, we introduce a novel state-dependent approach to estimate the bounds on algebraic connectivity with mild requirement on topology and communication effort. Finally, compared with existing results, the proposed algorithm does not estimate eigenvalues or eigenvectors directly, rather it exploits their implications on the consensus procedure, and achieves a tradeoff between estimation accuracy and topological/communication requirement, and its convergence can be expected in a finite time. Simulation results verified the performance of the proposed strategy.

42 ENGINEERING↗

Consensus Recommendations for Radiation Therapy Contouring and Treatment of Vulvar Carcinoma

Purpose: The purpose of this study was to develop a radiation therapy (RT) contouring atlas and recommendations for women with postoperative and locally advanced vulvar carcinoma. Methods and Materials: An international committee of 35 expert gynecologic radiation oncologists completed a survey of the treatment of vulvar carcinoma. An initial set of recommendations for contouring was discussed and generated by consensus. Two cases, 1 locally advanced and 1 postoperative, were contoured by 14 physicians. Contours were compared and analyzed using an expectation-maximization algorithm for simultaneous truth and performance level estimation (STAPLE), and a 95% confidence interval contour was developed. The level of agreement among contours was assessed using a kappa statistic. STAPLE contours underwent full committee editing to generate the final atlas consensus contours. Results: Analysis of the 14 contours showed substantial agreement, with kappa statistics of 0.69 and 0.64 for cases 1 and 2, respectively. There was high specificity for both cases (≥99%) and only moderate sensitivity of 71.3% and 64.9% for cases 1 and 2, respectively. Expert review and discussion generated consensus recommendations for contouring target volumes and treatment for postoperative and locally advanced vulvar cancer. Conclusions: These consensus recommendations for contouring and treatment of vulvar cancer identified areas of complexity and controversy. Given the lack of clinical research evidence in vulvar cancer radiation therapy, the committee advocates a conservative and consistent approach using standardized recommendations.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

A Hierarchical Framework for CO2 Storage Capacity in Deep Saline Aquifer Formations

Carbon dioxide (CO 2 ) storage in deep saline aquifers is a vital option for CO 2 mitigation at a large scale. Determining storage capacity is one of the crucial steps toward large-scale deployment of CO 2 storage. Results of capacity assessments tend toward a consensus that sufficient resources are available in saline aquifers in many parts of the world. However, current CO 2 capacity assessments involve significant inconsistencies and uncertainties caused by various technical assumptions, storage mechanisms considered, algorithms, and data types and resolutions. Furthermore, other constraint factors (such as techno-economic features, site suitability, risk, regulation, social-economic situation, and policies) significantly affect the storage capacity assessment results. Consequently, a consensus capacity classification system and assessment method should be capable of classifying the capacity type or even more related uncertainties. We present a hierarchical framework of CO 2 capacity to define the capacity types based on the various factors, algorithms, and datasets. Finally, a review of onshore CO 2 aquifer storage capacity assessments in China is presented as examples to illustrate the feasibility of the proposed hierarchical framework.

58 GEOSCIENCES↗

Adversarial Binaries: AI-guided Instrumentation Methods for Malware Detection Evasion

Adversarial binaries are executable files that have been altered without loss of function by an AI agent in order to deceive malware detection systems. Progress in this emergent vein of research has been constrained by the complex and rigid structure of executable files. Although prior work has demonstrated that these binaries deceive a variety of malware classification models which rely on disparate feature sets, a consensus as to the best approach has not been reached, either in terms of the optimization algorithms or the instrumentation methods. Furthermore, although inconsistencies in the data sets, target classifiers, and functionality verification methods make head-to-head comparisons difficult, here we extract lessons learned and make recommendations for future research.

malware obfuscation↗

Consensus Contouring Guidelines for Postoperative Stereotactic Body Radiation Therapy for Metastatic Solid Tumor Malignancies to the Spine

Purpose: To develop consensus contouring guidelines for postoperative stereotactic body radiation therapy (SBRT) for spinal metastases. Methods and Materials: Ten spine SBRT specialists representing 10 international centers independently contoured the clinical target volume (CTV), planning target volume (PTV), spinal cord, and spinal cord planning organ at risk volume (PRV) for 10 representative clinical scenarios in postoperative spine SBRT for metastatic solid tumor malignancies. Contours were imported into the Computational Environment for Radiotherapy Research. Agreement between physicians was calculated with an expectation minimization algorithm using simultaneous truth and performance level estimation with κ statistics. Target volume definition guidelines were established by finding optimized confidence level consensus contours using histogram agreement analyses. Results: Nine expert radiation oncologists and 1 neurosurgeon completed contours for all 10 cases. The mean sensitivity and specificity were 0.79 (range, 0.71-0.89) and 0.94 (range, 0.90-0.99) for the CTV and 0.79 (range, 0.70-0.95) and 0.92 (range, 0.87-0.99) for the PTV), respectively. Mean κ agreement, which demonstrates the probability that contours agree by chance alone, was 0.58 (range, 0.43-0.70) for CTV and 0.58 (range, 0.37-0.76) for PTV (P<.001 for all cases). Optimized consensus contours were established for all patients with 80% confidence interval. Recommendations for CTV include treatment of the entire preoperative extent of bony and epidural disease, plus immediately adjacent bony anatomic compartments at risk of microscopic disease extension. In particular, a “donut-shaped” CTV was consistently applied in cases of preoperative circumferential epidural extension, regardless of extent of residual epidural extension. Otherwise more conformal anatomic-based CTVs were determined and described. Spinal instrumentation was consistently excluded from the CTV. Conclusions: We provide consensus contouring guidelines for common scenarios in postoperative SBRT for spinal metastases. These consensus guidelines are subject to clinical validation.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

StralSV: assessment of sequence variability within similar 3D structures and application to polio RNA-dependent RNA polymerase

Most of the currently used methods for protein function prediction rely on sequence-based comparisons between a query protein and those for which a functional annotation is provided. A serious limitation of sequence similarity-based approaches for identifying residue conservation among proteins is the low confidence in assigning residue-residue correspondences among proteins when the level of sequence identity between the compared proteins is poor. Multiple sequence alignment methods are more satisfactory - still, they cannot provide reliable results at low levels of sequence identity. Our goal in the current work was to develop an algorithm that could overcome these difficulties and facilitate the identification of structurally (and possibly functionally) relevant residue-residue correspondences between compared protein structures. Here we present StralSV, a new algorithm for detecting closely related structure fragments and quantifying residue frequency from tight local structure alignments. We apply StralSV in a study of the RNA-dependent RNA polymerase of poliovirus and demonstrate that the algorithm can be used to determine regions of the protein that are relatively unique or that shared structural similarity with structures that are distantly related. By quantifying residue frequencies among many residue-residue pairs extracted from local alignments, one can infer potential structural or functional importance of specific residues that are determined to be highly conserved or that deviate from a consensus. We further demonstrate that considerable detailed structural and phylogenetic information can be derived from StralSV analyses. StralSV is a new structure-based algorithm for identifying and aligning structure fragments that have similarity to a reference protein. StralSV analysis can be used to quantify residue-residue correspondences and identify residues that may be of particular structural or functional importance, as well as unusual or unexpected residues at a given sequence position.

59 BASIC BIOLOGICAL SCIENCES↗

StralSV: assessment of sequence variability within similar 3D structures and application to polio RNA-dependent RNA polymerase

Background: Most of the currently used methods for protein function prediction rely on sequence-based comparisons between a query protein and those for which a functional annotation is provided. A serious limitation of sequence similarity-based approaches for identifying residue conservation among proteins is the low confidence in assigning residue-residue correspondences among proteins when the level of sequence identity between the compared proteins is poor. Multiple sequence alignment methods are more satisfactory–still, they cannot provide reliable results at low levels of sequence identity. Our goal in the current work was to develop an algorithm that could help overcome these difficulties by facilitating the identification of structurally (and possibly functionally) relevant residue-residue correspondences between compared protein structures. Results: Here we present StralSV (structure-alignment sequence variability), a new algorithm for detecting closely related structure fragments and quantifying residue frequency from tight local structure alignments. We apply StralSV in a study of the RNA-dependent RNA polymerase of poliovirus, and we demonstrate that the algorithm can be used to determine regions of the protein that are relatively unique, or that share structural similarity with proteins that would be considered distantly related. By quantifying residue frequencies among many residue residue pairs extracted from local structural alignments, one can infer potential structural or functional importance of specific residues that are determined to be highly conserved or that deviate from a consensus. We further demonstrate that considerable detailed structural and phylogenetic information can be derived from StralSV analyses. Conclusions: StralSV is a new structure-based algorithm for identifying and aligning structure fragments that have similarity to a reference protein. StralSV analysis can be used to quantify residue-residue correspondences and identify residues that may be of particular structural or functional importance, as well as unusual or unexpected residues at a given sequence position. StralSV is provided as a web service at http://proteinmodel.org/AS2TS/ STRALSV/.

59 BASIC BIOLOGICAL SCIENCES↗

Evaluation of probabilistic photometric redshift estimation approaches for The Rubin Observatory Legacy Survey of Space and Time (LSST)

Many scientific investigations of photometric galaxy surveys require redshift estimates, whose uncertainty properties are best encapsulated by photometric redshift (photo-z) posterior probability density functions (PDFs). A plethora of photo-z PDF estimation methodologies abound, producing discrepant results with no consensus on a preferred approach. We present the results of a comprehensive experiment comparing twelve photo-z algorithms applied to mock data produced forLarge Synoptic Survey Telescope The Rubin Observatory Legacy Survey of Space and Time (lsst) Dark Energy Science Collaboration (desc). By supplying perfect prior information, in the form of the complete template library and a representative training set as inputs to each code, we demonstrate the impact of the assumptions underlying each technique on the output photo-z PDFs. In the absence of a notion of true, unbiased photo-z PDFs, we evaluate and interpret multiple metrics of the ensemble properties of the derived photo-z PDFs as well as traditional reductions to photo-z point estimates. Additionally, we report systematic biases and overall over/under-breadth of the photo-z PDFs of many popular codes, which may indicate avenues for improvement in the algorithms or implementations. Furthermore, we raise attention to the limitations of established metrics for assessing photo-z PDF accuracy; though we identify the conditional density estimate (CDE) loss as a promising metric of photo-z PDF performance in the case where true redshifts are available but true photo-z PDFs are not, we emphasize the need for science-specific performance metrics.

79 ASTRONOMY AND ASTROPHYSICS↗

Effects of ray profile modeling on resolution recovery in clinical CT

Purpose: Iterative image reconstruction gains more and more interest in clinical routine, as it promises to reduce image noise (and thereby patient dose), to reduce artifacts, or to improve spatial resolution. However, among vendors and researchers, there is no consensus of how to best achieve these goals. The authors are focusing on the aspect of geometric ray profile modeling, which is realized by some algorithms, while others model the ray as a straight line. The authors incorporate ray-modeling (RM) in nonregularized iterative reconstruction. That means, instead of using one simple single needle beam to represent the x-ray, the authors evaluate the double integral of attenuation path length over the finite source distribution and the finite detector element size in the numerical forward projection. Our investigations aim at analyzing the resolution recovery (RR) effects of RM. Resolution recovery means that frequencies can be recovered beyond the resolution limit of the imaging system. In order to evaluate, whether clinical CT images can benefit from modeling the geometrical properties of each x-ray, the authors performed a 2D simulation study of a clinical CT fan-beam geometry that includes the precise modeling of these geometrical properties. Methods: All simulations and reconstructions are performed in native fan-beam geometry. A water phantom with resolution bar patterns and a Forbild thorax phantom with circular resolution patterns representing calcifications in the heart region are simulated. An FBP reconstruction with a Ram–Lak kernel is used as a reference reconstruction. The FBP is compared to iterative reconstruction techniques with and without RM: An ordered subsets convex (OSC) algorithm without any RM (OSC), an OSC where the forward projection is modeled concerning the finite focal spot and detector size (OSC-RM) and an OSC with RM and with a matched forward and backprojection pair (OSC-T-RM, T for transpose). In all cases, noise was matched to be able to focus on comparing spatial resolution. The authors use two different simulation settings. Both are based on the geometry of a typical clinical CT system (0.7 mm detector element size at isocenter, 1024 projections per rotation). Setting one has an exaggerated source width of 5.0 mm. Setting two has a realistically small source width of 0.5 mm. The authors also investigate the transition from setting one to two. To quantify image quality, the authors analyze line profiles through the resolution patterns to define a contrast factor (CF) for contrast-resolution plots, and the authors compare the normalized cross-correlation (NCC) with respect to the ground truth of the circular resolution patterns. To independently analyze whether RM is of advantage, the authors implemented several iterative reconstruction algorithms: The statistical iterative reconstruction algorithm OSC, the ordered subsets simultaneous algebraic reconstruction technique (OSSART) and another statistical iterative reconstruction algorithm, denoted with ordered subsets maximum likelihood (OSML) algorithm. All algorithms were implemented both without RM (denoted as OSC, OSSART, and OSML) and with RM (denoted as OSC-RM, OSSART-RM, and OSML-RM). Results: For the unrealistic case of a 5.0 mm focal spot the CF can be improved by a factor of two due to RM: the 4.2 LP/cm bar pattern, which is the first bar pattern that cannot be resolved without RM, can be easily resolved with RM. For the realistic case of a 0.5 mm focus, all results show approximately the same CF. The NCC shows no significant dependency on RM when the source width is smaller than 2.0 mm (as in clinical CT). From 2.0 mm to 5.0 mm focal spot size increasing improvements can be observed with RM. Conclusions: Geometric RM in iterative reconstruction helps improving spatial resolution, if the ray cross-section is significantly larger than the ray sampling distance. In clinical CT, however, the ray is not much thicker than the distance between neighboring ray centers, as the focal spot size is small and detector crosstalk is negligible, due to reflective coatings between detector elements. Therefore,RM appears not to be necessary in clinical CT to achieve resolution recovery.

62 RADIOLOGY AND NUCLEAR MEDICINE↗