Search NASA⌕ Search

SEARCH · Search NASA

Results for “discrete optimization”

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,369 records · Page 76

The Mimetic Finite Element Method and the Virtual Element Method for elliptic problems with arbitrary regularity

We develop and analyze a new family of virtual element methods on unstructured polygonal meshes for the diffusion problem in primal form, that use arbitrarily regular discrete spaces V h $\subset$ C α } ϵ $\mathbb{N}$. The degrees of freedom are (a) solution and derivative values of various degree at suitable nodes and (b) solution moments inside polygons. The convergence of the method is proven theoretically and an optimal error estimate is derived. The connection with the Mimetic Finite Difference method is also discussed. Numerical experiments confirm the convergence rate that is expected from the theory.

97 MATHEMATICS AND COMPUTING↗

Foundations of Feature Selection and Classification for Non-Gaussian Distributed Targets

This report describes the author’s research toward creating algorithms for selecting useful statistical features in pattern/target classification problems in which the features are non-Gaussian distributed. In engineering practice, it is common to either (1) Not perform any feature selection procedure, or (2) Use a feature selection algorithm that assumes the features are Gaussian distributed. This process can be far from optimal if the data are actually non-Gaussian, as they frequently are in practice. This research has the goal of mitigating that problem by creating a useful algorithm that can be used in practice. The approach is to focus on the performance indices used in common feature selection algorithms, such as Branch and Bound algorithms and the Sequential Forward Selection Algorithm. Ordinarily, the performance index used to measure the class separation in feature space involves assuming the data are Gaussian and deriving tractable performance indices that use closed form equations that represent the probability density functions of the class data. The advantage of this approach is that it produces feature selection algorithms that have low computational complexity and do not require knowledge of the actual data densities. The disadvantage is that these algorithms may not perform reasonably when the data are non-Gaussian, as they commonly are in practice. This research examines the use of information-theoretic class separability measures that can deal with the non-Gaussian case. In particular, this work shows that the Hellinger Distance (a divergence measure), has very desirable mathematical properties and can be useful for feature selection. The work in this paper employs a multivariate kernel density estimator along with the Hellinger Distance and an optimal subset selection algorithm to do feature selection. This report (1) Defines the classification and feature selection problems, (2) Describes the continuous variable Hellinger distance in one dimension and discusses its mathematical properties in comparison with other distance measures, (3) Develops the discrete variable Hellinger distance expression for one and two dimensions, and shows that the discrete Hellinger distance for multiple dimensions is a straightforward extension, and (4) Presents experimental density estimation results using a new MATLAB implementation of a multivariate kernel density estimator. The draft of this report served as a starting point for Ensign Matthew Wilder’s MSEE thesis work at the Naval Postgraduate School (NPS) in 2010 and 2011. Ensign Wilder completed his thesis and graduated from NPS in June 2011 (M. J. Wilder, “Automatic Target Recognition: Statistical Feature Selection of Non-Gaussian Distributed Target Classes,” MSEE Thesis, Naval Postgraduate School, Thesis Advisor: Grace A. Clark, Second Reader: Monique P. Fargues, June 2011). In the thesis, Ensign Wilder created implementations of the Branch and Bound and Sequential Feature Selection algorithms, extended the multivariate kernel density estimator code, and evaluated the performance of Hellinger Distance-based feature selection algorithms using both simulated data and data from a real-world benchmark data set. The new algorithm was shown to be very effective for both Gaussian and non-Gaussian data sets. The advantages gained for non-Gaussian data come at the cost of increased computational complexity. Using a laptop computer for practical problems, we generally use initial feature vectors containing no more than about ten or twelve features. Proposed future research lies in creating faster kernel density estimator algorithms that would allow for the use of higher dimensional data.

42 ENGINEERING↗

Computing the Properties of Hadrons, Nuclei, and Nuclear Matter from Quantum Chromodynamics, UNC-CH Final Report.

