Search results for "Crete"

Manipulating the alpha level cannot cure significance testing

2018

We argue that making accept/reject decisions on scientific hypotheses, including a recent call for changing the canonical alpha level from p = 0.05 to p = 0.005, is deleterious for the finding of new discoveries and the progress of science. Given that blanket and variable alpha levels both are problematic, it is sensible to dispense with significance testing altogether. There are alternatives that address study design and sample size much more directly than significance testing does; but none of the statistical tools should be taken as the new magic method giving clear-cut mechanical answers. Inference should not be based on single studies at all, but on cumulative evidence from multiple in…

Effects of Kolmogorov complexity present in inductive inference as well

1997

For all complexity measures in Kolmogorov complexity the effect discovered by P. Martin-Lof holds. For every infinite binary sequence there is a wide gap between the supremum and the infimum of the complexity of initial fragments of the sequence. It is assumed that that this inevitable gap is characteristic of Kolmogorov complexity, and it is caused by the highly abstract nature of the unrestricted Kolmogorov complexity.

Inductive inference of recursive functions: Complexity bounds

2005

This survey includes principal results on complexity of inductive inference for recursively enumerable classes of total recursive functions. Inductive inference is a process to find an algorithm from sample computations. In the case when the given class of functions is recursively enumerable it is easy to define a natural complexity measure for the inductive inference, namely, the worst-case mindchange number for the first n functions in the given class. Surely, the complexity depends not only on the class, but also on the numbering, i.e. which function is the first, which one is the second, etc. It turns out that, if the result of inference is Goedel number, then complexity of inference ma…

"Table 1" of "$\Lambda$ polarization in associated K$^+$ - $\Lambda$ electro-production"

2000

LAMBDA polarization, with respect to the p_gamma x p_k axis.

DC series arc faults in PV systems. Detection methods and experimental characterization

2020

This work is focused on the arc faults phenomenon in DC photovoltaic (PV) systems. The paper gives an overview of arc detection methods proposed in literature and presents a preliminary experimental characterization of the arcing current, focusing the attention on series arcs, whose detection is particularly challenging. Experimental tests are carried out, both in laboratory and on field, in order to investigate some relevant characteristics in the arcing current, which can be feasible for the arc detection purpose. Both arcing and non-arcing current signals are acquired and compared in both time and frequency domain. On-field measurements are carried out on a real photovoltaic system, in a…

Il palazzo di Phestos a Creta: Scavo e restauro

2014

Nel 1900, la Missione Archeologica Italiana di Creta, guidata da Federico Halbherr, con la collaborazione di alcuni archeologi e studenti di archeologia, fra i quali Luigi Pernier, scoprì i resti del palazzo minoico di Festòs, posto a pochi chilometri da Eraklion, capoluogo dell’isola di Creta. Contemporaneamente alla messa in luce dei resti furono eseguiti i primi interventi di restauro e sistemazione, tra questi la pulitura degli interstizi fra i conci lapidei e la stesura di malta cementizia colorata, in modo da intonarla rispetto ai resti, la sistemazione delle parti superiori dei resti murari e la costruzione dei solai in calcestruzzo di cemento armato, un tempo realizzati con struttur…

Characterization of the bacterial community isolated from a High Middle Age soil sample dated since 980 AD

2016

On Approximate Jumbled Pattern Matching in Strings

2011

Given a string s, the Parikh vector of s, denoted p(s), counts the multiplicity of each character in s. Searching for a match of a Parikh vector q in the text s requires finding a substring t of s with p(t) = q. This can be viewed as the task of finding a jumbled (permuted) version of a query pattern, hence the term Jumbled Pattern Matching. We present several algorithms for the approximate version of the problem: Given a string s and two Parikh vectors u, v (the query bounds), find all maximal occurrences in s of some Parikh vector q such that u <= q <= v. This definition encompasses several natural versions of approximate Parikh vector search. We present an algorithm solving this problem …

Operators on Partial Inner Product Spaces: Towards a Spectral Analysis

2014

Given a LHS (Lattice of Hilbert spaces) $V_J$ and a symmetric operator $A$ in $V_J$, in the sense of partial inner product spaces, we define a generalized resolvent for $A$ and study the corresponding spectral properties. In particular, we examine, with help of the KLMN theorem, the question of generalized eigenvalues associated to points of the continuous (Hilbertian) spectrum. We give some examples, including so-called frame multipliers.

A model for dark matter, naturalness and a complete gauge unification

2015

We consider dark matter in a minimal extension of the Standard Model (SM) which breaks electroweak symmetry dynamically and leads to a complete unification of the SM and technicolor coupling constants. The unification scale is determined to be $M_{\rm U} \approx 2.2 \times 10^{15}$ GeV and the unified coupling $\alpha_{\rm U} \approx 0.0304$. Moreover, unification strongly suggest that the technicolor sector of the model must become strong at the scale of ${\cal O}$(TeV). The model also contains a tightly constrained sector of mixing neutral fields stabilized by a discrete symmetry. We find the lightest of these states can be DM with a mass in the range $m_{\rm DM} \approx 30-800$ GeV. We f…