Oxidation of guanine Nucleosides to 4-amidinocarbamoyl-5-hydroxyimidazoles by dimethyldioxirane

Final oxidation products generated from guanosine and 2'-deoxyguano sine by reaction with dimethyldioxirane have been identified as 4-amidinocarbamoyl-5-hydroxyimidazoles.

Design and implementation of a field programmable CRC circuit architecture

The design and implementation of a programmable cyclic redundancy check (CRC) computation circuit architecture, suitable for deployment in network related system-on-chips (SoCs) is presented. The architecture has been designed to be field reprogrammable so that it is fully flexible in terms of the polynomial deployed and the input port width. The circuit includes an embedded configuration controller that has a low reconfiguration time and hardware cost. The circuit has been synthesised and mapped to 130-nm UMC standard cell [application-specific integrated circuit (ASIC)] technology and is capable of supporting line speeds of 5 Gb/s. © 2006 IEEE.

Dynamic Density Forecasts for Multivariate Asset Returns

We propose a simple and flexible framework for forecasting the joint density of asset returns. The multinormal distribution is augmented with a polynomial in (time-varying) non-central co-moments of assets. We estimate the coefficients of the polynomial via the Method of Moments for a carefully selected set of co-moments. In an extensive empirical study, we compare the proposed model with a range of other models widely used in the literature. Employing a recently proposed as well as standard techniques to evaluate multivariate forecasts, we conclude that the augmented joint density provides highly accurate forecasts of the “negative tail” of the joint distribution.

Structural information content of networks: Graph entropy based on local vertex functionals

In this paper we define the structural information content of graphs as their corresponding graph entropy. This definition is based on local vertex functionals obtained by calculating-spheres via the algorithm of Dijkstra. We prove that the graph entropy and, hence, the local vertex functionals can be computed with polynomial time complexity enabling the application of our measure for large graphs. In this paper we present numerical results for the graph entropy of chemical graphs and discuss resulting properties. (C) 2007 Elsevier Ltd. All rights reserved.

Algorithmic computation of knot polynomials of secondary structure elements of proteins

The classification of protein structures is an important and still outstanding problem. The purpose of this paper is threefold. First, we utilize a relation between the Tutte and homfly polynomial to show that the Alexander-Conway polynomial can be algorithmically computed for a given planar graph. Second, as special cases of planar graphs, we use polymer graphs of protein structures. More precisely, we use three building blocks of the three-dimensional protein structure-alpha-helix, antiparallel beta-sheet, and parallel beta-sheet-and calculate, for their corresponding polymer graphs, the Tutte polynomials analytically by providing recurrence equations for all three secondary structure elements. Third, we present numerical results comparing the results from our analytical calculations with the numerical results of our algorithm-not only to test consistency, but also to demonstrate that all assigned polynomials are unique labels of the secondary structure elements. This paves the way for an automatic classification of protein structures.

A similarity measure for graphs with low computational complexity

We present and analyze an algorithm to measure the structural similarity of generalized trees, a new graph class which includes rooted trees. For this, we represent structural properties of graphs as strings and define the similarity of two Graphs as optimal alignments of the corresponding property stings. We prove that the obtained graph similarity measures are so called Backward similarity measures. From this we find that the time complexity of our algorithm is polynomial and, hence, significantly better than the time complexity of classical graph similarity methods based on isomorphic relations. (c) 2006 Elsevier Inc. All rights reserved.

Comparing large graphs efficiently by margins of feature vectors

Measuring the structural similarity of graphs is a challenging and outstanding problem. Most of the classical approaches of the so-called exact graph matching methods are based on graph or subgraph isomorphic relations of the underlying graphs. In contrast to these methods in this paper we introduce a novel approach to measure the structural similarity of directed and undirected graphs that is mainly based on margins of feature vectors representing graphs. We introduce novel graph similarity and dissimilarity measures, provide some properties and analyze their algorithmic complexity. We find that the computational complexity of our measures is polynomial in the graph size and, hence, significantly better than classical methods from, e.g. exact graph matching which are NP-complete. Numerically, we provide some examples of our measure and compare the results with the well-known graph edit distance. (c) 2006 Elsevier Inc. All rights reserved.

Finite domination and Novikov rings. Iterative approach

