Memoria – beca BE2005

Report for the scientific sojourn at the Centre for Interdisciplinary studies in Environment and Development (CISED), located in Bangalore (Southern India), from September to December 2005. A field-work in the South Indian city of Chennai (former Madras) was developed to analyse the mounting urban (and peri-urban) water crisis. In view of tackling this matter, the state government has done a deal to construct a 100 million litres per day seawater desalination plant. Due to its relative energy-intensiveness (compared to conventional water supply means), the fact that such a large capacity plant will be located in poor country such as India, constitutes somewhat of a surprising novelty, as most desalination facilities in the world are to be found in the oil-rich Persian Gulf countries. This work faces the environmental impact, the energy-intensive technology required, the cost and the missed water management options

Transformació d'una màquina de tecnologia additiva per a la fabricació d'scaffolds

Grup de Recerca en Enginyeria de Producte, Procés i Producció de la Universitat de Girona té en les seves instal•lacions una RepRap model Prusa Mendel. Un dels seus àmbits d’investigació és el sector mèdic. Una de les aplicacions més innovadores de les tecnologies additives, emmarcada dins del camp mèdic, és la fabricació de scaffolds. En la medicina regenerativa, els scaffolds s’utilitzen com estructures biodegradables implantables que serveixen de base per a la correcte reproducció de teixit a partir de cèl•lules no diferenciades. L’objecte del projecte és aconseguir fabricar scaffolds amb la Reprap. Per tald’assolir aquest objectiu final caldran molts passos previs. En el moment que s’inicia elpresent projecte la RepRap té tots els seus components muntats, el cablejat instal•lat i el firmware inicial a la placa. Així, en primer lloc cal obtenir una correcta comunicació entre la màquina i l’ordinador a través del qual es podrà accedir a la placa per tal de realizar ajustaments. Una vegada la màquina obeeixi les ordres de moviment en la magnitud i la direcció desitjada serà el moment d’ajustar els paràmetres propis de la impressió. Aquests varien en funció de l’extrusor i el material a utilitzar. En aquest punt es passarà a dissenyar i fabricar diferents tipus de scaffolds variant les estratègies i les geometries. Aquests dissenys seran testats mecànicament a compressió. També seran analitzats geomètricament i se’n determinarà la porositat. Finalment, a partir de l’anàlisi dels resultats s’intentarà trobar una relació entre les diferents formes geomètriques, les porositats i la resistència

Reliable detection of directional couplings using rank statistics

To detect directional couplings from time series various measures based on distances in reconstructed state spaces were introduced. These measures can, however, be biased by asymmetries in the dynamics' structure, noise color, or noise level, which are ubiquitous in experimental signals. Using theoretical reasoning and results from model systems we identify the various sources of bias and show that most of them can be eliminated by an appropriate normalization. We furthermore diminish the remaining biases by introducing a measure based on ranks of distances. This rank-based measure outperforms existing distance-based measures concerning both sensitivity and specificity for directional couplings. Therefore, our findings are relevant for a reliable detection of directional couplings from experimental signals.

What can spike train distances tell us about the neural code?

Time scale parametric spike train distances like the Victor and the van Rossum distancesare often applied to study the neural code based on neural stimuli discrimination.Different neural coding hypotheses, such as rate or coincidence coding,can be assessed by combining a time scale parametric spike train distance with aclassifier in order to obtain the optimal discrimination performance. The time scalefor which the responses to different stimuli are distinguished best is assumed to bethe discriminative precision of the neural code. The relevance of temporal codingis evaluated by comparing the optimal discrimination performance with the oneachieved when assuming a rate code.We here characterize the measures quantifying the discrimination performance,the discriminative precision, and the relevance of temporal coding. Furthermore,we evaluate the information these quantities provide about the neural code. Weshow that the discriminative precision is too unspecific to be interpreted in termsof the time scales relevant for encoding. Accordingly, the time scale parametricnature of the distances is mainly an advantage because it allows maximizing thediscrimination performance across a whole set of measures with different sensitivitiesdetermined by the time scale parameter, but not due to the possibility toexamine the temporal properties of the neural code.

Cross recurrence quantification for cover song identification

