Efficiency and environmental regulation: a 'complex situation'

Production of desirable outputs is often accompanied by undesirable by products that have damaging effects on the environment, and whose disposal is frequently regulated by public authorities. In this paper, we compute directional technology distance functions under particular assumptions concerning disposability of bads in order to test for the existence of what we call ‘complex situations’, where the biggest producer is not the greatest polluter. Furthermore, we show that how in such situations, environmental regulation could achieve an effective reduction in the aggregate level of bad outputs without reducing the production of good outputs. Finally, we illustrate our methodology with an empirical application to a sample of Spanish tile ceramic producers.

On the density distribution across space: a probabilistic approach

This paper aims at providing a Bayesian parametric framework to tackle the accessibility problem across space in urban theory. Adopting continuous variables in a probabilistic setting we are able to associate with the distribution density to the Kendall's tau index and replicate the general issues related to the role of proximity in a more general context. In addition, by referring to the Beta and Gamma distribution, we are able to introduce a differentiation feature in each spatial unit without incurring in any a-priori definition of territorial units. We are also providing an empirical application of our theoretical setting to study the density distribution of the population across Massachusetts.

Probabilistic sonar scan matching for an AUV

This paper proposes MSISpIC, a probabilistic sonar 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), the robot displacement estimated through dead-reckoning using a Doppler velocity log (DVL) and a motion reference unit (MRU). The proposed method is an extension of the pIC algorithm. An extended Kalman filter (EKF) is used to estimate the robot-path during the scan in order to reference all the range and bearing measurements as well as their uncertainty to a scan fixed frame before registering. The major contribution consists of experimentally proving that probabilistic sonar scan matching techniques have the potential to improve the DVL-based navigation. The algorithm has been tested on an AUV guided along a 600 m path within an abandoned marina underwater environment with satisfactory results

Probabilistic models to assist maintenance of multiple instruments

The paper discusses maintenance challenges of organisations with a huge number of devices and proposes the use of probabilistic models to assist monitoring and maintenance planning. The proposal assumes connectivity of instruments to report relevant features for monitoring. Also, the existence of enough historical registers with diagnosed breakdowns is required to make probabilistic models reliable and useful for predictive maintenance strategies based on them. Regular Markov models based on estimated failure and repair rates are proposed to calculate the availability of the instruments and Dynamic Bayesian Networks are proposed to model cause-effect relationships to trigger predictive maintenance services based on the influence between observed features and previously documented diagnostics

La Gestió policial als esdeveniments públics en espais urbans a l'Àfrica: situació actual i perspectives = Policing public events in urban spaces in Africa : an analysis of the current situation and a perspective on follow-up action

L’informe que es presenta en aquest llibre és el resultat d’un nou acord de col·laboració entre el Programa de les Nacions Unides per als Assentaments Humans (ONU-Habitat) i l’Institut de Seguretat Pública de Catalunya, impulsat amb l’objectiu de millorar la seguretat en esdeveniments públics en els espais urbans a l’Àfrica. La fase pilot es va dur a terme el 2010, durant els dos seminaris de formació realitzats a Mollet del Vallès (Barcelona) com a part de la Plataforma Policia per al Desenvolupament Urbà (PPUD). En aquest informe es descriuen els orígens i l’estat de la iniciativa i resumeix els resultats. També s’inclouen algunes recomanacions per a millorar la seguretat d’esdeveniments públics. Font d'informació: http://www.onuhabitat.org.

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.

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

Estudi sobre la qualitat de vida de les persones amb demència ateses a la Unitat d'avaluació de deteriorament cognitiu de l'Hospital de la Santa Creu

OBJECTIU: determinar la qualitat de vida de les persones amb demència ateses en una unitat avaluadora de deteriorament cognitiu. MÈTODE: estudi descriptiu transversal amb una mostra consecutiva no probabilística, formada per 42 persones amb demència tipus Alzheimer lleu o moderada i els seus cuidadors. La Qualitat de Vida (QV) es va avaluar amb el qüestionari QoL-AD (Quality of Life Alzheimer’s Disease) en les versions per al pacient (QoL-ADp) i per al cuidador (QoL-ADc). RESULTATS: la mitjana de puntuació del QoL-ADp va ser de 35,38 punts (DE = 5,24) i del QoL-Adc, de 30,60 (DE 5,33). La diferència entre aquests resultats és significativa (p&0,001). Els pacients amb simptomatologia depressiva i els seus cuidadors van puntuar significativament més baix el QoL-AD (p&0,001). En les freqüències per ítems del QoL-ADp s’observa que: més del 75% van valorar com a bona/excel·lent les condicions de vida, família, matrimoni/relació estreta, vida social, situació financera i vida en general; el 61% valoraren bona/excel·lent la capacitat per realitzar tasques a casa; prop del 50% pensava que l’estat d’ànim, l’energia, la salut física, la capacitat per fer coses per diversió i la visió de si mateixos era dolenta/regular, i el 85,7% opinava que la seva memòria era dolenta/regular. CONCLUSIONS: els resultats obtinguts en el QoL-AD no difereixen dels obtinguts en altres investigacions. Suggereixen que les intervencions que genera l’avaluació de la QV en la pràctica clínica inclouen aspectes centrats pròpiament en la malaltia i aspectes vinculats amb les relacions socials.

The situation of open access institutional repositories in Spain: 2009 report

Introduction. The DRIVER I project drew up a detailed report of European repositories based on data gathered in a survey in which Spain's participation was very low. This created a highly distorted image of the implementation of repositories in Spain. This study aims to analyse the current state of Spanish open-access institutional repositories and to describe their characteristics. Method. The data were gathered through a Web survey. The questionnaire was based on that used by DRIVER I: coverage; technical infrastructure and technical issues; institutional policies; services created; and stimulators and inhibitors for establishing, filling and maintaining their digital institutional repositories. Analysis. Data were tabulated and analysed systematically according responses obtained from the questionnaire and grouped by coverage. Results. Responses were obtained from 38 of the 104 institutions contacted, which had 29 institutional repositories. This represents 78.3% of the Spanish repositories according to the BuscaRepositorios directory. Spanish repositories contained mainly full-text materials (journal articles and doctoral theses) together with metadata. The software most used was DSpace, followed by EPrints. The metadata standard most used was Dublin Core. Spanish repositories offered more usage statistics and fewer author-oriented services than the European average. The priorities for the future development of the repositories are the need for clear policies on access to scientific production based on public funding and the need for quality control indicators. Conclusions.This is the first detailed study of Spanish institutional repositories. The key stimulants for establishing, filling and maintaining were, in order of importance, the increase of visibility and citation, the interest of decision-makers, simplicity of use and search services. On the other hand the main inhibitors identified were the absence of policies, the lack of integration with other national and international systems and the lack of awareness efforts among academia.

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.

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.

What makes one person paranoid and another person anxious? The differential prediction of social anxiety and persecutory ideation in an experimental situation

The study shows that social anxiety and persecutory ideation share many of the same predictive factors. Non-clinical paranoia may be a type of anxious fear. However, perceptual anomalies are a distinct predictor of paranoia. In the context of an individual feeling anxious, the occurrence of odd internal feelings in social situations may lead to delusional ideas through a sense of" things not seeming right". The study illustrates the approach of focusing on experiences such as paranoid thinking rather than diagnoses such as schizophrenia.