Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Maximal Independent Set”

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 55 records · Page 3

Observations of reduced ozone concentrations in the tropical stratosphere after the eruption of Mt. Pinatubo

Two independent sets of data, one of aerosols from an airborne lidar system, and one of ozone from ozonesonde measurements indicate that significant ozone decreases may have happened as a result of the injection of debris by the Mt. Pinatubo volcano in June 1991. The amount of this reduction maximizes at 24-25 km, near the peak of the aerosol distribution, though a deficit is seen throughout the lower stratosphere between 19 and 28 km. The greatest differences observed prior and subsequent to the eruptions at these altitudes is 18-20 percent.

Grant, W. B.↗

Search for a heavy Higgs boson decaying into two lighter Higgs bosons in the ττbb final state at 13 TeV

A search for a heavy Higgs boson H decaying into the observed Higgs boson h with a mass of 125 GeV and another Higgs boson hS is presented. The h and hS bosons are required to decay into a pair of tau leptons and a pair of b quarks, respectively. The search uses a sample of proton-proton collisions collected with the CMS detector at a center-of-mass energy of 13 TeV, corresponding to an integrated luminosity of 137 fb -1 . Mass ranges of 240–3000 GeV for m H and 60–2800 GeV for m h S are explored in the search. No signal has been observed. Model independent 95% confidence level upper limits on the product of the production cross section and the branching fractions of the signal process are set with a sensitivity ranging from 125 fb (for m H = 240 GeV) to 2.7 fb (for m H = 1000 GeV). These limits are compared to maximally allowed products of the production cross section and the branching fractions of the signal process in the next-to-minimal supersymmetric extension of the standard model.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

The structural information filtered features (SIFF) potential: Maximizing information stored in machine-learning descriptors for materials prediction

Machine learning inspired potentials continue to improve the ability for predicting structures of materials. However, many challenges still exist, particularly when calculating structures of disordered systems. These challenges are primarily due to the rapidly increasing dimensionality of the feature-vector space which in most machine-learning algorithms is dependent on the size of the structure. In this article, we present a feature-engineered approach that establishes a set of principles for representing potentials of physical structures (crystals, molecules, and clusters) in a feature space rather than a physically motivated space. Our goal in this work is to define guiding principles that optimize information storage of the physical parameters within the feature representations. In this manner, we focus on keeping the dimensionality of the feature space independent of the number of atoms in the structure. Our Structural Information Filtered Features (SIFF) potential represents structures by utilizing a feature vector of low-correlated descriptors, which correspondingly maximizes information within the descriptor. We present results of our SIFF potential on datasets composed of disordered (carbon and carbon–oxygen) clusters, molecules with C 7 O 2 H 2 stoichiometry in the GDB9-14B dataset, and crystal structures of the form (Al x Ga y In z ) 2 O 3 as proposed in the NOMAD Kaggle competition. Our potential's performance is at least comparable, sometimes significantly more accurate, and often more efficient than other well-known machine-learning potentials for structure prediction. However, primarily, we offer a different perspective on how researchers should consider opportunities in maximizing information storage for features.

36 MATERIALS SCIENCE↗

Search for dark matter particles produced in association with a Higgs boson in proton-proton collisions at $\sqrt{\mathrm{s}}$ = 13 TeV

A search for dark matter (DM) particles is performed using events with a Higgs boson candidate and large missing transverse momentum. The analysis is based on proton-proton collision data at a center-of-mass energy of 13 TeV collected by the CMS experiment at the LHC in 2016, corresponding to an integrated luminosity of 35.9 fb$^{-1}$. The search is performed in five Higgs boson decay channels: h$ \to \mathrm{b\bar{b}}$, $\gamma\gamma$, $\tau^{+}\tau^{-}$, W$^{+}$W$^{-}$, and ZZ and the results from the individual channels are combined to maximize the sensitivity of the analysis. No significant excess over the expected standard model background is observed in any of the five channels or in their combination. Limits are set on DM production in the context of two simplified models. The results are also interpreted in terms of a spin-independent DM-nucleon scattering cross section and compared to those from direct-detection DM experiments. This is the first search for DM particles produced in association with a Higgs boson decaying to a pair of W or Z bosons, and the first statistical combination based on five Higgs boson decay channels.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

The neurobench framework for benchmarking neuromorphic computing algorithms and systems

