SEARCH · Search NASA

Results for “iterative regularization”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 37 records · Page 2

All sources NASA NTRS DOE OSTI

NASA NTRS1996

Multigrid Methods for EHL Problems

In many bearings and contacts, forces are transmitted through thin continuous fluid films which separate two contacting elements. Objects in contact are normally subjected to friction and wear which can be reduced effectively by using lubricants. If the lubricant film is sufficiently thin to prevent the opposing solids from coming into contact and carries the entire load, then we have hydrodynamic lubrication, where the lubricant film is determined by the motion and geometry of the solids. However, for loaded contacts of low geometrical conformity, such as gears, rolling contact bearings and cams, this is not the case due to high pressures and this is referred to as Elasto-Hydrodynamic Lubrication (EHL) In EHL, elastic deformation of the contacting elements and the increase in fluid viscosity with pressure are very significant and cannot be ignored. Since the deformation results in changing the geometry of the lubricating film, which in turn determines the pressure distribution, an EHL mathematical model must simultaneously satisfy the complex elasticity (integral) and the Reynolds lubrication (differential) equations. The nonlinear and coupled nature of the two equations makes numerical calculations computationally intensive. This is especially true for highly loaded problems found in practice. One novel feature of these problems is that the solution may exhibit sharp pressure spikes in the outlet region. To this date both finite element and finite difference methods have been used to solve EHL problems with perhaps greater emphasis on the use of the finite difference approach. In both cases, a major computational difficulty is ensuring convergence of the nonlinear equations solver to a steady state solution. Two successful methods for achieving this are direct iteration and multigrid methods. Direct iteration methods (e.g Gauss Seidel) have long been used in conjunction with finite difference discretizations on regular meshes. Perhaps one of the best examples of the application of such methods is the recent Effective Influence Method of Dowson and Wang. Multigrid methods have also been used with great success by Venner and Venner and Lubrecht with a good summary being given by Venner. As both these finite difference discretization based approaches appear to provide an efficient way of solving EHL problems, it is important to understand their relative merits. This paper is a first attempt at providing such an understanding in the context of EHL point contact problem, (contact of two spheres), in which the contact zone is a point and an ellipse or circle for unloaded and loaded dry contacts respectively. Since the film thickness and the contact width are generally small compared to the local radius of curvature of the two surfaces, the reduced geometry of the surfaces in the contact area can be accurately approximated to the contact between a paraboloid and a flat surface. The layout of the remainder of this paper is as follows. In section 2 we introduce the form of the equations to be solved. The Effective Influence Newton Method is described in Section 3 while Section 4 describes the Multigrid method to be used. Sections 5 and 6 describe the test problems to be used in the comparison between the two methods and compare the performance of the two methods. Section 7 concludes the paper with an argument of the two methods and suggests some future research directions.

Nurgat, Elyas↗

NASA NTRS1995

Parallel Computational Environment for Substructure Optimization

Design optimization of large structural systems can be attempted through a substructure strategy when convergence difficulties are encountered. When this strategy is used, the large structure is divided into several smaller substructures and a subproblem is defined for each substructure. The solution of the large optimization problem can be obtained iteratively through repeated solutions of the modest subproblems. Substructure strategies, in sequential as well as in parallel computational modes on a Cray YMP multiprocessor computer, have been incorporated in the optimization test bed CometBoards. CometBoards is an acronym for Comparative Evaluation Test Bed of Optimization and Analysis Routines for Design of Structures. Three issues, intensive computation, convergence of the iterative process, and analytically superior optimum, were addressed in the implementation of substructure optimization into CometBoards. Coupling between subproblems as well as local and global constraint grouping are essential for convergence of the iterative process. The substructure strategy can produce an analytically superior optimum different from what can be obtained by regular optimization. For the problems solved, substructure optimization in a parallel computational mode made effective use of all assigned processors.

Gendy, Atef S.↗

NASA NTRS1983

Programming substructure computations for elliptic problems on the CHiP system

