The capsid protein of beak and feather disease virus binds to the viral DNA and is responsible for transporting the replication-associated protein into the nucleus

Circoviruses lack an autonomous DNA polymerase and are dependent on the replication machinery of the host cell for de novo DNA synthesis. Accordingly, the viral DNA needs to cross both the plasma membrane and the nuclear envelope before replication can occur. Here we report on the subcellular distribution of the beak and feather disease virus (BFDV) capsid protein (CP) and replication-associated protein (Rep) expressed via recombinant baculoviruses in an insect cell system and test the hypothesis that the CP is responsible for transporting the viral genome, as well as Rep, across the nuclear envelope. The intracellular localization of the BFDV CP was found to be directed by three partially overlapping bipartite nuclear localization signals (NLSs) situated between residues 16 and 56 at the N terminus of the protein. Moreover, a DNA binding region was also mapped to the N terminus of the protein and falls within the region containing the three putative NLSs. The ability of CP to bind DNA, coupled with the karyophilic nature of this protein, strongly suggests that it may be responsible for nuclear targeting of the viral genome. Interestingly, whereas Rep expressed on its own in insect cells is restricted to the cytoplasm, coexpression with CP alters the subcellular localization of Rep to the nucleus, strongly suggesting that an interaction with CP facilitates movement of Rep into the nucleus. Copyright © 2006, American Society for Microbiology. All Rights Reserved.

Modelling word activation in semantic networks : three scaled entanglement models compared

Modelling how a word is activated in human memory is an important requirement for determining the probability of recall of a word in an extra-list cueing experiment. Previous research assumed a quantum-like model in which the semantic network was modelled as entangled qubits, however the level of activation was clearly being over-estimated. This paper explores three variations of this model, each of which are distinguished by a scaling factor designed to compensate the overestimation.

A people-to-people matching system using graph mining techniques

A people-to-people matching system (or a match-making system) refers to a system in which users join with the objective of meeting other users with the common need. Some real-world examples of these systems are employer-employee (in job search networks), mentor-student (in university social networks), consume-to-consumer (in marketplaces) and male-female (in an online dating network). The network underlying in these systems consists of two groups of users, and the relationships between users need to be captured for developing an efficient match-making system. Most of the existing studies utilize information either about each of the users in isolation or their interaction separately, and develop recommender systems using the one form of information only. It is imperative to understand the linkages among the users in the network and use them in developing a match-making system. This study utilizes several social network analysis methods such as graph theory, small world phenomenon, centrality analysis, density analysis to gain insight into the entities and their relationships present in this network. This paper also proposes a new type of graph called “attributed bipartite graph”. By using these analyses and the proposed type of graph, an efficient hybrid recommender system is developed which generates recommendation for new users as well as shows improvement in accuracy over the baseline methods.

Contemporary public spaces in urban knowledge precincts : observations from Brisbane, Australia

The advanced era of knowledge-based urban development has led to an unprecedented increase in mobility of people and the subsequent growth in the new typology of agglomerated enclaves of knowledge such as urban knowledge precincts. A new role has been assigned to contemporary public spaces of these precincts to attract and retain the mobile knowledge workforce for long by creating a sense of place for them. This paper sheds light over the place making in the globalised knowledge economy world which develops a sense of permanence spatio-temporally to knowledge workers displaying a set of particular characteristics and simultaneously is process-dependent getting developed by the internal and external flows and contributing substantially in the development of the broader context it stands in relation with. The paper highlights the observations from Australia’s new world city Brisbane to outline the application of urban design as a tool to create and sustain this bipartite place making in urban knowledge precincts, which caters diverse range of social, cultural and democratic needs. It seeks to analyse the modified permeable typology of public spaces that makes it more viable and adaptive as per the changing needs of the contemporary globalised or in other words knowledge society. This research has taken an overall process-based approach reflecting how urban design is an assemblage of the encompassing processes that underlay the resultant place making. It explores how the permeable design typology of these contemporary precincts in Brisbane develops a progressive sense of place that makes them stimulating, effervescent and vibrant.

Steady state genuine multipartite entanglement in harmonic oscillator ensembles with a common environment

Steady state entanglement in ensembles of harmonic oscillators with a common squeezed reservoir is studied. Under certain conditions the ensemble features genuine multipartite entanglement in the steady state. Several analytic results regarding the bipartite and multipartite entanglement properties of the system are derived. We also discuss a possible experimental implementation which may exhibit steady state genuine multipartite entanglement.

Edge-weighting of gene expression graphs

In recent years, considerable research efforts have been directed to micro-array technologies and their role in providing simultaneous information on expression profiles for thousands of genes. These data, when subjected to clustering and classification procedures, can assist in identifying patterns and providing insight on biological processes. To understand the properties of complex gene expression datasets, graphical representations can be used. Intuitively, the data can be represented in terms of a bipartite graph, with weighted edges corresponding to gene-sample node couples in the dataset. Biologically meaningful subgraphs can be sought, but performance can be influenced both by the search algorithm, and, by the graph-weighting scheme and both merit rigorous investigation. In this paper, we focus on edge-weighting schemes for bipartite graphical representation of gene expression. Two novel methods are presented: the first is based on empirical evidence; the second on a geometric distribution. The schemes are compared for several real datasets, assessing efficiency of performance based on four essential properties: robustness to noise and missing values, discrimination, parameter influence on scheme efficiency and reusability. Recommendations and limitations are briefly discussed. Keywords: Edge-weighting; weighted graphs; gene expression; bi-clustering

