The role of role uncertainty in modified dictator games

We compare behavior in modified dictator games with and without role uncertainty. Subjectschoose between a selfish action, a costly surplus creating action (altruistic behavior) and acostly surplus destroying action (spiteful behavior). While costly surplus creating actions are themost frequent under role uncertainty (64%), selfish actions become the most frequent withoutrole uncertainty (69%). Also, the frequency of surplus destroying choices is negligible with roleuncertainty (1%) but not so without it (11%). A classification of subjects into four differenttypes of interdependent preferences (Selfish, Social Welfare maximizing, Inequity Averse andCompetitive) shows that the use of role uncertainty overestimates the prevalence of SocialWelfare maximizing preferences in the subject population (from 74% with role uncertainty to21% without it) and underestimates Selfish and Inequity Averse preferences. An additionaltreatment, in which subjects undertake an understanding test before participating in theexperiment with role uncertainty, shows that the vast majority of subjects (93%) correctlyunderstand the payoff mechanism with role uncertainty, but yet surplus creating actions weremost frequent. Our results warn against the use of role uncertainty in experiments that aim tomeasure the prevalence of interdependent preferences.

On the efficiency and sensitivity of a pyramidal classification algorithm

In this paper we propose a Pyramidal Classification Algorithm,which together with an appropriate aggregation index producesan indexed pseudo-hierarchy (in the strict sense) withoutinversions nor crossings. The computer implementation of thealgorithm makes it possible to carry out some simulation testsby Monte Carlo methods in order to study the efficiency andsensitivity of the pyramidal methods of the Maximum, Minimumand UPGMA. The results shown in this paper may help to choosebetween the three classification methods proposed, in order toobtain the classification that best fits the original structureof the population, provided we have an a priori informationconcerning this structure.

Elicited beliefs and social information in modified dictator games: What do dictators believe other dictators do?

We use subjects actions in modified dictator games to perform a within-subject classification ofindividuals into four different types of interdependent preferences: Selfish, Social Welfaremaximizers, Inequity Averse and Competitive. We elicit beliefs about other subjects actions inthe same modified dictator games to test how much of the existent heterogeneity in others actions is known by subjects. We find that subjects with different interdependent preferences infact have different beliefs about others actions. In particular, Selfish individuals cannotconceive others being non-Selfish while Social Welfare maximizers are closest to the actualdistribution of others actions. We finally provide subjects with information on other subjects actions and re-classify individuals according to their (new) actions in the same modified dictatorgames. We find that social information does not affect Selfish individuals, but that individualswith interdependent preferences are more likely to change their behavior and tend to behavemore selfishly.

A simple randomized algorithm for consistent sequential prediction of ergodic time series

We present a simple randomized procedure for the prediction of a binary sequence. The algorithm uses ideas from recent developments of the theory of the prediction of individual sequences. We show that if thesequence is a realization of a stationary and ergodic random process then the average number of mistakes converges, almost surely, to that of the optimum, given by the Bayes predictor.

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

An Efficient Nominal Unification Algorithm

Nominal Unification is an extension of first-order unification where terms can contain binders and unification is performed modulo α equivalence. Here we prove that the existence of nominal unifiers can be decided in quadratic time. First, we linearly-reduce nominal unification problems to a sequence of freshness and equalities between atoms, modulo a permutation, using ideas as Paterson and Wegman for first-order unification. Second, we prove that solvability of these reduced problems may be checked in quadràtic time. Finally, we point out how using ideas of Brown and Tarjan for unbalanced merging, we could solve these reduced problems more efficiently

Programació d'una aplicació gràfica per l'anàlisi de senyals usant LDB (Local Discriminant Bases) i MLDB (Modified LDB)