A number of studies have been conducted with the aim to apply parallel computation to problems associated with solving finite element equations arising in structural mechanics and fluid dynamics. These studies have provided many important results. The present investigation is concerned with a set of experiments designed to test two ideas, including configurability and substructuring. The considered algorithms and tests are intended for implementation on the Configurable, Highly Parallel (CHiP) family of architecture described by Snyder (1982). The ChiP computer is composed of homogeneous processing elements (PEs) placed at regular intervals in a lattice of programmable switches. Two examples of the role of configurability and substructuring for simple iterative algorithms are considered, giving attention to conjugate gradient iterations, and tridiagonal systems of equations.

Gannon, D.↗

NASA NTRS2010

Comparison of Node-Centered and Cell-Centered Unstructured Finite-Volume Discretizations: Inviscid Fluxes

Cell-centered and node-centered approaches have been compared for unstructured finite-volume discretization of inviscid fluxes. The grids range from regular grids to irregular grids, including mixed-element grids and grids with random perturbations of nodes. Accuracy, complexity, and convergence rates of defect-correction iterations are studied for eight nominally second-order accurate schemes: two node-centered schemes with weighted and unweighted least-squares (LSQ) methods for gradient reconstruction and six cell-centered schemes two node-averaging with and without clipping and four schemes that employ different stencils for LSQ gradient reconstruction. The cell-centered nearest-neighbor (CC-NN) scheme has the lowest complexity; a version of the scheme that involves smart augmentation of the LSQ stencil (CC-SA) has only marginal complexity increase. All other schemes have larger complexity; complexity of node-centered (NC) schemes are somewhat lower than complexity of cell-centered node-averaging (CC-NA) and full-augmentation (CC-FA) schemes. On highly anisotropic grids typical of those encountered in grid adaptation, discretization errors of five of the six cell-centered schemes converge with second order on all tested grids; the CC-NA scheme with clipping degrades solution accuracy to first order. The NC schemes converge with second order on regular and/or triangular grids and with first order on perturbed quadrilaterals and mixed-element grids. All schemes may produce large relative errors in gradient reconstruction on grids with perturbed nodes. Defect-correction iterations for schemes employing weighted least-square gradient reconstruction diverge on perturbed stretched grids. Overall, the CC-NN and CC-SA schemes offer the best options of the lowest complexity and secondorder discretization errors. On anisotropic grids over a curved body typical of turbulent flow simulations, the discretization errors converge with second order and are small for the CC-NN, CC-SA, and CC-FA schemes on all grids and for NC schemes on triangular grids; the discretization errors of the CC-NA scheme without clipping do not converge on irregular grids. Accurate gradient reconstruction can be achieved by introducing a local approximate mapping; without approximate mapping, only the NC scheme with weighted LSQ method provides accurate gradients. Defect correction iterations for the CC-NA scheme without clipping diverge; for the NC scheme with weighted LSQ method, the iterations either diverge or converge very slowly. The best option in curved geometries is the CC-SA scheme that offers low complexity, second-order discretization errors, and fast convergence.

Diskin, Boris↗

NASA NTRS1984

Timber inventory using Landsat

The results of recent efforts to apply Landsat MSS imagery, in concert with topological maps, to forestry timber inventories via the FOCIS program are reported. FOCIS (Forests Classification and Inventory System) was defined for inventorying the lumber volume of coniferous tree types in rugged terrain regions. Data from four bands serve as input for unsupervised clustering and iterative labeling of the elevation, slope angle, and subregions of interest. Simulated photographic maps are generated which serve as overlays for regular maps for assessing timber harvests and sales goals. Sample procedures followed in mapping the Eldorado region forests in the Sierra Nevada mountains are discussed.

Strahler, A. H.↗

NASA NTRS2016

SLS Flight Software Testing: Using a Modified Agile Software Testing Approach

