The identity type weak factorisation system

We show that the classifying category C(T)of a dependent type theory T with axioms for identity types admits a nontrivial weak factorisation system. After characterising this weak factorisation system explicitly, we relate it to the homotopy theory of groupoids.

PERSONAL(ONTO) : Personalizing the Learning Process in Virtual Environments by means of Adaptive Formative Itineraries based on Reusable Learning Objects and Ontologies TIN2006-15107-C02

Personalization in e-learning allows the adaptation of contents, learning strategiesand educational resources to the competencies, previous knowledge or preferences of the student. This project takes a multidisciplinary perspective for devising standards-based personalization capabilities into virtual e-learning environments, focusing on the conceptof adaptive learning itinerary, using reusable learning objects as the basis of the system and using ontologies and semantic web technologies.

Adaptive intelligent agent approach to guide the web navigation on the PLAN-G distance learning platform

Hypermedia systems based on the Web for open distance education are becoming increasinglypopular as tools for user-driven access learning information. Adaptive hypermedia is a new direction in research within the area of user-adaptive systems, to increase its functionality by making it personalized [Eklu 961. This paper sketches a general agents architecture to include navigationaladaptability and user-friendly processes which would guide and accompany the student during hislher learning on the PLAN-G hypermedia system (New Generation Telematics Platform to Support Open and Distance Learning), with the aid of computer networks and specifically WWW technology [Marz 98-1] [Marz 98-2]. The PLAN-G actual prototype is successfully used with some informatics courses (the current version has no agents yet). The propased multi-agent system, contains two different types of adaptive autonomous software agents: Personal Digital Agents {Interface), to interacl directly with the student when necessary; and Information Agents (Intermediaries), to filtrate and discover information to learn and to adapt navigation space to a specific student

KAM theory for conformally symplectic systems

We present a KAM theory for some dissipative systems (geometrically, these are conformally symplectic systems, i.e. systems that transform a symplectic form into a multiple of itself). For systems with n degrees of freedom depending on n parameters we show that it is possible to find solutions with n-dimensional (Diophantine) frequencies by adjusting the parameters. We do not assume that the system is close to integrable, but we use an a-posteriori format. Our unknowns are a parameterization of the solution and a parameter. We show that if there is a sufficiently approximate solution of the invariance equation, which also satisfies some explicit non–degeneracy conditions, then there is a true solution nearby. We present results both in Sobolev norms and in analytic norms. The a–posteriori format has several consequences: A) smooth dependence on the parameters, including the singular limit of zero dissipation; B) estimates on the measure of parameters covered by quasi–periodic solutions; C) convergence of perturbative expansions in analytic systems; D) bootstrap of regularity (i.e., that all tori which are smooth enough are analytic if the map is analytic); E) a numerically efficient criterion for the break–down of the quasi–periodic solutions. The proof is based on an iterative quadratically convergent method and on suitable estimates on the (analytical and Sobolev) norms of the approximate solution. The iterative step takes advantage of some geometric identities, which give a very useful coordinate system in the neighborhood of invariant (or approximately invariant) tori. This system of coordinates has several other uses: A) it shows that for dissipative conformally symplectic systems the quasi–periodic solutions are attractors, B) it leads to efficient algorithms, which have been implemented elsewhere. Details of the proof are given mainly for maps, but we also explain the slight modifications needed for flows and we devote the appendix to present explicit algorithms for flows.

Clustering algorithms for anti-money laundering using graph theory and social network analysis

HEMOLIA (a project under European community’s 7th framework programme) is a new generation Anti-Money Laundering (AML) intelligent multi-agent alert and investigation system which in addition to the traditional financial data makes extensive use of modern society’s huge telecom data source, thereby opening up a new dimension of capabilities to all Money Laundering fighters (FIUs, LEAs) and Financial Institutes (Banks, Insurance Companies, etc.). This Master-Thesis project is done at AIA, one of the partners for the HEMOLIA project in Barcelona. The objective of this thesis is to find the clusters in a network drawn by using the financial data. An extensive literature survey has been carried out and several standard algorithms related to networks have been studied and implemented. The clustering problem is a NP-hard problem and several algorithms like K-Means and Hierarchical clustering are being implemented for studying several problems relating to sociology, evolution, anthropology etc. However, these algorithms have certain drawbacks which make them very difficult to implement. The thesis suggests (a) a possible improvement to the K-Means algorithm, (b) a novel approach to the clustering problem using the Genetic Algorithms and (c) a new algorithm for finding the cluster of a node using the Genetic Algorithm.

Implementation of zonal control algorithms in adaptive optical systems with sparse control matrices

