ACACIA: an agent-based program for simulating behavior to reach long-term goals

We present ACACIA, an agent-based program implemented in Java StarLogo 2.0 that simulates a two-dimensional microworld populated by agents, obstacles and goals. Our program simulates how agents can reach long-term goals by following sensorial-motor couplings (SMCs) that control how the agents interact with their environment and other agents through a process of local categorization. Thus, while acting in accordance with this set of SMCs, the agents reach their goals through the emergence of global behaviors. This agent-based simulation program would allow us to understand some psychological processes such as planning behavior from the point of view that the complexity of these processes is the result of agent-environment interaction.

Aplicaciones Single Program Multiple Data (SPMD) en ambientes distribuidos

Un reto al ejecutar las aplicaciones en un cluster es lograr mejorar las prestaciones utilizando los recursos de manera eficiente, y este reto es mayor al utilizar un ambiente distribuido. Teniendo en cuenta este reto, se proponen un conjunto de reglas para realizar el cómputo en cada uno de los nodos, basado en el análisis de cómputo y comunicaciones de las aplicaciones, se analiza un esquema de mapping de celdas y un método para planificar el orden de ejecución, tomando en consideración la ejecución por prioridad, donde las celdas de fronteras tienen una mayor prioridad con respecto a las celdas internas. En la experimentación se muestra el solapamiento del computo interno con las comunicaciones de las celdas fronteras, obteniendo resultados donde el Speedup aumenta y los niveles de eficiencia se mantienen por encima de un 85%, finalmente se obtiene ganancias de los tiempos de ejecución, concluyendo que si se puede diseñar un esquemas de solapamiento que permita que la ejecución de las aplicaciones SPMD en un cluster se hagan de forma eficiente.

The Electoral Determinants of Collective Remittances: The Mexican 3x1 Program for Migrants

The 3x1 Program for Migrants is a matching grant scheme that seeks to direct the money sent by migrant organizations abroad to the provision of public and social infrastructure, and to productive projects in migrants’ communities of origin. To do so, the municipal, state, and federal administrations match the amount sent by hometown associations by 3 to 1. This opens the door to the political manipulation of the program. We explore the impact of a particular facet of Mexican political life on the operation of the 3x1: its recent democratization and the increasing political competition at the municipal level. Relying on the literature on redistributive politics, we posit that an increasing number of effective parties in elections may have two different effects. On the one hand, the need to cater to more heterogeneous constituencies may increase the provision of public projects. On the other hand, since smaller coalitions are needed to win elections under tighter competition, fewer public and more private (clientelistic) projects could be awarded. Using a unique dataset on the 3x1 Program for Migrants for over 2,400 municipalities in the period 2002 through 2007, we find a lower provision of public goods in electorally competitive jurisdictions. Thus, we remain sceptical about the program success in promoting public goods in politically competitive locations with high migration levels.

Análisis de rendimiento de aplicaciones paralelas de memoria compartida: problema N-body

Este trabajo analiza el rendimiento de cuatro nodos de cómputo multiprocesador de memoria compartida para resolver el problema N-body. Se paraleliza el algoritmo serie, y se codifica usando el lenguaje C extendido con OpenMP. El resultado son dos variantes que obedecen a dos criterios de optimización diferentes: minimizar los requisitos de memoria y minimizar el volumen de cómputo. Posteriormente, se realiza un proceso de análisis de las prestaciones del programa sobre los nodos de cómputo. Se modela el rendimiento de las variantes secuenciales y paralelas de la aplicación, y de los nodos de cómputo; se instrumentan y ejecutan los programas para obtener resultados en forma de varias métricas; finalmente se muestran e interpretan los resultados, proporcionando claves que explican ineficiencias y cuellos de botella en el rendimiento y posibles líneas de mejora. La experiencia de este estudio concreto ha permitido esbozar una incipiente metodología de análisis de rendimiento, identificación de problemas y sintonización de algoritmos a nodos de cómputo multiprocesador de memoria compartida.

Aplicación para la gestión de un sistema de incidencias de un almacén robotizado

Aquest projecte té com objectiu fer un sistema d’incidències pel control d’un magatzem robotitzat i del cost que comporta la resolució d’aquestes. D’aquesta manera es pretén canviar un mètode de treball rudimentari, passant a un altre totalment estructurat que serveixi per millorar el actual. Per això s’ha creat una aplicació basada en la tecnologia JSF, què permet aconseguir els nostres objectius. L’aplicació inclou una base de dades feta en PostGres SQL on es guardarà tota la informació que s’utilitza en la nostra aplicació. En aquesta memòria s’ha volgut explicar quins han estat els diferents passos que es van donar per poder assolir tots els nostres objectius. En la primera part realitzem una introducció a la situació del problema que es vol solucionar i descriurem els objectius que en hem marcat. Seguidament s’analitzen els requeriments i es detalla com s’implementen les diferents parts de l’aplicació. Per acabar parlem sobre el procés de testing realitzat que ens assegura el correcte funcionament del programa. Resumint, el objectiu principal d’aquest projecte consisteix en crear una eina que a la vegada que facilita la feina dels treballadors del magatzem, serveixi per al control de tot el sistema de treball als directius de l’empresa.

