A Hierarchical Architecture with Parallel Comunication for Implementing P Systems

Membrane systems are computational equivalent to Turing machines. However, its distributed and massively parallel nature obtain polynomial solutions opposite to traditional non-polynomial ones. Nowadays, developed investigation for implementing membrane systems has not yet reached the massively parallel character of this computational model. Better published approaches have achieved a distributed architecture denominated “partially parallel evolution with partially parallel communication” where several membranes are allocated at each processor, proxys are used to communicate with membranes allocated at different processors and a policy of access control to the communications is mandatory. With these approaches, it is obtained processors parallelism in the application of evolution rules and in the internal communication among membranes allocated inside each processor. Even though, external communications share a common communication line, needed for the communication among membranes arranged in different processors, are sequential. In this work, we present a new hierarchical architecture that reaches external communication parallelism among processors and substantially increases parallelization in the application of evolution rules and internal communications. Consequently, necessary time for each evolution step is reduced. With all of that, this new distributed hierarchical architecture is near to the massively parallel character required by the model.

Parametric pattern selection in a reaction-diffusion model

We compare spot patterns generated by Turing mechanisms with those generated by replication cascades, in a model one-dimensional reaction-diffusion system. We determine the stability region of spot solutions in parameter space as a function of a natural control parameter (feed-rate) where degenerate patterns with different numbers of spots coexist for a fixed feed-rate. While it is possible to generate identical patterns via both mechanisms, we show that replication cascades lead to a wider choice of pattern profiles that can be selected through a tuning of the feed-rate, exploiting hysteresis and directionality effects of the different pattern pathways.

Mode-locking via dissipative Faraday instability

Emergence of coherent structures and patterns at the nonlinear stage of modulation instability of a uniform state is an inherent feature of many biological, physical and engineering systems. There are several well-studied classical modulation instabilities, such as Benjamin-Feir, Turing and Faraday instability, which play a critical role in the self-organization of energy and matter in non-equilibrium physical, chemical and biological systems. Here we experimentally demonstrate the dissipative Faraday instability induced by spatially periodic zig-zag modulation of a dissipative parameter of the system - spectrally dependent losses - achieving generation of temporal patterns and high-harmonic mode-locking in a fibre laser. We demonstrate features of this instability that distinguish it from both the Benjamin-Feir and the purely dispersive Faraday instability. Our results open the possibilities for new designs of mode-locked lasers and can be extended to other fields of physics and engineering.

Dynamic instabilities in scalar neural field equations with space-dependent delays

In this paper we consider a class of scalar integral equations with a form of space-dependent delay. These non-local models arise naturally when modelling neural tissue with active axons and passive dendrites. Such systems are known to support a dynamic (oscillatory) Turing instability of the homogeneous steady state. In this paper we develop a weakly nonlinear analysis of the travelling and standing waves that form beyond the point of instability. The appropriate amplitude equations are found to be the coupled mean-field Ginzburg-Landau equations describing a Turing-Hopf bifurcation with modulation group velocity of O(1). Importantly we are able to obtain the coefficients of terms in the amplitude equations in terms of integral transforms of the spatio-temporal kernels defining the neural field equation of interest. Indeed our results cover not only models with axonal or dendritic delays but those which are described by a more general distribution of delayed spatio-temporal interactions. We illustrate the predictive power of this form of analysis with comparison against direct numerical simulations, paying particular attention to the competition between standing and travelling waves and the onset of Benjamin-Feir instabilities.

Modeling electrocortical activity through improved local approximations of integral neural field equations

Neural field models of firing rate activity typically take the form of integral equations with space-dependent axonal delays. Under natural assumptions on the synaptic connectivity we show how one can derive an equivalent partial differential equation (PDE) model that properly treats the axonal delay terms of the integral formulation. Our analysis avoids the so-called long-wavelength approximation that has previously been used to formulate PDE models for neural activity in two spatial dimensions. Direct numerical simulations of this PDE model show instabilities of the homogeneous steady state that are in full agreement with a Turing instability analysis of the original integral model. We discuss the benefits of such a local model and its usefulness in modeling electrocortical activity. In particular we are able to treat "patchy'" connections, whereby a homogeneous and isotropic system is modulated in a spatially periodic fashion. In this case the emergence of a "lattice-directed" traveling wave predicted by a linear instability analysis is confirmed by the numerical simulation of an appropriate set of coupled PDEs. Article published and (c) American Physical Society 2007

Damage and fracture algorithm using the screened Poisson equation and local remeshing

