Calibration of CES functions for real-world multisectoral modeling

We show how to calibrate CES production and utility functions when indirect taxation affecting inputs and consumption is present. These calibrated functions can then be used in computable general equilibrium models. Taxation modifies the standard calibration procedures since any taxed good has two associated prices and a choice of reference value units has to be made. We also provide an example of computer code to solve the calibration of CES utilities under two alternate normalizations. To our knowledge, this paper fills a methodological gap in the CGE literature.

Is confidence in decisions related to feedback? Evidence-and lack of evidence-from random samples of real-world managerial behavior?

Confidence in decision making is an important dimension of managerialbehavior. However, what is the relation between confidence, on the onehand, and the fact of receiving or expecting to receive feedback ondecisions taken, on the other hand? To explore this and related issuesin the context of everyday decision making, use was made of the ESM(Experience Sampling Method) to sample decisions taken by undergraduatesand business executives. For several days, participants received 4 or 5SMS messages daily (on their mobile telephones) at random moments at whichpoint they completed brief questionnaires about their current decisionmaking activities. Issues considered here include differences between thetypes of decisions faced by the two groups, their structure, feedback(received and expected), and confidence in decisions taken as well as inthe validity of feedback. No relation was found between confidence indecisions and whether participants received or expected to receivefeedback on those decisions. In addition, although participants areclearly aware that feedback can provide both confirming and disconfirming evidence, their ability to specify appropriatefeedback is imperfect. Finally, difficulties experienced inusing the ESM are discussed as are possibilities for further researchusing this methodology.

Blind channel deconvolution of real world signals using source separation techniques

In this paper we present a method for blind deconvolution of linear channels based on source separation techniques, for real word signals. This technique applied to blind deconvolution problems is based in exploiting not the spatial independence between signals but the temporal independence between samples of the signal. Our objective is to minimize the mutual information between samples of the output in order to retrieve the original signal. In order to make use of use this idea the input signal must be a non-Gaussian i.i.d. signal. Because most real world signals do not have this i.i.d. nature, we will need to preprocess the original signal before the transmission into the channel. Likewise we should assure that the transmitted signal has non-Gaussian statistics in order to achieve the correct function of the algorithm. The strategy used for this preprocessing will be presented in this paper. If the receiver has the inverse of the preprocess, the original signal can be reconstructed without the convolutive distortion.

Passport to a profession in the degree of pharmacy: how to integrate university students into the real world of work: "Passport to a profession in Pharmacy"

The incorporation of the Spanish university system into the European Higher Education Areahas brought about a series of adaptations. Among the recommendations is the inclusion ofan external training period in a company, which has resulted in significant changes in thedegree syllabus in order to balance the theoretical and practical education required by thestudents. This new framework has been legally confirmed by the Spanish Government and, inthe case of the University of Barcelona, by the publication of internal guidelines. Takingadvantage of this new opportunity to adapt the Pharmacy degree to real-world problems inindustry, the Dean’s team of the Faculty of Pharmacy, with the support of the Facultyadministrative staff and the Students Advisory Service, have assumed the challenge ofincluding a new subject in the syllabus entitled Training in Companies.In parallel, a new activity has been set up to ensure that the students choose the mostsuitable company department/job for them and to help them pass the company interview.Under the name of Passport to a Profession, a series of ten explanatory talks has beenscheduled every academic year. These talks deal with a broad range of topics aimed atproviding the students with the basic tools they will need to make the most of a companytraining period and to make headway in the professional world when they finish theirdegree. In addition, three Faculty of Pharmacy-Pharmaceutical company workshops and tworound-table conferences have been held in the last two years in order to bring the universityand industry together. Notably, the project to provide students with company training isexpanding on an international level, with two to three undergraduate students contractedevery year by a United Kingdom-based multinational pharmaceutical company.The statistical data of the whole process has been analysed for a more in-depthunderstanding of the activity and to improve the programme.

Predictors of remission in the treatment of major depressive disorder: real-world evidence from a 6-month prospective observational study

