#### Filter Results:

- Full text PDF available (9)

#### Publication Year

1986

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- B A Kast, M K Giles, S D Lindell, D L Flannery
- Applied optics
- 1989

Ternary modulation can be achieved with a single SLM and improvedc orrelationd iscriminationc an bee xperimentally realized.

- D L Flannery, J S Loomis, M E Milkovich
- Applied optics
- 1988

A method of formulating ternary-valued (-1,0,1) correlation filters based on the ratio of spectral energies of target and nontarget patterns is proposed, and performance of such filters is investigated by computer simulations of correlation. The results confirm the intuitive expectation that such filters can enhance signalto- clutter and discrimination… (More)

- D. L. Flannery
- 1995

It is conjectured that binary cocyclic matrices are a uniform source of Hadamard matrices. In testing this conjecture, it is useful to have a general method of calculating cocyclic matrices. We present such a method in this paper. The method draws on standard cohomology theory of finite groups. In particular we employ the Universal Coefficient Theorem,… (More)

- A. S. Detinko, D. L. Flannery
- J. Symb. Comput.
- 2008

In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier's archiving and manuscript policies are encouraged to visit: Abstract We develop methods for computing with matrix groups defined over a range of… (More)

- A. S. Detinko, D. L. Flannery, E. A. O'Brien
- J. Symb. Comput.
- 2013

In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier's archiving and manuscript policies are encouraged to visit: a r t i c l e i n f o a b s t r a c t We present a uniform methodology for computing… (More)

We survey currently available algorithms for computing with matrix groups over infinite domains. We discuss open problems in the area, and avenues for further development.

This article examines aspects of the theory of locally nilpotent linear groups. We also present a new classification result for locally nilpotent linear groups over an arbitrary field F. Linear (matrix) groups are a commonly used concrete representation of groups. The first investigations of linear groups were undertaken in the second half of the 19th… (More)

- A. S. Detinko, D. L. Flannery
- J. Symb. Comput.
- 2009

In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier's archiving and manuscript policies are encouraged to visit: a b s t r a c t We provide a new, practical algorithm for deciding finiteness of… (More)

- D L Flannery, A M Biernacki, J S Loomis, S L Cartwright
- Applied optics
- 1986

- D L Flannery, J S Loomis, M E Milkovich
- Applied optics
- 1988

The basic design elements of binary phase-only filters (BPOFs) include the angle of a thresholding line in the complex plane and the offset from a center reference point of the pattern transformed in constructing the filter. These factors are analyzed, and a general formalism for the threshold-line angle variation is presented and related to the special… (More)