Influence of static unbalance on rotors with various journal bearing types

This paper was supported by the Technology Agency of the Czech Republic under the THETA Programme within the TK04020057 project

Vibration analysis of a vertical rotor immersed in fluid at extreme operating temperatures

This publication was supported by the project 22-29874S of the Czech Science Foundation. The usage of the AVL Excite software in the framework of the University Partnership Program of AVL List GmbH is greatly acknowledge

Engineering Branch-and-Cut Algorithms for the Equicut Problem

A minimum equicut of an edge-weighted graph is a partition of the nodes of the graph into two sets of equal size such hat the sum of the weights of edges joining nodes in different partitions is minimum. We compare basic linear and semidefnite relaxations for the equicut problem, and and that linear bounds are competitive with the corresponding semidefnite ones but can be computed much faster. Motivated by an application of equicut in theoretical physics, we revisit an approach by Brunetta et al. and present an enhanced branch-and-cut algorithm. Our computational results suggest that the proposed branch-andcut algorithm has a better performance than the algorithm of Brunetta et al.. Further, it is able to solve to optimality in reasonable time several instances with more than 200 nodes from the physics application

Autophagy in the Thymic Epithelium Is Dispensable for the Development of Self-Tolerance in a Novel Mouse Model

The thymic epithelium plays critical roles in the positive and negative selection of T cells. Recently, it was proposed that autophagy in thymic epithelial cells is essential for the induction of T cell tolerance to self antigens and thus for the prevention of autoimmune diseases. Here we have tested this hypothesis using mouse models in which autophagy was blocked specifically in epithelial cells expressing keratin 14 (K14), including the precursor of thymic epithelial cells. While the thymic epithelial cells of mice carrying the floxed Atg7 gene (ATG7 f/f) showed a high level of autophagy, as determined by LC3 Western blot analysis and fluorescence detection of the recombinant green fluorescent protein (GFP)-LC3 reporter protein on autophagosomes, autophagy in the thymic epithelium was efficiently suppressed by deletion of the Atg7 gene using the Cre-loxP system (ATG7 f/f K14-Cre). Suppression of autophagy led to the massive accumulation of p62/sequestosome 1 (SQSTM1) in thymic epithelial cells. However, the structure of the thymic epithelium as well as the organization and the size of the thymus were not altered in mutant mice. The ratio of CD4 to CD8-positive T cells, as well as the frequency of activated (CD69+) CD4 T cells in lymphoid organs, did not differ between mice with autophagy-competent and autophagy-deficient thymic epithelium. Inflammatory infiltrating cells, potentially indicative of autoimmune reactions, were present in the liver, lung, and colon of a similar fraction of ATG7 f/f and ATG7 f/f K14-Cre mice. In contrast to previously reported mice, that had received an autophagy-deficient thymus transplant, ATG7 f/f K14-Cre mice did not suffer from autoimmunity-induced weight loss. In summary, the results of this study suggest that autophagy in the thymic epithelium is dispensable for negative selection of autoreactive T cells

Live imaging of stem cell and progeny behaviour in physiological hair-follicle regeneration

Tissue development and regeneration depend on cell-cell interactions and signals that target stem cells and their immediate progeny. However, the cellular behaviours that lead to a properly regenerated tissue are not well understood. Using a new, non-invasive, intravital two-photon imaging approach we study physiological hair-follicle regeneration over time in live mice. By these means we have monitored the behaviour of epithelial stem cells and their progeny during physiological hair regeneration and addressed how the mesenchyme influences their behaviour. Consistent with earlier studies, stem cells are quiescent during the initial stages of hair regeneration, whereas the progeny are more actively dividing. Moreover, stem cell progeny divisions are spatially organized within follicles. In addition to cell divisions, coordinated cell movements of the progeny allow the rapid expansion of the hair follicle. Finally, we show the requirement of the mesenchyme for hair regeneration through targeted cell ablation and long-term tracking of live hair follicles. Thus, we have established an in vivo approach that has led to the direct observation of cellular mechanisms of growth regulation within the hair follicle and that has enabled us to precisely investigate functional requirements of hair-follicle components during the process of physiological regeneration. © 2012 Macmillan Publishers Limited. All rights reserved

An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming

Semidefinite programming has been used successfully to build hierarchies of convex relaxations to approximate polynomial programs. This approach rapidly becomes computationally expensive and is often tractable only for problems of small sizes. We propose an iterative scheme that improves the semidefinite relaxations without incurring exponential growth in their size. The key ingredient is a dynamic scheme for generating valid polynomial inequalities for general polynomial programs. These valid inequalities are then used to construct better approximations of the original problem. As a result, the proposed scheme is in principle scalable to large general combinatorial optimization problems. For binary polynomial programs, we prove that the proposed scheme converges to the global optimal solution for interesting cases of the initial approximation of the problem. We also present examples illustrating the computational behaviour of the scheme and compare it to other methods in the literature

Alopecia in a Viable Phospholipase C Delta 1 and Phospholipase C Delta 3 Double Mutant

BACKGROUND: Inositol 1,4,5trisphosphate (IP(3)) and diacylglycerol (DAG) are important intracellular signalling molecules in various tissues. They are generated by the phospholipase C family of enzymes, of which phospholipase C delta (PLCD) forms one class. Studies with functional inactivation of Plcd isozyme encoding genes in mice have revealed that loss of both Plcd1 and Plcd3 causes early embryonic death. Inactivation of Plcd1 alone causes loss of hair (alopecia), whereas inactivation of Plcd3 alone has no apparent phenotypic effect. To investigate a possible synergy of Plcd1 and Plcd3 in postnatal mice, novel mutations of these genes compatible with life after birth need to be found. METHODOLOGY/PRINCIPAL FINDINGS: We characterise a novel mouse mutant with a spontaneously arisen mutation in Plcd3 (Plcd3(mNab)) that resulted from the insertion of an intracisternal A particle (IAP) into intron 2 of the Plcd3 gene. This mutation leads to the predominant expression of a truncated PLCD3 protein lacking the N-terminal PH domain. C3H mice that carry one or two mutant Plcd3(mNab) alleles are phenotypically normal. However, the presence of one Plcd3(mNab) allele exacerbates the alopecia caused by the loss of functional Plcd1 in Del(9)olt1Pas mutant mice with respect to the number of hair follicles affected and the body region involved. Mice double homozygous for both the Del(9)olt1Pas and the Plcd3(mNab) mutations survive for several weeks and exhibit total alopecia associated with fragile hair shafts showing altered expression of some structural genes and shortened phases of proliferation in hair follicle matrix cells. CONCLUSIONS/SIGNIFICANCE: The Plcd3(mNab) mutation is a novel hypomorphic mutation of Plcd3. Our investigations suggest that Plcd1 and Plcd3 have synergistic effects on the murine hair follicle in specific regions of the body surface

Exploiting Group Symmetry in Semidefinite Programming Relaxations of the Quadratic Assignment Problem

We consider semidefinite programming relaxations of the quadratic assignment problem, and show how to exploit group symmetry in the problem data. Thus we are able to compute the best known lower bounds for several instances of quadratic assignment problems from the problem library: [R.E. Burkard, S.E. Karisch, F. Rendl. QAPLIB — a quadratic assignment problem library. Journal on Global Optimization, 10: 291–403, 1997]. AMS classification: 90C22, 20Cxx, 70-08