We propose a crack propagation algorithm which is independent of particular constitutive laws and specific element technology. It consists of a localization limiter in the form of the screened Poisson equation with local mesh refinement. This combination allows the cap- turing of strain localization with good resolution, even in the absence of a sufficiently fine initial mesh. In addition, crack paths are implicitly defined from the localized region, cir- cumventing the need for a specific direction criterion. Observed phenomena such as mul- tiple crack growth and shielding emerge naturally from the algorithm. In contrast with alternative regularization algorithms, curved cracks are correctly represented. A staggered scheme for standard equilibrium and screened equations is used. Element subdivision is based on edge split operations using a given constitutive quantity (either damage or void fraction). To assess the robustness and accuracy of this algorithm, we use both quasi-brittle benchmarks and ductile tests.

On Reasonable Space and Time Cost Models for the λ-Calculus

Slot and van Emde Boas Invariance Thesis states that a time (respectively, space) cost model is reasonable for a computational model C if there are mutual simulations between Turing machines and C such that the overhead is polynomial in time (respectively, linear in space). The rationale is that under the Invariance Thesis, complexity classes such as LOGSPACE, P, PSPACE, become robust, i.e. machine independent. In this dissertation, we want to find out if it possible to define a reasonable space cost model for the lambda-calculus, the paradigmatic model for functional programming languages. We start by considering an unusual evaluation mechanism for the lambda-calculus, based on Girard's Geometry of Interaction, that was conjectured to be the key ingredient to obtain a space reasonable cost model. By a fine complexity analysis of this schema, based on new variants of non-idempotent intersection types, we disprove this conjecture. Then, we change the target of our analysis. We consider a variant over Krivine's abstract machine, a standard evaluation mechanism for the call-by-name lambda-calculus, optimized for space complexity, and implemented without any pointer. A fine analysis of the execution of (a refined version of) the encoding of Turing machines into the lambda-calculus allows us to conclude that the space consumed by this machine is indeed a reasonable space cost model. In particular, for the first time we are able to measure also sub-linear space complexities. Moreover, we transfer this result to the call-by-value case. Finally, we provide also an intersection type system that characterizes compositionally this new reasonable space measure. This is done through a minimal, yet non trivial, modification of the original de Carvalho type system.

La Teoria della Calcolabilità nelle scuole secondarie di secondo grado: una proposta didattica

Nonostante l'utilizzo di strumenti informatici nella pratica didattica della matematica sia ormai ampiamente diffuso, l'insegnamento dei principi matematici dell'informatica è preso meno in considerazione anche a causa dei pochi punti di contatto nelle "Indicazioni Nazionali" tra le due materie, matematica e informatica, che sono invece intimamente correlate. Questa tesi descrive una attività didattica incentrata sul concetto di calcolabilità e computabilità e basata sul noto formalismo delle Macchine di Turing. É nostra opinione che coinvolgere gli studenti in tali tipologie di attività possa stimolare oltre all'apprendimento di competenze disciplinari, anche lo sviluppo di importanti competenze trasversali, in primis, il problem solving. L’attività proposta nella tesi è stata realizzata in una classe terza di un istituto tecnico economico dove, a seguito di una spiegazione dell’argomento, sono stati svolti due esercizi di gruppo, utilizzando il software \emph{Turing Machine Visualization}, che permette agli studenti e al docente di avere un supporto visuale al dialogo. Al termine dell’attività didattica è stato somministrato agli studenti un questionario che ha permesso di valutare le competenze acquisite da due prospettive distinte: soggettiva e oggettiva. I risultati del questionario sono ampliamente analizzati e discussi nella tesi.

Traveling waves nei modelli di reazione e diffusione. Il modello di Tuckwell-Miura per la Cortical Spreading Depression

In questa tesi viene discusso il ruolo delle equazioni di diffusione e reazione e delle loro soluzioni di tipo traveling waves in alcuni modelli matematici per le scienze biomediche. Prima di tutto, viene analizzata l’equazione di Fisher-Kolmogorov-Petrovskii-Piskunov, che costituisce il prototipo di pdes di diffusione e reazione ad una specie. In seguito, si determinano condizioni per la nascita di instabilità di Turing nei modelli a due specie interagenti. La nostra attenzione si rivolge poi ai sistemi di diffusione e reazione con termini sorgente degeneri e caratterizzati dal possedere una famiglia di stati di equilibrio che dipende in modo continuo da un insieme di parametri. Si studiano gli effetti che una perturbazione ampia e fortemente localizzata di una delle popolazioni ha sulle soluzioni di tali sistemi e si ricavano condizioni affinché si generino traveling waves. Da ultimo, come applicazione degli studi effettuati, si analizza il modello di Tuckwell-Miura per la cortical spreading depression, un fenomeno in cui un’onda di depolarizzazione si propaga nelle cellule nervose della corteccia cerebrale.