Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithm selection”

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 1,153 records · Page 64

An (adjustable RN)-based multi-OLT PON and the dynamic programming algorithm for downstream channel

In this paper, a multiple optical line terminal (OLT) passive optical network (PON) and the dynamic programming algorithm for downstream channel is proposed. By wavelength-selectable module, the adjustable remote node (RN) is constructed. By this adjustable RN, a simple and efficient multi-OLT PON is designed. By the way of first-plan and then-load, optical network unit (ONU) groups are established in order to realize the fast loading of ONUs. Specially, by introducing dynamic programming algorithm, the wavelength bandwidth utilization is maximized. Finally, by the simulation and analysis, the effectiveness of the proposed scheme is demonstrated.

42 ENGINEERING↗

Specification of inputs and instrumentation for flutter testing of multivariable systems

The application of system identification methods in flutter testing of aeroelastic structure is discussed. The accuracy with which flutter parameters are estimated depends upon the test plan and on the algorithms used to reduce the data. The techniques for selecting the kinds and optimal positions of inputs and instrumentation, under typical test constraints, are presented. Identification results for both the input/output transfer function and the value of physical parameters are given. Numerical results on the optimal input spectrum and the accelerometer location for estimating flutter parameters of a two dimensional wing are obtained using these algorithms. Current work on applying system identification methods to high order three dimensional aeroelastic structures is reported.

Gupta, N. K.↗

Fundamental effective temperature measurements for eclipsing binary stars – IV. Selection of new benchmark stars and first results for HD 22064

I describe the selection and initial characterization of 20 eclipsing binary stars that are suitable for calibration and testing of stellar models and data analysis algorithms used by the PLATO mission and spectroscopic surveys. The binary stars selected are F-/G-type dwarf stars with M-type dwarf companions that contribute less than 2 per cent of the flux at optical wavelengths. The light curves typically show well-defined total eclipses with very little variability between the eclipses. I have used near-infrared spectra obtained by the APOGEE survey to measure the spectroscopic orbit for both stars in HD 22064. Combined with an analysis of the TESS light curve, I derive the following masses and radii: M 1 = 1.35 ± 0.03M ⊙ , M 2 = 0.58 ± 0.01M ⊙ , R 1 = 1.554 ± 0.014R ⊙ , R 2 = 0.595 ± 0.008R ⊙ . Using R 1 and the parallax from Gaia EDR3, I find that the primary star’s angular diameter is θ = 0.1035 ± 0.0009 mas. The apparent bolometric flux of the primary star is ${\mathcal {F}}_{{\oplus },0} = (7.51\pm 0.09)\times 10^{-9}$ erg cm -2 s -1 . Hence, this F2V star has an effective temperature $T_{\rm eff,1} = 6763{\rm \, K} \pm 39{\rm \, K}$. HD 22064 is an ideal benchmark star that can be used for ‘end-to-end’ tests of the stellar parameters measured by large-scale spectroscopic surveys or stellar parameters derived from asteroseismology with PLATO. The techniques described here for HD 22064 can be applied to the other eclipsing binaries in the sample in order to create an all-sky network of such benchmark stars.

79 ASTRONOMY AND ASTROPHYSICS↗

Bandwidth characteristics of multimedia data traffic on a local area network

