Impaired learning of predators and lower prey survival under elevated CO2: a consequence of neurotransmitter interference

Ocean acidification is one of the most pressing environmental concerns of our time, and not surprisingly, we have seen a recent explosion of research into the physiological impacts and ecological consequences of changes in ocean chemistry. We are gaining considerable insights from this work, but further advances require greater integration across disciplines. Here, we showed that projected near-future CO2 levels impaired the ability of damselfish to learn the identity of predators. These effects stem from impaired neurotransmitter function; impaired learning under elevated CO2 was reversed when fish were treated with gabazine, an antagonist of the GABA-A receptor - a major inhibitory neurotransmitter receptor in the brain of vertebrates. The effects of CO2 on learning and the link to neurotransmitter interference were manifested as major differences in survival for fish released into the wild. Lower survival under elevated CO2 , as a result of impaired learning, could have a major influence on population recruitment.

Combining static analysis and profiling for estimating execution times

Effective static analyses have been proposed which infer bounds on the number of resolutions. These have the advantage of being independent from the platform on which the programs are executed and have been shown to be useful in a number of applications, such as granularity control in parallel execution. On the other hand, in distributed computation scenarios where platforms with different capabilities come into play, it is necessary to express costs in metrics that include the characteristics of the platform. In particular, it is specially interesting to be able to infer upper and lower bounds on actual execution times. With this objective in mind, we propose an approach which combines compile-time analysis for cost bounds with a one-time profiling of a given platform in order to determine the valúes of certain parameters for that platform. These parameters calibrate a cost model which, from then on, is able to compute statically time bound functions for procedures and to predict with a significant degree of accuracy the execution times of such procedures in that concrete platform. The approach has been implemented and integrated in the CiaoPP system.

Interval-based resource usage verification: Formalization and prototype

In an increasing number of applications (e.g., in embedded, real-time, or mobile systems) it is important or even essential to ensure conformance with respect to a specification expressing resource usages, such as execution time, memory, energy, or user-defined resources. In previous work we have presented a novel framework for data size-aware, static resource usage verification. Specifications can include both lower and upper bound resource usage functions. In order to statically check such specifications, both upper- and lower-bound resource usage functions (on input data sizes) approximating the actual resource usage of the program which are automatically inferred and compared against the specification. The outcome of the static checking of assertions can express intervals for the input data sizes such that a given specification can be proved for some intervals but disproved for others. After an overview of the approach in this paper we provide a number of novel contributions: we present a full formalization, and we report on and provide results from an implementation within the Ciao/CiaoPP framework (which provides a general, unified platform for static and run-time verification, as well as unit testing). We also generalize the checking of assertions to allow preconditions expressing intervals within which the input data size of a program is supposed to lie (i.e., intervals for which each assertion is applicable), and we extend the class of resource usage functions that can be checked.

Towards execution time estimation for logic programs via static analysis and profiling

Effective static analyses have been proposed which infer bounds on the number of resolutions or reductions. These have the advantage of being independent from the platform on which the programs are executed and have been shown to be useful in a number of applications, such as granularity control in parallel execution. On the other hand, in distributed computation scenarios where platforms with different capabilities come into play, it is necessary to express costs in metrics that include the characteristics of the platform. In particular, it is specially interesting to be able to infer upper and lower bounds on actual execution times. With this objective in mind, we propose an approach which combines compile-time analysis for cost bounds with a one-time profiling of the platform in order to determine the valúes of certain parameters for a given platform. These parameters calíbrate a cost model which, from then on, is able to compute statically time bound functions for procedures and to predict with a significant degree of accuracy the execution times of such procedures in the given platform. The approach has been implemented and integrated in the CiaoPP system.

Combining static analysis and profiling for estimating execution times in logic programs

Effective static analyses have been proposed which allow inferring functions which bound the number of resolutions or reductions. These have the advantage of being independent from the platform on which the programs are executed and such bounds have been shown useful in a number of applications, such as granularity control in parallel execution. On the other hand, in certain distributed computation scenarios where different platforms come into play, with each platform having different capabilities, it is more interesting to express costs in metrics that include the characteristics of the platform. In particular, it is specially interesting to be able to infer upper and lower bounds on actual execution time. With this objective in mind, we propose a method which allows inferring upper and lower bounds on the execution times of procedures of a program in a given execution platform. The approach combines compile-time cost bounds analysis with a one-time profiling of the platform in order to determine the values of certain constants for that platform. These constants calibrate a cost model which from then on is able to compute statically time bound functions for procedures and to predict with a significant degree of accuracy the execution times of such procedures in the given platform. The approach has been implemented and integrated in the CiaoPP system.

Termination and cost analysis: Complexity and precision issues

