Matching prescription claims with medication data for nursing home residents: Implications for prescriber feedback, drug utilisation studies and selection of prescription claims database

Medication data retrieved from Australian Repatriation Pharmaceutical Benefits Scheme (RPBS) claims for 44 veterans residing in nursing homes and Pharmaceutical Benefits Scheme (PBS) claims for 898 nursing home residents were compared with medication data from nursing home records to determine the optimal time interval for retrieving claims data and its validity. Optimal matching was achieved using 12 weeks of RPBS claims data, with 60% of medications in the RPBS claims located in nursing home administration records, and 78% of medications administered to nursing home residents identified in RPBS claims. In comparison, 48% of medications administered to nursing home residents could be found in 12 weeks of PBS data, and 56% of medications present in PBS claims could be matched with nursing home administration records. RPBS claims data was superior to PBS, due to the larger number of scheduled items available to veterans and the veteran's file number, which acts as a unique identifier. These findings should be taken into account when using prescription claims data for medication histories, prescriber feedback, drug utilisation, intervention or epidemiological studies. (C) 2001 Elsevier Science Inc. All rights reserved.

Manipulation of optimal matchings via predonation of endowment

In this paper we answer a question posed by Sertel and Özkal-Sanver (2002) on the manipulability of optimal matching rules in matching problems with endowments. We characterize the classes of consumption rules under which optimal matching rules can be manipulated via predonation of endowment.

QoE-aware power management in vehicle-to-grid networks:a matching-theoretic approach

Frequency, time and places of charging and discharging have critical impact on the Quality of Experience (QoE) of using Electric Vehicles (EVs). EV charging and discharging scheduling schemes should consider both the QoE of using EV and the load capacity of the power grid. In this paper, we design a traveling plan-aware scheduling scheme for EV charging in driving pattern and a cooperative EV charging and discharging scheme in parking pattern to improve the QoE of using EV and enhance the reliability of the power grid. For traveling planaware scheduling, the assignment of EVs to Charging Stations (CSs) is modeled as a many-to-one matching game and the Stable Matching Algorithm (SMA) is proposed. For cooperative EV charging and discharging in parking pattern, the electricity exchange between charging EVs and discharging EVs in the same parking lot is formulated as a many-to-many matching model with ties, and we develop the Pareto Optimal Matching Algorithm (POMA). Simulation results indicates that the SMA can significantly improve the average system utility for EV charging in driving pattern, and the POMA can increase the amount of electricity offloaded from the grid which is helpful to enhance the reliability of the power grid.

Pluralized life courses? An exploration of the life trajectories of individuals with psychiatric disorders.

BACKGROUND: : Most of the existing research relating to the life courses of people with psychiatric symptoms focuses on the occurrence and the impact of non-normative events on the onsets of crises; it usually disregards the more regular dimensions of life, such as work, family and intimate partnerships that may be related to the timing and seriousness of psychiatric problems. An additional reason for empirically addressing life trajectories of individuals with psychiatric problems relates to recent changes of family and occupational trajectories in relation to societal trends such as individualization and pluralization of life courses.¦AIM: : This paper explores the life trajectories of 86 individuals under clinical supervision and proposes a typology of their occupational, co-residence and intimacy trajectories. The results are discussed in light of the life-course paradigm.¦METHOD: : A multidimensional optimal matching analysis was performed on a sample of 86 individuals under clinical supervision to create a typology of trajectories. The influence of these trajectories on psychiatric disorders, evaluated using a SCL-90-R questionnaire, was then assessed using linear regression modelling.¦RESULTS: : The typologies of trajectories showed that the patients developed a diversity of life trajectories. Individuals who have developed a standard life course with few institutionalization periods reported more symptoms and distress than individuals with an institutionalized life trajectory.¦CONCLUSION: : The results of this study stress that psychiatric patients are social actors who are influenced by society at large and its ongoing process of change. Therefore, it is essential to take into account the diversity of occupational and family trajectories when dealing with individuals in therapeutic settings.

Advances in Sequence Analysis: Theory, Methods, Applications

This book gives a general view of sequence analysis, the statistical study of successions of states or events. It includes innovative contributions on life course studies, transitions into and out of employment, contemporaneous and historical careers, and political trajectories. The approach presented in this book is now central to the life-course perspective and the study of social processes more generally. This volume promotes the dialogue between approaches to sequence analysis that developed separately, within traditions contrasted in space and disciplines. It includes the latest developments in sequential concepts, coding, atypical datasets and time patterns, optimal matching and alternative algorithms, survey optimization, and visualization. Field studies include original sequential material related to parenting in 19th-century Belgium, higher education and work in Finland and Italy, family formation before and after German reunification, French Jews persecuted in occupied France, long-term trends in electoral participation, and regime democratization. Overall the book reassesses the classical uses of sequences and it promotes new ways of collecting, formatting, representing and processing them. The introduction provides basic sequential concepts and tools, as well as a history of the method. Chapters are presented in a way that is both accessible to the beginner and informative to the expert.

