Source author record

David Love

David Love appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

4works
6topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

4 published item(s)

preprint2026arXiv

SHIELD: A Diverse Clinical Note Dataset and Distilled Small Language Models for Enterprise-Scale De-identification

De-identification of clinical text remains essential for secondary use of electronic health records (EHRs), yet public benchmarks such as i2b2 2006/2014 are over a decade old and lack the semantic and demographic diversity of modern narratives. While Large Language Models (LLMs) achieve state-of-the-art zero-shot extraction, enterprise deployment is hindered by compute costs and governance restricting Protected Health Information (PHI) from cloud APIs. We introduce SHIELD (Synthetic Human-annotated Identifier-replaced Entries for Learning and De-identification), a diverse dataset of 1,394 notes with 10,505 gold-standard PHI spans across 9 categories, built via set-cover diversity sampling with human-in-the-loop adjudication. We evaluate four LLMs (two proprietary, two open-weight) to establish a performance ceiling, then distill these capabilities into locally deployable Small Language Models (SLMs). Distributional analysis using Frechet Text Distance and Jensen-Shannon Divergence confirms SHIELD occupies a distinct region of biomedical embedding and vocabulary space versus legacy benchmarks. Our best distilled model matches its teacher on structured PHI categories (DATE, DOCTOR, ID, PATIENT, PHONE) and achieves micro-averaged span-level precision of 0.88 and recall of 0.86 on standard workstation hardware. Cross-dataset evaluation shows diversity-trained models generalize well on universal structured PHI, while institution-specific entities remain hard to transfer, suggesting optimal deployment combines broad-coverage models with specialized models for high-volume notes. We publicly release the SHIELD dataset and the distilled DeBERTa v3 model.

preprint2023arXiv

Fusing Channel and Sensor Measurements for Enhancing Predictive Beamforming in UAV-Assisted Massive MIMO Communications

Cellular-connected unmanned aerial vehicles (UAVs) represent a promising technology for extending the coverage of 5G and 6G networks in a cost-effective manner. Additionally, Massive multiple-input multiple-output (MIMO) serves as an effective solution to interference mitigation in cellular-connected UAV communications. In this letter, we propose a fusion of wireless and sensor data to enhance beam alignment for cellular-connected UAV massive MIMO communications. We develop a predictive beamforming framework, including the frame structure and predictive beamformer. Moreover, we employ an extended Kalman filter (EKF) to integrate channel and sensor data and provide the corresponding state-space and observation models. Simulation results demonstrate that the proposed scheme can improve position/orientation estimation accuracy significantly, leading to higher spectral efficiency.

preprint2015arXiv

Communicating over Filter-and-Forward Relay Networks with Channel Output Feedback

Relay networks aid in increasing the rate of communication from source to destination. However, the capacity of even a three-terminal relay channel is an open problem. In this work, we propose a new lower bound for the capacity of the three-terminal relay channel with destination-to-source feedback in the presence of correlated noise. Our lower bound improves on the existing bounds in the literature. We then extend our lower bound to general relay network configurations using an arbitrary number of filter-and-forward relay nodes. Such network configurations are common in many multi-hop communication systems where the intermediate nodes can only perform minimal processing due to limited computational power. Simulation results show that significant improvements in the achievable rate can be obtained through our approach. We next derive a coding strategy (optimized using post processed signal-to-noise ratio as a criterion) for the three-terminal relay channel with noisy channel output feedback for two transmissions. This coding scheme can be used in conjunction with open-loop codes for applications like automatic repeat request (ARQ) or hybrid-ARQ.

preprint2007arXiv

Hypocomputation

Hypercomputational formal theories will, clearly, be both structurally and foundationally different from the formal theories underpinning computational theories. However, many of the maps that might guide us into this strange realm have been lost. So little work has been done recently in the area of metamathematics, and so many of the previous results have been folded into other theories, that we are in danger of loosing an appreciation of the broader structure of formal theories. As an aid to those looking to develop hypercomputational theories, we will briefly survey the known landmarks both inside and outside the borders of computational theory. We will not focus in this paper on why the structure of formal theory looks the way it does. Instead we will focus on what this structure looks like, moving from hypocomputational, through traditional computational theories, and then beyond to hypercomputational theories.