Motion of four-dimensional rigid body around a fixed point: an elementary approach. I

The goal of this note is to give the explicit solution of Euler-Frahm equations for the Manakov four-dimensional case by elementary means. For this, we use some results from the original papers by Schottky [Sch 1891], Koetter [Koe 1892], Weber [We 1878], and Caspary [Ca 1893]. We hope that such approach will be useful for the solution of the problem of $n$-dimensional top.Comment: LaTeX, 9 page

Network Analysis: Overview

Non peer reviewe

On integration of the Kowalevski gyrostat and the Clebsch problems

For the Kowalevski gyrostat change of variables similar to that of the Kowalevski top is done. We establish one to one correspondence between the Kowalevski gyrostat and the Clebsch system and demonstrate that Kowalevski variables for the gyrostat practically coincide with elliptic coordinates on sphere for the Clebsch case. Equivalence of considered integrable systems allows to construct two Lax matrices for the gyrostat using known rational and elliptic Lax matrices for the Clebsch model. Associated with these matrices solutions of the Clebsch system and, therefore, of the Kowalevski gyrostat problem are discussed. The Kotter solution of the Clebsch system in modern notation is presented in detail.Comment: LaTeX, 24 page

Robust vetoes for gravitational-wave burst triggers using known instrumental couplings

The search for signatures of transient, unmodelled gravitational-wave (GW) bursts in the data of ground-based interferometric detectors typically uses `excess-power' search methods. One of the most challenging problems in the burst-data-analysis is to distinguish between actual GW bursts and spurious noise transients that trigger the detection algorithms. In this paper, we present a unique and robust strategy to `veto' the instrumental glitches. This method makes use of the phenomenological understanding of the coupling of different detector sub-systems to the main detector output. The main idea behind this method is that the noise at the detector output (channel H) can be projected into two orthogonal directions in the Fourier space -- along, and orthogonal to, the direction in which the noise in an instrumental channel X would couple into H. If a noise transient in the detector output originates from channel X, it leaves the statistics of the noise-component of H orthogonal to X unchanged, which can be verified by a statistical hypothesis testing. This strategy is demonstrated by doing software injections in simulated Gaussian noise. We also formulate a less-rigorous, but computationally inexpensive alternative to the above method. Here, the parameters of the triggers in channel X are compared to the parameters of the triggers in channel H to see whether a trigger in channel H can be `explained' by a trigger in channel X and the measured transfer function.Comment: 14 Pages, 8 Figures, To appear in Class. Quantum Gra

Discovering universal statistical laws of complex networks

Different network models have been suggested for the topology underlying complex interactions in natural systems. These models are aimed at replicating specific statistical features encountered in real-world networks. However, it is rarely considered to which degree the results obtained for one particular network class can be extrapolated to real-world networks. We address this issue by comparing different classical and more recently developed network models with respect to their generalisation power, which we identify with large structural variability and absence of constraints imposed by the construction scheme. After having identified the most variable networks, we address the issue of which constraints are common to all network classes and are thus suitable candidates for being generic statistical laws of complex networks. In fact, we find that generic, not model-related dependencies between different network characteristics do exist. This allows, for instance, to infer global features from local ones using regression models trained on networks with high generalisation power. Our results confirm and extend previous findings regarding the synchronisation properties of neural networks. Our method seems especially relevant for large networks, which are difficult to map completely, like the neural networks in the brain. The structure of such large networks cannot be fully sampled with the present technology. Our approach provides a method to estimate global properties of under-sampled networks with good approximation. Finally, we demonstrate on three different data sets (C. elegans' neuronal network, R. prowazekii's metabolic network, and a network of synonyms extracted from Roget's Thesaurus) that real-world networks have statistical relations compatible with those obtained using regression models

Yeast chassis design for production of dicarboxylic acids

Saccharomyces cerevisiae is a widely used microorganism for industrial biotechnology that has great potential to replace traditional petrochemical synthesis. Optimization of cell factories for production of different biotechnological products is still a cost and time inefficient process. Availability of pre-optimized yeast chassis cells, with improved precursor supply, will overcome such hurdles. Building upon this premise, we have developed a framework for rational design of chassis strains combining genome-scale metabolic models with a multi-objective metaheuristic approach. Here, we present the non-intuitive gene deletion targets optimized for growth-product coupled production of a family of C4-dicarboxylic acids, namely fumaric, succinic and malic acids. Several multi-gene deletion strains, including the chassis cell and the final producer strains, were implemented and experimentally tested. The strains encompassing the chassis backbone produce higher yields of respective targeted compounds than those containing merely the intuitive gene deletion(s). Taking advantage of the growth-product coupled design, best producing strains have been improved by adaptive laboratory evolution. As a proof-of-concept, we have generated pre-optimized chassis yeast cells for enhanced production of C4-dicarboxylic acids, hence showing that modular design strategies may contribute to accelerate cell factory development.info:eu-repo/semantics/publishedVersio

An Algebraic Approach for Decoding Spread Codes

In this paper we study spread codes: a family of constant-dimension codes for random linear network coding. In other words, the codewords are full-rank matrices of size (k x n) with entries in a finite field F_q. Spread codes are a family of optimal codes with maximal minimum distance. We give a minimum-distance decoding algorithm which requires O((n-k)k^3) operations over an extension field F_{q^k}. Our algorithm is more efficient than the previous ones in the literature, when the dimension k of the codewords is small with respect to n. The decoding algorithm takes advantage of the algebraic structure of the code, and it uses original results on minors of a matrix and on the factorization of polynomials over finite fields

Status of the GEO600 gravitational wave detector

The GEO600 laser interferometric gravitational wave detector is approaching the end of its commissioning phase which started in 1995.During a test run in January 2002 the detector was operated for 15 days in a power-recycled michelson configuration. The detector and environmental data which were acquired during this test run were used to test the data analysis code. This paper describes the subsystems of GEO600, the status of the detector by August 2002 and the plans towards the first science run

De novo sequencing, assembly and analysis of the genome of the laboratory strain Saccharomyces cerevisiae CEN.PK113-7D, a model for modern industrial biotechnology

Saccharomyces cerevisiae CEN.PK 113-7D is widely used for metabolic engineering and systems biology research in industry and academia. We sequenced, assembled, annotated and analyzed its genome. Single-nucleotide variations (SNV), insertions/deletions (indels) and differences in genome organization compared to the reference strain S. cerevisiae S288C were analyzed. In addition to a few large deletions and duplications, nearly 3000 indels were identified in the CEN.PK113-7D genome relative to S288C. These differences were overrepresented in genes whose functions are related to transcriptional regulation and chromatin remodelling. Some of these variations were caused by unstable tandem repeats, suggesting an innate evolvability of the corresponding genes. Besides a previously characterized mutation in adenylate cyclase, the CEN.PK113-7D genome sequence revealed a significant enrichment of non-synonymous mutations in genes encoding for components of the cAMP signalling pathway. Some phenotypic characteristics of the CEN.PK113-7D strains were explained by the presence of additional specific metabolic genes relative to S288C. In particular, the presence of the BIO1 and BIO6 genes correlated with a biotin prototrophy of CEN.PK113-7D. Furthermore, the copy number, chromosomal location and sequences of the MAL loci were resolved. The assembled sequence reveals that CEN.PK113-7D has a mosaic genome that combines characteristics of laboratory strains and wild-industrial strains