Symbolic Dynamics Analysis: a new methodology for foetal heart rate variability analysis

Cardiotocography (CTG) is a widespread foetal diagnostic methods. However, it lacks of objectivity and reproducibility since its dependence on observer's expertise. To overcome these limitations, more objective methods for CTG interpretation have been proposed. In particular, many developed techniques aim to assess the foetal heart rate variability (FHRV). Among them, some methodologies from nonlinear systems theory have been applied to the study of FHRV. All the techniques have proved to be helpful in specific cases. Nevertheless, none of them is more reliable than the others. Therefore, an in-depth study is necessary. The aim of this work is to deepen the FHRV analysis through the Symbolic Dynamics Analysis (SDA), a nonlinear technique already successfully employed for HRV analysis. Thanks to its simplicity of interpretation, it could be a useful tool for clinicians. We performed a literature study involving about 200 references on HRV and FHRV analysis; approximately 100 works were focused on non-linear techniques. Then, in order to compare linear and non-linear methods, we carried out a multiparametric study. 580 antepartum recordings of healthy fetuses were examined. Signals were processed using an updated software for CTG analysis and a new developed software for generating simulated CTG traces. Finally, statistical tests and regression analyses were carried out for estimating relationships among extracted indexes and other clinical information. Results confirm that none of the employed techniques is more reliable than the others. Moreover, in agreement with the literature, each analysis should take into account two relevant parameters, the foetal status and the week of gestation. Regarding the SDA, results show its promising capabilities in FHRV analysis. It allows recognizing foetal status, gestation week and global variability of FHR signals, even better than other methods. Nevertheless, further studies, which should involve even pathological cases, are necessary to establish its reliability.

Embodied computation and life: building blocks for open-ended evolution

Il presente lavoro si propone di sviluppare una analogia formale tra sistemi dinamici e teoria della computazione in relazione all’emergenza di proprietà biologiche da tali sistemi. Il primo capitolo sarà dedicato all’estensione della teoria delle macchine di Turing ad un più ampio contesto di funzioni computabili e debolmente computabili. Mostreremo quindi come un sistema dinamico continuo possa essere elaborato da una macchina computante, e come proprietà informative quali l’universalità possano essere naturalmente estese alla fisica attraverso questo ponte formale. Nel secondo capitolo applicheremo i risultati teorici derivati nel primo allo sviluppo di un sistema chimico che mostri tali proprietà di universalità, ponendo particolare attenzione alla plausibilità fisica di tale sistema.

Soil conservation in Swiss agriculture - Approaching abstract and symbolic meanings in farmers' life-worlds

This paper explores the significance of ‘life-worlds’ for better understanding why farmers adopt or reject soil conservation measures and for identifying basic dimensions to be covered by social learning processes in Swiss agricultural soil protection. The study showed that farmers interpret soil erosion and soil conservation measures against the background of their entire life-world. By doing so, farmers consider abstract and symbolic meanings of soil conservation. This is, soil conservation measures have to be feasible and practical in the everyday farming routine, however, they also have to correspond with their aesthetic perception, their value system and their personal and professional identities. Consequently, by switching to soil conservation measures such as no-tillage farmers have to adapt not only the routines of their daily farming life, but also their perception of the aesthetics of cultivated land, underlying values and images of themselves. Major differences between farmers who adopt and farmers who reject no-tillage were found to depend on the degree of coherence they could create between the abstract and symbolic meanings of the soil conservation measure. From this perspective, implementation of soil protection measures faces the challenge of facilitating interactions between farmers, experts and scientists at a ‘deeper’ level, with an awareness of all significant dimensions that characterise the life-world. The paper argues that a certain level of shared symbolic meaning is essential to achieving mutual understanding in social learning processes.

Parallel-recusive filter structures for the computation of discrete transforms

A general approach is presented for implementing discrete transforms as a set of first-order or second-order recursive digital filters. Clenshaw's recurrence formulae are used to formulate the second-order filters. The resulting structure is suitable for efficient implementation of discrete transforms in VLSI or FPGA circuits. The general approach is applied to the discrete Legendre transform as an illustration.

Numerical Computation of a Certain Dirichlet Series Attached to Siegel Modular Forms of Degree Two

The Rankin convolution type Dirichlet series D-F,D-G(s) of Siegel modular forms F and G of degree two, which was introduced by Kohnen and the second author, is computed numerically for various F and G. In particular, we prove that the series D-F,D-G(s), which shares the same functional equation and analytic behavior with the spinor L-functions of eigenforms of the same weight are not linear combinations of those. In order to conduct these experiments a numerical method to compute the Petersson scalar products of Jacobi Forms is developed and discussed in detail.

Efficient computation of discrete polynomial transforms

This letter presents a new recursive method for computing discrete polynomial transforms. The method is shown for forward and inverse transforms of the Hermite, binomial, and Laguerre transforms. The recursive flow diagrams require only 2 additions, 2( +1) memory units, and +1multipliers for the +1-point Hermite and binomial transforms. The recursive flow diagram for the +1-point Laguerre transform requires 2 additions, 2( +1) memory units, and 2( +1) multipliers. The transform computation time for all of these transforms is ( )

Computation of discrete cosine transform using Clenshaw's recurence formula

Clenshaw’s recurrenee formula is used to derive recursive algorithms for the discrete cosine transform @CT) and the inverse discrete cosine transform (IDCT). The recursive DCT algorithm presented here requires one fewer delay element per coefficient and one fewer multiply operation per coeflident compared with two recently proposed methods. Clenshaw’s recurrence formula provides a unified development for the recursive DCT and IDCT algorithms. The M v e al gorithms apply to arbitrary lengtb algorithms and are appropriate for VLSI implementation.

ON MARGINALIZED MULTILEVEL MODELS AND THEIR COMPUTATION

Clustered data analysis is characterized by the need to describe both systematic variation in a mean model and cluster-dependent random variation in an association model. Marginalized multilevel models embrace the robustness and interpretations of a marginal mean model, while retaining the likelihood inference capabilities and flexible dependence structures of a conditional association model. Although there has been increasing recognition of the attractiveness of marginalized multilevel models, there has been a gap in their practical application arising from a lack of readily available estimation procedures. We extend the marginalized multilevel model to allow for nonlinear functions in both the mean and association aspects. We then formulate marginal models through conditional specifications to facilitate estimation with mixed model computational solutions already in place. We illustrate this approach on a cerebrovascular deficiency crossover trial.