Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algorithm Development”

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,711 records · Page 95

Development and applications of algorithms for calculating the transonic flow about harmonically oscillating wings

A finite difference method to solve the unsteady transonic flow about harmonically oscillating wings was investigated. The procedure is based on separating the velocity potential into steady and unsteady parts and linearizing the resulting unsteady differential equation for small disturbances. The differential equation for the unsteady velocity potential is linear with spatially varying coefficients and with the time variable eliminated by assuming harmonic motion. An alternating direction implicit procedure was investigated, and a pilot program was developed for both two and three dimensional wings. This program provides a relatively efficient relaxation solution without previously encountered solution instability problems. Pressure distributions for two rectangular wings are calculated. Conjugate gradient techniques were developed for the asymmetric, indefinite problem. The conjugate gradient procedure is evaluated for applications to the unsteady transonic problem. Different equations for the alternating direction procedure are derived using a coordinate transformation for swept and tapered wing planforms. Pressure distributions for swept, untaped wings of vanishing thickness are correlated with linear results for sweep angles up to 45 degrees.

Ehlers, F. E.↗

U31: Vehicle Stability and Dynamics: Electronic Stability Control

A team led by NTRCI is working to improve the roll and yaw stability of heavy duty combination trucks through developing stability algorithms, assembling demonstration hardware, and investigating robust wireless communication. Modern electronic stability control (ESC) products automatically slow a vehicle rounding a corner too quickly or apply individual brakes when necessary to improve the steering characteristics of a vehicle. Air brake systems in North America provide no electronic communication between a tractor and semitrailer, limiting the degree to which control systems can be optimized. Prior research has demonstrated stability improvements where dynamic measurements and control commands are communicated between units of a vehicle. Three related activities were undertaken: (1) Develop an algorithm for the optimum yaw and roll control of a combination vehicle. Vehicle state parameters needed to control the vehicle and the proper brake response were determined. An integrated stability control for the tractor and semitrailer requires communication between the two units. Dynamic models were used to assess the algorithm. (2) Implement the ESC algorithm in the laboratory. Hardware components suitable for the harsh environment for measurement, sensor-to-controller communication, and semitrailer-to-tractor communication and brake actuation were specified and assembled as a working system. The goal was to collect the needed vehicle state information, transmit the information to the ESC system, and then actuate the brakes in response to controller commands. (3) Develop a wireless network with the data rate and reliability necessary to communicate dynamic signals for a vehicle stability control system. Adaptive connectivity-aware, multi-hop routing was selected because it can perform in the harsh environment where packet collisions and fading often will exist. The protocol is to give high priority to urgent messages.

99 GENERAL AND MISCELLANEOUS↗

Development of Cloud and Precipitation Property Retrieval Algorithms and Measurement Simulators from ASR Data

What has made the ASR program unique is the amount of information that is available. The suite of recently deployed instruments significantly expands the scope of the program (Mather and Voyles, 2013). The breadth of this information allows us to pose sophisticated process-level questions. Our ASR project, now entering its third year, has been about developing algorithms that use this information in ways that fully exploit the new capacity of the ARM data streams. Using optimal estimation (OE) and Markov Chain Monte Carlo (MCMC) inversion techniques, we have developed methodologies that allow us to use multiple radar frequency Doppler spectra along with lidar and passive constraints where data streams can be added or subtracted efficiently and algorithms can be reformulated for various combinations of hydrometeors by exchanging sets of empirical coefficients. These methodologies have been applied to boundary layer clouds, mixed phase snow cloud systems, and cirrus.

54 ENVIRONMENTAL SCIENCES↗

Big Data Mining for Assessing Calibration of Building Energy Models

