Search results for "COMPLETENESS"

showing 10 items of 66 documents

The Power of Word-Frequency Based Alignment-Free Functions: a Comprehensive Large-Scale Experimental Analysis

2021

Abstract Motivation Alignment-free (AF) distance/similarity functions are a key tool for sequence analysis. Experimental studies on real datasets abound and, to some extent, there are also studies regarding their control of false positive rate (Type I error). However, assessment of their power, i.e. their ability to identify true similarity, has been limited to some members of the D2 family. The corresponding experimental studies have concentrated on short sequences, a scenario no longer adequate for current applications, where sequence lengths may vary considerably. Such a State of the Art is methodologically problematic, since information regarding a key feature such as power is either mi…

Statistics and ProbabilitySequenceSimilarity (geometry)Settore INF/01 - Informaticasequence analysisComputer sciencepower statisticsAlignment-Free Genomic Analysis Big Data Software Platforms Bioinformatics AlgorithmsScale (descriptive set theory)Function (mathematics)computer.software_genreBiochemistryComputer Science ApplicationsSet (abstract data type)Computational MathematicsRange (mathematics)Computational Theory and Mathematicssequence analysis; power statistics; alignment-free functionsalignment-free functionsData miningCompleteness (statistics)Molecular BiologycomputerType I and type II errors
researchProduct

Completeness number of families of subsets of convergence spaces

2016

International audience; Compactoid and compact families generalize both convergent filters and compact sets. This concept turned out to be useful in various quests, like Scott topologies, triquotient maps and extensions of the Choquet active boundary theorem.The completeness number of a family in a convergence space is the least cardinality of collections of covers for which the family becomes complete. 0-completeness amounts to compactness, finite completeness to relative local compactness and countable completeness to Čech completeness. Countably conditional countable completeness amounts to pseudocompleteness of Oxtoby. Conversely, each completeness class of families can be represented a…

Discrete mathematics[ MATH ] Mathematics [math]CompletenessClass (set theory)Complete partial orderCompactness010102 general mathematicsBoundary (topology)Characterization (mathematics)01 natural sciences010101 applied mathematicsConvergence theoryCompact spaceCardinalityCompleteness (order theory)Countable setGeometry and Topology0101 mathematics[MATH]Mathematics [math]Mathematics
researchProduct

Phenomenological-Semantic Investigations into Incompleteness

2000

When today the phenomenologist surveys the history of the philosophical comprehension of Godel’s theorems, he is confronted with the realization that the decisive publications come almost exclusively from the sphere of analytic philosophy.1 But does phenomenology in the spirit of Husserl not mean to keep in step with the epochal results of the special sciences by working on the phenomenological understanding of them? Phenomenological research of this kind means the same as development of phenomenological theory of science (Wissenschaftstheorie). In connection with the incompleteness theorems, the latter would be confronted with fundamental questions such as, “To what extent can mathematical…

Special sciencesInterpretative phenomenological analysisPhilosophyModal logicGödelGödel's incompleteness theoremsMathematical proofPhenomenology (psychology)computerNatural languagecomputer.programming_languageEpistemology
researchProduct

Predictive models in assessment of macroinvertebrates in boreal rivers

2009

Jukka Aroviita tutki väitöskirjassaan jokien ja purojen biologisen tilan mittaamismenetelmiä. Aroviita osoitti, että ihmistoiminnan aiheuttamat biologiset muutokset voivat jäädä havaitsematta, jos eliöyhteisöjen luonnollista taustavaihtelua ei oteta kunnolla huomioon.- Tällöin vesistöjen saatetaan arvioida olevan paremmassa kunnossa kuin ne todellisuudessa ovatkaan. Muutosten tunnistamistarkkuuden tulisi olla mahdollisimman hyvä, sillä tila-arvioilla on myös juridisesti määräytyviä yhteiskunnallisia ja taloudellisia seuraamuksia, Aroviita toteaa. Vielä 1990-luvulla järvien ja jokien tilaa arvioitiin suurelta osin ihmisen näkökulmasta ja veden kemian perusteella. Nykylainsäädäntö edellyttää …

spatial scalebioassessmentpohjaeläimistöRIVPACSbiotic qualitytaxonomic completenessvirtavedetvertailuololähestymistapaennustavat mallitmacroinvertebratestypologystreamstypologiat
researchProduct

Scattering resonances and Pseudospectrum : stability and completeness aspects in optical and gravitational systems

2022

