2016-2017 Use and Reach of Allied Health Sciences Publications in Digital Scholarship@UNLV

The Allied Health Sciences Digital Scholarship@UNLV Collection contains faculty publications and graduate student works. This report contains data for the 2016-2017 Academic Year (August 2016-July 2017) downloads (how many and where from-“reach”) of fulltext materials in Digital Scholarship@UNLV. Records that only contain metadata do not generate downloads and therefore are not reflected in the maps and show as 0 in the download report attached at the en

Scholarly Communication Initiatives Department Jan 2018 - June 2019 Report

This report highlights the major accomplishments of the Scholarly Communication Initiatives Department (SCI) with a special emphasis on statistics from Digital Scholarship@UNLV, our institutional repository. The report reflects activities from January 2018 through June 2019. The significant highlights during this time include the 5 millionth download of a digital item from Digital Scholarship@UNLV, adding over 3,000 full-text theses and dissertations written at UNLV from 1977-2008, establishing pilot projects to support open access and research data management efforts, releasing the 2013 and 2017 Solar Decathlon collections, and hosting an ambitious and engaging Open Access Week slate of activities

2016-2017 Use and Reach of Dental Medicine Publications in Digital Scholarship@UNLV

The Dental Medicine Digital Scholarship Collection contains faculty publications and theses and dissertations. This report contains data for the 2016-2017 Academic Year (August 2016-July 2017) downloads (how many and where from-“reach”) of fulltext materials in Digital Scholarship@UNLV. Records that only contain metadata do not generate downloads and therefore are not reflected in the maps and show as 0 in the download report attached at the end

Cell-Probe Lower Bounds from Online Communication Complexity

In this work, we introduce an online model for communication complexity. Analogous to how online algorithms receive their input piece-by-piece, our model presents one of the players, Bob, his input piece-by-piece, and has the players Alice and Bob cooperate to compute a result each time before the next piece is revealed to Bob. This model has a closer and more natural correspondence to dynamic data structures than classic communication models do, and hence presents a new perspective on data structures. We first present a tight lower bound for the online set intersection problem in the online communication model, demonstrating a general approach for proving online communication lower bounds. The online communication model prevents a batching trick that classic communication complexity allows, and yields a stronger lower bound. We then apply the online communication model to prove data structure lower bounds for two dynamic data structure problems: the Group Range problem and the Dynamic Connectivity problem for forests. Both of the problems admit a worst case $O(\log n)$-time data structure. Using online communication complexity, we prove a tight cell-probe lower bound for each: spending $o(\log n)$ (even amortized) time per operation results in at best an $\exp(-\delta^2 n)$ probability of correctly answering a $(1/2+\delta)$-fraction of the $n$ queries

Communication

Section on "Communication" from Encyclopedia of Applied Animal Behaviour and Welfar