NASA's Space Launch System (SLS) is an advanced launch vehicle for a new era of exploration beyond earth's orbit (BEO). The world's most powerful rocket, SLS, will launch crews of up to four astronauts in the agency's Orion spacecraft on missions to explore multiple deep-space destinations. Boeing is developing the SLS core stage, including the avionics that will control vehicle during flight. The core stage will be built at NASA's Michoud Assembly Facility (MAF) in New Orleans, LA using state-of-the-art manufacturing equipment. At the same time, the rocket's avionics computer software is being developed here at Marshall Space Flight Center in Huntsville, AL. At Marshall, the Flight and Ground Software division provides comprehensive engineering expertise for development of flight and ground software. Within that division, the Software Systems Engineering Branch's test and verification (T&V) team uses an agile test approach in testing and verification of software. The agile software test method opens the door for regular short sprint release cycles. The idea or basic premise behind the concept of agile software development and testing is that it is iterative and developed incrementally. Agile testing has an iterative development methodology where requirements and solutions evolve through collaboration between cross-functional teams. With testing and development done incrementally, this allows for increased features and enhanced value for releases. This value can be seen throughout the T&V team processes that are documented in various work instructions within the branch. The T&V team produces procedural test results at a higher rate, resolves issues found in software with designers at an earlier stage versus at a later release, and team members gain increased knowledge of the system architecture by interfacing with designers. SLS Flight Software teams want to continue uncovering better ways of developing software in an efficient and project beneficial manner. Through agile testing, there has been increased value through individuals and interactions over processes and tools, improved customer collaboration, and improved responsiveness to changes through controlled planning. The presentation will describe agile testing methodology as taken with the SLS FSW Test and Verification team at Marshall Space Flight Center.

Bolton, Albanie T.↗

NASA NTRS2005

Protograph based LDPC codes with minimum distance linearly growing with block size

We propose several LDPC code constructions that simultaneously achieve good threshold and error floor performance. Minimum distance is shown to grow linearly with block size (similar to regular codes of variable degree at least 3) by considering ensemble average weight enumerators. Our constructions are based on projected graph, or protograph, structures that support high-speed decoder implementations. As with irregular ensembles, our constructions are sensitive to the proportion of degree-2 variable nodes. A code with too few such nodes tends to have an iterative decoding threshold that is far from the capacity threshold. A code with too many such nodes tends to not exhibit a minimum distance that grows linearly in block length. In this paper we also show that precoding can be used to lower the threshold of regular LDPC codes. The decoding thresholds of the proposed codes, which have linearly increasing minimum distance in block size, outperform that of regular LDPC codes. Furthermore, a family of low to high rate codes, with thresholds that adhere closely to their respective channel capacity thresholds, is presented. Simulation results for a few example codes show that the proposed codes have low error floors as well as good threshold SNFt performance.

minimum decoding↗

NASA NTRS1989

Fourier transform methods in local gravity modeling

New algorithms were derived for computing terrain corrections, all components of the attraction of the topography at the topographic surface and the gradients of these attractions. These algoriithms utilize fast Fourier transforms, but, in contrast to methods currently in use, all divergences of the integrals are removed during the analysis. Sequential methods employing a smooth intermediate reference surface were developed to avoid the very large transforms necessary when making computations at high resolution over a wide area. A new method for the numerical solution of Molodensky's problem was developed to mitigate the convergence difficulties that occur at short wavelengths with methods based on a Taylor series expansion. A trial field on a level surface is continued analytically to the topographic surface, and compared with that predicted from gravity observations. The difference is used to compute a correction to the trial field and the process iterated. Special techniques are employed to speed convergence and prevent oscillations. Three different spectral methods for fitting a point-mass set to a gravity field given on a regular grid at constant elevation are described. Two of the methods differ in the way that the spectrum of the point-mass set, which extends to infinite wave number, is matched to that of the gravity field which is band-limited. The third method is essentially a space-domain technique in which Fourier methods are used to solve a set of simultaneous equations.

Harrison, J. C.↗

NASA NTRS2007

Generative Representations for Automated Design of Robots

