Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximation 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 325 records · Page 18

Quantum mereology: Factorizing Hilbert space into subsystems with quasiclassical dynamics

We study the question of how to decompose Hilbert space into a preferred tensor-product factorization without any preexisting structure other than a Hamiltonian operator, in particular the case of a bipartite decomposition into “system” and “environment.” Such a decomposition can be defined by looking for subsystems that exhibit quasiclassical behavior. The correct decomposition is one in which pointer states of the system are relatively robust against environmental monitoring (their entanglement with the environment does not continually and dramatically increase) and remain localized around approximately classical trajectories. We present an in-principle algorithm for finding such a decomposition by minimizing a combination of entanglement growth and internal spreading of the system. Both of these properties are related to locality in different ways. Furthermore, this formalism is relevant to questions in the foundations of quantum mechanics and the emergence of spacetime from quantum entanglement.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

ISOCS-based Extended In Situ Gamma Spectrometry Services Tool SuperISOCS for Waste Measurements - 20275

Canberra's In Situ Object Counting System (ISOCS) is an established tool used for gamma spectrometry. It allows physical representation of complex geometries and mathematical calculation of the calibration function while avoiding the need for radioisotope standards. ISOCS provides a large range of templates to generate the geometry for most nuclear waste components in nuclear facilities. Nonetheless, there are some complex geometries where the accuracy attainable is limited by the conventional ISOCS templates. An ISOCS-based extended in-situ Gamma Spectrometry service tool has been developed, based on the so-called SuperISOCS (SISOCS) software. This tool was developed to generate the most complex geometries. The principle of geometry construction is based on the composition of 8 different primitive geometries. The primitive object is able to be cut and to change a part of an object. An object is able to overlap to another one to form a more complex object. These functions refine the modelled geometry compared to the real objects and decrease the measurement systematic error because they allow the mathematical model to represent the real-life geometry more faithfully through reducing the approximations and simplifications that need to be made The algorithm of SISOCS is the same as that of standard ISOCS. A set of calculations was done in comparison with MCNP efficiency calculation and SISOCS results. 80 different models were compared between SISOCS and MCNP, with added 30 cases compared between ISOCS and SISOCS. The average differences were less than 2%, for all energy's efficiency calculations. In this paper we illustrate the benefits that this new tool can provide, in terms of improved accuracy for complex realistic geometries, through simulation of some example scenarios. Furthermore, we demonstrate, through SISOCS modelling of the real object data test, the comparison between SISOCS to ISOCS calculations for the same geometry. This paper describes the added functions that are easily employed using SISOCS. Our results show the potential application and benefit of this technique for real waste assay projects and the way to integrate the tool into the waste assay systems. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Nondestructive Evaluation of Concrete: Elastic Property Imaging Through Full Waveform Inversion

Concrete is a major construction material worldwide and plays a crucial role in the nuclear industry. The elastic properties of concrete are prone to change and degrade while in service, as it is often subjected to extreme operational and environmental conditions. An accurate evaluation of concrete's elastic properties is thus essential to ensure structural integrity and safety. This is especially true for concrete in nuclear power plants, where irradiation effects significantly impact concrete mechanical properties. There are various methods to assess these properties, with ultrasound-based techniques showing high potential due to their nondestructive nature, cost-effectiveness, and safety. While several nondestructive evaluation methods exist, most rely on idealizations such as assuming homogeneous material and plane wavefronts. In this work, we address these issues by introducing an ultrasound-based nondestructive method aimed at reconstructing spatially varying images of concrete mechanical properties. By accurately modeling wave physics, including scattering and reflection, we overcome several of the aforementioned idealizations and aim to utilize the full waveform for imaging material properties through depth, resulting in more reliable images. Full waveform inversion (FWI) was first introduced by geophysicists to reconstruct subsurface elastic property images. The goal is to minimize the difference between simulated and recorded wavefield signals, often through gradient-based optimization algorithms. While FWI is primarily conducted using the acoustic approximation of the wave equation, few works focus on elastic FWI, where the goal is to reconstruct images of not only the pressure wave speed but also the shear wave speed and density (or their equivalents). This work explores the potential of using elastic FWI to predict concrete mechanical properties as an initial effort for a more accurate monitoring of concrete conditions in service. Reconstructing images of different elastic parameters enables more specificity and accurate condition diagnosis. This paper will detail this approach and provide examples demonstrating the effectiveness of elastic FWI in reconstructing comprehensive maps of concrete mechanical properties.

