Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “random search”

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 235 records · Page 13

A Meta-analysis of Randomized Trials Comparing Surgery versus Endovascular Therapy for Thrombosed Arteriovenous Fistulas and Grafts in Hemodialysis

Purpose. To carry out a systematic review of randomized trials comparing surgery vs. endovascular therapy for occluded fistulas and grafts. Methods. All randomized trials which compared surgery and endovascular therapy for occluded fistulas and grafts were retrieved from 1990 onwards. The following search terms were used: 'haemodialysis,' 'thrombosis,' 'arteriovenous fistula,' 'arteriovenous shunt,' 'end stage renal failure' on Medline and PubMed. The results of the pooled data were analysed by a fixed-effect model. Results. There were no randomized trials comparing surgery vs. endovascular therapy for native fistulas and vein grafts. Six randomized studies reporting on 573 occluded grafts were identified. Technical success, need for access line and primary patency at 30 days were similar between the two groups (odds ratio [OR] 1.40, 95 % confidence interval [CI] 0.91-2.14; OR 0.77, 95 % CI 0.44-1.34; and OR 1.15, 95 % CI 0.79-1.68, respectively). There was no significant difference in morbidity at 30 days between groups (OR 1.12, 95 % CI 0.67-1.86). There were no statistical difference between the two groups for 1 year primary patency (OR 2.08, 95 % CI 0.97-4.45). Primary assisted patency at 1 year was better with surgery (OR 3.03, 95 % CI 1.12-8.18) in a single study. Conclusion. Comparable results to surgery have been achieved with endovascular techniques for occluded prosthetic grafts for dialysis access. Long-term data comparing the two groups were lacking. Further trials designed to encompass variation in methods are warranted in order to obtain the best available evidence particularly for native fistulas.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

RAM-Based frame synchronizer

Frame synchronizer for serial telemetry is rapidly reconfigured for changing formats. Synchronizer generates signals marking data-word boundaries, beginning of each frame, and beginning of each paragraph. Also derived are search, check, and lock status signals. Existing unit is assembled from standard random-access memory elements and MOS and low-power-Schottky logic.

Niswander, J. K.↗

A Novel Local Learning based Approach With Application to Breast Cancer Diagnosis

The purpose of this study is to develop and evaluate a novel local learning-based approach for computer-assisted diagnosis of breast cancer. Our new local learning based algorithm using the linear logistic regression method as its base learner is described. Overall, our algorithm will perform its stochastic searching process until the total allowed computing time is used up by our random walk process in identifying the most suitable population subdivision scheme and their corresponding individual base learners. The proposed local learning-based approach was applied for the prediction of breast cancer given 11 mammographic and clinical findings reported by physicians using the BI-RADS lexicon. Our database consisted of 850 patients with biopsy confirmed diagnosis (290 malignant and 560 benign). We also compared the performance of our method with a collection of publicly available state-of-the-art machine learning methods. Predictive performance for all classifiers was evaluated using 10-fold cross validation and Receiver Operating Characteristics (ROC) analysis. Figure 1 reports the performance of 54 machine learning methods implemented in the machine learning toolkit Weka (version 3.0). We introduced a novel local learning-based classifier and compared it with an extensive list of other classifiers for the problem of breast cancer diagnosis. Our experiments show that the algorithm superior prediction performance outperforming a wide range of other well established machine learning techniques. Our conclusion complements the existing understanding in the machine learning field that local learning may capture complicated, non-linear relationships exhibited by real-world datasets.

59 BASIC BIOLOGICAL SCIENCES↗

Lithium-Ion Battery Diagnostics Using Electrochemical Impedance via Machine-Learning