Monge assignment games

Un juego de asignación se define por una matriz A; donde cada fila representa un comprador y cada columna un vendedor. Si el comprador i se empareja a un vendedor j; el mercado produce aij unidades de utilidad. Estudiamos los juegos de asignación de Monge, es decir, aquellos juegos bilaterales de asignación en los cuales la matriz satisface la propiedad de Monge. Estas matrices pueden caracterizarse por el hecho de que en cualquier submatriz 2x2 un emparejamiento óptimo está situado en la diagonal principal. Para mercados cuadrados, describimos sus núcleos utilizando sólo la parte central tridiagonal de elementos de la matriz. Obtenemos una fórmula cerrada para el reparto óptimo de los compradores dentro del núcleo y para el reparto óptimo de los vendedores dentro del núcleo. Analizamos también los mercados no cuadrados reduciéndolos a matrices cuadradas apropiadas.

Symmetrically multilateral-bargained allocations in multi-sided assignment markets

[cat] Aquest treball tracta d’extendre la noció d’equilibri simètric de negociació bilateral introduït per Rochford (1983) a jocs d’assignació multilateral. Un pagament corresponent a un equilibri simètric de negociación multilateral (SMB) és una imputación del core que garanteix que qualsevol agent es troba en equilibri respecte a un procés de negociación entre tots els agents basat en allò que cadascun d’ells podria rebre -i fer servir com a amenaça- en un ’matching’ òptim diferent al que s’ha format. Es prova que, en el cas de jocs d’assignació multilaterals, el conjunt de SMB és sempre no buit i que, a diferència del cas bilateral, no sempre coincideix amb el kernel (Davis and Maschler, 1965). Finalment, responem una pregunta oberta per Rochford (1982) tot introduïnt un conjunt basat en la idea de kernel, que, conjuntament amb el core, ens permet caracteritzar el conjunt de SMB.

Monge assignment games

Un juego de asignación se define por una matriz A; donde cada fila representa un comprador y cada columna un vendedor. Si el comprador i se empareja a un vendedor j; el mercado produce aij unidades de utilidad. Estudiamos los juegos de asignación de Monge, es decir, aquellos juegos bilaterales de asignación en los cuales la matriz satisface la propiedad de Monge. Estas matrices pueden caracterizarse por el hecho de que en cualquier submatriz 2x2 un emparejamiento óptimo está situado en la diagonal principal. Para mercados cuadrados, describimos sus núcleos utilizando sólo la parte central tridiagonal de elementos de la matriz. Obtenemos una fórmula cerrada para el reparto óptimo de los compradores dentro del núcleo y para el reparto óptimo de los vendedores dentro del núcleo. Analizamos también los mercados no cuadrados reduciéndolos a matrices cuadradas apropiadas.

Symmetrically multilateral-bargained allocations in multi-sided assignment markets

[cat] Aquest treball tracta d’extendre la noció d’equilibri simètric de negociació bilateral introduït per Rochford (1983) a jocs d’assignació multilateral. Un pagament corresponent a un equilibri simètric de negociación multilateral (SMB) és una imputación del core que garanteix que qualsevol agent es troba en equilibri respecte a un procés de negociación entre tots els agents basat en allò que cadascun d’ells podria rebre -i fer servir com a amenaça- en un ’matching’ òptim diferent al que s’ha format. Es prova que, en el cas de jocs d’assignació multilaterals, el conjunt de SMB és sempre no buit i que, a diferència del cas bilateral, no sempre coincideix amb el kernel (Davis and Maschler, 1965). Finalment, responem una pregunta oberta per Rochford (1982) tot introduïnt un conjunt basat en la idea de kernel, que, conjuntament amb el core, ens permet caracteritzar el conjunt de SMB.

How Much Does It Cost? Optimization of Costs in Sequence Analysis of Social Science Data

One major methodological problem in analysis of sequence data is the determination of costs from which distances between sequences are derived. Although this problem is currently not optimally dealt with in the social sciences, it has some similarity with problems that have been solved in bioinformatics for three decades. In this article, the authors propose an optimization of substitution and deletion/insertion costs based on computational methods. The authors provide an empirical way of determining costs for cases, frequent in the social sciences, in which theory does not clearly promote one cost scheme over another. Using three distinct data sets, the authors tested the distances and cluster solutions produced by the new cost scheme in comparison with solutions based on cost schemes associated with other research strategies. The proposed method performs well compared with other cost-setting strategies, while it alleviates the justification problem of cost schemes.

Las trayectorias formativo-laborales de los jóvenes con Formación Profesional de Grado Superior.

Resumen tomado de la publicación