Neuromorphic computing shows promise for advancing computing efficiency and capabilities of AI applications using brain-inspired principles. However, the neuromorphic research field currently lacks standardized benchmarks, making it difficult to accurately measure technological advancements, compare performance with conventional methods, and identify promising future research directions. This article presents NeuroBench, a benchmark framework for neuromorphic algorithms and systems, which is collaboratively designed from an open community of researchers across industry and academia. NeuroBench introduces a common set of tools and systematic methodology for inclusive benchmark measurement, delivering an objective reference framework for quantifying neuromorphic approaches in both hardware-independent and hardware-dependent settings. For latest project updates, visit the project website (neurobench.ai).

Yik, Jason [Harvard Univ., Cambridge, MA (United S↗

Progress in Grid Generation: From Chimera to DRAGON Grids

Hybrid grids, composed of structured and unstructured grids, combines the best features of both. The chimera method is a major stepstone toward a hybrid grid from which the present approach is evolved. The chimera grid composes a set of overlapped structured grids which are independently generated and body-fitted, yielding a high quality grid readily accessible for efficient solution schemes. The chimera method has been shown to be efficient to generate a grid about complex geometries and has been demonstrated to deliver accurate aerodynamic prediction of complex flows. While its geometrical flexibility is attractive, interpolation of data in the overlapped regions - which in today's practice in 3D is done in a nonconservative fashion, is not. In the present paper we propose a hybrid grid scheme that maximizes the advantages of the chimera scheme and adapts the strengths of the unstructured grid while at the same time keeps its weaknesses minimal. Like the chimera method, we first divide up the physical domain by a set of structured body-fitted grids which are separately generated and overlaid throughout a complex configuration. To eliminate any pure data manipulation which does not necessarily follow governing equations, we use non-structured grids only to directly replace the region of the arbitrarily overlapped grids. This new adaptation to the chimera thinking is coined the DRAGON grid. The nonstructured grid region sandwiched between the structured grids is limited in size, resulting in only a small increase in memory and computational effort. The DRAGON method has three important advantages: (1) preserving strengths of the chimera grid; (2) eliminating difficulties sometimes encountered in the chimera scheme, such as the orphan points and bad quality of interpolation stencils; and (3) making grid communication in a fully conservative and consistent manner insofar as the governing equations are concerned. To demonstrate its use, the governing equations are discretized using the newly proposed flux scheme, AUSM+, which will be briefly described herein. Numerical tests on representative 2D inviscid flows are given for demonstration. Finally, extension to 3D is underway, only paced by the availability of the 3D unstructured grid generator.

Liou, Meng-Sing↗

Optimized velocity distributions for direct dark matter detection

We present a method to calculate, without making assumptions about the local dark matter velocity distribution, the maximal and minimal number of signal events in a direct detection experiment given a set of constraints from other direct detection experiments and/or neutrino telescopes. The method also allows to determine the velocity distribution that optimizes the signal rates. We illustrate our method with three concrete applications: i) to derive a halo-independent upper limit on the cross section from a set of null results, ii) to confront in a halo-independent way a detection claim to a set of null results and iii) to assess, in a halo-independent manner, the prospects for detection in a future experiment given a set of current null results.

79 ASTRONOMY AND ASTROPHYSICS↗

Dynamically Reconfigurable Data Readout of Pixel Detectors for Automatic Synchronization with Data Acquisition Systems

Reconfigurable detectors with dynamically selectable sensing and readout modes are highly desirable for implementing edge computing as well as enabling advanced imaging techniques such as foveation. The concept of a camera system capable of simultaneous passive imaging and dynamic ranging in different regions of the detector is presented. Such an adaptive-autonomous detector with both spatial and temporal control requires programmable window of exposure (time frames), ability to switch between readout modes such as full-frame imaging and zero-suppressed data, modification of the number of pixel data bits and independent programmability for distinct detector regions. In this work, a method is presented for seamlessly changing time frames and readout modes without data corruption while still ensuring that the data acquisition system (DAQ) does not need to stop and resynchronize at each change of setting, thus avoiding significant dead time. Data throughput is maximized by using a minimum unique data format, rather than lengthy frame headers, to differentiate between consecutive frames. A data control and transmitter (DCT) synchronizes data transfer from the pixel to the periphery, reconfigures the data to transmit it serially off-chip, while providing optimized decision support based on a DAQ definable mode. Measurements on a test structure demonstrate that the DCT can operate at 1 GHz in a 65 nm LP CMOS process.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Theory of optimal weighting of data to detect climatic change

A search for climatic change predicted by climate models can easily yield unconvincing results because of 'climatic noise,' the inherent, unpredictable variability of time-average atmospheric data. A weighted average of data that maximizes the probability of detecting predicted climatic change is presented. To obtain the optimal weights, an estimate of the covariance matrix of the data from a prior data set is needed. This introduces additional sampling error into the method. This is presently taken into account. A form of the weighted average is found whose probability distribution is independent of the true (but unknown) covariance statistics of the data and of the climate model prediction.