42 - ENGINEERING↗

Learning Stochastic Parametric Differentiable Predictive Control Policies

We present a scalable unsupervised learning-based method for obtaining explicit control policies for model predictive control problems for stochastic linear systems with additive uncertainties subject to nonlinear chance constraints. We call the proposed method stochastic parametric differentiable predictive control (SP-DPC), which extends the recently proposed deterministic DPC policy optimization algorithm. We formulate the SP-DPC as a deterministic approximation to the stochastic parametric constrained optimal control problem via independent sampling of the problem's parameters and uncertainties. This formulation allows us to directly compute the policy gradients via automatic differentiation of the problem's value function, evaluated over sampled parameters and uncertainties. In particular, the computed expectation of the problem's value function is backpropagated through the finite-time closed-loop system rollouts parametrized by a known nominal system dynamics model and neural control policy. We also provide theoretical probabilistic guarantees on closed-loop stability and chance constraints satisfaction for systems controlled by learned neural policies. We demonstrate the computational efficiency and scalability of the proposed policy optimization algorithm in three numerical examples, including systems with a large number of states or subject to nonlinear constraints.

Drgona, Jan↗

Prototype acoustic positioning system for the Pacific Ocean Neutrino Experiment

We present the design and initial performance characterization of the prototype acoustic positioning system intended for the Pacific Ocean Neutrino Experiment. It comprises novel piezo-acoustic receivers with dedicated filtering- and amplification electronics installed in P-ONE instruments and is complemented by a commercial system comprised of cabled and autonomous acoustic pingers for sub-sea installation manufactured by Sonardyne Ltd. We performed an in-depth characterization of the acoustic receiver electronics and their acoustic sensitivity when integrated into P-ONE pressure housings. These show absolute sensitivities of up to -125 dB re V2/μPa2 in a frequency range of 10–40 kHz. We furthermore conducted a positioning measurement campaign in the ocean by deploying three autonomous acoustic pingers on the seafloor, as well as a cabled acoustic interrogator and a P-ONE prototype module deployed from a ship. Using a simple peak-finding detection algorithm, we observe high accuracy in the tracking of relative ranging times at approximately 230–280 μs at distances of up to 1600 m, which is sufficient for positioning detectors in a cubic-kilometer detector and which can be further improved with more involved detection algorithms. The tracking accuracy is further confirmed by independent ranging of the Sonardyne system and closely follows the ship's drift in the wind measured by GPS. The absolute positioning shows the same tracking accuracy with its absolute precision only limited by the large uncertainties of the deployed pinger positions on the seafloor.

Data analysis↗

Accelerating multilevel Markov Chain Monte Carlo using machine learning models

Here, this work presents an efficient approach for accelerating multilevel Markov Chain Monte Carlo (MCMC) sampling for large-scale problems using low-fidelity machine learning models. While conventional techniques for large-scale Bayesian inference often substitute computationally expensive high-fidelity models with machine learning models, thereby introducing approximation errors, our approach offers a computationally efficient alternative by augmenting high-fidelity models with low-fidelity ones within a hierarchical framework. The multilevel approach utilizes the low-fidelity machine learning model (MLM) for inexpensive evaluation of proposed samples thereby improving the acceptance of samples by the high-fidelity model. The hierarchy in our multilevel algorithm is derived from geometric multigrid hierarchy. We utilize an MLM to accelerate the coarse level sampling. Training machine learning model for the coarsest level significantly reduces the computational cost associated with generating training data and training the model. We present an MCMC algorithm to accelerate the coarsest level sampling using MLM and account for the approximation error introduced. We provide theoretical proofs of detailed balance and demonstrate that our multilevel approach constitutes a consistent MCMC algorithm. Additionally, we derive the expression for cost reduction due to machine learning model to facilitate cost analysis of the hierarchical sampling algorithm. Our technique is demonstrated on a standard benchmark inference problem in groundwater flow, where we estimate the probability density of a quantity of interest using a four-level MCMC algorithm. Our proposed algorithm accelerates multilevel sampling by a factor of two while achieving similar accuracy compared to sampling using the standard multilevel algorithm.