There is growing evidence that nonlinear time series analysis techniques can be used to successfully characterize, classify, or process signals derived from realworld dynamics even though these are not necessarily deterministic and stationary. In the present study we proceed in this direction by addressing an important problem our modern society is facing, the automatic classification of digital information. In particular, we address the automatic identification of cover songs, i.e. alternative renditions of a previously recorded musical piece. For this purpose we here propose a recurrence quantification analysis measure that allows tracking potentially curved and disrupted traces in cross recurrence plots. We apply this measure to cross recurrence plots constructed from the state space representation of musical descriptor time series extracted from the raw audio signal. We show that our method identifies cover songs with a higher accuracy as compared to previously published techniques. Beyond the particular application proposed here, we discuss how our approach can be useful for the characterization of a variety of signals from different scientific disciplines. We study coupled Rössler dynamics with stochastically modulated mean frequencies as one concrete example to illustrate this point.

Predictability of music descriptor time series and its application to cover song detection

Intuitively, music has both predictable and unpredictable components. In this work we assess this qualitative statement in a quantitative way using common time series models fitted to state-of-the-art music descriptors. These descriptors cover different musical facets and are extracted from a large collection of real audio recordings comprising a variety of musical genres. Our findings show that music descriptor time series exhibit a certain predictability not only for short time intervals, but also for mid-term and relatively long intervals. This fact is observed independently of the descriptor, musical facet and time series model we consider. Moreover, we show that our findings are not only of theoretical relevance but can also have practical impact. To this end we demonstrate that music predictability at relatively long time intervals can be exploited in a real-world application, namely the automatic identification of cover songs (i.e. different renditions or versions of the same musical piece). Importantly, this prediction strategy yields a parameter-free approach for cover song identification that is substantially faster, allows for reduced computational storage and still maintains highly competitive accuracies when compared to state-of-the-art systems.

On codes, matroids, and secure multiparty computation from linear secret-sharing schemes

Error-correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, the connections between codes, matroids, and a special class of secret sharing schemes, namely, multiplicative linear secret sharing schemes (LSSSs), are studied. Such schemes are known to enable multiparty computation protocols secure against general (nonthreshold) adversaries.Two open problems related to the complexity of multiplicative LSSSs are considered in this paper. The first one deals with strongly multiplicative LSSSs. As opposed to the case of multiplicative LSSSs, it is not known whether there is an efficient method to transform an LSSS into a strongly multiplicative LSSS for the same access structure with a polynomial increase of the complexity. A property of strongly multiplicative LSSSs that could be useful in solving this problem is proved. Namely, using a suitable generalization of the well-known Berlekamp–Welch decoder, it is shown that all strongly multiplicative LSSSs enable efficient reconstruction of a shared secret in the presence of malicious faults. The second one is to characterize the access structures of ideal multiplicative LSSSs. Specifically, the considered open problem is to determine whether all self-dual vector space access structures are in this situation. By the aforementioned connection, this in fact constitutes an open problem about matroid theory, since it can be restated in terms of representability of identically self-dual matroids by self-dual codes. A new concept is introduced, the flat-partition, that provides a useful classification of identically self-dual matroids. Uniform identically self-dual matroids, which are known to be representable by self-dual codes, form one of the classes. It is proved that this property also holds for the family of matroids that, in a natural way, is the next class in the above classification: the identically self-dual bipartite matroids.

Efficiency-based evaluation of aligners for industrial applications

This paper presents a novel efficiencybased evaluation of sentence and word aligners. This assessment is critical in order to make a reliable use in industrial scenarios. The evaluation shows that the resourcesrequired by aligners differ rather broadly. Subsequently, we establish limitation mechanisms on a set of aligners deployed as web services. These results, paired with the quality expected from the aligners, allow providers to choose the most appropriate aligner according to the task at hand.

Cortistain is expressed in a distinct subset of cortical interneurons

Cortistatin is a presumptive neuropeptide that shares 11 of its 14 amino acids with somatostatin. In contrast to somatostatin, administration of cortistatin into the rat brain ventricles specifically enhances slow wave sleep, apparently by antagonizing the effects of acetylcholine on cortical excitability. Here we show that preprocortistatin mRNA is expressed in a subset of GABAergic cells in the cortex and hippocampus that partially overlap with those containing somatostatin. A significant percentage of cortistatin-positive neurons is also positive for parvalbumin. In contrast, no colocalization was found between cortistatin and calretinin, cholecystokinin, or vasoactive intestinal peptide. During development there is a transient increase in cortistatin-expressing cells in the second postnatal week in all cortical areas and in the dentate gyrus. A transient expression of preprocortistatin mRNA in the hilar region at P16 is paralleled by electrophysiological changes in dentate granule cells. Together, these observations suggest mechanisms by which cortistatin may regulate cortical activity.