Limited spacecraft communication links call for users to investigate the potential use of video compression and multimedia technologies to optimize bandwidth allocations. The objective was to determine the transmission characteristics of multimedia data - motion video, text or bitmap graphics, and files transmitted independently and simultaneously over an ethernet local area network. Commercial desktop video teleconferencing hardware and software and Intel's proprietary Digital Video Interactive (DVI) video compression algorithm were used, and typical task scenarios were selected. The transmission time, packet size, number of packets, and network utilization of the data were recorded. Each data type - compressed motion video, text and/or bitmapped graphics, and a compressed image file - was first transmitted independently and its characteristics recorded. The results showed that an average bandwidth of 7.4 kilobits per second (kbps) was used to transmit graphics; an average bandwidth of 86.8 kbps was used to transmit an 18.9-kilobyte (kB) image file; a bandwidth of 728.9 kbps was used to transmit compressed motion video at 15 frames per second (fps); and a bandwidth of 75.9 kbps was used to transmit compressed motion video at 1.5 fps. Average packet sizes were 933 bytes for graphics, 498.5 bytes for the image file, 345.8 bytes for motion video at 15 fps, and 341.9 bytes for motion video at 1.5 fps. Simultaneous transmission of multimedia data types was also characterized. The multimedia packets used transmission bandwidths of 341.4 kbps and 105.8kbps. Bandwidth utilization varied according to the frame rate (frames per second) setting for the transmission of motion video. Packet size did not vary significantly between the data types. When these characteristics are applied to Space Station Freedom (SSF), the packet sizes fall within the maximum specified by the Consultative Committee for Space Data Systems (CCSDS). The uplink of imagery to SSF may be performed at minimal frame rates and/or within seconds of delay, depending on the user's allocated bandwidth. Further research to identify the acceptable delay interval and its impact on human performance is required. Additional studies in network performance using various video compression algorithms and integrated multimedia techniques are needed to determine the optimal design approach for utilizing SSF's data communications system.

Chuang, Shery L.↗

Automatic Traffic Queue-End Identification using Location-Based Waze User Reports

Traffic queues, especially queues caused by non-recurrent events such as incidents, are unexpected to high-speed drivers approaching the end of queue (EOQ) and become safety concerns. Though the topic has been extensively studied, the identification of EOQ has been limited by the spatial-temporal resolution of traditional data sources. This study explores the potential of location-based crowdsourced data, specifically Waze user reports. It presents a dynamic clustering algorithm that can group the location-based reports in real time and identify the spatial-temporal extent of congestion as well as the EOQ. The algorithm is a spatial-temporal extension of the density-based spatial clustering of applications with noise (DBSCAN) algorithm for real-time streaming data with an adaptive threshold selection procedure. Here, the proposed method was tested with 34 traffic congestion cases in the Knoxville, Tennessee area of the United States. It is demonstrated that the algorithm can effectively detect spatial-temporal extent of congestion based on Waze report clusters and identify EOQ in real-time. The Waze report-based detection are compared to the detection based on roadside sensor data. The results are promising: The EOQ identification time of Waze is similar to the EOQ detection time of traffic sensor data, with only 1.1 min difference on average. In addition, Waze generates 1.9 EOQ detection points every mile, compared to 1.8 detection points generated by traffic sensor data, suggesting the two data sources are comparable in respect of reporting frequency. The results indicate that Waze is a valuable complementary source for EOQ detection where no traffic sensors are installed.

99 GENERAL AND MISCELLANEOUS↗

Evaluation of clip localization for different kilovoltage imaging modalities as applied to partial breast irradiation setup