This is the final technical report for the UNC-CH component of a SciDAC3 project. This project served to coordinate the software development effort which the nuclear physics lattice QCD community is developing to ensure that lattice calculations can make optimal use of forthcoming leadership-class and dedicated hardware, including those of the national laboratories, and prepares for the exploitation of future computational resources in the exascale era. The project developed and optimized simulation software for lattice QCD calculations on leadership class computers and on GPUaccelerated heterogeneous architectures. The participating team at multiple instritutions improved and extended software libraries (Chroma, CPS, MILC, QLUA, QPhiX, QDP++, QDP-jit) by providing interfaces for heterogeneous computing environments and through the optimization of gauge field evolution algorithms and sparse matrix inverters. The former includes the development of new multi-time scale integrators and the latter focused on the development of new multi-grid and domain decomposition inverters for several QCD fermion discretization schemes. The sub-project at the University of North Carolina worked towards the development a domain specific language for lattice QCD computations with the express purpose of generating code with uncompromised performance.

97 MATHEMATICS AND COMPUTING↗

Tracking and Rejection of Biased Sinusoidal Signals Using Generalized Predictive Controller

Some novel applications require the tracking/rejection of biased sinusoidal reference/distur-bances. According to the internal model principle (IMP), a controller must embed the model of a biased sinusoidal signal to track references and also reject perturbations modeled through the aforementioned signal. However, the design of that kind of controller is not straightforward, especially when they are implemented in digital processors. This paper presents a controller, based on generalized predictive control (GPC), designed for tracking/rejection of biased sinusoidal signals. In general, GPC is based on the prediction of the plant responses through an augmented prediction model. The proposed approach develops an augmented model that predicts the future errors. The prediction model and the control law used in the proposed approach embed the discrete-time model of a biased sinusoidal signal. Thus, the proposed controller can track/reject biased sinusoidal references/disturbances. The predicted errors and the future inputs of the proposed augmented model are used to define the cost function that measures the control performance. An optimization technique was applied to obtain the solution of the cost function, which is the optimal sequence of future model inputs that allows defining the control law. Experimental tests prove that the proposed controller can asymptotically track and reject biased sinusoidal signals.

42 ENGINEERING↗

Analog Module Architecture for Space-Qualified Field-Programmable Mixed-Signal Arrays

Spacecraft require all manner of both digital and analog circuits. Onboard digital systems are constructed almost exclusively from field-programmable gate array (FPGA) circuits providing numerous advantages over discrete design including high integration density, high reliability, fast turn-around design cycle time, lower mass, volume, and power consumption, and lower parts acquisition and flight qualification costs. Analog and mixed-signal circuits perform tasks ranging from housekeeping to signal conditioning and processing. These circuits are painstakingly designed and built using discrete components due to a lack of options for field-programmability. FPAA (Field-Programmable Analog Array) and FPMA (Field-Programmable Mixed-signal Array) parts exist but not in radiation-tolerant technology and not necessarily in an architecture optimal for the design of analog circuits for spaceflight applications. This paper outlines an architecture proposed for an FPAA fabricated in an existing commercial digital CMOS process used to make radiation-tolerant antifuse-based FPGA devices. The primary concerns are the impact of the technology and the overall array architecture on the flexibility of programming, the bandwidth available for high-speed analog circuits, and the accuracy of the components for high-performance applications.

Edwards, R. Timothy↗

A continuous surface reconstruction method on point cloud captured from a 3D surface photogrammetry system