Individualització de la programació docent de Fonaments de Computadors

La metodologia docent impulsada per la creació d’un Espai Europeu d’Ensenyament Superior comú implica tenir en compte el treball de l’estudiant. En aquest sentit, resulta molt convenient facilitar a l’alumnat de primers cursos l’adaptació a una docència que s’organitza en crèdits ECTS i que se centra en el procés d’aprenentatge dels estudiants. Per aquest motiu, l’objectiu d’aquest projecte ha estat que assumissin un grau més elevat de responsabilitat en l’aprenentatge i que adquirissin una competència més gran en l’organització del temps d’acord amb els programes docents de les assignatures que cursessin. Per aconseguir-ho, s’ha creat un entorn de presentació de les guies docents basat en les agendes d’activitats d’aprenentatge. Aquestes agendes són, de fet, planificacions de les activitats presencials i no presencials que han de dur a terme els estudiants per assolir els objectius de cadascuna de les assignatures que fan. Perquè siguin efectives, han de ser el més individuals possibles i amb la informació suficient com perquè les activitats es puguin dur a terme. Així, els alumnes disposen d’una veritable agenda particular del què han de fer i quan per seguir una assignatura determinada. Com a resultat del projecte s’ha proposat una organització de la informació d’una assignatura que facilita tant la gestió de les guies docents com la creació d’agendes d’activitats d’aprenentatge, s’ha establert una metodologia de presentació dels programes docents amb suport de web perquè sigui de fàcil consulta i en els que els vincles de cada activitat s’activen segons el ritme del curs i, finalment, s’ha aplicat tot per al cas de l’assignatura de Fonaments de computadors, aconseguint que l’alumnat s’acostumi a seguir les agendes d’activitats i, consegüentment, a millorar el rendiment acadèmic de l’assignatura, que era el que, es pretenia originalment.

Including the workload effect in the parallel program signature

Performance prediction and application behavior modeling have been the subject of exten- sive research that aim to estimate applications performance with an acceptable precision. A novel approach to predict the performance of parallel applications is based in the con- cept of Parallel Application Signatures that consists in extract an application most relevant parts (phases) and the number of times they repeat (weights). Executing these phases in a target machine and multiplying its exeuction time by its weight an estimation of the application total execution time can be made. One of the problems is that the performance of an application depends on the program workload. Every type of workload affects differently how an application performs in a given system and so affects the signature execution time. Since the workloads used in most scientific parallel applications have dimensions and data ranges well known and the behavior of these applications are mostly deterministic, a model of how the programs workload affect its performance can be obtained. We create a new methodology to model how a program’s workload affect the parallel application signature. Using regression analysis we are able to generalize each phase time execution and weight function to predict an application performance in a target system for any type of workload within predefined range. We validate our methodology using a synthetic program, benchmarks applications and well known real scientific applications.

Structuring OER Using Learning Trajectories

The Wikiwijs program in the Netherlands is experimenting in structuring a repository with digital learning materials by labelling these materials with the learning goals and subjects handled by it. This makes it possible to create an interdependent arrangement of learning materials as building blocks for a curriculum. Such arrangements are called learning trajectories. A datamodel is presented in which the entities involved and their relationships are depicted. A first implementation of this is realized and published in September 2010.

Computing infinite plans for LTL goals using a classical planner

Classical planning has been notably successful in synthesizing finite plans to achieve states where propositional goals hold. In the last few years, classical planning has also been extended to incorporate temporally extended goals, expressed in temporal logics such as LTL, to impose restrictions on the state sequences generated by finite plans. In this work, we take the next step and consider the computation of infinite plans for achieving arbitrary LTL goals. We show that infinite plans can also be obtained efficiently by calling a classical planner once over a classical planning encoding that represents and extends the composition of the planningdomain and the B¨uchi automaton representingthe goal. This compilation scheme has been implemented and a number of experiments are reported.

A comment on the Nash program and the theory of implementation

The mechanisms in the Nash program for cooperative games are madecompatible with the framework of the theory of implementation. This is donethrough a reinterpretation of the characteristic function that avoids feasibilityproblems, thereby allowing an analysis that focuses exclusively on the payoff space. In this framework, we show that the core is the only majorcooperative solution that is Maskin monotonic. Thus, implementation of mostcooperative solutions must rely on refinements of the Nash equilibrium concept(like most papers in the Nash program do). Finally, the mechanisms in theNash program are adapted into the model.

