Genetic Algorithm for Innovative Device Designs in High-Efficiency III–V Nitride Light-Emitting Diodes
Explore the source record for details and available documents.
SEARCH · Engineering Papers
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.
Explore the source record for details and available documents.
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.
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.
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.
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.
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.
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.
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.
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.
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.
Soil stabilization is crucial in geotechnical engineering, yet conventional methods are often time-consuming, resource-intensive, and environmentally unsustainable. Despite growing interest in Machine Learning (ML) and optimization tools for mix design, few studies integrate these methods with decision-making techniques and environmental assessment to support practical implementation. This study proposes a hybrid data-driven framework for predicting strength, optimizing mix compositions, and evaluating environmental impacts via life cycle assessment of cement-stabilized soft soils. Six ML models were evaluated, and the top-performing eXtreme Gradient Boosting (XGB) model was further improved using the Grey Wolf Optimizer (GWO). The optimized XGB-GWO model, integrated with a polynomial cost function, served as the objective function in a multi-objective optimization problem solved via the Non-Dominated Sorting Genetic Algorithm II (NSGA-II), with final mix selection guided by the entropy-weighted TOPSIS method. Validation through a case study produced mix designs offering superior strength-cost trade-offs, with the optimal mix achieving 2243.2 kPa unconfined compressive strength and a 16.07 % reduction in carbon emissions compared to the highest-cost design. In conclusion, this study offers a sustainable, scalable approach to soil stabilization and supports informed decision-making in construction.
Krylov subspace recycling is a powerful tool when solving a long series of large, sparse linear systems that change only slowly over time. In PDE constrained shape optimization, these series appear naturally, as typically hundreds or thousands of optimization steps are needed with only small changes in the geometry. In this setting, however, applying Krylov subspace recycling can be a difficult task. As the geometry evolves, in general, so does the finite element mesh defined on or representing this geometry, including the numbers of nodes and elements and element connectivity. This is especially the case if re-meshing techniques are used. As a result, the number of algebraic degrees of freedom in the system changes, and in general the linear system matrices resulting from the finite element discretization change size from one optimization step to the next. Changes in the mesh connectivity also lead to structural changes in the matrices. In the case of re-meshing, even if the geometry changes only a little, the corresponding mesh might differ substantially from the previous one. Obviously, this prevents any straightforward mapping of the approximate invariant subspace of the linear system matrix (the focus of recycling in this work) from one optimization step to the next; similar problems arise for other selected subspaces. In this paper, we present an algorithm to map an approximate invariant subspace of the linear system matrix for the previous optimization step to an approximate invariant subspace of the linear system matrix for the current optimization step, for general meshes. This is achieved by exploiting the map from coefficient vectors to finite element functions on the mesh, combined with interpolation or approximation of functions on the finite element mesh. We demonstrate the effectiveness of our approach numerically with several proof of concept studies for a specific meshing technique.
Dosimetric comparison of manual beam angle selection (MBS) and beam angle optimization (BAO) for IMRT plans is investigated retrospectively for 15 head and neck and prostate patients. The head and neck and prostate had planning target volumes (PTVs) ranging between 96.0 and 319.9 cm{sup 3} and 153.6 and 321.3 cm{sup 3}, whereas OAR ranged between 8.3 and 47.8 cm{sup 3} and 68.3 and 469.2 cm{sup 3}, respectively. In MBS, a standard coplanar 7-9 fields equally spaced gantry angles were used. In BAO, the selection of gantry angle was optimized by the algorithm for the same number of beams. The optimization and dose-volume constraints were kept the same for both techniques. Treatment planning was performed on the Eclipse treatment planning system. Our results showed that the dose-volume histogram for PTV are nearly identical in both techniques but BAO provided superior sparing of the organs at risk compared with the MBS. Also, MBS produced statistically significant higher monitor units (MU) and segments than the BAO; 13.1 {+-} 6.6% (p = 0.012) and 10.4 {+-} 13.6% (p = 0.140), and 14.6 {+-} 5.6% (p = 1.003E-5) and 12.6 {+-} 7.4% (p = 0.76E-3) for head and neck and prostate cases, respectively. The reduction in MU translates into the reduction in total body and integral dose. It is concluded that BAO provides advantage over MBS for most intenisty-modulated radiation therapy cases.
Application of simulated annealing (SA) and simplified GSA (SGSA) techniques for parameter optimization of parametric quantum chemistry method (CATIVIC) was performed. A set of organic molecules were selected for test these techniques. Comparison of the algorithms was carried out for error function minimization with respect to experimental values. Results show that SGSA is more efficient than SA with respect to computer time. Accuracy is similar in both methods; however, there are important differences in the final set of parameters.
Typical approaches for predicting transcription factor binding sites (TFBSs) involve use of a position-specific weight matrix (PWM) to statistically characterize the sequences of the known sites. Recently, an alternative physicochemical approach, called SiteSleuth, was proposed. In this approach, a linear support vector machine (SVM) classifier is trained to distinguish TFBSs from background sequences based on local chemical and structural features of DNA. SiteSleuth appears to generally perform better than PWM-based methods. Here, we improve the SiteSleuth approach by considering both new physicochemical features and algorithmic modifications. New features are derived from Gibbs energies of amino acid–DNA interactions and hydroxyl radical cleavage profiles of DNA. Algorithmic modifications consist of inclusion of a feature selection step, use of a nonlinear kernel in the SVM classifier, and use of a consensus-based post-processing step for predictions. We also considered SVM classification based on letter features alone to distinguish performance gains from use of SVM-based models versus use of physicochemical features. The accuracy of each of the variant methods considered was assessed by cross validation using data available in the RegulonDB database for 54 Escherichia coli TFs, as well as by experimental validation using published ChIP-chip data available for Fis and Lrp.
Measurements of the substructure of top-quark jets are presented, using 140 fb -1 of 13 TeV pp collision data recorded with the ATLAS detector at the LHC. Top-quark jets reconstructed with the anti-k t algorithm with a radius parameter R = 1.0 are selected in top-quark pair ($t\overline{t}$) events where one top quark decays semileptonically and the other hadronically, or where both top quarks decay hadronically. The top-quark jets are required to have transverse momentum p T > 350 GeV, yielding large samples of data events with jet p T values between 350 and 600 GeV. One- and two-dimensional differential cross sections for eight substructure variables, defined using only the charged components of the jets, are measured in a particle-level phase space by correcting for the smearing and acceptance effects induced by the detector. The differential cross sections are compared with the predictions of several Monte Carlo simulations in which top-quark pair-production quantum chromodynamic matrix-element calculations at next-to-leading-order precision in the strong coupling constant α S are passed to leading-order parton shower and hadronization generators. The Monte Carlo predictions for measures of the broadness, and also the two-body structure, of the top-quark jets are found to be in good agreement with the measurements, while variables sensitive to the three-body structure of the top-quark jets exhibit some tension with the measured distributions.
Application scientists often employ feature tracking algorithms to capture the temporal evolution of various features in their simulation data. However, as the complexity of the scientific features is increasing with the advanced simulation modeling techniques, quantification of reliability of the feature tracking algorithms is becoming important. One of the desired requirements for any robust feature tracking algorithm is to estimate its confidence during each tracking step so that the results obtained can be interpreted without any ambiguity. To address this, we develop a confidence-guided feature tracking algorithm that allows reliable tracking of user-selected features and presents the tracking dynamics using a graph-based visualization along with the spatial visualization of the tracked feature. Here, the efficacy of the proposed method is demonstrated by applying it to two scientific datasets containing different types of time-varying features.
This paper describes modifications to the filter bank multicarrier spread spectrum (FB-MC-SS) system, that was presented in [1] and [2], to enable transmission of this waveform in the HF skywave channel. FB-MC-SS is well suited for the HF channel because it performs well in channels with frequency selective fading and interference. This paper describes new algorithms for packet detection, timing recovery and equalization that are suitable for the HF channel. Also, an algorithm for optimizing the peak to average power ratio (PAPR) of the FBMC- SS waveform is presented. Application of this algorithm results in a waveform with low PAPR. Simulation results using a wide band HF channel model demonstrate the robustness of this system over a wide range of delay and Doppler spreads.