A method of automated design of complex, modular robots involves an evolutionary process in which generative representations of designs are used. The term generative representations as used here signifies, loosely, representations that consist of or include algorithms, computer programs, and the like, wherein encoded designs can reuse elements of their encoding and thereby evolve toward greater complexity. Automated design of robots through synthetic evolutionary processes has already been demonstrated, but it is not clear whether genetically inspired search algorithms can yield designs that are sufficiently complex for practical engineering. The ultimate success of such algorithms as tools for automation of design depends on the scaling properties of representations of designs. A nongenerative representation (one in which each element of the encoded design is used at most once in translating to the design) scales linearly with the number of elements. Search algorithms that use nongenerative representations quickly become intractable (search times vary approximately exponentially with numbers of design elements), and thus are not amenable to scaling to complex designs. Generative representations are compact representations and were devised as means to circumvent the above-mentioned fundamental restriction on scalability. In the present method, a robot is defined by a compact programmatic form (its generative representation) and the evolutionary variation takes place on this form. The evolutionary process is an iterative one, wherein each cycle consists of the following steps: 1. Generative representations are generated in an evolutionary subprocess. 2. Each generative representation is a program that, when compiled, produces an assembly procedure. 3. In a computational simulation, a constructor executes an assembly procedure to generate a robot. 4. A physical-simulation program tests the performance of a simulated constructed robot, evaluating the performance according to a fitness criterion to yield a figure of merit that is fed back into the evolutionary subprocess of the next iteration. In comparison with prior approaches to automated evolutionary design of robots, the use of generative representations offers two advantages: First, a generative representation enables the reuse of components in regular and hierarchical ways and thereby serves a systematic means of creating more complex modules out of simpler ones. Second, the evolved generative representation may capture intrinsic properties of the design problem, so that variations in the representations move through the design space more effectively than do equivalent variations in a nongenerative representation. This method has been demonstrated by using it to design some robots that move, variously, by walking, rolling, or sliding. Some of the robots were built (see figure). Although these robots are very simple, in comparison with robots designed by humans, their structures are more regular, modular, hierarchical, and complex than are those of evolved designs of comparable functionality synthesized by use of nongenerative representations.

Homby, Gregory S.↗

NASA NTRS1983

Transonic small disturbance calculations including entropy corrections

Murman's fully conservative mixed type finite-difference operators are first modified. A special sonic point operator with an iterative damping term is introduced which helps the convergence and does not affect the spatial conservative differences. Reliable calculations with second order supersonic schemes are obtained using two sonic operators, the regular sonic point operator followed by a first order supersonic scheme. Also, shock point operator is shown to be equivalent to fitting a locally normal shock terminating the supersonic region. The potential calculations are then modified to account for the non-isentropic jump conditions using a simple shock fitting procedure based on Prandtl relation. The entropy increase across the shock is calculated in terms of the Mach number upstream of the shock and the effect of the generated vorticity is estimated via Crocco relation. Different examples are calculated and extensions to the full potential equation are discussed.

Hafez, M.↗

NASA NTRS2015

Implementing NASA's Capability-Driven Approach: Insight into NASA's Processes for Maturing Exploration Systems

NASA is engaged in transforming human spaceflight. The Agency is shifting from an exploration-based program with human activities focused on low Earth orbit (LEO) and targeted robotic missions in deep space to a more sustainable and integrated pioneering approach. Through pioneering, NASA seeks to address national goals to develop the capacity for people to work, learn, operate, live, and thrive safely beyond the Earth for extended periods of time. However, pioneering space involves more than the daunting technical challenges of transportation, maintaining health, and enabling crew productivity for long durations in remote, hostile, and alien environments. This shift also requires a change in operating processes for NASA. The Agency can no longer afford to engineer systems for specific missions and destinations and instead must focus on common capabilities that enable a range of destinations and missions. NASA has codified a capability driven approach, which provides flexible guidance for the development and maturation of common capabilities necessary for human pioneers beyond LEO. This approach has been included in NASA policy and is captured in the Agency's strategic goals. It is currently being implemented across NASA's centers and programs. Throughout 2014, NASA engaged in an Agency-wide process to define and refine exploration-related capabilities and associated gaps, focusing only on those that are critical for human exploration beyond LEO. NASA identified 12 common capabilities ranging from Environmental Control and Life Support Systems to Robotics, and established Agency-wide teams or working groups comprised of subject matter experts that are responsible for the maturation of these exploration capabilities. These teams, called the System Maturation Teams (SMTs) help formulate, guide and resolve performance gaps associated with the identified exploration capabilities. The SMTs are defining performance parameters and goals for each of the 12 capabilities, developing maturation plans and roadmaps for the identified performance gaps, specifying the interfaces between the various capabilities, and ensuring that the capabilities mature and integrate to enable future pioneering missions. By managing system development through the SMTs instead of traditional NASA programs and projects, the Agency is shifting from mission-driven development to a more flexible, capability-driven development. The process NASA uses to establish, integrate, prioritize, and manage the SMTs and associated capabilities is iterative. NASA relies on the Human Exploration and Operation Mission Directorate's SMT Integration Team within Advanced Exploration Systems to coordinate and facilitate the SMT process. The SMT Integration team conducts regular reviews and coordination meetings among the SMTs and has developed a number of tools to help the Agency implement capability driven processes. The SMT Integration team is uniquely positioned to help the Agency coordinate the SMTs and other processes that are making the capability-driven approach a reality. This paper will introduce the SMTs and the 12 key capabilities they represent. The role of the SMTs will be discussed with respect to Agency-wide processes to shift from mission-focused exploration to a capability-driven pioneering approach. Specific examples will be given to highlight systems development and testing within the SMTs. These examples will also show how NASA is using current investments in the International Space Station and future investments to develop and demonstrate capabilities. The paper will conclude by describing next steps and a process for soliciting feedback from the space exploration community to refine NASA's process for developing common exploration capabilities.