Diagnosing battery states such as health, state-of-charge, or temperature is crucial for ensuring the safety and reliability of electrochemical energy storage systems. While some states, such as temperature, may be measured using cheap sensors, accurate diagnosis of battery health metrics usually requires time-consuming performance measurements, making them infeasible for use in real-world operation. These health metrics can be measured during lab-testing and then estimated on-line using predictive life models or via state observer algorithms such as Kalman filters, but these predictive methods should be supplemented by actual measurement of battery health whenever possible to ensure reliability. Rapid measurement of battery health may be done by various types of fast diagnostic techniques such as electrochemical impedance spectroscopy (EIS), which can be performed in only a few minutes and require only a fraction of the energy and power needed for a full charge and discharge measurement. But there is a substantial challenge for estimating battery health using EIS data, as EIS is sensitive to cell temperature, state-of-charge, current, and resting time in addition to health. Thus, utilizing EIS data to predict battery capacity requires correcting for all these additional variables, a task that is extremely difficult to handle analytically. This talk utilizes machine-learning methods to estimate the effectiveness of battery capacity prediction from EIS data, leveraging a data set of hundreds of EIS measurements recorded at varying temperature and state-of-charge throughout a 500-day aging study of 32 commercial, large-format NMC-Graphite lithium-ion batteries. Using EIS as input to machine-learning models is complicated by the nonlinear response of impedance to battery health, temperature, and state-of-charge, as well as the collinearity between the impedance response at neighboring frequencies, which can easily lead to overfit models. To train robust models, features from EIS data need to be extracted from the data or some subset of critical frequencies selected. Many approaches for extracting and selecting features from EIS data from electrochemical analysis and machine-learning fields were identified for analysis: using the entire raw spectra; selection of one, two, or many frequencies from the entire spectra; selecting interesting points from the EIS measurement using domain knowledge; fitting EIS with an equivalent-circuit model; calculating statistics on the raw impedance values; and reducing the dimensionality of the data using unsupervised linear (principal component analysis) and non-linear (uniform manifold approximation and projection) methods. These approaches were rigorously compared using a machine-learning pipeline approach, training linear, Gaussian process, and random forest regression models and quantifying performance using cross-validation as well as a held-out test set. An artificial neural network model trained on the raw spectra was also tested. Promising pipelines were fine-tuned via Bayesian hyperparameter optimization using cross-validation loss and training with class-specific weights to counter data set imbalance. The most reliable method for utilizing impedance in this work was the selection of two optimal frequencies through an exhaustive search, resulting in about 2% mean absolute error on test data for both Gaussian process and random forest model architectures. Interrogation of a variety of models reveals critical frequencies of 100 Hz and 103 Hz for this data set, though the optimal set of frequencies is not necessarily intuitive, i.e., the best performing models are not simply those that use impedance at frequencies that have the highest correlation to the relative discharge capacity. The best performing model is an ensemble model, which is able to predict battery capacity with 1.9% mean absolute error for unseen cells using impedance recorded at a variety of temperatures and states-of-charge.

battery↗

Searching for patterns in remote sensing image databases using neural networks

We have investigated a method, based on a successful neural network multispectral image classification system, of searching for single patterns in remote sensing databases. While defining the pattern to search for and the feature to be used for that search (spectral, spatial, temporal, etc.) is challenging, a more difficult task is selecting competing patterns to train against the desired pattern. Schemes for competing pattern selection, including random selection and human interpreted selection, are discussed in the context of an example detection of dense urban areas in Landsat Thematic Mapper imagery. When applying the search to multiple images, a simple normalization method can alleviate the problem of inconsistent image calibration. Another potential problem, that of highly compressed data, was found to have a minimal effect on the ability to detect the desired pattern. The neural network algorithm has been implemented using the PVM (Parallel Virtual Machine) library and nearly-optimal speedups have been obtained that help alleviate the long process of searching through imagery.

Paola, Justin D.↗

Broadcasting satellite service synthesis using gradient and cyclic coordinate search procedures

Two search techniques are considered for solving satellite synthesis problems. Neither is likely to find a globally optimal solution. In order to determine which method performs better and what factors affect their performance, an experiment is designed and the same problem is solved under a variety of starting solution configuration-algorithm combinations. Since there is no randomization in the experiment, results of practical, rather than statistical, significance are presented. Implementation of a cyclic coordinate search procedure clearly finds better synthesis solutions than implementation of a gradient search procedure does with the objective of maximizing the minimum C/I ratio computed at test points on the perimeters of the intended service areas. The length of the available orbital arc and the configuration of the starting solution are shown to affect the quality of the solutions found.