BACKGROUND: This study examined potential predictors of remission among patients treated for major depressive disorder (MDD) in a naturalistic clinical setting, mostly in the Middle East, East Asia, and Mexico. METHODS: Data for this post hoc analysis were taken from a 6-month prospective, noninterventional, observational study that involved 1,549 MDD patients without sexual dysfunction at baseline in 12 countries worldwide. Depression severity was measured using the Clinical Global Impression of Severity and the 16-item Quick Inventory of Depressive Symptomatology Self-Report (QIDS-SR16). Depression-related pain was measured using the pain-related items of the Somatic Symptom Inventory. Remission was defined as a QIDS-SR16 score ≤5. Generalized estimating equation regression models were used to examine baseline factors associated with remission during follow-up. RESULTS: Being from East Asia (odds ratio [OR] 0.48 versus Mexico; P<0.001), a higher level of depression severity at baseline (OR 0.77, P=0.003, for Clinical Global Impression of Severity; OR 0.92, P<0.001, for QIDS-SR16), more previous MDD episodes (OR 0.92, P=0.007), previous treatments/therapies for depression (OR 0.78, P=0.030), and having any significant psychiatric and medical comorbidity at baseline (OR 0.60, P<0.001) were negatively associated with remission, whereas being male (OR 1.29, P=0.026) and treatment with duloxetine (OR 2.38 versus selective serotonin reuptake inhibitors, P<0.001) were positively associated with remission. However, the association between Somatic Symptom Inventory pain scores and remission no longer appeared to be significant in this multiple regression (P=0.580), (P=0.008 in descriptive statistics), although it remained significant in a subgroup of patients treated with selective serotonin reuptake inhibitors (OR 0.97, P=0.023), but not in those treated with duloxetine (P=0.182). CONCLUSION: These findings are largely consistent with previous reports from the USA and Europe. They also highlight the potential mediating role of treatment with duloxetine on the negative relationship between depression-related pain and outcomes of depression.

The impact of balancing on problem hardness in a highly structured domain

Random problem distributions have played a key role in the study and design of algorithms for constraint satisfaction and Boolean satisfiability, as well as in ourunderstanding of problem hardness, beyond standard worst-case complexity. We consider random problem distributions from a highly structured problem domain that generalizes the Quasigroup Completion problem (QCP) and Quasigroup with Holes (QWH), a widely used domain that captures the structure underlying a range of real-world applications. Our problem domain is also a generalization of the well-known Sudoku puz- zle: we consider Sudoku instances of arbitrary order, with the additional generalization that the block regions can have rectangular shape, in addition to the standard square shape. We evaluate the computational hardness of Generalized Sudoku instances, for different parameter settings. Our experimental hardness results show that we can generate instances that are considerably harder than QCP/QWH instances of the same size. More interestingly, we show the impact of different balancing strategies on problem hardness. We also provide insights into backbone variables in Generalized Sudoku instances and how they correlate to problem hardness.

Compression-based Image Registration

Image registration is an important component of image analysis used to align two or more images. In this paper, we present a new framework for image registration based on compression. The basic idea underlying our approach is the conjecture that two images are correctly registered when we can maximally compress one image given the information in the other. The contribution of this paper is twofold. First, we show that the image registration process can be dealt with from the perspective of a compression problem. Second, we demonstrate that the similarity metric, introduced by Li et al., performs well in image registration. Two different versions of the similarity metric have been used: the Kolmogorov version, computed using standard real-world compressors, and the Shannon version, calculated from an estimation of the entropy rate of the images

An analysis of visual adaptation and contrast perception for tone mapping

Tone Mapping is the problem of compressing the range of a High-Dynamic Range image so that it can be displayed in a Low-Dynamic Range screen, without losing or introducing novel details: The final image should produce in the observer a sensation as close as possible to the perception produced by the real-world scene. We propose a tone mapping operator with two stages. The first stage is a global method that implements visual adaptation, based on experiments on human perception, in particular we point out the importance of cone saturation. The second stage performs local contrast enhancement, based on a variational model inspired by color vision phenomenology. We evaluate this method with a metric validated by psychophysical experiments and, in terms of this metric, our method compares very well with the state of the art.

New Trends in Public Facility Location Modeling

The past four decades have witnessed an explosive growth in the field of networkbased facility location modeling. This is not at all surprising since location policy is one of the most profitable areas of applied systems analysis in regional science and ample theoretical and applied challenges are offered. Location-allocation models seek the location of facilities and/or services (e.g., schools, hospitals, and warehouses) so as to optimize one or several objectives generally related to the efficiency of the system or to the allocation of resources. This paper concerns the location of facilities or services in discrete space or networks, that are related to the public sector, such as emergency services (ambulances, fire stations, and police units), school systems and postal facilities. The paper is structured as follows: first, we will focus on public facility location models that use some type of coverage criterion, with special emphasis in emergency services. The second section will examine models based on the P-Median problem and some of the issues faced by planners when implementing this formulation in real world locational decisions. Finally, the last section will examine new trends in public sector facility location modeling.

Location models in the public sector

The past four decades have witnessed an explosive growth in the field of networkbased facilitylocation modeling. This is not at all surprising since location policy is one of the mostprofitable areas of applied systems analysis in regional science and ample theoretical andapplied challenges are offered. Location-allocation models seek the location of facilitiesand/or services (e.g., schools, hospitals, and warehouses) so as to optimize one or severalobjectives generally related to the efficiency of the system or to the allocation of resources.This paper concerns the location of facilities or services in discrete space or networks, thatare related to the public sector, such as emergency services (ambulances, fire stations, andpolice units), school systems and postal facilities. The paper is structured as follows: first,we will focus on public facility location models that use some type of coverage criterion,with special emphasis in emergency services. The second section will examine models based onthe P-Median problem and some of the issues faced by planners when implementing thisformulation in real world locational decisions. Finally, the last section will examine newtrends in public sector facility location modeling.

