Search NASASearch

SEARCH · Search NASA

Results for “code patterns”

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

Perceive: Proactive Exploration of Risky Concept Emergence for Identifying Vulnerabilities & Exposures

National databases that collect various kinds of textual threat reports such as ASRS, CERT, and NVD manually process their reports individually. They then offer data products to disseminate the aggregate information, like newsletters, alerts or individual report searching. The goal of this research is to connect these individual reports thematically and temporally to identify emerging or recurring threats, by analyzing large collections of text, source code, collaboration and communication patterns. This capability, I argue, enables us to identify the emergence and recurrence of such themes, and the contexts in which they re-occur, facilitating faster and more capable mitigation. I propose two models to shed light on this goal: An empirical model of vulnerabilities as bugs, the commit flow model, and one of the vulnerabilities and aviation safety threats as topics, the topic flow model. I use as gold standard existing manual workflows in both domains, reflected in the existing data products by these organizations, and empirically evaluate if the automated model scan match or outperform existing manual practices.

ASRS

Grid Convergence for Turbulent Flows(Invited)

A detailed grid convergence study has been conducted to establish accurate reference solutions corresponding to the one-equation linear eddy-viscosity Spalart-Allmaras turbulence model for two dimensional turbulent flows around the NACA 0012 airfoil and a flat plate. The study involved three widely used codes, CFL3D (NASA), FUN3D (NASA), and TAU (DLR), and families of uniformly refined structured grids that differ in the grid density patterns. Solutions computed by different codes on different grid families appear to converge to the same continuous limit, but exhibit different convergence characteristics. The grid resolution in the vicinity of geometric singularities, such as a sharp trailing edge, is found to be the major factor affecting accuracy and convergence of discrete solutions, more prominent than differences in discretization schemes and/or grid elements. The results reported for these relatively simple turbulent flows demonstrate that CFL3D, FUN3D, and TAU solutions are very accurate on the finest grids used in the study, but even those grids are not sufficient to conclusively establish an asymptotic convergence order.

Diskin, Boris

Numerical Simulation of Two-grid Ion Optics Using a 3D Code

A three-dimensional ion optics code has been developed under NASA's Project Prometheus to model two grid ion optics systems. The code computes the flow of positive ions from the discharge chamber through the ion optics and into the beam downstream of the thruster. The rate at which beam ions interact with background neutral gas to form charge exchange ions is also computed. Charge exchange ion trajectories are computed to determine where they strike the ion optics grid surfaces and to determine the extent of sputter erosion they cause. The code has been used to compute predictions of the erosion pattern and wear rate on the NSTAR ion optics system; the code predicts the shape of the eroded pattern but overestimates the initial wear rate by about 50%. An example of use of the code to estimate the NEXIS thruster accelerator grid life is also presented.

ion optics

System and technique for retrieving depth information about a surface by projecting a composite image of modulated light patterns

A technique, associated system and program code, for retrieving depth information about at least one surface of an object. Core features include: projecting a composite image comprising a plurality of modulated structured light patterns, at the object; capturing an image reflected from the surface; and recovering pattern information from the reflected image, for each of the modulated structured light patterns. Pattern information is preferably recovered for each modulated structured light pattern used to create the composite, by performing a demodulation of the reflected image. Reconstruction of the surface can be accomplished by using depth information from the recovered patterns to produce a depth map/mapping thereof. Each signal waveform used for the modulation of a respective structured light pattern, is distinct from each of the other signal waveforms used for the modulation of other structured light patterns of a composite image; these signal waveforms may be selected from suitable types in any combination of distinct signal waveforms, provided the waveforms used are uncorrelated with respect to each other. The depth map/mapping to be utilized in a host of applications, for example: displaying a 3-D view of the object; virtual reality user-interaction interface with a computerized device; face--or other animal feature or inanimate object--recognition and comparison techniques for security or identification purposes; and 3-D video teleconferencing/telecollaboration.

