نتایج جستجو برای: finite history

تعداد نتایج: 606534  

2014
Rachid Guerraoui Eric Ruppert

We show that, in contrast to the general belief in the distributed computing community, linearizability, the celebrated consistency property, is not always a safety property. More specifically, we give an object for which it is possible to have an infinite history that is not linearizable, even though every finite prefix of the history is linearizable. The object we consider as a counterexample...

Journal: :JCP 2013
Kuang-Hung Tseng Jie-Meng Huang

Predicting and controlling residual stresses are critical issues in welding engineering. With advancements in computer technology, a numerical simulation technique can predict welding residual stress. To accurately simulate temperature and stress fields, the thermal cycle obtained from the finite element model must be in coincidence with an actual heat source. This study performed a Gaussian di...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه لرستان 1389

the present thesis is a study of postmodern historical novel with respect to the voice of women. according to postmodern historiography,the established institution of history is one of the other manifestations of patriarchys power which has silenced women. the study analyzes angela carters nights at the circus as a postmodern historical novel which makes its female characters transgress the pat...

Journal: :J. Comb. Theory, Ser. A 2011
Zibo Xu

A stochastic extension of Ramsey’s theorem is established. Any Markov chain generates a filtration relative to which one may define a notion of stopping time. A stochastic colouring is any fc-valued (k < oo) colour func­ tion defined on all pairs consisting of a bounded stopping time and a finite partial history of the chain truncated before this stopping time. For any bounded stopping time 6 a...

2004
Yishay Mansour Idan Szpektor

7.1.1 Definitions Definition An extensive game with perfect information 〈N,H, P, Ui〉 has the following components: • A set of N players • A set H of sequences (finite or infinite). Each element of H is a history; each component of a history is an action taken by a player. • P is the player function, P (h) being the player who takes an action after the history h. • Payoff function Ui, i ∈ N Afte...

Journal: :Entropy 2018
Paul Ballonoff

A theory of cultural structures predicts the objects observed by anthropologists. We here define those which use kinship relationships to define systems. A finite structure we call a partially defined quasigroup (or pdq, as stated by Definition 1 below) on a dictionary (called a natural language) allows prediction of certain anthropological descriptions, using homomorphisms of pdqs onto finite ...

2005
Michael Aschbacher Stephen D. Smith

In 1983, Danny Gorenstein announced the completion of the Classification of the Finite Simple Groups. This announcement was somewhat premature. The Classification of the Finite Simple Groups was at last completed with the publication in 2004 of the two monographs under review here. These volumes, classifying the quasithin finite simple groups of even characteristic, are a major milestone in the...

2004
Yishay Mansour Idan Szpektor

7.1.1 Definitions Definition An extensive game with perfect information 〈N,H, P, Ui〉 has the following components: • A set of N players • A set H of sequences (finite or infinite). each member of H is a history; each component of a history ia an action taken by a player. • P is the player function, P (h) being the player who takes an action after the history h. • Payoff function Ui, i ∈ N After...

2014
Sílvia Serrano-Fochs Soledad De Esteban-Trivigno Jordi Marcé-Nogué Josep Fortuny Richard A. Fariña

Finite element analyses (FEA) were applied to assess the lower jaw biomechanics of cingulate xenarthrans: 14 species of armadillos as well as one Pleistocene pampathere (11 extant taxa and the extinct forms Vassallia, Eutatus and Macroeuphractus). The principal goal of this work is to comparatively assess the biomechanical capabilities of the mandible based on FEA and to relate the obtained str...

Journal: :Inf. Process. Lett. 2005
Sibylle B. Fröschle

In 2000 Jurdziński and Nielsen proved that hereditary history preserving bisimilarity (hhp-b) is undecidable for finite systems [7,8], and thereby resolved a long-standing open problem. The negative outcome contrasts the weaker history preserving bisimilarity (hp-b), for which decidability is well-established [15,6]. A definition of (h)hp-b on labelled 1-safe Petri nets (net systems) follows.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید