On 9 Mar, John R Pierce wrote:
>> Dr. Milstein has a background, i.e., a CV somewhere. Can someone please
>> provide it?
>
> I did some poking around the web on his name, found only one thing...
>
> Various bibliographical references to a couple of journal papers
Searching for "Milstein J" in our library's database turned up
seven promising items. Three of them are the same as John turned
up. Luckily they have abstracts listed. Unluckily, they don't mean
anything to me beyond "there's a link between linear algebra and
finite automata". Of the seven items,some are old, and may be by
another J Milstein. Handle with care.
* Moeller TL, Milstein J
Generalized algebraic structures for the representation of discrete systems
LINEAR ALGEBRA APPL 274: 161-191 APR 15 1998
* Moeller TL, Milstein J
Algebraic representations for finite-state machines .2. Module formulation
LINEAR ALGEBRA APPL 247: 133-150 NOV 1 1996
* Moeller TL, Milstein J
Algebraic representations for finite-state machines .1. Monoid-ring formulation
LINEAR ALGEBRA APPL 239: 109-126 MAY 1996
* MILSTEIN J
SPLINE AND WEIGHTED RANDOM DIRECTIONS METHOD FOR NONLINEAR OPTIMIZATION
MATH BIOSCI 74: (2) 247-256 1985
* MILSTEIN J, BREMERMANN HJ
PARAMETER IDENTIFICATION OF THE CALVIN PHOTOSYNTHESIS CYCLE
J MATH BIOL 7: (2) 99-116 1979
* MILSTEIN J
ERROR ESTIMATES FOR RATE CONSTANTS OF INVERSE PROBLEMS
SIAM J APPL MATH 35: (3) 479-487 1978
In more detail these are:
----------------------------------------------------------------------
Generalized algebraic structures for the representation of discrete systems
Moeller TL, Milstein J
LINEAR ALGEBRA AND ITS APPLICATIONS
274: 161-191 APR 15 1998
Abstract:
General algebraic structures are introduced and used to develop
epresentations for discrete systems. Properties of the structures and
mappings between the structures are derived. The first general structure
presented is based on a free monoid of m-tuples of mappings. A. second
general structure is presented that is based on a commutative ring of
functions with finite support. These structures are specialized to
obtain representations for three models of discrete systems: finite-state
machines, Petri nets, and inhibitor nets. Uniqueness of the
representations is established, and examples of representations for each
type of system are given. (C) 1998 Elsevier Science Inc.
Addresses:
Moeller TL, M1-123 Aerosp, POB 92957, Los Angeles, CA 90009 USA.
Aerospace Corp, El Segundo, CA 90245 USA.
Publisher: ELSEVIER SCIENCE INC, NEW YORK
ISSN: 0024-3795
----------------------------------------------------------------------
Algebraic representations for finite-state machines .2. Module formulation
Moeller TL, Milstein J
LINEAR ALGEBRA AND ITS APPLICATIONS
247: 133-150 NOV 1 1996
Abstract:
We show that finite-state machines can be represented as unique
elements of special modules of functions. We obtain a module
representation for the machine with the least number of states over a
class of equivalent machines. We present a unique factorization of this
representation. We construct an array which characterizes all state
transitions and is identical for all machines in the equivalence class.
Further, we show that the module representation for any finite-state
machine is contained in a free submodule, and can be written as a linear
combination of elements of submodules obtained from equivalent machine
states. Module representations and associated arrays are given for two
examples.
Addresses: AEROSP CORP, EL SEGUNDO, CA 90245.
Publisher: ELSEVIER SCIENCE INC, NEW YORK
ISSN: 0024-3795
----------------------------------------------------------------------
Algebraic representations for finite-state machines .1. Monoid-ring formulation
Moeller TL, Milstein J
LINEAR ALGEBRA AND ITS APPLICATIONS
239: 109-126 MAY 1996
Abstract:
Special algebraic structures, which are rings of functions with finite
support, are introduced. These structures are used to develop
representations for finite-state machines. Three equivalent
representations for finite-state machines are presented. The first
is given in terms of elements of a monoid ring based on a finite set.
The second is given in terms of elements of a monoid ring based on
n-tuples. The third is given in terms of the polynomial ring in 2n
indeterminates. The representations are shown to be unique, and
examples of them are given.
Addresses: AEROSP CORP, EL SEGUNDO, CA 90245.
Publisher: ELSEVIER SCIENCE INC, NEW YORK
ISSN: 0024-3795
----------------------------------------------------------------------
SPLINE AND WEIGHTED RANDOM DIRECTIONS METHOD FOR NONLINEAR OPTIMIZATION
MILSTEIN J
MATHEMATICAL BIOSCIENCES
74: (2) 247-256 1985
Addresses: MILSTEIN J, ISRAEL INST TECHNOL,
DEPT MATH, IL-32000 HAIFA, ISRAEL.
Publisher: ELSEVIER SCIENCE INC, NEW YORK
ISSN: 0025-5564
----------------------------------------------------------------------
PARAMETER IDENTIFICATION OF THE CALVIN PHOTOSYNTHESIS CYCLE
MILSTEIN J, BREMERMANN HJ
JOURNAL OF MATHEMATICAL BIOLOGY
7: (2) 99-116 1979
Addresses: MILSTEIN J, UNIV SO CALIF, DEPT MATH, LOS ANGELES, CA 90007.
UNIV CALIF BERKELEY, DEPT MATH, BERKELEY, CA 94720.
UNIV CALIF BERKELEY, DIV MED PHYS, BERKELEY, CA 94720.
Publisher: SPRINGER VERLAG, NEW YORK
ISSN: 0303-6812
----------------------------------------------------------------------
ERROR ESTIMATES FOR RATE CONSTANTS OF INVERSE PROBLEMS
MILSTEIN J
SIAM JOURNAL ON APPLIED MATHEMATICS
35: (3) 479-487 1978
Addresses: UNIV CALIF LOS ANGELES, DEPT MATH, LOS ANGELES, CA 90024.
Publisher: SIAM PUBLICATIONS, PHILADELPHIA
ISSN: 0036-1399
----------------------------------------------------------------------
FITTING MULTIPLE TRAJECTORIES SIMULTANEOUSLY TO A MODEL OF INDUCIBLE ENZYME-SYNTHESIS
MILSTEIN J
MATHEMATICAL BIOSCIENCES
40: (3-4) 175-184 1978
Addresses: MILSTEIN J, UNIV SO CALIF, DEPT MATH, LOS ANGELES, CA 90007.
Publisher: ELSEVIER SCIENCE INC, NEW YORK
ISSN: 0025-5564
----------------------------------------------------------------------
HTH,
P.
--
Pete Evans, Gradual Student [EMAIL PROTECTED]
"Your luck has been completely changed today.
Lucky Numbers 40 16 37 32 19 43"
________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
