Braid groups of non-orientable surfaces and the Fadell-Neuwirth short exact sequence

Let M be a compact, connected non-orientable surface without boundary and of genus g >= 3. We investigate the pure braid groups P,(M) of M, and in particular the possible splitting of the Fadell-Neuwirth short exact sequence 1 -> P(m)(M \ {x(1), ..., x(n)}) hooked right arrow P(n+m)(M) (P*) under right arrow P(n)(M) -> 1, where m, n >= 1, and p* is the homomorphism which corresponds geometrically to forgetting the last m strings. This problem is equivalent to that of the existence of a section for the associated fibration p: F(n+m)(M) -> F(n)(M) of configuration spaces, defined by p((x(1), ..., x(n), x(n+1), ..., x(n+m))) = (x(1), ..., x(n)). We show that p and p* admit a section if and only if n = 1. Together with previous results, this completes the resolution of the splitting problem for surface pure braid groups. (C) 2009 Elsevier B.V. All rights reserved.

BarraCUDA - a fast short read sequence aligner using graphics processing units.

BACKGROUND: With the maturation of next-generation DNA sequencing (NGS) technologies, the throughput of DNA sequencing reads has soared to over 600 gigabases from a single instrument run. General purpose computing on graphics processing units (GPGPU), extracts the computing power from hundreds of parallel stream processors within graphics processing cores and provides a cost-effective and energy efficient alternative to traditional high-performance computing (HPC) clusters. In this article, we describe the implementation of BarraCUDA, a GPGPU sequence alignment software that is based on BWA, to accelerate the alignment of sequencing reads generated by these instruments to a reference DNA sequence. FINDINGS: Using the NVIDIA Compute Unified Device Architecture (CUDA) software development environment, we ported the most computational-intensive alignment component of BWA to GPU to take advantage of the massive parallelism. As a result, BarraCUDA offers a magnitude of performance boost in alignment throughput when compared to a CPU core while delivering the same level of alignment fidelity. The software is also capable of supporting multiple CUDA devices in parallel to further accelerate the alignment throughput. CONCLUSIONS: BarraCUDA is designed to take advantage of the parallelism of GPU to accelerate the alignment of millions of sequencing reads generated by NGS instruments. By doing this, we could, at least in part streamline the current bioinformatics pipeline such that the wider scientific community could benefit from the sequencing technology.BarraCUDA is currently available from http://seqbarracuda.sf.net.

The polydispersity of ethylene sequence in metallocene ethylene/alpha-olefin copolymers III: crystallization and melting behavior of short ethylene sequence

Crystallization and melting behavior of short ethylene sequence of metallocene ethylene/alpha -olefin copolymer with high comonomer content have been studied by standard DSC and modulated-temperature differential scanning calorimetry (M-TDSC) technique. In addition to high temperature endotherm around 120 degreesC, a low temperature endotherm is observed at lower temperatures (40-80 degreesC), depending on time and temperature of isothermal crystallization. The peak position of the low temperature endotherm T-m(low) varies linearly with the logarithm of crystallization time and the slope, D, decreases with increasing crystallization temperature T-c. The T-m(low) also depends on the thermal history before the crystallization at T-c, and an extrapolation of T-m(low) (30.6 degreesC) to a few seconds has been obtained after two step isothermal crystallization before the crystallization at 30 degreesC. The T-m(low) is nearly equal to T-c, and it indicates that the initial crystallization at low temperature is nearly reversible. Direct evidence of conformational. entropy change of secondary crystallization has been obtained by using M-TDSC technique. Both the M-TDSC result and the activation energy analysis of temperature dependence suggest that crystal perfection process and conformational entropy decreasing in residual amorphous co-exist during secondary crystallization.

Improving Short DNA Sequence Alignment with Parallel Computing

Variations in different types of genomes have been found to be responsible for a large degree of physical diversity such as appearance and susceptibility to disease. Identification of genomic variations is difficult and can be facilitated through computational analysis of DNA sequences. Newly available technologies are able to sequence billions of DNA base pairs relatively quickly. These sequences can be used to identify variations within their specific genome but must be mapped to a reference sequence first. In order to align these sequences to a reference sequence, we require mapping algorithms that make use of approximate string matching and string indexing methods. To date, few mapping algorithms have been tailored to handle the massive amounts of output generated by newly available sequencing technologies. In otrder to handle this large amount of data, we modified the popular mapping software BWA to run in parallel using OpenMPI. Parallel BWA matches the efficiency of multithreaded BWA functions while providing efficient parallelism for BWA functions that do not currently support multithreading. Parallel BWA shows significant wall time speedup in comparison to multithreaded BWA on high-performance computing clusters, and will thus facilitate the analysis of genome sequencing data.

