Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximation algorithms”

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,315 records · Page 73

Cholesky-based experimental design for Gaussian process and kernel-based emulation and calibration.

Gaussian processes and other kernel-based methods are used extensively to construct approximations of multivariate data sets. The accuracy of these approximations is dependent on the data used. This paper presents a computationally efficient algorithm to greedily select training samples that minimize the weighted L p error of kernel-based approximations for a given number of data. The method successively generates nested samples, with the goal of minimizing the error in high probability regions of densities specified by users. The algorithm presented is extremely simple and can be implemented using existing pivoted Cholesky factorization methods. Training samples are generated in batches which allows training data to be evaluated (labeled) in parallel. For smooth kernels, the algorithm performs comparably with the greedy integrated variance design but has significantly lower complexity. Numerical experiments demonstrate the efficacy of the approach for bounded, unbounded, multi-modal and non-tensor product densities. We also show how to use the proposed algorithm to efficiently generate surrogates for inferring unknown model parameters from data using Bayesian inference.

97 MATHEMATICS AND COMPUTING↗

LOCALIZATION OF SHORT DURATION GRAVITATIONAL-WAVE TRANSIENTS WITH THE EARLY ADVANCED LIGO AND VIRGO DETECTORS

The Laser Interferometer Gravitational wave Observatory (LIGO) and Virgo advanced ground-based gravitational-wave detectors will begin collecting science data in 2015. With first detections expected to follow, it is important to quantify how well generic gravitational-wave transients can be localized on the sky. This is crucial for correctly identifying electromagnetic counterparts as well as understanding gravitational-wave physics and source populations. We present a study of sky localization capabilities for two search and parameter estimation algorithms: coherent WaveBurst, a constrained likelihood algorithm operating in close to real-time, and LALInferenceBurst, a Markov chain Monte Carlo parameter estimation algorithm developed to recover generic transient signals with latency of a few hours. Furthermore, we focus on the first few years of the advanced detector era, when we expect to only have two (2015) and later three (2016) operational detectors, all below design sensitivity. These detector configurations can produce significantly different sky localizations, which we quantify in detail. We observe a clear improvement in localization of the average detected signal when progressing from two-detector to three-detector networks, as expected. Although localization depends on the waveform morphology, approximately 50% of detected signals would be imaged after observing 100-200 deg{sup 2} in 2015 and 60-110 deg{sup 2} in 2016, although knowledge of the waveform can reduce this to as little as 22 deg{sup 2}. This is the first comprehensive study on sky localization capabilities for generic transients of the early network of advanced LIGO and Virgo detectors, including the early LIGO-only two-detector configuration.

79 ASTRONOMY AND ASTROPHYSICS↗

The metric of the cosmos from luminosity and age data

This paper presents the algorithm for determining the Lemaître-Tolman model that best fits given datasets for maximum stellar ages, and SNIa luminosities, both as functions of redshift. It then applies it to current cosmological data. Special attention must be given to the handling of the origin, and the region of the maximum diameter distances. As with a previous combination of datasets (galaxy number counts and luminosity distances versus redshift), there are relationships that must hold at the region of the maximum diameter distance, which are unlikely to be obeyed exactly by real data. We show how to make corrections that enable a self-consistent solution to be found. We address the questions of the best way to approximate discrete data with smooth functions, and how to estimate the uncertainties of the output — the 3 free functions that determine a specific Lemaître-Tolman metric. While current data does not permit any confidence in our results, we show that the method works well, and reasonable Lemaître-Tolman models do fit with or without a cosmological constant.

79 ASTRONOMY AND ASTROPHYSICS↗

Exact milestoning

A new theory and an exact computer algorithm for calculating kinetics and thermodynamic properties of a particle system are described. The algorithm avoids trapping in metastable states, which are typical challenges for Molecular Dynamics (MD) simulations on rough energy landscapes. It is based on the division of the full space into Voronoi cells. Prior knowledge or coarse sampling of space points provides the centers of the Voronoi cells. Short time trajectories are computed between the boundaries of the cells that we call milestones and are used to determine fluxes at the milestones. The flux function, an essential component of the new theory, provides a complete description of the statistical mechanics of the system at the resolution of the milestones. We illustrate the accuracy and efficiency of the exact Milestoning approach by comparing numerical results obtained on a model system using exact Milestoning with the results of long trajectories and with a solution of the corresponding Fokker-Planck equation. The theory uses an equation that resembles the approximate Milestoning method that was introduced in 2004 [A. K. Faradjian and R. Elber, J. Chem. Phys. 120(23), 10880-10889 (2004)]. However, the current formulation is exact and is still significantly more efficient than straightforward MD simulations on the system studied.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scalable Methods for Electronic Excitations and Optical Responses in Nanostructures: Mathematics to Algorithms to Observables