97 MATHEMATICS AND COMPUTING↗

Reinforcement learning for real-time process control in high-temperature superconductor manufacturing

With high efficiency and low energy loss, high-temperature superconductors (HTS) have demonstrated their profound applications in various fields, such as medical imaging, transportation, accelerators, microwave devices, and power systems. The high-field applications of HTS tapes have raised the demand for producing cost-effective tapes with long lengths in superconductor manufacturing. However, achieving the uniform and enhanced performance of a long HTS tape is challenging due to the unstable growth conditions in the manufacturing process. Although it is confirmed that the process parameters during the advanced metal organic chemical vapor deposition (A-MOCVD) process influence the uniformity of the produced HTS tapes, the high-dimensional process parameter signals and their complicated interactions make it difficult to develop an effective control policy. In this paper, we propose a local measure for the uniformity of HTS tapes to provide instant feedback for our control policy. Then, we model the manufacturing of HTS tapes as a Markov decision process (MDP) with continuous state and action spaces to assess the instant reward in real time in our feedback control model. As our MDP involves continuous and high-dimensional state and action spaces, a neural fitted Q-iteration (NFQ) algorithm is adopted to solve the MDP with artificial neural network (ANN) function approximation. The collinearity of process parameters can restrict our capability of adjusting the process parameters, which is addressed by the principal component analysis (PCA) in our method. The control policy adjusts the PCA of process parameters using the NFQ algorithm. In conclusion, based on our case studies on real A-MOCVD dataset, the obtained control policy increases the average uniformity of tapes by 5.6% and performs especially well on sample HTS tapes with a low uniformity.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DESI mock challenge: Halo and galaxy catalogues with the bias assignment method

We present a novel approach to the construction of mock galaxy catalogues for large-scale structure analysis based on the distribution of dark matter halos obtained with effective bias models at the field level. We aim to produce mock galaxy catalogues capable of generating accurate covariance matrices for a number of cosmological probes that are expected to be measured in current and forthcoming galaxy redshift surveys (e.g. two- and three-point statistics). The construction of the catalogues shown in this paper is part of a mock-comparison project within the Dark Energy Spectroscopic Instrument (DESI) collaboration. We use the bias assignment method ( BAM ) to model the statistics of halo distribution through a learning algorithm using a few detailed N-body simulations, and approximated gravity solvers based on Lagrangian perturbation theory. We introduce cosmic-web-dependent corrections to modelling redshift-space distortions at the N-body level – both in the halo and galaxy distributions –, as well as a multi-scale approach for accurate assignment of halo properties. Using specific models of halo occupation distributions to populate halos, we generate galaxy mocks with the expected number density and central-satellite fraction of emission-line galaxies, which are a key target of the DESI experiment. BAM generates mock catalogues with per cent accuracy in a number of summary statistics, such as the abundance, the two- and three-point statistics of halo distributions, both in real and redshift space. In particular, the mock galaxy catalogues display ~3%-10% accuracy in the multipoles of the power spectrum up to scales of k ~ 0.4 h -1 Mpc. We show that covariance matrices of two- and three-point statistics obtained with BAM display a similar structure to the reference simulation. BAM offers an efficient way to produce mock halo catalogues with accurate two- and three-point statistics and is able to generate a variety of multi-tracer catalogues with precise covariance matrices of several cosmological probes. We discuss future developments of the algorithm towards mock production in DESI and other galaxy-redshift surveys.

79 ASTRONOMY AND ASTROPHYSICS↗

Mutual information-assisted adaptive variational quantum eigensolver

