533 research outputs found

    Decoherence in a system of many two--level atoms

    Full text link
    I show that the decoherence in a system of NN degenerate two--level atoms interacting with a bosonic heat bath is for any number of atoms NN governed by a generalized Hamming distance (called ``decoherence metric'') between the superposed quantum states, with a time--dependent metric tensor that is specific for the heat bath.The decoherence metric allows for the complete characterization of the decoherence of all possible superpositions of many-particle states, and can be applied to minimize the over-all decoherence in a quantum memory. For qubits which are far apart, the decoherence is given by a function describing single-qubit decoherence times the standard Hamming distance. I apply the theory to cold atoms in an optical lattice interacting with black body radiation.Comment: replaced with published versio

    Writer Identification Using Inexpensive Signal Processing Techniques

    Full text link
    We propose to use novel and classical audio and text signal-processing and otherwise techniques for "inexpensive" fast writer identification tasks of scanned hand-written documents "visually". The "inexpensive" refers to the efficiency of the identification process in terms of CPU cycles while preserving decent accuracy for preliminary identification. This is a comparative study of multiple algorithm combinations in a pattern recognition pipeline implemented in Java around an open-source Modular Audio Recognition Framework (MARF) that can do a lot more beyond audio. We present our preliminary experimental findings in such an identification task. We simulate "visual" identification by "looking" at the hand-written document as a whole rather than trying to extract fine-grained features out of it prior classification.Comment: 9 pages; 1 figure; presented at CISSE'09 at http://conference.cisse2009.org/proceedings.aspx ; includes the the application source code; based on MARF described in arXiv:0905.123

    Detection of trend changes in time series using Bayesian inference

    Full text link
    Change points in time series are perceived as isolated singularities where two regular trends of a given signal do not match. The detection of such transitions is of fundamental interest for the understanding of the system's internal dynamics. In practice observational noise makes it difficult to detect such change points in time series. In this work we elaborate a Bayesian method to estimate the location of the singularities and to produce some confidence intervals. We validate the ability and sensitivity of our inference method by estimating change points of synthetic data sets. As an application we use our algorithm to analyze the annual flow volume of the Nile River at Aswan from 1871 to 1970, where we confirm a well-established significant transition point within the time series.Comment: 9 pages, 12 figures, submitte

    A New Approach to Time Domain Classification of Broadband Noise in Gravitational Wave Data

    Get PDF
    Broadband noise in gravitational wave (GW) detectors, also known as triggers, can often be a deterrant to the efficiency with which astrophysical search pipelines detect sources. It is important to understand their instrumental or environmental origin so that they could be eliminated or accounted for in the data. Since the number of triggers is large, data mining approaches such as clustering and classification are useful tools for this task. Classification of triggers based on a handful of discrete properties has been done in the past. A rich information content is available in the waveform or 'shape' of the triggers that has had a rather restricted exploration so far. This paper presents a new way to classify triggers deriving information from both trigger waveforms as well as their discrete physical properties using a sequential combination of the Longest Common Sub-Sequence (LCSS) and LCSS coupled with Fast Time Series Evaluation (FTSE) for waveform classification and the multidimensional hierarchical classification (MHC) analysis for the grouping based on physical properties. A generalized k-means algorithm is used with the LCSS (and LCSS+FTSE) for clustering the triggers using a validity measure to determine the correct number of clusters in absence of any prior knowledge. The results have been demonstrated by simulations and by application to a segment of real LIGO data from the sixth science run.Comment: 16 pages, 16 figure

    On finite pp-groups whose automorphisms are all central

    Full text link
    An automorphism α\alpha of a group GG is said to be central if α\alpha commutes with every inner automorphism of GG. We construct a family of non-special finite pp-groups having abelian automorphism groups. These groups provide counter examples to a conjecture of A. Mahalanobis [Israel J. Math., {\bf 165} (2008), 161 - 187]. We also construct a family of finite pp-groups having non-abelian automorphism groups and all automorphisms central. This solves a problem of I. Malinowska [Advances in group theory, Aracne Editrice, Rome 2002, 111-127].Comment: 11 pages, Counter examples to a conjecture from [Israel J. Math., {\bf 165} (2008), 161 - 187]; This paper will appear in Israel J. Math. in 201

    Statistical mechanics of transcription-factor binding site discovery using Hidden Markov Models

    Full text link
    Hidden Markov Models (HMMs) are a commonly used tool for inference of transcription factor (TF) binding sites from DNA sequence data. We exploit the mathematical equivalence between HMMs for TF binding and the "inverse" statistical mechanics of hard rods in a one-dimensional disordered potential to investigate learning in HMMs. We derive analytic expressions for the Fisher information, a commonly employed measure of confidence in learned parameters, in the biologically relevant limit where the density of binding sites is low. We then use techniques from statistical mechanics to derive a scaling principle relating the specificity (binding energy) of a TF to the minimum amount of training data necessary to learn it.Comment: 25 pages, 2 figures, 1 table V2 - typos fixed and new references adde

    A distinct peak-flux distribution of the third class of gamma-ray bursts: A possible signature of X-ray flashes?

    Full text link
    Gamma-ray bursts are the most luminous events in the Universe. Going beyond the short-long classification scheme we work in the context of three burst populations with the third group of intermediate duration and softest spectrum. We are looking for physical properties which discriminate the intermediate duration bursts from the other two classes. We use maximum likelihood fits to establish group memberships in the duration-hardness plane. To confirm these results we also use k-means and hierarchical clustering. We use Monte-Carlo simulations to test the significance of the existence of the intermediate group and we find it with 99.8% probability. The intermediate duration population has a significantly lower peak-flux (with 99.94% significance). Also, long bursts with measured redshift have higher peak-fluxes (with 98.6% significance) than long bursts without measured redshifts. As the third group is the softest, we argue that we have {related} them with X-ray flashes among the gamma-ray bursts. We give a new, probabilistic definition for this class of events.Comment: accepted for publication in Ap

    A geometric approach to visualization of variability in functional data

    Get PDF
    We propose a new method for the construction and visualization of boxplot-type displays for functional data. We use a recent functional data analysis framework, based on a representation of functions called square-root slope functions, to decompose observed variation in functional data into three main components: amplitude, phase, and vertical translation. We then construct separate displays for each component, using the geometry and metric of each representation space, based on a novel definition of the median, the two quartiles, and extreme observations. The outlyingness of functional data is a very complex concept. Thus, we propose to identify outliers based on any of the three main components after decomposition. We provide a variety of visualization tools for the proposed boxplot-type displays including surface plots. We evaluate the proposed method using extensive simulations and then focus our attention on three real data applications including exploratory data analysis of sea surface temperature functions, electrocardiogram functions and growth curves

    Automatic Network Fingerprinting through Single-Node Motifs

    Get PDF
    Complex networks have been characterised by their specific connectivity patterns (network motifs), but their building blocks can also be identified and described by node-motifs---a combination of local network features. One technique to identify single node-motifs has been presented by Costa et al. (L. D. F. Costa, F. A. Rodrigues, C. C. Hilgetag, and M. Kaiser, Europhys. Lett., 87, 1, 2009). Here, we first suggest improvements to the method including how its parameters can be determined automatically. Such automatic routines make high-throughput studies of many networks feasible. Second, the new routines are validated in different network-series. Third, we provide an example of how the method can be used to analyse network time-series. In conclusion, we provide a robust method for systematically discovering and classifying characteristic nodes of a network. In contrast to classical motif analysis, our approach can identify individual components (here: nodes) that are specific to a network. Such special nodes, as hubs before, might be found to play critical roles in real-world networks.Comment: 16 pages (4 figures) plus supporting information 8 pages (5 figures

    Radio-loud Narrow-Line Type 1 Quasars

    Full text link
    We present the first systematic study of (non-radio-selected) radio-loud narrow-line Seyfert 1 (NLS1) galaxies. Cross-correlation of the `Catalogue of Quasars and Active Nuclei' with several radio and optical catalogues led to the identification of 11 radio-loud NLS1 candidates including 4 previously known ones. Most of the radio-loud NLS1s are compact, steep spectrum sources accreting close to, or above, the Eddington limit. The radio-loud NLS1s of our sample are remarkable in that they occupy a previously rarely populated regime in NLS1 multi-wavelength parameter space. While their [OIII]/H_beta and FeII/H_beta intensity ratios almost cover the whole range observed in NLS1 galaxies, their radio properties extend the range of radio-loud objects to those with small widths of the broad Balmer lines. Among the radio-detected NLS1 galaxies, the radio index R distributes quite smoothly up to the critical value of R ~ 10 and covers about 4 orders of magnitude in total. Statistics show that ~7% of the NLS1 galaxies are formally radio-loud while only 2.5% exceed a radio index R > 100. Several mechanisms are considered as explanations for the radio loudness of the NLS1 galaxies and for the lower frequency of radio-louds among NLS1s than quasars. While properties of most sources (with 2-3 exceptions) generally do not favor relativistic beaming, the combination of accretion mode and spin may explain the observations. (abbreviated)Comment: Astronomical Journal (first submitted in Dec. 2005); 45 pages incl. 1 colour figur
    corecore