8 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
7 papers
A moving target in AI-assisted decision-making: Dataset shift, model updating, and the problem of update opacity
Joshua Hatherley
Machine learning (ML) systems are vulnerable to performance decline over time due to dataset shift. To address this problem, experts often suggest that ML systems should be regular…
Reception Reader: Exploring Text Reuse in Early Modern British Publications
David Rosson, Eetu Mäkelä, Ville Vaara +3
The Reception Reader is a web tool for studying text reuse in the Early English Books Online (EEBO-TCP) and Eighteenth Century Collections Online (ECCO) data. Users can: 1) explore…
Bayesian inference for partial orders from random linear extensions: power relations from 12th Century Royal Acta
Geoff K. Nicholls, Jeong Eun Lee, Nicholas Karn +3
In the eleventh and twelfth centuries in England, Wales and Normandy, Royal Acta were legal documents in which witnesses were listed in order of social status. Any bishops present…
A Conversationalist Approach to Information Quality in Information Interaction and Retrieval
Frans van der Sluis
Rather than using (proxies of) end user or expert judgment to decide on the ranking of information, this paper asks whether conversations about information quality might offer a fe…
International Conferences of Bibliometrics
Grischa Fraumann, Rogerio Mugnaini, Elias Sanz-Casado
Conferences are deeply connected to research fields, in this case bibliometrics. As such, they are a venue to present and discuss current and innovative research, and play an impor…
Exact solution of damped harmonic oscillator with a magnetic field in a time dependent noncommutative space
Manjari Dutta, Shreemoyee Ganguly, Sunandan Gangopadhyay
In this paper we have obtained the exact eigenstates of a two dimensional damped harmonic oscillator in the presence of an external magnetic field varying with respect to time in t…
Turing Completeness of Finite, Epistemic Programs
Dominik Klein, Rasmus K. Rendsvig
In this note, we show the class of finite, epistemic programs to be Turing complete. Epistemic programs is a widely used update mechanism used in epistemic logic, where it such are…