scholarly journals On a probabilistic model for martensitic avalanches incorporating mechanical compatibility

Nonlinearity ◽  
2021 ◽  
Vol 34 (7) ◽  
pp. 4844-4896
Author(s):  
Francesco Della Porta ◽  
Angkana Rüland ◽  
Jamie M Taylor ◽  
Christian Zillinger
2002 ◽  
Author(s):  
Vassilij Karassev ◽  
Andrey Roukine ◽  
E.D. Dmitrievich Solojentsev

Author(s):  
Ryan Cotterell ◽  
Hinrich Schütze

Much like sentences are composed of words, words themselves are composed of smaller units. For example, the English word questionably can be analyzed as question+ able+ ly. However, this structural decomposition of the word does not directly give us a semantic representation of the word’s meaning. Since morphology obeys the principle of compositionality, the semantics of the word can be systematically derived from the meaning of its parts. In this work, we propose a novel probabilistic model of word formation that captures both the analysis of a word w into its constituent segments and the synthesis of the meaning of w from the meanings of those segments. Our model jointly learns to segment words into morphemes and compose distributional semantic vectors of those morphemes. We experiment with the model on English CELEX data and German DErivBase (Zeller et al., 2013) data. We show that jointly modeling semantics increases both segmentation accuracy and morpheme F1 by between 3% and 5%. Additionally, we investigate different models of vector composition, showing that recurrent neural networks yield an improvement over simple additive models. Finally, we study the degree to which the representations correspond to a linguist’s notion of morphological productivity.


2021 ◽  
Vol 7 (1) ◽  
Author(s):  
Carlo Sanna

AbstractFor every positive integer n and for every $$\alpha \in [0, 1]$$ α ∈ [ 0 , 1 ] , let $${\mathcal {B}}(n, \alpha )$$ B ( n , α ) denote the probabilistic model in which a random set $${\mathcal {A}} \subseteq \{1, \ldots , n\}$$ A ⊆ { 1 , … , n } is constructed by picking independently each element of $$\{1, \ldots , n\}$$ { 1 , … , n } with probability $$\alpha $$ α . Cilleruelo, Rué, Šarka, and Zumalacárregui proved an almost sure asymptotic formula for the logarithm of the least common multiple of the elements of $${\mathcal {A}}$$ A .Let q be an indeterminate and let $$[k]_q := 1 + q + q^2 + \cdots + q^{k-1} \in {\mathbb {Z}}[q]$$ [ k ] q : = 1 + q + q 2 + ⋯ + q k - 1 ∈ Z [ q ] be the q-analog of the positive integer k. We determine the expected value and the variance of $$X := \deg {\text {lcm}}\!\big ([{\mathcal {A}}]_q\big )$$ X : = deg lcm ( [ A ] q ) , where $$[{\mathcal {A}}]_q := \big \{[k]_q : k \in {\mathcal {A}}\big \}$$ [ A ] q : = { [ k ] q : k ∈ A } . Then we prove an almost sure asymptotic formula for X, which is a q-analog of the result of Cilleruelo et al.


Sign in / Sign up

Export Citation Format

Share Document