3-MANIFOLD GROUPS, KÄHLER GROUPS AND COMPLEX SURFACES

Let G be a Kahler group admitting a short exact sequence 1 -> N -> G -> Q -> 1 where N is finitely generated. (i) Then Q cannot be non-nilpotent solvable. (ii) Suppose in addition that Q satisfies one of the following: (a) Q admits a discrete faithful non-elementary action on H-n for some n >= 2. (b) Q admits a discrete faithful non-elementary minimal action on a simplicial tree with more than two ends. (c) Q admits a (strong-stable) cut R such that the intersection of all conjugates of R is trivial. Then G is virtually a surface group. It follows that if Q is infinite, not virtually cyclic, and is the fundamental group of some closed 3-manifold, then Q contains as a finite index subgroup either a finite index subgroup of the three-dimensional Heisenberg group or the fundamental group of the Cartesian product of a closed oriented surface of positive genus and the circle. As a corollary, we obtain a new proof of a theorem of Dimca and Suciu in Which 3-manifold groups are Kahler groups? J. Eur. Math. Soc. 11 (2009) 521-528] by taking N to be the trivial group. If instead, G is the fundamental group of a compact complex surface, and N is finitely presented, then we show that Q must contain the fundamental group of a Seifert-fibered 3-manifold as a finite index subgroup, and G contains as a finite index subgroup the fundamental group of an elliptic fibration. We also give an example showing that the relation of quasi-isometry does not preserve Kahler groups. This gives a negative answer to a question of Gromov which asks whether Kahler groups can be characterized by their asymptotic geometry.

The lower central and derived series of the braid groups of the projective plane

In this paper, we determine the lower central and derived series for the braid groups of the projective plane. We are motivated in part by the study of Fadell-Neuwirth short exact sequences, but the problem is interesting in its own right. The n-string braid groups B(n)(RP(2)) of the projective plane RP(2) were originally studied by Van Buskirk during the 1960s. and are of particular interest due to the fact that they have torsion. The group B(1)(RP(2)) (resp. B(2)(RP(2))) is isomorphic to the cyclic group Z(2) of order 2 (resp. the generalised quaternion group of order 16) and hence their lower central and derived series are known. If n > 2, we first prove that the lower central series of B(n)(RP(2)) is constant from the commutator subgroup onwards. We observe that Gamma(2)(B(3)(RP(2))) is isomorphic to (F(3) X Q(8)) X Z(3), where F(k) denotes the free group of rank k, and Q(8) denotes the quaternion group of order 8, and that Gamma(2)(B(4)(RP(2))) is an extension of an index 2 subgroup K of P(4)(RP(2)) by Z(2) circle plus Z(2). As for the derived series of B(n)(RP(2)), we show that for all n >= 5, it is constant from the derived subgroup onwards. The group B(n)(RP(2)) being finite and soluble for n <= 2, the critical cases are n = 3, 4. We are able to determine completely the derived series of B(3)(RP(2)). The subgroups (B(3)(RP(2)))((1)), (B(3)(RP(2)))((2)) and (B(3)(RP(2)))((3)) are isomorphic respectively to (F(3) x Q(8)) x Z(3), F(3) X Q(8) and F(9) X Z(2), and we compute the derived series quotients of these groups. From (B(3)(RP(2)))((4)) onwards, the derived series of B(3)(RP(2)), as well as its successive derived series quotients, coincide with those of F(9). We analyse the derived series of B(4)(RP(2)) and its quotients up to (B(4)(RP(2)))((4)), and we show that (B(4)(RP(2)))((4)) is a semi-direct product of F(129) by F(17). Finally, we give a presentation of Gamma(2)(B(n)(RP(2))). (C) 2011 Elsevier Inc. All rights reserved.

Rational O(2)–Equivariant Spectra