Surgical clip localization and image quality were evaluated for different types of kilovoltage cone beam imaging modalities as applied to partial breast irradiation (PBI) setup. These modalities included (i) clinically available radiographs and cone beam CT (CB-CT) and (ii) various alternative modalities based on partial/sparse/truncated CB-CT. An anthropomorphic torso-breast phantom with surgical clips was used for the imaging studies. The torso phantom had artificial lungs, and the attached breast phantom was a mammographic phantom with realistic shape and tissue inhomogeneities. Three types of clips of variable size were used in two orthogonal orientations to assess their in-/cross-plane characteristics for image-guided setup of the torso-breast phantom in supine position. All studies were performed with the Varian on-board imaging (OBI, Varian) system. CT reconstructions were calculated with the standard Feldkamp-Davis-Kress algorithm. First, the radiographs were studied for a wide range of viewing angles to characterize image quality for various types of body anatomy in the foreground/background of the clips. Next, image reconstruction quality was evaluated for partial/sparse/truncated CB-CT. Since these modalities led to reconstructions with strong artifacts due to insufficient input data, a knowledge-based CT reconstruction method was also tested. In this method, the input data to the reconstruction algorithm were modified by combining complementary data sets selected from the treatment and reference projections. Different partial/sparse/truncated CB-CT scan types were studied depending on the total arc angle, angular increment between the consequent views (CT projections), orientation of the arc center with respect to the imaged breast and chest wall, and imaging field size. The central angles of the viewing arcs were either tangential or orthogonal to the chest wall. Several offset positions of the phantom with respect to the reference position were studied. The acquired and reconstructed image data sets were analyzed using home-built software focusing on the ability to localize clips in 3D. Streaking and leakage reconstruction artifacts and spatial distortions of breast surface were analyzed as well. Advantages and disadvantages of each kilovoltage CB imaging modality as applied to partial breast setup evaluation based on clips are presented. Because clips were found to be difficult to recognize in radiographs, 3D reconstructions were preferred. Even though it was possible to localize clips with about {+-}1 mm accuracy based on reconstructions for short arcs of 40 deg. and incremental angle up to about 5 deg., identification of clips in such reconstructions is difficult. Reconstructions obtained for arcs of as low as 80 deg. and incremental angle of as high as 3 deg. were suggested for easier clip identification. For more severely undersampled data, iterative CB-CT reconstruction is recommended to decrease the artifacts.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Pinning impulsive control algorithms for complex network

In this paper, we further investigate the synchronization of complex dynamical network via pinning control in which a selection of nodes are controlled at discrete times. Different from most existing work, the pinning control algorithms utilize only the impulsive signals at discrete time instants, which may greatly improve the communication channel efficiency and reduce control cost. Two classes of algorithms are designed, one for strongly connected complex network and another for non-strongly connected complex network. It is suggested that in the strongly connected network with suitable coupling strength, a single controller at any one of the network's nodes can always pin the network to its homogeneous solution. In the non-strongly connected case, the location and minimum number of nodes needed to pin the network are determined by the Frobenius normal form of the coupling matrix. In addition, the coupling matrix is not necessarily symmetric or irreducible. Illustrative examples are then given to validate the proposed pinning impulsive control algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Newly Released Capabilities in the Distributed-Memory SuperLU Sparse Direct Solver

We present the new features available in the recent release of SuperLU_DIST, Version 8.1.1. SuperLU_DIST is a distributed-memory parallel sparse direct solver. The new features include (1) a 3D communication-avoiding algorithm framework that trades off inter-process communication for selective memory duplication, (2) multi-GPU support for both NVIDIA GPUs and AMD GPUs, and (3) mixed-precision routines that perform single-precision LU factorization and double-precision iterative refinement. Apart from the algorithm improvements, we also modernized the software build system to use CMake and Spack package installation tools to simplify the installation procedure. Throughout the article, we describe in detail the pertinent performance-sensitive parameters associated with each new algorithmic feature, show how they are exposed to the users, and give general guidance of how to set these parameters. We illustrate that the solver’s performance both in time and memory can be greatly improved after systematic tuning of the parameters, depending on the input sparse matrix and underlying hardware.

97 MATHEMATICS AND COMPUTING↗

Distributed Energy Resources Coordination over Time-varying Directed Communication Networks

In this paper, we consider an optimal coordination problem for distributed energy resources (DERs) including distributed generators and energy storage devices. We first propose an algorithm based on the push-sum and gradient method to optimally coordinate storage devices and distributed generators in a distributed manner. In the proposed algorithm, each DER only maintains a set of variables and updates them through information exchange with a few neighboring DERs over a time-varying directed communication network. We show that the proposed distributed algorithm with appropriately chosen step-sizes solve the optimal DER coordination problem if the time-varying directed communication network is uniformly jointly strongly connected, which is a mild condition on the connectivity of communication topologies. The proposed distributed algorithm is illustrated and validated by numerical simulations.

Yang, Tao↗

Luminous Binary Supersoft X-Ray Sources