Reilly, C. H.↗

Enhanced Approximate Nearest Neighbor via Local Area Focused Search.

Approximate Nearest Neighbor (ANN) algorithms are increasingly important in machine learning, data mining, and image processing applications. There is a large family of space- partitioning ANN algorithms, such as randomized KD-Trees, that work well in practice but are limited by an exponential increase in similarity comparisons required to optimize recall. Additionally, they only support a small set of similarity metrics. We present Local Area Fo- cused Search (LAFS), a method that enhances the way queries are performed using an existing ANN index. Instead of a single query, LAFS performs a number of smaller (fewer similarity comparisons) queries and focuses on a local neighborhood which is refined as candidates are identified. We show that our technique improves performance on several well known datasets and is easily extended to general similarity metrics using kernel projection techniques.

97 MATHEMATICS AND COMPUTING↗

Evaluation of Biologic Effective Dose and Schedule of Fractionation for Preoperative Radiotherapy for Rectal Cancer: Meta-Analyses and Meta-Regression;Rectal cancer; Preoperative radiotherapy; Biologic effective dose; Meta-analysis

Purpose: To evaluate whether the risk of local recurrence depends on the biologic effective dose (BED) or fractionation dose in patients with resectable rectal cancer undergoing preoperative radiotherapy (RT) compared with surgery alone. Methods and Materials: A meta-analysis of randomized controlled trials (RCTs) was performed. The MEDLINE, Embase, CancerLit, and Cochrane Library databases were systematically searched for evidence. To evaluate the dose-response relationship, we conducted a meta-regression analysis. Four subgroups were created: Group 1, RCTs with a BED >30 Gy{sub 10} and a short RT schedule; Group 2, RCTs with BED >30 Gy{sub 10} and a long RT schedule; Group 3, RCTs with BED {<=}30 Gy{sub 10} and a short RT schedule; and Group 4, RCTs with BED {<=}30 Gy{sub 10} and a long RT schedule. Results: Our review identified 21 RCTs, yielding 9,097 patients. The pooled results from these 21 randomized trials of preoperative RT showed a significant reduction in mortality for groups 1 (p = .004) and 2 (p = .03). For local recurrence, the results were also significant in groups 1 (p = .00001) and 2 (p = .00001).The only subgroup that showed a greater sphincter preservation (SP) rate than surgery was group 2 (p = .03). The dose-response curve was linear (p = .006), and RT decreased the risk of local recurrence by about 1.7% for each Gy{sub 10} of BED. Conclusion: Our data have shown that RT with a BED of >30 Gy{sub 10} is more efficient in reducing local recurrence and mortality rates than a BED of {<=}30 Gy{sub 10}, independent of the schedule of fractionation used. A long RT schedule with a BED of >30 Gy{sub 10} should be recommended for sphincter preservation.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Radiotherapy Technical Considerations in the Management of Locally Advanced Pancreatic Cancer: American-French Consensus Recommendations

Summary: Pancreatic carcinoma is a leading cause of cancer-related mortality. Approximately 30% of pancreatic cancer patients present with locally advanced, unresectable nonmetastatic disease. For these patients, two therapeutic options exist: systemic chemotherapy or chemoradiotherapy. Within this context, the optimal technique for pancreatic irradiation is not clearly defined. A search to identify relevant studies was undertaken using the Medline database. All Phase III randomized trials evaluating the modalities of radiotherapy in locally advanced pancreatic cancer were included, as were some noncontrolled Phase II and retrospective studies. An expert panel convened with members of the Radiation Therapy Oncology Group and GERCOR cooperative groups to review identified studies and prepare the guidelines. Each member of the working group independently evaluated five endpoints: total dose, target volume definition, radiotherapy planning technique, dose constraints to organs at risk, and quality assurance. Based on this analysis of the literature, we recommend either three-dimensional conformal radiation therapy or intensity-modulated radiation therapy to a total dose of 50 to 54 Gy at 1.8 to 2 Gy per fraction. We propose gross tumor volume identification to be followed by an expansion of 1.5 to 2 cm anteriorly, posteriorly, and laterally, and 2 to 3 cm craniocaudally to generate the planning target volume. The craniocaudal margins can be reduced with the use of respiratory gating. Organs at risk are liver, kidneys, spinal cord, stomach, and small bowel. Stereotactic body radiation therapy should not be used for pancreatic cancer outside of clinical trials. Radiotherapy quality assurance is mandatory in clinical trials. These consensus recommendations are proposed for use in the development of future trials testing new chemotherapy combinations with radiotherapy. Not all of these recommendations will be appropriate for trials testing radiotherapy dose or dose intensity concepts.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Breaking adsorption-energy scaling limitations of electrocatalytic nitrate reduction on intermetallic CuPd nanocubes by machine-learned insights

