Monotone Grid Drawings of Planar Graphs

A monotone drawing of a planar graph $G$ is a planar straight-line drawing of $G$ where a monotone path exists between every pair of vertices of $G$ in some direction. Recently monotone drawings of planar graphs have been proposed as a new standard for visualizing graphs. A monotone drawing of a planar graph is a monotone grid drawing if every vertex in the drawing is drawn on a grid point. In this paper we study monotone grid drawings of planar graphs in a variable embedding setting. We show that every connected planar graph of $n$ vertices has a monotone grid drawing on a grid of size $O(n)\times O(n^2)$, and such a drawing can be found in O(n) time

Interactive public digital displays: investigating its use in a high school context

This paper presents a longitudinal user study that investigated the adoption of some Bluetooth based functionalities for a public digital display in a high school. More specifically, the utilization of Bluetooth device naming extended beyond social identity representation and introduced the use of a simple interaction mechanism. The interaction mechanism involves recognizing parts of the Bluetooth device name as explicit instructions to trigger the generation of content on an interactive public display. Together with representatives of the teachers' community, the design team defined some social rules concerning usage in order to account for the specificities of the place. In the user study, three fully functional prototypes were deployed at the school hall of the high school. The functionalities introduced with the different prototypes were: the visualization on the display of the Bluetooth device names, the possibility to contribute to tag clouds and the possibility to choose icons from a given set for self-expression. The results suggest that people appropriated some but not all of the functionalities employed. Implications of our findings to the design of interactive digital displays are pointed out.(undefined

Testing Broken U(1) Symmetry in a Two-Component Atomic Bose-Einstein Condensate

We present a scheme for determining if the quantum state of a small trapped Bose-Einstein condensate is a state with well defined number of atoms, a Fock state, or a state with a broken U(1) gauge symmetry, a coherent state. The proposal is based on the observation of Ramsey fringes. The population difference observed in a Ramsey fringe experiment will exhibit collapse and revivals due to the mean-field interactions. The collapse and revival times depend on the relative strength of the mean-field interactions for the two components and the initial quantum state of the condensate.Comment: 20 Pages RevTex, 3 Figure

Higgs Signal for h to aa at Hadron Colliders

We assess the prospect of observing a neutral Higgs boson at hadron colliders in its decay to two spin-zero states, a, for a Higgs mass of 90-130 GeV, when produced in association with a W or Z boson. Such a decay is allowed in extensions of the MSSM with CP-violating interactions and in the NMSSM, and can dominate Higgs boson final states, thereby evading the LEP constraints on standard Higgs boson production. The light spin-zero state decays primarily via a to bb and tau+tau-, so this signal channel retains features distinct from the main backgrounds. Our study shows that at the Tevatron, there may be potential to observe a few events in the bb tau+tau- or bbbb channels with relatively small background, although this observation would be statistically limited. At the LHC, the background problem is more severe, but with cross sections and integrated luminosities orders of magnitude larger than at the Tevatron, the observation of a Higgs boson in this decay mode would be possible. The channel h to aa to bbbb would provide a large statistical significance, with a signal-to-background ratio on the order of 1:2. In these searches, the main challenge would be to retain the adequate tagging efficiency of b's and tau's in the low p_T region.Comment: Version to be published in JHEP. 20 pages, 5 figure

Structure formation in binary colloids

A theoretical study of the structure formation observed very recently [Phys. Rev. Lett. 90, 128303 (2003)] in binary colloids is presented. In our model solely the dipole-dipole interaction of the particles is considered, electrohidrodynamic effects are excluded. Based on molecular dynamics simulations and analytic calculations we show that the total concentration of the particles, the relative concentration and the relative dipole moment of the components determine the structure of the colloid. At low concentrations the kinetic aggregation of particles results in fractal structures which show a crossover behavior when increasing the concentration. At high concentration various lattice structures are obtained in a good agreement with experiments.Comment: revtex, 4 pages, figures available from authors due to size problem

Suffix Tree of Alignment: An Efficient Index for Similar Data