The general context of this thesis is an effort to establish a bridge between gravitational andoptical physics, specifically in the context of scattering problems using as a guideline concepts andtools taken from the theory of non-self-adjoint operators. Our focus is on Quasi-Normal Modes(QNMs), namely the natural resonant modes of open leaky structures under linear perturbationssubject to outgoing boundary conditions. They also are referred to as scattering resonances.In the conservative self-adjoint case the spectral theorem guarantees the completeness andspectral stability of the associated normal modes. In this sense, a natural question in the non-self-adjoint setting refers to the char…

QNM completenessPseudospectrumBlack holesNanoparticulesMethodes spectralesSpectrum stabilityOperateurs non-selfadjointsSpectral methodsQuasinormal modesPseudospectreNon-Selfadjoint operatorNanoparticlesModes quasi-NormauxComplétude de modes quasi-NormauxTrous noirStabilité spectrale[MATH.MATH-MP] Mathematics [math]/Mathematical Physics [math-ph]
researchProduct

A note on best approximation in 0-complete partial metric spaces

2014

We study the existence and uniqueness of best proximity points in the setting of 0-complete partial metric spaces. We get our results by showing that the generalizations, which we have to consider, are obtained from the corresponding results in metric spaces. We introduce some new concepts and consider significant theorems to support this fact.

Discrete mathematicsArticle SubjectApplied MathematicsInjective metric spacelcsh:MathematicsT-normlcsh:QA1-939Intrinsic metricConvex metric spaceUniform continuityMetric spaceFréchet spaceSettore MAT/05 - Analisi Matematica0-completeness best proximity point fixed point partial metric spaceMetric (mathematics)AnalysisMathematics
researchProduct

THE MAXWELL–DIRAC EQUATIONS: ASYMPTOTIC COMPLETENESS AND THE INFRARED PROBLEM

1994

In this article we present an announcement of results concerning: a) A solution to the Cauchy problem for the M-D equations, namely global existence, for small initial data at t = 0, of solutions for the M-D equations. b) Arguments from which asymptotic completeness for the M-D equations follows. c) Cohomological interpretation of the results in the spirit of nonlinear representation theory and its connection to the infrared tail of the electron in M-D classical field theory. The full detailed results will be published elsewhere.

Nonlinear systemCompleteness (order theory)Mathematical analysisDirac (software)Initial value problemClassical field theoryStatistical and Nonlinear PhysicsRepresentation theoryMathematical PhysicsMathematicsInterpretation (model theory)Mathematical physicsConnection (mathematics)Reviews in Mathematical Physics
researchProduct

Formālisms kā reālās matemātikas filozofija: 14 argumenti

2015

Referāts Latvijas Universitātes 73.zinātniskajā konferencē 2015.gada 13.februārī.

formalismfoundations of mathematics:MATHEMATICS [Research Subject Categories]:HUMANITIES and RELIGION [Research Subject Categories]incompleteness theoremsaxiomatic set theoryplatonism
researchProduct

Logic, Computing and Biology

2015

Logic and Computing are appropriate formal languages for Biology, and we may well be surprised by the strong analogy between software and DNA, and between hardware and the protein machinery of the cell. This chapter examines to what extent any biological entity can be described by an algorithm and, therefore, whether the Turing machine and the halting problem concepts apply. Last of all, I introduce the concepts of recursion and algorithmic complexity, both from the field of computer science, which can help us understand and conceptualise biological complexity.

Turing machinesymbols.namesakeRecursionTheoretical computer scienceComputer scienceComputational logicFormal languagesymbolsAnalogyComputerApplications_COMPUTERSINOTHERSYSTEMSGödel's incompleteness theoremsUnconventional computingHalting problem
researchProduct

¿Qué papel juegan la evitación del daño y la sensación de inacabado en los síntomas obsesivos de orden y comprobación?

2020

Numerosas investigaciones han intentado determinar las variables implicadas en la génesis y mantenimiento del Trastorno Obsesivo-Compulsivo (TOC). Recientemente, se han propuesto la evitación del daño y la sensación de inacabado como dos dimensiones nucleares motivadoras de la sintomatología obsesivo-compulsiva. El objetivo de este estudio fue analizar el papel de la evitación del daño y la sensación de inacabado en su relación con los síntomas obsesivo-compulsivos. Para ello, se realizó un Path analysis en una muestra de 267 personas de la población general (74,5% mujeres; edad media 27,29 años). Los resultados mostraron que la asociación entre evitación del daño y los síntomas de orden y …

Orderingeducation.field_of_studyFuture studiesPsychotherapistTrastorno obsesivo-compulsivoCheckingPopulationIncompletenessGeneral MedicineHarm avoidancemedicine.diseaseSensación de inacabadoObsessive-compulsive DisorderObsessive compulsiveEvitación del dañomedicineHarm avoidancePsychologyeducationOrdenComprobación
researchProduct