Purpose: To accurately and efficiently reconstruct a continuous surface from noisy point clouds captured by a surface photogrammetry system (VisionRT). Methods: The authors have developed a level-set based surface reconstruction method on point clouds captured by a surface photogrammetry system (VisionRT). The proposed method reconstructs an implicit and continuous representation of the underlying patient surface by optimizing a regularized fitting energy, offering extra robustness to noise and missing measurements. By contrast to explicit/discrete meshing-type schemes, their continuous representation is particularly advantageous for subsequent surface registration and motion tracking by eliminating the need for maintaining explicit point correspondences as in discrete models. The authors solve the proposed method with an efficient narrowband evolving scheme. The authors evaluated the proposed method on both phantom and human subject data with two sets of complementary experiments. In the first set of experiment, the authors generated a series of surfaces each with different black patches placed on one chest phantom. The resulting VisionRT measurements from the patched area had different degree of noise and missing levels, since VisionRT has difficulties in detecting dark surfaces. The authors applied the proposed method to point clouds acquired under these different configurations, and quantitatively evaluated reconstructed surfaces by comparing against a high-quality reference surface with respect to root mean squared error (RMSE). In the second set of experiment, the authors applied their method to 100 clinical point clouds acquired from one human subject. In the absence of ground-truth, the authors qualitatively validated reconstructed surfaces by comparing the local geometry, specifically mean curvature distributions, against that of the surface extracted from a high-quality CT obtained from the same patient. Results: On phantom point clouds, their method achieved submillimeter reconstruction RMSE under different configurations, demonstrating quantitatively the faith of the proposed method in preserving local structural properties of the underlying surface in the presence of noise and missing measurements, and its robustness toward variations of such characteristics. On point clouds from the human subject, the proposed method successfully reconstructed all patient surfaces, filling regions where raw point coordinate readings were missing. Within two comparable regions of interest in the chest area, similar mean curvature distributions were acquired from both their reconstructed surface and CT surface, with mean and standard deviation of (μ{sub recon} = − 2.7 × 10{sup −3} mm{sup −1}, σ{sub recon} = 7.0 × 10{sup −3} mm{sup −1}) and (μ{sub CT} = − 2.5 × 10{sup −3} mm{sup −1}, σ{sub CT} = 5.3 × 10{sup −3} mm{sup −1}), respectively. The agreement of local geometry properties between the reconstructed surfaces and the CT surface demonstrated the ability of the proposed method in faithfully representing the underlying patient surface. Conclusions: The authors have integrated and developed an accurate level-set based continuous surface reconstruction method on point clouds acquired by a 3D surface photogrammetry system. The proposed method has generated a continuous representation of the underlying phantom and patient surfaces with good robustness against noise and missing measurements. It serves as an important first step for further development of motion tracking methods during radiotherapy.

60 APPLIED LIFE SCIENCES↗

Model reduction of dynamical systems on nonlinear manifolds using deep convolutional autoencoders

Nearly all model-reduction techniques project the governing equations onto a linear subspace of the original state space. Such subspaces are typically computed using methods such as balanced truncation, rational interpolation, the reduced-basis method, and (balanced) proper orthogonal decomposition (POD). Unfortunately, restricting the state to evolve in a linear subspace imposes a fundamental limitation to the accuracy of the resulting reduced-order model (ROM). In particular, linear-subspace ROMs can be expected to produce low-dimensional models with high accuracy only if the problem admits a fast decaying Kolmogorov n -width (e.g., diffusion-dominated problems). Unfortunately, many problems of interest exhibit a slowly decaying Kolmogorov n-width (e.g., advection-dominated problems). To address this, we propose a novel framework for projecting dynamical systems onto nonlinear manifolds using minimum-residual formulations at the time-continuous and time-discrete levels; the former leads to manifold Galerkin projection, while the latter leads to manifold least-squares Petrov–Galerkin (LSPG) projection. We perform analyses that provide insight into the relationship between these proposed approaches and classical linear-subspace reduced-order models; we also derive a posteriori discrete-time error bounds for the proposed approaches. In addition, we propose a computationally practical approach for computing the nonlinear manifold, which is based on convolutional autoencoders from deep learning. Lastly, we demonstrate the ability of the method to significantly outperform even the optimal linear-subspace ROM on benchmark advection-dominated problems, thereby demonstrating the method's ability to overcome the intrinsic n -width limitations of linear subspaces.

97 MATHEMATICS AND COMPUTING↗

Characterization of purified Sindbis virus nsP4 RNA-dependent RNA polymerase activity in vitro

The Sindbis virus RNA-dependent RNA polymerase (nsP4) is responsible for the replication of the viral RNA genome. In infected cells, nsP4 is localized in a replication complex along with the other viral non-structural proteins. nsP4 has been difficult to homogenously purify from infected cells due to its interactions with the other replication proteins and the fact that its N-terminal residue, a tyrosine, causes the protein to be rapidly turned over in cells. We report the successful expression and purification of Sindbis nsP4 in a bacterial system, in which nsP4 is expressed as an N-terminal SUMO fusion protein. After purification the SUMO tag is removed, resulting in the isolation of full-length nsP4 possessing the authentic N-terminal tyrosine. This purified enzyme is able to produce minus-strand RNA de novo from plus-strand templates, as well as terminally add adenosine residues to the 3' end of an RNA substrate. In the presence of the partially processed viral replicase polyprotein, P123, purified nsP4 is able to synthesize discrete template length minus-strand RNA products. Mutations in the 3' CSE or poly(A) tail of viral template RNA prevent RNA synthesis by the replicase complex containing purified nsP4, consistent with previously reported template requirements for minus-strand RNA synthesis. Optimal reaction conditions were determined by investigating the effects of time, pH, and the concentrations of nsP4, P123 and magnesium on the synthesis of RNA.