Adaptive construction of ansatz circuits offers a promising route towards applicable variational quantum eigensolvers on near-term quantum hardware. Those algorithms aim to build up optimal circuits for a certain problem and ansatz circuits are adaptively constructed by selecting and adding entanglers from a predefined pool. In this work, we propose a way to construct entangler pools with reduced size by leveraging classical algorithms. Our method uses mutual information between the qubits in classically approximated ground state to rank and screen the entanglers. The density matrix renormalization group method is employed for classical precomputation in this work. We corroborate our method numerically on small molecules. Our numerical experiments show that a reduced entangler pool with a small portion of the original entangler pool can achieve same numerical accuracy. Here, we believe that our method paves a new way for adaptive construction of ansatz circuits for variational quantum algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multidimensional Tests of a Finite-Volume Solver for MHD With a Real-Gas Equation of State

This work considers two algorithms of a finite-volume solver for the MHD equations with a real-gas equation of state (EOS). Both algorithms use a multistate form of Harten-Lax-Van Leer approximate Riemann solver as formulated for MHD discontinuities. This solver is modified to use the generalized sound speed from the real-gas EOS. Two methods are tested: EOS evaluation at cell centers and at flux interfaces where the former is more computationally efficient. A battery of 1D and 2D tests are employed: convergence of 1D and 2D linearized waves, shock tube Riemann problems, a 2D nonlinear circularly polarized Alfvén wave, and a 2D magneto-Rayleigh-Taylor instability test. The cell-centered EOS evaluation algorithm produces unresolvable thermodynamic inconsistencies in the intermediate states leading to spurious solutions while the flux-interface EOS evaluation algorithm robustly produces the correct solution. The linearized wave tests show this inconsistency is associated with the magnetosonic waves and the magneto-Rayleigh-Taylor instability test demonstrates simulation findings where the spurious solution leads to an unphysical simulation.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Semicoherent symmetric quantum processes: Theory and applications

Discovering pragmatic and efficient approaches to construct ε-approximations of quantum operators such as real (imaginary) time-evolution propagators in terms of the basic quantum operations (gates) is challenging. Prior ε-approximations are invaluable, in that they enable the compilation of classical and quantum algorithm modeling of, e.g., dynamical and thermodynamic quantum properties. In parallel, symmetries are powerful tools concisely describing the fundamental laws of nature; the symmetric underpinnings of physical laws have consistently provided profound insights and substantially increased predictive power. In this work, we consider the interplay between the ε-approximate processes and the exact symmetries in a semicoherent context—where measurements occur at each logical clock cycle. Here we draw inspiration from Pascual Jordan's groundbreaking formulation of nonassociative, but commutative, symmetric algebraic form. Our symmetrized formalism is then applied in various domains such as quantum random walks, real-time evolutions, variational algorithm ansatzes, and efficient entanglement verification. Our work paves the way for a deeper understanding and greater appreciation of how symmetries can be used to control quantum dynamics in settings where coherence is a limited resource.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Learning Functions Varying along a Central Subspace

Many functions of interest are in a high-dimensional space but exhibit low-dimensional structures. This paper studies regression of an s-Hölder function in $R^D$ which varies along a central subspace of dimension $d$ while $d \ll D$. A direct approximation of $f$ in $R^D$ with an accuracy $\varepsilon$ requires the number of samples in the order of $\varepsilon^{-(2s+D)/s}$. In this paper, we analyze the generalized contour regression (GCR) algorithm for the estimation of the central subspace and use piecewise polynomials for function approximation. GCR is among the best estimators for the central subspace, but its sample complexity is an open question. In this paper, we partially answer this questions by proving that if a variance quantity is exactly known, GCR leads to a mean squared estimation error of $O(n^{-1})$ for the central subspace. The estimation error of this variance quantity is also given in this paper. The mean squared regression error of $f$ is proved to be in the order of $(n/\log n)^{-\frac{2s}{2s+d}}$, where the exponent depends on the dimension of the central subspace instead of the ambient space . This result demonstrates that GCR is effective in learning the low-dimensional central subspace. We also propose a modified GCR with improved efficiency. Here, the convergence rate is validated through several numerical experiments.

97 MATHEMATICS AND COMPUTING↗

Overall chilled water system energy consumption modeling and optimization

