Results 1 
6 of
6
Hyperbolic geometry
 In Flavors of geometry
, 1997
"... 3. Why Call it Hyperbolic Geometry? 63 4. Understanding the OneDimensional Case 65 ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
3. Why Call it Hyperbolic Geometry? 63 4. Understanding the OneDimensional Case 65
LECTURE NOTES ON CHERNSIMONS (SUPER)GRAVITIES
, 2008
"... This is intended to be a broad introduction to ChernSimons gravity and supergravity. The motivation for these theories lies in the desire to have a gauge invariant system –with a fiber bundle formulation – in more than three dimensions, which could provide a firm ground for constructing a quantum t ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
This is intended to be a broad introduction to ChernSimons gravity and supergravity. The motivation for these theories lies in the desire to have a gauge invariant system –with a fiber bundle formulation – in more than three dimensions, which could provide a firm ground for constructing a quantum theory of the gravitational field. The starting point is a gravitational action which generalizes the Einstein theory for dimensions D> 4 –Lovelock gravity. It is then shown that in odd dimensions there is a particular choice of the arbitrary parameters of the action that makes the theory gauge invariant under the (anti)de Sitter or the Poincaré groups. The resulting lagrangian is a ChernSimons form for a connection of the corresponding gauge groups and the vielbein and the spin connection are parts of this connection field. These theories also admit a natural supersymmetric extension for all odd D where the local supersymmetry algebra closes offshell and without a need for auxiliary fields. No analogous construction is available in even dimensions. A cursory discussion of the unexpected dynamical features of these theories and a number of open problems are also presented. These notes were prepared for the Fifth CBPF Graduate School, held in Rio de Janeiro in July 2004, published in Portuguese [1]. These notes were in turn based on a lecture series presented at the Villa de Leyva
HyperAutomaton System Applied to Geometry Demonstration Environment. Computer Aided Systems Theory
 EUROCAST’2001  Eigth International Conference
, 2001
"... In this sense, this work extends the use of the HyperAutomaton system,which was designed to manage hyperdocuments in the Web [6][7][9][10], to a ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In this sense, this work extends the use of the HyperAutomaton system,which was designed to manage hyperdocuments in the Web [6][7][9][10], to a
HyperAutomaton System Applied to Geometry
, 2001
"... This paper describes the conception and implementation of a learning system on Euclidean Geometry demonstrations and its knowledge base. We use the formalism of finite automata with output to represent and ordain the statements that constitute a geometric demonstration in the knowledge base. The ..."
Abstract
 Add to MetaCart
This paper describes the conception and implementation of a learning system on Euclidean Geometry demonstrations and its knowledge base. We use the formalism of finite automata with output to represent and ordain the statements that constitute a geometric demonstration in the knowledge base. The system is built on the MOSCA learning protocol, based on learning with the assistance of examples and interaction among five agents (Mestre, Oraculo, Sonda, Cliente and Aprendiz) involved in the learning process. We briefly revise the HyperAutomaton concept as a structural model for hypertext and its use as the basis for the central core of the agents in a learning system is analyzed.
Centralized vs. Marketbased and Decentralized DecisionMaking: A Review of the Evidence in Computer Science and Economics
, 2008
"... Within both economics and computer science, many authors have claimed that decentralized or marketbased approaches to decisionmaking are superior in general to centralized approaches. The contrary claim has also been made. Unfortunately, these claims are often supported only by informal or anecdot ..."
Abstract
 Add to MetaCart
Within both economics and computer science, many authors have claimed that decentralized or marketbased approaches to decisionmaking are superior in general to centralized approaches. The contrary claim has also been made. Unfortunately, these claims are often supported only by informal or anecdotal evidence. In order to assess these competing claims, we present a review of the literatures in economics and in computer science bearing on these issues. Specifically, we report research findings based on empirical evidence and on simulation studies, and we outline the evidence based on formal deductive proofs or on informal and anecdotal evidence. Our main findings from this literature survey are: (i) for efficiency assessments, that there is wider variance in performance of organizations using MarketBased Control (MBC) than in organizations using Centralized Control (CC); (ii) that MBC and CC have the same efficiency on average; which may explain the observation (iii) that human and computer organizations tend to cycle between CC and Decentralized Control (DC) structures. 1
A Euclidean Algorithm for Normal Bases ∗
, 2005
"... Inversion in finite fields GF (2 k) is a critical operation for many applications. A well known representation basis, i.e. normal basis, provides an efficient squaring operation realized as a simple rotation of the operand coefficients. Inversion in normal basis is computed using methods derived fro ..."
Abstract
 Add to MetaCart
Inversion in finite fields GF (2 k) is a critical operation for many applications. A well known representation basis, i.e. normal basis, provides an efficient squaring operation realized as a simple rotation of the operand coefficients. Inversion in normal basis is computed using methods derived from Fermat’s Little theorem, e.g. the ItohTsujii algorithm or with the aid of basis conversion algorithms using the Extended Euclidean algorithm. In this paper we present alternative normal basis inversion algorithm derived from the polynomial version of the extended Euclidean algorithm. The normal basis Euclidean algorithm has (roughly) the same complexity as the polynomial version of the Euclidean algorithm. The proposed algorithm requires on average a linear number of multiplications. We also present a modification to our algorithm which delays the multiplications to the very end of the computation and thereby gives opportunity for recursive computation using only a logarithmic number of multiplications.