Engineering PapersSearch

SEARCH · Engineering Papers

Results for “federated 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 19 records

Enhancing segmentation fairness through curriculum learning and progressive loss: a centralized and federated perspective on radiograph analysis

Bias in medical image segmentation can lead to unequal performance across demographic subgroups, raising concerns about fairness and reliability in clinical AI systems. While deep learning models have achieved high segmentation accuracy, ensuring equitable performance across race and gender remains a significant challenge, particularly in privacy-sensitive healthcare environments. This study investigates fairness-aware medical image segmentation for hip and knee radiographs using deep learning models evaluated in both centralized and Federated Learning (FL) settings. We introduce Curriculum Learning (CL) strategies and Progressive Loss (PL) functions to regulate sample difficulty during training. In addition, we propose two novel fairness-oriented federated learning algorithms, Federated Intersection over Union (FedIoU) and Federated Intersection over Union with Outlier Analysis (FedIoUoutlier). Experiments are conducted using multiple segmentation backbones and simulated multi-site data partitions derived from the Osteoarthritis Initiative dataset. Model performance is evaluated using Intersection over Union (IoU), IoU standard deviation, Skewed Error Ratio (SER), and Min-Max Disparity across race and gender subgroups. Statistical significance was verified using paired t-tests to compare per-sample IoU performance against baseline configurations. Across both hip and knee segmentation tasks, curriculum learning and progressive loss strategies consistently improved segmentation accuracy and reduced demographic performance disparities in centralized training. In federated settings, fairness-aware aggregation further enhanced performance. Notably, FedIoUoutlier combined with balanced curriculum learning and tiered progressive loss achieved the highest mean IoU while yielding the lowest SER and Min-Max Disparity, indicating improved fairness without sacrificing accuracy. In several configurations, federated models matched or exceeded the performance of optimized centralized models, with statistically significant improvements in per-sample IoU over baseline configurations. The results demonstrate that structured training strategies and fairness-aware federated aggregation can jointly improve accuracy, stability, and demographic fairness in medical image segmentation. By integrating curriculum learning, progressive loss, and novel FL algorithms, this work provides a practical pathway toward equitable and privacy-preserving AI systems for medical imaging.

97 MATHEMATICS AND COMPUTING

FIRM: federated image reconstruction using multimodal tomographic data

Here, we propose a federated algorithm for reconstructing images using multimodal tomographic data sourced from dispersed locations, addressing the challenges of traditional unimodal approaches that are prone to noise and reduced image quality, as well as the limitations of centralized multimodal approaches that require extensive data transfer, leading to significant communication overhead, storage demands, and potential data privacy concerns. Our approach formulates a joint inverse optimization problem incorporating multimodality constraints and solves it in a federated framework through local gradient computations complemented by lightweight central operations, thereby ensuring data decentralization. Leveraging the connection between our federated algorithm and the quadratic penalty method, we introduce an adaptive step-size rule with guaranteed sublinear convergence. Numerical results demonstrate superior computational efficiency and improved image reconstruction quality compared to existing approaches.

federated algorithm

Data Science and the Knowledge Discovery Adventure

This talk will cover the important steps involved in the data science and knowledge discovery process: • Initial fact gathering (interview domain experts, review reports, articles, state-of-the-art) • Identify the problem (prediction, classification, statistical analysis, etc.) • Survey supporting data sources • Understand the data (numerical, categorical, text, sampling rate, data quality issues, etc.) • Selecting relevant features and sources • Acquire the data (set up agreements with the data stewards, APIs to download, etc.) • Merge data sources (temporal, spatial, common key, other ontologies...) • Feature Engineering (non linear domain knowledge or physics-based relationships) • Build data processing pipeline (may need to tap into data stream, develop parallel processing algorithm, federated learning etc.) • Build model and test (tune hyper-parameters, cross validation.) • Analyze/Validate results (do the results make sense. Does it answer the original question). • Deploy/Publish (Monitor and assess benefits)

Data science

Coordination between Federated Scheduling and Conflict Resolution in UAM Operations

This work proposes a federated scheduling algorithm and explores two mechanisms for coordinating federated scheduling and conflict resolution functions - two core traffic management functions in urban air mobility operations. A federated scheduling algorithm is first developed, together with data that needs to be shared among schedulers. Two mechanisms for coordinating scheduling and conflict resolution functions are then introduced and studied as conflicts in high-density operations may not be completely resolved by conflict resolution function alone. The first coordination mechanism is constructed based on the arrival scheduler at the destination and another one utilizes the departure scheduler at the origin. Experiments and trade space studies are conducted to compare these two mechanisms using fast-time traffic simulations. Results show that both mechanisms perform well in coordinating scheduling and conflict resolution functions and helping resolve all potential conflicts. Experiments also show that with proper parameter selection, both mechanisms can achieve better efficiency (less delay) while maintaining zero losses of separation.

