Stability for parametric implicit vector equilibrium problems

In this paper, we consider a class of parametric implicit vector equilibrium problems in Hausdorff topological vector spaces where a mapping f and a set K are perturbed by parameters is an element of and lambda respectively. We establish sufficient conditions for the upper semicontinuity and lower semicontinuity of the solution set mapping S : Lambda(1) x A(2) -> 2(X) for such parametric implicit vector equilibrium problems. (c) 2005 Elsevier Ltd. All rights reserved.

Measurement-based teleportation along quantum spin chains

We examine the teleportation of an unknown spin-1/2 quantum state along a quantum spin chain with an even number of sites. Our protocol, using a sequence of Bell measurements, may be viewed as an iterated version of the 2-qubit protocol of C. H. Bennett et al. [Phys. Rev. Lett. 70, 1895 (1993)]. A decomposition of the Hilbert space of the spin chain into 4 vector spaces, called Bell subspaces, is given. It is established that any state from a Bell subspace may be used as a channel to perform unit fidelity teleportation. The space of all spin-0 many-body states, which includes the ground states of many known antiferromagnetic systems, belongs to a common Bell subspace. A channel-dependent teleportation parameter O is introduced, and a bound on the teleportation fidelity is given in terms of O.

Cyclic MrIA: A stable and potent cyclic conotoxin with a novel topological fold that targets the norepinephrine transporter

Conotoxins, disulfide-rich peptides from the venom of cone snails, have created much excitement over recent years due to their potency and specificity for ion channels and their therapeutic potential. One recently identified conotoxin, MrIA, a 13-residue member of the chi-conotoxin family, inhibits the human norepinephrine transporter (NET) and has potential applications in the treatment of pain. In the current study, we show that the, beta-hairpin structure of native MrIA is retained in a synthetic cyclic version, as is biological activity at the NET. Furthermore, the cyclic version has increased resistance to trypsin digestion relative to the native peptide, an intriguing result because the cleavage site for the trypsin is not close to the cyclization site. The use of peptides as drugs is generally hampered by susceptibility to proteolysis, and so, the increase in enzymatic stability against trypsin observed in the current study may be useful in improving the therapeutic potential of MrIA. Furthermore, the structure reported here for cyclic MrIA represents a new topology among a growing number of circular disulfide-rich peptides.

Utility functions on locally connected spaces

We investigate the role of local connectedness in utility theory and prove that any continuous total preorder on a locally connected separable space is continuously representable. This is a new simple criterion for the representability of continuous preferences, and is not a consequence of the standard theorems in utility theory that use conditions such as connectedness and separability, second countability, or path-connectedness. Finally we give applications to problems involving the existence of value functions in population ethics and to the problem of proving the existence of continuous utility functions in general equilibrium models with land as one of the commodities. (C) 2003 Elsevier B.V. All rights reserved.

Zero-non-zero patterned vector error correction modeling for I(2) cointegrated time series with applications in testing PPP and stock market relationships

Vector error-correction models (VECMs) have become increasingly important in their application to financial markets. Standard full-order VECM models assume non-zero entries in all their coefficient matrices. However, applications of VECM models to financial market data have revealed that zero entries are often a necessary part of efficient modelling. In such cases, the use of full-order VECM models may lead to incorrect inferences. Specifically, if indirect causality or Granger non-causality exists among the variables, the use of over-parameterised full-order VECM models may weaken the power of statistical inference. In this paper, it is argued that the zero–non-zero (ZNZ) patterned VECM is a more straightforward and effective means of testing for both indirect causality and Granger non-causality. For a ZNZ patterned VECM framework for time series of integrated order two, we provide a new algorithm to select cointegrating and loading vectors that can contain zero entries. Two case studies are used to demonstrate the usefulness of the algorithm in tests of purchasing power parity and a three-variable system involving the stock market.

Topological side-chain classification of beta-turns: Ideal motifs for peptidomimetic development

beta-turns are important topological motifs for biological recognition of proteins and peptides. Organic molecules that sample the side chain positions of beta-turns have shown broad binding capacity to multiple different receptors, for example benzodiazepines. beta-turns have traditionally been classified into various types based on the backbone dihedral angles (phi 2, psi 2, phi 3 and psi 3). Indeed, 57-68% of beta-turns are currently classified into 8 different backbone families (Type I, Type II, Type I', Type II', Type VIII, Type VIa1, Type VIa2 and Type VIb and Type IV which represents unclassified beta-turns). Although this classification of beta-turns has been useful, the resulting beta-turn types are not ideal for the design of beta-turn mimetics as they do not reflect topological features of the recognition elements, the side chains. To overcome this, we have extracted beta-turns from a data set of non-homologous and high-resolution protein crystal structures. The side chain positions, as defined by C-alpha-C-beta vectors, of these turns have been clustered using the kth nearest neighbor clustering and filtered nearest centroid sorting algorithms. Nine clusters were obtained that cluster 90% of the data, and the average intra-cluster RMSD of the four C-alpha-C-beta vectors is 0.36. The nine clusters therefore represent the topology of the side chain scaffold architecture of the vast majority of beta-turns. The mean structures of the nine clusters are useful for the development of beta-turn mimetics and as biological descriptors for focusing combinatorial chemistry towards biologically relevant topological space.

