Results 1  10
of
4,301,743
MValgebras with operators (the commutative and the noncommutative case)
"... In the present paper we define the (pseudo) MValgebras with nary operators, generalizing MVmodules and product MValgebras. Our main results assert that there are bijective correspondences between the operators defined on a pseudo MValgebra and the operators defined on the corresponding ℓgroup. ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
In the present paper we define the (pseudo) MValgebras with nary operators, generalizing MVmodules and product MValgebras. Our main results assert that there are bijective correspondences between the operators defined on a pseudo MValgebra and the operators defined on the corresponding ℓgroup. We also provide a categorical framework and we prove the analogue of Mundici’s categorical equivalence between MValgebras
Gravity coupled with matter and the foundation of non commutative geometry
, 1996
"... We first exhibit in the commutative case the simple algebraic relations between the algebra of functions on a manifold and its infinitesimal length element ds. Its unitary representations correspond to Riemannian metrics and Spin structure while ds is the Dirac propagator ds = ×— × = D −1 where D i ..."
Abstract

Cited by 354 (18 self)
 Add to MetaCart
is the Dirac operator. We extend these simple relations to the non commutative case using Tomita’s involution J. We then write a spectral action, the trace of a function of the length element in Planck units, which when applied to the non commutative geometry of the Standard Model will be shown (in a joint
A Classification of the Projective Lines over Small Rings II. NonCommutative Case
"... A list of different types of a projective line over noncommutative rings with unity of order up to thirtyone inclusive is given. Eight different types of such a line are found. With a single exception, the basic characteristics of the lines are identical to those of their commutative counterparts. ..."
Abstract

Cited by 14 (9 self)
 Add to MetaCart
A list of different types of a projective line over noncommutative rings with unity of order up to thirtyone inclusive is given. Eight different types of such a line are found. With a single exception, the basic characteristics of the lines are identical to those of their commutative counterparts
QUANTUM SYMMETRIES OF HIGHER COXETERDYNKIN GRAPHS. A Noncommutative Case: The D3 Graph of SU(3) System
"... The purpose of this contribution is to show how quantum geometry of higher Coxeter graphs of SU(N) type gives a common algebraic formulation for both RCFT and quantum groupoı̈ds. These apparently two different fields are hardly studied by wide communities of physicists and mathematicians. To carry o ..."
Abstract
 Add to MetaCart
out this formulation we determine all Nimreps describing CFT and weak Hopf algebra structures based on combinatorial data of graphs. We will pay attention to a particular case: the D 3 orbifold graph of SU(3) system for which the algebra of quantum symmetries is noncommutative.
Algorithms for Nonnegative Matrix Factorization
 In NIPS
, 2001
"... Nonnegative matrix factorization (NMF) has previously been shown to be a useful decomposition for multivariate data. Two different multiplicative algorithms for NMF are analyzed. They differ only slightly in the multiplicative factor used in the update rules. One algorithm can be shown to minim ..."
Abstract

Cited by 1230 (5 self)
 Add to MetaCart
Nonnegative matrix factorization (NMF) has previously been shown to be a useful decomposition for multivariate data. Two different multiplicative algorithms for NMF are analyzed. They differ only slightly in the multiplicative factor used in the update rules. One algorithm can be shown
Texture Synthesis by Nonparametric Sampling
 In International Conference on Computer Vision
, 1999
"... A nonparametric method for texture synthesis is proposed. The texture synthesis process grows a new image outward from an initial seed, one pixel at a time. A Markov random field model is assumed, and the conditional distribution of a pixel given all its neighbors synthesized so far is estimated by ..."
Abstract

Cited by 1014 (7 self)
 Add to MetaCart
A nonparametric method for texture synthesis is proposed. The texture synthesis process grows a new image outward from an initial seed, one pixel at a time. A Markov random field model is assumed, and the conditional distribution of a pixel given all its neighbors synthesized so far is estimated
Worstcase equilibria
 IN PROCEEDINGS OF THE 16TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE
, 1999
"... In a system in which noncooperative agents share a common resource, we propose the ratio between the worst possible Nash equilibrium and the social optimum as a measure of the effectiveness of the system. Deriving upper and lower bounds for this ratio in a model in which several agents share a ver ..."
Abstract

Cited by 851 (17 self)
 Add to MetaCart
In a system in which noncooperative agents share a common resource, we propose the ratio between the worst possible Nash equilibrium and the social optimum as a measure of the effectiveness of the system. Deriving upper and lower bounds for this ratio in a model in which several agents share a very simple network leads to some interesting mathematics, results, and open problems.
The case for motivated reasoning
 Psychological Bulletin
, 1990
"... It is proposed that motivation may affect reasoning through reliance on a biased set of cognitive processes—that is, strategies for accessing, constructing, and evaluating beliefs. The motivation to be accurate enhances use of those beliefs and strategies that are considered most appropriate, wherea ..."
Abstract

Cited by 687 (3 self)
 Add to MetaCart
It is proposed that motivation may affect reasoning through reliance on a biased set of cognitive processes—that is, strategies for accessing, constructing, and evaluating beliefs. The motivation to be accurate enhances use of those beliefs and strategies that are considered most appropriate, whereas the motivation to arrive at particular conclusions enhances use of those that are considered most likely to yield the desired conclusion. There is considerable evidence that people are more likely to arrive at conclusions that they want to arrive at, but their ability to do so is constrained by their ability to construct seemingly reasonable justifications for these conclusions. These ideas can account for a wide variety of research concerned with motivated reasoning. The notion that goals or motives affect reasoning has a long and controversial history in social psychology. The propositions that motives may affect perceptions (Erdelyi, 1974), attitudes (Festinger, 1957), and attributions (Heider, 1958) have been put forth by some psychologists and challenged by others. Although early researchers and theorists took it for granted that motivation may cause people to make selfserving attributions
Blind Beamforming for Non Gaussian Signals
 IEE ProceedingsF
, 1993
"... This paper considers an application of blind identification to beamforming. The key point is to use estimates of directional vectors rather than resorting to their hypothesized value. By using estimates of the directional vectors obtained via blind identification i.e. without knowing the arrray mani ..."
Abstract

Cited by 704 (31 self)
 Add to MetaCart
This paper considers an application of blind identification to beamforming. The key point is to use estimates of directional vectors rather than resorting to their hypothesized value. By using estimates of the directional vectors obtained via blind identification i.e. without knowing the arrray manifold, beamforming is made robust with respect to array deformations, distortion of the wave front, pointing errors, etc ... so that neither array calibration nor physical modeling are necessary. Rather surprisingly, `blind beamformers' may outperform `informed beamformers' in a plausible range of parameters, even when the array is perfectly known to the informed beamformer. The key assumption blind identification relies on is the statistical independence of the sources, which we exploit using fourthorder cumulants. A computationally efficient technique is presented for the blind estimation of directional vectors, based on joint diagonalization of 4thorder cumulant matrices
Results 1  10
of
4,301,743