Federated scheduling

Coordination between Federated Scheduling and Conflict Resolution in UAM Operations

This work proposes a federated scheduling algorithm and explores two mechanisms for coordinating federated scheduling and conflict resolution functions - two core traffic management functions in urban air mobility operations. A federated scheduling algorithm is first developed, together with data that needs to be shared among schedulers. Two mechanisms for coordinating scheduling and conflict resolution functions are then introduced and studied as conflicts in high-density operations may not be completely resolved by conflict resolution function alone. The first coordination mechanism is constructed based on the arrival scheduler at the destination and another one utilizes the departure scheduler at the origin. Experiments and trade space studies are conducted to compare these two mechanisms using fast-time traffic simulations. Results show that both mechanisms perform well in coordinating scheduling and conflict resolution functions and helping resolve all potential conflicts. Experiments also show that with proper parameter selection, both mechanisms can achieve better efficiency (less delay) while maintaining zero losses of separation.

Federated scheduling

Parametric Study of Federated Conflict Resolution for UAM Operations

This work presents a federated conflict resolution algorithm and its parametric study for UAM operations. A federated speed-control-based conflict resolution algorithm is introduced first, including its rules of the road, data exchange requirement, and critical parameters. Two experiments were set up for the parametric study. The first investigates five parameters: look ahead time, resolution update interval, maximum allowed speed reduction, traffic flow interval, and crossing angle. The second experiment studies the uncertainty of departure time. Metrics associated with safety, efficiency, and conflict resolution effort were measured for each scenario. A Design Of Experiment (DOE) analysis was used to perform the multi-factor analysis for the first experiment. It revealed that the crossing angle and flow interval were the most critical parameters across all three metrics, followed by maximum allowed speed reduction. Look ahead time and resolution update interval were of minor significance to safety and conflict resolution effort, but had little to no effect on efficiency. The analysis of the second experiment showed that, given a flow rate, the fluctuation in departure time was absorbed by the conflict resolution algorithm, which resulted in a relatively small fluctuation in airborne delay.

Urban air mobility

Parametric Study of Federated Conflict Resolution for UAM Operations using DOE Analysis

This work presents a federated conflict resolution algorithm and its parametric study for UAM operations. A federated speed-control-based conflict resolution algorithm is introduced first, including its rules of the road, data exchange requirement, and critical parameters. Two experiments were set up for the parametric study. The first investigates five parameters: look ahead time, resolution update interval, maximum allowed speed reduction, traffic flow interval, and crossing angle. The second experiment studies the uncertainty of departure time. Metrics associated with safety, efficiency, and conflict resolution effort were measured for each scenario. A Design Of Experiment (DOE) analysis was used to perform the multi-factor analysis for the first experiment. It revealed that the crossing angle and flow interval were the most critical parameters across all three metrics, followed by maximum allowed speed reduction. Look ahead time and resolution update interval were of minor significance to safety and conflict resolution effort, but had little to no effect on efficiency. The analysis of the second experiment showed that, given a flow rate, the fluctuation in departure time was absorbed by the conflict resolution algorithm, which resulted in a relatively small fluctuation in airborne delay.

Urban air mobility

Privacy Preserving Federated Learning for Advanced Scientific Ecosystems

We present a framework to provide privacy preserving (PP) federating learning (FL) across multiple computational and experimental facilities. This work joins the compute capabilities of National Energy Research Scientific Computing Center (NERSC) and Oak Ridge National Laboratory Research Cloud (ORC) with simulated experimental data, such as those produced at the SLAC National Accelerator Laboratory and Spallation Neutron Source (SNS). We describe the software infrastructure developed to provide privacy for computational and experimental networks. We developed algorithmic privacy across the federated system by embedding database security, computation, and communication into the federation architecture, utilizing scientific tools developed by the experimental community.

Archibald, Rick [ORNL] (ORCID:0000000245389780)

Analysis of estimation algorithms for CDTI and CAS applications

Estimation algorithms for Cockpit Display of Traffic Information (CDTI) and Collision Avoidance System (CAS) applications were analyzed and/or developed. The algorithms are based on actual or projected operational and performance characteristics of an Enhanced TCAS II traffic sensor developed by Bendix and the Federal Aviation Administration. Three algorithm areas are examined and discussed. These are horizontal x and y, range and altitude estimation algorithms. Raw estimation errors are quantified using Monte Carlo simulations developed for each application; the raw errors are then used to infer impacts on the CDTI and CAS applications. Applications of smoothing algorithms to CDTI problems are also discussed briefly. Technical conclusions are summarized based on the analysis of simulation results.