The category of rational O(2)-equivariant cohomology theories has an algebraic model A(O(2)), as established by work of Greenlees. That is, there is an equivalence of categories between the homotopy category of rational O(2)-equivariant spectra and the derived category of the abelian model DA(O(2)). In this paper we lift this equivalence of homotopy categories to the level of Quillen equivalences of model categories. This Quillen equivalence is also compatible with the Adams short exact sequence of the algebraic model.

Some constructions, related to noncommutative tori; Fredholm modules and the Beilinson-Bloch regulator

A noncommutative 2-torus is one of the main toy models of noncommutative geometry, and a noncommutative n-torus is a straightforward generalization of it. In 1980, Pimsner and Voiculescu in [17] described a 6-term exact sequence, which allows for the computation of the K-theory of noncommutative tori. It follows that both even and odd K-groups of n-dimensional noncommutative tori are free abelian groups on 2^n-1 generators. In 1981, the Powers-Rieffel projector was described [19], which, together with the class of identity, generates the even K-theory of noncommutative 2-tori. In 1984, Elliott [10] computed trace and Chern character on these K-groups. According to Rieffel [20], the odd K-theory of a noncommutative n-torus coincides with the group of connected components of the elements of the algebra. In particular, generators of K-theory can be chosen to be invertible elements of the algebra. In Chapter 1, we derive an explicit formula for the First nontrivial generator of the odd K-theory of noncommutative tori. This gives the full set of generators for the odd K-theory of noncommutative 3-tori and 4-tori.

In Chapter 2, we apply the graded-commutative framework of differential geometry to the polynomial subalgebra of the noncommutative torus algebra. We use the framework of differential geometry described in [27], [14], [25], [26]. In order to apply this framework to noncommutative torus, the notion of the graded-commutative algebra has to be generalized: the "signs" should be allowed to take values in U(1), rather than just {-1,1}. Such generalization is well-known (see, e.g., [8] in the context of linear algebra). We reformulate relevant results of [27], [14], [25], [26] using this extended notion of sign. We show how this framework can be used to construct differential operators, differential forms, and jet spaces on noncommutative tori. Then, we compare the constructed differential forms to the ones, obtained from the spectral triple of the noncommutative torus. Sections 2.1-2.3 recall the basic notions from [27], [14], [25], [26], with the required change of the notion of "sign". In Section 2.4, we apply these notions to the polynomial subalgebra of the noncommutative torus algebra. This polynomial subalgebra is similar to a free graded-commutative algebra. We show that, when restricted to the polynomial subalgebra, Connes construction of differential forms gives the same answer as the one obtained from the graded-commutative differential geometry. One may try to extend these notions to the smooth noncommutative torus algebra, but this was not done in this work.

A reconstruction of the Beilinson-Bloch regulator (for curves) via Fredholm modules was given by Eugene Ha in [12]. However, the proof in [12] contains a critical gap; in Chapter 3, we close this gap. More specifically, we do this by obtaining some technical results, and by proving Property 4 of Section 3.7 (see Theorem 3.9.4), which implies that such reformulation is, indeed, possible. The main motivation for this reformulation is the longer-term goal of finding possible analogs of the second K-group (in the context of algebraic geometry and K-theory of rings) and of the regulators for noncommutative spaces. This work should be seen as a necessary preliminary step for that purpose.

For the convenience of the reader, we also give a short description of the results from [12], as well as some background material on central extensions and Connes-Karoubi character.

Application of fast Pade approximation in simulating photonic crystal nanocavities by FDTD technology

The exact calculation of mode quality factor Q is a key problem in the design of high-Q photonic crystal nanocavity. On the basis of further investigation on conventional Pade approximation, FDM and DFT, Pade approximation with Baker's algorithm is enhanced through introducing multiple frequency search and parabola interpolation. Though Pade approximation is a nonlinear signal processing method and only short time sequence is needed, we find the different length of sequence requirements for 2D and 3D FDTD, which is very important to obtain convergent and accurate results. By using the modified Pade approximation method and 3D FDTD, the 2D slab photonic crystal nanocavity is analyzed and high-Q multimode can be solved quickly instead of large range high-resolution scanning. Monitor position has also been investigated. These results are very helpful to the design of photonic crystal nanocavity devices. (C) 2008 Elsevier B.V. All rights reserved.

THE LOWER CENTRAL AND DERIVED SERIES OF THE BRAID GROUPS OF THE FINITELY-PUNCTURED SPHERE