Suppose C is a bounded chain complex of finitely generated free modules over the Laurent polynomial ring L = R[x,x -1]. Then C is R-finitely dominated, i.e. homotopy equivalent over R to a bounded chain complex of finitely generated projective R-modules if and only if the two chain complexes C ? L R((x)) and C ? L R((x -1)) are acyclic, as has been proved by Ranicki (A. Ranicki, Finite domination and Novikov rings, Topology 34(3) (1995), 619–632). Here R((x)) = R[[x]][x -1] and R((x -1)) = R[[x -1]][x] are rings of the formal Laurent series, also known as Novikov rings. In this paper, we prove a generalisation of this criterion which allows us to detect finite domination of bounded below chain complexes of projective modules over Laurent rings in several indeterminates.

Efficient advanced encryption standard implementation using lookup and normal basis

A new type of advanced encryption standard (AES) implementation using a normal basis is presented. The method is based on a lookup technique that makes use of inversion and shift registers, which leads to a smaller size of lookup for the S-box than its corresponding implementations. The reduction in the lookup size is based on grouping sets of inverses into conjugate sets which in turn leads to a reduction in the number of lookup values. The above technique is implemented in a regular AES architecture using register files, which requires less interconnect and area and is suitable for security applications. The results of the implementation are competitive in throughput and area compared with the corresponding solutions in a polynomial basis.

Double complexes and vanishing of Novikov cohomology

We consider non-standard totalisation functors for double complexes, involving left or right truncated products. We show how properties of these imply that the algebraic mapping torus of a self map h of a cochain complex of finitely presented modules has trivial negative Novikov cohomology, and has trivial positive Novikov cohomology provided h is a quasi-isomorphism. As an application we obtain a new and transparent proof that a finitely dominated cochain complex over a Laurent polynomial ring has trivial (positive and negative) Novikov cohomology.

Seasonal variation in month of diagnosis in children with type 1 diabetes registered in 23 EURODIAB centres during 1989-2008

Objectives: To investigate seasonal variation in month of diagnosis in children with type 1 diabetes registered in EURODIAB centres during 1989-2008.
Methods: 23 population-based registers recorded date of diagnosis in new cases of clinically diagnosed type 1 diabetes in children aged under 15 years. Completeness of ascertainment was assessed through capture-recapture methodology and was high in most centres. A general test for seasonal variation (11df) and Edward's test for sinusoidal (sine wave) variation (2df) were employed. Time series methods were also used to investigate if meteorological data were predictive of monthly counts after taking account of seasonality and long term trends.
Results: Significant seasonal variation was apparent in all but two small centres, with an excess of cases apparent in the winter quarter. Significant sinusoidal pattern was also evident in all but two small centres with peaks in December (14 centres), January (5 centres) or February (2 centres). Relative amplitude varied from ±11% to ±39% (median ±18%). There was no relationship across the centres between relative amplitude and incidence level. However there was evidence of significant deviation from the sinusoidal pattern in the majority of centres. Pooling results over centres, there was significant seasonal variation in each age-group at diagnosis, but with significantly less variation in those aged under 5 years. Boys showed marginally greater seasonal variation than girls. There were no differences in seasonal pattern between four sub-periods of the 20 year period. In most centres monthly counts of cases were not associated with deviations from normal monthly average temperature or sunshine hours; short term meteorological variations do not explain numbers of cases diagnosed.
Conclusions: Seasonality with a winter excess is apparent in all age-groups and both sexes, but girls and the under 5s show less marked variation. The seasonal pattern changed little in the 20 year period.

Low MAD2 expression levels associate with reduced progression-free survival in patients with high-grade serous epithelial ovarian cancer

