Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “combinatorial”

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 163 records · Page 9

Combinatorial Membrane Synthesis: Fundamentals of Hybrid Metal-Organic Brush (MOB) Membranes for Organic Solvent Nanofiltration (Renewal)

(a) Goals: The goals of our current 3-year research project are (i) expansion of the novel modification technique Single Electron Transfer- Living Radical Polymerization (SET-LRP) to graft polymer brushes on a polyimide stable support followed by characterization and testing of the ensuing membrane (ii) stiffen brush network utilizing (a) metal organic frameworks and (b) covalent bonds formed as a result of crosslinking the grafted brush network. (b) Approach: The approach taken for this research was: (i) to graft branches terminated with a carboxyl group on each bristle (or bristle branch) allowing (a) metal immobilization to form MOF-like structures between branches or (b) crosslink bristles using aliphatic or aromatic diamines; (ii) to test the performance of the membranes using organic dyes, pure solvents (alcohols) and industrially relevant organic solvent separations; and (iii) to characterize these modified brush membranes. (c) Findings: The significant findings from the past one year are summarized below (papers resulting from this work are listed below and in D. PUBLICATIONS and relevant references are found in E. REFERENCES.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Combinatorial Glycomic Analyses to Direct CAZyme Discovery for the Tailored Degradation of Canola Meal Non-Starch Dietary Polysaccharides

Canola meal (CM), the protein-rich by-product of canola oil extraction, has shown promise as an alternative feedstuff and protein supplement in poultry diets, yet its use has been limited due to the abundance of plant cell wall fibre, specifically non-starch polysaccharides (NSP) and lignin. The addition of exogenous enzymes to promote the digestion of CM NSP in chickens has potential to increase the metabolizable energy of CM. We isolated chicken cecal bacteria from a continuous-flow mini-bioreactor system and selected for those with the ability to metabolize CM NSP. Of 100 isolates identified, Bacteroides spp. and Enterococcus spp. were the most common species with these capabilities. To identify enzymes specifically for the digestion of CM NSP, we used a combination of glycomics techniques, including enzyme-linked immunosorbent assay characterization of the plant cell wall fractions, glycosidic linkage analysis (methylation-GC-MS analysis) of CM NSP and their fractions, bacterial growth profiles using minimal media supplemented with CM NSP, and the sequencing and de novo annotation of bacterial genomes of high-efficiency CM NSP utilizing bacteria. The SACCHARIS pipeline was used to select plant cell wall active enzymes for recombinant production and characterization. This approach represents a multidisciplinary innovation platform to bioprospect endogenous CAZymes from the intestinal microbiota of herbivorous and omnivorous animals which is adaptable to a variety of applications and dietary polysaccharides.

glycome profiling↗

Estimation of the Chances to Find New Phenomena at the LHC in a Model-Agnostic Combinatorial Analysis

In this paper, we estimate the number of event topologies that have the potential to be produced in 𝑝𝑝 collisions at the Large Hadron Collider (LHC) without violating kinematic and other constraints. We use numerical calculations and combinatorics, guided by large-scale Monte Carlo simulations of Standard Model (SM) processes. Then, we set the upper limit on the probability that new physics may escape detection, assuming a model-agnostic approach. The calculated probability is unexpectedly large, and the fact that LHC has not found new physics until now is not entirely surprising. Theoretical limitations and experimental challenges in observing new physics within the studied exclusive event classes are examined.

BSM↗

A prototype combinatorial scheduler for space-borne observational instruments

A prototype scheduler has been developed for observations to be carried out by the NASA Gamma Ray Observatory. The purpose of the scheduling system is to provide an automated method to determine optimized schedules conforming to all scheduling guidelines. Strategies used in creating COMPTEL/EGRET schedules and in scheduling OSSE targets are examined. It is concluded that the hybrid scheduler creates optimal schedules, or very nearly optimal schedules, and reduces the estimated scheduling time by 18 or 19 orders of magnitude, from about 10 to the 14th years to as few as 561 seconds.

Gilstrap, Lewey O.↗

Learning dominance relations in combinatorial search problems

Dominance relations commonly are used to prune unnecessary nodes in search graphs, but they are problem-dependent and cannot be derived by a general procedure. The authors identify machine learning of dominance relations and the applicable learning mechanisms. A study of learning dominance relations using learning by experimentation is described. This system has been able to learn dominance relations for the 0/1-knapsack problem, an inventory problem, the reliability-by-replication problem, the two-machine flow shop problem, a number of single-machine scheduling problems, and a two-machine scheduling problem. It is considered that the same methodology can be extended to learn dominance relations in general.

Yu, Chee-Fen↗

Dissolving variables in connectionist combinatory logic

A connectionist system which can represent and execute combinator expressions to elegantly solve the variable binding problem in connectionist networks is presented. This system is a graph reduction machine utilizing graph representations and traversal mechanisms similar to ones described in the BoltzCONS system of Touretzky (1986). It is shown that, as combinators eliminate variables by introducing special functions, these functions can be connectionistically implemented without reintroducing variable binding. This approach 'dissolves' an important part of the variable binding problem, in that a connectionist system still has to manipulate complex data structures, but those structures and their manipulations are rendered more uniform.

Barnden, John↗

On well-partial-order theory and its application to combinatorial problems of VLSI design

We nonconstructively prove the existence of decision algorithms with low-degree polynomial running times for a number of well-studied graph layout, placement, and routing problems. Some were not previously known to be in p at all; others were only known to be in p by way of brute force or dynamic programming formulations with unboundedly high-degree polynomial running times. Our methods include the application of the recent Robertson-Seymour theorems on the well-partial-ordering of graphs under both the minor and immersion orders. We also briefly address the complexity of search versions of these problems.

Fellows, M.↗

Quantum Adiabatic Optimization and Combinatorial Landscapes

In this paper we analyze the performance of the Quantum Adiabatic Evolution (QAE) algorithm on a variant of Satisfiability problem for an ensemble of random graphs parametrized by the ratio of clauses to variables, gamma = M / N. We introduce a set of macroscopic parameters (landscapes) and put forward an ansatz of universality for random bit flips. We then formulate the problem of finding the smallest eigenvalue and the excitation gap as a statistical mechanics problem. We use the so-called annealing approximation with a refinement that a finite set of macroscopic variables (verses only energy) is used, and are able to show the existence of a dynamic threshold gamma = gammad, beyond which QAE should take an exponentially long time to find a solution. We compare the results for extended and simplified sets of landscapes and provide numerical evidence in support of our universality ansatz.

Smelyanskiy, V. N.↗

Combinatorial Generation of Test Suites

Testgen is a computer program that generates suites of input and configuration vectors for testing other software or software/hardware systems. As systems become ever more complex, often, there is not enough time to test systems against all possible combinations of inputs and configurations, so test engineers need to be selective in formulating test plans. Testgen helps to satisfy this need: In response to a test-suite-requirement-specification model, it generates a minimal set of test vectors that satisfies all the requirements.

Dvorak, Daniel L.↗

Precise delay measurement through combinatorial logic

A high resolution circuit and method for facilitating precise measurement of on-chip delays for FPGAs for reliability studies. The circuit embeds a pulse generator on an FPGA chip having one or more groups of LUTS (the "LUT delay chain"), also on-chip. The circuit also embeds a pulse width measurement circuit on-chip, and measures the duration of the generated pulse through the delay chain. The pulse width of the output pulse represents the delay through the delay chain without any I/O delay. The pulse width measurement circuit uses an additional asynchronous clock autonomous from the main clock and the FPGA propagation delay can be displayed on a hex display continuously for testing purposes.

Burke, Gary R.↗

Combinatorial Multidomain Mesoporous Chips and a Method for Fractionation, Stabilization, and Storage of Biomolecules

A new fractionation device shows desirable features for exploratory screening and biomarker discovery. The constituent MSCs may be tailored for desired pore sizes and surface properties and for the sequestration and enrichment of extremely low abundant protein and peptides in desired ranges of the mass/charge spectrum. The MSCs are effective in yielding reproducible extracts from complex biological samples as small as 10 microliter in a time as short as 30 minutes. They are inexpensive to manufacture, and allow for scaled up production to attain the simultaneous processing of a large number of samples. The MSCs are multiplexed, label-free diagnostic tools with the potential of biological recognition moiety modification for enhanced specificity. The MSCs may store, protect and stabilize biological fluids, enabling the simplified and cost-effective collection and transportation of clinical samples. The MSC-based device may serve as a diagnostic tool to complement histopathology, imaging, and other conventional clinical techniques. The MSCs mediated identification of disease-specific protein signatures may help in the selection of personalized therapeutic combinations, in the real-time assessment of therapeutic efficacy and toxicity, and in the rational modulation of therapy based on the changes in the protein networks associated with the prognosis and the drug resistance of the disease.

Ferrari, Mauro↗