Price regulation of plastic money: A critical assessment of Spanish rules

Recent decisions by the Spanish national competition authority (TDC) mandate paymentsystems to include only two costs when setting their domestic multilateral interchange fees(MIF): a fixed processing cost and a variable cost for the risk of fraud. This artificiallowering of MIFs will not lower consumer prices, because of uncompetitive retailing; but itwill however lead to higher cardholders fees and, likely, new prices for point of saleterminals, delaying the development of the immature Spanish card market. Also, to the extent that increased cardholders fees do not offset the fall in MIFs revenue, the task of issuing new cards will be underpaid relatively to the task of acquiring new merchants, causing an imbalance between the two sides of the networks. Moreover, the pricing scheme arising from the decisions will cause unbundling and underprovision of those services whose costs are excluded. Indeed, the payment guarantee and the free funding period will tend to be removed from the package of services currently provided, to be either provided by third parties, by issuers for a separate fee, or not provided at all, especially to smaller and medium-sized merchants. Transaction services will also suffer the consequences that the TDC precludes pricing them in variable terms.

Stochastic evolution of rules for playing normal form games

The evolution of boundedly rational rules for playing normal form games is studied within stationary environments ofstochastically changing games. Rules are viewed as algorithms prescribing strategies for the different normal formgames that arise. It is shown that many of the folk results of evolutionary game theory typically obtained witha fixed game and fixed strategies carry over to the present case. The results are also related to recent experimentson rules and games.

MSISpIC: A Probabilistic Scan Matching Algorithm Using a Mechanical Scanned Imaging Sonar

This paper compares two well known scan matching algorithms: the MbICP and the pIC. As a result of the study, it is proposed the MSISpIC, a probabilistic scan matching algorithm for the localization of an Autonomous Underwater Vehicle (AUV). The technique uses range scans gathered with a Mechanical Scanning Imaging Sonar (MSIS), and the robot displacement estimated through dead-reckoning with the help of a Doppler Velocity Log (DVL) and a Motion Reference Unit (MRU). The proposed method is an extension of the pIC algorithm. Its major contribution consists in: 1) using an EKF to estimate the local path traveled by the robot while grabbing the scan as well as its uncertainty and 2) proposing a method to group into a unique scan, with a convenient uncertainty model, all the data grabbed along the path described by the robot. The algorithm has been tested on an AUV guided along a 600m path within a marina environment with satisfactory results

Transformation rules form OntoProcED to OntoOKI

This file contains the transformtion rules in SWRL to translate formal specifications of two lower ontology levels (patterns and organization) to the upper level (implementation according to the OKI specification).

The European sugar regime new legislation and wto rules

[cat] El 20 de febrer de 2006 es va aprovar el Reglament núm. 318/2006 del Consell que reforma l'Organització Comuna de Mercats del sucre. L'article analitza els canvis introduïts en el nou règim europeu del sucre i valora la seva adequació a les normes i demandes internacionals de liberalització del comerç agrícola. Es conclou que la reforma ha estat el mínim necessari per fer front als reptes internacionals: la recent resolució de l'Òrgan de Solució de Diferències de l'Organització Mundial del Comerç i les demandes de liberalització plantejades en el marc de la Ronda de Doha.

The European sugar regime new legislation and wto rules

[cat] El 20 de febrer de 2006 es va aprovar el Reglament núm. 318/2006 del Consell que reforma l'Organització Comuna de Mercats del sucre. L'article analitza els canvis introduïts en el nou règim europeu del sucre i valora la seva adequació a les normes i demandes internacionals de liberalització del comerç agrícola. Es conclou que la reforma ha estat el mínim necessari per fer front als reptes internacionals: la recent resolució de l'Òrgan de Solució de Diferències de l'Organització Mundial del Comerç i les demandes de liberalització plantejades en el marc de la Ronda de Doha.

Surface collective oscillations of metal clusters and spheres: Random-phase-approximation sum-rules approach

Using the once and thrice energy-weighted moments of the random-phase-approximation strength function, we have derived compact expressions for the average energy of surface collective oscillations of clusters and spheres of metal atoms. The L=0 volume mode has also been studied. We have carried out quantal and semiclassical calculations for Na and Ag systems in the spherical-jellium approximation. We present a rather thorough discussion of surface diffuseness and quantal size effects on the resonance energies.

Sum rules and short-range correlations in nuclear matter at finite temperature

The nucleon spectral function in nuclear matter fulfills an energy weighted sum rule. Comparing two different realistic potentials, these sum rules are studied for Greens functions that are derived self-consistently within the T matrix approximation at finite temperature.