Residential and commercial buildings in China, India, the United States (US), United Kingdom (UK), and Italy consume 39-45% of each nation's primary energy. Building energy models can be used to automatically optimize the return-on-investment for retrofits to improve a building’s energy efficiency. However, with an average of 3,000 building descriptors necessary to accurately simulate a single building, there is a market need to reduce the transaction cost for creating a more robust model for simulating every building in a city and accurately estimate savings prior to capital expenditures.We used two of the world’s fastest supercomputers, assembled unique datasets, and developed innovative algorithms for big data mining to assess different methods to create an accurate building energy model. The team has leveraged a total of eight high performance computing resources and 218 servers to analyze the best methods, metrics, and algorithms for creating an accurate building energy model beyond current industry standards necessary for private-sector financing. The project developed the world’s fastest buildings simulator, has completed over 8 million simulations totaling over 300TB, and mined this data with over 130,000 parallel artificial intelligence algorithms. This was used to quantify accuracy of AI-developed calibration algorithms with results that surpass industry standard guidelines and can identify individual building parameters to between 15% and 32% of their actual value.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

SORIS - A standoff radiation imaging system

The detection of radiological and special nuclear material within the country’s borders is a crucial component of the national security network. Being able to detect small amounts of radiological material at large distances is especially important for search applications. To provide this capability General Electric’s Research Center has developed, as a part of DNDO’s standoff radiation detection system advanced technology demonstration (SORDS-ATD) program, a standoff radiation imaging system (SORIS). This vehicle-based system is capable of detecting weak sources at large distances in relatively short times. To accomplish this, GE has developed a novel coded aperture detector based on commercial components from GE Healthcare. An array of commercial gamma cameras modified to increase the system efficiency and energy range are used as position sensitive detectors. Unlike typical coded aperture systems, however, SORIS employs a non-planar mask and thus does not suffer the typical limitations of partially encoded regions giving it a wide field of view. Source identification is done using both low-statistics anomaly indicators and conventional high-statistics algorithms being developed by Pacific Northwest National Laboratory. The results of scanned areas and threats identified are displayed to the user and overlaid on satellite imagery.commercial components from GE Healthcare. An array of commercial gamma cameras modified to increase the system efficiency and energy range are used as position sensitive detectors. Unlike typical coded aperture systems, however, SORIS employs a non-planar mask and thus does not suffer the typical limitations of partially encoded regions giving it a wide field of view. Source identification is done using both low-statistics anomaly indicators and conventional high-statistics algorithms being developed by Pacific Northwest National Laboratory. The results of scanned areas and threats identified are displayed to the user and overlaid on satellite imagery.

Coded aperture imager↗

Molecular Assemblies, Genes and Genomics Integrated Efficiently (MAGGIE)