The electrochemical nitrate reduction reaction (NO 3 RR) to ammonia is an essential step toward restoring the globally disrupted nitrogen cycle. In search of highly efficient electrocatalysts, tailoring catalytic sites with ligand and strain effects in random alloys is a common approach but remains limited due to the ubiquitous energy-scaling relations. With interpretable machine learning, we unravel a mechanism of breaking adsorption-energy scaling relations through the site-specific Pauli repulsion interactions of the metal d-states with adsorbate frontier orbitals. The non-scaling behavior can be realized on (100)-type sites of ordered B2 intermetallics, in which the orbital overlap between the hollow *N and subsurface metal atoms is significant while the bridge-bidentate *NO 3 is not directly affected. Among those intermetallics predicted, we synthesize monodisperse ordered B2 CuPd nanocubes that demonstrate high performance for NO 3 RR to ammonia with a Faradaic efficiency of 92.5% at –0.5 V RHE and a yield rate of 6.25 mol h –1 g –1 at –0.6 V RHE . This study provides machine-learned design rules besides the d-band center metrics, paving the path toward data-driven discovery of catalytic materials beyond linear scaling limitations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A simple attitude data filter for three-axis attitude initialization for autonomous ascent of Shuttle-launched spacecraft

A method for accurately initializing spacecraft attitude after release from the Orbiter is described. It is noted that the method is suitable for an autonomous ascent to mission orbit. Test results are given from a FORTRAN simulation of the estimation algorithm using measurement data from a detailed spacecraft dynamics simulation program. The technique here is orbital yaw-gyrocompassing. Attitude is estimated through a Kalman filter, using pitch and roll measurements from an earth sensor, while gyro data provide the system dynamics information. In the tests described, gyro and earth sensor data are generated by an existing control system simulation of earth-search and yaw-gyrocompassing attitude dynamics; they include realistic errors such as delays, random noise and quantization effects. The estimated attitude history is compared with the true attitude history from the simulation program to assess the accuracy and convergence of the filter in the presence of noisy measurements and disturbances, including thruster firings for momentum control. It is noted that since the earth sensor provides direct measurements of pitch and roll, the main criterion of filter performance is yaw accuracy.

Joshi, R. T.↗

Broadcasting satellite service synthesis using gradient and cyclic coordinate search procedures

Two search techniques are considered for solving satellite synthesis problems. Neither is likely to find a globally optimal solution. In order to determine which method performs better and what factors affect their performance, we design an experiment and solve the same problem under a variety of starting solution configuration-algorithm combinations. Since there is no randomization in the experiment, we present results of practical, rather than statistical, significance. Our implementation of a cyclic coordinate search procedure clearly finds better synthesis solutions than our implementation of a gradient search procedure does with our objective of maximizing the minimum C/I ratio computed at test points on the perimeters of the intended service areas. The length of the available orbital arc and the configuration of the starting solution are shown to affect the quality of the solutions found.

Reilly, C. H.↗

Recursive Branching Simulated Annealing Algorithm