Hassebrook, Laurence G.

On the Natural Structure of Amino Acid Patterns in Families of Protein Sequences

All known terrestrial proteins are coded as continuous strings of ≈20 amino acids. The patterns formed by the repetitions of elements in groups of finite sequences describes the natural architectures of protein families. We present a method to search for patterns and groupings of patterns in protein sequences using a mathematically precise definition for “repetition”, an efficient algorithmic implementation and a robust scoring system with no adjustable parameters. We show that the sequence patterns can be well-separated into disjoint classes according to their recurrence in nested structures. The statistics of the occurrences of patterns indicate that short repetitions are sufficient to account for the differences between natural families and randomized groups of sequences by more than 10 standard deviations, while contiguous sequence patterns shorter than 5 residues are effectively random in their occurrences. A small subset of patterns is sufficient to account for a robust ”familiarity” definition between arbitrary sets of sequences.

Pablo Turjanski

Investigation of Near Shannon Limit Coding Schemes

Turbo codes can deliver performance that is very close to the Shannon limit. This report investigates algorithms for convolutional turbo codes and block turbo codes. Both coding schemes can achieve performance near Shannon limit. The performance of the schemes is obtained using computer simulations. There are three sections in this report. First section is the introduction. The fundamental knowledge about coding, block coding and convolutional coding is discussed. In the second section, the basic concepts of convolutional turbo codes are introduced and the performance of turbo codes, especially high rate turbo codes, is provided from the simulation results. After introducing all the parameters that help turbo codes achieve such a good performance, it is concluded that output weight distribution should be the main consideration in designing turbo codes. Based on the output weight distribution, the performance bounds for turbo codes are given. Then, the relationships between the output weight distribution and the factors like generator polynomial, interleaver and puncturing pattern are examined. The criterion for the best selection of system components is provided. The puncturing pattern algorithm is discussed in detail. Different puncturing patterns are compared for each high rate. For most of the high rate codes, the puncturing pattern does not show any significant effect on the code performance if pseudo - random interleaver is used in the system. For some special rate codes with poor performance, an alternative puncturing algorithm is designed which restores their performance close to the Shannon limit. Finally, in section three, for iterative decoding of block codes, the method of building trellis for block codes, the structure of the iterative decoding system and the calculation of extrinsic values are discussed.

Kwatra, S. C.

System and technique for retrieving depth information about a surface by projecting a composite image of modulated light patterns

A technique, associated system and program code, for retrieving depth information about at least one surface of an object, such as an anatomical feature. Core features include: projecting a composite image comprising a plurality of modulated structured light patterns, at the anatomical feature; capturing an image reflected from the surface; and recovering pattern information from the reflected image, for each of the modulated structured light patterns. Pattern information is preferably recovered for each modulated structured light pattern used to create the composite, by performing a demodulation of the reflected image. Reconstruction of the surface can be accomplished by using depth information from the recovered patterns to produce a depth map/mapping thereof. Each signal waveform used for the modulation of a respective structured light pattern, is distinct from each of the other signal waveforms used for the modulation of other structured light patterns of a composite image; these signal waveforms may be selected from suitable types in any combination of distinct signal waveforms, provided the waveforms used are uncorrelated with respect to each other. The depth map/mapping to be utilized in a host of applications, for example: displaying a 3-D view of the object; virtual reality user-interaction interface with a computerized device; face--or other animal feature or inanimate object--recognition and comparison techniques for security or identification purposes; and 3-D video teleconferencing/telecollaboration.

Hassebrook, Laurence G.

Computer mapping of turbidity and circulation patterns in Saginaw Bay, Michigan from LANDSAT data

