3 research outputs found
EXPERIENTIAL MEANING BREADTH AND GRAMMATICAL COMPLEXITY REALIZATION VARIATIONS OF W. SHAKESPEARE’S KING LEAR AND J. CROWTHER’S KING LEAR
No full textThis research is aimed to analyze experiential meaning breadth and
grammatical complexity realization variations of W. Shakespeare’s King Lear and J.
Crowther’s King Lear. This research tries to answer three questions. The first is how
the experiential meaning breadth and grammatical complexity realization variations are
represented in W. Shakespeare’s King Lear and its translation J. Crowther’s King Lear.
The second is what contextual factors motivate the occurrence of the experiential
meaning breadth and grammatical complexity realization variations in question. The
third is what contextual effects resulted from the experiential meaning breadth and
grammatical complexity realization variations in translation context.
This research applied the descriptive qualitative method with the quantitative
data to strengthen the findings. In conducting this research, the data were analyzed
through some steps: reading the ST and the TT of the data, writing all clauses from
both SE and TE in the data sheet, classifying and analyzing the data using experiential
meaning breadth and grammatical complexity realization variation analysis based on
the given parameter, and recapping the data on a table, describing the data in the table
into words, analyzing field, tenor and mode of the texts to find out the motivating
factors, and analyzing the motivating factors to find out the textual and contextual
effects on the texts.
The findings show that the average number of experiential meaning breadth
variation which is placed in level “2” or “low” level and it is shown by the number of
12.18. Meanwhile, the average number of grammatical complexity realization variation
is placed in level “1” or “very low” level and it is shown by the number of 9. Those
low and very low variations show that the translation has achieved a high level of
equivalence in meaning and realization variations, or this translation is translationally
appropriate. Those variations are motivated by many factors. First, the intra-textual
contexts, they are diction, contracted and archaic words, different spelling words,
omission, grammatical principles, and paraphrase. Second, there are also many inter-
textual motivating factors, i.e. inter-related text and situation value (field, tenor, and
mode). Finally, the contextual effects which are caused by motivating factors are the
readability effects towards the target readers of the two texts, in which the target text
follows the grammatical rule of the present time and the purpose of creating the texts
which is to entertain
Matching random colored points with rectangles
No full textThe version of record of this article, first published in Journal of Combinatorial Optimization, is available online at Publisher’s website: http://dx.doi.org/10.1007/s10878-023-01010-zGiven n > 0, let S ¿ [0,1]2 be a set of n points, chosen uniformly at random. Let R¿B be a random partition, or coloring, of S in which each point of S is included in R uniformly at random with probability 1/2. We study the random variable M(n) equal to the number of points of S that are covered by the rectangles of a maximum strong matching of S with axis-aligned rectangles. The matching consists of closed axis-aligned rectangles that cover exactly two points of S of the same color, and is strong in the sense that all of its rectangles are pairwise disjoint. We prove that almost surely M(n) = 0.83n for n large enough. Our approach is based on modeling a deterministic greedy matching algorithm that runs over the random point set as a Markov chain.Author Corujo was supported by grants from the Université Paris-Dauphine (France) and the ITI IRMIA++. Author Flores-Peñaloza was supported by project PAPIIT IN120520 (UNAM, Mexico). Author Huemer was supported by projects PID2019-104129GB-I00/ MCIN/ AEI/ 10.13039/501100011033 and Gen. Cat. DGR 2021-SGR-00266. Author Pérez-Lantero was supported by projects CONICYT FONDECYT/Regular 1160543 (Chile), DICYT 041933PL Vicerrectoría de Investigación, Desarrollo e Innovación USACH (Chile), and Programa Regional STICAMSUD 19-STIC-02. Author Seara was supported by project PID2019-104129GB-I00/ MCIN/ AEI/ 10.13039/ 501100011033 and Gen. Cat. DGR 2021-SGR-00266.Postprint (author's final draft
Uniform in time propagation of chaos for a Moran model
No full textThe goal of this article is to study the limit of the empirical distribution
induced by a mutation-selection multi-allelic Moran model, whose dynamic is
given by a continuous-time irreducible Markov chain. The rate matrix driving
the mutation is assumed irreducible and the selection rates are assumed
uniformly bounded. The paper is divided into two parts. The first one deals
with processes with general selection rates. For this case we are able to prove
the propagation of chaos in over the compacts, with speed of
convergence of order . Further on, we consider a specific type of
selection that we call additive selection. Essentially, we assume that the
selection rate can be decomposed as the sum of three terms: a term depending on
the allelic type of the parent (which can be understood as selection at death),
another term depending on the allelic type of the descendant (which can be
understood as selection at birth) and a third term which is symmetric. Under
this setting, our results include a uniform in time bound for the propagation
on chaos in of order , and the proof of the
asymptotic normality with zero mean and explicit variance, for the
approximation error between the empirical distribution and its limit, when the
number of individuals tend towards infinity. Additionally, we explore the
interpretation of the Moran model with additive selection as a particle process
whose empirical distribution approximates a quasi-stationary distribution, in
the same spirit as the Fleming\,--\,Viot particle systems. We then address the
problem of minimising the asymptotic quadratic error, when the time and the
number of particles go to infinity.Comment: 26 page
