Search results for "complexity"
showing 10 items of 1094 documents
Information-theoretic assessment of cardiovascular variability during postural and mental stress
2016
This study was aimed at investigating the individual and combined effects of postural and mental stress on short-term cardiovascular regulation. To this end, we applied measures taken from the emerging framework of information dynamics on the beat-to-beat spontaneous variability of RR interval and systolic arterial pressure (SAP) measured from healthy subjects in the resting supine position and during the separate and simultaneous execution of experimental protocols performing head-up tilt (HUT) and mental arithmetics (MA). The information stored in RR interval variability, a measure inversely related to the complexity of the time series, increased significantly during HUT and HUT+MA compar…
Three-dimensional phase unwrapping using the Hungarian algorithm.
2009
We propose a three-dimensional phase unwrapping technique that uses the Hungarian algorithm to join together all the partial residual loops that may occur in a wrapped phase volume. Experimental results have shown that the proposed algorithm is more robust and reliable than other well-known three-dimensional phase unwrapping algorithms. Additionally, the proposed algorithm is fast in terms of computational complexity, which makes it suitable for practical applications.
Activation of complement by the alternative pathway as a factor in the pathogenesis of periodontal disease.
1976
Dental plaque and a bacterium, Actinomyces viscosus, isolated from plaque that can reproduce periodontal disease in germ-free rats, are activators of complement by the alternative pathway. It is suggested that this process is involved in the pathogenesis of chronic inflammatory periodontal disease.
Time, frequency and information domain analysis of short-term heart rate variability before and after focal and generalized seizures in epileptic chi…
2019
OBJECTIVE In this work we explore the potential of combining standard time and frequency domain indexes with novel information measures, to characterize pre- and post-ictal heart rate variability (HRV) in epileptic children, with the aim of differentiating focal and generalized epilepsy regarding the autonomic control mechanisms. APPROACH We analyze short-term HRV in 37 children suffering from generalized or focal epilepsy, monitored 10 s, 300 s, 600 s and 1800 s both before and after seizure episodes. Nine indexes are computed in time (mean, standard deviation of normal-to-normal intervals, root mean square of the successive differences (RMSSD)), frequency (low-to-high frequency power rati…
A Controllable Text Simplification System for the Italian Language
2021
Text simplification is a non-trivial task that aims at reducing the linguistic complexity of written texts. Researchers have studied the problem by proposing new methodologies for addressing the English language, but other languages, like the Italian one, are almost unexplored. In this paper, we give a contribution to the enhancement of the Automated Text Simplification research by presenting a deep learning-based system, inspired by a state of the art system for the English language, capable of simplifying Italian texts. The system has been trained and tested by leveraging the Italian version of Newsela; it has shown promising results by achieving a SARI value of 30.17.
SULLA FIABA E SULLA LETTERATURA PER L'INFANZIA A PROPOSITO DI ALCUNI LIBRI
2023
L’articolo riflette su alcune proposte critiche contenute nel recente volume Di cosa parlano i libri per bambini. La letteratura per l’infanzia come critica radicale di Giorgia Grilli, studiosa di letteratura per l’infanzia da molti anni e traduttrice di classici della critica e della narrativa per ragazzi. Attingendo alle scienze cognitive, agli studi di antropologia, di psicologia degli archetipi, di filosofia e alla tradizione critica di settore, Grilli si interroga sul vero significato delle storie per bambini, sulla dimensione profondamente filosofica che alcuni classici per l’infanzia possiedono per dimostrare la complessità letteraria e antropologica di un ambito letterario ingiustam…
Canopy Architecture Appraisal by Fractal Dimension of 'Flordastar' Peach Trees Grafted onto Different Rootstocks
2007
The objective of this research was to evaluate the modification of canopy architecture of ''Flordastar'' peach (Prunus persica L. Batsch) grafted onto rootstocks with different vigour, by the use of fractal dimension (D). The hypothesis was that different vigour rootstocks are able to modify the complexity of the branching pattern and that this effect can be assessed by a geometric parameter such as the fractal dimension (D) of the 2D projection of tree branching structure. The observations were carried out in a four-year-old experimental orchard of cv. ''Flordastar'' peach trees grafted onto Ishtara, Barrier, GF677 and MrS 2/5 rootstocks. On digital pictures of leafless, dormant peach tree…
On the impact of forgetting on learning machines
1995
People tend not to have perfect memories when it comes to learning, or to anything else for that matter. Most formal studies of learning, however, assume a perfect memory. Some approaches have restricted the number of items that could be retained. We introduce a complexity theoretic accounting of memory utilization by learning machines. In our new model, memory is measured in bits as a function of the size of the input. There is a hierarchy of learnability based on increasing memory allotment. The lower bound results are proved using an unusual combination of pumping and mutual recursion theorem arguments. For technical reasons, it was necessary to consider two types of memory : long and sh…
Evaluation of GPU-based Seed Generation for Computational Genomics Using Burrows-Wheeler Transform
2012
Unprecedented production of short reads from the new high-throughput sequencers has posed challenges to align short reads to reference genomes with high sensitivity and high speed. Many CPU-based short read aligners have been developed to address this challenge. Among them, one popular approach is the seed-and-extend heuristic. For this heuristic, the first and foremost step is to generate seeds between the input reads and the reference genome, where hash tables are the most frequently used data structure. However, hash tables are memory-consuming, making it not well-suited to memory-stringent many-core architectures, like GPUs, even though they usually have a nearly constant query time com…
Boosting Textual Compression in Optimal Linear Time
2005
We provide a general boosting technique for Textual Data Compression. Qualitatively, it takes a good compression algorithm and turns it into an algorithm with a better compression performance guarantee. It displays the following remarkable properties: (a) it can turn any memoryless compressor into a compression algorithm that uses the “best possible” contexts; (b) it is very simple and optimal in terms of time; and (c) it admits a decompression algorithm again optimal in time. To the best of our knowledge, this is the first boosting technique displaying these properties.Technically, our boosting technique builds upon three main ingredients: the Burrows--Wheeler Transform, the Suffix Tree d…