Final report on MAGGIE. We set ambitious goals to model the functions of individual organisms and their community from molecular to systems scale. These scientific goals are driving the development of sophisticated algorithms to analyze large amounts of experimental measurements made using high throughput technologies to explain and predict how the environment influences biological function at multiple scales and how the microbial systems in turn modify the environment. By experimentally evaluating predictions made using these models we will test the degree to which our quantitative multiscale understanding wilt help to rationally steer individual microbes and their communities towards specific tasks. Towards this end we have made substantial progress towards understanding evolution of gene families, transcriptional structures, detailed structures of keystone molecular assemblies (proteins and complexes), protein interactions, biological networks, microbial interactions, and community structure. Using comparative analysis we have tracked the evolutionary history of gene functions to understand how novel functions evolve. One level up, we have used proteomics data, high-resolution genome tiling microarrays, and 5' RNA sequencing to revise genome annotations, discover new genes including ncRNAs, and map dynamically changing operon structures of five model organisms: For Desulfovibrio vulgaris Hildenborough, Pyrococcus furiosis, Sulfolobus solfataricus, Methanococcus maripaludis and Haiobacterium salinarum NROL We have developed machine learning algorithms to accurately identify protein interactions at a near-zero false positive rate from noisy data generated using tagfess complex purification, TAP purification, and analysis of membrane complexes. Combining other genome-scale datasets produced by ENIGMA (in particular, microarray data) and available from literature we have been able to achieve a true positive rate as high as 65% at almost zero false positives when applied to the manually curated training set. Applying this method to the data representing around a quarter of the fraction space for water soluble proteins in D. vulgaris, we obtained 854 reliable pair wise interactions. Further, we have developed algorithms to analyze and assign significance to protein interaction data from bait pull-down experiments and integrate these data with other systems biology data through associative biclustering in a parallel computing environment. We will 'fill-in' missing information in these interaction data using a 'Transitive Closure' algorithm and subsequently use 'Between Commonality Decomposition' algorithm to discover complexes within these large graphs of protein interactions. To characterize the metabolic activities of proteins and their complexes we are developing algorithms to deconvolute pure mass spectra, estimate chemical formula for m/z values, and fit isotopic fine structure to metabolomics data. We have discovered that in comparison to isotopic pattern fitting methods restricting the chemical formula by these two dimensions actually facilitates unique solutions for chemical formula generators. To understand how microbial functions are regulated we have developed complementary algorithms for reconstructing gene regulatory networks (GRNs). Whereas the network inference algorithms cMonkey and Inferelator developed enable de novo reconstruction of predictive models for GRNs from diverse systems biology data, the RegPrecise and RegPredict framework developed uses evolutionary comparisons of genomes from closely related organisms to reconstruct conserved regulons. We have integrated the two complementary algorithms to rapidly generate comprehensive models for gene regulation of understudied organisms. Our preliminary analyses of these reconstructed GRNs have revealed novel regulatory mechanisms and cis-regulatory motifs, as well asothers that are conserved across species. Finally, we are supporting scientific efforts in ENIGMA with data management solutions and by integrating all of the algorithms, software and data into a Knowledgebase. For instance, we have developed the RegPrecise database (http://regprecise.lbl.gov) which represents manually curated sets of regulons laying the basis for automatic annotation of regulatory interactions in closely related species. We are also in the midst of scaling up MicrobesOnline to handle the growing volume of sequence and functional genomics data. Over the last year our efforts have been focused on providing support for additional genomic and functional genomic data types. Similarly, we have developed several visualization tools to help with the exploration of complex systems biology datasets. A case in point is the Gaggle Genome Browser (GGB), which was enhanced with visualizations for plotting peptide detections and protein-DNA binding alongside transcriptome structure, plus the ability to interactively filter by signal intensity or p-value.

54 ENVIRONMENTAL SCIENCES↗

Development of SCRF Cavity Resonance Control Algorithms at Fermilab

Progress has been made at Fermilab on the development of feed-forward and feed-back algorithms used to compensate SCRF cavity detuning, which is caused by Lorentz Forces and microphonics. Algorithms that have been developed and tested for the 1.3GHz (ILC-style) SCRF cavities (Capture Cavity II) will be reported.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Formation Flying Design and Applications in Weak Stability Boundary Regions

Weak Stability regions serve as superior locations for interferometric scientific investigations. These regions are often selected to minimize environmental disturbances and maximize observing efficiency. Design of formations in these regions are becoming ever more challenging as more complex missions are envisioned. The development of algorithms to enable the capability for formation design must be further enabled to incorporate better understanding of WSB solution space. This development will improve the efficiency and expand the capabilities of current approaches. The Goddard Space Flight Center (GSFC) is currently supporting multiple formation missions in WSB regions. This end-to-end support consists of mission operations, trajectory design, and control. It also includes both algorithm and software development. The Constellation-X, Maxim, and Stellar Imager missions are examples of the use of improved numerical methods for attaining constrained formation geometries and controlling their dynamical evolution. This paper presents a survey of formation missions in the WSB regions and a brief description of the formation design using numerical and dynamical techniques.

Folta, David↗

Methodology for the Elimination of Reflection and System Vibration Effects in Particle Image Velocimetry Data Processing

A methodology to eliminate model reflection and system vibration effects from post processed particle image velocimetry data is presented. Reflection and vibration lead to loss of data, and biased velocity calculations in PIV processing. A series of algorithms were developed to alleviate these problems. Reflections emanating from the model surface caused by the laser light sheet are removed from the PIV images by subtracting an image in which only the reflections are visible from all of the images within a data acquisition set. The result is a set of PIV images where only the seeded particles are apparent. Fiduciary marks painted on the surface of the test model were used as reference points in the images. By locating the centroids of these marks it was possible to shift all of the images to a common reference frame. This image alignment procedure as well as the subtraction of model reflection are performed in a first algorithm. Once the images have been shifted, they are compared with a background image that was recorded under no flow conditions. The second and third algorithms find the coordinates of fiduciary marks in the acquisition set images and the background image and calculate the displacement between these images. The final algorithm shifts all of the images so that fiduciary mark centroids lie in the same location as the background image centroids. This methodology effectively eliminated the effects of vibration so that unbiased data could be used for PIV processing. The PIV data used for this work was generated at the NASA Langley Research Center Quiet Flow Facility. The experiment entailed flow visualization near the flap side edge region of an airfoil model. Commercial PIV software was used for data acquisition and processing. In this paper, the experiment and the PIV acquisition of the data are described. The methodology used to develop the algorithms for reflection and system vibration removal is stated, and the implementation, testing and validation of these algorithms are presented.

Bremmer, David M.↗

High-precision quantum algorithms for partial differential equations

Quantum computers can produce a quantum encoding of the solution of a system of differential equations exponentially faster than a classical algorithm can produce an explicit description. However, while high-precision quantum algorithms for linear ordinary differential equations are well established, the best previous quantum algorithms for linear partial differential equations (PDEs) have complexity poly(1/ϵ), where ϵ is the error tolerance. By developing quantum algorithms based on adaptive-order finite difference methods and spectral methods, we improve the complexity of quantum algorithms for linear PDEs to be poly(d,log(1/ϵ)), where d is the spatial dimension. Our algorithms apply high-precision quantum linear system algorithms to systems whose condition numbers and approximation errors we bound. We develop a finite difference algorithm for the Poisson equation and a spectral algorithm for more general second-order elliptic equations.

97 MATHEMATICS AND COMPUTING↗

Power Minimization techniques for Networked Data Centers.

Our objective is to develop a mathematical model to optimize energy consumption at multiple levels in networked data centers, and develop abstract algorithms to optimize not only individual servers, but also coordinate the energy consumption of clusters of servers within a data center and across geographically distributed data centers to minimize the overall energy cost and consumption of brown energy of an enterprise. In this project, we have formulated a variety of optimization models, some stochastic others deterministic, and have obtained a variety of qualitative results on the structural properties, robustness, and scalability of the optimal policies. We have also systematically derived from these models decentralized algorithms to optimize energy efficiency, analyzed their optimality and stability properties. Finally, we have conducted preliminary numerical simulations to illustrate the behavior of these algorithms. We draw the following conclusion. First, there is a substantial opportunity to minimize both the amount and the cost of electricity consumption in a network of datacenters, by exploiting the fact that traffic load, electricity cost, and availability of renewable generation fluctuate over time and across geographical locations. Judiciously matching these stochastic processes can optimize the tradeoff between brown energy consumption, electricity cost, and response time. Second, given the stochastic nature of these three processes, real-time dynamic feedback should form the core of any optimization strategy. The key is to develop decentralized algorithms that can be implemented at different parts of the network as simple, local algorithms that coordinate through asynchronous message passing.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

CyanoSCape: Freshwater Phytoplankton and Floating Aquatic Vegetation Biodiversity