This innovation is a variation of a simulated-annealing optimization algorithm that uses a recursive-branching structure to parallelize the search of a parameter space for the globally optimal solution to an objective. The algorithm has been demonstrated to be more effective at searching a parameter space than traditional simulated-annealing methods for a particular problem of interest, and it can readily be applied to a wide variety of optimization problems, including those with a parameter space having both discrete-value parameters (combinatorial) and continuous-variable parameters. It can take the place of a conventional simulated- annealing, Monte-Carlo, or random- walk algorithm. In a conventional simulated-annealing (SA) algorithm, a starting configuration is randomly selected within the parameter space. The algorithm randomly selects another configuration from the parameter space and evaluates the objective function for that configuration. If the objective function value is better than the previous value, the new configuration is adopted as the new point of interest in the parameter space. If the objective function value is worse than the previous value, the new configuration may be adopted, with a probability determined by a temperature parameter, used in analogy to annealing in metals. As the optimization continues, the region of the parameter space from which new configurations can be selected shrinks, and in conjunction with lowering the annealing temperature (and thus lowering the probability for adopting configurations in parameter space with worse objective functions), the algorithm can converge on the globally optimal configuration. The Recursive Branching Simulated Annealing (RBSA) algorithm shares some features with the SA algorithm, notably including the basic principles that a starting configuration is randomly selected from within the parameter space, the algorithm tests other configurations with the goal of finding the globally optimal solution, and the region from which new configurations can be selected shrinks as the search continues. The key difference between these algorithms is that in the SA algorithm, a single path, or trajectory, is taken in parameter space, from the starting point to the globally optimal solution, while in the RBSA algorithm, many trajectories are taken; by exploring multiple regions of the parameter space simultaneously, the algorithm has been shown to converge on the globally optimal solution about an order of magnitude faster than when using conventional algorithms. Novel features of the RBSA algorithm include: 1. More efficient searching of the parameter space due to the branching structure, in which multiple random configurations are generated and multiple promising regions of the parameter space are explored; 2. The implementation of a trust region for each parameter in the parameter space, which provides a natural way of enforcing upper- and lower-bound constraints on the parameters; and 3. The optional use of a constrained gradient- search optimization, performed on the continuous variables around each branch s configuration in parameter space to improve search efficiency by allowing for fast fine-tuning of the continuous variables within the trust region at that configuration point.

Bolcar, Matthew↗

Quantum search algorithms on a regular lattice

Quantum algorithms for searching for one or more marked items on a d-dimensional lattice provide an extension of Grover's search algorithm including a spatial component. We demonstrate that these lattice search algorithms can be viewed in terms of the level dynamics near an avoided crossing of a one-parameter family of quantum random walks. We give approximations for both the level splitting at the avoided crossing and the effectively two-dimensional subspace of the full Hilbert space spanning the level crossing. This makes it possible to give the leading order behavior for the search time and the localization probability in the limit of large lattice size including the leading order coefficients. For d=2 and d=3, these coefficients are calculated explicitly. Closed form expressions are given for higher dimensions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Exponential vanishing of the ground-state gap of the quantum random energy model via adiabatic quantum computing

In this note, we use ideas of Farhi et al. [Int. J. Quantum. Inf. 6, 503 (2008) and Quantum Inf. Comput. 11, 840 (2011)] who link a lower bound on the run time of their quantum adiabatic search algorithm to an upper bound on the energy gap above the ground-state of the generators of this algorithm. We apply these ideas to the quantum random energy model (QREM). Our main result is a simple proof of the conjectured exponential vanishing of the energy gap of the QREM.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Strength can be controlled by edge dislocations in refractory high-entropy alloys

Energy efficiency is motivating the search for new high-temperature (high-T) metals. Some new body-centered-cubic (BCC) random multicomponent “high-entropy alloys (HEAs)” based on refractory elements (Cr-Mo-Nb-Ta-V-W-Hf-Ti-Zr) possess exceptional strengths at high temperatures but the physical origins of this outstanding behavior are not known. Here we show, using integrated in-situ neutron-diffraction (ND), high-resolution transmission electron microscopy (HRTEM), and recent theory, that the high strength and strength retention of a NbTaTiV alloy and a high-strength/low-density CrMoNbV alloy are attributable to edge dislocations. This finding is surprising because plastic flows in BCC elemental metals and dilute alloys are generally controlled by screw dislocations. We use the insight and theory to perform a computationally-guided search over 10 7 BCC HEAs and identify over 10 6 possible ultra-strong high-T alloy compositions for future exploration.