The author has identified the following significant results. LANDSAT was used as a basis for producing geometrically-corrected, color-coded imagery of turbidity and circulation patterns in Saginaw Bay, Michigan (Lake Huron). This imagery shows nine discrete categories of turbidity, as indicated by nine Secchi depths between 0.3 and 3.3 meters. The categorized imagery provided an economical basis for extrapolating water quality parameters from point samples to unsample areas. LANDSAT furnished a synoptic view of water mass boundaries that no amount of ground sampling or monitoring could provide.

Rogers, R. H.

Error-erasure decoding of product codes.

Two error-erasure decoding algorithms for product codes that correct all the error-erasure patterns guaranteed correctable by the minimum Hamming distance of the product code are given. The first algorithm works when at least one of the component codes is majority-logic decodable. The second algorithm works for any product code. Both algorithms use the decoders of the component codes.

Wainberg, S.

A Closer Look at Non-Random Patterns Within Chemistry Space for a Smaller, Earlier Amino Acid Alphabet

Recent findings, in vitro and in silico, are strengthening the idea of a simpler, earlier stage of genetically encoded proteins which used amino acids produced by prebiotic chemistry. These findings motivate a re-examination of prior work which has identified unusual properties of the set of twenty amino acids found within the full genetic code, while leaving it unclear whether similar patterns also characterize the subset of prebiotically plausible amino acids. We have suggested previously that this ambiguity may result from the low number of amino acids recognized by the definition of prebiotic plausibility used for the analysis. Here, we test this hypothesis using significantly updated data for organic material detected within meteorites, which contain several coded and non-coded amino acids absent from prior studies. In addition to confirming the well-established idea that “late” arriving amino acids expanded the chemistry space encoded by genetic material, we find that a prebiotically plausible subset of coded amino acids generally emulates the patterns found in the full set of 20, namely an exceptionally broad and even distribution of volumes and an exceptionally even distribution of hydrophobicities (quantified as logP) over a narrow range. However, the strength of this pattern varies depending on both the size and composition the library used to create a background (null model) for a random alphabet, and the precise definition of exactly which amino acids were present in a simpler, earlier code. Findings support the idea that a small sample size of amino acids caused previous ambiguous results, and further improvements in meteorite analysis, and/or prebiotic simulations will further clarify the nature and extent of unusual properties. We discuss the case of sulfur-containing amino acids as a specific and clear example and conclude by reviewing the potential impact of better understanding the chemical “logic” of a smaller forerunner to the standard amino acid alphabet.

Amino acids

An Automatic Code Synthesizer

This paper describes the design and architecture fo an automatic code sysnthesizer we call the ACG. The input to the ACG is a list of facts that must hold for the generated code, along with domain-specific knowledge (design rules and patterns).

programming programming code programming productiv

Prediction of sound radiated from different practical jet engine inlets

Existing computer codes for calculating the far field radiation patterns surrounding various practical jet engine inlet configurations under different excitation conditions were upgraded. The computer codes were refined and expanded so that they are now more efficient computationally by a factor of about three and they are now capable of producing accurate results up to nondimensional wave numbers of twenty. Computer programs were also developed to help generate accurate geometrical representations of the inlets to be investigated. This data is required as input for the computer programs which calculate the sound fields. This new geometry generating computer program considerably reduces the time required to generate the input data which was one of the most time consuming steps in the process. The results of sample runs using the NASA-Lewis QCSEE inlet are presented and comparison of run times and accuracy are made between the old and upgraded computer codes. The overall accuracy of the computations is determined by comparison of the results of the computations with simple source solutions.

Zinn, B. T.

Instruments for Reading Direct-Marked Data-Matrix Symbols

