Extending Learning Objects by Means of Social Networking

Learning objects have been the promise of providing people with high quality learning resources. Initiatives such as MIT Open-CourseWare, MERLOT and others have shown the real possibilities of creating and sharing knowledge through Internet. Thousands of educational resources are available through learning object repositories. We indeed live in an age of content abundance, and content can be considered as infrastructure for building adaptive and personalized learning paths, promoting both formal and informal learning. Nevertheless, although most educational institutions are adopting a more open approach, publishing huge amounts of educational resources, the reality is that these resources are barely used in other educational contexts. This paradox can be partly explained by the dificulties in adapting such resources with respect to language, e-learning standards and specifications and, finally, granularity. Furthermore, if we want our learners to use and take advantage of learning object repositories, we need to provide them with additional services than just browsing and searching for resources. Social networks can be a first step towards creating an open social community of learning around a topic or a subject. In this paper we discuss and analyze the process of using a learning object repository and building a social network on the top of it, with respect to the information architecture needed to capture and store the interaction between learners and resources in form of learning object metadata.

The Banzhaf Value in the Presence of Externalities

[eng] We propose two generalizations of the Banzhaf value for partition function form games. In both cases, our approach is based on probability distributions over the set of possible coalition structures that may arise for any given set of agents. First, we introduce a family of values, one for each collection of the latter probability distributions, defined as the Banzhaf value of an expected coalitional game. Then, we provide two characterization results for this new family of values within the framework of all partition function games. Both results rely on a property of neutrality with respect to amalgamation of players. Second, as this collusion transformation fails to be meaningful for simple games in partition function form, we propose another generalization of the Banzhaf value which also builds on probability distributions of the above type. This latter family is characterized by means of a neutrality property which uses an amalgamation transformation of players for which simple games are closed.

The Banzhaf Value in the Presence of Externalities

[eng] We propose two generalizations of the Banzhaf value for partition function form games. In both cases, our approach is based on probability distributions over the set of possible coalition structures that may arise for any given set of agents. First, we introduce a family of values, one for each collection of the latter probability distributions, defined as the Banzhaf value of an expected coalitional game. Then, we provide two characterization results for this new family of values within the framework of all partition function games. Both results rely on a property of neutrality with respect to amalgamation of players. Second, as this collusion transformation fails to be meaningful for simple games in partition function form, we propose another generalization of the Banzhaf value which also builds on probability distributions of the above type. This latter family is characterized by means of a neutrality property which uses an amalgamation transformation of players for which simple games are closed.

Prediction of the economic cost of individual long-term care in the Spanish population

Pensions together with savings and investments during active life are key elements of retirement planning. Motivation for personal choices about the standard of living, bequest and the replacement ratio of pension with respect to last salary income must be considered. This research contributes to the financial planning by helping to quantify long-term care economic needs. We estimate life expectancy from retirement age onwards. The economic cost of care per unit of service is linked to the expected time of needed care and the intensity of required services. The expected individual cost of long-term care from an onset of dependence is estimated separately for men and women. Assumptions on the mortality of the dependent people compared to the general population are introduced. Parameters defining eligibility for various forms of coverage by the universal public social care of the welfare system are addressed. The impact of the intensity of social services on individual predictions is assessed, and a partial coverage by standard private insurance products is also explored. Data were collected by the Spanish Institute of Statistics in two surveys conducted on the general Spanish population in 1999 and in 2008. Official mortality records and life table trends were used to create realistic scenarios for longevity. We find empirical evidence that the public long-term care system in Spain effectively mitigates the risk of incurring huge lifetime costs. We also find that the most vulnerable categories are citizens with moderate disabilities that do not qualify to obtain public social care support. In the Spanish case, the trends between 1999 and 2008 need to be further explored.

The orthogonal subcategory problem in homotopy theory

It is known that, in a locally presentable category, localization exists with respect to every set of morphisms, while the statement that localization with respect to every (possibly proper) class of morphisms exists in locally presentable categories is equivalent to a large-cardinal axiom from set theory. One proves similarly, on one hand, that homotopy localization exists with respect to sets of maps in every cofibrantly generated, left proper, simplicial model category M whose underlying category is locally presentable. On the other hand, as we show in this article, the existence of localization with respect to possibly proper classes of maps in a model category M satisfying the above assumptions is implied by a large-cardinal axiom called Vopënka's principle, although we do not know if the reverse implication holds. We also show that, under the same assumptions on M, every endofunctor of M that is idempotent up to homotopy is equivalent to localization with respect to some class S of maps, and if Vopënka's principle holds then S can be chosen to be a set. There are examples showing that the latter need not be true if M is not cofibrantly generated. The above assumptions on M are satisfied by simplicial sets and symmetric spectra over simplicial sets, among many other model categories.