60 APPLIED LIFE SCIENCES↗

Improving Precipitation Estimation Using Convolutional Neural Network

Precipitation process is generally considered to be poorly represented in numerical weather/climate models. Statistical downscaling (SD) methods, which relate precipitation with model resolved dynamics, often provide more accurate precipitation estimates compared to model's raw precipitation products. Herein we introduce the convolutional neural network model to foster this aspect of SD for daily precipitation prediction. Specifically, we restrict the predictors to the variables that are directly resolved by discretizing the atmospheric dynamics equations. In this sense, our model works as an alternative to the existing precipitation-related parameterization schemes for numerical precipitation estimation. We train the model to learn precipitation-related dynamical features from the surrounding dynamical fields by optimizing a hierarchical set of spatial convolution kernels. We test the model at 14 geogrid points across the contiguous United States. Results show that provided with enough data, precipitation estimates from the convolutional neural network model outperform the reanalysis precipitation products, as well as SD products using linear regression, nearest neighbor, random forest, or fully connected deep neural network. Evaluation for the test set suggests that the improvements can be seamlessly transferred to numerical weather modeling for improving precipitation prediction. Based on the default network, we examine the impact of the network architectures on model performance. Also, we offer simple visualization and analyzing approaches to interpret the models and their results. Our study contributes to the following two aspects: First, we offer a novel approach to enhance numerical precipitation estimation; second, the proposed model provides important implications for improving precipitation-related parameterization schemes using a data-driven approach.

54 ENVIRONMENTAL SCIENCES↗

High-throughput micro-scale bandgap mapping for perovskite-inspired materials with complex composition space

Abstract To realize the full promise of high-throughput experimental workflows, the rate of sample synthesis must be matched by that of characterization. Of growing interest are contactless optical techniques that can rapidly measure material homogeneity and properties. Here, we present a hyperspectral imaging method to measure local optical bandgap distributions within samples, utilizing spatially-resolved reflectance spectra coupled with automated data analysis. We collect approximately one million optical bandgap data across the compositional space of Cs 3 (Bi x Sb 1-x ) 2 (Br y I 1-y ) 9 perovskite-inspired materials. Our results show non-monotonic bandgap variations (i.e., bandgap bowing) along six composition gradient sequences, in addition to identifying samples with multiple bandgaps in statistics. High-throughput transient absorption spectroscopy reveals that within these compositions, the depletion of the ground state carriers to excited states occurred at discrete energy levels with independent carrier dynamics, consistent with the bandgap observation and indicative of phase separation. This work demonstrates the potential for rapid optical measurements to assess material quality and homogeneity in a high-throughput experimental setting, supporting screening and recipe optimization of optoelectronic material candidates with desired carrier dynamics and optical properties.

Science & Technology - Other Topics↗

Perturbation theory under the truncated Wigner approximation: How system-environment entanglement formation drives quantum decoherence

In discrete quantum systems, quantum decoherence is the disappearance of simple phase relations as a result of interactions with an environment. For many applications, the question is not necessarily how to avoid (inevitable) system-environment interactions, but rather how to design environments that optimally preserve a system's phase relations in spite of such interactions. The formation of system-environment entanglement is a major driving mechanism for decoherence, and a detailed understanding of this process could inform strategies for conserving coherence optimally. This requires scalable, flexible, and systematically improvable quantum dynamical methods that retain detailed information about the entanglement properties of the environment, yet very few current methods offer this combination of features. Here, in this work, we address this need by introducing a theoretical framework wherein we combine the truncated Wigner approximation with standard time-dependent perturbation theory, allowing for computing expectation values of operators in the combined system-environment Hilbert space. We demonstrate the utility of this framework by applying it to the spin-boson model, representative of qubits and simple donor-acceptor systems. For this model, our framework provides an analytical description of perturbative contributions to expectation values. We monitor how quantum decoherence at zero temperature is accompanied by entanglement formation with individual environmental degrees of freedom. Based on this entanglement behavior, we find that the selective suppression of low-frequency environmental modes is particularly effective for mitigating quantum decoherence.