Optimisation algorithms for microarray biclustering

In providing simultaneous information on expression profiles for thousands of genes, microarray technologies have, in recent years, been largely used to investigate mechanisms of gene expression. Clustering and classification of such data can, indeed, highlight patterns and provide insight on biological processes. A common approach is to consider genes and samples of microarray datasets as nodes in a bipartite graphs, where edges are weighted e.g. based on the expression levels. In this paper, using a previously-evaluated weighting scheme, we focus on search algorithms and evaluate, in the context of biclustering, several variations of Genetic Algorithms. We also introduce a new heuristic “Propagate”, which consists in recursively evaluating neighbour solutions with one more or one less active conditions. The results obtained on three well-known datasets show that, for a given weighting scheme,optimal or near-optimal solutions can be identified.

EphB4 localises to the nucleus of prostate cancer cells

The EphB4 receptor tyrosine kinase is over-expressed in a variety of different epithelial cancers including prostate where it has been shown to be involved in survival, migration and angiogenesis. We report here that EphB4 also resides in the nucleus of prostate cancer cell lines. We used in silico methods to identify a bipartite nuclear localisation signal (NLS) in the extracellular domain and a monopartite NLS sequence in the intracellular kinase domain of EphB4. To determine whether both putative NLS sequences were functional, fragments of the EphB4 sequence containing each NLS were cloned to create EphB4NLS-GFP fusion proteins. Localisation of both NLS-GFP proteins to the nuclei of transfected cells was observed, demonstrating that EphB4 contains two functional NLS sequences. Mutation of the key amino residues in both NLS sequences resulted in diminished nuclear accumulation. As nuclear translocation is often dependent on importins we confirmed that EphB4 and importin-α can interact. To assess if nuclear EphB4 could be implicated in gene regulatory functions potential EphB4-binding genomic loci were identified using chromatin immunoprecipitation and Lef1 was confirmed as a potential target of EphB4-mediated gene regulation. These novel findings add further complexity to the biology of this important cancer-associated receptor.

Cubicity, boxicity, and vertex cover

A k-dimensional box is the cartesian product R-1 x R-2 x ... x R-k where each R-i is a closed interval on the real line. The boxicity of a graph G,denoted as box(G), is the minimum integer k such that G is the intersection graph of a collection of k-dimensional boxes. A unit cube in k-dimensional space or a k-cube is defined as the cartesian product R-1 x R-2 x ... x R-k where each Ri is a closed interval on the real line of the form [a(i), a(i) + 1]. The cubicity of G, denoted as cub(G), is the minimum k such that G is the intersection graph of a collection of k-cubes. In this paper we show that cub(G) <= t + inverted right perpendicularlog(n - t)inverted left perpendicular - 1 and box(G) <= left perpendiculart/2right perpendicular + 1, where t is the cardinality of a minimum vertex cover of G and n is the number of vertices of G. We also show the tightness of these upper bounds. F.S. Roberts in his pioneering paper on boxicity and cubicity had shown that for a graph G, box(G) <= left perpendicularn/2right perpendicular and cub(G) <= inverted right perpendicular2n/3inverted left perpendicular, where n is the number of vertices of G, and these bounds are tight. We show that if G is a bipartite graph then box(G) <= inverted right perpendicularn/4inverted left perpendicular and this bound is tight. We also show that if G is a bipartite graph then cub(G) <= n/2 + inverted right perpendicularlog n inverted left perpendicular - 1. We point out that there exist graphs of very high boxicity but with very low chromatic number. For example there exist bipartite (i.e., 2 colorable) graphs with boxicity equal to n/4. Interestingly, if boxicity is very close to n/2, then chromatic number also has to be very high. In particular, we show that if box(G) = n/2 - s, s >= 0, then chi (G) >= n/2s+2, where chi (G) is the chromatic number of G.

Quantum entanglement in a noncommutative system

We explore the effect of two-dimensional position-space noncommutativity on the bipartite entanglement of continuous-variable systems. We first extend the standard symplectic framework for studying entanglement of Gaussian states of commutative systems to the case of noncommutative systems residing in two dimensions. Using the positive partial transpose criterion for separability of bipartite states, we derive a condition on the separability of a noncommutative system that is dependent on the noncommutative parameter theta. We then consider the specific example of a bipartite Gaussian state and show the quantitative reduction in entanglement originating from noncommutative dynamics. We show that such a reduction in entanglement for a noncommutative system arising from the modification of the variances of the phase-space variables (uncertainty relations) is clearly manifested between two particles that are separated by small distances.