Bounding right-arm rotation distances

Rotation distance quantifies the difference in shape between two rooted binary trees of the same size by counting the minimum number of elementary changes needed to transform one tree to the other. We describe several types of rotation distance, and provide upper bounds on distances between trees with a fixed number of nodes with respect to each type. These bounds are obtained by relating each restricted rotation distance to the word length of elements of Thompson's group F with respect to different generating sets, including both finite and infinite generating sets.

Computational explorations in Thompson's group F

Here we describe the results of some computational explorations in Thompson's group F. We describe experiments to estimate the cogrowth of F with respect to its standard finite generating set, designed to address the subtle and difficult question whether or not Thompson's group is amenable. We also describe experiments to estimate the exponential growth rate of F and the rate of escape of symmetric random walks with respect to the standard generating set.

Generating trees for permutations avoiding generalized patterns

We construct generating trees with with one, two, and three labels for some classes of permutations avoiding generalized patterns of length 3 and 4. These trees are built by adding at each level an entry to the right end of the permutation, which allows us to incorporate the adjacency condition about some entries in an occurrence of a generalized pattern. We use these trees to find functional equations for the generating functions enumerating these classes of permutations with respect to different parameters. In several cases we solve them using the kernel method and some ideas of Bousquet-Mélou [2]. We obtain refinements of known enumerative results and find new ones.

Aprendre a Ensenyar a Resoldre Problemes

La finalitat general del projecte és la millora de la formació dels estudiants de magisteri i de professorat, pel que fa a la seva visió i els seus coneixements sobre l'ensenyament i aprenentatge de les matemàtiques, a partir d'una redefinició de les diferents assignatures de didàctica de les matemàtiques. Es pren l'aprenentatge de l'ensenyament de la resolució de problemes com a eix vertebrador de les assignatures, introduint la realitat de l'aula per mitjà de la interpretació de casos professionals gravats en videoclips. El projecte pretén elaborar materials docents així com dissenyar i experimentar noves metodologies, tant en l'àmbit presencial com virtual, i al mateix temps fomentar la coordinació del professorat que imparteix les assignatures de didàctica. Tot el material es recollirà en una base de dades en l'ADRE, que permetrà la consulta tant presencial com virtual dels materials docents i casos professionals recollits per parts de l'alumnat i professorat. Els objectius a assolits responen a la finalitat del projecte i estan relacionats amb moltes de les prioritats de la convocatòria, ja que impliquen, entre altres coses, la producció de material docent, l’experimentació de noves metodologies i la interrelació entre teoria i pràctica professional.

Barcellona: osservazioni sulla letteratura riguardante i modelli di indirizzo dell'urbanistica negli ultimi 20 anni

This article proposes a synthetic examination of the modifications that can be found in the official City of Barcelona publications regarding urban transformations in the city in the last 20 years. The main objective is to understand the relationship between urban planning projects and the books published by the city’s various administrations, as well as correspondent urban and social policies. An attempt is made to analyse what has been the programmatic development in light of similar parameters of comparison based on a hypothesis in which the publications, like the projects, have a double role of synthesis with respect to the past and the construction of a collective imaginary on the city regarding the future

G+: Enhanced Traffic Grooming in WDM Mesh Networks using Lighttours

In this article, a new technique for grooming low-speed traffic demands into high-speed optical routes is proposed. This enhancement allows a transparent wavelength-routing switch (WRS) to aggregate traffic en route over existing optical routes without incurring expensive optical-electrical-optical (OEO) conversions. This implies that: a) an optical route may be considered as having more than one ingress node (all inline) and, b) traffic demands can partially use optical routes to reach their destination. The proposed optical routes are named "lighttours" since the traffic originating from different sources can be forwarded together in a single optical route, i.e., as taking a "tour" over different sources towards the same destination. The possibility of creating lighttours is the consequence of a novel WRS architecture proposed in this article, named "enhanced grooming" (G+). The ability to groom more traffic in the middle of a lighttour is achieved with the support of a simple optical device named lambda-monitor (previously introduced in the RingO project). In this article, we present the new WRS architecture and its advantages. To compare the advantages of lighttours with respect to classical lightpaths, an integer linear programming (ILP) model is proposed for the well-known multilayer problem: traffic grooming, routing and wavelength assignment The ILP model may be used for several objectives. However, this article focuses on two objectives: maximizing the network throughput, and minimizing the number of optical-electro-optical conversions used. Experiments show that G+ can route all the traffic using only half of the total OEO conversions needed by classical grooming. An heuristic is also proposed, aiming at achieving near optimal results in polynomial time