Tot seguit presentem un entorn per analitzar senyals de tot tipus amb LDB (Local Discriminant Bases) i MLDB (Modified Local Discriminant Bases). Aquest entorn utilitza funcions desenvolupades en el marc d’una tesi en fase de desenvolupament. Per entendre part d’aquestes funcions es requereix un nivell de coneixement avançat de processament de senyals. S’han extret dels treballs realitzats per Naoki Saito [3], que s’han agafat com a punt de partida per la realització de l’algorisme de la tesi doctoral no finalitzada de Jose Antonio Soria. Aquesta interfície desenvolupada accepta la incorporació de nous paquets i funcions. Hem deixat un menú preparat per integrar Sinus IV packet transform i Cosine IV packet transform, tot i que també podem incorporar-n’hi altres. L’aplicació consta de dues interfícies, un Assistent i una interfície principal. També hem creat una finestra per importar i exportar les variables desitjades a diferents entorns. Per fer aquesta aplicació s’han programat tots els elements de les finestres, en lloc d’utilitzar el GUIDE (Graphical User Interface Development Enviroment) de MATLAB, per tal que sigui compatible entre les diferents versions d’aquest programa. En total hem fet 73 funcions en la interfície principal (d’aquestes, 10 pertanyen a la finestra d’importar i exportar) i 23 en la de l’Assistent. En aquest treball només explicarem 6 funcions i les 3 de creació d’aquestes interfícies per no fer-lo excessivament extens. Les funcions que explicarem són les més importants, ja sigui perquè s’utilitzen sovint, perquè, segons la complexitat McCabe, són les més complicades o perquè són necessàries pel processament del senyal. Passem cada entrada de dades per part de l’usuari per funcions que ens detectaran errors en aquesta entrada, com eliminació de zeros o de caràcters que no siguin números, com comprovar que són enters o que estan dins dels límits màxims i mínims que li pertoquen.

A fast Bayesian reconstruction algorithm for emission tomography with entropy prior converging to feasible images

The development and tests of an iterative reconstruction algorithm for emission tomography based on Bayesian statistical concepts are described. The algorithm uses the entropy of the generated image as a prior distribution, can be accelerated by the choice of an exponent, and converges uniformly to feasible images by the choice of one adjustable parameter. A feasible image has been defined as one that is consistent with the initial data (i.e. it is an image that, if truly a source of radiation in a patient, could have generated the initial data by the Poisson process that governs radioactive disintegration). The fundamental ideas of Bayesian reconstruction are discussed, along with the use of an entropy prior with an adjustable contrast parameter, the use of likelihood with data increment parameters as conditional probability, and the development of the new fast maximum a posteriori with entropy (FMAPE) Algorithm by the successive substitution method. It is shown that in the maximum likelihood estimator (MLE) and FMAPE algorithms, the only correct choice of initial image for the iterative procedure in the absence of a priori knowledge about the image configuration is a uniform field.

Gas sensing properties of catalytically modified WO3 with copper and vanadium for NH3 detection

Ammonia gas detection by pure and catalytically modified WO3 based gas sensor was analysed. The sensor response of pure WO3 to NH3 was not only rather low but also presented an abnormal behaviour, probably due to the unselective oxidation of ammonia to NOx. Copper and vanadium were introduced in different concentrations and the resulting material was annealed at different temperatures in order to improve the sensing properties for NH3 detection. The introduction of copper and vanadium as catalytic additives improved the response to NH3 and also eliminated the abnormal behaviour. Possible mechanisms of NH3 reaction over these materials are discussed. Sensor responses to other gases like NO2 or CO and the interference of humidity on ammonia detection were also analysed so as to choose the best sensing element.

Numerical algorithm for Ginzburg-Landau equations with multiplicative noise: Application to domain growth

We consider stochastic partial differential equations with multiplicative noise. We derive an algorithm for the computer simulation of these equations. The algorithm is applied to study domain growth of a model with a conserved order parameter. The numerical results corroborate previous analytical predictions obtained by linear analysis.

Majorization arrow in quantum-algorithm design

We apply majorization theory to study the quantum algorithms known so far and find that there is a majorization principle underlying the way they operate. Grover's algorithm is a neat instance of this principle where majorization works step by step until the optimal target state is found. Extensions of this situation are also found in algorithms based in quantum adiabatic evolution and the family of quantum phase-estimation algorithms, including Shor's algorithm. We state that in quantum algorithms the time arrow is a majorization arrow.

Numerical algorithm for spectroscopic ellipsometry of thick transparent films

We present a numerical method for spectroscopic ellipsometry of thick transparent films. When an analytical expression for the dispersion of the refractive index (which contains several unknown coefficients) is assumed, the procedure is based on fitting the coefficients at a fixed thickness. Then the thickness is varied within a range (according to its approximate value). The final result given by our method is as follows: The sample thickness is considered to be the one that gives the best fitting. The refractive index is defined by the coefficients obtained for this thickness.

In vitro susceptibility to pentavalent antimony in Leishmania infantum strains is not modified during in vitro or in vivo passages but is modified after host treatment with meglumine antimoniate