Bell, T. L.↗

Steps Toward Optimal Competitive Scheduling

This paper is concerned with the problem of allocating a unit capacity resource to multiple users within a pre-defined time period. The resource is indivisible, so that at most one user can use it at each time instance. However, different users may use it at different times. The users have independent, se@sh preferences for when and for how long they are allocated this resource. Thus, they value different resource access durations differently, and they value different time slots differently. We seek an optimal allocation schedule for this resource. This problem arises in many institutional settings where, e.g., different departments, agencies, or personal, compete for a single resource. We are particularly motivated by the problem of scheduling NASA's Deep Space Satellite Network (DSN) among different users within NASA. Access to DSN is needed for transmitting data from various space missions to Earth. Each mission has different needs for DSN time, depending on satellite and planetary orbits. Typically, the DSN is over-subscribed, in that not all missions will be allocated as much time as they want. This leads to various inefficiencies - missions spend much time and resource lobbying for their time, often exaggerating their needs. NASA, on the other hand, would like to make optimal use of this resource, ensuring that the good for NASA is maximized. This raises the thorny problem of how to measure the utility to NASA of each allocation. In the typical case, it is difficult for the central agency, NASA in our case, to assess the value of each interval to each user - this is really only known to the users who understand their needs. Thus, our problem is more precisely formulated as follows: find an allocation schedule for the resource that maximizes the sum of users preferences, when the preference values are private information of the users. We bypass this problem by making the assumptions that one can assign money to customers. This assumption is reasonable; a committee is usually in charge of deciding the priority of each mission competing for access to the DSN within a time period while scheduling. Instead, we can assume that the committee assigns a budget to each mission.This paper is concerned with the problem of allocating a unit capacity resource to multiple users within a pre-defined time period. The resource is indivisible, so that at most one user can use it at each time instance. However, different users may use it at different times. The users have independent, se@sh preferences for when and for how long they are allocated this resource. Thus, they value different resource access durations differently, and they value different time slots differently. We seek an optimal allocation schedule for this resource. This problem arises in many institutional settings where, e.g., different departments, agencies, or personal, compete for a single resource. We are particularly motivated by the problem of scheduling NASA's Deep Space Satellite Network (DSN) among different users within NASA. Access to DSN is needed for transmitting data from various space missions to Earth. Each mission has different needs for DSN time, depending on satellite and planetary orbits. Typically, the DSN is over-subscribed, in that not all missions will be allocated as much time as they want. This leads to various inefficiencies - missions spend much time and resource lobbying for their time, often exaggerating their needs. NASA, on the other hand, would like to make optimal use of this resource, ensuring that the good for NASA is maximized. This raises the thorny problem of how to measure the utility to NASA of each allocation. In the typical case, it is difficult for the central agency, NASA in our case, to assess the value of each interval to each user - this is really only known to the users who understand their needs. Thus, our problem is more precisely formulated as follows: find an allocation schedule for the resource that maximizes the sum ofsers preferences, when the preference values are private information of the users. We bypass this problem by making the assumptions that one can assign money to customers. This assumption is reasonable; a committee is usually in charge of deciding the priority of each mission competing for access to the DSN within a time period while scheduling. Instead, we can assume that the committee assigns a budget to each mission.

Frank, Jeremy↗

Distance correlation methods for discovering associations in large astrophysical databases

High-dimensional, large-sample astrophysical databases of galaxy clusters, such as the Chandra Deep Field South COMBO-17 database, provide measurements on many variables for thousands of galaxies and a range of redshifts. Current understanding of galaxy formation and evolution rests sensitively on relationships between different astrophysical variables; hence an ability to detect and verify associations or correlations between variables is important in astrophysical research. In this paper, we apply a recently defined statistical measure called the distance correlation coefficient, which can be used to identify new associations and correlations between astrophysical variables. The distance correlation coefficient applies to variables of any dimension, can be used to determine smaller sets of variables that provide equivalent astrophysical information, is zero only when variables are independent, and is capable of detecting nonlinear associations that are undetectable by the classical Pearson correlation coefficient. Hence, the distance correlation coefficient provides more information than the Pearson coefficient. We analyze numerous pairs of variables in the COMBO-17 database with the distance correlation method and with the maximal information coefficient. We show that the Pearson coefficient can be estimated with higher accuracy from the corresponding distance correlation coefficient than from the maximal information coefficient. For given values of the Pearson coefficient, the distance correlation method has a greater ability than the maximal information coefficient to resolve astrophysical data into highly concentrated horseshoe- or V-shapes, which enhances classification and pattern identification. These results are observed over a range of redshifts beyond the local universe and for galaxies from elliptical to spiral.

