Tensor products of operator systems

The purpose of the present paper is to lay the foundations for a systematic study of tensor products of operator systems. After giving an axiomatic definition of tensor products in this category, we examine in detail several particular examples of tensor products, including a minimal, maximal, maximal commuting, maximal injective and some asymmetric tensor products. We characterize these tensor products in terms of their universal properties and give descriptions of their positive cones. We also characterize the corresponding tensor products of operator spaces induced by a certain canonical inclusion of an operator space into an operator system. We examine notions of nuclearity for our tensor products which, on the category of C*-algebras, reduce to the classical notion. We exhibit an operator system S which is not completely order isomorphic to a C*-algebra yet has the property that for every C*-algebra A, the minimal and maximal tensor product of S and A are equal.

On the simplicial cohomology of Banach operator algebras

We investigate the simplicial cohomology of certain Banach operator algebras. The two main examples considered are the Banach algebra of all bounded operators on a Banach space and its ideal of approximable operators. Sufficient conditions will be given forcing Banach algebras of this kind to be simplicially trivial.

A hypercyclic finite rank perturbation of a unitary operator

A unitary operator V and a rank 2 operator R acting on a Hilbert space H are constructed such that V + R is hypercyclic. This answers affirmatively a question of Salas whether a finite rank perturbation of a hyponormal operator can be supercyclic.

Operators, commuting with the Volterra operator, are not weakly supercyclic

We prove that any bounded linear operator on $L_p[0,1]$ for $1\leq p

1-amenability of A(X) for Banach spaces with 1-unconditional bases

The main result of the note is a characterization of 1-amenability of Banach algebras of approximable operators for a class of Banach spaces with 1-unconditional bases in terms of a new basis property. It is also shown that amenability and symmetric amenability are equivalent concepts for Banach algebras of approximable operators, and that a type of Banach space that was long suspected to lack property A has in fact the property. Some further ideas on the problem of whether or not amenability (in this setting) implies property A are discussed.

Impact of operator experience on information feedback and reusability

Keeping a record of operator experience remains a challenge to operation management and a major source of inefficiency in information management. The objective is to develop a framework that enables an explicit presentation of experience based on information use. A purposive sampling method is used to select four small and medium-sized enterprises as case studies. The unit of analysis is the production process in the machine shop. Data collection is by structured interview, observation and documentation. A comparative case analysis is applied. The findings suggest experience is an accumulation of tacit information feedback, which can be made explicit in information use interoperatability matrix. The matrix is conditioned upon information use typology, which is strategic in waste reduction. The limitations include difficulty of participant anonymity where the organisation nominates a participant. Areas for further research include application of the concepts to knowledge management and shop floor resource management.

Excess Electron Localization in Solvated DNA Bases

We present a first-principles molecular dynamics study of an excess electron in condensed phase models of solvated DNA bases. Calculations on increasingly large microsolvated clusters taken from liquid phase simulations show that adiabatic electron affinities increase systematically upon solvation, as for optimized gas-phase geometries. Dynamical simulations after vertical attachment indicate that the excess electron, which is initially found delocalized, localizes around the nucleobases within a 15 fs time scale. This transition requires small rearrangements in the geometry of the bases.

A Syntax-based approach to measuring the degree of inconsistency for belief bases

Measuring the degree of inconsistency of a belief base is an important issue in many real world applications. It has been increasingly recognized that deriving syntax sensitive inconsistency measures for a belief base from its minimal inconsistent subsets is a natural way forward. Most of the current proposals along this line do not take the impact of the size of each minimal inconsistent subset into account. However, as illustrated by the well-known Lottery Paradox, as the size of a minimal inconsistent subset increases, the degree of its inconsistency decreases. Another lack in current studies in this area is about the role of free formulas of a belief base in measuring the degree of inconsistency. This has not yet been characterized well. Adding free formulas to a belief base can enlarge the set of consistent subsets of that base. However, consistent subsets of a belief base also have an impact on the syntax sensitive normalized measures of the degree of inconsistency, the reason for this is that each consistent subset can be considered as a distinctive plausible perspective reflected by that belief base,whilst eachminimal inconsistent subset projects a distinctive viewof the inconsistency. To address these two issues,we propose a normalized framework formeasuring the degree of inconsistency of a belief base which unifies the impact of both consistent subsets and minimal inconsistent subsets. We also show that this normalized framework satisfies all the properties deemed necessary by common consent to characterize an intuitively satisfactory measure of the degree of inconsistency for belief bases. Finally, we use a simple but explanatory example in equirements engineering to illustrate the application of the normalized framework.

Measuring the blame of each formula for inconsistent prioritized knowledge bases.

It is increasingly recognized that identifying the degree of blame or responsibility of each formula for inconsistency of a knowledge base (i.e. a set of formulas) is useful for making rational decisions to resolve inconsistency in that knowledge base. Most current techniques for measuring the blame of each formula with regard to an inconsistent knowledge base focus on classical knowledge bases only. Proposals for measuring the blames of formulas with regard to an inconsistent prioritized knowledge base have not yet been given much consideration. However, the notion of priority is important in inconsistency-tolerant reasoning. This article investigates this issue and presents a family of measurements for the degree of blame of each formula in an inconsistent prioritized knowledge base by using the minimal inconsistent subsets of that knowledge base. First of all, we present a set of intuitive postulates as general criteria to characterize rational measurements for the blames of formulas of an inconsistent prioritized knowledge base. Then we present a family of measurements for the blame of each formula in an inconsistent prioritized knowledge base under the guidance of the principle of proportionality, one of the intuitive postulates. We also demonstrate that each of these measurements possesses the properties that it ought to have. Finally, we use a simple but explanatory example in requirements engineering to illustrate the application of these measurements. Compared to the related works, the postulates presented in this article consider the special characteristics of minimal inconsistent subsets as well as the priority levels of formulas. This makes them more appropriate to characterizing the inconsistency measures defined from minimal inconsistent subsets for prioritized knowledge bases as well as classical knowledge bases. Correspondingly, the measures guided by these postulates can intuitively capture the inconsistency for prioritized knowledge bases.