987 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

    Evaluational adjectives

    Get PDF
    This paper demarcates a theoretically interesting class of "evaluational adjectives." This class includes predicates expressing various kinds of normative and epistemic evaluation, such as predicates of personal taste, aesthetic adjectives, moral adjectives, and epistemic adjectives, among others. Evaluational adjectives are distinguished, empirically, in exhibiting phenomena such as discourse-oriented use, felicitous embedding under the attitude verb `find', and sorites-susceptibility in the comparative form. A unified degree-based semantics is developed: What distinguishes evaluational adjectives, semantically, is that they denote context-dependent measure functions ("evaluational perspectives")—context-dependent mappings to degrees of taste, beauty, probability, etc., depending on the adjective. This perspective-sensitivity characterizing the class of evaluational adjectives cannot be assimilated to vagueness, sensitivity to an experiencer argument, or multidimensionality; and it cannot be demarcated in terms of pretheoretic notions of subjectivity, common in the literature. I propose that certain diagnostics for "subjective" expressions be analyzed instead in terms of a precisely specified kind of discourse-oriented use of context-sensitive language. I close by applying the account to `find x PRED' ascriptions

    The Self-Administered Witness Interview Tool (SAW-IT): Enhancing witness recall of workplace incidents

    Get PDF
    Given the often crucial role of witness evidence in Occupational Health and Safety investigation, statements should be obtained as soon as possible after an incident using best practice methods. The present research systematically tested the efficacy of a novel Self-Administered Witness Interview Tool (SAW-IT); an adapted version of the Self-Administered Interview (SAI©) designed to elicit comprehensive information from witnesses to industrial events. The present study also examined whether completing the SAW-IT mitigated the effect of schematic processing on witness recall. Results indicate that the SAW-IT elicited significantly more correct details, as well as more precise information than a traditional incident report form. Neither the traditional report from, nor the SAW-IT mitigated against biasing effects of contextual information about a worker’s safety history, confirming that witnesses should be shielded from extraneous post-event information prior to reporting. Importantly, these results demonstrate that the SAW-IT can enhance the quality of witness reports

    Changing a semantics: opportunism or courage?

    Full text link
    The generalized models for higher-order logics introduced by Leon Henkin, and their multiple offspring over the years, have become a standard tool in many areas of logic. Even so, discussion has persisted about their technical status, and perhaps even their conceptual legitimacy. This paper gives a systematic view of generalized model techniques, discusses what they mean in mathematical and philosophical terms, and presents a few technical themes and results about their role in algebraic representation, calibrating provability, lowering complexity, understanding fixed-point logics, and achieving set-theoretic absoluteness. We also show how thinking about Henkin's approach to semantics of logical systems in this generality can yield new results, dispelling the impression of adhocness. This paper is dedicated to Leon Henkin, a deep logician who has changed the way we all work, while also being an always open, modest, and encouraging colleague and friend.Comment: 27 pages. To appear in: The life and work of Leon Henkin: Essays on his contributions (Studies in Universal Logic) eds: Manzano, M., Sain, I. and Alonso, E., 201

    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

    Relevance of mytilid shell microtopographies for fouling defence - a global comparison

    Get PDF
    Prevention of epibiosis is of vital importance for most aquatic organisms, which can have consequences for their ability to invade new areas. Surface microtopography of the shell periostracum has been shown to have antifouling properties for mytilid mussels, and the topography shows regional differences. This article examines whether an optimal shell design exists and evaluates the degree to which shell microstructure is matched with the properties of the local fouling community. Biomimics of four mytilid species from different regional provenances were exposed at eight different sites in both northern and southern hemispheres. Tendencies of the microtopography to both inhibit and facilitate fouling were detected after 3 and 6 weeks of immersion. However, on a global scale, all microtopographies failed to prevent fouling in a consistent manner when exposed to various fouling communities and when decoupled from other shell properties. It is therefore suggested that the recently discovered chemical anti-microfouling properties of the periostracum complement the anti-macrofouling defence offered by shell microtopography
    corecore