Squier, Richard K.
Overview
Works:  6 works in 14 publications in 1 language and 106 library holdings 

Roles:  Author, Contributor 
Classifications:  BQ4570.S3, 294.3365 
Publication Timeline
.
Most widely held works by
Richard K Squier
Religion and science in the mirror of Buddhism by
Francisca Cho(
Book
)
7 editions published between 2015 and 2016 in English and held by 77 WorldCat member libraries worldwide
This book offers a Buddhist perspective on the conflict between religion and science in contemporary western society. Examining Buddhist history, authors Francisca Cho and Richard K. Squier offer a comparative analysis of Buddhist and western scientific epistemologies that transcends the limitations of nonBuddhist approaches to the subject of religion and science. The book is appropriate for undergraduates, graduate students, and researchers interested in comparative religion or in the intersection of religion and science and Buddhist Studies
7 editions published between 2015 and 2016 in English and held by 77 WorldCat member libraries worldwide
This book offers a Buddhist perspective on the conflict between religion and science in contemporary western society. Examining Buddhist history, authors Francisca Cho and Richard K. Squier offer a comparative analysis of Buddhist and western scientific epistemologies that transcends the limitations of nonBuddhist approaches to the subject of religion and science. The book is appropriate for undergraduates, graduate students, and researchers interested in comparative religion or in the intersection of religion and science and Buddhist Studies
Efficient, scalable architectures for latticegas computations by
Richard K Squier(
Book
)
3 editions published in 1991 in English and held by 7 WorldCat member libraries worldwide
By developing and applying solutions to discrete isoperimetric problems to a pebbling game, upper bounds on throughput for machines computing problems with data dependency graphs based on the undirected graphs for the Hardyde PazzisPomeau (HPP) and FrischHasslacherPomeau (FHP) latticegasses are shown. A particular architecture, the 'Wide Serial Architecture' (WSA), is shown to be within a factor of approximately 6 of the bound for the HPPlike computations, and within a factor of about 4.5 of the bound for the FHPlike computations
3 editions published in 1991 in English and held by 7 WorldCat member libraries worldwide
By developing and applying solutions to discrete isoperimetric problems to a pebbling game, upper bounds on throughput for machines computing problems with data dependency graphs based on the undirected graphs for the Hardyde PazzisPomeau (HPP) and FrischHasslacherPomeau (FHP) latticegasses are shown. A particular architecture, the 'Wide Serial Architecture' (WSA), is shown to be within a factor of approximately 6 of the bound for the HPPlike computations, and within a factor of about 4.5 of the bound for the FHPlike computations
Computease : an introduction to computers, networks and issues of the information age(
Book
)
1 edition published in 1998 in English and held by 3 WorldCat member libraries worldwide
1 edition published in 1998 in English and held by 3 WorldCat member libraries worldwide
Testing parallel simulators for twodimensional latticegas automata by
Richard K Squier(
Book
)
1 edition published in 1990 in English and held by 3 WorldCat member libraries worldwide
The test patterns detect all significant onebit errors. We include experimental results indicating that multiple bit errors are unlikely to escape detection."
1 edition published in 1990 in English and held by 3 WorldCat member libraries worldwide
The test patterns detect all significant onebit errors. We include experimental results indicating that multiple bit errors are unlikely to escape detection."
General parallel computation without CPUs : VLSI realization of a particle machine by
Richard K Squier(
Book
)
1 edition published in 1995 in English and held by 2 WorldCat member libraries worldwide
Abstract: "We describe an approach to parallel computation using particle propagation and collisons in a onedimensional cellular automaton using a particle model  a Particle Machine (PM). Such a machine has the parallelism, structural regularity, and local connectivity of systolic arrays, but is general and programmable. It contains no explicit multipliers, adders, or other fixed arithmetic operations; these are implemented using finegrain interactions of logical particles which are injected into the medium of the cellular automaton, and which represent both data and processors. We sketch a VLSI implementation of a PM, and estimate its speed and size. We next discuss the problem of determining whether a rule set for a PM is free of conflicts. In general, the question is undecidable, but enough side information is usually available in practice to answer the question in polynomial time. We then show how to implement division in time linear in the number of significant bits of the result, using an algorithm of Leighton. This complements similar previous results for fixedpoint addition/subtraction and multiplication. The precision of the arithmetic is arbitrary, being determined by the particle groups used as input."
1 edition published in 1995 in English and held by 2 WorldCat member libraries worldwide
Abstract: "We describe an approach to parallel computation using particle propagation and collisons in a onedimensional cellular automaton using a particle model  a Particle Machine (PM). Such a machine has the parallelism, structural regularity, and local connectivity of systolic arrays, but is general and programmable. It contains no explicit multipliers, adders, or other fixed arithmetic operations; these are implemented using finegrain interactions of logical particles which are injected into the medium of the cellular automaton, and which represent both data and processors. We sketch a VLSI implementation of a PM, and estimate its speed and size. We next discuss the problem of determining whether a rule set for a PM is free of conflicts. In general, the question is undecidable, but enough side information is usually available in practice to answer the question in polynomial time. We then show how to implement division in time linear in the number of significant bits of the result, using an algorithm of Leighton. This complements similar previous results for fixedpoint addition/subtraction and multiplication. The precision of the arithmetic is arbitrary, being determined by the particle groups used as input."
Programmable parallel arithmetic in cellular automata using a particle model by
Richard K Squier(
Book
)
1 edition published in 1994 in English and held by 1 WorldCat member library worldwide
Abstract: "In this paper we show how to embed practical computation in onedimensional cellular automata using a model of computation based on collisions of moving particles. The cellular automata have small neighborhoods, and state spaces which are binary occupancy vectors. They can be fabricated in VLSI, and perhaps also in bulk media which support appropriate particle propagation and collisions. The model uses injected particles to represent both data and processors. Consequently, realizations are highly programmable, and do not have applicationspecific topology, in contrast with systolic arrays. We describe several practical calculations which can be carried out in a highly parallel way in a single cellular automaton, including addition, subtraction, multiplication, arbitrarily nested combinations of these operations, and finiteimpulseresponse digital filtering of a signal arriving in a continuous stream. These are all accomplished in time linear in the number of input bits, and with fixedpoint arithmetic of arbitrary precision, independent of the hardware."
1 edition published in 1994 in English and held by 1 WorldCat member library worldwide
Abstract: "In this paper we show how to embed practical computation in onedimensional cellular automata using a model of computation based on collisions of moving particles. The cellular automata have small neighborhoods, and state spaces which are binary occupancy vectors. They can be fabricated in VLSI, and perhaps also in bulk media which support appropriate particle propagation and collisions. The model uses injected particles to represent both data and processors. Consequently, realizations are highly programmable, and do not have applicationspecific topology, in contrast with systolic arrays. We describe several practical calculations which can be carried out in a highly parallel way in a single cellular automaton, including addition, subtraction, multiplication, arbitrarily nested combinations of these operations, and finiteimpulseresponse digital filtering of a signal arriving in a continuous stream. These are all accomplished in time linear in the number of input bits, and with fixedpoint arithmetic of arbitrary precision, independent of the hardware."
Audience Level
0 

1  
Kids  General  Special 
Related Identities
Associated Subjects
Buddhism and science Cellular automata Computer architecture Computer networksStudy and teaching ComputersStudy and teaching Electronic data processingStudy and teaching HydrodynamicsComputer simulation Integrated circuitsVery large scale integrationDesign and construction Lattice gas Machine theory Parallel processing (Electronic computers) Programmable array logic Systolic array circuitsDesign and construction
Languages