Hierachy-based methodology for producing educational contents with maximal reutilization

Computer based training or distance education are facing dramatic changes withthe advent of standardization efforts, some of them concentrating in maximal reuse.This is of paramount importance for a sustainable -cost affordable- production ofeducational materials. Reuse in itself should not be a goal, though, since manymethodological aspects might be lost. In this paper we propose two contentproduction approaches for the InterMediActor platform under a competence-basedmethodology: either a bottom-up approach where content is designed from scratchor a top-down methodology where existing material can be gradually adapted tofulfil requisites to be used with maximal flexibility into InterMediActor.

Asymptotic behaviour of the density in a parabolic SPDE

Consider the density of the solution $X(t,x)$ of a stochastic heat equation with small noise at a fixed $t\in [0,T]$, $x \in [0,1]$.In the paper we study the asymptotics of this density as the noise is vanishing. A kind of Taylor expansion in powers of the noiseparameter is obtained. The coefficients and the residue of the expansion are explicitly calculated.In order to obtain this result some type of exponential estimates of tail probabilities of the difference between the approximatingprocess and the limit one is proved. Also a suitable local integration by parts formula is developped.

Probabilistic maximal covering location-allocation models with constrained waiting time or queue length for congested systems

When dealing with the design of service networks, such as healthand EMS services, banking or distributed ticket selling services, thelocation of service centers has a strong influence on the congestion ateach of them, and consequently, on the quality of service. In this paper,several models are presented to consider service congestion. The firstmodel addresses the issue of the location of the least number of single--servercenters such that all the population is served within a standard distance,and nobody stands in line for a time longer than a given time--limit, or withmore than a predetermined number of other clients. We then formulateseveral maximal coverage models, with one or more servers per service center.A new heuristic is developed to solve the models and tested in a 30--nodesnetwork.

Modelling of weather radar echoes from anomalous propagation using a hybrid parabolic equation method and NWP model data

Contamination of weather radar echoes by anomalous propagation (anaprop) mechanisms remains a serious issue in quality control of radar precipitation estimates. Although significant progress has been made identifying clutter due to anaprop there is no unique method that solves the question of data reliability without removing genuine data. The work described here relates to the development of a software application that uses a numerical weather prediction (NWP) model to obtain the temperature, humidity and pressure fields to calculate the three dimensional structure of the atmospheric refractive index structure, from which a physically based prediction of the incidence of clutter can be made. This technique can be used in conjunction with existing methods for clutter removal by modifying parameters of detectors or filters according to the physical evidence for anomalous propagation conditions. The parabolic equation method (PEM) is a well established technique for solving the equations for beam propagation in a non-uniformly stratified atmosphere, but although intrinsically very efficient, is not sufficiently fast to be practicable for near real-time modelling of clutter over the entire area observed by a typical weather radar. We demonstrate a fast hybrid PEM technique that is capable of providing acceptable results in conjunction with a high-resolution terrain elevation model, using a standard desktop personal computer. We discuss the performance of the method and approaches for the improvement of the model profiles in the lowest levels of the troposphere.

The Lorenz-maximal core allocations and the kernel in some classes of assignment games

En aquest treball demostrem que en la classe de jocs d'assignació amb diagonal dominant (Solymosi i Raghavan, 2001), el repartiment de Thompson (que coincideix amb el valor tau) és l'únic punt del core que és maximal respecte de la relació de dominància de Lorenz, i a més coincideix amb la solucié de Dutta i Ray (1989), també coneguda com solució igualitària. En segon lloc, mitjançant una condició més forta que la de diagonal dominant, introduïm una nova classe de jocs d'assignació on cada agent obté amb la seva parella òptima almenys el doble que amb qualsevol altra parella. Per aquests jocs d'assignació amb diagonal 2-dominant, el repartiment de Thompson és l'únic punt del kernel, i per tant el nucleolo.

Poincaré is a subgroup of Galilei in one space dimension more

Through an imaginary change of coordinates, the ordinary Poincar algebra is shown to be a subalgebra of the Galilei one in four space dimensions. Through a subsequent contraction the remaining Lie generators are eliminated in a natural way. An application of these results to connect Galilean and relativistic field equations is discussed.

The Lorenz-maximal core allocations and the kernel in some classes of assignment games

En aquest treball demostrem que en la classe de jocs d'assignació amb diagonal dominant (Solymosi i Raghavan, 2001), el repartiment de Thompson (que coincideix amb el valor tau) és l'únic punt del core que és maximal respecte de la relació de dominància de Lorenz, i a més coincideix amb la solucié de Dutta i Ray (1989), també coneguda com solució igualitària. En segon lloc, mitjançant una condició més forta que la de diagonal dominant, introduïm una nova classe de jocs d'assignació on cada agent obté amb la seva parella òptima almenys el doble que amb qualsevol altra parella. Per aquests jocs d'assignació amb diagonal 2-dominant, el repartiment de Thompson és l'únic punt del kernel, i per tant el nucleolo.

A note on the Lorenz-maximal allocations in the imputation set

In this note we introduce the Lorenz stable set and provide an axiomatic characterization in terms of constrained egalitarianism and projection consistency. On the domain of all coalitional games, we find that this solution connects the weak constrained egalitarian solution (Dutta and Ray, 1989) with their strong counterpart (Dutta and Ray, 1991)

Synergies between optical and physical variables in intercepting parabolic targets.

Interception requires precise estimation of time-to-contact (TTC) information. A long-standing view posits that all relevant information for extracting TTC is available in the angular variables, which result from the projection of distal objecs on to the retina. The diferent timing models rooted in this tradition have consequently relied on combining visual angle and its rate of expansion in diferent ways with tau being the most well-known solution for TTC...

Corrigendum stable matchings and preferences of couples

We correct an omission in the definition of our domain of weakly responsive preferences introduced in Klaus and Klijn (2005) or KK05 for short. The proof of the existence of stable matchings (KK05, Theorem 3.3) and a maximal domain result (KK05, Theorem 3.5) are adjusted accordingly.

Scoring rules on dichotomous preferences

In this paper, we study individual incentives to report preferences truthfully for the special case when individuals have dichotomous preferences on the set of alternatives and preferences are aggregated in form of scoring rules. In particular, we show that (a) the Borda Count coincides with Approval Voting on the dichotomous preference domain, (b) the Borda Count is the only strategy-proof scoring rule on the dichotomous preference domain, and (c) if at least three individuals participate in the election, then the dichotomous preference domain is the unique maximal rich domain under which the Borda Count is strategy-proof.