The emergence of increasingly affordable variable-speed drive technology has changed the approach used to control chilled water systems equipped with these drives. The purpose of this research was to develop an integrated chilled water modeling technique that can determine the optimal system setpoints and estimate the energy saving potential of chiller system. The chiller system equipped with Variable Frequency Drives (VFDs) on cooling tower fans and condenser water pumps. To accomplish the objective, physical component models of the centrifugal chiller, cooling tower and condenser water pump were established with the goal of incorporating the system’s condenser water flow rate and cooling tower fan speeds as optimization variables. Furthermore, a cooling load prediction algorithm was developed using a multiple non-linear regression model to approximate the building’s cooling load subject to a range of environmental conditions. The inputs and outputs of the individual component models were linked to estimate how adjusting the cooling tower fan and condenser water pump speed would influence the system’s comprehensive performance. Here, the overall system model was then optimized using a generalized reduced gradient optimization algorithm to determine the potential energy savings through speed control with VFDs and to ascertain a control logic strategy for the building automation system to operate the heating and cooling system. A case-study was performed on a single chiller system at a museum and the model was calibrated according to logged data collected over four months. Results showed that for the system analyzed, the energy saving of optimizing the cooling tower fan system was found to be 12–15%, while the energy saving potential of optimizing the condenser water pump with the cooling tower fan was negligible. Additionally, comparing different cooling tower fan control strategies showed that a wet-bulb approach-based cooling tower control strategy was shown to have the highest correlation to the optimized fan speed with an R 2 of 0.924.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Accelerating Markov Chain Monte Carlo sampling with diffusion models

Global fits of physics models require efficient methods for exploring high-dimensional and/or multimodal posterior functions. We introduce a novel method for accelerating Markov Chain Monte Carlo (MCMC) sampling by pairing a Metropolis-Hastings algorithm with a diffusion model that can draw global samples with the aim of approximating the posterior. We briefly review diffusion models in the context of image synthesis before providing a streamlined diffusion model tailored towards low-dimensional data arrays. We then present our adapted Metropolis-Hastings algorithm which combines local proposals with global proposals taken from a diffusion model that is regularly trained on the samples produced during the MCMC run. Our approach leads to a significant reduction in the number of likelihood evaluations required to obtain an accurate representation of the Bayesian posterior across several analytic functions, as well as for a physical example based on a global fit of parton distribution functions. Our method is extensible to other MCMC techniques, and we briefly compare our method to similar approaches based on normalising flows. A code implementation can be found at https://github.com/NickHunt-Smith/MCMC-diffusion.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

The Global LAnd Surface Satellite (GLASS) evapotranspiration product Version 5.0: Algorithm development and preliminary validation

An accurate estimation of spatially and temporally continuous global terrestrial evapotranspiration (ET) is essential in the assessment of surface energy, water and carbon cycles. The Global LAnd Surface Satellite (GLASS) ET product Version 4.0 (v4.0) based on the Bayesian model averaging (BMA) method was generated to estimate global terrestrial ET. However, certain uncertainty for the GLASS ET product v4.0 limits its application. In this study, we introduced the deep neural networks (DNN) merging framework to improve terrestrial ET estimation for GLASS ET product Version 5.0 (v5.0) generation by integrating five satellite-derived ET products [Moderate Resolution Imaging Spectroradiometer (MODIS) ET product (MOD16), Shuttleworth–Wallace dual-source ET product (SW), Priestley–Taylor-based ET product (PT-JPL), modified satellite-based Priestley–Taylor ET product (MS-PT) and simple hybrid ET product (SIM)]. We compared the performance of DNN method against other merging methods, including GLASS ET algorithm v4.0 (BMA), the gradient boosting regression tree (GBRT) method and the random forest (RF) method, based on 195 global eddy covariance (EC) flux towers covering observations from 2000 through 2015. Validations indicated that the DNN had the highest accuracy among four merging methods across different land cover types, yielding the highest average determination coefficients (R 2 , 0.62), root-mean-squared-error (RMSE, 24.1 W/m 2 ) and Kling–Gupta efficiency (KGE, 0.77) with a of 99% confidence interval. Compared with GLASS ET algorithm v4.0, the DNN improved on the R 2 by approximately 7% (p < 0.01) and the KGE by 10%. Based on the DNN, we then generated 8-day GLASS ET product v5.0 globally with a 1 km spatial resolution from 2001 to 2015 driven by GLASS vegetation and surface net radiation (R n ) datasets and Modern-Era Retrospective Analysis for Research and Applications, Version 2 (MERRA2) datasets. Finally, this global terrestrial ET product provides a valuable dataset for monitoring regional and global water resources and environmental changes.

