Author(s):  
Stefano Conti ◽  
Filipe Oliveira dos Santos ◽  
Arne Wolters

IntroductionThe ability to identify residents of care homes in routinely collected health care data is key to informing healthcare planning decisions and delivery initiatives targeting the older and frail population. Health-care planning and delivery implications at national level concerning this population subgroup have considerably and suddenly grown in urgency following the onset of the COVID-19 pandemic, which has especially hit care homes. The range of applicability of this information has widened with the increased availability in England of retrospectively collected administrative databases, holding rich patient-level details on health and prognostic status who have made or are in contact with the National Health Service. In practice lack of a national registry of care homes residents in England complicates assessing an individual's care home residency status, which has been typically identified via manual address matching from pseudonymised patient-level healthcare databases linked with publicly availably care home address information. ObjectivesTo examine a novel methodology based on linking unique care home address identifiers with primary care patient registration data, enabling routine identification of care home residents in health-care data. MethodsThis study benchmarks the proposed strategy against the manual address matching standard approach through a diagnostic assessment of a stratified random sample of care home post codes in England. ResultsDerived estimates of diagnostic performance, albeit showing a non-insignificant false negative rate (21.98%), highlight a remarkable true negative rate (99.69%) and positive predictive value (99.35%) as well as a satisfactory negative predictive value (88.25%). ConclusionsThe validation exercise lends confidence to the reliability of the novel address matching method as a viable and general alternative to manual address matching.


2016 ◽  
Vol 5 (5) ◽  
pp. 65 ◽  
Author(s):  
Qin Tian ◽  
Fu Ren ◽  
Tao Hu ◽  
Jiangtao Liu ◽  
Ruichang Li ◽  
...  

2010 ◽  
Vol 171-172 ◽  
pp. 561-564
Author(s):  
Hui Ye ◽  
Zhi Gang Chen ◽  
Xiao Jian Shen

Recently, many researchers focus on delay tolerant networks (DTN). In DTN, the mobile characteristic of nodes is used to help transfer data. Therefore, how to use the cooperative relations and cache resource of nodes effectively to avoid network congestion and improve network performance is an important issue. In this paper, we proposed a cooperative caching policy based on human mobile patterns, which referred as HMP-Cache. The node movement characteristics are discussed in detail in HMP-Cache. HMP-Cache uses the standard of target address matching to choose cooperative caching nodes. In addition, the sharing caching information is done by synchronization of caching table in local region. Therefore, the impact of useless data dissemination of multiple hops is reduced. And the shortcoming of limited caching resources is compensated. The simulation results show that our policy can control the network cost effectively. Also, the remote data latency is reduced.


1980 ◽  
Vol 18 (1) ◽  
pp. 87-95
Author(s):  
J. R. DAVIS ◽  
TONI A. PAINE
Keyword(s):  

Author(s):  
P. Pahlavani ◽  
R .A. Abbaspour ◽  
A. Zare Zadiny

Geocoding – the process of finding position based on descriptive data such as address or postal code - is considered as one of the most commonly used spatial analyses. Many online map providers such as Google Maps, Bing Maps and Yahoo Maps present geocoding as one of their basic capabilities. Despite the diversity of geocoding services, users usually face some limitations when they use available online geocoding services. In existing geocoding services, proximity and nearness concept is not modelled appropriately as well as these services search address only by address matching based on descriptive data. In addition there are also some limitations in display searching results. Resolving these limitations can enhance efficiency of the existing geocoding services. This paper proposes the idea of integrating fuzzy technique with geocoding process to resolve these limitations. In order to implement the proposed method, a web-based system is designed. In proposed method, nearness to places is defined by fuzzy membership functions and multiple fuzzy distance maps are created. Then these fuzzy distance maps are integrated using fuzzy overlay technique for obtain the results. Proposed methods provides different capabilities for users such as ability to search multi-part addresses, searching places based on their location, non-point representation of results as well as displaying search results based on their priority.


2015 ◽  
Author(s):  
Xiaojing Yao ◽  
Xiang Li ◽  
Ling Peng ◽  
Tianhe Chi

2020 ◽  
Vol 137 (4) ◽  
pp. 251-318

  H1 Database right – Infringement – Mapping – Geospatial coordinates – Address matching – Licensing agreements – Sub-licensing – Breach of contract – Construction – Scope of rights granted – Subsistence of database right – Verification of existing data – Extraction – Consultation – Re-utilisation – Defences – Authorised extraction – Time and place shifting – Information dissemination – Estoppel by representation – Inducing breach of contract – Justification


Sign in / Sign up

Export Citation Format

Share Document