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

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.

Quotients, exactness, and nuclearity in the operator system category

We continue our study of tensor products in the operator system category. We define operator system quotients and exactness in this setting and refine the notion of nuclearity by studying operator systems that preserve various pairs of tensor products. One of our main goals is to relate these refinements of nuclearity to the Kirchberg conjecture. In particular, we prove that the Kirchberg conjecture is equivalent to the statement that every operator system that is (min,er)-nuclear is also (el,c)-nuclear. We show that operator system quotients are not always equal to the corresponding operator space quotients and then study exactness of various operator system tensor products for the operator system quotient. We prove that an operator system is exact for the min tensor product if and only if it is (min,el)-nuclear. We give many characterizations of operator systems that are (min,er)-nuclear, (el,c)-nuclear, (min,el)-nuclear and (el,max)-nuclear. These characterizations involve operator system analogues of various properties from the theory of C*-algebras and operator spaces, including the WEP and LLP.

Hypercyclic and mixing operator semigroups

We describe a class of topological vector spaces admitting a mixing uniformly continuous operator group $\{T_t\}_{t\in\C^n}$ with holomorphic dependence on the parameter $t$. This result covers those existing in the literature. We also
describe a class of topological vector spaces admitting no supercyclic strongly continuous operator semigroups $\{T_t\}_{t\geq 0}$.

OPTIMISED BIT LEVEL SYSTOLIC ARRAY FOR CONVOLUTION.

A bit level systolic array for computing the convolution operation is described. The circuit in question is highly regular and ideally suited to VLSI chip design. It is also optimized in the sense that all the cells contribute to the computation on each clock cycle. This makes the array almost four times more efficient than one which was previously described.

FIBRE-OPTIC MULTICHANNEL CORRELATION/CONVOLUTION.

A fiber-optic multichannel correlator/convolver based on a two-dimensional systolic array architecture is described. Experimental verification of processor performance is presented.

MULTIBIT CONVOLUTION USING A BIT LEVEL SYSTOLIC ARRAY.

A novel design for multibit convolver circuits is described. The circuits take the form of systolic arrays of simple one-bit processor and memory cells, with the result that they can operate at very high data rates and should be easy to implement using VLSI technology. An efficient method for handling two's complement data within the array is described and the relative advantages of this convolver design compared with more conventional circuits is discussed.