74 ATOMIC AND MOLECULAR PHYSICS↗

Entanglement, EPR steering, and Bell-nonlocality criteria for multipartite higher-spin systems

We develop criteria to detect three classes of nonlocality that have been shown by Wiseman et al. [Phys. Rev. Lett. 98, 140402 (2007)] to be nonequivalent: entanglement, EPR steering, and the failure of local hidden-variable theories. We use the approach of Cavalcanti et al. [Phys. Rev. Lett. 99, 210405 (2007)] for continuous variables to develop the nonlocality criteria for arbitrary spin observables defined on a discrete Hilbert space. The criteria thus apply to multisite qudits, i.e., systems of fixed dimension d, and take the form of inequalities. We find that the spin moment inequalities that test local hidden variables (Bell inequalities) can be violated for arbitrary d by optimized highly correlated nonmaximally entangled states provided the number of sites N is high enough. On the other hand, the spin inequalities for entanglement are violated and thus detect entanglement for such states, for arbitrary d and N, and with a violation that increases with N. We show that one of the moment entanglement inequalities can detect the entanglement of an arbitrary generalized multipartite Greenberger-Horne-Zeilinger state. Because they involve the natural observables for atomic systems, the relevant spin-operator correlations should be readily observable in trapped ultracold atomic gases and ion traps.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fermionic Partial Tomography via Classical Shadows

Here we propose a tomographic protocol for estimating any k-body reduced density matrix (k-RDM) of an n-mode fermionic state, a ubiquitous step in near-term quantum algorithms for simulating many-body physics, chemistry, and materials. Our approach extends the framework of classical shadows, a randomized approach to learning a collection of quantum-state properties, to the fermionic setting. Our sampling protocol uses randomized measurement settings generated by a discrete group of fermionic Gaussian unitaries, implementable with linear-depth circuits. We prove that estimating all k-RDM elements to additive precision ϵ requires on the order of ($^{n}_{k}$)k 3/2 log(n)/ϵ 2 repeated state preparations, which is optimal up to the logarithmic factor. Furthermore, numerical calculations show that our protocol offers a substantial improvement in constant overheads for k ≥ 2, as compared to prior deterministic strategies. We also adapt our method to particle-number symmetry, wherein the additional circuit depth may be halved at the cost of roughly 2–5 times more repetitions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Surface Modification of ICF Target Capsules by Pulsed Laser Ablation

Topographical modifications of spherical surfaces are imprinted on National Ignition Facility (NIF) target capsules by extending the capabilities of a recently developed full surface (4π) laser ablation and mapping apparatus. The laser ablation method combines the precision, energy density and long reach of a focused laser beam to pre-impose sinusoidal modulations on the outside surface of High Density Carbon (HDC) capsules and the inside surface of Glow Discharge Polymer (GDP) capsules. Sinusoidal modulations described in this paper have sub-micron to 10’s of microns vertical scale and wavelengths as small as 30 μm and as large as 200 μm. The modulated patterns are created by rastering a focused laser fired at discrete capsule surface locations for a specified number of pulses. The computer program developed to create these raster patterns uses inputs such as laser beam intensity profile, the material removal function, the starting surface figure and the desired surface figure. The patterns are optimized to minimize surface roughness. Lastly, in this paper, simulated surfaces are compared with actual ablated surfaces measured using confocal microscopy.

36 MATERIALS SCIENCE↗

A Scalable Solution Framework for Stochastic Transmission and Generation Planning Problems. Draft

