779 research outputs found

    A New Model for Void Coalescence by Internal Necking

    Get PDF
    A micromechanical model for predicting the strain increment required to bring a damaged material element from the onset of void coalescence up to final fracture is developed based on simple kinematics arguments. This strain increment controls the unloading slope and the energy dissipated during the final step of material failure. Proper prediction of the final drop of the load carrying capacity is an important ingredient of any ductile fracture model, especially at high stress triaxiality. The model has been motivated and verified by comparison to a large set of finite element void cell calculations.

    Powers of Hamilton cycles in pseudorandom graphs

    Full text link
    We study the appearance of powers of Hamilton cycles in pseudorandom graphs, using the following comparatively weak pseudorandomness notion. A graph GG is (ε,p,k,)(\varepsilon,p,k,\ell)-pseudorandom if for all disjoint XX and YV(G)Y\subset V(G) with Xεpkn|X|\ge\varepsilon p^kn and Yεpn|Y|\ge\varepsilon p^\ell n we have e(X,Y)=(1±ε)pXYe(X,Y)=(1\pm\varepsilon)p|X||Y|. We prove that for all β>0\beta>0 there is an ε>0\varepsilon>0 such that an (ε,p,1,2)(\varepsilon,p,1,2)-pseudorandom graph on nn vertices with minimum degree at least βpn\beta pn contains the square of a Hamilton cycle. In particular, this implies that (n,d,λ)(n,d,\lambda)-graphs with λd5/2n3/2\lambda\ll d^{5/2 }n^{-3/2} contain the square of a Hamilton cycle, and thus a triangle factor if nn is a multiple of 33. This improves on a result of Krivelevich, Sudakov and Szab\'o [Triangle factors in sparse pseudo-random graphs, Combinatorica 24 (2004), no. 3, 403--426]. We also extend our result to higher powers of Hamilton cycles and establish corresponding counting versions.Comment: 30 pages, 1 figur

    On two problems in graph Ramsey theory

    Get PDF
    We study two classical problems in graph Ramsey theory, that of determining the Ramsey number of bounded-degree graphs and that of estimating the induced Ramsey number for a graph with a given number of vertices. The Ramsey number r(H) of a graph H is the least positive integer N such that every two-coloring of the edges of the complete graph KNK_N contains a monochromatic copy of H. A famous result of Chv\'atal, R\"{o}dl, Szemer\'edi and Trotter states that there exists a constant c(\Delta) such that r(H) \leq c(\Delta) n for every graph H with n vertices and maximum degree \Delta. The important open question is to determine the constant c(\Delta). The best results, both due to Graham, R\"{o}dl and Ruci\'nski, state that there are constants c and c' such that 2^{c' \Delta} \leq c(\Delta) \leq 2^{c \Delta \log^2 \Delta}. We improve this upper bound, showing that there is a constant c for which c(\Delta) \leq 2^{c \Delta \log \Delta}. The induced Ramsey number r_{ind}(H) of a graph H is the least positive integer N for which there exists a graph G on N vertices such that every two-coloring of the edges of G contains an induced monochromatic copy of H. Erd\H{o}s conjectured the existence of a constant c such that, for any graph H on n vertices, r_{ind}(H) \leq 2^{c n}. We move a step closer to proving this conjecture, showing that r_{ind} (H) \leq 2^{c n \log n}. This improves upon an earlier result of Kohayakawa, Pr\"{o}mel and R\"{o}dl by a factor of \log n in the exponent.Comment: 18 page

    Non-Compositional Term Dependence for Information Retrieval

    Full text link
    Modelling term dependence in IR aims to identify co-occurring terms that are too heavily dependent on each other to be treated as a bag of words, and to adapt the indexing and ranking accordingly. Dependent terms are predominantly identified using lexical frequency statistics, assuming that (a) if terms co-occur often enough in some corpus, they are semantically dependent; (b) the more often they co-occur, the more semantically dependent they are. This assumption is not always correct: the frequency of co-occurring terms can be separate from the strength of their semantic dependence. E.g. "red tape" might be overall less frequent than "tape measure" in some corpus, but this does not mean that "red"+"tape" are less dependent than "tape"+"measure". This is especially the case for non-compositional phrases, i.e. phrases whose meaning cannot be composed from the individual meanings of their terms (such as the phrase "red tape" meaning bureaucracy). Motivated by this lack of distinction between the frequency and strength of term dependence in IR, we present a principled approach for handling term dependence in queries, using both lexical frequency and semantic evidence. We focus on non-compositional phrases, extending a recent unsupervised model for their detection [21] to IR. Our approach, integrated into ranking using Markov Random Fields [31], yields effectiveness gains over competitive TREC baselines, showing that there is still room for improvement in the very well-studied area of term dependence in IR

    Bir izdivacın tarih-i muaşakası

    Get PDF
    Uşakizade Halit Ziya'nın Hizmet'te tefrika edilen Bir İzdivacın Tarih-i Muaşakası adlı roman

    The descriptive content of names as predicate modifiers

    Get PDF
    In this paper I argue that descriptive content associated with a proper name can serve as a truth-conditionally relevant adjunct and be an additional contribution of the name to the truth-conditions. Definite descriptions the so-and-so associated by speakers with a proper name can be used as qualifying prepositional phrases as so-and-so, so sentences containing a proper name NN is doing something could be understood as NN is doing something as NN (which means as so-and-so). Used as an adjunct, the descriptive content of a proper name expresses the additional circumstances of an action (a manner, reason, goal, time or purpose) and constitute a part of a predicate. I argue that qualifying prepositional phrases should be analyzed as predicate modifiers and propose a formal representation of modified predicates. The additional truth-conditional relevance of the descriptive content of a proper name helps to explain the phenomenon of the substitution failure of coreferential names in simple sentences

    Gramene: a growing plant comparative genomics resource

    Get PDF
    Gramene (www.gramene.org) is a curated resource for genetic, genomic and comparative genomics data for the major crop species, including rice, maize, wheat and many other plant (mainly grass) species. Gramene is an open-source project. All data and software are freely downloadable through the ftp site (ftp.gramene.org/pub/gramene) and available for use without restriction. Gramene's core data types include genome assembly and annotations, other DNA/mRNA sequences, genetic and physical maps/markers, genes, quantitative trait loci (QTLs), proteins, ontologies, literature and comparative mappings. Since our last NAR publication 2 years ago, we have updated these data types to include new datasets and new connections among them. Completely new features include rice pathways for functional annotation of rice genes; genetic diversity data from rice, maize and wheat to show genetic variations among different germplasms; large-scale genome comparisons among Oryza sativa and its wild relatives for evolutionary studies; and the creation of orthologous gene sets and phylogenetic trees among rice, Arabidopsis thaliana, maize, poplar and several animal species (for reference purpose). We have significantly improved the web interface in order to provide a more user-friendly browsing experience, including a dropdown navigation menu system, unified web page for markers, genes, QTLs and proteins, and enhanced quick search functions

    Gramene 2013: comparative plant genomics resources

    Get PDF
    Gramene (http://www.gramene.org) is a curated online resource for comparative functional genomics in crops and model plant species, currently hosting 27 fully and 10 partially sequenced reference genomes in its build number 38. Its strength derives from the application of a phylogenetic framework for genome comparison and the use of ontologies to integrate structural and functional annotation data. Whole-genome alignments complemented by phylogenetic gene family trees help infer syntenic and orthologous relationships. Genetic variation data, sequences and genome mappings available for 10 species, including Arabidopsis, rice and maize, help infer putative variant effects on genes and transcripts. The pathways section also hosts 10 species-specific metabolic pathways databases developed in-house or by our collaborators using Pathway Tools software, which facilitates searches for pathway, reaction and metabolite annotations, and allows analyses of user-defined expression datasets. Recently, we released a Plant Reactome portal featuring 133 curated rice pathways. This portal will be expanded for Arabidopsis, maize and other plant species. We continue to provide genetic and QTL maps and marker datasets developed by crop researchers. The project provides a unique community platform to support scientific research in plant genomics including studies in evolution, genetics, plant breeding, molecular biology, biochemistry and systems biology

    The history of degenerate (bipartite) extremal graph problems

    Full text link
    This paper is a survey on Extremal Graph Theory, primarily focusing on the case when one of the excluded graphs is bipartite. On one hand we give an introduction to this field and also describe many important results, methods, problems, and constructions.Comment: 97 pages, 11 figures, many problems. This is the preliminary version of our survey presented in Erdos 100. In this version 2 only a citation was complete
    corecore