Asynchronous growth and competition in a two-sex age-structured population model

Asynchronous exponential growth has been extensively studied in population dynamics. In this paper we find out the asymptotic behaviour in a non-linear age-dependent model which takes into account sexual reproduction interactions. The main feature of our model is that the non-linear process converges to a linear one as the solution becomes large, so that the population undergoes asynchronous growth. The steady states analysis and the corresponding stability analysis are completely made and are summarized in a bifurcation diagram according to the parameter R0. Furthermore the effect of intraspecific competition is taken into account, leading to complex dynamics around steady states.

Entorns col•laboratius virtuals asíncrons basats en Web i enfocats en la gestió del coneixement = Web-based Asynchronous Collaborative Environments Focused on Knowledge Management

Report for the scientific sojourn at the University of California at Berkeley, USA, from september 2007 until july 2008. Communities of Learning Practice is an innovative paradigm focused on providing appropriate technological support to both formal and especially informal learning groups who are chiefly formed by non-technical people and who lack of the necessary resources to acquire such systems. Typically, students who are often separated by geography and/or time have the need to meet each other after classes in small study groups to carry out specific learning activities assigned during the formal learning process. However, the lack of suitable and available groupware applications makes it difficult for these groups of learners to collaborate and achieve their specific learning goals. In addition, the lack of democratic decision-making mechanisms is a main handicap to substitute the central authority of knowledge presented in formal learning.

Metacognitive presence in asynchronous online learning environments : self, mutual and hetero-regulation

Peer-reviewed

On a size-structured two-phase population model with infinite states-at-birth

In this work we introduce and analyze a linear size-structured population model with infinite states-at-birth. We model the dynamics of a population in which individuals have two distinct life-stages: an “active” phase when individuals grow, reproduce and die and a second “resting” phase when individuals only grow. Transition between these two phases depends on individuals’ size. First we show that the problem is governed by a positive quasicontractive semigroup on the biologically relevant state space. Then we investigate, in the framework of the spectral theory of linear operators, the asymptotic behavior of solutions of the model. We prove that the associated semigroup has, under biologically plausible assumptions, the property of asynchronous exponential growth.

Estudi de la desadsorció del pirè amb diferents surfactants en tres sòls artificials

Un dels problemes associats a la remeiació de contaminants hidròfobs és la seva poca disponibilitat. Es considera que un contaminant està disponible quan roman a la fase líquida del medi, ja sigui solubilitzat o en forma d’emulsió. Els surfactants són substàncies anfifíliques que promouen la transferència de compostos hidròfobs de la fase sòlida a la líquida. En aquest estudi s’escull el pirè com a representant dels hidrocarburs aromàtics policíclics i tres surfactants no iònics: un àmpliament citat a la bibliografia científica (Tween 80) i dos comercials (Gold Crew, BS-400). L’estudi es fa amb tres mescles d’argila i sorra amb diferents proporcions. La concentració micel·lar crítica (CMC) s’assoleix abans en sòls amb poc contingut en argila. L’eficiència dels surfactants està estretament relacionada amb la proporció d’argila i sorra. A concentracions molt per sobre de la CMC no s’observa una relació entre l’eficiència i la quantitat d’argila. El Tween 80 ha donat millors resultats que el Gold Crew i el BS-400, sense que aquest darrer no hagi presentat desadsorció de pirè.

A numerical solver for a nonlinear Fokker-Planck equation representation of neuronal network dynamics

To describe the collective behavior of large ensembles of neurons in neuronal network, a kinetic theory description was developed in [13, 12], where a macroscopic representation of the network dynamics was directly derived from the microscopic dynamics of individual neurons, which are modeled by conductance-based, linear, integrate-and-fire point neurons. A diffusion approximation then led to a nonlinear Fokker-Planck equation for the probability density function of neuronal membrane potentials and synaptic conductances. In this work, we propose a deterministic numerical scheme for a Fokker-Planck model of an excitatory-only network. Our numerical solver allows us to obtain the time evolution of probability distribution functions, and thus, the evolution of all possible macroscopic quantities that are given by suitable moments of the probability density function. We show that this deterministic scheme is capable of capturing the bistability of stationary states observed in Monte Carlo simulations. Moreover, the transient behavior of the firing rates computed from the Fokker-Planck equation is analyzed in this bistable situation, where a bifurcation scenario, of asynchronous convergence towards stationary states, periodic synchronous solutions or damped oscillatory convergence towards stationary states, can be uncovered by increasing the strength of the excitatory coupling. Finally, the computation of moments of the probability distribution allows us to validate the applicability of a moment closure assumption used in [13] to further simplify the kinetic theory.

ideaD : aplicació per a l'intercanvi de documents en entorns asíncrons i distribuïts

El projecte ideaD és un entorn per a l'intercanvi de documents i informació en general per a grups de treball asíncrons i distribuïts. Entenem per asíncrons aquells grups els membres dels quals no es troben en un mateix moment del temps i distribuïts com a aquells en què la informació no es troba en un mateix lloc.

Desenvolupament d'una aplicació amb Microsoft.NET per a la gestió d'una protectora d'animals

La memòria de projecte de final de carrera objecte d'aquest document, sintetitza lasolució realitzada d'un portal Web per a la gestió d'una protectora d'animals amb la finalitat de fomentar i facilitar als usuaris, l'adopció d'animals abandonats.El portal Web té com a principals objectius, oferir una interfície gràfica fàcil de ferservir i intuïtiva en la interacció, per tal que tot tipus d'usuaris d'Internet senserestriccions de coneixements puguin gaudir amb comoditat del lloc. El resultat s'haobtingut fent ús de tecnologies basades amb la plataforma .NET de Microsoft com Visual Studio 2010 pel que fa al desenvolupament, AJAX (Asynchronous JavaScript And XML) pel que fa a l'actualització asíncrona dels continguts de les pàgines, i Microsoft SQL Server com a motor de la base de dades.