The science of monetary policy: A new Keynesian perspective

This paper reviews the recent literature on monetary policy rules. We exposit the monetary policy design problem within a simple baselinetheoretical framework. We then consider the implications of adding various real world complications. Among other things, we show that the optimal policy implicitly incorporates inflation targeting. Wealso characterize the gains from making credible commitments to fightinflation. In contrast to conventional wisdom, we show that gains from commitment may emerge even in the central bank is not trying toinadvisedly push output above its natural level. We also consider theimplications of frictions such as imperfect information.

Algorithms and cryptographic protocols using elliptic curves

En els darrers anys, la criptografia amb corbes el.líptiques ha adquirit una importància creixent, fins a arribar a formar part en la actualitat de diferents estàndards industrials. Tot i que s'han dissenyat variants amb corbes el.líptiques de criptosistemes clàssics, com el RSA, el seu màxim interès rau en la seva aplicació en criptosistemes basats en el Problema del Logaritme Discret, com els de tipus ElGamal. En aquest cas, els criptosistemes el.líptics garanteixen la mateixa seguretat que els construïts sobre el grup multiplicatiu d'un cos finit primer, però amb longituds de clau molt menor. Mostrarem, doncs, les bones propietats d'aquests criptosistemes, així com els requeriments bàsics per a que una corba sigui criptogràficament útil, estretament relacionat amb la seva cardinalitat. Revisarem alguns mètodes que permetin descartar corbes no criptogràficament útils, així com altres que permetin obtenir corbes bones a partir d'una de donada. Finalment, descriurem algunes aplicacions, com són el seu ús en Targes Intel.ligents i sistemes RFID, per concloure amb alguns avenços recents en aquest camp.

Generating highly balanced sudoku problems as hard problems

Sudoku problems are some of the most known and enjoyed pastimes, with a never diminishing popularity, but, for the last few years those problems have gone from an entertainment to an interesting research area, a twofold interesting area, in fact. On the one side Sudoku problems, being a variant of Gerechte Designs and Latin Squares, are being actively used for experimental design, as in [8, 44, 39, 9]. On the other hand, Sudoku problems, as simple as they seem, are really hard structured combinatorial search problems, and thanks to their characteristics and behavior, they can be used as benchmark problems for refining and testing solving algorithms and approaches. Also, thanks to their high inner structure, their study can contribute more than studies of random problems to our goal of solving real-world problems and applications and understanding problem characteristics that make them hard to solve. In this work we use two techniques for solving and modeling Sudoku problems, namely, Constraint Satisfaction Problem (CSP) and Satisfiability Problem (SAT) approaches. To this effect we define the Generalized Sudoku Problem (GSP), where regions can be of rectangular shape, problems can be of any order, and solution existence is not guaranteed. With respect to the worst-case complexity, we prove that GSP with block regions of m rows and n columns with m = n is NP-complete. For studying the empirical hardness of GSP, we define a series of instance generators, that differ in the balancing level they guarantee between the constraints of the problem, by finely controlling how the holes are distributed in the cells of the GSP. Experimentally, we show that the more balanced are the constraints, the higher the complexity of solving the GSP instances, and that GSP is harder than the Quasigroup Completion Problem (QCP), a problem generalized by GSP. Finally, we provide a study of the correlation between backbone variables – variables with the same value in all the solutions of an instance– and hardness of GSP.

Energy policies for rural electrification: a social multi-criteria evaluation approach

In this article, a real-world case- study is presented with two general objectives: to give a clear and simple illustrative example of application of social multi-criteria evaluation (SMCE) in the field of rural renewable energy policies, and to help in understanding to what extent and under which circumstances solar energy is suitable for electrifying isolated farmhouses. In this sense, this study might offer public decision- makers some insight on the conditions that favour the diffusion of renewable energy, in order to help them to design more effective energy policies for rural communities.

Extensió de l'entorn SMARD per permetre la depuració d'aplicacions basades en agents mòbils

Un dels principals obstacles per l’adopció dels agents mòbils, fins i tot per tasques per les quals s’ha demostrat la seva idoneïtat, és la dificultat de desenvolupar-los. Aquest projecte aporta solucions per ajudar en aquest procés. Més concretament, per provar agents i observar-ne el seu comportament en un entorn de simulació, abans d’executar-los en un escenari real. Hem afegit un depurador i un constructor d’agents mòbils a la interfície gràfica de disseny d’itineraris de l’entorn SMARD. Fent servir afegit aquests nous components, el programador pot dissenyar, construir i fer proves d’un agent mòbil des d’aquesta aplicació.