Goka, T.

Flight-Management Algorithm for Fuel-Conservative Descents

Federal Aviation Administration has developed an automated time-based metering form of air traffic control for arrivals into terminal area called local flow management/profile descent (LFM/PD). LFM/PD saves fuel by matching airplane arrival flow to airport acceptance rate through time-control computations and by allowing pilot to descend at his discretion from cruise altitude to metering fix in an idle-thrust, clean configuration (landing gear up, flaps zero, speed brakes retracted).

Knox, C. E.

Algorithm for Fuel-Conservative Airplane Descents

Federal Aviation Administration implementing automated, time-based metering form of air-traffic control (ATC) with profile-descent procedures for arrivals into terminal area. Measures provide fuel savings by matching arrival of airplanes to airport acceptance rate through time-control computations and allowing pilot to descend at his discretion from cruise altitude to designated metering-fix altitude in idle-thrust clean configuration. Airborne descent algorithm developed compatible with time-based metering and profile-descent procedures and designed to improve accuracy of delivering airplane during fuel-efficient descent to metering fix at time designated by the ATC system.

Knox, C. E.

Fair Concurrent Training of Multiple Models in Federated Learning

Federated learning (FL) enables collaborative learning across multiple clients. In most FL work, all clients train a single learning task. However, the recent proliferation of FL applications may increasingly require multiple FL tasks to be trained simultaneously, sharing clients’ computing resources, which we call Multiple-Model Federated Learning (MMFL). Current MMFL algorithms use naïve average-based client-task allocation schemes that often lead to unfair performance when FL tasks have heterogeneous difficulty levels, as the more difficult tasks may need more client participation to train effectively. Furthermore, in the MMFL setting, we face a further challenge that some clients may prefer training specific tasks to others, and may not even be willing to train other tasks, e.g., due to high computational costs, which may exacerbate unfairness in training outcomes across tasks. We address both challenges by firstly designing FedFairMMFL, a difficulty-aware algorithm that dynamically allocates clients to tasks in each training round, based on the tasks’ current performance levels. We provide guarantees on the resulting task fairness and FedFairMMFL’s convergence rate. We then propose novel auction designs that incentivizes clients to train multiple tasks, so as to fairly distribute clients’ training efforts across the tasks, and extend our convergence guarantees to this setting. Here, we finally evaluate our algorithm with multiple sets of learning tasks on real world datasets, showing that our algorithm improves fairness by improving the final model accuracy and convergence speed of the worst performing tasks, while maintaining the average accuracy across tasks.

Federated learning

Design and Implementation of a Lunar Communications Satellite and Server for the 2012 SISO Smackdown

Last year, the Simulation Interoperability Standards Organization (SISO) inaugurated the now annual High Level Architecture (HLA) Smackdown at the Spring Simulation Interoperability Workshop (SIW). A primary objective of the Smackdown event is to provide college students with hands-on experience in the High Level Architecture (HLA). The University of Alabama in Huntsville (UAHuntsville) fielded teams in 2011 and 2012. Both the 2011 and 2012 smackdown scenarios were a lunar resupply mission. The 2012 UAHuntsville fielded four federates: a communications network Federate called Lunar Communications and Navigation Satellite Service (LCANServ) for sending and receiving messages, a Lunar Satellite Constellation (LCANSat) to put in place radios needed by the communications network for Line-Of-Sight communication calculations, and 3D graphical displays of the orbiting satellites and a 3D visualization of the lunar surface activities. This paper concentrates on the first two federates by describing the functions, algorithms, the modular FOM, experiences, lessons learned and recommendations for future Smackdown events.

Bulgatz, Dennis

NASA Unmanned Aircraft (UA) Control and Non-Payload Communication (CNPC) System Waveform Trade Studies