The demand elasticity on tolled motorways

This paper analyses the elasticities of demand in tolled motorways in Spain with respect to the main variables influencing it. The demand equation is estimated using a panel data set where the cross-section observations correspond to the different Spanish tolled motorways sections, and the temporal dimension ranges from the beginning of the eighties until the end of the nineties. The results show a high elasticity with respect to the economic activity level. The average elasticity with respect to petrol price falls around -0.3, while toll elasticities clearly vary across motorway sections. These motorway sections are classified into four groups according to the estimated toll elasticity with values that range from -0.21 for the most inelastic to -0.83 for the most elastic. The main factors that explain such differences are the quality of the alternative road and the length of the section. The long-term effect is about 50 per cent higher than the short term one; however, the period of adjustment is relatively short.

Tax evasion, technology shocks, and the cyclicality of government revenues

This paper analyzes the behavior of the tax revenue to output ratio over the business cycle. In order to replicate the empirical evidence, we develop a simple model combining the standard Ak growth model with the tax evasion phenomenon. When individuals conceal part of their true income from the tax authority, they face the risk of being audited and hence of paying the corresponding fine. Under the empirically plausible assumptions that the intertemporal elasticity of substitution exhibits a sufficiently small value and that productivity shocks are serially correlated, we show that the elasticity of government revenue with respect to output is larger than one, which agrees with the empirical evidence. This result holds even if the tax system displays flat tax rates. We extend the previous setup to generate larger fiscal deficits when the economy experiences a recession.

A subspace correction method for discontinuous Galerkin discretizations of linear elasticity equations

We study preconditioning techniques for discontinuous Galerkin discretizations of isotropic linear elasticity problems in primal (displacement) formulation. We propose subspace correction methods based on a splitting of the vector valued piecewise linear discontinuous finite element space, that are optimal with respect to the mesh size and the Lamé parameters. The pure displacement, the mixed and the traction free problems are discussed in detail. We present a convergence analysis of the proposed preconditioners and include numerical examples that validate the theory and assess the performance of the preconditioners.

Design of Novel Frequency Generation Circuit with Application to Ultra-Wideband Distributed Oscillators

Given the urgence of a new paradigm in wireless digital trasmission which should allow for higher bit rate, lower latency and tigher delay constaints, it has been proposed to investigate the fundamental building blocks that at the circuital/device level, will boost the change towards a more efficient network architecture, with high capacity, higher bandwidth and a more satisfactory end user experience. At the core of each transciever, there are inherently analog devices capable of providing the carrier signal, the oscillators. It is strongly believed that many limitations in today's communication protocols, could be relieved by permitting high carrier frequency radio transmission, and having some degree of reconfigurability. This led us to studying distributed oscillator architectures which work in the microwave range and possess wideband tuning capability. As microvave oscillators are essentially nonlinear devices, a full nonlinear analyis, synthesis, and optimization had to be considered for their implementation. Consequently, all the most used nonlinear numerical techniques in commercial EDA software had been reviewed. An application of all the aforementioned techniques has been shown, considering a systems of three coupled oscillator ("triple push" oscillator) in which the stability of the various oscillating modes has been studied. Provided that a certain phase distribution is maintained among the oscillating elements, this topology permits a rise in the output power of the third harmonic; nevertheless due to circuit simmetry, "unwanted" oscillating modes coexist with the intenteded one. Starting with the necessary background on distributed amplification and distributed oscillator theory, the design of a four stage reverse mode distributed voltage controlled oscillator (DVCO) using lumped elments has been presented. All the design steps have been reported and for the first time a method for an optimized design with reduced variations in the output power has been presented. Ongoing work is devoted to model a wideband DVCO and to implement a frequency divider.