The work reported here took place at the University of Minnesota from September 15, 2003 to November 14, 2005. This funding resulted in 10 invited articles or book chapters, 37 articles in refereed journals and 13 invited talks. The funding helped train 5 PhD students. The research supported by this grant focused on developing theoretical methods for predicting and understanding the properties of matter at the nanoscale. Within this regime, new phenomena occur that are characteristic of neither the atomic limit, nor the crystalline limit. Moreover, this regime is crucial for understanding the emergence of macroscopic properties such as ferromagnetism. For example, elemental Fe clusters possess magnetic moments that reside between the atomic and crystalline limits, but the transition from the atomic to the crystalline limit is not a simple interpolation between the two size regimes. To capitalize properly on predicting such phenomena in this transition regime, a deeper understanding of the electronic, magnetic and structural properties of matter is required, e.g., electron correlation effects are enhanced within this size regime and the surface of a confined system must be explicitly included. A key element of our research involved the construction of new algorithms to address problems peculiar to the nanoscale. Typically, one would like to consider systems with thousands of atoms or more, e.g., a silicon nanocrystal that is 7 nm in diameter would contain over 10,000 atoms. Previous ab initio methods could address systems with hundreds of atoms whereas empirical methods can routinely handle hundreds of thousands of atoms (or more). However, these empirical methods often rely on ad hoc assumptions and lack incorporation of structural and electronic degrees of freedom. The key theoretical ingredients in our work involved the use of ab initio pseudopotentials and density functional approaches. The key numerical ingredients involved the implementation of algorithms for solving the Kohn-Sham equation without the use of an explicit basis, i.e., a real space grid. We invented algorithms for a solution of the Kohn-Sham equation based on Chebyshev 'subspace filtering'. Our filtering algorithms dramatically enhanced our ability to explore systems with thousands of atoms, i.e., we examined silicon quantum dots with approximately 11,000 atoms (or 40,000 electrons). We applied this algorithm to a number of nanoscale systems to examine the role of quantum confinement on electronic and magnetic properties: (1) Doping of nanocrystals and nanowires, including both magnetic and non-magnetic dopants and the role of self-purification; (2) Optical excitations and electronic properties of nanocrystals; (3) Intrinsic defects in nanostructures; and (4) The emergence of ferromagnetism from atoms to crystals.

36 MATERIALS SCIENCE↗

Rapid inversion of limb radiance data using an emissivity growth approximation

The time-consuming nature of limb relaxation-type inversion algorithms is due primarily to the numerous integrations over an absorption band to obtain forward radiance values with which to compare measured values. A new method has been devised for the quick and accurate (0.5% error) calculation of single gas broadband (approximately 100 per cm) limb radiance. The method uses a precalculated data base consisting of homogeneous path emissivity vs mass path data for a wide range of temperature and pressure. A 50-km altitude range, 1-km resolution, constituent inversion employing this method requires under 1 sec of computational time when run on modern computer hardware. The method does not rely upon a priori statistical knowledge.

Gordley, L. L.↗

BayesCLUMPY: BAYESIAN INFERENCE WITH CLUMPY DUSTY TORUS MODELS

Our aim is to present a fast and general Bayesian inference framework based on the synergy between machine learning techniques and standard sampling methods and apply it to infer the physical properties of clumpy dusty torus using infrared photometric high spatial resolution observations of active galactic nuclei. We make use of the Metropolis-Hastings Markov Chain Monte Carlo algorithm for sampling the posterior distribution function. Such distribution results from combining all a priori knowledge about the parameters of the model and the information introduced by the observations. The main difficulty resides in the fact that the model used to explain the observations is computationally demanding and the sampling is very time consuming. For this reason, we apply a set of artificial neural networks that are used to approximate and interpolate a database of models. As a consequence, models not present in the original database can be computed ensuring continuity. We focus on the application of this solution scheme to the recently developed public database of clumpy dusty torus models. The machine learning scheme used in this paper allows us to generate any model from the database using only a factor of 10{sup -4} of the original size of the database and a factor of 10{sup -3} in computing time. The posterior distribution obtained for each model parameter allows us to investigate how the observations constrain the parameters and which ones remain partially or completely undetermined, providing statistically relevant confidence intervals. As an example, the application to the nuclear region of Centaurus A shows that the optical depth of the clouds, the total number of clouds, and the radial extent of the cloud distribution zone are well constrained using only six filters. The code is freely available from the authors.

