UNIQUENESS OF THE EXTENSION OF 2-HOMOGENEOUS POLYNOMIALS

Homogeneous polynomials of degree 2 on the complex Banach space c(0)(l(n)(2)) are shown to have unique norm-preserving extension to the bidual space. This is done by using M-projections and extends the analogous result for c(0) proved by P.-K. Lin.

XRCC1 haploinsufficiency in mice has little effect on aging, but adversely modifies exposure-dependent susceptibility

Oxidative DNA damage plays a role in disease development and the aging process. A prominent participant in orchestrating the repair of oxidative DNA damage, particularly single-strand breaks, is the scaffold protein XRCC1. A series of chronological and biological aging parameters in XRCC1 heterozygous (HZ) mice were examined. HZ and wild-type (WT) C57BL/6 mice exhibit a similar median lifespan of similar to 26 months and a nearly identical maximal life expectancy of similar to 37 months. However, a number of HZ animals (7 of 92) showed a propensity for abdominal organ rupture, which may stem from developmental abnormalities given the prominent role of XRCC1 in endoderm and mesoderm formation. For other end-points evaluated-weight, fat composition, blood chemistries, condition of major organs, tissues and relevant cell types, behavior, brain volume and function, and chromosome and telomere integrity-HZ mice exhibited by-and-large a normal phenotype. Treatment of animals with the alkylating agent azoxymethane resulted in both liver toxicity and an increased incidence of precancerous lesions in the colon of HZ mice. Our study indicates that XRCC1 haploinsufficiency in mammals has little effect on chronological longevity and many key biological markers of aging in the absence of environmental challenges, but may adversely affect normal animal development or increase disease susceptibility to a relevant genotoxic exposure.

Improved Prediction of Hydrocarbon Flash Points from Boiling Point Data

Flash points (T(FP)) of hydrocarbons are calculated from their flash point numbers, N(FP), with the relationship T(FP) (K) = 23.369N(FP)(2/3) + 20.010N(FP)(1/3) + 31.901 In turn, the N(FP) values can be predicted from experimental boiling point numbers (Y(BP)) and molecular structure with the equation N(FP) = 0.987 Y(BP) + 0.176D + 0.687T + 0.712B - 0.176 where D is the number of olefinic double bonds in the structure, T is the number of triple bonds, and B is the number of aromatic rings. For a data set consisting of 300 diverse hydrocarbons, the average absolute deviation between the literature and predicted flash points was 2.9 K.

Calculating Flash Point Numbers from Molecular Structure: An Improved Method for Predicting the Flash Points of Acyclic Alkanes

We report a novel method for calculating flash points of acyclic alkanes from flash point numbers, N(FP), which can be calculated from experimental or calculated boiling point numbers (Y(BP)) with the equation N(FP) = 1.020Y(BP) - 1.083 Flash points (FP) are then determined from the relationship FP(K) = 23.369N(FP)(2/3) + 20.010N(FP)(1/3) + 31.901 For it data set of 102 linear and branched alkanes, the correlation of literature and predicted flash points has R(2) = 0.985 and an average absolute deviation of 3.38 K. N(FP) values can also be estimated directly from molecular structure to produce an even closer correspondence of literature and predicted FP values. Furthermore, N(FP) values provide a new method to evaluate the reliability of literature flash point data.

Simple Method to Evaluate and to Predict Flash Points of Organic Compounds

Flash points (T(FP)) of organic compounds are calculated from their flash point numbers, N(FP), with the relationship T(FP) = 23.369N(FP)(2/3) + 20.010N(FP)(1/3) + 31.901. In turn, the N(FP) values can be predicted from boiling point numbers (Y(BP)) and functional group counts with the equation N(FP) = 0.974Y(BP) + Sigma(i)n(i)G(i) + 0.095 where G(i) is a functional group-specific contribution to the value of N(FP) and n(i) is the number of such functional groups in the structure. For a data set consisting of 1000 diverse organic compounds, the average absolute deviation between reported and predicted flash points was less than 2.5 K.

Polymorphisms in genes involved in neurodevelopment may be associated with altered brain morphology in schizophrenia: Preliminary evidence

An abnormality in neurodevelopment is one of the most robust etiologic hypotheses in schizophrenia (SZ). There is also strong evidence that genetic factors may influence abnormal neurodevelopment in the disease. The present study evaluated in SZ patients, whose brain structural data had been obtained with magnetic resonance imaging (MRI), the possible association between structural brain measures, and 32 DNA polymorphisms,located in 30 genes related to neurogenesis and brain development. DNA was extracted from peripheral blood cells of 25 patients with schizophrenia, genotyping was performed using diverse procedures, and putative associations were evaluated by standard statistical methods (using the software Statistical Package for Social Sciences - SPSS) with a modified Bonferroni adjustment. For reelin (RELN), a protease that guides neurons in the developing brain and underlies neurotransmission and synaptic plasticity in adults, an association was found for a non-synonymous polymorphism (Va1997Leu) with left and right ventricular enlargement. A putative association was also found between protocadherin 12 (PCDH12), a cell adhesion molecule involved in axonal guidance and synaptic specificity, and cortical folding (asymmetry coefficient of gyrification index). Although our results are preliminary, due to the small number of individuals analyzed, such an approach could reveal new candidate genes implicated in anomalous neurodevelopment in schizophrenia. (c) 2007 Elsevier Ireland Ltd. All rights reserved.

Use Multilevel Graph Partitioning Scheme to solve traveling salesman problem

The traveling salesman problem is although looking very simple problem but it is an important combinatorial problem. In this thesis I have tried to find the shortest distance tour in which each city is visited exactly one time and return to the starting city. I have tried to solve traveling salesman problem using multilevel graph partitioning approach.Although traveling salesman problem itself very difficult as this problem is belong to the NP-Complete problems but I have tried my best to solve this problem using multilevel graph partitioning it also belong to the NP-Complete problems. I have solved this thesis by using the k-mean partitioning algorithm which divides the problem into multiple partitions and solving each partition separately and its solution is used to improve the overall tour by applying Lin Kernighan algorithm on it. Through all this I got optimal solution which proofs that solving traveling salesman problem through graph partition scheme is good for this NP-Problem and through this we can solved this intractable problem within few minutes.Keywords: Graph Partitioning Scheme, Traveling Salesman Problem.