Tripartite Entanglement versus Tripartite Nonlocality in Three-Qubit Greenberger-Horne-Zeilinger-Class States

We analyze the relationship between tripartite entanglement and genuine tripartite nonlocality for three-qubit pure states in the Greenberger-Horne-Zeilinger class. We consider a family of states known as the generalized Greenberger-Horne-Zeilinger states and derive an analytical expression relating the three-tangle, which quantifies tripartite entanglement, to the Svetlichny inequality, which is a Bell-type inequality that is violated only when all three qubits are nonlocally correlated. We show that states with three-tangle less than 1/2 do not violate the Svetlichny inequality. On the other hand, a set of states known as the maximal slice states does violate the Svetlichny inequality, and exactly analogous to the two-qubit case, the amount of violation is directly related to the degree of tripartite entanglement. We discuss further interesting properties of the generalized Greenberger-Horne-Zeilinger and maximal slice states.

Deep Packet Inspection Using Message Passing Networks

We propose a solution based on message passing bipartite networks, for deep packet inspection, which addresses both speed and memory issues, which are limiting factors in current solutions. We report on a preliminary implementation and propose a parallel architecture.

d-Regular Graphs of Acyclic Chromatic Index at Least d+2

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a'(G). It was conjectured by Alon, Suclakov and Zaks (and earlier by Fiamcik) that a'(G) <= Delta+2, where Delta = Delta(G) denotes the maximum degree of the graph. Alon et al. also raised the question whether the complete graphs of even order are the only regular graphs which require Delta+2 colors to be acyclically edge colored. In this article, using a simple counting argument we observe not only that this is not true, but in fact all d-regular graphs with 2n vertices and d>n, requires at least d+2 colors. We also show that a'(K-n,K-n) >= n+2, when n is odd using a more non-trivial argument. (Here K-n,K-n denotes the complete bipartite graph with n vertices on each side.) This lower bound for Kn,n can be shown to be tight for some families of complete bipartite graphs and for small values of n. We also infer that for every d, n such that d >= 5, n >= 2d+3 and dn even, there exist d-regular graphs which require at least d+2-colors to be acyclically edge colored. (C) 2009 Wiley Periodicals, Inc. J Graph Theory 63: 226-230, 2010.

Experimental implementation of a three qubit quantum game with corrupt source using nuclear magnetic resonance quantum information processor

In a three player quantum `Dilemma' game each player takes independent decisions to maximize his/her individual gain. The optimal strategy in the quantum version of this game has a higher payoff compared to its classical counterpart. However, this advantage is lost if the initial qubits provided to the players are from a noisy source. We have experimentally implemented the three player quantum version of the `Dilemma' game as described by Johnson, [N.F. Johnson, Phys. Rev. A 63 (2001) 020302(R)] using nuclear magnetic resonance quantum information processor and have experimentally verified that the payoff of the quantum game for various levels of corruption matches the theoretical payoff. (c) 2007 Elsevier Inc. All rights reserved.

Voting Paths

We consider a variant of the popular matching problem here. The input instance is a bipartite graph $G=(\mathcal{A}\cup\mathcal{P},E)$, where vertices in $\mathcal{A}$ are called applicants and vertices in $\mathcal{P}$ are called posts. Each applicant ranks a subset of posts in an order of preference, possibly involving ties. A matching $M$ is popular if there is no other matching $M'$ such that the number of applicants who prefer their partners in $M'$ to $M$ exceeds the number of applicants who prefer their partners in $M$ to $M'$. However, the “more popular than” relation is not transitive; hence this relation is not a partial order, and thus there need not be a maximal element here. Indeed, there are simple instances that do not admit popular matchings. The questions of whether an input instance $G$ admits a popular matching and how to compute one if it exists were studied earlier by Abraham et al. Here we study reachability questions among matchings in $G$, assuming that $G=(\mathcal{A}\cup\mathcal{P},E)$ admits a popular matching. A matching $M_k$ is reachable from $M_0$ if there is a sequence of matchings $\langle M_0,M_1,\dots,M_k\rangle$ such that each matching is more popular than its predecessor. Such a sequence is called a length-$k$ voting path from $M_0$ to $M_k$. We show an interesting property of reachability among matchings in $G$: there is always a voting path of length at most 2 from any matching to some popular matching. Given a bipartite graph $G=(\mathcal{A}\cup\mathcal{P},E)$ with $n$ vertices and $m$ edges and any matching $M_0$ in $G$, we give an $O(m\sqrt{n})$ algorithm to compute a shortest-length voting path from $M_0$ to a popular matching; when preference lists are strictly ordered, we have an $O(m+n)$ algorithm. This problem has applications in dynamic matching markets, where applicants and posts can enter and leave the market, and applicants can also change their preferences arbitrarily. After any change, the current matching may no longer be popular, in which case we are required to update it. However, our model demands that we switch from one matching to another only if there is consensus among the applicants to agree to the switch. Hence we need to update via a voting path that ends in a popular matching. Thus our algorithm has applications here.