Motivated in part by the study of Fadell-Neuwirth short exact sequences, we determine the lower central and derived series for the braid groups of the finitely-punctured sphere. For n >= 1, the class of m-string braid groups B(m)(S(2)\{x(1), ... , x(n)}) of the n-punctured sphere includes the usual Artin braid groups B(m) (for n = 1), those of the annulus, which are Artin groups of type B (for n = 2), and affine Artin groups of type (C) over tilde (for n = 3). We first consider the case n = 1. Motivated by the study of almost periodic solutions of algebraic equations with almost periodic coefficients, Gorin and Lin calculated the commutator subgroup of the Artin braid groups. We extend their results, and show that the lower central series (respectively, derived series) of B(m) is completely determined for all m is an element of N (respectively, for all m not equal 4). In the exceptional case m = 4, we obtain some higher elements of the derived series and its quotients. When n >= 2, we prove that the lower central series (respectively, derived series) of B(m)(S(2)\{x(1), ... , x(n)}) is constant from the commutator subgroup onwards for all m >= 3 (respectively, m >= 5). The case m = 1 is that of the free group of rank n - 1. The case n = 2 is of particular interest notably when m = 2 also. In this case, the commutator subgroup is a free group of infinite rank. We then go on to show that B(2)(S(2)\{x(1), x(2)}) admits various interpretations, as the Baumslag-Solitar group BS(2, 2), or as a one-relator group with non-trivial centre for example. We conclude from this latter fact that B(2)(S(2)\{x(1), x(2)}) is residually nilpotent, and that from the commutator subgroup onwards, its lower central series coincides with that of the free product Z(2) * Z. Further, its lower central series quotients Gamma(i)/Gamma(i+1) are direct sums of copies of Z(2), the number of summands being determined explicitly. In the case m >= 3 and n = 2, we obtain a presentation of the derived subgroup, from which we deduce its Abelianization. Finally, in the case n = 3, we obtain partial results for the derived series, and we prove that the lower central series quotients Gamma(i)/Gamma(i+1) are 2-elementary finitely-generated groups.

Drafting the Kensington Pride Mango Genome

The mango industry in Australia is worth in excess of $150 million annually with the Kensington Pride (KP) cultivar capturing 60% of the domestic market. Valued by consumers for desirable taste and colour characteristics, KP has been used extensively as a parent in the Department of Agriculture and Fisheries’ (Queensland, Australia) mango breeding program with over 400 hybrid trees sharing KP as the male parent. In order to gain a better understanding of Australia’s most significant mango variety, Horticulture Innovation Australia had led an international collaboration between the Queensland Department of Agriculture and Fisheries (Australia), the International Crops Research Institute for the Semi-Arid Tropics (ICRISAT, India) and the Beijing Genomics Institute (China) to sequence the KP genome. Preliminary de novo assembly of illumina short read sequence data suggests that the KP genome is highly heterozygous and has an estimated genome size of 407 Mb. As refinements and additional sequence data are added to the assembly, a more complete picture of the mango genome will be elucidated.

Facile enantiospecific synthesis of (+)-iso-cladospolide B

Enantiospecific synthesis of bio-active butenolide (+)-iso-cladospolide B from D-(-)-tartaric acid in a short synthetic sequence is presented. Pivotal reaction sequence includes cross metathesis of an alkene and Wittig olefination. (C) 2010 Elsevier Ltd. All rights reserved.

A fast algorithm for finding frequent episodes in event streams

Frequent episode discovery is a popular framework for mining data available as a long sequence of events. An episode is essentially a short ordered sequence of event types and the frequency of an episode is some suitable measure of how often the episode occurs in the data sequence. Recently,we proposed a new frequency measure for episodes based on the notion of non-overlapped occurrences of episodes in the event sequence, and showed that, such a definition, in addition to yielding computationally efficient algorithms, has some important theoretical properties in connecting frequent episode discovery with HMM learning. This paper presents some new algorithms for frequent episode discovery under this non-overlapped occurrences-based frequency definition. The algorithms presented here are better (by a factor of N, where N denotes the size of episodes being discovered) in terms of both time and space complexities when compared to existing methods for frequent episode discovery. We show through some simulation experiments, that our algorithms are very efficient. The new algorithms presented here have arguably the least possible orders of spaceand time complexities for the task of frequent episode discovery.