The research in this thesis is related to static cost and termination analysis. Cost analysis aims at estimating the amount of resources that a given program consumes during the execution, and termination analysis aims at proving that the execution of a given program will eventually terminate. These analyses are strongly related, indeed cost analysis techniques heavily rely on techniques developed for termination analysis. Precision, scalability, and applicability are essential in static analysis in general. Precision is related to the quality of the inferred results, scalability to the size of programs that can be analyzed, and applicability to the class of programs that can be handled by the analysis (independently from precision and scalability issues). This thesis addresses these aspects in the context of cost and termination analysis, from both practical and theoretical perspectives. For cost analysis, we concentrate on the problem of solving cost relations (a form of recurrence relations) into closed-form upper and lower bounds, which is the heart of most modern cost analyzers, and also where most of the precision and applicability limitations can be found. We develop tools, and their underlying theoretical foundations, for solving cost relations that overcome the limitations of existing approaches, and demonstrate superiority in both precision and applicability. A unique feature of our techniques is the ability to smoothly handle both lower and upper bounds, by reversing the corresponding notions in the underlying theory. For termination analysis, we study the hardness of the problem of deciding termination for a speci�c form of simple loops that arise in the context of cost analysis. This study gives a better understanding of the (theoretical) limits of scalability and applicability for both termination and cost analysis.

Novel system for bite-force sensing and monitoring based on magnetic eear field communication

Intraoral devices for bite-force sensing have several applications in odontology and maxillofacial surgery, as bite-force measurements provide additional information to help understand the characteristics of bruxism disorders and can also be of help for the evaluation of post-surgical evolution and for comparison of alternative treatments. A new system for measuring human bite forces is proposed in this work. This system has future applications for the monitoring of bruxism events and as a complement for its conventional diagnosis. Bruxism is a pathology consisting of grinding or tight clenching of the upper and lower teeth, which leads to several problems such as lesions to the teeth, headaches, orofacial pain and important disorders of the temporomandibular joint. The prototype uses a magnetic field communication scheme similar to low-frequency radio frequency identification (RFID) technology (NFC). The reader generates a low-frequency magnetic field that is used as the information carrier and powers the sensor. The system is notable because it uses an intra-mouth passive sensor and an external interrogator, which remotely records and processes information regarding a patient?s dental activity. This permits a quantitative assessment of bite-force, without requiring intra-mouth batteries, and can provide supplementary information to polysomnographic recordings, current most adequate early diagnostic method, so as to initiate corrective actions before irreversible dental wear appears. In addition to describing the system?s operational principles and the manufacture of personalized prototypes, this report will also demonstrate the feasibility of the system and results from the first in vitro and in vivo trials.

Dynamic gamma frequency feedback coupling between higher and lower order visual cortices underlies perceptual completion in humans

To perceive a coherent environment, incomplete or overlapping visual forms must be integrated into meaningful coherent percepts, a process referred to as ?Gestalt? formation or perceptual completion. Increasing evidence suggests that this process engages oscillatory neuronal activity in a distributed neuronal assembly. A separate line of evidence suggests that Gestalt formation requires top-down feedback from higher order brain regions to early visual cortex. Here we combine magnetoencephalography (MEG) and effective connectivity analysis in the frequency domain to specifically address the effective coupling between sources of oscillatory brain activity during Gestalt formation. We demonstrate that perceptual completion of two-tone ?Mooney? faces induces increased gamma frequency band power (55?71 Hz) in human early visual, fusiform and parietal cortices. Within this distributed neuronal assembly fusiform and parietal gamma oscillators are coupled by forward and backward connectivity during Mooney face perception, indicating reciprocal influences of gamma activity between these higher order visual brain regions. Critically, gamma band oscillations in early visual cortex are modulated by top-down feedback connectivity from both fusiform and parietal cortices. Thus, we provide a mechanistic account of Gestalt perception in which gamma oscillations in feature sensitive and spatial attention-relevant brain regions reciprocally drive one another and convey global stimulus aspects to local processing units at low levels of the sensory hierarchy by top-down feedback. Our data therefore support the notion of inverse hierarchical processing within the visual system underlying awareness of coherent percepts.

An elicitor isolated from smut teliospores (Sporisorium scitamineum) enhances lignin deposition on the cell wall on both sclerenchyma and xylem in sugarcane leaves

Sugarcane leaf shows the classical arrangement of cells which defines a C4 species. Vascular bundles consist of xylem, phloem and fibres, surrounded by an outer layer of sclereids and an inner ring of stone cells associated with the phloem. Some sclereids located below and above the vascular bundles act as docking cells and connect the vascular bundle to the internal surfaces of upper and lower layers of the epidermis. A compact mass of sclereids occupies the total internal volume of the leaf edge. Neither docking cells nor the internal mass of sclereids in the edge were markedly coloured by acriflavin or phloroglucinol, indicating the absence of lignin in their cell walls. However, such staining indicated that fibres of the vascular bundle and the external layer of sclereids were strongly lignified. Incubation of leaf discs with an elicitor produced by the pathogen Sporisorium scitamineum increased the thickness of the lignified cell walls of sclereids as well as the mid and small xylem vessels, as a possible mechanical defense response to the potential entry of the pathogen.