Search

If, as Foucault alleged, the so-called “classical episteme” incarcerated the bodies, early modernity presided to another type of imprisonment he does not mentioned: the enslavement of the physical eyeball to the eye of the mind. In order for seeing to regain its compatibility with knowing, the latter eye will have henceforth to prevail over the former. Grounded in Kepler and Descartes’ pioneer writings related to 17th-century eyesight issues, this article depicts the genealogy of this too-often ignored enslavement and shows its manifestation on the contemporary baroque stage., Si, comme le prétend Foucault, l’épistémè « classique », enferma les corps, la première modernité présida à cet autre enfermement généralement passé sous silence : l’asservissement de l’œil de chair à l’œil de l’esprit. Pour que voir renoue avec savoir, le second devra désormais primer sur le premier. L’on estime se doter ainsi d’une vision qui va au-delà du visible ; d’un voir qui excède la vue. À partir des travaux pionniers de ces « fondateurs de discursivité » (Foucault) que furent Kepler et Descartes, cet article retrace la généalogie de l’assujettissement de l’œil organique à la réflexion analytique du regard raisonnable et montre son illustration sur la scène baroque contemporaine

If, as Foucault alleged, the so-called “classical episteme” incarcerated the bodies, early modernity presided to another type of imprisonment he does not mentioned: the enslavement of the physical eyeball to the eye of the mind. In order for seeing to regain its compatibility with knowing, the latter eye will have henceforth to prevail over the former. Grounded in Kepler and Descartes’ pioneer writings related to 17th-century eyesight issues, this article depicts the genealogy of this too-often ignored enslavement and shows its manifestation on the contemporary baroque stage., Si, comme le prétend Foucault, l’épistémè « classique », enferma les corps, la première modernité présida à cet autre enfermement généralement passé sous silence : l’asservissement de l’œil de chair à l’œil de l’esprit. Pour que voir renoue avec savoir, le second devra désormais primer sur le premier. L’on estime se doter ainsi d’une vision qui va au-delà du visible ; d’un voir qui excède la vue. À partir des travaux pionniers de ces « fondateurs de discursivité » (Foucault) que furent Kepler et Descartes, cet article retrace la généalogie de l’assujettissement de l’œil organique à la réflexion analytique du regard raisonnable et montre son illustration sur la scène baroque contemporaine

This report consists of two papers describing networks for parallel matrix operations. In the first paper, Area-time optimal VLSI (Very Large Scale Integration) networks for multiplying matrices, we describe a class of VLSI networks having chip area A for multiplying two n x n matrices in time T, with an area x time squared product A.T squared = O(n to the 4th power). These networks achieve Savage's lower bound to this complexity measure for any T such that log n or = T or = n. The second paper, Optimal integrated-circuit implementation of triangular matrix inversion, describes a class of VLSI implementations of algorithms for inverting an n x n triangular matrix. These networks have area A and time T, with an area x time squared AT squared = O(n to the 4th power) for all values of T such that O(2 log n) or = T or = O(n). Since there is a simple reduction of matrix multiplication to inversion of a triangular matrix, due to Savage's result the presented networks are optimal in the VLSI model., Also available as Rept. no. R-879.

This report presents designs for VLSI circuits computing Cyclic Shifts, Discrete Fourier Transforms, and Integer Multiplication, all based on a machine architecture, the Cube-Connected-Cycles CCC, introduced by the authors in (10). All of the designs match, to within a constant factor, the known theoretical lower bounds (3), (4), (8) for area X time sq products., Also available as Rept. no. R-875.

We introduce an interconnection pattern of processing elements, the cube-connected-cycles (CCC), which can be used as a general purpose parallel processor. Because its design complies with present technological constraints, the CCC can also be used in the layout of many specialized large scale integrated circuits (VLSI). By combining the principles of parallelism and pipelining, the CCC can emulate the cube-connected machine and the perfect shuffle with no significant degradation of performance but with a more compact structure. We describe in detail how to program the CCC for efficiently solving a large class of problems, which includes Fast-Fourier-Transform, sorting, permutations, and derived algorithms. (Author), Also available as rept. no R-874.

Contient une table des matières, Avec mode texte

The concept of least fixed-point of a continuous function can be considered as the unifying thread of the report. The connections between fixed- points and recursive programs are detailed in Chapter 2, providing some insights on practical implementations of recursion. There are two usual characterizations of the least fixed-point of a continuous function. To the first characterization, due to Knaster and Tarski, corresponds a class of proof techniques for programs, as described in Chapter 3. The other characterization of least fixed points, better known as Kleene's first recursive theorem, is discussed in Chapter 4. It has the advantage of being effective and it leads to a wider class of proof techniques., Report on Stanford Artificial Intelligence Project.

Following the fixpoint theory of Scott, the authors propose to define the semantics of computer programs in terms of the least fixpoints of recursive programs. This allows one not only to justify all existing verification techniques, but also to extend them to handle various properties of computer programs, including correctness, termination and equivalence, in a uniform manner., Report on Stanford Artificial Intelligence Project.

The paper has two main purposes. First, the authors clarify and extend known results about computation of recursive programs, emphasizing the difference between the theoretical and practical approaches. Secondly, the authors present and examine various known methods for proving properties of recursive programs. The authors discuss in detail two powerful inductive methods, computational induction and structural induction, illustrating their applications by various examples. The authors also briefly discuss some other ralated methods. (Author), Report on Stanford Artificial Intelligence Project.

Contient une table des matières, Avec mode texte

Contient une table des matières, Avec mode texte

Avec mode texte, Sermons

Contient une table des matières, Avec mode texte