In Southern Africa, the impacts of anthropogenic activities on biodiversity and ecosystem services are exacerbated by the climate crisis. Rapid land use change and the lack of emphasis on environmentally sustainable agricultural practices has hindered hydrological processes and compromised riverine and aquatic ecosystems. This poses obvious risks to natural/indigenous aquatic biodiversity and long-term ecosystem sustainability. Phytoplankton serve as the foundation of the freshwater food web with zooplankton as consumers, which feed fish, invertebrates, and so on up the food chain that comprises the biodiversity of the freshwater system that serves as habitat for biodiversity as well. The diversity of phytoplankton (microscopic organisms) includes photosynthesizing bacteria (cyanobacteria), plant-like diatoms, dinoflagellates, and green algae. Nutrient run-off from agricultural fertilizers and urban overflows, warm temperatures, abundant light availability and compromised hydrological systems provide an ideal environment for cyanobacteria to flourish. Increased prevalence of cyanobacteria, due to both natural and anthropogenic causes, can incur significant effects on the biodiversity of the overall phytoplankton assemblage. These bloom forming algae can significantly outcompete other phytoplankton classes in warmer and eutrophic waters where they are quick to dominate the freshwater system. Eutrophication and toxic cyanobacteria blooms (cyanoHABs) in the inland waters of the Greater Cape Floristic Region (GCFR) incur significant effects on the biodiversity of the overall phytoplankton assemblage and provide a favorable environment forthe overgrowth of floating aquatic vegetation (FAV), which is often invasive and associated with reduced aquatic biodiversity. The algal biodiversity of the GCFR’s freshwater systems is not well characterized. Hyperspectral optical observations are expected to facilitate the improvement of current phytoplankton functional type retrievals significantly, as the sensitivity is sufficient that the distinctive, fine spectral features of different phytoplankton groups can be detected. This will enable testing emerging algorithms and inform the development of new algorithms for use with upcoming hyperspectral satellite missions in this decade. Innovations in optical sensor sensitivity and next generation machine learning capabilities considerably enhance the potential for accurate and rapid detection of phytoplankton, namely the presence, extent, and diversity of cyanobacteria present in cyanoHABs and additionally, invasive FAV. Upcoming hyperspectral satellite missions such as NASA’s Surface Biology and Geology (SBG), Plankton, Aerosol, Cloud, ocean Ecosystem (PACE), and the European Space Agency’s Copernicus Hyperspectral Imaging Mission (CHIME) will provide imagery with unprecedented spectral and spatial resolution which will further enable the discovery of linkages between the seasonality and dynamics of HABs and FAV. The overarching goal of this project is to utilize hyperspectral data, with recently developed and next-generation algorithms, to determine the biodiversity of freshwater systems phytoplankton assemblage with emphasis on genus level distinction, as well as monitor the prevalence and diversity of FAV.

CyanoSCape↗

Development of Machine Learning Algorithms to Segment and Study Images of Astromaterial Samples

Introduction: Micrometer-scale chemical analyses of chondritic meteorites and mission-returned asteroid samples can reveal details of the physical and chemical processes operating in the early solar system, including processes that gave rise to planets, moons, and minor bodies. These primitive astromaterials are comprised of chondrules, calcium- and aluminum-rich inclusions (CAI), and many other silicates, oxides, metals, sulfides, and fine-grained materials. The chemical and mineralogical complexity of these samples, vast populations of different components, and heterogeneity across mm to km scales, all limit our understanding of the origin and evolution of these materials. Here, we describe recent efforts to use machine learning techniques to automate the segmentation of chemical maps of chondritic meteorites, designed to aid studies of asteroid samples returned by spacecraft. By automating the task of segmentation it will become possible to rapidly analyze and interpret the sizes, shapes, mineralogy, chemistry, and other properties of every chondrule, calcium- and aluminum-rich inclusion (CAI) and other clast within and between asteroid samples. Sample return missions significantly accelerate and heighten the need to develop such new data analysis techniques, and associated data repositories. Techniques: Neural networks require abundant training data, i.e. images which have been segmented by a human user. We have manually segmented data available from previous petrologic and chemical work at NASA Johnson Space Center and the American Museum of Natural History [1-4]. These data were derived from energy- and wavelength-dispersive X-ray spectroscopy (EDS, WDS) mapping of samples from many chondrite groups. The Deeplabv3+ [5] neural network architecture was trained on human-labeled masks and used to create machine-labeled masks. Several different algorithms were investigated, with inputs ranging from common RGB image formats through to hyperspectral datasets, with raw data comprising greyscale maps of Mg, Ca, and Al, with or without Si, Fe, Ti for both EDS and WDS data, and extending to other elements in EDS only. Each greyscale image was paired with a binary mask for each labelled particle type. Results: The trained algorithms can segment (Fig 1), classify, and measure the dimensions of thousands of particles in chemical maps of a standard 1-inch round petrographic section in seconds to minutes, rather than many hours needed by a human. Accuracy of the algorithms varied from chondrite to chondrite and across particle types. Further results and details of the algorithms will be presented at the workshop. Future directions: Machine learning has the potential to revolutionize our understanding of complex particle populations contained within primitive astromaterial, with segmentation being a critical first step. Example applications include better understanding of particle transport, nebular reservoirs, parent body accretion, and a deeper understanding of the relationships between particle populations and bulk rock elemental and isotopic compositions. In addition to benefits that machine learning can bring to individual researchers, building a community data repository of thousands to millions of particles across hundreds of samples will open up many other possibilities. For example, with a large enough dataset it will be possible to search for exceptionally closely matching particles across disparate samples. Such a capability would enable a single CAI from OSIRISREx or Hayabusa/II samples to be matched to chondritic CAIs that exhibit near-identical size, texture, and mineralogy, down to the level of similar core phenocrysts, zonation, and rim sequences. Such comparative analyses will help to disentangle precursor chemistry, chronology, gas/dust reservoirs during heating, and accretion. Such an endeavor would be impossible without machine learning and a large community data repository of astromaterial chemical/mineralogic maps.

Machine Learning↗

MCNP Simulation of Discrete Gamma-ray Spectra for PGNAA Applications

Prompt Gamma Neutron Activation (PGNAA) systems use the neutron-induced gamma-ray spectra from test objects in order to identify their compositions. The U.S. Army in particular uses these systems to identify the contents of field-recovered munitions in order to determine the presence of chemical warfare materiel (CWM) or explosives. These field-recovered munitions can have a variety of different fills, including experimental fills, have a large range of sizes, and be assessed in different field conditions. All these variations can have a significant effect on the neutron-induced gamma-ray spectrum and therefore a large impact on automatic fill identification algorithms. In order to develop robust identification algorithms, parametric studies of the effects of munition size, fill composition, and assessment conditions are very useful but time-consuming and expensive in the laboratory. Monte Carlo modeling of the system response to these variations is a very attractive alternative, provided the modeling accurately reflects real gamma spectra and can be performed quickly and inexpensively when compared to experiment. At Idaho National Laboratory we have used the Monte Carlo N-Particle (MCNP6) code [2] to calculate the response of the Portable Isotopic Neutron Spectroscopy (PINS) system to a number of simulated chemical warfare munitions as well as performed laboratory measurements with the system. Two versions of PINS system were used; one excited the test object with neutrons from a 252C f source and one with neutrons from a portable deuterium-deuterium (DD) neutron generator. The sets of measurements and simulations with the two different neutron sources provided experimental data for development of automatic fill identification algorithms as well as providing a good test of the agreement between the MCNP calculations and experiment.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Progress on the National Solar Radiation Data Base (NSRDB): A New DNI Computation

This study introduces a new technique to compute direct normal irradiance (DNI) for improving the National Solar Radiation Data Base (NSRDB). A finite-surface integration algorithm is developed to compute solar radiation in differential solid angles and efficiently infer its contribution to a surface perpendicular to the solar direction. A lookup table of cloud bi-directional transmittance distribution function (BTDF) is developed by use of the discrete ordinates radiative transfer (DISORT) model for possible solar and observing directions and various cloud optical and microphysical properties. In each solar incident direction, DNI is given by the cloud BTDFs from approximately 200 differential solid angles. The simulated DNI is calibrated and evaluated using surface observations at the National Renewable Energy Laboratory's (NREL's) Solar Energy Research Laboratory (SRRL) and the Atmospheric Radiation Measurement (ARM) Southern Great Plains (SGP) facility.

