The Experts below are selected from a list of 60 Experts worldwide ranked by ideXlab platform
James M. Greenberg - One of the best experts on this subject based on the ideXlab platform.
-
Evaluation of Identifier Field agreement in linked neonatal records
Journal of Perinatology, 2017Co-Authors: Eric S. Hall, Keith Marsolo, James M. GreenbergAbstract:Objective: To better address barriers arising from missing and unreliable Identifiers in neonatal medical records, we evaluated agreement and discordance among traditional and non-traditional linkage Fields within a linked neonatal data set. Study Design: The retrospective, descriptive analysis represents infants born from 2013 to 2015. We linked children’s hospital neonatal physician billing records to newborn medical records originating from an academic delivery hospital and evaluated rates of agreement, discordance and missingness for a set of 12 Identifier Field pairs used in the linkage algorithm. Results: We linked 7293 of 7404 physician billing records (98.5%), all of which were deemed valid upon manual review. Linked records contained a mean of 9.1 matching and 1.6 non-matching Identifier pairs. Only 4.8% had complete agreement among all 12 Identifier pairs. Conclusion: Our approach to selection of linkage variables and data formatting preparatory to linkage have generalizability, which may inform future neonatal and perinatal record linkage efforts.
-
Evaluation of Identifier Field agreement in linked neonatal records.
Journal of perinatology : official journal of the California Perinatal Association, 2017Co-Authors: Eric S. Hall, Keith Marsolo, James M. GreenbergAbstract:To better address barriers arising from missing and unreliable Identifiers in neonatal medical records, we evaluated agreement and discordance among traditional and non-traditional linkage Fields within a linked neonatal data set. The retrospective, descriptive analysis represents infants born from 2013 to 2015. We linked children’s hospital neonatal physician billing records to newborn medical records originating from an academic delivery hospital and evaluated rates of agreement, discordance and missingness for a set of 12 Identifier Field pairs used in the linkage algorithm. We linked 7293 of 7404 physician billing records (98.5%), all of which were deemed valid upon manual review. Linked records contained a mean of 9.1 matching and 1.6 non-matching Identifier pairs. Only 4.8% had complete agreement among all 12 Identifier pairs. Our approach to selection of linkage variables and data formatting preparatory to linkage have generalizability, which may inform future neonatal and perinatal record linkage efforts.
Claude Castelluccia - One of the best experts on this subject based on the ideXlab platform.
-
Hash-Based Paging and Location Update Using Bloom Filters
Mobile Networks and Applications, 2004Co-Authors: Pars Mutaf, Claude CastellucciaAbstract:We develop and analyze a hash-based paging and location update technique that reduces the paging cost in cellular systems. By applying a Bloom filter, the terminal Identifier Field of a paging message is coded to page a number of terminals concurrently. A small number of terminals may wake up and send what we call “false location updates” although they are not being paged. We compare the total number of paging and false location update messages with the cost of the standard paging procedure. Fortunately, the false location update probabilities can be made very small, and important bandwidth gains can be expected. The larger the size of the terminal Identifier, the less probable are false location updates. Therefore, hash-based paging especially shows promise for IP paging in mobile IPv6 networks with 128-bit mobile host addresses.
-
hash based paging and location update using bloom filters a paging algorithm that is best suitable for ipv6
Mobile Networks and Applications, 2004Co-Authors: Pars Mutaf, Claude CastellucciaAbstract:We develop and analyze a hash-based paging and location update technique that reduces the paging cost in cellular systems. By applying a Bloom filter, the terminal Identifier Field of a paging message is coded to page a number of terminals concurrently. A small number of terminals may wake up and send what we call "false location updates" although they are not being paged. We compare the total number of paging and false location update messages with the cost of the standard paging procedure. Fortunately, the false location update probabilities can be made very small, and important bandwidth gains can be expected. The larger the size of the terminal Identifier, the less probable are false location updates. Therefore, hash-based paging especially shows promise for IP paging in mobile IPv6 networks with 128-bit mobile host addresses.
-
A hash-based paging and location update procedure
2003Co-Authors: Pars Mutaf, Claude CastellucciaAbstract:We propose a hash-based paging and location update procedure that reduces the paging cost in cellular systems. By applying a Bloom filter, the terminal Identifier Field of a paging message is coded to page a number of terminals concurrently.
Eric S. Hall - One of the best experts on this subject based on the ideXlab platform.
-
Evaluation of Identifier Field agreement in linked neonatal records
Journal of Perinatology, 2017Co-Authors: Eric S. Hall, Keith Marsolo, James M. GreenbergAbstract:Objective: To better address barriers arising from missing and unreliable Identifiers in neonatal medical records, we evaluated agreement and discordance among traditional and non-traditional linkage Fields within a linked neonatal data set. Study Design: The retrospective, descriptive analysis represents infants born from 2013 to 2015. We linked children’s hospital neonatal physician billing records to newborn medical records originating from an academic delivery hospital and evaluated rates of agreement, discordance and missingness for a set of 12 Identifier Field pairs used in the linkage algorithm. Results: We linked 7293 of 7404 physician billing records (98.5%), all of which were deemed valid upon manual review. Linked records contained a mean of 9.1 matching and 1.6 non-matching Identifier pairs. Only 4.8% had complete agreement among all 12 Identifier pairs. Conclusion: Our approach to selection of linkage variables and data formatting preparatory to linkage have generalizability, which may inform future neonatal and perinatal record linkage efforts.
-
Evaluation of Identifier Field agreement in linked neonatal records.
Journal of perinatology : official journal of the California Perinatal Association, 2017Co-Authors: Eric S. Hall, Keith Marsolo, James M. GreenbergAbstract:To better address barriers arising from missing and unreliable Identifiers in neonatal medical records, we evaluated agreement and discordance among traditional and non-traditional linkage Fields within a linked neonatal data set. The retrospective, descriptive analysis represents infants born from 2013 to 2015. We linked children’s hospital neonatal physician billing records to newborn medical records originating from an academic delivery hospital and evaluated rates of agreement, discordance and missingness for a set of 12 Identifier Field pairs used in the linkage algorithm. We linked 7293 of 7404 physician billing records (98.5%), all of which were deemed valid upon manual review. Linked records contained a mean of 9.1 matching and 1.6 non-matching Identifier pairs. Only 4.8% had complete agreement among all 12 Identifier pairs. Our approach to selection of linkage variables and data formatting preparatory to linkage have generalizability, which may inform future neonatal and perinatal record linkage efforts.
Keith Marsolo - One of the best experts on this subject based on the ideXlab platform.
-
Evaluation of Identifier Field agreement in linked neonatal records
Journal of Perinatology, 2017Co-Authors: Eric S. Hall, Keith Marsolo, James M. GreenbergAbstract:Objective: To better address barriers arising from missing and unreliable Identifiers in neonatal medical records, we evaluated agreement and discordance among traditional and non-traditional linkage Fields within a linked neonatal data set. Study Design: The retrospective, descriptive analysis represents infants born from 2013 to 2015. We linked children’s hospital neonatal physician billing records to newborn medical records originating from an academic delivery hospital and evaluated rates of agreement, discordance and missingness for a set of 12 Identifier Field pairs used in the linkage algorithm. Results: We linked 7293 of 7404 physician billing records (98.5%), all of which were deemed valid upon manual review. Linked records contained a mean of 9.1 matching and 1.6 non-matching Identifier pairs. Only 4.8% had complete agreement among all 12 Identifier pairs. Conclusion: Our approach to selection of linkage variables and data formatting preparatory to linkage have generalizability, which may inform future neonatal and perinatal record linkage efforts.
-
Evaluation of Identifier Field agreement in linked neonatal records.
Journal of perinatology : official journal of the California Perinatal Association, 2017Co-Authors: Eric S. Hall, Keith Marsolo, James M. GreenbergAbstract:To better address barriers arising from missing and unreliable Identifiers in neonatal medical records, we evaluated agreement and discordance among traditional and non-traditional linkage Fields within a linked neonatal data set. The retrospective, descriptive analysis represents infants born from 2013 to 2015. We linked children’s hospital neonatal physician billing records to newborn medical records originating from an academic delivery hospital and evaluated rates of agreement, discordance and missingness for a set of 12 Identifier Field pairs used in the linkage algorithm. We linked 7293 of 7404 physician billing records (98.5%), all of which were deemed valid upon manual review. Linked records contained a mean of 9.1 matching and 1.6 non-matching Identifier pairs. Only 4.8% had complete agreement among all 12 Identifier pairs. Our approach to selection of linkage variables and data formatting preparatory to linkage have generalizability, which may inform future neonatal and perinatal record linkage efforts.
Pars Mutaf - One of the best experts on this subject based on the ideXlab platform.
-
Hash-Based Paging and Location Update Using Bloom Filters
Mobile Networks and Applications, 2004Co-Authors: Pars Mutaf, Claude CastellucciaAbstract:We develop and analyze a hash-based paging and location update technique that reduces the paging cost in cellular systems. By applying a Bloom filter, the terminal Identifier Field of a paging message is coded to page a number of terminals concurrently. A small number of terminals may wake up and send what we call “false location updates” although they are not being paged. We compare the total number of paging and false location update messages with the cost of the standard paging procedure. Fortunately, the false location update probabilities can be made very small, and important bandwidth gains can be expected. The larger the size of the terminal Identifier, the less probable are false location updates. Therefore, hash-based paging especially shows promise for IP paging in mobile IPv6 networks with 128-bit mobile host addresses.
-
hash based paging and location update using bloom filters a paging algorithm that is best suitable for ipv6
Mobile Networks and Applications, 2004Co-Authors: Pars Mutaf, Claude CastellucciaAbstract:We develop and analyze a hash-based paging and location update technique that reduces the paging cost in cellular systems. By applying a Bloom filter, the terminal Identifier Field of a paging message is coded to page a number of terminals concurrently. A small number of terminals may wake up and send what we call "false location updates" although they are not being paged. We compare the total number of paging and false location update messages with the cost of the standard paging procedure. Fortunately, the false location update probabilities can be made very small, and important bandwidth gains can be expected. The larger the size of the terminal Identifier, the less probable are false location updates. Therefore, hash-based paging especially shows promise for IP paging in mobile IPv6 networks with 128-bit mobile host addresses.
-
A hash-based paging and location update procedure
2003Co-Authors: Pars Mutaf, Claude CastellucciaAbstract:We propose a hash-based paging and location update procedure that reduces the paging cost in cellular systems. By applying a Bloom filter, the terminal Identifier Field of a paging message is coded to page a number of terminals concurrently.