79 ASTRONOMY AND ASTROPHYSICS↗

Fast compressed sensing-based CBCT reconstruction using Barzilai-Borwein formulation for application to on-line IGRT

Purpose: Compressed sensing theory has enabled an accurate, low-dose cone-beam computed tomography (CBCT) reconstruction using a minimal number of noisy projections. However, the reconstruction time remains a significant challenge for practical implementation in the clinic. In this work, we propose a novel gradient projection algorithm, based on the Gradient-Projection-Barzilai-Borwein formulation (GP-BB), that handles the total variation (TV)-norm regularization-based least squares problem for the CBCT reconstruction in a highly efficient manner, with speed acceptable for routine use in the clinic. Methods: CBCT is reconstructed by minimizing an energy function consisting of a data fidelity term and a TV-norm regularization term. Both terms are simultaneously minimized by calculating the gradient projection of the energy function with the step size determined using an approximate Hessian calculation at each iteration, based on the Barzilai-Borwein formulation. To speed up the process, a multiresolution optimization is used. In addition, the entire algorithm was designed to run with a single graphics processing unit (GPU) card. To evaluate the performance, the Shepp-Logan numerical phantom, the CatPhan 600 physical phantom, and a clinically-treated head-and-neck patient were acquired from the TrueBeam system (Varian Medical Systems, Palo Alto, CA). For each scan, in total, 364 projections were acquired in a 200 deg. rotation. The imager has 1024 x 768 pixels with 0.388 x 0.388-mm resolution. This was down-sampled to 512 x 384 pixels with 0.776 x 0.776-mm resolution for reconstruction. Evenly spaced angles were subsampled and used for varying the number of projections for the image reconstruction. To assess the performance of our GP-BB algorithm, we have implemented and compared with three compressed sensing-type algorithms, the two of which are popular and published (forward-backward splitting techniques), and the other one with a basic line-search technique. In addition, the conventional Feldkamp-Davis-Kress (FDK) reconstruction of the clinical patient data is compared as well. Results: In comparison with the other compressed sensing-type algorithms, our algorithm showed convergence in {<=}30 iterations whereas other published algorithms need at least 50 iterations in order to reconstruct the Shepp-Logan phantom image. With the CatPhan phantom, the GP-BB algorithm achieved a clinically-reasonable image with 40 projections in 12 iterations, in less than 12.6 s. This is at least an order of magnitude faster in reconstruction time compared with the most recent reports utilizing GPU technology given the same input projections. For the head-and-neck clinical scan, clinically-reasonable images were obtained from 120 projections in 34-78 s converging in 12-30 iterations. In this reconstruction range (i.e., 120 projections) the image quality is visually similar to or better than the conventional FDK reconstructed images using 364 projections. This represents a dose reduction of nearly 67% (120/364 projections) while maintaining a reasonable speed in clinical implementation. Conclusions: In this paper, we proposed a novel, fast, low-dose CBCT reconstruction algorithm using the Barzilai-Borwein step-size calculation. A clinically viable head-and-neck image can be obtained within {approx}34-78 s while simultaneously cutting the dose by approximately 67%. This makes our GP-BB algorithm potentially useful in an on-line image-guided radiation therapy (IGRT).

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Model's sparse representation based on reduced mixed GMsFE basis methods

In this paper, we propose a model's sparse representation based on reduced mixed generalized multiscale finite element (GMsFE) basis methods for elliptic PDEs with random inputs. A typical application for the elliptic PDEs is the flow in heterogeneous random porous media. Mixed generalized multiscale finite element method (GMsFEM) is one of the accurate and efficient approaches to solve the flow problem in a coarse grid and obtain the velocity with local mass conservation. When the inputs of the PDEs are parameterized by the random variables, the GMsFE basis functions usually depend on the random parameters. This leads to a large number degree of freedoms for the mixed GMsFEM and substantially impacts on the computation efficiency. In order to overcome the difficulty, we develop reduced mixed GMsFE basis methods such that the multiscale basis functions are independent of the random parameters and span a low-dimensional space. To this end, a greedy algorithm is used to find a set of optimal samples from a training set scattered in the parameter space. Reduced mixed GMsFE basis functions are constructed based on the optimal samples using two optimal sampling strategies: basis-oriented cross-validation and proper orthogonal decomposition. Although the dimension of the space spanned by the reduced mixed GMsFE basis functions is much smaller than the dimension of the original full order model, the online computation still depends on the number of coarse degree of freedoms. To significantly improve the online computation, we integrate the reduced mixed GMsFE basis methods with sparse tensor approximation and obtain a sparse representation for the model's outputs. The sparse representation is very efficient for evaluating the model's outputs for many instances of parameters. To illustrate the efficacy of the proposed methods, we present a few numerical examples for elliptic PDEs with multiscale and random inputs. In particular, a two-phase flow model in random porous media is simulated by the proposed sparse representation method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Ensemble Quasi-Newton HMC

We present a modification of the Hybrid Monte Carlo algorithm for tackling the critical slowing down of generating Markov chains of lattice gauge configurations towards the continuum limit. We propose a new method to exchange information within an ensemble of Markov chains, and use it to construct an approximate inverse Hessian matrix of the action inspired from quasi-Newton algorithms for optimization. The kinetic term of the molecular dynamics evolution includes the approximate Hessian for long distance couplings among the momenta. We show the result of applying the new algorithm to the U(1) gauge theory in two dimensions, and discuss our future plans.

Jin, Xiao-Yong↗

An efficient algorithm for generating diverse microstructure sets and delineating properties closures

Properties closures delineate the theoretical objective space for materials design problems, allowing designers to make informed trade-offs between competing constraints and target properties. In this paper, we present a new algorithm called hierarchical simplex sampling (HSS) that approximates properties closures more efficiently and faithfully than traditional optimization based approaches. By construction, HSS generates samples of microstructure statistics that span the corresponding microstructure hull. As a result, we also find that HSS can be coupled with synthetic polycrystal generation software to generate diverse sets of microstructures for subsequent mesoscale simulations. Finally, by more broadly sampling the space of possible microstructures, it is anticipated that such diverse microstructure sets will expand our understanding of the influence of microstructure on macroscale effective properties and inform the construction of higher-fidelity mesoscale structure-property models.

36 MATERIALS SCIENCE↗

Controlling the high frequency response of H{sub 2} by ultra-short tailored laser pulses: A time-dependent configuration interaction study

We combine the stochastic pulse optimization (SPO) scheme with the time-dependent configuration interaction singles method in order to control the high frequency response of a simple molecular model system to a tailored femtosecond laser pulse. For this purpose, we use H{sub 2} treated in the fixed nuclei approximation. The SPO scheme, as similar genetic algorithms, is especially suited to control highly non-linear processes, which we consider here in the context of high harmonic generation. Here, we will demonstrate that SPO can be used to realize a “non-harmonic” response of H{sub 2} to a laser pulse. Specifically, we will show how adding low intensity side frequencies to the dominant carrier frequency of the laser pulse and stochastically optimizing their contribution can create a high-frequency spectral signal of significant intensity, not harmonic to the carrier frequency. At the same time, it is possible to suppress the harmonic signals in the same spectral region, although the carrier frequency is kept dominant during the optimization.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Two-dimensional isometric tensor networks on an infinite strip

The exact contraction of a generic two-dimensional (2D) tensor network state (TNS) is known to be exponentially hard, making simulation of 2D systems difficult. The recently introduced class of isometric TNS (isoTNS) represents a subset of TNS that allows for efficient simulation of such systems on finite square lattices. The isoTNS ansatz requires the identification of an “orthogonality column” of tensors, within which one-dimensional matrix product state (MPS) methods can be used for calculation of observables and optimization of tensors. Here we extend isoTNS to infinitely long strip geometries and introduce an infinite version of the Moses Move algorithm for moving the orthogonality column around the network. Using this algorithm, we iteratively transform an infinite MPS representation of a 2D quantum state into a strip isoTNS and investigate the entanglement properties of the resulting state. In addition, we demonstrate that the local observables can be evaluated efficiently. Lastly, we introduce an infinite time-evolving block decimation algorithm (iTEBD 2 ) and use it to approximate the ground state of the 2D transverse field Ising model on lattices of infinite strip geometry.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Inverse Calculation of Burden Distribution Matrix Using B-spline Model Based PDF control in Blast Furnace Burden Charging Process

The inverse calculation of burden distribution matrix (BDM) is one of the most important challenges in the blast furnace operation in iron-making processes. In general, blast furnace consumes 65% of the total energy for the whole steel-making. Focusing on this practical challenge, this article proposes a new burden distribution spatial model in calculating burden charging process, and develops a B-spline approximation-based probability density function (PDF) control algorithm to assign the expected thickness distribution of burden layer and, thus, develops a new method for the required inverse calculation of BDM. First, a novel method for the thickness distribution of burden layer is given using B-spline model to produce an expected distribution shape subjected to a desired tracking within a specific spatial constraint. Then, according to the coexistence of continuous and bounded discrete variables in BDM, a novel hybrid optimization control method by combining integer programming and PDF tracking is further established for the effective inverse calculation of BDM. Finally, the proposed PDF-based iterative inverse calculation of BDM using B-spline models are tested using various data from industrial examples. Furthermore, the simulation results show that the proposed method is well suited to solve the BDM inverse calculation problem in practice.

42 ENGINEERING↗

Hierarchical Distributed Optimal Power Flow of HV and MV Distribution Networks With Continuous and Discrete Devices

With large-scale distributed photovoltaics (PVs) being integrated into distribution networks (DNs), coordinated optimal power flow (OPF) of high voltage (HV) and medium voltage (MV) DNs should be investigated to optimally dispatch the distributed PVs and other network devices. Here, this paper presents a hierarchical distributed OPF method for HV and MV DNs with on-load tap changers, reactive power compensators, feeder switches and distributed PVs. A hierarchical master-slave control architecture is applied to implement coordinated OPF of two-layer DNs. The HV master problem and MV subproblems are transformed into mixed-integer convex problems respectively with second order cone programming and LinDistFlow approximation. Since there is no efficient distributed algorithm to solve such OPF models with integer subproblems, a novel distributed algorithm is proposed in this paper to efficiently solve the hierarchical coordinated OPF model with integer subproblems in a distributed manner. In the proposed algorithm, the coordinated OPF model is solved in a branch-and-bound framework, where in each branch node generalized Benders decomposition (GBD) algorithm is applied to decompose the coordinated OPF model into a master problem and relaxed subproblems and solves them iteratively to get optimal solution. The GBD optimal and feasible cutting planes generated in a branch node are proved to be valid for its descendants. Moreover, three acceleration techniques are introduced into the proposed algorithm to improve computational efficiency. Finally, the effectiveness and accuracy of the proposed method are verified via simulation tests in Jinzhai DNs of China.

42 ENGINEERING↗

maestro

MÆSTRO stands for Multi-fidelity Adaptive Ensemble Stochastic Trust Region Optimization and it is a plug n play derivate fee stochastic optimization solver. The problem being considered in MÆSTRO involves fitting Monte Carlo simulations that describe complex phenomena to experiments. This is done by finding parameters of the resource intensive and noisy simulation that yield the least squares objective function value to the noisy experimental data. This problem is solved using a stochastic trust-region optimization algorithm where in each iteration, a local approximation of the simulation signal and of the simulation noise is constructed over data, which is obtained by running the simulation at strategically placed design points within the trust-region around the current iterate. Then the simulation components of the objective are replaced by their approximations and this analytical and closed-form optimization problem is solved to find the next iterate within the trust-region. Then the trust region is moved and the iterations continue until a satisfactory convergence criteria is met.

KRISHNAMOORTHY, MOHAN↗

LTAU-FF: Loss Trajectory Analysis for Uncertainty in atomistic Force Fields

LTAU (Loss Trajectory Analysis for Uncertainty) is a technique for estimating the uncertainty in a model's predictions for any regression task by approximating the cumulative distribution function (CDF) of the model's errors over the course of training. The approximated CDF, combined with a similarity search algorithm in the model's descriptor space, can then be used to estimate the likelihood that the model's predictions on any given test point will fall below a chosen threshold. LTAU-FF (LTAU in atomistic Force Fields) is the application of LTAU specifically for use with atomistic force fields.

Vita, JoshuaA↗

Texas Hydrogen Highway Fuel Cell Hybrid Bus and Fueling Infrastructure Technology Showcase (Final Scientific/Technical Report)

The Texas Hydrogen Highway project has showcased a hydrogen fuel cell transit bus and hydrogen fueling infrastructure that was designed and built through previous support from various public and private sector entities. The aim of this project has been to increase awareness among transit agencies and other public entities on these transportation technologies, and to place such technologies into commercial applications, such as a public transit agency. The initial project concept developed in 2004 was to show that a skid-mounted, fully-integrated, factory-built and tested hydrogen fueling station could be used to simplify the design, and lower the cost of fueling infrastructure for fuel cell vehicles. The approach was to design, engineer, build, and test the integrated fueling station at the factory then install it at a site that offered educational and technical resources and provide an opportunity to showcase both the fueling station and advanced hydrogen vehicles. The two primary technology components include: Hydrogen Fueling Station: The hydrogen fueling infrastructure was designed and built by Gas Technology Institute primarily through a funding grant from the Texas Commission on Environmental Quality. It includes hydrogen production, clean-up, compression, storage, and dispensing. The station consists of a steam methane reformer, gas clean-up system, gas compressor and 48 kilograms of hydrogen storage capacity for dispensing at 5000 psig. The station is skid-mounted for easy installation and can be relocated if needed. It includes a dispenser that is designed to provide temperature compensated fills using a control algorithm. The total station daily capacity is approximately 50 kilograms. Fuel Cell Bus: The transit passenger bus built by Ebus, a company located in Downey, CA, was commissioned and acquired by GTI prior to this project. It is a fuel cell plug-in hybrid electric vehicle which is ADA compliant, has air conditioning sufficient for Texas operations, and regenerative braking for battery charging. It uses a 19.3 kW Ballard PEM fuel cell, will store 12.6 kg of hydrogen at 350 Bar, and includes a 60 kWh battery storage system. The objectives of the project included the following: (a) To advance commercialization of hydrogen-powered transit buses and supporting infrastructure; (b) To provide public outreach and education by showcasing the operation of a 22-foot fuel cell hybrid shuttle bus and Texas first hydrogen fueling infrastructure; and (c) To showcase operation of zero-emissions vehicle for potential transit applications. As mentioned above, the project successfully demonstrated an early vehicle technology, the Ebus plug-in hybrid fuel cell bus, and that success has led to the acquisition of a more advanced vehicle that can take advantage of the same fueling infrastructure. Needed hydrogen station improvements have been identified that will enhance the capabilities of the fueling infrastructure to serve the new bus and to meet the transit agency needs. Over the course of this project, public officials, local government staff, and transit operators were engaged in outreach and education activities that acquainted them with the real world operation of a fuel cell bus and fueling infrastructure. Transit staff members in the Dallas/Ft. Worth region were invited to a workshop in Arlington, Texas at the North Central Texas Council of Governments to participate in a workshop on hydrogen and fuel cells, and to see the fuel cell bus in operation. The bus was trucked to the meeting for this purpose so that participants could see and ride the bus. Austin area transit staff members visited the fueling site in Austin to be briefed on the bus and to participate in a fueling demonstration. This led to further meetings to determine how a fuel cell bus and fueling station could be deployed at Capital Metro Transit. Target urban regions that expressed additional interest during the project in response to the outreach meetings and showcase events include San Antonio and Austin, Texas. In summary, the project objectives were achieved in the following ways: Through presentations and papers provided to a variety of audiences in multiple venues, the project team fulfilled its goal of providing education and outreach on hydrogen technology to statewide audiences. The project team generated interest that exists well beyond the completion of the project, and indeed, helped to generate financial support for a subsequent hydrogen vehicle project in Austin. The University of Texas, Center for ElectroMechanics operated the fuel cell-electric Ebus vehicle for over 13,000 miles in Austin, Texas in a variety of routes and loading configurations. The project took advantage of prior efforts that created a hydrogen fueling station and fuel cell electric-hybrid bus and continued to verify their technical foundation, while informing and educating potential future users of how these technologies work.

03 NATURAL GAS↗