36 MATERIALS SCIENCE↗

Using LDPC Code Constraints to Aid Recovery of Symbol Timing

A method of utilizing information available in the constraints imposed by a low-density parity-check (LDPC) code has been proposed as a means of aiding the recovery of symbol timing in the reception of a binary-phase-shift-keying (BPSK) signal representing such a code in the presence of noise, timing error, and/or Doppler shift between the transmitter and the receiver. This method and the receiver architecture in which it would be implemented belong to a class of timing-recovery methods and corresponding receiver architectures characterized as pilotless in that they do not require transmission and reception of pilot signals. Acquisition and tracking of a signal of the type described above have traditionally been performed upstream of, and independently of, decoding and have typically involved utilization of a phase-locked loop (PLL). However, the LDPC decoding process, which is iterative, provides information that can be fed back to the timing-recovery receiver circuits to improve performance significantly over that attainable in the absence of such feedback. Prior methods of coupling LDPC decoding with timing recovery had focused on the use of output code words produced as the iterations progress. In contrast, in the present method, one exploits the information available from the metrics computed for the constraint nodes of an LDPC code during the decoding process. In addition, the method involves the use of a waveform model that captures, better than do the waveform models of the prior methods, distortions introduced by receiver timing errors and transmitter/ receiver motions. An LDPC code is commonly represented by use of a bipartite graph containing two sets of nodes. In the graph corresponding to an (n,k) code, the n variable nodes correspond to the code word symbols and the n-k constraint nodes represent the constraints that the code places on the variable nodes in order for them to form a valid code word. The decoding procedure involves iterative computation of values associated with these nodes. A constraint node represents a parity-check equation using a set of variable nodes as inputs. A valid decoded code word is obtained if all parity-check equations are satisfied. After each iteration, the metrics associated with each constraint node can be evaluated to determine the status of the associated parity check. Heretofore, normally, these metrics would be utilized only within the LDPC decoding process to assess whether or not variable nodes had converged to a codeword. In the present method, it is recognized that these metrics can be used to determine accuracy of the timing estimates used in acquiring the sampled data that constitute the input to the LDPC decoder. In fact, the number of constraints that are satisfied exhibits a peak near the optimal timing estimate. Coarse timing estimation (or first-stage estimation as described below) is found via a parametric search for this peak. The present method calls for a two-stage receiver architecture illustrated in the figure. The first stage would correct large time delays and frequency offsets; the second stage would track random walks and correct residual time and frequency offsets. In the first stage, constraint-node feedback from the LDPC decoder would be employed in a search algorithm in which the searches would be performed in successively narrower windows to find the correct time delay and/or frequency offset. The second stage would include a conventional first-order PLL with a decision-aided timing-error detector that would utilize, as its decision aid, decoded symbols from the LDPC decoder. The method has been tested by means of computational simulations in cases involving various timing and frequency errors. The results of the simulations ined in the ideal case of perfect timing in the receiver.

Jones, Christopher↗

X-ray and γ-ray beam interstellar communication and implications for SETI

The possibility of detecting artificial signals transmitted by alien civilizations via collimated X-ray or gamma-ray beams is investigated. The prospect of using such beams for human communication within the solar system and beyond is also discussed. Detector responses were simulated for input signals and analyzed using relative entropy. For simplicity, all signals were assumed to use on-off keying (OOK) modulation. “Real” signals were generated by taking digital files and sequentially feeding their raw binary data to the detector simulator, the resulting normalized information content of the detector signals was plotted and compared to random noise signals. Since jpeg files contain compressed information, these served as a proxy for artificial alien signals. This showed that there is a clear difference in measured information content between natural and artificial signals, even with relatively poor time resolution in the detector causing the signals to be smeared (dead-time/rise-time intervals many times longer than the duration between signal pulses). It was found that so long as the signal lasts for at least several rise-time/dead-time intervals, the distinction between random and artificial signals is obvious. A space-telescope with high time resolution for searching for such signals is briefly described and its basic requirements are outlined.

43 PARTICLE ACCELERATORS↗