Sum rules and correlations in asymmetric nuclear matter

The neutron and proton single-particle spectral functions in asymmetric nuclear matter fulfill energy-weighted sum rules. The validity of these sum rules within the self-consistent Green's function approach is investigated. The various contributions to these sum rules and their convergence as a function of energy provide information about correlations induced by the realistic interaction between the nucleons. The study of the sum rules in asymmetric nuclear matter exhibits the isospin dependence of the nucleon-nucleon correlations.

Energy-weighted sum rules for mesons in hot and dense matter

We study energy-weighted sum rules of the pion and kaon propagator in nuclear matter at finite temperature. The sum rules are obtained from matching the Dyson form of the meson propagator with its spectral Lehmann representation at low and high energies. We calculate the sum rules for specific models of the kaon and pion self-energy. The in-medium spectral densities of the K and (K) over bar mesons are obtained from a chiral unitary approach in coupled channels that incorporates the S and P waves of the kaon-nucleon interaction. The pion self-energy is determined from the P-wave coupling to particle-hole and Delta-hole excitations, modified by short-range correlations. The sum rules for the lower-energy weights are fulfilled satisfactorily and reflect the contributions from the different quasiparticle and collective modes of the meson spectral function. We discuss the sensitivity of the sum rules to the distribution of spectral strength and their usefulness as quality tests of model calculations.

The Uncertain generalized probabilistic weighted average and its application in the theory of expertons

A new model for dealing with decision making under risk by considering subjective and objective information in the same formulation is here presented. The uncertain probabilistic weighted average (UPWA) is also presented. Its main advantage is that it unifies the probability and the weighted average in the same formulation and considering the degree of importance that each case has in the analysis. Moreover, it is able to deal with uncertain environments represented in the form of interval numbers. We study some of its main properties and particular cases. The applicability of the UPWA is also studied and it is seen that it is very broad because all the previous studies that use the probability or the weighted average can be revised with this new approach. Focus is placed on a multi-person decision making problem regarding the selection of strategies by using the theory of expertons.

mGPT: a probabilistic planner based on heuristic search

We describe the version of the GPT planner to be used in the planning competition. This version, called mGPT, solves mdps specified in the ppddllanguage by extracting and using different classes of lower bounds, along with various heuristic-search algorithms. The lower bounds are extracted from deterministic relaxations of the mdp where alternativeprobabilistic effects of an action are mapped into different, independent, deterministic actions. The heuristic-search algorithms, on the other hand, use these lower bounds for focusing the updates and delivering a consistent value function over all states reachable from the initial state with the greedy policy.

Meta-structure correlation in protein space unveils different selection rules for folded and intrinsically disordered proteins

The number of existing protein sequences spans a very small fraction of sequence space. Natural proteins have overcome a strong negative selective pressure to avoid the formation of insoluble aggregates. Stably folded globular proteins and intrinsically disordered proteins (IDP) use alternative solutions to the aggregation problem. While in globular proteins folding minimizes the access to aggregation prone regions IDPs on average display large exposed contact areas. Here, we introduce the concept of average meta-structure correlation map to analyze sequence space. Using this novel conceptual view we show that representative ensembles of folded and ID proteins show distinct characteristics and responds differently to sequence randomization. By studying the way evolutionary constraints act on IDPs to disable a negative function (aggregation) we might gain insight into the mechanisms by which function - enabling information is encoded in IDPs.

Probabilistic algorithms for blind adaptive multiuser detection

In this paper, two probabilistic adaptive algorithmsfor jointly detecting active users in a DS-CDMA system arereported. The first one, which is based on the theory of hiddenMarkov models (HMM’s) and the Baum–Wech (BW) algorithm,is proposed within the CDMA scenario and compared withthe second one, which is a previously developed Viterbi-basedalgorithm. Both techniques are completely blind in the sense thatno knowledge of the signatures, channel state information, ortraining sequences is required for any user. Once convergencehas been achieved, an estimate of the signature of each userconvolved with its physical channel response (CR) and estimateddata sequences are provided. This CR estimate can be used toswitch to any decision-directed (DD) adaptation scheme. Performanceof the algorithms is verified via simulations as well as onexperimental data obtained in an underwater acoustics (UWA)environment. In both cases, performance is found to be highlysatisfactory, showing the near–far resistance of the analyzed algorithms.

Complete Analysis of Configuration Rules to Guarantee Reliable Network Security Policies

Peer-reviewed