#
Research Institute for Advanced Computer Science (U.S.)
Resource Information
The organization ** Research Institute for Advanced Computer Science (U.S.)** represents an institution, an association, or corporate body that is associated with resources found in **Houston Public Library**.

The Resource
Research Institute for Advanced Computer Science (U.S.)
Resource Information

The organization

**Research Institute for Advanced Computer Science (U.S.)**represents an institution, an association, or corporate body that is associated with resources found in**Houston Public Library**.- Label
- Research Institute for Advanced Computer Science (U.S.)

## Context

Context of Research Institute for Advanced Computer Science (U.S.)#### Contributor of

- A biconjugate gradient type algorithm on massively parallel architectures
- A browsing tool for the Internet logical library of the HPCC software exchange
- A class of designs for a sparse distributed memory
- A comparison of design variables for control theory based airfoil optimization
- A deterministic particle method for one-dimensional reaction-diffusion equations
- A distributed program composition system
- A fast sorting algorithm for a hypersonic rarefied flow particle simulation on the connection machine
- A fast, preconditioned conjugate gradient Toeplitz solver
- A look-ahead variant of the Lanczos algorithm and its application to the quasi-minimal residual method for non-Hermitian linear systems
- A parallel algorithm for the Eigenvalues and Eigenvectors of a general complex matrix
- A portable MPI-based parallel vector template library
- A restricted signature normal form for Hermitian matrices, quasi-spectral decompositions, and applications
- A review and analysis of neural networks for classification of remotely sensed multispectral imagery
- A survey of visual preprocessing and shape representation techniques
- A system performance throughput model applicable to advanced manned telescience systems
- AMR on the CM-2
- About time
- Aerodynamic design optimization via reduced Hessian SQP with solution refining
- Aerodynamic shape optimization of complex aircraft configurations via an adjoint formulation
- Aerodynamic shape optimization of wing and wing-body configurations using control theory
- Aligning parallel arrays to reduce communication
- Ames life sciences telescience testbed evaluation
- An O(log2N) parallel algorithm for computing the Eigenvalues of a symmetric tridiagonal matrix
- An alternative design for a sparse distributed memory
- An aspect ratio bound for triangulating a d-grid cut by a hyperplane
- An assessment of the connection machine
- An edge-based solution-adaptive method applied to the AIRPLANE code
- An efficient multiblock method for aerodynamic analysis and design on distributed memory systems : to be presented at the AIAA 13th Computational Fluid Dynamics Conference, June 1997
- An empirical investigation of sparse distributed memory using discrete speech recognition
- An implementation of the QMR method based on coupled two-term recurrences
- An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices
- An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices, Part I
- An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices, Part II
- An object-oriented approach to nested data parallelism
- Analysis and design of numerical schemes for gas dynamics 1 : artificial diffusion, upwind biasing, limiters and their effect on accuracy and multigrid convergence
- Analysis and design of numerical schemes for gas dynamics 2 : artificial diffusion, discrete shock structure
- Analysis of FDDI synchronous traffic delays
- Analysis of a parallel multigrid algorithm
- Application of Krylov exponential propagation to fluid dynamics equations
- Array distribution in data-parallel programs : -
- Automatic blocking of nested loops
- BIRD : a general interface for sparse distributed memory simulators
- Bayesian learning
- Benchmarking and performance analysis of the CM-2
- Beyond formalism
- Bidiagonalization and symmetric tridiagonalization by systolic arrays
- Block LU factorization
- CFD analysis and design optimization using parallel computers
- Capacity for patterns and sequences in Kanerva's SDM as compared to other associative memeory models
- Cerebellar models of associative memory : three papers from IEEE COMPCON Spring '89
- Chebyshev polynomials are not always optimal
- Collaboration technology and space science
- Collision integrals and high temperature transport properties for N-N, O-O, and N-O
- Comments on event driven animation
- Comparison between sparsely distributed memory and Hopfield-type neural network models
- Comparisons of neural networks to standard techniques for image classification and correlation
- Computation of helicopter rotor acoustics in forward flight
- Computational chemistry research : semi-annual status report, NASA grant NCC 2-431 for the period of January 1987 to July 1987
- Computer networks for remote laboratories in physics and engineering
- Computer viruses
- Conjugate gradient type methods for linear systems with complex symmetric coefficient matrices
- Contour-map encoding of shape for early vision
- Control theory based airfoil design using the Euler equations
- Coping with data from Space Station Freedom
- Development of a sensor coordinated kinematic model for neural network controller training
- Distributed memory approaches for robotic neural controllers
- Distributed user services for supercomputers
- Divergence preserving discrete surface integral methods for Maxwell's curl equations using non-orthogonal unstructured grids
- Dynamics of numerics & spurious behaviors in CFD computations
- Efficient detection of a CW signal with a linear frequency drift
- Efficient load balancing and data remapping for adaptive grid calculations
- Efficient packing of patterns in sparse distributed momory by selective weighting of input bits
- Efficient parallel algorithms for string editing and related problems
- Efficient solution of parabolic equations by Krylov approximation methods
- Efficient solution of parabolic equations by krylov approximation methods
- Efficient, massively parallel Eigenvalue computation
- Energy and maximum norm estimates for nonlinear conservation laws
- Evolutionary tree reconstruction
- Experiences with the Bay Area Gigabit Network Testbed
- Experiments with repartitioning and load balancing adaptive meshes
- Explicitly solvable complex Chebyshev approximation problems related to sine polynomials
- Fast secant methods for the interative solution of large nonsymmetric linear systems
- Final report of the telescience workstation
- Final report on the Workshop on NASA Workstation Technology
- Final report on the first three years of operation of RIACS (1983-85)
- Formally biorthogonal polynomials and a look-ahead Levinson algorithm for general Toeplitz systems
- Fourth order difference methods for hyperbolic IBVP's
- G/SPINES : a hybird of friedman's multivariate adaptive regression splines (MARS) algorithm with Holland's genetic algorithm
- Gaussian windows : a tool for exploring multivariate data
- Generating local addresses and communication sets for data-parallel programs
- Global load balancing with parallel mesh adaption on distributed-memory system
- Globally convergent techniques in nonlinear Newton-Krylov
- HARP : a dynamic inertial spectral partitioner
- High-order centered difference methods with sharp shock resolution
- Highly parallel computation
- Highly parallel sparse Cholesky factorization
- Human error and the search for blame
- Human factors workplace considerations
- Human performance measurement-validation procedures applicable to advanced manned telescience systems
- Implementation of a hypersonic rarefied flow particle simulation on the connection machine
- Improved load distribution in parallel sparse Cholesky factorization
- Increasing levels of assistance in refinement of knowledge-based retrieval systems
- Is random access memory random?
- Is thinking computable?
- Kanerva's sparse distributed memory : an associative memory algorithm well-suited to the connection machine
- Kanerva's sparse distributed memory with multiple hamming thresholds
- Krylov subspace methods for complex non-Hermitian linear systems
- Krylov subspace methods on supercomputers
- Learning to read aloud : a neural network approach using sparse distributed memory
- Load balancing sequences of unstructured adaptive grids
- Load balancing unstructured adaptive grids for CFD problems
- Low dissipative high order shock-capturing methods using characteristic-based filters
- Mapping unstructured grid computations to massively parallel computers
- Mapping unstructured grid problems to the Connection Machine
- Massive parallelism in the future of science
- Memory protection
- Mesh quality control for multiply-refined tetrahedral grids
- Modeling of the Space Station Freedom, data management system
- Modeling reality
- Modelling default and likelihood reasoning as probabalistic reasoning
- Modula-2* : an extension of Modula-2 for highly parallel programs
- Multilevel filtering elliptic preconditioners
- Multiprocessor speed-up, Amdahl's Law, and the activity set model of parallel program behavior
- NASA's unique networking environment
- Network protocols for real-time applications
- Neural networks and MIMD-multiprocessors
- New Bernstein type inequalitites for polynomials on ellipses
- New computational methods for the prediction and analysis of helicopter noise
- Numerical methods in Markov chain modeling
- Numerical solution of large Lyapunov equations
- Numerical solution of large nonsymmetric eignenvalue problems
- On Bernstein type inequalities and a weighted Chebyshev approximation problem on ellipses
- On adapted weighted polynomial preconditioning for Hermitian positive definite matrices
- On evaluating parallel computer systems
- On polynomial preconditioning for indefinite Hermitian matrices
- On the constrained Chebyshev approximation problem on ellipses
- On the dynamics of some grid adaption schemes
- On the parallel solution of parabolic equations
- On the suitability of the connection machine for direct particle simulation
- On the superconvergence of Galerkin methods for hyperbolic IBVP
- Optimal Chebyshev polynomials on ellipses in the complex plane
- Optimal expression evaluation for data parallel architectures
- Optimal moving grids for time-dependent partial differential equations
- Optimal parallel solution of sparse triangular systems
- Optimum aerodynamic design via boundary control
- Ordered fast Fourier transforms on a massively parallel hypercube multiprocessor
- Overview of Krylov subspace methods with applications to control problems
- Parallel matrix multiplication on the Connection Machine
- Performance analysis and portability of the PLUM load balancing system
- Performance analysis of CCSDS path service
- Performance analysis of FDDI
- Performance issues for iterative solvers in device simulation
- Performance of low dissipative high order shock-capturing schemes for shock-turbulence interactions
- Policy issues in interconnecting networks
- Preserving symmetry in preconditioned Krylov subspace methods
- Projection methods for the numerical solution of Markov chain models
- QMR : a quasi-minimal residual method for non-Hermitian linear systems
- Quasi-kernal polynomials and convergance results for quasi-minimal residual iterations
- Queuing in networks of computers
- RIACS final report : January 1, 1996 through September 30, 1996
- Recent advances in Lanczos-based iterative methods for non symmetric linear systems
- Recognition of simple visual images using a sparse distributed memory : some implementations and experiments
- Research summary, January 1989-June 1990
- Runge-Kutta methods for linear ordinary differential equations
- SPARSKIT : a basic toolkit for sparse matrix computations
- Saving all the bits
- Searching for patterns in remote sensing image databases using neural networks
- Simplified half-life methods for the analysis of kinetic data
- Simplified rate-law integration for reactants which are first order in each of two reactants
- Smart instruments and the national collaboratory
- Solving large sparse eigenvalue problems on supercomputers
- Solving the shallow water equations on the Cray X-MP/48 and the Connection Machine 2
- Some fast elliptic solvers on parallel architectures and their complexities
- Some methods of encoding simple visual images for use with a sparse distributed memory, with applications to character recognition
- Sparse disributed memory
- Sparse distributed memory and related models
- Sparse distributed memory principles of operation
- Spectral ordering techniques for incomplete LU preconditioners for CG methods
- Stability and error estimation for component adaptive grid methods
- Statistical prediction with Kanerva's sparse distributed memory
- Stopping computer crimes
- Summation by parts, projections, and stability
- Supersonic wing and wing-body shape optimization using an adjoint formulation
- Telescience testbed pilot program : fifth quartlerly report
- Telescience testbed pilot program : final report, Volume I, executive summary
- Telescience testbed pilot program : final report, Volume II, program results
- Telescience testbed pilot program : final report, Volume III, experiment summaries
- Telescience testbed pilot program : fourth quarterly report
- Telescience testbed pilot program interim report
- Telescience testbedding : an implementation approach
- Television image compression and small animal remote monitoring
- Temporal learning in the cerebellum : the MicroCircuit model
- Tensor-GMRES method for large sparse systems of nonlinear equations
- The "Cortex Transform" as an image preprocessor for sparse distributed memory : an initial study
- The ARPANET after twenty years
- The Internet worm
- The effect of lossy image compression on image classification
- The organization of an autonomous learning system
- The paradigm compiler : mapping a functional language for the connection machine
- The physics of parallel machines
- The role of graphics super-workstations in a supercomputing environment
- Theoretical dissociation energies for ionic molecules
- Threats and countermeasures for network security
- Threats and countermeasures for network security
- Threats and countermeasures for network security
- Toplogical numbering of features on a mesh
- Total recall in distributive associative memories
- Totally parallel multilevel algorithms
- Totally parallel multilevel algorithms for sparse elliptic systems
- Towards the teraflop in CFD
- Two alternate proofs of Wang's lune formula for sparse distributed memory and an integral approximation
- Two demonstrators and a simulator for a sparse, distributed memory
- USRA/RIACS final report on cooperative agreement NCC2-387, July 1, 1992 - December 31, 1992
- Unstructured adaptive mesh computations of rotorcraft high-speed impulsive noise
- Unstructured grids on SIMD torus machines
- User's manual for the Gaussian Windows program
- Using Gaussian Windows to explore a multivariate data set
- Using data tagging to improve the performance of Kanerva's sparse distributed memory
- Using high-performance networks to enable computational aerosciences applications
- Virtual memory
- Wavelet sparse approximate inverse preconditioners
- Weather prediction using a genetic memory
- Weighted graph based ordering techniques for preconditioned conjugate gradient methods
- Will machines ever think?
- Worldnet

#### Focus of

#### Issuing body of

## Embed (Experimental)

### Settings

Select options that apply then copy and paste the RDF/HTML data fragment to include in your application

Embed this data in a secure (HTTPS) page:

Layout options:

Include data citation:

<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.houstonlibrary.org/resource/0rHELLifiXk/" typeof="Organization http://bibfra.me/vocab/lite/Organization"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.houstonlibrary.org/resource/0rHELLifiXk/">Research Institute for Advanced Computer Science (U.S.)</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.houstonlibrary.org/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.houstonlibrary.org/">Houston Public Library</a></span></span></span></span></div>

Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements

### Preview

## Cite Data - Experimental

### Data Citation of the Organization Research Institute for Advanced Computer Science (U.S.)

Copy and paste the following RDF/HTML data fragment to cite this resource

`<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.houstonlibrary.org/resource/0rHELLifiXk/" typeof="Organization http://bibfra.me/vocab/lite/Organization"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.houstonlibrary.org/resource/0rHELLifiXk/">Research Institute for Advanced Computer Science (U.S.)</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.houstonlibrary.org/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.houstonlibrary.org/">Houston Public Library</a></span></span></span></span></div>`