Document Management in the Open University of Catalunya (UOC) Classrooms

A través dels seus serveis de gestió documental a les aules de la Universitat Oberta de Catalunya (Universitat Oberta de Catalunya, UOC), la Biblioteca de la UOC actua com un veritable facilitador de l'aprenentatge i l'ensenyament i té un paper central en el model de aprenentatge de la universitat. A més a més, serveix com un model a seguir per altres biblioteques universitàries en termes del que s'espera d'elles en el marc del nou Espai Europeu d'Educació Superior (EEES) i la creixent necessitat que funcionin com a centres de recursos d'aprenentatge. Contribuint a l'èxit de la biblioteca, el model d'aprenentatge i ensenyament de la UOC crea un entorn d'aprenentatge virtual i asíncron per als estudiants, i permet a la biblioteca de la UOC ser present en totes les seves aules.

Resource dimensioning aspect of heterogeneous traffic with different service requirements: Integration versus segregation

In this paper, we consider the ATM networks in which the virtual path concept is implemented. The question of how to multiplex two or more diverse traffic classes while providing different quality of service requirements is a very complicated open problem. Two distinct options are available: integration and segregation. In an integration approach all the traffic from different connections are multiplexed onto one VP. This implies that the most restrictive QOS requirements must be applied to all services. Therefore, link utilization will be decreased because unnecessarily stringent QOS is provided to all connections. With the segregation approach the problem can be much simplified if different types of traffic are separated by assigning a VP with dedicated resources (buffers and links). Therefore, resources may not be efficiently utilized because no sharing of bandwidth can take place across the VP. The probability that the bandwidth required by the accepted connections exceeds the capacity of the link is evaluated with the probability of congestion (PC). Since the PC can be expressed as the CLP, we shall simply carry out bandwidth allocation using the PC. We first focus on the influence of some parameters (CLP, bit rate and burstiness) on the capacity required by a VP supporting a single traffic class using the new convolution approach. Numerical results are presented both to compare the required capacity and to observe which conditions under each approach are preferred

An ATM distributed simulator for network management research

Due to the high cost of a large ATM network working up to full strength to apply our ideas about network management, i.e., dynamic virtual path (VP) management and fault restoration, we developed a distributed simulation platform for performing our experiments. This platform also had to be capable of other sorts of tests, such as connection admission control (CAC) algorithms, routing algorithms, and accounting and charging methods. The platform was posed as a very simple, event-oriented and scalable simulation. The main goal was the simulation of a working ATM backbone network with a potentially large number of nodes (hundreds). As research into control algorithms and low-level, or rather cell-level methods, was beyond the scope of this study, the simulation took place at a connection level, i.e., there was no real traffic of cells. The simulated network behaved like a real network accepting and rejecting SNMP ones, or experimental tools using the API node

Full label space reduction in MPLS networks: asymmetric merged tunneling

Traffic Engineering objective is to optimize network resource utilization. Although several works have been published about minimizing network resource utilization in MPLS networks, few of them have been focused in LSR label space reduction. This letter studies Asymmetric Merged Tunneling (AMT) as a new method for reducing the label space in MPLS network. The proposed method may be regarded as a combination of label merging (proposed in the MPLS architecture) and asymmetric tunneling (proposed recently in our previous works). Finally, simulation results are performed by comparing AMT with both ancestors. They show a great improvement in the label space reduction factor

CAC controlled services sharing a link with connectionless data services in an ATM network: a performance evaluation study

In the B-ISDN there is a provision for four classes of services, all of them supported by a single transport network (the ATM network). Three of these services, the connected oriented (CO) ones, permit connection access control (CAC) but the fourth, the connectionless oriented (CLO) one, does not. Therefore, when CLO service and CO services have to share the same ATM link, a conflict may arise. This is because a bandwidth allocation to obtain maximum statistical gain can damage the contracted ATM quality of service (QOS); and vice versa, in order to guarantee the contracted QOS, the statistical gain have to be sacrificed. The paper presents a performance evaluation study of the influence of the CLO service on a CO service (a circuit emulation service or a variable bit-rate service) when sharing the same link

Bandwidth allocation based on real time calculations using the convolution approach

This paper focuses on one of the methods for bandwidth allocation in an ATM network: the convolution approach. The convolution approach permits an accurate study of the system load in statistical terms by accumulated calculations, since probabilistic results of the bandwidth allocation can be obtained. Nevertheless, the convolution approach has a high cost in terms of calculation and storage requirements. This aspect makes real-time calculations difficult, so many authors do not consider this approach. With the aim of reducing the cost we propose to use the multinomial distribution function: the enhanced convolution approach (ECA). This permits direct computation of the associated probabilities of the instantaneous bandwidth requirements and makes a simple deconvolution process possible. The ECA is used in connection acceptance control, and some results are presented

Multicast algorithms evaluation using an adaptative routing in ATM networks

This paper proposes a multicast implementation based on adaptive routing with anticipated calculation. Three different cost measures for a point-to-multipoint connection: bandwidth cost, connection establishment cost and switching cost can be considered. The application of the method based on pre-evaluated routing tables makes possible the reduction of bandwidth cost and connection establishment cost individually