79 ASTRONOMY AND ASTROPHYSICS↗

Linear Approximation to Optimal Control Allocation for Rocket Nozzles with Elliptical Constraints

In this paper we present a straightforward technique for assessing and realizing the maximum control moment effectiveness for a launch vehicle with multiple constrained rocket nozzles, where elliptical deflection limits in gimbal axes are expressed as an ensemble of independent quadratic constraints. A direct method of determining an approximating ellipsoid that inscribes the set of attainable angular accelerations is derived. In the case of a parameterized linear generalized inverse, the geometry of the attainable set is computationally expensive to obtain but can be approximated to a high degree of accuracy with the proposed method. A linear inverse can then be optimized to maximize the volume of the true attainable set by maximizing the volume of the approximating ellipsoid. The use of a linear inverse does not preclude the use of linear methods for stability analysis and control design, preferred in practice for assessing the stability characteristics of the inertial and servoelastic coupling appearing in large boosters. The present techniques are demonstrated via application to the control allocation scheme for a concept heavy-lift launch vehicle.

Orr, Jeb S.↗

Probing cosmological isotropy with type Ia supernovae

We investigate the validity of the cosmological principle by mapping the cosmological parameters H{sub 0} and q{sub 0} through the celestial sphere. In our analysis, which is performed in a low-redshift regime to follow a model-independent approach, we use two compilations of type Ia Supernovae (SNe Ia), namely the Union2.1 and the JLA data sets. First, we show that the angular distributions for both SNe Ia data sets are statistically anisotropic at a high confidence level (p-value < 0.0001), particularly the JLA sample. Then we find that the cosmic expansion and acceleration are mainly of dipolar type, with maximal anisotropic expansion [acceleration] pointing toward (l,b)≃(326{sup ∘},12{sup ∘}) [(l,b)≃(174{sup ∘},27{sup ∘})], and (l,b)≃(58{sup ∘},−60{sup ∘}) [(l,b)≃(225{sup ∘},51{sup ∘})] for the Union2.1 and JLA data, respectively. Second, we use a geometrical method to test the hypothesis that the non-uniformly distributed SNe Ia events could introduce anisotropic imprints on the cosmological expansion and acceleration. For the JLA compilation, we found significant correlations between the celestial distribution of data points and the directional studies of H{sub 0} and q{sub 0}, suggesting that these results can be attributed to the intrinsic anisotropy of the sample. In the case of the Union2.1 data, nonetheless, these correlations are less pronounced, and we verify that the dipole asymmetry found in the H{sub 0} analyses coincides with the well-known bulk-flow motion of our local group. From these analyses, we conclude that the directional asymmetry on the cosmological parameter maps are mainly either of local origin or due to celestial incompleteness of current SNe Ia samples.

79 ASTRONOMY AND ASTROPHYSICS↗

Violation of multipartite Bell inequalities with classical subsystems via operationally local transformations

Recently, it was demonstrated by Son et al., Phys. Rev. Lett. 102, 110404 (2009), that a separable bipartite continuous-variable quantum system can violate the Clauser-Horne-Shimony-Holt (CHSH) inequality via operationally local transformations. Operationally local transformations are parametrized only by local variables; however, in order to allow violation of the CHSH inequality, a maximally entangled ancilla was necessary. The use of the entangled ancilla in this scheme caused the state under test to become dependent on the measurement choice one uses to calculate the CHSH inequality, thus violating one of the assumptions used in deriving a Bell inequality, namely, the free will or statistical independence assumption. The novelty in this scheme however is that the measurement settings can be external free parameters. In this paper, we generalize these operationally local transformations for multipartite Bell inequalities (with dichotomic observables) and provide necessary and sufficient conditions for violation within this scheme. Namely, a violation of a multipartite Bell inequality in this setting is contingent on whether an ancillary system admits any realistic local hidden variable model (i.e., whether the ancilla violates the given Bell inequality). These results indicate that violation of a Bell inequality performed on a system does not necessarily imply that the system is nonlocal. In fact, the system under test may be completely classical. However, nonlocality must have resided somewhere, this may have been in the environment, the physical variables used to manipulate the system or the detectors themselves provided the measurement settings are external free variables.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Development of Three-Dimensional DRAGON Grid Technology

