Search results for "Simon"
showing 10 items of 130 documents
Cádiz en Charcas: conjeturas e indicios
2012
Este es un artículo de historia constitucional. Se centra en la relación entre la Constitución española de 1812 y la Constitución boliviana de 1826. Su conclusión principal niega la idea de que, por el solo hecho de que ambas fueron cartas liberales contemporáneas entre sí escritas en la misma lengua, la primera Constitución haya influenciado en la segunda. Al contrario, toma a las semejanzas de redacción como un mero mecanismo de auxilio técnico, pero no por una fuente de influencia. Y, no las califica así, porque la influencia supone una relación de autoridad moralmente justificada, lo que, precisamente, estaba ausente entre el poder metropolitano y sus colonias. Una serie de documentos h…
Simultaneous speciation in the European high mountain flowering plant genus Facchinia (Minuartia s.l., Caryophyllaceae) revealed by genotyping-by-seq…
2017
Understanding the relative importance of different mechanisms of speciation in a given lineage requires fully resolved interspecific relationships. Using Facchinia, a genus of seven species centred in the European Alps, we explore whether the polytomy found by Sanger sequencing analyses of standard nuclear (ITS) and plastid markers (trnQ-rps16) is a hard or soft polytomy by substantially increasing the amount of DNA sequence data, generated by genotyping-by-sequencing. In comparison to 142 phylogenetically informative sites in the Sanger sequences the GBS sequences yielded 3363 phylogenetically informative sites after exclusion of apparently oversaturated SNPs. Maximum parsimony, maximum li…
Phylogeny and the colourful history of jewel bugs (Insecta: Hemiptera: Scutelleridae)
2017
Members of the family Scutelleridae (Heteroptera: Pentatomomorpha: Pentatomoidea) are also called shield bugs because of the greatly enlarged scutellum, or jewel bugs because of the brilliant colours of many species. All scutellerids are phytophagous, feeding on various parts of their host plants. Due to lack of obvious synapomorphies and the failure to apply rigorous phylogenetic methods, the higher classification of Scutelleridae has been disputed for more than 150 years. Here we reconstructed a phylogeny of Scutelleridae based on complete sequences of 18S and 28S nuclear rDNAs and all 13 protein-coding genes of the mitochondrial genome, with the sampled taxa covering all of the currently…
Phylogeny and systematics of African Melastomateae (Melastomataceae)
2017
Melastomateae are the most species-rich (185 spp./13 gen.) and morphologically diverse tribe within the African Melastomataceae. In this study we present the first in-depth phylogenetic analysis of African Melastomateae using sequences generated from one nuclear (nrITS) and two plastid spacers (accD-psaI, psbK-psbL) sampling 183 accessions representing 75 African, 10 Madagascan and 7 Asian species and a broad outgroup sampling. We infer phylogenetic relationships using maximum likelihood, maximum parsimony and Bayesian approaches and propose a revised generic classification of African Melastomateae based on our molecular trees in combination with a careful reassessment of morphological vari…
Katsaus Suomen varhaiseen atomihistoriaan
2022
Nykyisellä ydinteknologialla on lähinnä kaksi haaraa joita ovat ydinenergia ja lääketieteellinen isotooppitekniikka. Ensin mainitun lähtölaukauksena Suomessa pidetään nk. energiakomitean perustamista vuonna 1955. Tämän historian tutkimuksen painopiste on ollut 1960-ja 1970-luvun tapahtumissa, jotka liittyvät nykyisten ydinvoimalaitosten hankintakuvioihin. Professori Lennart Simons aloitti vakavasti otettavan ydinfysiikan tutkimuksen Suomessa ja oli alan ykkösnimi 1940- ja 1950-luvuilla kun koko länsimaailman yli pyyhkäisi atomiteknologian huuma, jota ehkä voi sanoa ensimmäiseksi teknologiahypeksi modernissa mielessä. Kirjan tarkoituksena on antaa lisävalaistusta suomalaisen ydinteknologian …
Learning-Graph-Based Quantum Algorithm for k-distinctness
2012
We present a quantum algorithm solving the $k$-distinctness problem in $O(n^{1-2^{k-2}/(2^k-1)})$ queries with a bounded error. This improves the previous $O(n^{k/(k+1)})$-query algorithm by Ambainis. The construction uses a modified learning graph approach. Compared to the recent paper by Belovs and Lee arXiv:1108.3022, the algorithm doesn't require any prior information on the input, and the complexity analysis is much simpler. Additionally, we introduce an $O(\sqrt{n}\alpha^{1/6})$ algorithm for the graph collision problem where $\alpha$ is the independence number of the graph.
Ambiguity and difference: Two feminist ethics of the present
2018
The chapter studies the ethical dimensions of Beauvoir’s existentialism and Irigaray’s ontology of difference. It argues that Irigaray builds on one central but largely neglected result of Beauvoir’s moral philosophical argumentation: the claim that fundamentally sexual subordination constitutes an ethical problem that cannot be adequately solved merely through social reforms, political interventions, or theoretical reflections. By comparing Beauvoir’s concept of erotic generosity to Irigaray’s discussion of wonder and love, the chapter demonstrates that both philosophers conceive of male privilege as an ethical issue that must be worked out between individual women and men in their concret…
Ansaittu todellisuus : kvasi-realistisen position luonteesta, perusteista ja mahdollisuuksista
2007
Biografia / Antologia
2019
Span programs for functions with constant-sized 1-certificates
2012
Besides the Hidden Subgroup Problem, the second large class of quantum speed-ups is for functions with constant-sized 1-certificates. This includes the OR function, solvable by the Grover algorithm, the element distinctness, the triangle and other problems. The usual way to solve them is by quantum walk on the Johnson graph. We propose a solution for the same problems using span programs. The span program is a computational model equivalent to the quantum query algorithm in its strength, and yet very different in its outfit. We prove the power of our approach by designing a quantum algorithm for the triangle problem with query complexity O(n35/27) that is better than O(n13/10) of the best p…