Current commercial software tools for transmission and generation investment planning have limited stochastic modeling capabilities. Because of this limitation, electric power utilities generally rely on scenario planning heuristics to identify potentially robust and cost effective investment plans for a broad range of system, economic, and policy conditions. Several research studies have shown that stochastic models perform significantly better than deterministic or heuristic approaches, in terms of overall costs. However, there is a lack of practical solution approaches to solve such models. In this paper we propose a scalable decomposition algorithm to solve stochastic transmission and generation planning problems, respectively considering discrete and continuous decision variables for transmission and generation investments. Given stochasticity restricted to loads and wind, solar, and hydro power output, we develop a simple scenario reduction framework based on a clustering algorithm, to yield a more tractable model. The resulting stochastic optimization model is decomposed on a scenario basis and solved using a variant of the Progressive Hedging (PH) algorithm. We perform numerical experiments using a 240-bus network representation of the Western Electricity Coordinating Council in the US. Although convergence of PH to an optimal solution is not guaranteed for mixed-integer linear optimization models, we find that it is possible to obtain solutions with acceptable optimality gaps for practical applications. Our numerical simulations are performed both on a commodity workstation and on a high-performance cluster. The results indicate that large-scale problems can be solved to a high degree of accuracy in at most two hours of wall clock time.

24 POWER TRANSMISSION AND DISTRIBUTION↗

The Art of Automation: Translating Electron Microscopy Workflows Into Automated Processes

Acquiring data using a scanning transmission electron microscope (STEM) is a complex, multi-step process. The intricacy of the process depends on the type of sample, composition of the material, desired results of the experiment, resolution requirement and other experimental factors. Each experiment presents unique complications, such as sample drift and contamination, that the microscopist must consider when acquiring data. All these challenges are handled fluidly and expertly by experienced microscopists, but to reach new levels of innovation in material development, including greater reproducibility, throughput, and precision, the automation of these workflows is essential. The initial phase of this work involved translating intuition-based workflows into discrete, programmable steps. Some common key stages in STEM workflows are the initial tuning, scanning the sample for areas of interest, and then acquiring the data. Each stage can be broken further into specific parameter adjustments, such as aberration correction and dwell time optimization, depending on the experiment. When deconstructing various experiments each step was assessed for automation feasibility based on the amount of real time operator decisions. There are steps that lend themselves to automation more readily than others, such as course focusing and sample screening, but there is potential for full automation of all stages with time. As an initial step, an automated montage routine was developed, allowing for the efficient acquisition of large portions of the sample without requiring continuous intervention from the operator. The automation of this small process of the procedure demonstrates the value of this capability. A major challenge in automation arises from discrepancies between commanded, reported and actual stage movements. Using systematic tests, stage movement was quantified. This error can be corrected algorithmically for more accurate workflows in the future. Expanding automation capabilities would result in larger, more efficient data acquisition which allows for more robust statistical analysis. Additionally, this work lays the groundwork for a closed loop system where machine learning algorithms would intake automatically acquired data and make real time decisions. By progressively automating this instrument, this work establishes the foundation for fully automated experimentation in transmission electron microscopy.

97 MATHEMATICS AND COMPUTING↗

Investigations of remote sensing techniques for early detection of Dutch elm disease

Several forms of aerial photography were pursued in quest of a technique which could provide early detection of Dutch elm disease. The two most promising techniques tested were multispectral photography with object enhancement and biband ratioing coupled with scanning microdensitometry. For practical purposes the multispectral system has the advantage of providing a readily interpretable image in a relatively short time. Laboratory studies indicated that less emphasis should be placed on the use of a red filter or the near infrared beyond 750 mm for early detection of stress within a single plant species. Color infrared film would be optimal when used for a long term detection of loss of plant vigor which results in a physical change in a plant canopy, but should find minimal practicality for early detection of specific sources of plant stress such as Dutch elm disease. Considerable discretion should be used when interpreting imagery on copy film because of loss of resolution and color definition.

Hammerschlag, R. S.↗

Multi-anode microchannel arrays - New detectors for imaging and spectroscopy in space

Consideration is given to the construction and operation of multi-anode microchannel array detector systems having formats as large as 256 x 1024 pixels. Such arrays are being developed for imaging and spectroscopy at soft X-ray, ultraviolet and visible wavelengths from balloons, sounding rockets and space probes. Both discrete-anode and coincidence-anode arrays are described. Two types of photocathode structures are evaluated: an opaque photocathode deposited directly on the curved-channel MCP and an activated cathode deposited on a proximity-focused mesh. Future work will include sensitivity optimization in the different wavelength regions and the development of detector tubes with semitransparent proximity-focused photocathodes.

Timothy, J. G.↗