Search results for "Paris"

smatr 3 - an R package for estimation and inference about allometric lines

2011

Summary 1. The Standardised Major Axis Tests and Routines (SMATR) software provides tools for estimation and inference about allometric lines, currently widely used in ecology and evolution. 2. This paper describes some significant improvements to the functionality of the package, now available on R in smatr version 3. 3. New inclusions in the package include sma and ma functions that accept formula input and perform the key inference tasks; multiple comparisons; graphical methods for visualising data and checking (S)MA assumptions; robust (S)MA estimation and inference tools.

Early prediction of reading trajectories of children with and without reading instruction in kindergarten : a comparison study of Estonia and Finland

2019

Background: The present study examined differences in the prediction of reading development and reading difficulties in Estonia (n = 348) and Finland (n = 344). These neighbouring countries share many similarities in terms of their language, orthography and educational system; however, they differ in the timing of the onset of reading instruction, which is kindergarten in Estonia and Grade 1 in Finland. Methods: Children's skills were assessed three times – fall and spring in Grade 1 and spring in Grade 2. Results: The results showed that school‐entry rapid automatised naming and reading fluency predicted the development of fluency in Grade 2, but reading fluency was a stronger predictor in…

The development of national and European identity among children living in Italy: A cross-cultural comparison

2008

Empirical model evaluation and hypothesis testing

2016

Chapter 5 deals with the empirical model evaluation and the testing of hypotheses. It starts out with the evaluation of the measurement and the structural models, using the PLS algorithm. After the evaluation of the complete model, moderating effects are examined by conducting group comparisons (section 5.4.1) and by investigating interaction effects (5.4.2). After that, selected constructs are further examined by exploratory data analysis (section 5.5).

EXPO LISBOA 98

2007

Si tratta di un testo in due lingue, italiano e francese, che mette a confronto due esperienze didattiche, svolte a Palermo e a Paris-Malaquais, sul sito dell'Expo di Lisbona del 1998. Sono due tipi di lavoro abbastanza diversi, quello palermitano di carattere soprattutto "compositivo" per studenti di 3° anno, quello parigino di carattere più "progettuale" per studenti di 5° anno. Le motivazioni, le metodologie e i risultati sono illustrate nei saggi dei due docenti e della direttrice della Scuola di Parigi, e assumono naturalmente un carattere di metodo e teorico.

Por Francia y por Alemania : (crónicas de la Exposición)

Data presa del Palau, XII, 212425

L'Exposition de Paris de 1900.

Il potere dell’architettura. L’ideologia di regime all’Esposizione Internazionale di Parigi 1937

2014

The political crackdown during the 20th Century finds in the International Events a special place for the hosting Countries to spread their ideologies to the visitors and to all the other Countries attending the event. National Pavilions become the subject of propaganda, and their architectural language became an important part of the collective identity’s reclaimed logic, even if it wasn’t always real. Paris International Exposition of 1937 is a paradigmatic case: it’s a mirror of that time and of the prewar period’s international tensions. Born under the auspices of peace, it finally results the most relevant expression of the relation between Power and Architecture.

Finding k -dissimilar paths with minimum collective length

2018

Shortest path computation is a fundamental problem in road networks. However, in many real-world scenarios, determining solely the shortest path is not enough. In this paper, we study the problem of finding k-Dissimilar Paths with Minimum Collective Length (kDPwML), which aims at computing a set of paths from a source s to a target t such that all paths are pairwise dissimilar by at least \theta and the sum of the path lengths is minimal. We introduce an exact algorithm for the kDPwML problem, which iterates over all possible s-t paths while employing two pruning techniques to reduce the prohibitively expensive computational cost. To achieve scalability, we also define the much smaller set …

Anti-powers in infinite words

2018

In combinatorics of words, a concatenation of $k$ consecutive equal blocks is called a power of order $k$. In this paper we take a different point of view and define an anti-power of order $k$ as a concatenation of $k$ consecutive pairwise distinct blocks of the same length. As a main result, we show that every infinite word contains powers of any order or anti-powers of any order. That is, the existence of powers or anti-powers is an unavoidable regularity. Indeed, we prove a stronger result, which relates the density of anti-powers to the existence of a factor that occurs with arbitrary exponent. As a consequence, we show that in every aperiodic uniformly recurrent word, anti-powers of ev…