Results 1 - 10
of
1,011,619
Kodaira-Spencer theory of gravity and exact results for quantum string amplitudes
- Commun. Math. Phys
, 1994
"... We develop techniques to compute higher loop string amplitudes for twisted N = 2 theories with ĉ = 3 (i.e. the critical case). An important ingredient is the discovery of an anomaly at every genus in decoupling of BRST trivial states, captured to all orders by a master anomaly equation. In a particu ..."
Abstract
-
Cited by 545 (60 self)
- Add to MetaCart
We develop techniques to compute higher loop string amplitudes for twisted N = 2 theories with ĉ = 3 (i.e. the critical case). An important ingredient is the discovery of an anomaly at every genus in decoupling of BRST trivial states, captured to all orders by a master anomaly equation. In a
Diversity and Multiplexing: A Fundamental Tradeoff in Multiple Antenna Channels
- IEEE Trans. Inform. Theory
, 2002
"... Multiple antennas can be used for increasing the amount of diversity or the number of degrees of freedom in wireless communication systems. In this paper, we propose the point of view that both types of gains can be simultaneously obtained for a given multiple antenna channel, but there is a fund ..."
Abstract
-
Cited by 1143 (20 self)
- Add to MetaCart
fundamental tradeo# between how much of each any coding scheme can get. For the richly scattered Rayleigh fading channel, we give a simple characterization of the optimal tradeo# curve and use it to evaluate the performance of existing multiple antenna schemes.
Computational Lambda-Calculus and Monads
, 1988
"... The -calculus is considered an useful mathematical tool in the study of programming languages, since programs can be identified with -terms. However, if one goes further and uses fij-conversion to prove equivalence of programs, then a gross simplification 1 is introduced, that may jeopardise the ..."
Abstract
-
Cited by 505 (7 self)
- Add to MetaCart
the applicability of theoretical results to real situations. In this paper we introduce a new calculus based on a categorical semantics for computations. This calculus provides a correct basis for proving equivalence of programs, independent from any specific computational model. 1 Introduction This paper
Numerical integration of the Cartesian equations of motion of a system with constraints: molecular dynamics of n-alkanes
- J. Comput. Phys
, 1977
"... A numerical algorithm integrating the 3N Cartesian equations of motion of a system of N points subject to holonomic constraints is formulated. The relations of constraint remain perfectly fulfilled at each step of the trajectory despite the approximate character of numerical integration. The method ..."
Abstract
-
Cited by 682 (6 self)
- Add to MetaCart
(MD), which has been widely used in the past for studying simple liquids and solids, has more recently been applied to molecular systems with internal degrees of freedom such as N, [l], H,O [2] and even C,H,, [3]. In applying the MD method three problems arise: (a) the choice of a suitable mechanical
Human-Computer Interaction
, 1993
"... www.bcs-hci.org.uk Find out what happened at HCI2004 Interacting with … music aeroplanes petrol pumps Published by the British HCI Group • ISSN 1351-119X 1 ..."
Abstract
-
Cited by 582 (18 self)
- Add to MetaCart
www.bcs-hci.org.uk Find out what happened at HCI2004 Interacting with … music aeroplanes petrol pumps Published by the British HCI Group • ISSN 1351-119X 1
Formalising trust as a computational concept
, 1994
"... Trust is a judgement of unquestionable utility — as humans we use it every day of our lives. However, trust has suffered from an imperfect understanding, a plethora of definitions, and informal use in the literature and in everyday life. It is common to say “I trust you, ” but what does that mean? T ..."
Abstract
-
Cited by 518 (5 self)
- Add to MetaCart
for the consideration of other agents and the environment in which it exists. Moreover, a formalisation of trust enables the embedding of the concept into an artificial agent. This has been done, and is documented in the thesis. 2. Exposition There are places in the thesis where it is necessary to give a broad outline
Networks versus Markets in International Trade
- Journal of International Economics
, 1999
"... I propose a network/search view of international trade in differentiated products. I present evidence that supports the view that proximity and common language/colonial ties are more important for differentiated products than for products traded on organized exchanges in matching international buyer ..."
Abstract
-
Cited by 612 (3 self)
- Add to MetaCart
I propose a network/search view of international trade in differentiated products. I present evidence that supports the view that proximity and common language/colonial ties are more important for differentiated products than for products traded on organized exchanges in matching international
Pervasive Computing: Vision and Challenges
- IEEE Personal Communications
, 2001
"... This paper discusses the challenges in computer systems research posed by the emerging field of pervasive computing. It first examines the relationship of this new field to its predecessors: distributed systems and mobile computing. It then identifies four new research thrusts: effective use of smar ..."
Abstract
-
Cited by 670 (20 self)
- Add to MetaCart
This paper discusses the challenges in computer systems research posed by the emerging field of pervasive computing. It first examines the relationship of this new field to its predecessors: distributed systems and mobile computing. It then identifies four new research thrusts: effective use
Algorithms for Quantum Computation: Discrete Logarithms and Factoring
, 1994
"... A computer is generally considered to be a universal computational device; i.e., it is believed able to simulate any physical computational device with a increase in computation time of at most a polynomial factor. It is not clear whether this is still true when quantum mechanics is taken into consi ..."
Abstract
-
Cited by 1103 (7 self)
- Add to MetaCart
A computer is generally considered to be a universal computational device; i.e., it is believed able to simulate any physical computational device with a increase in computation time of at most a polynomial factor. It is not clear whether this is still true when quantum mechanics is taken
Results 1 - 10
of
1,011,619