Epithelial ovarian cancer (EOC) has an innate susceptibility to become chemoresistant. Up to 30% of patients do not respond to conventional chemotherapy [paclitaxel (Taxol®) in combination with carboplatin] and, of those who have an initial response, many patients relapse. Therefore, an understanding of the molecular mechanisms that regulate cellular chemotherapeutic responses in EOC cells has the potential to impact significantly on patient outcome. The mitotic arrest deficiency protein 2 (MAD2), is a centrally important mediator of the cellular response to paclitaxel. MAD2 immunohistochemical analysis was performed on 82 high-grade serous EOC samples. A multivariate Cox regression analysis of nuclear MAD2 IHC intensity adjusting for stage, tumour grade and optimum surgical debulking revealed that low MAD2 IHC staining intensity was significantly associated with reduced progression-free survival (PFS) (p = 0.0003), with a hazard ratio of 4.689. The in vitro analyses of five ovarian cancer cell lines demonstrated that cells with low MAD2 expression were less sensitive to paclitaxel. Furthermore, paclitaxel-induced activation of the spindle assembly checkpoint (SAC) and apoptotic cell death was abrogated in cells transfected with MAD2 siRNA. In silico analysis identified a miR-433 binding domain in the MAD2 3' UTR, which was verified in a series of experiments. Firstly, MAD2 protein expression levels were down-regulated in pre-miR-433 transfected A2780 cells. Secondly, pre-miR-433 suppressed the activity of a reporter construct containing the 3'-UTR of MAD2. Thirdly, blocking miR-433 binding to the MAD2 3' UTR protected MAD2 from miR-433 induced protein down-regulation. Importantly, reduced MAD2 protein expression in pre-miR-433-transfected A2780 cells rendered these cells less sensitive to paclitaxel. In conclusion, loss of MAD2 protein expression results in increased resistance to paclitaxel in EOC cells. Measuring MAD2 IHC staining intensity may predict paclitaxel responses in women presenting with high-grade serous EOC.

MAD2 downregulation in hypoxia is independent of promoter hypermethylation

Aberrant expression of the MAD2 protein has been linked to chromosomal instability, malignant transformation and chemoresistance. Although reduced MAD2 expression is well recognised in human cancer cell lines, the mechanism(s) underlying its downregulation remain elusive. The objective of this study was to establish the impact of hypoxia on MAD2 expression and to investigate the potential role of aberrant promoter methylation as a possible mechanism of MAD2 downregulation. For this purpose, three ovarian cancer cell lines, displaying differing levels of MAD2, were treated with chromatin modifying drugs, pre and post-hypoxia exposure and a DHPLC analysis of DNA promoter methylation carried out. We show that hypoxia induces downregulation of MAD2 expression, independently of MAD2 promoter methylation. We also show no evidence of MAD2 promoter methylation in breast and prostate cancer cells or in breast cancer clinical material. While our findings provide no evidence for MAD2 promoter methylation, we show a concomitant upregulation of p21 with downregulation of MAD2 in hypoxia. Our in vitro results were also confirmed in an ovarian cancer tissue microarray (TMA), where a reciprocal staining of MAD2 and CAIX was found in 21/60 (35%) of tumours. In summary, MAD2 downregulation may be a crucial mechanism by which hypoxic cells become chemorefractory. This stems from our previous work where we demonstrated that MAD2 downregulation induces cellular senescence, a viable cellular fate, with resultant cellular resistance to paclitaxel. Moreover, MAD2 downregulation could play a central role in the induction of chemoresistance in hypoxia, a key tumour microenvironment associated with chemoresistance.

Model categories for orthogonal calculus

We restate the notion of orthogonal calculus in terms of model categories. This provides a cleaner set of results and makes the role of O(n)-equivariance clearer. Thus we develop model structures for the category of n-polynomial and n-homogeneous functors, along with Quillen pairs relating them. We then classify n-homogeneous functors, via a zig-zag of Quillen equivalences, in terms of spectra with an O(n)-action. This improves upon the classification theorem of Weiss. As an application, we develop a variant of orthogonal calculus by replacing topological spaces with orthogonal spectra.

On the Condition Number Distribution of Complex Wishart Matrices

This paper investigates the distribution of the condition number of complex Wishart matrices. Two closely related measures are considered: the standard condition number (SCN) and the Demmel condition number (DCN), both of which have important applications in the context of multiple-input multipleoutput (MIMO) communication systems, as well as in various branches of mathematics. We first present a novel generic framework for the SCN distribution which accounts for both central and non-central Wishart matrices of arbitrary dimension. This result is a simple unified expression which involves only a single scalar integral, and therefore allows for fast and efficient computation. For the case of dual Wishart matrices, we derive new exact polynomial expressions for both the SCN and DCN distributions. We also formulate a new closed-form expression for the tail SCN distribution which applies for correlated central Wishart matrices of arbitrary dimension and demonstrates an interesting connection to the maximum eigenvalue moments of Wishart matrices of smaller dimension. Based on our analytical results, we gain valuable insights into the statistical behavior of the channel conditioning for various MIMO fading scenarios, such as uncorrelated/semi-correlated Rayleigh fading and Ricean fading. © 2010 IEEE.