Is the distribution of Fiji leaf gall in Australian sugarcane explained by variation in the vector Perkinsiella saccharicida?

Fiji leaf gall (FLG) is an important virally induced disease in Australian sugarcane. It is confined to southern canegrowing areas, despite its vector, the delphacid planthopper Perkinsiella saccharicida, occurring in all canegrowing areas of Queensland and New South Wales. This disparity between distributions could be a result of successful containment of the disease through quarantine and/or geographical barriers, or because northern Queensland populations of Perkinsiella may be poorer vectors of the disease. These hypotheses were first tested by investigating variation in the ITS2 region of the rDNA fragment among eastern Australian and overseas populations of Perkinsiella. The ITS2 sequences of the Western Australian P. thompsoni and the Fijian P. vitiensis were distinguishable from those of P. saccharicida and there was no significant variation among the 26P. saccharicida populations. Reciprocal crosses of a northern Queensland and a southern Queensland population of P. saccharicida were fertile, so they may well be conspecific. Single vector transmission experiments showed that a population of P. saccharicida from northern Queensland had a higher vector competency than either of two southern Queensland populations. The frequency of virus acquisition in the vector populations was demonstrated to be important in the vector competency of the planthopper. The proportion of infected vectors that transmitted the virus to plants was not significantly different among the populations tested. This study shows that the absence of FLG from northern Queensland is not due to a lack of vector competency of the northern population of P. saccharicida.

Identification of the dominant translation start site in the attB1 sequence of the pET-DEST42 Gateway vector

Gateway technology is a powerful system for converting a single entry vector into a wide variety of expression vectors. We expressed recombinant influenza matrix protein M1 (FMP), a potent antigen for cytotoxic T cells, using the Gateway vector pET-DEST42 containing the FMP cDNA, and purified the expressed FMP as a single 32 kDa recombinant protein. N-terminal and internal protein sequencing, however, showed that the recombinant FMP contained an extra 10 amino acids fused to the N-terminal of native FMP. Further investigation of the DNA sequence adjacent to the 5'-FMP cDNA indicated that the TTG in the attB1 site (30bp upstream of the ATG in the 5'-FMP cDNA) behaved as a dominant translation start site, resulting in a 10 amino acid extension of the recombinant FMP. Thus, it is possible that recombinant proteins produced by this Gateway vector contain unexpected vector-derived peptides, which may affect experimental outcomes. (c) 2006 Elsevier Inc. All rights reserved.

Motion vector encryption in multimedia streaming

Streaming video application requires high security as well as high computational performance. In video encryption, traditional selective algorithms have been used to partially encrypt the relatively important data in order to satisfy the streaming performance requirement. Most video selective encryption algorithms are inherited from still image encryption algorithms, the encryption on motion vector data is not considered. The assumption is that motion vector data are not as important as pixel image data. Unfortunately, in some cases, motion vector itself may be sufficient enough to leak out useful video information. Normally motion vector data consume over half of the whole video stream bandwidth, neglecting their security may be unwise. In this paper, we target this security problem and illustrate attacks at two different levels that can restore useful video information using motion vectors only. Further, an information analysis is made and a motion vector information model is built. Based on this model, we describe a new motion vector encryption algorithm called MVEA. We show the experimental results of MVEA. The security strength and performance of the algorithm are also evaluated.

Multiscale histograms: Summarizing topological relations in large spatial datasets

Summarizing topological relations is fundamental to many spatial applications including spatial query optimization. In this paper, we present several novel techniques to eectively construct cell density based spatial histograms for range (window) summarizations restricted to the four most important topological relations: contains, contained, overlap, and disjoint. We rst present a novel framework to construct a multiscale histogram composed of multiple Euler histograms with the guarantee of the exact summarization results for aligned windows in constant time. Then we present an approximate algorithm, with the approximate ratio 19/12, to minimize the storage spaces of such multiscale Euler histograms, although the problem is generally NP-hard. To conform to a limited storage space where only k Euler histograms are allowed, an effective algorithm is presented to construct multiscale histograms to achieve high accuracy. Finally, we present a new approximate algorithm to query an Euler histogram that cannot guarantee the exact answers; it runs in constant time. Our extensive experiments against both synthetic and real world datasets demonstrated that the approximate mul- tiscale histogram techniques may improve the accuracy of the existing techniques by several orders of magnitude while retaining the cost effciency, and the exact multiscale histogram technique requires only a storage space linearly proportional to the number of cells for the real datasets.