5D gravity and the discrepant G measurements

It is shown that 5D Kaluza-Klein theory stabilized by an external bulk scalar field may solve the discrepant laboratory G measurements. This is achieved by an effective coupling between gravitation and the geomagnetic field. Experimental considerations are also addressed.Comment: 13 pages, to be published in: Proceedings of the 18th Course of the School on Cosmology and Gravitation: The gravitational Constant. Generalized gravitational theories and experiments (30 April-10 May 2003, Erice). Ed. by G. T. Gillies, V. N. Melnikov and V. de Sabbata, (Kluwer), 13pp. (in print) (2003

Modic type 2 changes are fibroinflammatory changes with complement system involvement adjacent to degenerated vertebral endplates

Background Vertebral endplate signal intensity changes visualized by magnetic resonance imaging termed Modic changes (MC) are highly prevalent in low back pain patients. Interconvertibility between the three MC subtypes (MC1, MC2, MC3) suggests different pathological stages. Histologically, granulation tissue, fibrosis, and bone marrow edema are signs of inflammation in MC1 and MC2. However, different inflammatory infiltrates and amount of fatty marrow suggest distinct inflammatory processes in MC2. Aims The aims of this study were to investigate (i) the degree of bony (BEP) and cartilage endplate (CEP) degeneration in MC2, (ii) to identify inflammatory MC2 pathomechanisms, and (iii) to show that these marrow changes correlate with severity of endplate degeneration. Methods Pairs of axial biopsies (n = 58) spanning the entire vertebral body including both CEPs were collected from human cadaveric vertebrae with MC2. From one biopsy, the bone marrow directly adjacent to the CEP was analyzed with mass spectrometry. Differentially expressed proteins (DEPs) between MC2 and control were identified and bioinformatic enrichment analysis was performed. The other biopsy was processed for paraffin histology and BEP/CEP degenerations were scored. Endplate scores were correlated with DEPs. Results Endplates from MC2 were significantly more degenerated. Proteomic analysis revealed an activated complement system, increased expression of extracellular matrix proteins, angiogenic, and neurogenic factors in MC2 marrow. Endplate scores correlated with upregulated complement and neurogenic proteins. Discussion The inflammatory pathomechanisms in MC2 comprises activation of the complement system. Concurrent inflammation, fibrosis, angiogenesis, and neurogenesis indicate that MC2 is a chronic inflammation. Correlation of endplate damage with complement and neurogenic proteins suggest that complement system activation and neoinnervation may be linked to endplate damage. The endplate-near marrow is the pathomechanistic site, because MC2 occur at locations with more endplate degeneration. Conclusion MC2 are fibroinflammatory changes with complement system involvement which occur adjacent to damaged endplates

Proteinortho: Detection of (Co-)orthologs in large-scale analysis

<p>Abstract</p> <p>Background</p> <p>Orthology analysis is an important part of data analysis in many areas of bioinformatics such as comparative genomics and molecular phylogenetics. The ever-increasing flood of sequence data, and hence the rapidly increasing number of genomes that can be compared simultaneously, calls for efficient software tools as brute-force approaches with quadratic memory requirements become infeasible in practise. The rapid pace at which new data become available, furthermore, makes it desirable to compute genome-wide orthology relations for a given dataset rather than relying on relations listed in databases.</p> <p>Results</p> <p>The program <monospace>Proteinortho</monospace> described here is a stand-alone tool that is geared towards large datasets and makes use of distributed computing techniques when run on multi-core hardware. It implements an extended version of the reciprocal best alignment heuristic. We apply <monospace>Proteinortho</monospace> to compute orthologous proteins in the complete set of all 717 eubacterial genomes available at NCBI at the beginning of 2009. We identified thirty proteins present in 99% of all bacterial proteomes.</p> <p>Conclusions</p> <p><monospace>Proteinortho</monospace> significantly reduces the required amount of memory for orthology analysis compared to existing tools, allowing such computations to be performed on off-the-shelf hardware.</p

Minimal arc-sets spanning dicycles

We give a structural characterization of the inclusionwise minimal arc subsets whose vertices induce a subgraph containing at least one directed cycle. These arc sets arise in a linear formulation of a binary quadratic problem

A note on selective line-graphs and partition colorings

We extend a one-to-one correspondence between the set of all colorings of any graph and the set of all stable sets of an auxiliary graph, from graphs to partitioned graphs. This correspondence has an application to Selective Coloring and to Selective Max-Coloring

In vitro characteristics of nicotine microspheres for transnasal delivery

INT. J. PHARM

Mathematical Formulations for the Balanced Vertex k-Separator Problem

International Conference on Control, Decision and Information Technologies (CoDIT), Ecole Natl Ingenieurs Metz, Metz, FRANCE, NOV 03-05, 2014International audienceGiven an indirected graph G = (V, E), a Vertex k-Separator is a subset of the vertex set V such that, when the separator is removed from the graph, the remaining vertices can be partitioned into k subsets that are pairwise edge-disconnected. In this paper we focus on the Balanced Vertex k-Separator Problem, i.e., the problem of finding a minimum cardinality separator such that the sizes of the resulting disconnected subsets are balanced. We present a compact Integer Linear Programming formulation for the problem, and present a polyhedral study of the associated polytope. We also present an Exponential-Size formulation, for which we derive a column generation and a branching scheme. Preliminary computational results are reported comparing the performance of the two formulations on a set of benchmark instances

The vertex k-cut problem

International audienceGiven an undirected graph G=(V, E), a vertex k-cut of G is a vertex subset of the removing of which disconnects the graph in at least components. Given a graph and an integer k≥2, the vertex k-cut problem consists in finding a vertex k-cut of of G minimum cardinality. We first prove that the problem is NP-hard for any fixed k≥3. We then present a compact formulation, and an extended formulation from which we derive a column generation and a branching scheme. Extensive computational results prove the effectiveness of the proposed methods