981 resultados para Latin (Langue)
Resumo:
The functional source coding problem in which the receiver side information (Has-set) and demands (Want-set) include functions of source messages is studied using row-Latin rectangle. The source transmits encoded messages, called the functional source code, in order to satisfy the receiver's demands. We obtain a minimum length using the row-Latin rectangle. Next, we consider the case of transmission errors and provide a necessary and sufficient condition that a functional source code must satisfy so that the receiver can correctly decode the values of the functions in its Want-set.
Resumo:
The paper proposes Latin hypercube sampling combined with the stratified sampling of variance reduction technique to calculate accurate fracture probability. In the compound sampling, the number of simulations is relatively small and the calculation error is satisfactory.
Resumo:
In this paper, we seek to examine the effect of comparisons and social capital on subjective well-being. Furthermore, we test if, through social influence and exposure, social capital is either an enhancer or appeaser of the comparison effect. Using the Latinobarómetro Survey (2007) we find that in contrast to most previous studies, the comparison effect on well-being is positive; that is, the better others perform, the happier the individual is. We also find that social capital is among the strongest correlates of individuals’ subjective well-being in Latin American countries. Furthermore, our findings suggest that social contacts may enhance the comparison effect on individual’s happiness, which is more intense for those who perform worse in their reference group.
Resumo:
[EN] Progress in methodology in specific fields is usually very closely linked to the technological progress in other areas of knowledge. This justifies the fact that lexicographical techniques have had to wait for the arrival of the IT era of the last decades of the 20th century in order to be able to create specialised electronic dictionaries which can house and systemise enormous amounts of information which can later be dealt with quickly and efficiently. This study proposes a practical-methodological model which aims to solve the grammatical treatment of adverbs in Ancient Latin. We have suggested a list of 5 types, in a decreasing order from a greater to lesser degree of specialisation; technical (T), semi-technical (S-T), instrumental-valued (I-V), instrumental- descriptive (I-D), instrumental-expository (I-E).
Resumo:
Compõe-se de trechos selecionados da obra de Sêneca e traz uma pequena biografia do filósofo, além de partes das cento e vinte quatro "epístolas" dirigidas a seu amigo Lucílio. Constituem, na realidade, ensaios morais sobre vários aspectos da vida. Foi editado pelo célebre impressor francês Critóvão Plantin (ou Plantino), radicado na Bélgica, que notabilizou-se pela preciosidade de seu trabalho tipográfico, o que lhe valeu o título de "Grande Impressor", atribuído por Filipe II, rei da Espanha (Filipe I de Portugal).
Resumo:
Contém os empreendimentos, as navegações e os gestos memoráveis dos portugueses, inclusive em suas colônias.
Resumo:
Ed. by Xabier Artiagoitia, Patxi Goenaga & Joseba A. Lakarra.
Resumo:
Published in 2008.
Resumo:
A classical question in combinatorics is the following: given a partial Latin square $P$, when can we complete $P$ to a Latin square $L$? In this paper, we investigate the class of textbf{$epsilon$-dense partial Latin squares}: partial Latin squares in which each symbol, row, and column contains no more than $epsilon n$-many nonblank cells. Based on a conjecture of Nash-Williams, Daykin and H"aggkvist conjectured that all $frac{1}{4}$-dense partial Latin squares are completable. In this paper, we will discuss the proof methods and results used in previous attempts to resolve this conjecture, introduce a novel technique derived from a paper by Jacobson and Matthews on generating random Latin squares, and use this novel technique to study $ epsilon$-dense partial Latin squares that contain no more than $delta n^2$ filled cells in total.
In Chapter 2, we construct completions for all $ epsilon$-dense partial Latin squares containing no more than $delta n^2$ filled cells in total, given that $epsilon < frac{1}{12}, delta < frac{ left(1-12epsilonright)^{2}}{10409}$. In particular, we show that all $9.8 cdot 10^{-5}$-dense partial Latin squares are completable. In Chapter 4, we augment these results by roughly a factor of two using some probabilistic techniques. These results improve prior work by Gustavsson, which required $epsilon = delta leq 10^{-7}$, as well as Chetwynd and H"aggkvist, which required $epsilon = delta = 10^{-5}$, $n$ even and greater than $10^7$.
If we omit the probabilistic techniques noted above, we further show that such completions can always be found in polynomial time. This contrasts a result of Colbourn, which states that completing arbitrary partial Latin squares is an NP-complete task. In Chapter 3, we strengthen Colbourn's result to the claim that completing an arbitrary $left(frac{1}{2} + epsilonright)$-dense partial Latin square is NP-complete, for any $epsilon > 0$.
Colbourn's result hinges heavily on a connection between triangulations of tripartite graphs and Latin squares. Motivated by this, we use our results on Latin squares to prove that any tripartite graph $G = (V_1, V_2, V_3)$ such that begin{itemize} item $|V_1| = |V_2| = |V_3| = n$, item For every vertex $v in V_i$, $deg_+(v) = deg_-(v) geq (1- epsilon)n,$ and item $|E(G)| > (1 - delta)cdot 3n^2$ end{itemize} admits a triangulation, if $epsilon < frac{1}{132}$, $delta < frac{(1 -132epsilon)^2 }{83272}$. In particular, this holds when $epsilon = delta=1.197 cdot 10^{-5}$.
This strengthens results of Gustavsson, which requires $epsilon = delta = 10^{-7}$.
In an unrelated vein, Chapter 6 explores the class of textbf{quasirandom graphs}, a notion first introduced by Chung, Graham and Wilson cite{chung1989quasi} in 1989. Roughly speaking, a sequence of graphs is called "quasirandom"' if it has a number of properties possessed by the random graph, all of which turn out to be equivalent. In this chapter, we study possible extensions of these results to random $k$-edge colorings, and create an analogue of Chung, Graham and Wilson's result for such colorings.
Resumo:
27 p.
Resumo:
[EN] In this article we explain the etymology of the surnames of Basque origin that some presidents of Latin American countries have or have had in the past. These family names were created in the language called Euskara, in the Basque Country (Europe), and then, when some of the people who bore them emigrated to America, they brought their surnames with them. Most of the family names studied here are either oiconymic or toponymic, but it must be kept in mind that the oiconymic ones are, very often, based on house-nicknames, that is, they are anthroponymic in the first place. As far as possible, we have related the surname, when its origin is oiconymic or toponymic, to its source, i.e. to the house or place where it was created.