Improved optoelectronic instruments (specially configured digital cameras) for reading direct-marked data-matrix symbols on the surfaces of optically reflective objects (including specularly reflective ones) are undergoing development. Data-matrix symbols are two-dimensional binary patterns that are used, like common bar codes, for automated identification of objects. The first data-matrix symbols were checkerboard-like patterns of black-and-white rectangles, typically existing in the forms of paint, ink, or detachable labels. The major advantage of direct marking (the marks are more durable than are painted or printed symbols or detachable labels) is offset by a major disadvantage (the marks generated by some marking methods do not provide sufficient contrast to be readable by optoelectronic instruments designed to read black-and-white data-matrix symbols). Heretofore, elaborate lighting, lensing, and software schemes have been tried in efforts to solve the contrast problem in direct-mark matrix- symbol readers. In comparison with prior readers based on those schemes, the readers now undergoing development are expected to be more effective while costing less. All of the prior direct-mark matrix-symbol readers are designed to be aimed perpendicularly to marked target surfaces, and they tolerate very little angular offset. However, the reader now undergoing development not only tolerates angular offset but depends on angular offset as a means of obtaining the needed contrast, as described below. The prototype reader (see Figure 1) includes an electronic camera in the form of a charge-coupled-device (CCD) image detector equipped with a telecentric lens. It also includes a source of collimated visible light and a source of collimated infrared light for illuminating a target. The visible and infrared illumination complement each other: the visible illumination is more useful for aiming the reader toward a target, while the infrared illumination is more useful for reading symbols on highly reflective surfaces. By use of beam splitters, the visible and infrared collimated lights are introduced along the optical path of the telecentric lens, so that the target is illuminated and viewed from the same direction.

Schramm, Harry F.

Antenna pattern study, task 2

Two electromagnetic scattering codes, NEC-BSC and ESP3, were delivered and installed on a NASA VAX computer for use by Marshall Space Flight Center antenna design personnel. The existing codes and certain supplementary software were updated, the codes installed on a computer that will be delivered to the customer, to provide capability for graphic display of the data to be computed by the use of the codes and to assist the customer in the solution of specific problems that demonstrate the use of the codes. With the exception of one code revision, all of these tasks were performed.

Harper, Warren

Mesh-matrix analysis method for electromagnetic launchers

The mesh-matrix method is a procedure for calculating the current distribution in the conductors of electromagnetic launchers with coil or flat-plate geometry. Once the current distribution is known the launcher performance can be calculated. The method divides the conductors into parallel current paths, or meshes, and finds the current in each mesh by matrix inversion. The author presents procedures for writing equations for the current and voltage relations for a few meshes to serve as a pattern for writing the computer code. An available subroutine package provides routines for field and flux coefficients and equation solution.

Elliott, David G.

On the decoder error probability of linear codes

By using coding and combinatorial techniques, an approximate formula for the weight distribution of decodable words of most linear block codes is evaluated. This formula is then used to give an approximate expression for the decoder error probability P(sub E)(u) of linear block codes, given that an error pattern of weight u has occurred. It is shown that P(sub E)(u) approaches the constant Q as u gets large, where Q is the probability that a completely random error pattern will cause decoder error.

Cheung, K.-M.

A numerical simulation of the flow in the diffuser of the NASA Lewis icing research tunnel

The flow in the diffuser section of the Icing Research Tunnel at the NASA Lewis Research Center is numerically investigated. To accomplish this, an existing computer code is utilized. The code, known as PARC3D, is based on the Beam-Warming algorithm applied to the strong conservation law form of the complete Navier-Stokes equations. The first portion of the paper consists of a brief description of the diffuser and its current flow characteristics. A brief discussion of the code work follows. Predicted velocity patterns are then compared with the measured values.

Addy, Harold E., Jr.

A numerical simulation of the flow in the diffuser of the NASA Lewis Icing Research Tunnel

The flow in the diffuser section of the Icing Research Tunnel at the NASA Lewis Research Center is numerically investigated. To accomplish this, an existing computer code is utilized. The code, known as PARC3D, is based on the Beam-Warming algorithm applied to the strong conservation law form of the complete Navier-Stokes equations. The first portion of the paper consists of a brief description of the diffuser and its current flow characteristics. A brief discussion of the code work follows. Predicted velocity patterns are then compared with the measured values.

Addy, Harold E., Jr.