54 ENVIRONMENTAL SCIENCES↗

Mesoscale Effects of Composition and Calendering in Lithium-Ion Battery Composite Electrodes

Macrohomogeneous battery models are widely used to predict battery performance, necessarily relying on effective electrode properties, such as specific surface area, tortuosity, and electrical conductivity. While these properties are typically estimated using ideal effective medium theories, in practice they exhibit highly non-ideal behaviors arising from their complex mesostructures. In this paper, we computationally reconstruct electrodes from X-ray computed tomography of 16 nickel–manganese–cobalt-oxide electrodes, manufactured using various material recipes and calendering pressures. Due to imaging limitations, a synthetic conductive binder domain (CBD) consisting of binder and conductive carbon is added to the reconstructions using a binder bridge algorithm. Reconstructed particle surface areas are significantly smaller than standard approximations predicted, as the majority of the particle surface area is covered by CBD, affecting electrochemical reaction availability. Finite element effective property simulations are performed on 320 large electrode subdomains to analyze trends and heterogeneity across the electrodes. Significant anisotropy of up to 27% in tortuosity and 47% in effective conductivity is observed. Electrical conductivity increases up to 7.5× with particle lithiation. We compare the results to traditional Bruggeman approximations and offer improved alternatives for use in cell-scale modeling, with Bruggeman exponents ranging from 1.62 to 1.72 rather than the theoretical value of 1.5. We also conclude that the CBD phase alone, rather than the entire solid phase, should be used to estimate effective electronic conductivity. This study provides insight into mesoscale transport phenomena and results in improved effective property approximations founded on realistic, image-based morphologies.

25 ENERGY STORAGE↗

Stochastic Approximation for Multi-period Simulation Optimization with Streaming Input Data

We consider a continuous-valued simulation optimization (SO) problem, where a simulator is built to optimize an expected performance measure of a real-world system while parameters of the simulator are estimated from streaming data collected periodically from the system. At each period, a new batch of data is combined with the cumulative data and the parameters are re-estimated with higher precision. The system requires the decision variable to be selected in all periods. Therefore, it is sensible for the decision-maker to update the decision variable at each period by solving a more precise SO problem with the updated parameter estimate to reduce the performance loss with respect to the target system. We define this decision-making process as the multi-period SO problem and introduce a multi-period stochastic approximation (SA) framework that generates a sequence of solutions. Two algorithms are proposed: Re-start SA (ReSA) reinitializes the stepsize sequence in each period, whereas Warm-start SA (WaSA) carefully tunes the stepsizes, taking both fewer and shorter gradient-descent steps in later periods as parameter estimates become increasingly more precise. We show that under suitable strong convexity and regularity conditions, ReSA and WaSA achieve the best possible convergence rate in expected sub-optimality either when an unbiased or a simultaneous perturbation gradient estimator is employed, while WaSA accrues significantly lower computational cost as the number of periods increases. In addition, we present the regularized ReSA, which obviates the need to know the strong convexity constant and achieves the same convergence rate at the expense of additional computation.

Computer Science↗

Parameter Optimization Toolbox for NS-3 network optimization, NS-3 Parameter Optimization Framework [SWR-18-60]

This simulation-based parameter optimization framework is proposed to tune parameters of different types of communication networks using ns-3 to achieve the optimal network performance. It consists of three main components: an ns-3 packet reporting module; a sampler running simulations with all possible parameter sets for the input parameter variables by using a parallel executor at each generation; and a hybrid optimization algorithm for tuning configurable parameters of hybrid designs and application parameter variables. The proposed hybrid metaheuristic optimization algorithm combines an evolutionary algorithm with a gradient descent function to quickly achieve an approximate globally optimum solution. This software is designed to be used in a multi-core processing Linux environment and run over a long duration of time. The execution time varies depending mainly upon the nature of the ns-3 configuration being simulated. This software includes a custom ns-3 QoS measurement application which must be included with the ns-3 source code during installation of the software.

Hasandka, Adarsh↗