Jeffery Zucker - Academia.edu (original) (raw)

Papers by Jeffery Zucker

Journal of Applied Physics, 1972

Interdigital transducers deposited on glass were used to couple acoustic waves in the 10–50-MHz f... more Interdigital transducers deposited on glass were used to couple acoustic waves in the 10–50-MHz frequency range into a b-cut (010) TGS plate from room temperature to slightly above the ferroelectric phase transition temperature, Tc = 49.1°C. The coupling peaked near Tc. Two major modes were observed. Evidence is given identifying the higher frequency mode with a longitudinal bulk wave and the lower frequency mode with a bulk shear wave. The velocities of the upper and lower frequency modes for temperatures near Tc were found from their resonant frequencies to be (4.18±0.06)×105 and (2.56±0.06)×105 cm∕sec, respectively. Data on the temperature variation of the velocity of the low frequency mode are given. Estimates of the effective piezoelectric coupling constants for the two modes are deduced from the data.

Journal of Philosophical Logic, 1978

International Colloquium on Automata, Languages and Programming, 1989

Without Abstract

Computability

We investigate to what extent certain well-known results of classical computability theory on the... more We investigate to what extent certain well-known results of classical computability theory on the natural numbers hold in the context of generalised computability theories on the real numbers.

Mathematical and Computational Approaches in Advancing Modern Science and Engineering, 2016

Proof Theory, Jul 1, 1993

We generalise to abstract many-sorted algebras the classical proof-theoretic result due to Parson... more We generalise to abstract many-sorted algebras the classical proof-theoretic result due to Parsons and Mints that an assertion " x $ y P(x,y){\forall} x {\exists} y {\it P}(x,y) (where P is ∑01^{\rm 0}_{\rm 1}), provable in Peano arithmetic with ∑01^{\rm 0}_{\rm 1} induction, has a primitive recursive selection function. This involves a corresponding generalisation to such algebras of the notion of primitive recursiveness. The main difficulty encountered in carrying out this generalisation turns out to be the fact that equality over these algebras may not be computable, and hence atomic formulae in their signatures may not be decidable. The solution given here is to develop an appropriate concept of realisability of existential assertions over such algebras, and to work in an intuitionistic proof system. This investigation gives some insight into the relationship between verifiable specifications and computability on topological data types such as the reals, where the atomic fo...

Functional Programming, Concurrency, Simulation and …, 1993

... Remark ~. To correlate this semantic definition with the one in the following paper, we can u... more ... Remark ~. To correlate this semantic definition with the one in the following paper, we can use the notation [p] (See Remark 1 in ~3, loc. cir.) Remark $. ... 3 Fixed point characterizations We first define some notation. ... 4 Safety, Liveness and Fairness Properties ...

Processes are mathematical objects which are elements of domains in the sense of Scott and Plotki... more Processes are mathematical objects which are elements of domains in the sense of Scott and Plotkin. Process domains are obtained as solutions of equations solved by techniques from metric topology as advocated by Nivat. We discuss how such processes can be used to assign meanings to languages with concurrency, culminating in a definition of the ADA rendezvous. An important intermediate step is a version of Hoare's CSP for which we describe a process semantics and which is used, following Gerth, as target for the translation of the ADA fragment. Furthermore, some ideas will be presented on a mathematically tractable treatment of fairness in the general framework of processes.

The Computer Journal, 2013

Continuity of operators on continuous and discrete time streams. Theoret. Comput. Sci., 412, 3378... more Continuity of operators on continuous and discrete time streams. Theoret. Comput. Sci., 412, 3378-3403), Tucker and Zucker present a model for the semantics of analog networks operating on streams from topological algebras. Central to their model is a parametrized stream operator representing the network along with a theory that concerns the existence, uniqueness, continuity and computability of a fixed point of that stream operator. We narrow the scope of this paper from general topological algebras to algebras of streams that assume values only from a Banach space. This restriction facilitates the definition of a fairly broad class of stream operators to which the theory described in the above two papers applies. As a demonstration in their original work, the authors provide two case studies: analog networks that model the behavior of simple mass-spring-damper systems. The case studies showcase the theory well, but they seem to require the imposition of somewhat peculiar conditions on the parameters (the masses, the spring constants and the damping coefficients). The extra conditions-while not catastrophic to the case studies-make them somewhat unsatisfying. We show here that while their original mass-spring-damper models do not fall within our new class, they can be trivially reconfigured into equivalent models that do. This modification obviates the extra conditions on the parameters.

Bulletin of Symbolic Logic, 2002

Formal Aspects of Computing, 1996

We develop a theory of function tables, similar to, and inspired by, that given in the work of D.... more We develop a theory of function tables, similar to, and inspired by, that given in the work of D. Parnas. We consider, in particular, two classes of function tables: normal and inverted. We study e ective transformations between tables of these two classes, as well as transformations which change the dimension of a table. We also consider the interrelationship between these three types of transformation.