Williams-Byrd, Julie↗

NASA NTRS2023

On More than Two Decades of Celestial Reference Frame VLBI Observations in the Deep South: IVS-CRDS (1995 - 2021)

The International VLBI Service for Geodesy & Astrometry (IVS) regularly provides high-quality data to produce Earth Orientation Parameters (EOP), and for the maintenance and realization of the International Terrestrial and Celestial Reference Frames, ITRF and ICRF. The first iteration of the celestial reference frame (CRF) at radio wavelengths, the ICRF1, was adopted by the International Astronomical Union (IAU) in 1997 to replace the FK5 optical frame. Soon after, the IVS began official operations and in 2009 there was a significant increase in data sufficient to warrant a second iteration of the CRF, ICRF2. The most recent ICRF3, was adopted by the IAU in 2018. However, due to the geographic distribution of observing stations being concentrated in the Northern hemisphere, CRFs are generally weaker in the South due to there being fewer Southern Hemisphere observations. To increase the Southern Hemisphere observations, and the density, precision of the sources, a series of deep South observing sessions was initiated in 1995. This initiative in 2004 became the IVS Celestial Reference Frame Deep South (IVS-CRDS) observing program. This paper covers the evolution of the CRDS observing program for the period 1995 to 2021, details the data products and results, and concludes with a summary of upcoming improvements to this ongoing project.

VLBI↗

NASA NTRS1992

Mode interaction in stiffened composite shells under combined mechanical and thermal loadings

Stiffened shells of various configurations fabricated out of composite materials find extensive applications in aircraft structures. Two distinctive modes of buckling dominate structural response of stiffened panels, viz. the short-wave local mode in which the shell skin buckles essentially between the stiffeners and the long-wave overall mode in which the shell skin buckles carrying the stiffeners with it. In optimized designs, the critical stresses corresponding to these modes of buckling would be close to each other. This leads to a nonlinear mode interaction which is recognized to be the principal cause of the failure of stiffened structures. If the structure is subjected to through-the-thickness thermal gradients, then large-wave bending effects would begin to occur well below the overall critical load and these would play the role of overall imperfections. The load carrying capacity would be significantly diminished as a result of interaction of local buckling with overall thermal distortions. The analysis of this problem using standard finite element techniques can be shown to be prohibitively expensive for design iterations. A concept which would greatly facilitate the analysis of mode interaction is advanced. We note that the local buckling occurs in a more or less periodic pattern in a structure having regular spacings of stiffeners. Thus it is a relatively simple matter to analyze the local buckling and the second order effects (which are essential for modeling postbuckling phenomena) using a unit cell of the structure. Once analyzed, these dormations are embedded in a shell element. Thus, a shell element could span several half-waves of local buckling and still be able to depict local buckling effects with requisite accuracy. A major consequence of the interaction of overall buckling/bending is the slow variation of the local buckling amplitude across the structure - the phenomenon of 'amplitude modulation' - and this is accounted for in the present model by letting the scaling parameter of the local mode vary according to a 'slowly varying' function. The construction of the analytical model involves essentially two stages and these are described briefly.

