Search results for "Complexity"
showing 10 items of 1094 documents
Słabości eksplanacyjne teorii inteligentnego projektu
2021
Artykuł powstrzymuje się od polemiki merytorycznej z teorią inteligentnego projektu, dalej TIP, a jedynie wskazuje na jej niedostatki metodologiczne. Dowodzi, że wbrew twierdzeniom jej zwolenników TIP nie jest falsyfikowalna. W odróżnieniu od teorii ewolucji nie może pełnić nawet roli metafizycznego programu badawczego w sensie Poppera. Co jednak ważniejsze, TIP nie pełni żadnych funkcji eksplanacyjnych. W grę wchodzą jedynie wyjaśnienia intencjonalne, TIP zaś nie jest w stanie zidentyfikować motywów domniemanego projektanta. Argument jest zilustrowany przykładami zaczerpniętymi od Stanisława Lema, które pokazują, że możliwych jest wiele alternatywnych hipotez na temat celów domniemanego pr…
Optimal Guard Placement Problem Under L-Visibility
2006
Two points a and b in the presence of polygonal obstacles are L-visible if the length of the shortest path avoiding obstacles is no more than L. For a given convex polygon Q, Gewali et al [4]. addressed the guard placement problem on the exterior boundary that will cover the maximum area exterior to the polygon under L-visibility. They proposed a linear time algorithm for some given value of L. When the length L is greater than half of the perimeter, they declared that problem as open. Here we address that open problem and present an algorithm whose time complexity is linear in number of vertices of the polygon.
Morphology-based measurement of activation time in human atrial fibrillation
2003
The measurement of the activation time is crucial to allow the correct automatic analysis and classification of intracardiac electrograms recorded in the human atria during atrial fibrillation (AF). This study proposes a method which accounts for the morphology of bipolar signals. After ventricular artifact removal and activation wave recognition, the fiducial point of the activation wave was set at its local barycentre (LB). The method was tested on a set of 30 AF bipolar recordings of increasing complexity class; its performance was compared with that of the traditional methods of maximum peak (MP) or maximum slope (MS) estimation, taking the manual measurements performed by an expert car…
A Bacterial-Based Algorithm to Simulate Complex Adaptative Systems
2014
Paper presented at the 13th International Conference on Simulation of Adaptive Behavior which took place at Castellón, Spain in 2014, July 22-25. Bacteria have demonstrated an amazing capacity to overcome envi-ronmental changes by collective adaptation through genetic exchanges. Using a distributed communication system and sharing individual strategies, bacteria propagate mutations as innovations that allow them to survive in different envi-ronments. In this paper we present an agent-based model which is inspired by bacterial conjugation of DNA plasmids. In our approach, agents with bounded rationality interact in a common environment guided by local rules, leading to Complex Adaptive Syste…
DeepEva: A deep neural network architecture for assessing sentence complexity in Italian and English languages
2021
Abstract Automatic Text Complexity Evaluation (ATE) is a research field that aims at creating new methodologies to make autonomous the process of the text complexity evaluation, that is the study of the text-linguistic features (e.g., lexical, syntactical, morphological) to measure the grade of comprehensibility of a text. ATE can affect positively several different contexts such as Finance, Health, and Education. Moreover, it can support the research on Automatic Text Simplification (ATS), a research area that deals with the study of new methods for transforming a text by changing its lexicon and structure to meet specific reader needs. In this paper, we illustrate an ATE approach named De…
Discovering representative models in large time series databases
2004
The discovery of frequently occurring patterns in a time series could be important in several application contexts. As an example, the analysis of frequent patterns in biomedical observations could allow to perform diagnosis and/or prognosis. Moreover, the efficient discovery of frequent patterns may play an important role in several data mining tasks such as association rule discovery, clustering and classification. However, in order to identify interesting repetitions, it is necessary to allow errors in the matching patterns; in this context, it is difficult to select one pattern particularly suited to represent the set of similar ones, whereas modelling this set with a single model could…
Spatial diversity of chlorine residual in a drinking water distribution system: application of an integrated fuzzy logic technique
2014
A reduction in the concentration of chlorine, which is used as a chemical disinfectant for water in drinking water distribution systems, can be considered to be an index of the progressive deterioration of water quality. In this work, attention is given to the spatial distribution of the residual chlorine in drinking water distribution systems. The criterion for grouping the water-quality parameters normally used is highly subjective and often based on data that are not correctly identified. In this paper, a cluster analysis based on fuzzy logic is applied. The advantage of the proposed procedure is that it allows a user to identify (in an automatic way and without any specific assumption) …
Video preprocessing for audiovisual indexing
2003
We address the problem of detecting shots of subjects that are interviewed in news sequences. This is useful since usually these kinds of scenes contain important and reusable information that can be used for other news programs. In a previous paper, we presented a technique based on a priori knowledge of the editing techniques used in news sequences which allowed a fast search of news stories (see Albiol, A. et al., 3rd Int. Conf. on Audio and Video-based Biometric Person Authentication, p.366-71, 2001). We now present a new shot descriptor technique which improves the previous search results by using a simple, yet efficient, algorithm, based on the information contained in consecutive fra…
A NEW COMPLEXITY FUNCTION FOR WORDS BASED ON PERIODICITY
2013
Motivated by the extension of the critical factorization theorem to infinite words, we study the (local) periodicity function, i.e. the function that, for any position in a word, gives the size of the shortest square centered in that position. We prove that this function characterizes any binary word up to exchange of letters. We then introduce a new complexity function for words (the periodicity complexity) that, for any position in the word, gives the average value of the periodicity function up to that position. The new complexity function is independent from the other commonly used complexity measures as, for instance, the factor complexity. Indeed, whereas any infinite word with bound…
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.