For a typical three dimensional flow in a practical engineering device, the time spent in grid generation can take 70 percent of the total analysis effort, resulting in a serious bottleneck in the design/analysis cycle. The present research attempts to develop a procedure that can considerably reduce the grid generation effort. The DRAGON grid, as a hybrid grid, is created by means of a Direct Replacement of Arbitrary Grid Overlapping by Nonstructured grid. The DRAGON grid scheme is an adaptation to the Chimera thinking. The Chimera grid is a composite structured grid, composing a set of overlapped structured grids, which are independently generated and body-fitted. The grid is of high quality and amenable for efficient solution schemes. However, the interpolation used in the overlapped region between grids introduces error, especially when a sharp-gradient region is encountered. The DRAGON grid scheme is capable of completely eliminating the interpolation and preserving the conservation property. It maximizes the advantages of the Chimera scheme and adapts the strengths of the unstructured and while at the same time keeping its weaknesses minimal. In the present paper, we describe the progress towards extending the DRAGON grid technology into three dimensions. Essential and programming aspects of the extension, and new challenges for the three-dimensional cases, are addressed.

Zheng, Yao↗

Beam energy tracking system on Optima XEx high energy ion implanter

The Axcelis Optima XEx high energy implanter is an RF linac-based implanter with 12 RF resonators for beam acceleration. Even though each acceleration field is an alternating, sinusoidal RF field, the well known phase-focusing principle produces a beam with a sharp quasi-monoenergetic energy spectrum. A magnetic energy filter after the linac further attenuates the low energy continuum in the energy spectrum often associated with RF acceleration. The final beam energy is a function of the phase and amplitude of the 12 resonators in the linac. When tuning a beam, the magnetic energy filter is set to the desired energy, and each linac parameter is tuned to maximize the transmission through the filter. Once a beam is set up, all the parameters are stored in a recipe, which can be easily tuned and has proven to be quite repeatable. The magnetic field setting of the energy filter selects the beam energy from the RF Linac accelerator, and in-situ verification of beam energy in addition to the magnetic energy filter setting has long been desired. An independent energy tracking system was developed for this purpose, using the existing electrostatic beam scanner as a deflector to construct an in-situ electrostatic energy analyzer. This paper will describe the system and performance of the beam energy tracking system.

43 PARTICLE ACCELERATORS↗

Completable scheduling: An integrated approach to planning and scheduling

The planning problem has traditionally been treated separately from the scheduling problem. However, as more realistic domains are tackled, it becomes evident that the problem of deciding on an ordered set of tasks to achieve a set of goals cannot be treated independently of the problem of actually allocating resources to the tasks. Doing so would result in losing the robustness and flexibility needed to deal with imperfectly modeled domains. Completable scheduling is an approach which integrates the two problems by allowing an a priori planning module to defer particular planning decisions, and consequently the associated scheduling decisions, until execution time. This allows a completable scheduling system to maximize plan flexibility by allowing runtime information to be taken into consideration when making planning and scheduling decision. Furthermore, through the criteria of achievability placed on deferred decision, a completable scheduling system is able to retain much of the goal-directedness and guarantees of achievement afforded by a priori planning. The completable scheduling approach is further enhanced by the use of contingent explanation-based learning, which enables a completable scheduling system to learn general completable plans from example and improve its performance through experience. Initial experimental results show that completable scheduling outperforms classical scheduling as well as pure reactive scheduling in a simple scheduling domain.

Gervasio, Melinda T.↗

Classification of rain regimes by the three-dimensional properties of reflectivity fields

An automated scheme to characterize precipitation echoes within small windows in the radar field is presented and applied to previously subjectively classified tropical rain cloud systems near Darwin, Australia. The classification parameters are (a) E(sub e), effective efficiency, as determined by cloud-top and cloud-base water vapor saturation mixing ratios; (b) BBF, brightband fraction, as determined by the fraction of the radar echo area in which the maximal reflectivity occurs within +/- 1.5 km of the 0 C isotherm level; and (c) del(sub r) Z, radial reflectivity gradients (dB/km). These classification criteria were applied to tropical rain cloud systems near Darwin, Australia, and to winter convective rain cloud systems in Israel. Both sets of measurements were made with nearly identical networks of C-band radars and rain gauge networks. The results of the application of these objective classification criteria to several independently predetermined rain regimes in Darwin have shown that better organized rain systems have smaller del(sub r) Z and larger BBF. Similarly, smaller del(sub r)Z and larger BBF were also observed from maritime rain cloud systems, as compared to continental rain cloud systems with the same degree of organization. Continental rain cloud system, regardless of their degree of organization, have larger depths, as expressed by E(sub e). The rainfall analyses presented in this study are based exclusively on rain gauge measurements, while radar information was used only to classify the individual gauge measurements.

Rosenfeld, Daniel↗