Sridharan, Srinivasan↗

NASA NTRS1991

Asynchronous sequential circuit design using pass transistor iterative logic arrays

The iterative logic array (ILA) is introduced as a new architecture for asynchronous sequential circuits. This is the first ILA architecture for sequential circuits reported in the literature. The ILA architecture produces a very regular circuit structure. Moreover, it is immune to both 1-1 and 0-0 crossovers and is free of hazards. This paper also presents a new critical race free STT state assignment which produces a simple form of design equations that greatly simplifies the ILA realizations.

Liu, M. N.↗

NASA NTRS1979

A three-dimensional viscous/potential flow interaction analysis method for multi-element wings: Modifications to the potential flow code to allow part-span, high-lift devices and close-interference calculations

The description of the modified code includes details of a doublet subpanel technique in which panels that are close to a velocity calculation point are replaced by a subpanel set. This treatment gives the effect of a higher panel density without increasing the number of unknowns. In particular, the technique removes the close approach problem of the earlier singularity model in which distortions occur in the detailed pressure calculation near panel corners. Removal of this problem allowed a complete wake relaxation and roll-up iterative procedure to be installed in the code. The geometry package developed for the new technique and also for the more general configurations is based on a multiple patch scheme. Each patch has a regular array of panels, but arbitrary relationships are allowed between neighboring panels at the edges of adjacent patches. This provides great versatility for treating general configurations.

Maskew, B.↗

NASA NTRSDate not supplied

Rational Design of Nanoplasmonic Array Geometries for Biosensing

Background: Molecular diagnostics provide early and accurate diagnosis, which is essential for the prevention and treatment of infectious as well as chronic diseases. These tests are designed to detect disease-specific bioanalytes such as nucleic acid (DNA or RNA) or protein (antigens, antibodies) biomarkers. In the context of infectious disease diagnosis, nucleic acid-based detection methods are known to provide more specific and sensitive results. Here, the presence of a unique sequence belonging to the pathogenic genomic material is targeted to identify species, organism, genera and/or antimicrobial resistant gene markers. The majority of the common nucleic acid based diagnostic techniques require amplification (polymerase chain reaction, isothermal amplification etc.) of the pathogenic genetic material prior to detection impacting diagnostic speed, complexity, and cost thereby limiting ease of use. Thus, the development of simplified nucleic acid-based diagnostics that can be even used in resource-poor settings may hugely benefit patients across the globe. Nanopath is a molecular diagnostics company utilizing a solid-state nanosensor to enable sequence-specific detection of target nucleic acids without the need of amplification. These nanostructures enable ultra-sensitive biomarker detection using geometric, feature-dependent properties highly dependent on the local dielectric environment, allowing them to be sensitive to low concentration binding events. This paper describes an application of this approach to provide highly relevant clinical information within a single doctor’s office visit. Intro: The Nanopath team is in collaboration with NASA (National Aeronautics and Space Administration) and NIST (National Institute of Standards and Technology) to push the bounds of the fundamental physics associated with their biosensing platform. The ability of metals to support electromagnetic surface waves gives rise to surface plasmons when optically illuminated. This property, and its strong sensitivity to changes in the local refractive index, allows for the use of metal nanoparticles as ultra-sensitive transducers. In prior work by members of this team, ensembles of randomly oriented nanoparticles (i.e., colloidal nanorods dispersed on chip) were employed for sequence-specific nucleic acid sensing (1-3). While these particle sensors have the advantage of rapid fabrication, they suffer from low sensitivity and quality factor due to the random particle dispersity. In contrast, in this study we employ ordered array nanoparticle ensembles which can be used to improve sensor sensitivity and figure-of-merit. Study Methods Overview: In this talk, we detail the results of sensing experiments and computational simulations to outline a rational design of the structure of these plasmonic nanoparticle arrays for biomolecular sensing. Through simulation and experiment, we iteratively tailor nanostructure dimension to provide high quality signal and large resonance shifts upon modeled nucleic acid binding. In particular, full-wave electromagnetic simulations were conducted using Lumerical photonic simulation software in which periodic boundary conditions were applied in the x- and y- dimensions for each of the nanoplasmonic sensor geometries. To simulate the resonance response to changes in the bulk solution in contact with the sensor surface, the refractive index of the surrounding media was changed appropriately. Nucleic acid hybridization events were modeled using either using spherical structures approximating the relevant radius of genomic material as estimated by polymer models, or as conformal layers with the known refractive indices for nucleic acids. On the basis of initial simulations, nanosensors were fabricated using traditional electron-beam lithography protocols at NIST. To evaluate consensus between simulations and experiments, bulk sensing experiments were carried out in which the resonance peaks were obtained by submerging the sensors in refractive index standards. Key nanosensor characteristics including resonance peak locations, resonance peak shifts as a function of refractive index, and figure of merit (FOM) of extinction curves were examined between the experimental and simulation results prior to proceeding with simulations on additional geometries and more complex solution conditions, and further device fabrication. This iterative process is repeated toward a rational design of nanoplasmonic array geometries for biosensing optimizing response for targeted disease detection. In summary, this study puts forth a methodology for rational design and characterization of regularly spaced nanoparticle arrays for optics-based biosensing. The results of this study will allow for more informed design of nanostructure geometries towards sequence-specific nucleic acid detection. These improved designs have the potential to improve clinical sensitivity and limit-of-detection across disease indication.

