Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “integer”

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,693 records · Page 94

INDDGO: Integrated Network Decomposition & Dynamic programming for Graph Optimization

It is well-known that dynamic programming algorithms can utilize tree decompositions to provide a way to solve some NP -hard problems on graphs where the complexity is polynomial in the number of nodes and edges in the graph, but exponential in the width of the underlying tree decomposition. However, there has been relatively little computational work done to determine the practical utility of such dynamic programming algorithms. We have developed software to construct tree decompositions using various heuristics and have created a fast, memory-efficient dynamic programming implementation for solving maximum weighted independent set. We describe our software and the algorithms we have implemented, focusing on memory saving techniques for the dynamic programming. We compare the running time and memory usage of our implementation with other techniques for solving maximum weighted independent set, including a commercial integer programming solver and a semi-definite programming solver. Our results indicate that it is possible to solve some instances where the underlying decomposition has width much larger than suggested by the literature. For certain types of problems, our dynamic programming code runs several times faster than these other methods.

Groër, Christopher S.↗

Cavity length dependence of mode beating in passively Q-switched Nd-solid state lasers

The beat frequencies, temporal intensity profile, and modulation depth of a flash lamp pumped passively Q-switched, Nd:Cr:GSGG monoblock laser with a Cr +4 :YAG Q switch are investigated as a function of cavity length. The measured temporal widths are linearly correlated with cavity length and the modulation depths of the temporal waveforms are periodic in nature with cavity length, peaking at integer multiples of c/2nL. Simulations support measured trends in the pulse widths and beat frequencies as a function of cavity length.

Zameroski, Nathan D.↗

The effects of phase advances between interaction points

In this note we perform simulation studies to investigate the effects of betatron phase advances between the beam-beam interaction points on half-integer resonance driving term, second order chromaticty and dynamic aperture in RHIC. The betatron phase advances are adjusted with artificial matrices inserted in the middle of arcs. The lattices for the 2011 RHIC polarized proton (p-p) run and 2010 RHIC Au-Au runs are used. We also scan the phase advances between IP8 and the electron lens for the proposed Blue ring lattice with head-on beam-beam compensation.

43 PARTICLE ACCELERATORS↗

Report on Betatron Phaseadvance Measurements with Phaseshifter in RUN 12

The function of upcoming E-lens requests the phase advance between the collision IP and location of E-lens (IP10) to be integer multiples of pi. The RHIC quadrupole mains were modified (phaseshifter) to allow the control of phase advance between IP8 and IP10. Measurements were made during RHIC run 2012 to confirm the effect of phaseshifter on the betatron phase advance between the two IPs. The results are reported in this paper

43 PARTICLE ACCELERATORS↗

Longitudinal matching without $\gamma_t$ quads

The Yellow e-lens lattice requires a different working point (29.68/30.69 instead of 28.68/29.69) to provide the correct betatron phase advance between IP 8 and the e-lens. Since this raises $\gamma_t$ by about one unit, it needs to be ensured that longitudinal matching can still be achieved. In an earlier experiment, $\gamma_t$ had been lowered by$\Delta\gamma_t$ = 0.35 by means of the $\gamma_t$ quadrupoles. In the experiment reported here, longitudinal matching was achieved by lowering the 9 MHz RF cavity voltage, while $\gamma_t$ was raised by 0.5 units to more closely simulate the conditions with the higher integer tunes. During the experiment, the Yellow $\gamma_t$ quad design values were set to the park current (2A), and tunes were adjusted through RampEditor. The 9 MHz RF cavity voltage was reduced from 17 kV to the calculated matched value of 12 kV. Figure 1 shows the resulting beam profile evolution as measured by the wall current monitor (WCM). In an attempt to further fine-tune the matching, the voltage was set to 11.5 and 12.5 kV. However, shot-to-shot fluctuations were larger than the effect of these voltage variations. The Yellow Landau was off during this study, as set through the YellowStore tab in RFramps, as well as in the Landau tab. At the end of the study the Landau settings were restored in the Landau tab to the value as found at the start. The experiment was successful; matching was achieved with around 12 kV on the 9 MHz cavity. Had only one bunch in Yellow during the experiment, but 56 in Blue with the same 9 MHz RF voltage, though unmatched due to regular gamma-t quad settings. No problems due to beam loading at the low cavity voltage occurred. This experiment, together with previous studies , indicates that longitudinal matching into the Yellow e-lens lattice can be achieved in spite of the higher horizontal tune.