Unmanned Aircraft Systems (UAS) represent a new capability that will provide a variety of services in the government (public) and commercial (civil) aviation sectors. The growth of this potential industry has not yet been realized due to the lack of a common understanding of what is required to safely operate UAS in the National Airspace System (NAS). To address this deficiency, NASA has established a project called UAS Integration in the NAS (UAS in the NAS), under the Integrated Systems Research Program (ISRP) of the Aeronautics Research Mission Directorate (ARMD). This project provides an opportunity to transition concepts, technology, algorithms, and knowledge to the Federal Aviation Administration (FAA) and other stakeholders to help them define the requirements, regulations, and issues for routine UAS access to the NAS. The safe, routine, and efficient integration of UAS into the NAS requires new radio frequency (RF) spectrum allocations and a new data communications system which is both secure and scalable with increasing UAS traffic without adversely impacting the Air Traffic Control (ATC) communication system. These data communications, referred to as Control and Non-Payload Communications (CNPC), whose purpose is to exchange information between the unmanned aircraft and the ground control station to ensure safe, reliable, and effective unmanned aircraft flight operation. A Communications Subproject within the UAS in the NAS Project has been established to address issues related to CNPC development, certification and fielding. The focus of the Communications Subproject is on validating and allocating new RF spectrum and data link communications to enable civil UAS integration into the NAS. The goal is to validate secure, robust data links within the allocated frequency spectrum for UAS. A vision, architectural concepts, and seed requirements for the future commercial UAS CNPC system have been developed by RTCA Special Committee 203 (SC-203) in the process of determining formal recommendations to the FAA in its role provided for under the Federal Advisory Committee Act. NASA intends to conduct its research and development in keeping with this vision and associated architectural concepts. The prototype communication systems developed and tested by NASA will be used to validate and update the initial SC-203 requirements in order to provide a foundation for SC-203's Minimum Aviation System Performance Standards (MASPS).

Aircraft Communications

Three Dimensional Computer Graphics Federates for the 2012 Smackdown Simulation

The Simulation Interoperability Standards Organization (SISO) Smackdown is a two-year old annual event held at the 2012 Spring Simulation Interoperability Workshop (SIW). A primary objective of the Smackdown event is to provide college students with hands-on experience in developing distributed simulations using High Level Architecture (HLA). Participating for the second time, the University of Alabama in Huntsville (UAHuntsville) deployed four federates, two federates simulated a communications server and a lunar communications satellite with a radio. The other two federates generated 3D computer graphics displays for the communication satellite constellation and for the surface based lunar resupply mission. Using the Light-Weight Java Graphics Library, the satellite display federate presented a lunar-texture mapped sphere of the moon and four Telemetry Data Relay Satellites (TDRS), which received object attributes from the lunar communications satellite federate to drive their motion. The surface mission display federate was an enhanced version of the federate developed by ForwardSim, Inc. for the 2011 Smackdown simulation. Enhancements included a dead-reckoning algorithm and a visual indication of which communication satellite was in line of sight of Hadley Rille. This paper concentrates on these two federates by describing the functions, algorithms, HLA object attributes received from other federates, development experiences and recommendations for future, participating Smackdown teams.

Fordyce, Crystal

ASTAR Flight Test: Overview and Spacing Results

The purpose of the NASA Langley Airborne Spacing for Terminal Arrival Routes (ASTAR) research aboard the Boeing ecoDemonstrator aircraft was to demonstrate the use of NASA's ASTAR algorithm using contemporary tools of the Federal Aviation Administration's Next Generation Air Transportation System (NEXTGEN). EcoDemonstrator is a Boeing test program which utilizes advanced experimental equipment to accelerate the science of aerospace and environmentally friendly technologies. The ASTAR Flight Test provided a proof-of-concept flight demonstration that exercised an algorithmic-based application in an actual aircraft. The test aircraft conducted Interval Management operations to provide time-based spacing off a target aircraft in non-simulator wind conditions. Work was conducted as a joint effort between NASA and Boeing to integrate ASTAR in a Boeing supplied B787 test aircraft while using a T-38 aircraft as the target. This demonstration was also used to identify operational risks to future flight trials for the NASA Air Traffic Management Technology Demonstration expected in 2017.

Roper, Roy D.

The gust-front detection and wind-shift algorithms for the Terminal Doppler Weather Radar system

The Federal Aviation Administration's (FAA) Terminal Doppler Weather Radar (TDWR) system was primarily designed to address the operational needs of pilots in the avoidance of low-altitude wind shears upon takeoff and landing at airports. One of the primary methods of wind-shear detection for the TDWR system is the gust-front detection algorithm. The algorithm is designed to detect gust fronts that produce a wind-shear hazard and/or sustained wind shifts. It serves the hazard warning function by providing an estimate of the wind-speed gain for aircraft penetrating the gust front. The gust-front detection and wind-shift algorithms together serve a planning function by providing forecasted gust-front locations and estimates of the horizontal wind vector behind the front, respectively. This information is used by air traffic managers to determine arrival and departure runway configurations and aircraft movements to minimize the impact of wind shifts on airport capacity. This paper describes the gust-front detection and wind-shift algorithms to be fielded in the initial TDWR systems. Results of a quantitative performance evaluation using Doppler radar data collected during TDWR operational demonstrations at the Denver, Kansas City, and Orlando airports are presented. The algorithms were found to be operationally useful by the FAA airport controllers and supervisors.

Hermes, Laurie G.