We have made remarkable progress in the study of luminous supersoft X-ray sources during the past year. We have begun to discover a population of ultraluminous SSSs (e.g., in NGC 300 [Kong & Di Stefano 20031 as well as in Ml0l [Di Stefano & Kong 2003]), which may be accreting intermediate-mass (50-100 solar mass) black holes. This work follows from an algorithm we have developed (Di Stefano & Kong 2003) to identify SSSs in external galaxies, selecting them from among each galaxy s total population of X-ray sources. We have applied the algorithm to approximately one dozen galaxies and will make it public after it has been published in its entirety. Through our own application of the algorithm, we have discovered SSSs in every galaxy, mapping their spatial distribution, to obtain important clues to their fundamental natures. We have discovered that there is a large population of X-ray sources which are slightly hotter (100-250 eV) than standard SSSs. Some of these may be accreting BHs with masses between roughly 50 anf 100 solar masses. To explore this possibility, we are working on theoretical models for the formation and evolution of such systems (Di Stefano 2003).

Oliversen, Ronald J.↗

Extending Classification Algorithms to Case-Control Studies

Classification is a common technique applied to ’omics data to build predictive models and identify potential markers of biomedical outcomes. Despite the prevalence of case-control studies, the number of classification methods available to analyze data generated by such studies is extremely limited. Conditional logistic regression is the most commonly used technique, but the associated modeling assumptions limit its ability to identify a large class of sufficiently complicated ’omic signatures. We propose a data preprocessing step which generalizes and makes any linear or nonlinear classification algorithm, even those typically not appropriate for matched design data, available to be used to model case-control data and identify relevant biomarkers in these study designs. We demonstrate on simulated case-control data that both the classification and variable selection accuracy of each method is improved after applying this processing step and that the proposed methods are comparable to or outperform existing variable selection methods. Finally, we demonstrate the impact of conditional classification algorithms on a large cohort study of children with islet autoimmunity.

59 BASIC BIOLOGICAL SCIENCES↗

SU-E-T-637: Proton Aperture Quality Assurance Using Computed Tomography

Purpose: To develop an automated algorithm for aperture quality assurance for double scattering proton radiotherapy. Methods: Anterior-Posterior scout images were acquired on a CT scanner for five brass apertures (2 large, 3 small) with 120 kVp and 10mA. A semi-automated algorithm was developed for the QA process. The input includes a user selecting the scout image and the associated patient plan, field and aperture size. The program automatically thresholds the scout image. Next, a connectivity algorithm is used to determine the points associated with the central shape to obtain the contour. To compare with the plan contour, the program converts the detected and plan contours into polar coordinates, interpolates the data to a 1 degree spaced grid, and determines the differences in radial distance at each grid point. Results: The mean and maximum difference and the percentage of points with distance differences less than 1.25 mm (due to the divergent cut of the aperture) between the detected and plan field aperture contours were obtained. A repeatability coefficient was derived based on repeated scanning and processing of three of the apertures. The mean difference for five apertures was 0.44 +/−0.08 mm. The maximum difference in distance was 1.2 +/−0.23 mm for all apertures. The Repeatability Coefficient was +/−0.038 mm, indicating the technique is highly repeatable. The mean percent of points with distance less than 1.25 mm was 97.41 +/−0.35%. Conclusion: Automated CT scout image based proton aperture QA is feasible, saves time, and provides a quantitative metric for proton patient specific aperture QA.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Solving the $k$-Sparse Eigenvalue Problem with Reinforcement Learning

We examine the possibility of using a reinforcement learning (RL) algorithm to solve large-scale eigenvalue problems in which the desired the eigenvector can be approximated by a sparse vector with at most k nonzero elements, where k is relatively small compare to the dimension of the matrix to be partially diagonalized. Here, this type of problem arises in applications in which the desired eigenvector exhibits localization properties and in large-scale eigenvalue computations in which the amount of computational resource is limited. When the positions of these nonzero elements can be determined, we can obtain the k-sparse approximation to the original problem by computing eigenvalues of a k × k submatrix extracted from k rows and columns of the original matrix. We review a previously developed greedy algorithm for incrementally probing the positions of the nonzero elements in a k-sparse approximate eigenvector and show that the greedy algorithm can be improved by using an RL method to refine the selection of k rows and columns of the original matrix. We describe how to represent states, actions, rewards and policies in an RL algorithm designed to solve the k-sparse eigenvalue problem and demonstrate the effectiveness of the RL algorithm on two examples originating from quantum many-body physics.

97 MATHEMATICS AND COMPUTING↗

An investigation of messy genetic algorithms

Genetic algorithms (GAs) are search procedures based on the mechanics of natural selection and natural genetics. They combine the use of string codings or artificial chromosomes and populations with the selective and juxtapositional power of reproduction and recombination to motivate a surprisingly powerful search heuristic in many problems. Despite their empirical success, there has been a long standing objection to the use of GAs in arbitrarily difficult problems. A new approach was launched. Results to a 30-bit, order-three-deception problem were obtained using a new type of genetic algorithm called a messy genetic algorithm (mGAs). Messy genetic algorithms combine the use of variable-length strings, a two-phase selection scheme, and messy genetic operators to effect a solution to the fixed-coding problem of standard simple GAs. The results of the study of mGAs in problems with nonuniform subfunction scale and size are presented. The mGA approach is summarized, both its operation and the theory of its use. Experiments on problems of varying scale, varying building-block size, and combined varying scale and size are presented.

Goldberg, David E.↗

Potential of minicomputer/array-processor system for nonlinear finite-element analysis

The potential of using a minicomputer/array-processor system for the efficient solution of large-scale, nonlinear, finite-element problems is studied. A Prime 750 is used as the host computer, and a software simulator residing on the Prime is employed to assess the performance of the Floating Point Systems AP-120B array processor. Major hardware characteristics of the system such as virtual memory and parallel and pipeline processing are reviewed, and the interplay between various hardware components is examined. Effective use of the minicomputer/array-processor system for nonlinear analysis requires the following: (1) proper selection of the computational procedure and the capability to vectorize the numerical algorithms; (2) reduction of input-output operations; and (3) overlapping host and array-processor operations. A detailed discussion is given of techniques to accomplish each of these tasks. Two benchmark problems with 1715 and 3230 degrees of freedom, respectively, are selected to measure the anticipated gain in speed obtained by using the proposed algorithms on the array processor.

Strohkorb, G. A.↗

Absolute magnitude calibration using trigonometric parallax - Incomplete, spectroscopic samples

A new numerical algorithm is used to calibrate the absolute magnitude of spectroscopically selected stars from their observed trigonometric parallax. This procedure, based on maximum-likelihood estimation, can retrieve unbiased estimates of the intrinsic absolute magnitude and its dispersion even from incomplete samples suffering from selection biases in apparent magnitude and color. It can also make full use of low accuracy and negative parallaxes and incorporate censorship on reported parallax values. Accurate error estimates are derived for each of the fitted parameters. The algorithm allows an a posteriori check of whether the fitted model gives a good representation of the observations. The procedure is described in general and applied to both real and simulated data.

Ratnatunga, Kavan U.↗

Using projection operators with maximum overlap methods to simplify challenging self-consistent field optimization

Maximum overlap methods are effective tools for optimizing challenging ground- and excited-state wave functions using self-consistent field models such as Hartree-Fock and Kohn-Sham density functional theory. Nevertheless, such models have shown significant sensitivity to the user-defined initial guess of the target wave function. Here in this work, a projection operator framework is defined and used to provide a metric for non-aufbau orbital selection in maximum-overlap-methods. The resulting algorithms, termed the Projection-based Maximum Overlap Method (PMOM) and Projection-based Initial Maximum Overlap Method (PIMOM), are shown to perform exceptionally well when using simple user-defined target solutions based on occupied/virtual molecular orbital permutations. This work also presents a new metric that provides a simple and conceptually convenient measure of agreement between the desired target and the current or final SCF results during a calculation employing a maximum-overlap method.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