43 PARTICLE ACCELERATORS↗

Space-Charge Effects on Beam Rotation at the Compressor Ring

Bunch-width compression can be accomplished by rf rotating an elongated bunch with minimal energy spread. The longitudinal space-charge force counteracts the rf force. When it is larger than the rf force, the focusing effect of the rf will be lost completely. This possibility is studied with analytic formulas as well as simulations. The transverse space-charge force can drive quadrupole breathing modes in the beam. If the frequencies of these modes fall into the stopbands of parametric resonances, especially the half-integer resonances, emittances will increase. Application is made to the bunch-width compression in the Fermilab Compressor Ring proposed by Alexahin and Neuffer [1], destined for pion and subsequently muon production.

Ng, K. Y.↗

The AGS Ggamma Meter and Calibrating the Gauss Clock

During AGS Polarized Proton acceleration periods, one output from the AGS Ggamma Meter, namely the energy (or Ggamma) calculated from the magnetic field in the AGS main magnets and the beam radius- both measured in particular instant, is used to figure out the times in the AGS magnet acceleration cycle when the beam passes through a particular set of depolarizing resonances. The resonance set occur whenever a particle’s Ggamma (energy*(G/m) becomes nearly equal to n*Qx (i.e. any integer multiplied by the horizontal betatron tune). This deliverable is why the machinery is referred to as the ''Ggamma Meter'' rather than the AGS energy meter. The Ggamma Meter takes as inputs a set of measurements of frequency (F(t)), radius (r(t)), and gauss clock counts (GCC(t)). The other energy (GgammaBr) assumes the field when the gauss clock starts counting is known. The change in field to time t is given by the measured accumulated gauss clock counts multiplied by the gauss clock calibration (gauss/GCC). In order to deal with experimental data, this calibration factor gets an added ad hoc complication, namely a correction dependent on the rate of change the counting rate. The Ggamma meter takes GCC(t) and together with the past history for this cycle calculates B(t).

43 PARTICLE ACCELERATORS↗

Dynamic Optimized Advanced Scheduling of Bandwidth Demands for Large-Scale Science Applications (Final Report)

In this project, developed scheduling frameworks for dynamic bandwidth demands for large-scale science applications. In particular, we developed scheduling algorithms for dynamic bandwidth demands in this project. Apart from theoretical approaches such as Integer Linear Programming, Tabu Search and Genetic Algorithm heuristics, we have utilized practical data from ESnet OSCARS project (from our DOE lab partners) to conduct realistic simulations of our approaches. We have disseminated our work through conference paper presentations and journal papers and a book chapter. In this project we addressed the problem of scheduling of lightpaths over optical wavelength division multiplexed (WDM) networks. We published several conference papers and journal papers on this topic. We also addressed the problems of joint allocation of computing, storage and networking resources in Grid/Cloud networks and proposed energy-efficient mechanisms for operation optical WDM networks.

97 MATHEMATICS AND COMPUTING↗

Short-Duration Simulations from Measurements.

A method is presented that ascribes proper statistical variability to simulations that are derived from longer-duration measurements. This method is applicable to simulations of either real-value or integer-value data. An example is presented that demonstrates the applicability of this technique to the synthesis of gamma-ray spectra.

Mitchell, Dean J.↗

Model Based Optimal Sensor Network Design for Condition Monitoring in an IGCC Plant

This report summarizes the achievements and final results of this program. The objective of this program is to develop a general model-based sensor network design methodology and tools to address key issues in the design of an optimal sensor network configuration: the type, location and number of sensors used in a network, for online condition monitoring. In particular, the focus in this work is to develop software tools for optimal sensor placement (OSP) and use these tools to design optimal sensor network configuration for online condition monitoring of gasifier refractory wear and radiant syngas cooler (RSC) fouling. The methodology developed will be applicable to sensing system design for online condition monitoring for broad range of applications. The overall approach consists of (i) defining condition monitoring requirement in terms of OSP and mapping these requirements in mathematical terms for OSP algorithm, (ii) analyzing trade-off of alternate OSP algorithms, down selecting the most relevant ones and developing them for IGCC applications (iii) enhancing the gasifier and RSC models as required by OSP algorithms, (iv) applying the developed OSP algorithm to design the optimal sensor network required for the condition monitoring of an IGCC gasifier refractory and RSC fouling. Two key requirements for OSP for condition monitoring are desired precision for the monitoring variables (e.g. refractory wear) and reliability of the proposed sensor network in the presence of expected sensor failures. The OSP problem is naturally posed within a Kalman filtering approach as an integer programming problem where the key requirements of precision and reliability are imposed as constraints. The optimization is performed over the overall network cost. Based on extensive literature survey two formulations were identified as being relevant to OSP for condition monitoring; one based on LMI formulation and the other being standard INLP formulation. Various algorithms to solve these two formulations were developed and validated. For a given OSP problem the computation efficiency largely depends on the “size” of the problem. Initially a simplified 1-D gasifier model assuming axial and azimuthal symmetry was used to test out various OSP algorithms. Finally these algorithms were used to design the optimal sensor network for condition monitoring of IGCC gasifier refractory wear and RSC fouling. The sensors type and locations obtained as solution to the OSP problem were validated using model based sensing approach. The OSP algorithm has been developed in a modular form and has been packaged as a software tool for OSP design where a designer can explore various OSP design algorithm is a user friendly way. The OSP software tool is implemented in Matlab/Simulink© in-house. The tool also uses few optimization routines that are freely available on World Wide Web. In addition a modular Extended Kalman Filter (EKF) block has also been developed in Matlab/Simulink© which can be utilized for model based sensing of important process variables that are not directly measured through combining the online sensors with model based estimation once the hardware sensor and their locations has been finalized. The OSP algorithm details and the results of applying these algorithms to obtain optimal sensor location for condition monitoring of gasifier refractory wear and RSC fouling profile are summarized in this final report.

20 FOSSIL-FUELED POWER PLANTS↗

PFLOTRAN User Manual: A Massively Parallel Reactive Flow and Transport Model for Describing Surface and Subsurface Processes

PFLOTRAN solves a system of generally nonlinear partial differential equations describing multi-phase, multicomponent and multiscale reactive flow and transport in porous materials. The code is designed to run on massively parallel computing architectures as well as workstations and laptops (e.g. Hammond et al., 2011). Parallelization is achieved through domain decomposition using the PETSc (Portable Extensible Toolkit for Scientific Computation) libraries for the parallelization framework (Balay et al., 1997). PFLOTRAN has been developed from the ground up for parallel scalability and has been run on up to 218 processor cores with problem sizes up to 2 billion degrees of freedom. Written in object oriented Fortran 90, the code requires the latest compilers compatible with Fortran 2003. At the time of this writing this requires gcc 4.7.x, Intel 12.1.x and PGC compilers. As a requirement of running problems with a large number of degrees of freedom, PFLOTRAN allows reading input data that is too large to fit into memory allotted to a single processor core. The current limitation to the problem size PFLOTRAN can handle is the limitation of the HDF5 file format used for parallel IO to 32 bit integers. Noting that 2 32 = 4; 294; 967; 296, this gives an estimate of the maximum problem size that can be currently run with PFLOTRAN. Hopefully this limitation will be remedied in the near future.

58 GEOSCIENCES↗

The effects of phase advances between interaction points

In this note we perform simulation studies to investigate the effects of betatron phase advances between the beam-beam interaction points on half-integer resonance driving term, second order chromaticty and dynamic aperture in RHIC. The betatron phase advances are adjusted with artificial matrices inserted in the middle of arcs. The lattices for the 2011 RHIC polarized proton (p-p) run and 2010 RHIC Au-Au runs are used. We also scan the phase advances between IP8 and the electron lens for the proposed Blue ring lattice with head-on beam-beam compensation.

43 PARTICLE ACCELERATORS↗

Dakota, a multilevel parallel object-oriented framework for design optimization, parameter estimation, uncertainty quantification, and sensitivity analysis version 6.0 theory manual

The Dakota (Design Analysis Kit for Optimization and Terascale Applications) toolkit provides a exible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quanti cation with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a exible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the Dakota software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of Dakota-related research publications in the areas of surrogate-based optimization, uncertainty quanti cation, and optimization under uncertainty that provide the foundation for many of Dakota's iterative analysis capabilities.

97 MATHEMATICS AND COMPUTING↗

Dakota, a multilevel parallel object-oriented framework for design optimization, parameter estimation, uncertainty quantification, and sensitivity analysis :

The Dakota (Design Analysis Kit for Optimization and Terascale Applications) toolkit provides a exible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quanti cation with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a exible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a user's manual for the Dakota software and provides capability overviews and procedures for software execution, as well as a variety of example studies.

97 MATHEMATICS AND COMPUTING↗

SAR Image Complex Pixel Representations

Complex pixel values for Synthetic Aperture Radar (SAR) images of uniform distributed clutter can be represented as either real/imaginary (also known as I/Q) values, or as Magnitude/Phase values. Generally, these component values are integers with limited number of bits. For clutter energy well below full-scale, Magnitude/Phase offers lower quantization noise than I/Q representation. Further improvement can be had with companding of the Magnitude value.

42 ENGINEERING↗

Epicyclic helical channels for parametric resonance ionization cooling

Proposed next-generation muon colliders will require major technical advances to achieve rapid muon beam cooling requirements. Parametric-resonance Ionization Cooling (PIC) is proposed as the final 6D cooling stage of a high-luminosity muon collider. In PIC, a half-integer parametric resonance causes strong focusing of a muon beam at appropriately placed energy absorbers while ionization cooling limits the beam’s angular spread. Combining muon ionization cooling with parametric resonant dynamics in this way should then allow much smaller final transverse muon beam sizes than conventional ionization cooling alone. One of the PIC challenges is compensation of beam aberrations over a sufficiently wide parameter range while maintaining the dynamical stability with correlated behavior of the horizontal and vertical betatron motion and dispersion. We explore use of a coupling resonance to reduce the dimensionality of the problem and to shift the dynamics away from non-linear resonances. PIC simulations are presented.

43 PARTICLE ACCELERATORS↗

Quantized beam shifts in graphene

We predict the existence of quantized Imbert-Fedorov, Goos-Hanchen, and photonic spin Hall shifts for light beams impinging on a graphene-on-substrate system in an external magnetic field. In the quantum Hall regime the Imbert-Fedorov and photonic spin Hall shifts are quantized in integer multiples of the fine structure constant α, while the Goos-Hanchen ones in multiples of α 2 . We investigate the influence on these shifts of magnetic field, temperature, and material dispersion and dissipation. An experimental demonstration of quantized beam shifts could be achieved at terahertz frequencies for moderate values of the magnetic field.

Classical & Quantum Mechanics, General Physics(71)↗

Triangular Alignment (TAME). A Tensor-based Approach for Higher-order Network Alignment

Network alignment is an important tool with extensive applications in comparative interactomics. Traditional approaches aim to simultaneously maximize the number of conserved edges and the underlying similarity of aligned entities. We propose a novel formulation of the network alignment problem that extends topological similarity to higher-order structures and provide a new objective function that maximizes the number of aligned substructures. This objective function corresponds to an integer programming problem, which is NP-hard. Consequently, we approximate this objective function as a surrogate function whose maximization results in a tensor eigenvalue problem. Based on this formulation, we present an algorithm called Triangular AlignMEnt (TAME), which attempts to maximize the number of aligned triangles across networks. We focus on alignment of triangles because of their enrichment in complex networks; however, our formulation and resulting algorithms can be applied to general motifs. Using a case study on the NAPABench dataset, we show that TAME is capable of producing alignments with up to 99% accuracy in terms of aligned nodes. We further evaluate our method by aligning yeast and human interactomes. Our results indicate that TAME outperforms the state-of-art alignment methods both in terms of biological and topological quality of the alignments.

42 ENGINEERING↗