Background: Leishmaniasis is a common parasitic disease in Southern Europe, caused by Leishmania infantum. The failures of current treatment with pentavalent antimonials are partially attributable to the emergence of antimony-resistant Leishmania strains. This study analyses the in vitro susceptibility to pentavalent antimony of intracellular amastigotes from a range of L. infantum strains, derived from the same infected animal, during in vitro and in vivo passages and after host treatment with meglumine antimoniate. Results: SbV-IC50 values for strains from two distinct isolates from the same host and one stock after two years of culture in NNN medium and posterior passage to hamster were similar (5.0 ± 0.2; 4.9 ± 0.2 and 4.4 ± 0.1 mgSbV/L, respectively). In contrast, a significant difference (P < 0.01, t test) was observed between the mean SbV-IC50 values in the stocks obtained before and after treatment of hosts with meglumine antimoniate (4.7 ± 0.4 mgSbV/L vs. 7.7 ± 1.5 mgSbV/L). Drug-resistance after drug pressure in experimentally infected dogs increased over repeated drug administration (6.4 ± 0.5 mgSbV/L after first treatment vs. 8.6 ± 1.4 mgSbV/L after the second) (P < 0.01, t test). Conclusions: These results confirm previous observations on strains from Leishmania/HIV co-infected patients and indicate the effect of the increasing use of antimony derivatives for treatment of canine leishmaniasis in endemic areas on the emergence of Leishmania antimony-resistant strains.

A program of nurse algorithm-guided care for adult patients with acute minor illnesses in primary care

Background: Attention to patients with acute minor-illnesses requesting same-day consultation represents a major burden in primary care. The workload is assumed by general practitioners in many countries. A number of reports suggest that care to these patients may be provided, at in least in part, by nurses. However, there is scarce information with respect to the applicability of a program of nurse management for adult patients with acute minor-illnesses in large areas. The aim of this study is to assess the effectiveness of a program of nurse algorithm-guided care for adult patients with acute minor illnesses requesting same-day consultation in primary care in a largely populated area. Methods: A cross-sectional study of all adult patients seeking same day consultation for 16 common acute minor illnesses in a large geographical area with 284 primary care practices. Patients were included in a program of nurse case management using management algorithms. The main outcome measure was case resolution, defined as completion of the algorithm by the nurse without need of referral of the patient to the general practitioner. The secondary outcome measure was return to consultation, defined as requirement of new consultation for the same reason as the first one, in primary care within a 7-day period. Results: During a two year period (April 2009-April 2011), a total of 1,209,669 consultations were performed in the program. Case resolution was achieved by nurses in 62.5% of consultations. The remaining cases were referred to a general practitioner. Resolution rates ranged from 94.2% in patients with burns to 42% in patients with upper respiratory symptoms. None of the 16 minor illnesses had a resolution rate below 40%. Return to consultation during a 7-day period was low, only 4.6%. Conclusions: A program of algorithms-guided care is effective for nurse case management of patients requesting same day consultation for minor illnesses in primary care.

A program of nurse algorithm-guided care for adult patients with acute minor illnesses in primary care

Background: Attention to patients with acute minor-illnesses requesting same-day consultation represents a major burden in primary care. The workload is assumed by general practitioners in many countries. A number of reports suggest that care to these patients may be provided, at in least in part, by nurses. However, there is scarce information with respect to the applicability of a program of nurse management for adult patients with acute minor-illnesses in large areas. The aim of this study is to assess the effectiveness of a program of nurse algorithm-guided care for adult patients with acute minor illnesses requesting same-day consultation in primary care in a largely populated area. Methods: A cross-sectional study of all adult patients seeking same day consultation for 16 common acute minor illnesses in a large geographical area with 284 primary care practices. Patients were included in a program of nurse case management using management algorithms. The main outcome measure was case resolution, defined as completion of the algorithm by the nurse without need of referral of the patient to the general practitioner. The secondary outcome measure was return to consultation, defined as requirement of new consultation for the same reason as the first one, in primary care within a 7-day period. Results: During a two year period (April 2009-April 2011), a total of 1,209,669 consultations were performed in the program. Case resolution was achieved by nurses in 62.5% of consultations. The remaining cases were referred to a general practitioner. Resolution rates ranged from 94.2% in patients with burns to 42% in patients with upper respiratory symptoms. None of the 16 minor illnesses had a resolution rate below 40%. Return to consultation during a 7-day period was low, only 4.6%. Conclusions: A program of algorithms-guided care is effective for nurse case management of patients requesting same day consultation for minor illnesses in primary care.