Layne T. Watson
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Layne T. Watson has a total of 88 co-authors. Here are the top co-authors by number of shared publications:
- Thomas Lux
Meta, Menlo Park, CA, USA
6 shared publications - Tyler H. Chang
Mathematics and Computer Science Division, Argonne National Laboratory, Lemont, Illinois 60439
5 shared publications - Raphael T. Haftka
University of Florida, Gainesville, Florida 32611
4 shared publications - Cihan Oguz
Integrated Data Sciences Section, Research Technologies Branch, National Institute of Allergy and Infectious Diseases, National Institutes of Health, Bethesda, MD, USA
3 shared publications - Clifford A. Shaffer
Department of Computer Science, Virginia Tech, Blacksburg, VA 24061, USA
3 shared publications - Hussain M. J. Almohri
Department of Computer Science, Kuwait University, Kuwait City, Kuwait
3 shared publications
Latest Publications
- Open Access
- 6 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 92019-92035
FedQP: Large-Scale Private and Flexible Federated Query Processing
State-of-the-art federated learning methods orchestrate iterations of the stochastic gradient descent algorithm among a network of clients to refine a unified set of model parameters, all while safeguarding individual client datasets. Although promising, the success of existing approaches hinges on using a uniform data model with the same optimization and learning algorithms by the participants. In addition, existing methods can be subject to privacy attacks, such as model-inversion attacks. A pivotal challenge lies in crafting an algorithm that can efficiently aggregate client inputs, ensuring minimal client dataset exposure and maximum flexibility in model adaptation. We propose a new scheme for aggregating local, diverse, and independent data models, addressing data inconsistency and model-inversion attacks. The proposed scheme, federated query processing FedQP, enables clients to build local models independently, without coordinating with the server or other clients. The server communicates with selected clients only to predict future values. Our scheme only requires one communication round between each client and the server for model initialization without the need for a training phase. Clients do not share data or model parameters. We evaluated FedQP by assessing the impact of our new aggregation mechanism on model accuracy and the communication efficacy of our architecture. We show that the caching algorithm in FedQP reduces redundant client communications during query processing. In addition, we present a privacy analysis that shows that our method outperforms prominent gradient-based approaches to federated learning. Our experiments show that FedQP consistently achieves higher classification accuracy in non-IID settings and demonstrates stronger resilience to reconstruction attacks compared to gradient-based methods such as federated averaging (FedAvg).
- 6 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 92019-92035
Open AccessFedQP: Large-Scale Private and Flexible Federated Query Processing
State-of-the-art federated learning methods orchestrate iterations of the stochastic gradient descent algorithm among a network of clients to refine a unified set of model parameters, all while safeguarding individual client datasets. Although promising, the success of existing approaches hinges on using a uniform data model with the same optimization and learning algorithms by the participants. In addition, existing methods can be subject to privacy attacks, such as model-inversion attacks. A pivotal challenge lies in crafting an algorithm that can efficiently aggregate client inputs, ensuring minimal client dataset exposure and maximum flexibility in model adaptation. We propose a new scheme for aggregating local, diverse, and independent data models, addressing data inconsistency and model-inversion attacks. The proposed scheme, federated query processing FedQP, enables clients to build local models independently, without coordinating with the server or other clients. The server communicates with selected clients only to predict future values. Our scheme only requires one communication round between each client and the server for model initialization without the need for a training phase. Clients do not share data or model parameters. We evaluated FedQP by assessing the impact of our new aggregation mechanism on model accuracy and the communication efficacy of our architecture. We show that the caching algorithm in FedQP reduces redundant client communications during query processing. In addition, we present a privacy analysis that shows that our method outperforms prominent gradient-based approaches to federated learning. Our experiments show that FedQP consistently achieves higher classification accuracy in non-IID settings and demonstrates stronger resilience to reconstruction attacks compared to gradient-based methods such as federated averaging (FedAvg).
- Open Access
- 28 June 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 50 (2) , 1-8
Remark on Algorithm 1012: Computing Projections with Large Datasets
In ACM TOMS Algorithm 1012, the DELAUNAYSPARSE software is given for performing Delaunay interpolation in medium to high dimensions. When extrapolating outside the convex hull of the training set, DELAUNAYSPARSE calls the nonnegative least squares solver DWNNLS to compute projections onto the convex hull. However, DWNNLS and many other available sum-of-squares optimization solvers were not intended for usage with many variable problems, which result from the large training sets that are typical in machine learning applications. Thus, a new PROJECT subroutine is given, based on the highly customizable quadratic program solver BQPD . This solution is shown to be as robust as DELAUNAYSPARSE for projection onto both synthetic and real-world datasets, where other available solvers frequently fail. Although it is intended as an update for DELAUNAYSPARSE , due to the difficulty and prevalence of the problem, this solution is likely to be of external interest as well.
- 28 June 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 50 (2) , 1-8
Open AccessRemark on Algorithm 1012: Computing Projections with Large Datasets
In ACM TOMS Algorithm 1012, the DELAUNAYSPARSE software is given for performing Delaunay interpolation in medium to high dimensions. When extrapolating outside the convex hull of the training set, DELAUNAYSPARSE calls the nonnegative least squares solver DWNNLS to compute projections onto the convex hull. However, DWNNLS and many other available sum-of-squares optimization solvers were not intended for usage with many variable problems, which result from the large training sets that are typical in machine learning applications. Thus, a new PROJECT subroutine is given, based on the highly customizable quadratic program solver BQPD . This solution is shown to be as robust as DELAUNAYSPARSE for projection onto both synthetic and real-world datasets, where other available solvers frequently fail. Although it is intended as an update for DELAUNAYSPARSE , due to the difficulty and prevalence of the problem, this solution is likely to be of external interest as well.
- Open Access
- 21 March 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 49 (1) , 1-17
Algorithm 1031: MQSI—Monotone Quintic Spline Interpolation
MQSI is a Fortran 2003 subroutine for constructing monotone quintic spline interpolants to univariate monotone data. Using sharp theoretical monotonicity constraints, first and second derivative estimates at data provided by a quadratic facet model are refined to produce a univariate C 2 monotone interpolant. Algorithm and implementation details, complexity and sensitivity analyses, usage information, a brief performance study, and comparisons with other spline approaches are included.
- 21 March 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 49 (1) , 1-17
Open AccessAlgorithm 1031: MQSI—Monotone Quintic Spline Interpolation
MQSI is a Fortran 2003 subroutine for constructing monotone quintic spline interpolants to univariate monotone data. Using sharp theoretical monotonicity constraints, first and second derivative estimates at data provided by a quadratic facet model are refined to produce a univariate C 2 monotone interpolant. Algorithm and implementation details, complexity and sensitivity analyses, usage information, a brief performance study, and comparisons with other spline approaches are included.
- Open Access
- 10 September 2022
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 48 (3) , 1-34
Algorithm 1028: VTMOP: Solver for Blackbox Multiobjective Optimization Problems
VTMOP is a Fortran 2008 software package containing two Fortran modules for solving computationally expensive bound-constrained blackbox multiobjective optimization problems. VTMOP implements the algorithm of [ 32 ], which handles two or more objectives, does not require any derivatives, and produces well-distributed points over the Pareto front. The first module contains a general framework for solving multiobjective optimization problems by combining response surface methodology, trust region methodology, and an adaptive weighting scheme. The second module features a driver subroutine that implements this framework when the objective functions can be wrapped as a Fortran subroutine. Support is provided for both serial and parallel execution paradigms, and VTMOP is demonstrated on several test problems as well as one real-world problem in the area of particle accelerator optimization.
- 10 September 2022
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 48 (3) , 1-34
Open AccessAlgorithm 1028: VTMOP: Solver for Blackbox Multiobjective Optimization Problems
VTMOP is a Fortran 2008 software package containing two Fortran modules for solving computationally expensive bound-constrained blackbox multiobjective optimization problems. VTMOP implements the algorithm of [ 32 ], which handles two or more objectives, does not require any derivatives, and produces well-distributed points over the Pareto front. The first module contains a general framework for solving multiobjective optimization problems by combining response surface methodology, trust region methodology, and an adaptive weighting scheme. The second module features a driver subroutine that implements this framework when the objective functions can be wrapped as a Fortran subroutine. Support is provided for both serial and parallel execution paradigms, and VTMOP is demonstrated on several test problems as well as one real-world problem in the area of particle accelerator optimization.
- Open Access
- 30 June 2022
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Autonomous and Adaptive Systems
- Vol. 17 (1-2) , 1-23
Dynamic System Diversification for Securing Cloud-based IoT Subnetworks
Remote exploitation attacks use software vulnerabilities to penetrate through a network of Internet of Things (IoT) devices. This work addresses defending against remote exploitation attacks on vulnerable IoT devices. As an attack mitigation strategy, we assume it is not possible to fix all the vulnerabilities and propose to diversify the open-source software used to manage IoT devices. Our approach is to deploy dynamic cloud-based virtual machine proxies for physical IoT devices. Our architecture leverages virtual machine proxies with diverse software configurations to mitigate vulnerable and static software configurations on physical devices. We develop an algorithm for selecting new configurations based on network anomaly detection signals to learn vulnerable software configurations on IoT devices, automatically shifting towards more secure configurations. Cloud-based proxy machines mediate requests between application clients and vulnerable IoT devices, facilitating a dynamic diversification system. We report on simulation experiments to evaluate the dynamic system. Two models of powerful adversaries are introduced and simulated against the diversified defense strategy. Our experiments show that a dynamically diversified IoT architecture can be invulnerable to large classes of attacks that would succeed against a static architecture.
- 30 June 2022
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Autonomous and Adaptive Systems
- Vol. 17 (1-2) , 1-23
Open AccessDynamic System Diversification for Securing Cloud-based IoT Subnetworks
Remote exploitation attacks use software vulnerabilities to penetrate through a network of Internet of Things (IoT) devices. This work addresses defending against remote exploitation attacks on vulnerable IoT devices. As an attack mitigation strategy, we assume it is not possible to fix all the vulnerabilities and propose to diversify the open-source software used to manage IoT devices. Our approach is to deploy dynamic cloud-based virtual machine proxies for physical IoT devices. Our architecture leverages virtual machine proxies with diverse software configurations to mitigate vulnerable and static software configurations on physical devices. We develop an algorithm for selecting new configurations based on network anomaly detection signals to learn vulnerable software configurations on IoT devices, automatically shifting towards more secure configurations. Cloud-based proxy machines mediate requests between application clients and vulnerable IoT devices, facilitating a dynamic diversification system. We report on simulation experiments to evaluate the dynamic system. Two models of powerful adversaries are introduced and simulated against the diversified defense strategy. Our experiments show that a dynamically diversified IoT architecture can be invulnerable to large classes of attacks that would succeed against a static architecture.
- Open Access
- 17 February 2022
- Published by Taylor & Francis in Journal of Quality Technology
- Vol. 55 (1) , 88-103
Design strategies and approximation methods for high-performance computing variability management
Performance variability management is an active research area in high-performance computing (HPC). In this article, we focus on input/output (I/O) variability, which is a complicated function that is affected by many system factors. To study the performance variability, computer scientists often use grid-based designs (GBDs) which are equivalent to full factorial designs to collect I/O variability data, and use mathematical approximation methods to build a prediction model. Mathematical approximation models, as deterministic methods, could be biased particularly if extrapolations are needed. In statistics literature, space-filling designs (SFDs) and surrogate models such as Gaussian process (GP) are popular for data collection and building predictive models. The applicability of SFDs and surrogates in the HPC variability management setting, however, needs investigation. In this case study, we investigate their applicability in the HPC setting in terms of design efficiency, prediction accuracy, and scalability. We first customize the existing SFDs so that they can be applied in the HPC setting. We conduct a comprehensive investigation of design strategies and the prediction ability of approximation methods. We use both synthetic data simulated from three test functions and the real data from the HPC setting. We then compare different methods in terms of design efficiency, prediction accuracy, and scalability. In our synthetic and real data analysis, GP with SFDs outperforms in most scenarios. With respect to the choice of approximation models, GP is recommended if the data are collected by SFDs. If data are collected using GBDs, both GP and Delaunay can be considered. With the best choice of approximation method, the performance of SFDs and GBD depends on the property of the underlying surface. For the cases in which SFDs perform better, the number of design points needed for SFDs is about half of or less than that of the GBD to achieve the same prediction accuracy. Although we observe that the GBD can also outperform SFDs for smooth underlying surface, GBD is not scalable to high dimensional experimental regions. Therefore, SFDs that can be tailored to high dimension and non-smooth surface are recommended especially when large numbers of input factors need to be considered in the model. This article has online supplementary materials.
- 17 February 2022
- Published by Taylor & Francis in Journal of Quality Technology
- Vol. 55 (1) , 88-103
Open AccessDesign strategies and approximation methods for high-performance computing variability management
Performance variability management is an active research area in high-performance computing (HPC). In this article, we focus on input/output (I/O) variability, which is a complicated function that is affected by many system factors. To study the performance variability, computer scientists often use grid-based designs (GBDs) which are equivalent to full factorial designs to collect I/O variability data, and use mathematical approximation methods to build a prediction model. Mathematical approximation models, as deterministic methods, could be biased particularly if extrapolations are needed. In statistics literature, space-filling designs (SFDs) and surrogate models such as Gaussian process (GP) are popular for data collection and building predictive models. The applicability of SFDs and surrogates in the HPC variability management setting, however, needs investigation. In this case study, we investigate their applicability in the HPC setting in terms of design efficiency, prediction accuracy, and scalability. We first customize the existing SFDs so that they can be applied in the HPC setting. We conduct a comprehensive investigation of design strategies and the prediction ability of approximation methods. We use both synthetic data simulated from three test functions and the real data from the HPC setting. We then compare different methods in terms of design efficiency, prediction accuracy, and scalability. In our synthetic and real data analysis, GP with SFDs outperforms in most scenarios. With respect to the choice of approximation models, GP is recommended if the data are collected by SFDs. If data are collected using GBDs, both GP and Delaunay can be considered. With the best choice of approximation method, the performance of SFDs and GBD depends on the property of the underlying surface. For the cases in which SFDs perform better, the number of design points needed for SFDs is about half of or less than that of the GBD to achieve the same prediction accuracy. Although we observe that the GBD can also outperform SFDs for smooth underlying surface, GBD is not scalable to high dimensional experimental regions. Therefore, SFDs that can be tailored to high dimension and non-smooth surface are recommended especially when large numbers of input factors need to be considered in the model. This article has online supplementary materials.
- Open Access
Design Strategies and Approximation Methods for High-Performance Computing Variability Management
Performance variability management is an active research area in high-performance computing (HPC). We focus on input/output (I/O) variability. To study the performance variability, computer scientists often use grid-based designs (GBDs) to collect I/O variability data, and use mathematical approximation methods to build a prediction model. Mathematical approximation models could be biased particularly if extrapolations are needed. Space-filling designs (SFDs) and surrogate models such as Gaussian process (GP) are popular for data collection and building predictive models. The applicability of SFDs and surrogates in the HPC variability needs investigation. We investigate their applicability in the HPC setting in terms of design efficiency, prediction accuracy, and scalability. We first customize the existing SFDs so that they can be applied in the HPC setting. We conduct a comprehensive investigation of design strategies and the prediction ability of approximation methods. We use both synthetic data simulated from three test functions and the real data from the HPC setting. We then compare different methods in terms of design efficiency, prediction accuracy, and scalability. In synthetic and real data analysis, GP with SFDs outperforms in most scenarios. With respect to approximation models, GP is recommended if the data are collected by SFDs. If data are collected using GBDs, both GP and Delaunay can be considered. With the best choice of approximation method, the performance of SFDs and GBD depends on the property of the underlying surface. For the cases in which SFDs perform better, the number of design points needed for SFDs is about half of or less than that of the GBD to achieve the same prediction accuracy. SFDs that can be tailored to high dimension and non-smooth surface are recommended especially when large numbers of input factors need to be considered in the model.
Open AccessDesign Strategies and Approximation Methods for High-Performance Computing Variability Management
Performance variability management is an active research area in high-performance computing (HPC). We focus on input/output (I/O) variability. To study the performance variability, computer scientists often use grid-based designs (GBDs) to collect I/O variability data, and use mathematical approximation methods to build a prediction model. Mathematical approximation models could be biased particularly if extrapolations are needed. Space-filling designs (SFDs) and surrogate models such as Gaussian process (GP) are popular for data collection and building predictive models. The applicability of SFDs and surrogates in the HPC variability needs investigation. We investigate their applicability in the HPC setting in terms of design efficiency, prediction accuracy, and scalability. We first customize the existing SFDs so that they can be applied in the HPC setting. We conduct a comprehensive investigation of design strategies and the prediction ability of approximation methods. We use both synthetic data simulated from three test functions and the real data from the HPC setting. We then compare different methods in terms of design efficiency, prediction accuracy, and scalability. In synthetic and real data analysis, GP with SFDs outperforms in most scenarios. With respect to approximation models, GP is recommended if the data are collected by SFDs. If data are collected using GBDs, both GP and Delaunay can be considered. With the best choice of approximation method, the performance of SFDs and GBD depends on the property of the underlying surface. For the cases in which SFDs perform better, the number of design points needed for SFDs is about half of or less than that of the GBD to achieve the same prediction accuracy. SFDs that can be tailored to high dimension and non-smooth surface are recommended especially when large numbers of input factors need to be considered in the model.
- 1 January 2022
- Published by Hikari, Ltd. in Contemporary Engineering Sciences
- Vol. 15 (1) , 13-39
Self-learning, adaptive software: an example from aerospace engineering
- 1 January 2022
- Published by Hikari, Ltd. in Contemporary Engineering Sciences
- Vol. 15 (1) , 13-39
Self-learning, adaptive software: an example from aerospace engineering
- 3 March 2020
- Published by Taylor & Francis in International Journal of Parallel, Emergent and Distributed Systems
- Vol. 35 (2) , 111
A half century of computing
(2020). A half century of computing. International Journal of Parallel, Emergent and Distributed Systems. Ahead of Print.
- 3 March 2020
- Published by Taylor & Francis in International Journal of Parallel, Emergent and Distributed Systems
- Vol. 35 (2) , 111
A half century of computing
(2020). A half century of computing. International Journal of Parallel, Emergent and Distributed Systems. Ahead of Print.
- 3 March 2020
- Published by Taylor & Francis in International Journal of Parallel, Emergent and Distributed Systems
- Vol. 35 (2) , 209-215
Personal reflections on 50 years of scientific computing: 1967-2017
Computer hardware, software, numerical algorithms, and science and engineering applications are traced for a half century from the author's perspective. [GRAPHICS] .
- 3 March 2020
- Published by Taylor & Francis in International Journal of Parallel, Emergent and Distributed Systems
- Vol. 35 (2) , 209-215
Personal reflections on 50 years of scientific computing: 1967-2017
Computer hardware, software, numerical algorithms, and science and engineering applications are traced for a half century from the author's perspective. [GRAPHICS] .