Simulation of a finishing operation : milling of a turbine blade and influence of damping

Milling is used to create very complex geometries and thin parts, such as turbine blades. Irreversible geometric defects may appear during finishing operations when a high surface quality is expected. Relative vibrations between the tool and the workpiece must be as small as possible, while tool/workpiece interactions can be highly non-linear. A general virtual machining approach is presented and illustrated. It takes into account the relative motion and vibrations of the tool and the workpiece. Both deformations of the tool and the workpiece are taken into account. This allows predictive simulations in the time domain. As an example the effect of damping on the behavior during machining of one of the 56 blades of a turbine disk is analysed in order to illustrate the approach potential

K 4-free subgraphs of random graphs revisited

In Combinatorica 17(2), 1997, Kohayakawa, Łuczak and Rödl state a conjecture which has several implications for random graphs. If the conjecture is true, then, for example, an application of a version of Szemerédi's regularity lemma for sparse graphs yields an estimation of the maximal number of edges in an H-free subgraph of a random graph G n, p . In fact, the conjecture may be seen as a probabilistic embedding lemma for partitions guaranteed by a version of Szemerédi's regularity lemma for sparse graphs. In this paper we verify the conjecture for H = K 4, thereby providing a conceptually simple proof for the main result in the paper cited abov

Steiner trees for hereditary graph classes.

We consider the classical problems (Edge) Steiner Tree and Vertex Steiner Tree after restricting the input to some class of graphs characterized by a small set of forbidden induced subgraphs. We show a dichotomy for the former problem restricted to (H1,H2) -free graphs and a dichotomy for the latter problem restricted to H-free graphs. We find that there exists an infinite family of graphs H such that Vertex Steiner Tree is polynomial-time solvable for H-free graphs, whereas there exist only two graphs H for which this holds for Edge Steiner Tree. We also find that Edge Steiner Tree is polynomial-time solvable for (H1,H2) -free graphs if and only if the treewidth of the class of (H1,H2) -free graphs is bounded (subject to P≠NP ). To obtain the latter result, we determine all pairs (H1,H2) for which the class of (H1,H2) -free graphs has bounded treewidth

The expanding functional roles and signaling mechanisms of adhesion G protein–coupled receptors

The adhesion class of G protein–coupled receptors (GPCRs) is the second largest family of GPCRs (33 members in humans). Adhesion GPCRs (aGPCRs) are defined by a large extracellular N‐terminal region that is linked to a C‐terminal seven transmembrane (7TM) domain via a GPCR‐autoproteolysis inducing (GAIN) domain containing a GPCR proteolytic site (GPS). Most aGPCRs undergo autoproteolysis at the GPS motif, but the cleaved fragments stay closely associated, with the N‐terminal fragment (NTF) bound to the 7TM of the C‐terminal fragment (CTF). The NTFs of most aGPCRs contain domains known to be involved in cell–cell adhesion, while the CTFs are involved in classical G protein signaling, as well as other intracellular signaling. In this workshop report, we review the most recent findings on the biology, signaling mechanisms, and physiological functions of aGPCRs

Conservatism and adaptability during squirrel radiation : what is mandible shape telling us?

SYNTHESYS Project from the European Community Research Infrastructure (NL-TAF-4084)Both functional adaptation and phylogeny shape the morphology of taxa within clades. Herein we explore these two factors in an integrated way by analyzing shape and size variation in the mandible of extant squirrels using landmark-based geometric morphometrics in combination with a comparative phylogenetic analysis. Dietary specialization and locomotion were found to be reliable predictors of mandible shape, with the prediction by locomotion probably reflecting the underlying diet. In addition a weak but significant allometric effect could be demonstrated. Our results found a strong phylogenetic signal in the family as a whole as well as in the main clades, which is in agreement with the general notion of squirrels being a conservative group. This fact does not preclude functional explanations for mandible shape, but rather indicates that ancient adaptations kept a prominent role, with most genera having diverged little from their ancestral clade morphologies. Nevertheless, certain groups have evolved conspicuous adaptations that allow them to specialize on unique dietary resources. Such adaptations mostly occurred in the Callosciurinae and probably reflect their radiation into the numerous ecological niches of the tropical and subtropical forests of Southeastern Asia. Our dietary reconstruction for the oldest known fossil squirrels (Eocene, 36 million years ago) show a specialization on nuts and seeds, implying that the development from protrogomorphous to sciuromorphous skulls was not necessarily related to a change in diet

Probabilistically Checkable Proofs and their Consequences for Approximation Algorithms

The aim of this paper is to present a self-contained proof of the spectacular recent achievement that NP = PCP(log n; 1). We include, as consequences, results concerning non-approximability of the clique number, as well as of the chromatic number of graphs, and of MAX-SNP hard problems

Large-scale cultivation of Caenorhabditis elegans in a bioreactor using a labor-friendly fed-batch approach.

Caenorhabditis elegans is an invertebrate model organism used in many areas of biology including developmental biology and the identification of molecular mechanisms and pathways. However, several experimental approaches require large quantities of worms, which is limiting and time-consuming. We present a protocol that uses modern fermentation methodology to effectively produce large numbers of C. elegans using a 7-l bioreactor in a fed-batch cultivation procedure. The production is modular and flexible as well as being a self-controlled system, thus not much labor is required until harvesting C. elegans. The high-yield worm cultivation is flexible and simple to amend, and now allows for the extended application of C. elegans as a model organism and expression system, including large-scale protein production

Steiner trees in uniformly quasi-bipartite graphs

The area of approximation algorithms for the Steiner tree problem in graphs has seen continuous progress over the last years. Currently the best approximation algorithm has a performance ratio of 1.550. This is still far away from 1.0074, the largest known lower bound on the achievable performance ratio. As all instances resulting from known lower bound reductions are uniformly quasi-bipartite, it is interesting whether this special case can be approximated better than the general case. We present an approximation algorithm with performance ratio 73/60 < 1.217 for the uniformly quasi-bipartite case. This improves on the previously known ratio of 1.279 of Robins and Zelikovsky. We use a new method of analysis that combines ideas from the greedy algorithm for set cover with a matroid-style exchange argument to model the connectivity constraint. As a consequence, we are able to provide a tight instance

Independent Deuber sets in graphs on the natural numbers

We show that for any k, m, p, c, if G is a Kk-free graph on N then there is an independent set of vertices in G that contains an (m, p, c)-set. Hence if G is a Kk-free graph on N, then one can solve any partition regular system of equations in an independent set. This is a common generalization of partition regularity theorems of Rado (who characterized systems of linear equations Ax = 0 a solution of which can be found monochromatic under any finite coloring of N) and Deuber (who provided another characterization in terms of (m, p, c)-sets and a partition theorem for them), and of Ramsey’s theorem itself