Miralls deformables més i més grans, amb cada cop més actuadors estan sent utilitzats actualment en aplicacions d'òptica adaptativa. El control dels miralls amb centenars d'actuadors és un tema de gran interès, ja que les tècniques de control clàssiques basades en la seudoinversa de la matriu de control del sistema es tornen massa lentes quan es tracta de matrius de dimensions tan grans. En aquesta tesi doctoral es proposa un mètode per l'acceleració i la paral.lelitzacó dels algoritmes de control d'aquests miralls, a través de l'aplicació d'una tècnica de control basada en la reducció a zero del components més petits de la matriu de control (sparsification), seguida de l'optimització de l'ordenació dels accionadors de comandament atenent d'acord a la forma de la matriu, i finalment de la seva posterior divisió en petits blocs tridiagonals. Aquests blocs són molt més petits i més fàcils de fer servir en els càlculs, el que permet velocitats de càlcul molt superiors per l'eliminació dels components nuls en la matriu de control. A més, aquest enfocament permet la paral.lelització del càlcul, donant una com0onent de velocitat addicional al sistema. Fins i tot sense paral. lelització, s'ha obtingut un augment de gairebé un 40% de la velocitat de convergència dels miralls amb només 37 actuadors, mitjançant la tècnica proposada. Per validar això, s'ha implementat un muntatge experimental nou complet , que inclou un modulador de fase programable per a la generació de turbulència mitjançant pantalles de fase, i s'ha desenvolupat un model complert del bucle de control per investigar el rendiment de l'algorisme proposat. Els resultats, tant en la simulació com experimentalment, mostren l'equivalència total en els valors de desviació després de la compensació dels diferents tipus d'aberracions per als diferents algoritmes utilitzats, encara que el mètode proposat aquí permet una càrrega computacional molt menor. El procediment s'espera que sigui molt exitós quan s'aplica a miralls molt grans.

Large-system analysis of a CDMA dynamic channel under a Markovian input process

We study the minimum mean square error (MMSE) and the multiuser efficiency η of large dynamic multiple access communication systems in which optimal multiuser detection is performed at the receiver as the number and the identities of active users is allowed to change at each transmission time. The system dynamics are ruled by a Markov model describing the evolution of the channel occupancy and a large-system analysis is performed when the number of observations grow large. Starting on the equivalent scalar channel and the fixed-point equation tying multiuser efficiency and MMSE, we extend it to the case of a dynamic channel, and derive lower and upper bounds for the MMSE (and, thus, for η as well) holding true in the limit of large signal–to–noise ratios and increasingly large observation time T.

Social Security in Theory and Practice (II): Efficiency Theories, Narrative Theories, and Implications for Reform

166 countries have some kind of public old age pension. What economic forces create and sustain old age Social Security as a public program? Mulligan and Sala-i-Martin (1999b) document several of the internationally and historically common features of social security programs, and explore "political" theories of Social Security. This paper discusses the "efficiency theories", which view creation of the SS program as a full of partial solution to some market failure. Efficiency explanations of social security include the "SS as welfare for the elderly" the "retirement increases productivity to optimally manage human capital externalities", "optimal retirement insurance", the "prodigal father problem", the "misguided Keynesian", the "optimal longevity insurance", the "government economizing transaction costs", and the "return on human capital investment". We also analyze four "narrative" theories of social security: the "chain letter theory", the "lump of labor theory", the "monopoly capitalism theory", and the "Sub-but-Nearly-Optimal policy response to private pensions theory". The political and efficiency explanations are compared with the international and historical facts and used to derive implications for replacing the typical pay-as-you-go system with a forced savings plan. Most of the explanations suggest that forced savings does not increase welfare, and may decrease it.

Social security in theory and practice (II): Efficiency theories, narrative theories and implications for reform

166 countries have some kind of public old age pension. What economic forcescreate and sustain old age Social Security as a public program? Mulligan and Sala-i-Martin (1999b) document several of the internationally and historically common features of social security programs, and explore "political" theories of Social Security. This paper discusses the "efficiency theories", which view creation of the SS program as a full of partial solution to some market failure. Efficiency explanations of social security include the "SS as welfare for the elderly" the "retirement increases productivity to optimally manage human capital externalities", "optimal retirement insurance", the "prodigal father problem", the "misguided Keynesian", the "optimal longevity insurance", the "governmenteconomizing transaction costs", and the "return on human capital investment". We also analyze four "narrative" theories of social security: the "chain letter theory", the "lump of labor theory", the "monopoly capitalism theory", and the "Sub-but-Nearly-Optimal policy response to private pensions theory".The political and efficiency explanations are compared with the international and historical facts and used to derive implications for replacing the typical pay-as-you-go system with a forced savings plan. Most of the explanations suggest that forced savings does not increase welfare, and may decrease it.

Adaptive approach heuristics for the generalized assignment problem

