#### Filter Results:

- Full text PDF available (5)

#### Publication Year

1985

2007

- This year (0)
- Last 5 years (0)
- Last 10 years (2)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Larrabee L. Strow, Scott E. Hannon, Sergio De Souza-Machado, Howard E. Motteler, David C. Tobin
- IEEE Trans. Geoscience and Remote Sensing
- 2003

We present a new technique for the fast computation of near-monochromatic atmospheric transmittances in the infrared, utilizing compressed lookup tables, that is well suited for nadir viewing satellite and airplane observations. The algorithm is very simple to use in radiative transfer codes and is easily adapted to provide analytic Jacobians of radiances.… (More)

- Howard E. Motteler, Anthony Chung, Deepinder P. Sidhu
- Protocol Test Systems
- 1993

- H E Motteler, L L Strow, L McMillin, J A Gualtieri
- Applied optics
- 1995

Two methods for performing clear-air temperature retrievals from simulated radiances for the Atmospheric Infrared Sounder are investigated. Neural networks are compared with a well-known linear method in which regression is performed after a change of bases. With large channel sets, both methods can rapidly perform clear-air retrievals over a variety of… (More)

- Deepinder P. Sidhu, Howard E. Motteler, Raghu Vallurupalli
- IEEE/ACM Trans. Netw.
- 1993

AbstructConsider a protocol specification represented as a fully specified Mealy automata, and the problem of testing an implementation for conformance to such a specification. No single sequence-based test can be completely reliable, if we allow for the possibility of an implementation with an unknown number of extra states. We define a hierarchy of test… (More)

- Anthony Chung, Howard E. Motteler, Deepinder P. Sidhu
- Computers and Their Applications
- 2000

- Howard E. Motteler, Anthony Chung, Deepinder P. Sidhu
- IEEE Trans. Communications
- 1995

- Howard E. Motteler, Carl H. Smith
- International Journal of Computer & Information…
- 1985

For common data flow schemes, the number of copies of tokens made during a computation is shown to be a Blum complexity measure.(1) Results from abstract complexity theory (see Ref. 2) then hold for the copy measure, indicating, for example, that any implementation of a data flow processor will be constrained by its ability to copy tokens. The copy measure… (More)

- Howard E. Motteler, Deepinder P. Sidhuy
- 2007

An iteration system is a model of parallel computation, in which a state vector is repeatedly updated by a non-deterministically selected set of functions. Such a system converges from an initial state if after some sequence of transitions it thereafter remains in a set of desirable states. We consider both convergence to a xpoint and to a set of values,… (More)