Search results for "RUN"
showing 10 items of 2820 documents
Pareto or log-normal? Best fit and truncation in the distribution of all cities
2015
In the literature, the distribution of city size is a controversial issue with two common contenders: the Pareto and the log-normal. While the first is most accredited when the distribution is truncated above a certain threshold, the latter is usually considered a better representation for the untruncated distribution of all cities. In this paper, we reassess the empirical evidence on the best-fitting distribution in relation to the truncation point issue. Specifically, we provide a comparison among four recently proposed approaches and alternative definitions of U.S. cities. Our results highlight the importance to look at issue of the best-fitting distribution together with the truncation …
Institutions, crises, and political confidence in seven contemporary democracies. An elite-mass analysis
2017
There is ample consensus in the literature that institutional confidence by the public is needed in democracies and at the same time elites, particularly political elites, need to share this confidence in their guidance of state institutions, if political stability in established democracies and the consolidation of new democracies are desired. The research takes the form of a quantitative analysis based on the World Values Surveys and the elite surveys (parliamentarians) conducted in 2006 (before the financial crisis) and in 2012–2013 (post the crisis when apparently, the worst of the economic crunch had lessened up) in the 7 countries selected. We explore what lies at the base of politica…
Teaching and learning in consumer behavior: a class activity supporting real decision-making in cultural management
2010
Abstract Problem-based learning has been suggested as a useful tool to foster student-centered learning and increase student motivation. Students of Business Administration are not familiar with Research on Consumer Behavior, its contents and techniques, since this subject is traditionally linked to Psychology. In order to facilitate the teaching-learning process in this subject, this paper presents an application of problem-based learning in the context of Consumer Behavior. Results of this pilot experience are assessed under a qualitative and a quantitative basis. The evidence obtained allow us to conclude that this collaboration project enable students to obtain and to process informatio…
Fast Matrix Multiplication
2015
Until a few years ago, the fastest known matrix multiplication algorithm, due to Coppersmith and Winograd (1990), ran in time O(n2.3755). Recently, a surge of activity by Stothers, Vassilevska-Williams, and Le~Gall has led to an improved algorithm running in time O(n2.3729). These algorithms are obtained by analyzing higher and higher tensor powers of a certain identity of Coppersmith and Winograd. We show that this exact approach cannot result in an algorithm with running time O(n2.3725), and identify a wide class of variants of this approach which cannot result in an algorithm with running time $O(n^{2.3078}); in particular, this approach cannot prove the conjecture that for every e > 0, …
Maximal Closed Substrings
2022
A string is closed if it has length 1 or has a nonempty border without internal occurrences. In this paper we introduce the definition of a maximal closed substring (MCS), which is an occurrence of a closed substring that cannot be extended to the left nor to the right into a longer closed substring. MCSs with exponent at least 2 are commonly called runs; those with exponent smaller than 2, instead, are particular cases of maximal gapped repeats. We show that a string of length n contains O(n1.5) MCSs. We also provide an output-sensitive algorithm that, given a string of length n over a constant-size alphabet, locates all m MCSs the string contains in O(nlog n+ m) time.
Genome-wide detection of signatures of selection in three Valdostana cattle populations
2020
International audience; The Valdostana is a local dual purpose cattle breed developed in Italy. Three populations are recognized within this breed, based on coat colour, production level, morphology and temperament: Valdostana Red Pied (VPR), Valdostana Black Pied (VPN) and Valdostana Chestnut (VCA). Here, we investigated putative genomic regions under selection among these three populations using the Bovine 50K SNP array by combining three different statistical methods based either on allele frequencies (F-ST) or extended haplotype homozygosity (iHS and Rsb). In total, 8, 5 and 8 chromosomes harbouring 13, 13 and 16 genomic regions potentially under selection were identified by at least tw…
Therapeutic metaphors and personal meanings in group poetry therapy for people with schizophrenia
2021
This article concerns the therapeutic potential of metaphor in group poetry therapy, concentrating on the poetry therapy process of people diagnosed with schizophrenia. The data was collected in a one-year poetry therapy group. The main questions were: (1) What kind of therapeutic potential can metaphors offer in group poetry therapy? (2) What are the personal meanings and evaluations that the participants give to the therapy process and its effects on their lives? (3) What are the most significant elements in poetry therapy from the viewpoint of the client? The analysis was based on the Grounded theory method. The results showed that the most significant therapeutic factors of the process …
Seed population dynamics on badland slopes in southeastern Spain
1995
6 páginas, figuras, tablas.
Quantum Walks on Two-Dimensional Grids with Multiple Marked Locations
2016
The running time of a quantum walk search algorithm depends on both the structure of the search space graph and the configuration of marked locations. While the first dependence has been studied in a number of papers, the second dependence remains mostly unstudied. We study search by quantum walks on the two-dimensional grid using the algorithm of Ambainis, Kempe and Rivosh [AKR05]. The original paper analyses one and two marked locations only. We move beyond two marked locations and study the behaviour of the algorithm for an arbitrary configuration of marked locations. In this paper, we prove two results showing the importance of how the marked locations are arranged. First, we present tw…