Search NASA⌕ Search

SEARCH · Search NASA

Results for “Mathematics and Computing, Computer science”

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 433 records · Page 24

Data Remapping Between One Dimensional Meshes [Slides]

Remapping involves two meshes (source and target), where a discrete set of field values (data) is available on only one of the meshes (source mesh). Since the source and target mesh can be different, we need to find an approximation of the field on the target mesh using the data available on the source mesh. We will consider two algorithms for this problem: point-wise remap and conservative remap.

79 ASTRONOMY AND ASTROPHYSICS↗

Mutual Information and Information Gating in Synfire Chains

Here, coherent neuronal activity is believed to underlie the transfer and processing of information in the brain. Coherent activity in the form of synchronous firing and oscillations has been measured in many brain regions and has been correlated with enhanced feature processing and other sensory and cognitive functions. In the theoretical context, synfire chains and the transfer of transient activity packets in feedforward networks have been appealed to in order to describe coherent spiking and information transfer. Recently, it has been demonstrated that the classical synfire chain architecture, with the addition of suitably timed gating currents, can support the graded transfer of mean firing rates in feedforward networks (called synfire-gated synfire chains—SGSCs). Here we study information propagation in SGSCs by examining mutual information as a function of layer number in a feedforward network. We explore the effects of gating and noise on information transfer in synfire chains and demonstrate that asymptotically, two main regions exist in parameter space where information may be propagated and its propagation is controlled by pulse-gating: a large region where binary codes may be propagated, and a smaller region near a cusp in parameter space that supports graded propagation across many layers.

59 BASIC BIOLOGICAL SCIENCES↗

JPL basic research review

Current status, projected goals, and results of 49 research and advanced development programs at the Jet Propulsion Laboratory are reported in abstract form. Areas of investigation include: aerodynamics and fluid mechanics, applied mathematics and computer sciences, environment protection, materials science, propulsion, electric and solar power, guidance and navigation, communication and information sciences, general physics, and chemistry.

Source record↗

European aerospace science and technology, 1992: A bibliography with indexes

This bibliography contains 1916 annotated references to reports and journal articles of European intellectual origin entered into the NASA Scientific and Technical Information System during 1992. Representative subject areas include: spacecraft and aircraft design, propulsion technology, chemistry and materials, engineering and mechanics, earth and life sciences, communications, computers and mathematics, and the natural space sciences.

Source record↗

Aeronautical engineering: A continuing bibliography with indexes (supplement 316)

This bibliography lists 413 reports, articles, and other documents introduced into the NASA scientific and technical information system in April 1995. Subject coverage includes: aeronautics; mathematical and computer sciences; chemistry and material sciences; geosciences; design, construction and testing of aircraft and aircraft engines; aircraft components, equipment, and systems; ground support systems; and theoretical and applied aspects of aerodynamics and general fluid dynamics.

Source record↗

Research Institute for Technical Careers

The NASA research grant to Wilberforce University enabled us to establish the Research Institute for Technical Careers (RITC) in order to improve the teaching of science and engineering at Wilberforce. The major components of the research grant are infrastructure development, establishment of the Wilberforce Intensive Summer Experience (WISE), and Joint Research Collaborations with NASA Scientists. (A) Infrastructure Development. The NASA grant has enabled us to improve the standard of our chemistry laboratory and establish the electronics, design, and robotics laboratories. These laboratories have significantly improved the level of instruction at Wilberforce University. (B) Wilberforce Intensive Summer Experience (WISE). The WISE program is a science and engineering bridge program for prefreshman students. It is an intensive academic experience designed to strengthen students' knowledge in mathematics, science, engineering, computing skills, and writing. (C) Joint Collaboration. Another feature of the grant is research collaborations between NASA Scientists and Wilberforce University Scientists. These collaborations have enabled our faculty and students to conduct research at NASA Lewis during the summer and publish research findings in various journals and scientific proceedings.

Glenn, Ronald L.↗

Evader Interdiction and Collateral Damage

In network interdiction problems, evaders (hostile agents or data packets) are moving through a network towards their targets and we wish to choose sensor placement locations in order to intercept them before they reach their destinations. Sensor locations should be chosen economically, balancing security gains with cost, including the inconvenience sensors inflict upon innocent travelers. We give optimal sensor allocation algorithms for several classes of special graphs and hardness and optimal approximation results for general graphs, including for deterministic or Markov chain-based and oblivious or reactive evaders. In a similar-sounding but much different problem setting posed by [10] where the innocent travelers can also be reactive, we again give optimal algorithms for special cases and hardness and (essentially) optimal approximation results on general graphs.

ALGORITHMS↗