Invariance and randomness in the Nash program for coalitional games

By introducing physical outcomes in coalitional games we note that coalitional games and social choice problems are equivalent (implying that so are the theory of implementation and the Nash program). This facilitates the understanding of the role of invariance and randomness in the Nash program. Also, the extent to which mechanisms in the Nash program perform ``real implementation'' is examined.

The impact of interest-rate subsidies on long-term household debt: Evidence from a large program

The responsiveness of long-term household debt to the interest rate is acrucial parameter for assessing the effectiveness of public policies aimedat promoting specific types of saving. This paper estimates the effect ofa reform of Credito Bonificado, a large program in Portugal that subsidizedmortgage interest rates, on long-term household debt. The reform establisheda ceiling in the price of the house that could be financed through theprogram, and provides plausibly exogenous variation in incentives. Usinga unique dataset of matched household survey data and administrative recordsof debt, we document a large decrease in the probability of signing a newloan after the removal of the subsidy.

The organization of research corporations and researcher ability

This paper analyzes the formation of Research Corporations as an alternative governance structure for performing R&D compared to pursuing in-house R&D projects. Research Corporations are privatefor-profit research centers that bring together several firms with similar research goals. In a Research Corporation formal authority over the choice of projects is jointly exercised by the top management of the member firms. A private for-profit organization cannot commit not to interfere with the project choice of the researchers. However, increasing the number of member firms of the Research Corporation reduces the incentive of member firms to meddle with the research projects of researchers because exercising formal authority over the choice of research projects is a public good. The Research Corporation thus offers researchers greater autonomy than a single firm pursuing an identical research program in its in-house R&D department. This attracts higher ability researchers to the Research Corporation compared to the internal R&D department. The paper uses the theoretical model to analyze the organization of the Microelectronics and Computer Technology Corporation (MCC). The facts of this case confirm the existence of a tension between control over the choice of research projects and the ability of researchers that the organization is able to attract or hold onto.

An enhanced concave program relaxation for choice network revenue management

The network choice revenue management problem models customers as choosing from an offer-set, andthe firm decides the best subset to offer at any given moment to maximize expected revenue. The resultingdynamic program for the firm is intractable and approximated by a deterministic linear programcalled the CDLP which has an exponential number of columns. However, under the choice-set paradigmwhen the segment consideration sets overlap, the CDLP is difficult to solve. Column generation has beenproposed but finding an entering column has been shown to be NP-hard. In this paper, starting with aconcave program formulation based on segment-level consideration sets called SDCP, we add a class ofconstraints called product constraints, that project onto subsets of intersections. In addition we proposea natural direct tightening of the SDCP called ?SDCP, and compare the performance of both methodson the benchmark data sets in the literature. Both the product constraints and the ?SDCP method arevery simple and easy to implement and are applicable to the case of overlapping segment considerationsets. In our computational testing on the benchmark data sets in the literature, SDCP with productconstraints achieves the CDLP value at a fraction of the CPU time taken by column generation and webelieve is a very promising approach for quickly approximating CDLP when segment consideration setsoverlap and the consideration sets themselves are relatively small.

Socio-economic benefits of using space technologies to monitor and respond to earthquakes

Earthquakes represent a major hazard for populations around the world, causing frequent loss of life,human suffering and enormous damage to homes, other buildings and infrastructure. The Technology Resources forEarthquake Monitoring and Response (TREMOR) Team of 36 space professionals analysed this problem over thecourse of the International Space University Summer Session Program and published their recommendations in the formof a report. The TREMOR Team proposes a series of space- and ground-based systems to provide improved capabilityto manage earthquakes. The first proposed system is a prototype earthquake early-warning system that improves theexisting knowledge of earthquake precursors and addresses the potential of these phenomena. Thus, the system willat first enable the definitive assessment of whether reliable earthquake early warning is possible through precursormonitoring. Should the answer be affirmative, the system itself would then form the basis of an operational earlywarningsystem. To achieve these goals, the authors propose a multi-variable approach in which the system will combine,integrate and process precursor data from space- and ground-based seismic monitoring systems (already existing andnew proposed systems) and data from a variety of related sources (e.g. historical databases, space weather data, faultmaps). The second proposed system, the prototype earthquake simulation and response system, coordinates the maincomponents of the response phase to reduce the time delays of response operations, increase the level of precisionin the data collected, facilitate communication amongst teams, enhance rescue and aid capabilities and so forth. It isbased in part on an earthquake simulator that will provide pre-event (if early warning is proven feasible) and post-eventdamage assessment and detailed data of the affected areas to corresponding disaster management actors by means of ageographic information system (GIS) interface. This is coupled with proposed mobile satellite communication hubs toprovide links between response teams. Business- and policy-based implementation strategies for these proposals, suchas the establishment of a non-governmental organisation to develop and operate the systems, are included.