41 EE - Solar Energy Technologies Office (EE-4S)↗

Stream-reach Identification for New Run-of-River Hydropower Development through a Merit Matrix Based Geospatial Algorithm

Even after a century of development, the total hydropower potential from undeveloped rivers is still considered to be abundant in the United States. However, unlike evaluating hydropower potential at existing hydropower plants or non-powered dams, locating a feasible new hydropower plant involves many unknowns, and hence the total undeveloped potential is harder to quantify. In light of the rapid development of multiple national geospatial datasets for topography, hydrology, and environmental characteristics, a merit matrix based geospatial algorithm is proposed to help identify possible hydropower stream-reaches for future development. These hydropower stream-reaches sections of natural streams with suitable head, flow, and slope for possible future development are identified and compared using three different scenarios. A case study was conducted in the Alabama-Coosa-Tallapoosa (ACT) and Apalachicola-Chattahoochee-Flint (ACF) hydrologic subregions. It was found that a merit matrix based algorithm, which is based on the product of hydraulic head, annual mean flow, and average channel slope, can help effectively identify stream-reaches with high power density and small surface inundation. The identified stream-reaches can then be efficiently evaluated for their potential environmental impact, land development cost, and other competing water usage in detailed feasibility studies . Given that the selected datasets are available nationally (at least within the conterminous US), the proposed methodology will have wide applicability across the country.

Pasha, M. Fayzul K.↗

Developing an Active Learning algorithm for learning Bayesian classifiers under the Multiple Instance Learning scenario

In the Multiple Instance Learning scenario, the training data consists of instances grouped into bags, and each bag is labelled with whether it is positive, i.e. contains at least one positive instance. First, Active Learning, in which additional labels can be iteratively requested, has the potential to allow more accurate classifiers to be learned with less labels. Active Learning has been applied to the Multiple Instance Learning under two settings: when bag labels of unlabelled bags can be requested, and when instance labels within bags known to be positive can be requested. Second, Bayesian Active learning methods have the potential to learn accurate classifiers with few labels, because they explicitly track the classifier uncertainty and can thus address its knowledge gaps. Yet, there does not exist any Bayesian Active Learning method for the Multiple Instance Learning Scenario. In this work, we develop the first such method. We develop a Bayesian classifier for the Multiple Instance Learning scenario, show how it can be efficiently used for Bayesian Active Learning, and perform experiments assessing its performance. While its performance exceeds that when no Active Learning is used, it is sometimes better, sometimes worse than the naive baseline of uncertainty sampling, depending on the situation. This suggests future work: building more customizable Bayesian Active Learning methods for the Multiple Instance Scenario, customizable to whether bag or instance label accuracy is targeted, and the labeling budget.

97 MATHEMATICS AND COMPUTING↗

Real-time adaptive aircraft scheduling

One of the most important functions of any air traffic management system is the assignment of ground-holding times to flights, i.e., the determination of whether and by how much the take-off of a particular aircraft headed for a congested part of the air traffic control (ATC) system should be postponed in order to reduce the likelihood and extent of airborne delays. An analysis is presented for the fundamental case in which flights from many destinations must be scheduled for arrival at a single congested airport; the formulation is also useful in scheduling the landing of airborne flights within the extended terminal area. A set of approaches is described for addressing a deterministic and a probabilistic version of this problem. For the deterministic case, where airport capacities are known and fixed, several models were developed with associated low-order polynomial-time algorithms. For general delay cost functions, these algorithms find an optimal solution. Under a particular natural assumption regarding the delay cost function, an extremely fast (O(n ln n)) algorithm was developed. For the probabilistic case, using an estimated probability distribution of airport capacities, a model was developed with an associated low-order polynomial-time heuristic algorithm with useful properties.

Kolitz, Stephan E.↗