The Generalized Assignment Problem consists in assigning a setof tasks to a set of agents with minimum cost. Each agent hasa limited amount of a single resource and each task must beassigned to one and only one agent, requiring a certain amountof the resource of the agent. We present new metaheuristics forthe generalized assignment problem based on hybrid approaches.One metaheuristic is a MAX-MIN Ant System (MMAS), an improvedversion of the Ant System, which was recently proposed byStutzle and Hoos to combinatorial optimization problems, and itcan be seen has an adaptive sampling algorithm that takes inconsideration the experience gathered in earlier iterations ofthe algorithm. Moreover, the latter heuristic is combined withlocal search and tabu search heuristics to improve the search.A greedy randomized adaptive search heuristic (GRASP) is alsoproposed. Several neighborhoods are studied, including one basedon ejection chains that produces good moves withoutincreasing the computational effort. We present computationalresults of the comparative performance, followed by concludingremarks and ideas on future research in generalized assignmentrelated problems.

Rational reasoning or adaptive behavior? Evidence from two-person beauty contest games

Many experiments have shown that human subjects do not necessarily behave in line with game theoretic assumptions and solution concepts. The reasons for this non-conformity are multiple. In this paper we study the argument whether a deviation from game theory is because subjects are rational, but doubt that others are rational as well, compared to the argument that subjects, in general, are boundedly rational themselves. To distinguish these two hypotheses, we study behavior in repeated 2-person and many-person Beauty-Contest-Games which are strategically different from one another. We analyze four different treatments and observe that convergence toward equilibrium is driven by learning through the information about the other player s choice and adaptation rather than self-initiated rational reasoning.

Social security in theory and practice (I): Facts and political theories

166 countries have some kind of public old age pension. What economic forcescreate and sustain old age Social Security as a public program? We document some of the internationally and historically common features of Social Security programs including explicit and implicit taxes on labor supply, pay-as-you-go features, intergenerational redistribution, benefits which areincreasing functions of lifetime earnings and not means-tested. We partition theories of Social Security into three groups: "political", "efficiency" and "narrative" theories. We explore three political theories in this paper: the majority rational voting model (with its two versions: "the elderly as the leaders of a winning coalition with the poor" and the "once and for all election" model), the "time-intensive model of political competition" and the "taxpayer protection model". Each of the explanations is compared with the international and historical facts. A companion paper explores the "efficiency" and "narrative" theories, and derives implicationsof all the theories for replacing the typical pay-as-you-go system with a forced savings plan.

Exact representation of antenna system diversity performance from input parameter description

A simplc formulation Io compute thc envelope correlation of anantenna divemiry system is dcrired. 11 is shown how to compute theenvelope correlation hom the S-parameter descnplian of the antennasystem. This approach has the advantage that i t does not require thecomputation nor the measurement of the radiation panem of theantenna system. It also offers the advantage of providing a clcaunderstanding ofthe effects ofmutual coupling and input match on thediversity performance of the antcnnii system.

Aplicaciones educativas de la teoría vygotskiana. El programa 'Key to learning' = Applications of vigotsky's theory to education. The 'Key to learning' proggram

En ciencias de la educación, las últimas décadas han estado marcadas por un interés en las ideas de Lev S. Vygotski. De hecho, a partir de esas ideas se han propuesto varias aplicaciones educativas. Una de ellas es el “Key to learning”. El artículo propone una visión general de este programa educativo desarrollado a partir de algunos trabajos e ideas de autores rusos contemporáneos. Primero, desarrollamos algunas ideas en torno a la noción de zona de desarrollo próximo (ZpD). Después, sugerimos la teoría de las habilidades de aprendizaje. En este sentido, el objetivo principal de “Key to learning” es mejorar las habilidades de aprendizaje cognitivas, comunicativas y directivas de niños de entre 3 a 7 años de edad. Para este propósito son creadas 12 unidades curriculares que componen el programa. Para concluir se enfatiza la creación de zonas de desarrollo próximo estructuradas como parte de un sistema de enseñanza y aprendizaje que vincula la actividad, la asistencia y la agencia

Towards a theory of the credit-risk balance sheet

This article designs what it calls a Credit-Risk Balance Sheet (the risk being that of default by customers), a tool which, in principle, can contribute to revealing, controlling and managing the bad debt risk arising from a company¿s commercial credit, whose amount can represent a significant proportion of both its current and total assets.To construct it, we start from the duality observed in any credit transaction of this nature, whose basic identity can be summed up as Credit = Risk. ¿Credit¿ is granted by a company to its customer, and can be ranked by quality (we suggest the credit scoring system) and ¿risk¿ can either be assumed (interiorised) by the company itself or transferred to third parties (exteriorised).What provides the approach that leads to us being able to talk with confidence of a real Credit-Risk Balance Sheet with its methodological robustness is that the dual vision of the credit transaction is not, as we demonstrate, merely a classificatory duality (a double risk-credit classification of reality) but rather a true causal relationship, that is, a risk-credit causal duality.Once said Credit-Risk Balance Sheet (which bears a certain structural similarity with the classic net asset balance sheet) has been built, and its methodological coherence demonstrated, its properties ¿static and dynamic¿ are studied.Analysis of the temporal evolution of the Credit-Risk Balance Sheet and of its applications will be the object of subsequent works.