We consider an index data structure for similar strings. The generalized suffix tree can be a solution for this. The generalized suffix tree of two strings $A$ and $B$ is a compacted trie representing all suffixes in $A$ and $B$. It has $|A|+|B|$ leaves and can be constructed in $O(|A|+|B|)$ time. However, if the two strings are similar, the generalized suffix tree is not efficient because it does not exploit the similarity which is usually represented as an alignment of $A$ and $B$. In this paper we propose a space/time-efficient suffix tree of alignment which wisely exploits the similarity in an alignment. Our suffix tree for an alignment of $A$ and $B$ has $|A| + l_d + l_1$ leaves where $l_d$ is the sum of the lengths of all parts of $B$ different from $A$ and $l_1$ is the sum of the lengths of some common parts of $A$ and $B$. We did not compromise the pattern search to reduce the space. Our suffix tree can be searched for a pattern $P$ in $O(|P|+occ)$ time where $occ$ is the number of occurrences of $P$ in $A$ and $B$. We also present an efficient algorithm to construct the suffix tree of alignment. When the suffix tree is constructed from scratch, the algorithm requires $O(|A| + l_d + l_1 + l_2)$ time where $l_2$ is the sum of the lengths of other common substrings of $A$ and $B$. When the suffix tree of $A$ is already given, it requires $O(l_d + l_1 + l_2)$ time.Comment: 12 page

A variational approach to strongly damped wave equations

We discuss a Hilbert space method that allows to prove analytical well-posedness of a class of linear strongly damped wave equations. The main technical tool is a perturbation lemma for sesquilinear forms, which seems to be new. In most common linear cases we can furthermore apply a recent result due to Crouzeix--Haase, thus extending several known results and obtaining optimal analyticity angle.Comment: This is an extended version of an article appeared in \emph{Functional Analysis and Evolution Equations -- The G\"unter Lumer Volume}, edited by H. Amann et al., Birkh\"auser, Basel, 2008. In the latest submission to arXiv only some typos have been fixe

Transport in α\alpha-Sexithiophene Films

The field-effect mobility of hole polarons in $\alpha$-sexithiophene, measured in thin film transistors, was shown to be well fitted by Holstein's small polaron theory. Unfortunately, Holstein's formulation is based on an integral that does not converge. We show that the data are well fitted by a theory of polaron transport that was successful in accounting for mobility in molecular crystals of naphthalene.Comment: 10 pages, RevTex, one PostScript file aviable upon reques

Magnetospectroscopy of symmetric and anti-symmetric states in double quantum wells

The experimental results obtained for the magneto-transport in the InGaAs/InAlAs double quantum wells (DQW) structures of two different shapes of wells are reported. The beating-effect occurred in the Shubnikov-de Haas (SdH) oscillations was observed for both types of the structures at low temperatures in the parallel transport when magnetic field was perpendicular to the layers. An approach to the calculation of the Landau levels energies for DQW structures was developed and then applied to the analysis and interpretation of the experimental data related to the beating-effect. We also argue that in order to account for the observed magneto-transport phenomena (SdH and Integer Quantum Hall effect), one should introduce two different quasi-Fermi levels characterizing two electron sub-systems regarding symmetry properties of their states, symmetric and anti-symmetric ones which are not mixed by electron-electron interaction.Comment: 20 pages, 20 figure

Classification of protein interaction sentences via gaussian processes

The increase in the availability of protein interaction studies in textual format coupled with the demand for easier access to the key results has lead to a need for text mining solutions. In the text processing pipeline, classification is a key step for extraction of small sections of relevant text. Consequently, for the task of locating protein-protein interaction sentences, we examine the use of a classifier which has rarely been applied to text, the Gaussian processes (GPs). GPs are a non-parametric probabilistic analogue to the more popular support vector machines (SVMs). We find that GPs outperform the SVM and na\"ive Bayes classifiers on binary sentence data, whilst showing equivalent performance on abstract and multiclass sentence corpora. In addition, the lack of the margin parameter, which requires costly tuning, along with the principled multiclass extensions enabled by the probabilistic framework make GPs an appealing alternative worth of further adoption