نتایج جستجو برای: coarsened exact matching

تعداد نتایج: 219260  

2018
Min Su Zhongliang Zhou Yafei Si Xiaolin Wei Yongjian Xu Xiaojing Fan Gang Chen

BACKGROUND China has three basic health insurance schemes: Urban Employee Basic Medical Insurance (UEBMI), Urban Resident Basic Medical Insurance (URBMI) and New Rural Cooperative Medical Scheme (NRCMS). This study aimed to compare the equity of health-related quality of life (HRQoL) of residents under any two of the schemes. METHODS Using data from the 5th National Health Services Survey of ...

2017
Pontus Mattsson

This thesis consists of two self-contained empirical essays. Essay I investigates the impact of labor subsidies on TFP, and profit per employee is included as a second outcome. Coarsened exact matching (CEM) is performed on the key variables. After matching, a difference-indifference (DID) model is applied. The study shows that firms employing workers with wage subsidies experience negative and...

Journal: :Organization Science 2022

Recent scholarship has established several ways in which external hiring—versus filling a role with comparable internal candidate—is detrimental to firms. Yet, organizational learning theory suggests that hires benefit firms: by importing knowledge is unavailable or obscured insiders and applying it toward experimentation risky recombination. Accordingly consistent studies of hiring innovation,...

Journal: :Journal of the American Pharmacists Association 2021

BackgroundSince the establishment of Hospital Readmission Reduction Program by Centers for Medicare and Medicaid Services, reducing readmission rates has been a priority health care institutions. Many institutions have developed services to combat high rates, including bedside medication delivery programs, which demonstrated reductions in 30-day patients who used these services.ObjectiveTo eval...

2007
Fredrik Manne Rob H. Bisseling

We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial scientific computing. Since an exact algorithm for the weighted matching problem is both fairly expensive to compute and hard to parallelise we instead consider fast approximation

2014
Syed Nabeel Zafar Chiledum A. Ahaghotu Laura Libuit Gezzer Ortega Pamela W. Coleman Edward E. Cornwell Daniel D. Tran Terrence M. Fullum

BACKGROUND AND OBJECTIVES Ureteral injury is an infrequent but potentially lethal complication of colectomy. We aimed to determine the incidence of intraoperative ureteral injury after laparoscopic and open colectomy and to determine the independent morbidity and mortality rates associated with ureteral injury. METHODS We analyzed data from the National Surgical Quality Improvement Program fo...

Journal: :Stroke 2017
Christian Hametner Rachael L MacIsaac Lars Kellert Azmil H Abdul-Rahim Peter A Ringleb Kennedy R Lees

BACKGROUND AND PURPOSE We hypothesized that any sex-related difference in outcome poststroke is explained by other prognostic factors and that the response to intravenous recombinant tissue-type plasminogen activator (r-tPA) is equal in males and females after adjustment for such factors. METHODS We accessed an independent collection of randomized clinical trials-the VISTA (Virtual Internatio...

2008
Zhaorong Li Xuan Yang

In this lecture, the focus is on primal dual method and its application in designing exact algorithms and approximation algorithms for combinatorial optimization problems. It is a general framework which can solve many problems rather systematically. We first introduce the principles of primal dual program, and then show one example, weighted bipartite matching for designing exact algorithm and...

Journal: :Inf. Sci. 2013
U. Kang Martial Hebert Soonyong Park

Establishing consistent correspondences between two sets of features is a fundamental problem in computer vision. This problem can be well formulated as graph matching in which nodes and edges represent feature points and pairwise relationships between feature points, respectively. Spectral matching [19] is the state-of-the-art eigenvector-based method for graph matching. The spectral matching ...

Journal: :JIP 2015
Minseon Lee Shuichi Miyazaki Kazuo Iwama

An instance I of the Hospitals/Residents problem (HR) comprises a set of residents (graduating medical students) and a set of hospitals, where each hospital has a given capacity. The residents have preferences for the hospitals, as do hospitals for residents. A solution of I is a stable matching, which is an assignment of residents to hospitals that respects the capacity constraints and prefere...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید