The Experts below are selected from a list of 222 Experts worldwide ranked by ideXlab platform
Adam Kriesberg - One of the best experts on this subject based on the ideXlab platform.
-
The future of Access to public Records? Public–private partnerships in US state and territorial archives
Archival Science, 2017Co-Authors: Adam KriesbergAbstract:This article examines the network of public archives and private sector organizations engaged in the work of digitizing historical Records. Specifically, it focuses on the recent expansion of public–private partnerships involving US state and territorial archives and their effects on citizens’ Access to digitized materials. Despite this expansion in the reach of partnerships, research investigating this phenomenon has not kept pace. Here, I present interview and documentary data gathered from government archivists and private sector employees from companies such as Ancestry.com, FamilySearch, and ProQuest. The results explain the processes by which these relationships form and function as well as how they affect Access to Records. Of particular importance are the ways in which private companies’ priorities drive the selection of Records for digitization in these partnerships and how a changing Access paradigm, whereby users search for Records on third-party platforms, threatens to alienate government archival Records from their provenance. This project is the first comprehensive study of public–private partnerships involving state and territorial archives in the USA and serves as the basis for future work.
Sudipta Sengupta - One of the best experts on this subject based on the ideXlab platform.
-
the bw tree a b tree for new hardware platforms
International Conference on Data Engineering, 2013Co-Authors: Justin J Levandoski, David B Lomet, Sudipta SenguptaAbstract:The emergence of new hardware and platforms has led to reconsideration of how data management systems are designed. However, certain basic functions such as key indexed Access to Records remain essential. While we exploit the common architectural layering of prior systems, we make radically new design decisions about each layer. Our new form of B-tree, called the Bw-tree achieves its very high performance via a latch-free approach that effectively exploits the processor caches of modern multi-core chips. Our storage manager uses a unique form of log structuring that blurs the distinction between a page and a record store and works well with flash storage. This paper describes the architecture and algorithms for the Bw-tree, focusing on the main memory aspects. The paper includes results of our experiments that demonstrate that this fresh approach produces outstanding performance.
Rebecca Ong - One of the best experts on this subject based on the ideXlab platform.
-
attitudes of the hong kong chinese public towards sex offending policies the role of stereotypical views of sex offenders
Punishment & Society, 2015Co-Authors: Wing Hong Chui, Kevin Kwokyin Cheng, Rebecca OngAbstract:The Hong Kong government recently introduced a sex offender registry that gives the public Access to Records of sexual offence conviction. This step was taken in the context of a penal system that ...
Steven B Andrews - One of the best experts on this subject based on the ideXlab platform.
-
using blockchain technology to mitigate challenges in service Access for the homeless and data exchange between providers qualitative study
Journal of Medical Internet Research, 2020Co-Authors: Anjum Khurshid, Vivian Rajeswaren, Steven B AndrewsAbstract:BACKGROUND In the homeless population, barriers to housing and supportive services include a lack of control or Access to data. Disparate data formats and storage across multiple organizations hinder up-to-date intersystem Access to Records and a unified view of an individual's health and documentation history. The utility of blockchain to solve interoperability in health care is supported in recent literature, but the technology has yet to be tested in real-life conditions encompassing the complex regulatory standards in the health sector. OBJECTIVE This study aimed to test the feasibility and performance of a blockchain system in a homeless community to securely store and share data across a system of providers in the health care ecosystem. METHODS We performed a series of platform demonstrations and open-ended qualitative feedback interviews to determine the key needs and barriers to user and stakeholder adoption. Account creation and data transactions promoting organizational efficiency and improved health outcomes in this population were tested with homeless users and service providers. RESULTS Persons experiencing homelessness and care organizations could successfully create accounts, grant and revoke data sharing permissions, and transmit documents across a distributed network of providers. However, there were issues regarding the security of shared data, user experience and adoption, and organizational preparedness for service providers as end users. We tested a set of assumptions related to these problems within the project time frame and contractual obligations with an existing blockchain-based platform. CONCLUSIONS Blockchain technology provides decentralized data sharing, validation, immutability, traceability, and integration. These core features enable a secure system for the management and distribution of sensitive information. This study presents a concrete evaluation of the effectiveness of blockchain through an existing platform while revealing limitations from the perspectives of user adoption, cost-effectiveness, scalability, and regulatory frameworks.
Justin J Levandoski - One of the best experts on this subject based on the ideXlab platform.
-
the bw tree a b tree for new hardware platforms
International Conference on Data Engineering, 2013Co-Authors: Justin J Levandoski, David B Lomet, Sudipta SenguptaAbstract:The emergence of new hardware and platforms has led to reconsideration of how data management systems are designed. However, certain basic functions such as key indexed Access to Records remain essential. While we exploit the common architectural layering of prior systems, we make radically new design decisions about each layer. Our new form of B-tree, called the Bw-tree achieves its very high performance via a latch-free approach that effectively exploits the processor caches of modern multi-core chips. Our storage manager uses a unique form of log structuring that blurs the distinction between a page and a record store and works well with flash storage. This paper describes the architecture and algorithms for the Bw-tree, focusing on the main memory aspects. The paper includes results of our experiments that demonstrate that this fresh approach produces outstanding performance.