sensor↗

NASA NTRS2009

LDPC Codes with Minimum Distance Proportional to Block Size

Low-density parity-check (LDPC) codes characterized by minimum Hamming distances proportional to block sizes have been demonstrated. Like the codes mentioned in the immediately preceding article, the present codes are error-correcting codes suitable for use in a variety of wireless data-communication systems that include noisy channels. The previously mentioned codes have low decoding thresholds and reasonably low error floors. However, the minimum Hamming distances of those codes do not grow linearly with code-block sizes. Codes that have this minimum-distance property exhibit very low error floors. Examples of such codes include regular LDPC codes with variable degrees of at least 3. Unfortunately, the decoding thresholds of regular LDPC codes are high. Hence, there is a need for LDPC codes characterized by both low decoding thresholds and, in order to obtain acceptably low error floors, minimum Hamming distances that are proportional to code-block sizes. The present codes were developed to satisfy this need. The minimum Hamming distances of the present codes have been shown, through consideration of ensemble-average weight enumerators, to be proportional to code block sizes. As in the cases of irregular ensembles, the properties of these codes are sensitive to the proportion of degree-2 variable nodes. A code having too few such nodes tends to have an iterative decoding threshold that is far from the capacity threshold. A code having too many such nodes tends not to exhibit a minimum distance that is proportional to block size. Results of computational simulations have shown that the decoding thresholds of codes of the present type are lower than those of regular LDPC codes. Included in the simulations were a few examples from a family of codes characterized by rates ranging from low to high and by thresholds that adhere closely to their respective channel capacity thresholds; the simulation results from these examples showed that the codes in question have low error floors as well as low decoding thresholds. As an example, the illustration shows the protograph (which represents the blueprint for overall construction) of one proposed code family for code rates greater than or equal to 1.2. Any size LDPC code can be obtained by copying the protograph structure N times, then permuting the edges. The illustration also provides Field Programmable Gate Array (FPGA) hardware performance simulations for this code family. In addition, the illustration provides minimum signal-to-noise ratios (Eb/No) in decibels (decoding thresholds) to achieve zero error rates as the code block size goes to infinity for various code rates. In comparison with the codes mentioned in the preceding article, these codes have slightly higher decoding thresholds.

Divsalar, Dariush↗

NASA NTRS1974

The numerical calculation of laminar boundary-layer separation

Iterative finite-difference techniques are developed for integrating the boundary-layer equations, without approximation, through a region of reversed flow. The numerical procedures are used to calculate incompressible laminar separated flows and to investigate the conditions for regular behavior at the point of separation. Regular flows are shown to be characterized by an integrable saddle-type singularity that makes it difficult to obtain numerical solutions which pass continuously into the separated region. The singularity is removed and continuous solutions ensured by specifying the wall shear distribution and computing the pressure gradient as part of the solution. Calculated results are presented for several separated flows and the accuracy of the method is verified. A computer program listing and complete solution case are included.

Klineberg, J. M.↗