Computational techniques for a simple theory of conditional preferences

A simple logic of conditional preferences is defined, with a language that allows the compact representation of certain kinds of conditional preference statements, a semantics and a proof theory. CP-nets and TCP-nets can be mapped into this logic, and the semantics and proof theory generalise those of CP-nets and TCP-nets. The system can also express preferences of a lexicographic kind. The paper derives various sufficient conditions for a set of conditional preferences to be consistent, along with algorithmic techniques for checking such conditions and hence confirming consistency. These techniques can also be used for totally ordering outcomes in a way that is consistent with the set of preferences, and they are further developed to give an approach to the problem of constrained optimisation for conditional preferences.

K-Theory of Azumaya Algebras over Schemes

Let X be a connected, noetherian scheme and A{script} be a sheaf of Azumaya algebras on X, which is a locally free O{script}-module of rank a. We show that the kernel and cokernel of K(X) ? K(A{script}) are torsion groups with exponent a for some m and any i = 0, when X is regular or X is of dimension d with an ample sheaf (in this case m = d + 1). As a consequence, K(X, Z/m) ? K(A{script}, Z/m), for any m relatively prime to a. © 2013 Copyright Taylor and Francis Group, LLC.

Theory of phonon dissipation in the conduction of stressed Au nanowires

Recent experiments on Au break junctions [Phys. Rev. Lett. 88 (2002) 216803] have characterized the nonlinear conductance of stretched short Au nanowires. They reveal in the voltage range 10-20 meV the signatures of dissipation effects, likely due to phonons in the nanowire, reducing the conductance below the quantized value of 2e(2)/h. We present here a theory, based on a model tight-binding Hamiltonian and on non-equilibrium Green's function techniques, which accounts for the main features of the experiment. The theory helps in revealing details of the experiment which need to be addressed with a more realistic, less idealized, theoretical framework. (C) 2004 Elsevier B.V. All rights reserved.

Revision rules in the theory of evidence

Combination rules proposed so far in the Dempster-Shafer theory of evidence, especially Dempster rule, rely on a basic assumption, that is, pieces of evidence being combined are considered to be on a par, i.e. play the same role. When a source of evidence is less reliable than another, it is possible to discount it and then a symmetric combination operation is still used. In the case of revision, the idea is to let prior knowledge of an agent be altered by some input information. The change problem is thus intrinsically asymmetric. Assuming the input information is reliable, it should be retained whilst the prior information should
be changed minimally to that effect. Although belief revision is already an important subfield of artificial intelligence, so far, it has been little addressed in evidence theory. In this paper, we define the notion of revision for the theory of evidence and propose several different revision rules, called the inner and outer
revisions, and a modified adaptive outer revision, which better corresponds to the idea of revision. Properties of these revision rules are also investigated.