Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 5 of 5
Full-Text Articles in Entire DC Network
Finding Causality And Responsibility For Probabilistic Reverse Skyline Query Non-Answers, Yunjun Gao, Qing Liu, Gang Cheng, Linlin Zhou, Baihua Zheng
Finding Causality And Responsibility For Probabilistic Reverse Skyline Query Non-Answers, Yunjun Gao, Qing Liu, Gang Cheng, Linlin Zhou, Baihua Zheng
Research Collection School Of Computing and Information Systems
Causality and responsibility is an essential tool in the database community for providing intuitive explanations for answers/non-answers to queries. Causality denotes the causes for the answers/non-answers to queries, and responsibility represents the degree of a cause which reflects its influence on the answers/non-answers to queries. In this paper, we study the causality and responsibility problem (CRP) for the non-answers to probabilistic reverse skyline queries (PRSQ). We first formalize CRP on PRSQ, and then, we propose an efficient algorithm termed as CP to compute the causality and responsibility for the non-answers to PRSQ. CP first finds candidate causes, and then, it …
Data From A Pre-Publication Independent Replication Initiative Examining Ten Moral Judgement Effects, Warren Thierny, Martin Schweinsberg, Jennifer Jordan, Michael Schaerer
Data From A Pre-Publication Independent Replication Initiative Examining Ten Moral Judgement Effects, Warren Thierny, Martin Schweinsberg, Jennifer Jordan, Michael Schaerer
Research Collection Lee Kong Chian School Of Business
We present the data from a crowdsourced project seeking to replicate findings in independent laboratories before (rather than after) they are published. In this Pre-Publication Independent Replication (PPIR) initiative, 25 research groups attempted to replicate 10 moral judgment effects from a single laboratory’s research pipeline of unpublished findings. The 10 effects were investigated using online/lab surveys containing psychological manipulations (vignettes) followed by questionnaires. Results revealed a mix of reliable, unreliable, and culturally moderated findings. Unlike any previous replication project, this dataset includes the data from not only the replications but also from the original studies, creating a unique corpus that …
Simultaneous Optimization And Sampling Of Agent Trajectories Over A Network, Hala Mostafa, Akshat Kumar, Hoong Chuin Lau
Simultaneous Optimization And Sampling Of Agent Trajectories Over A Network, Hala Mostafa, Akshat Kumar, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
We study the problem of optimizing the trajectories of agents moving over a network given their preferences over which nodes to visit subject to operational constraints on the network. In our running example, a theme park manager optimizes which attractions to include in a day-pass to maximize the pass’s appeal to visitors while keeping operational costs within budget. The first challenge in this combinatorial optimization problem is that it involves quantities (expected visit frequencies of each attraction) that cannot be expressed analytically, for which we use the Sample Average Approximation. The second challenge is that while sampling is typically done …
Sidestepping The Rock And The Hard Place: The Private Avoidance Of Prosocial Requests, Stephanie C. Lin, Rebecca L. Schaumberg, Taly Reich
Sidestepping The Rock And The Hard Place: The Private Avoidance Of Prosocial Requests, Stephanie C. Lin, Rebecca L. Schaumberg, Taly Reich
Research Collection Lee Kong Chian School Of Business
For some, facing a prosocial request feels like being trapped between a rock and a hard place, requiring either a resource (e.g., money) or psychological (e.g., self-reproach) cost. Because both outcomes are dissatisfying, we propose that these people are motivated to avoid prosocial requests, even when they face these requests in private, anonymous contexts. In two experiments, in which participants' anonymity and privacy was assured, participants avoided facing prosocial requests and were willing to do so at a personal cost. This was true both for people who would have otherwise complied with the request and those who would have otherwise …
Shortest Path Based Decision Making Using Probabilistic Inference, Akshat Kumar
Shortest Path Based Decision Making Using Probabilistic Inference, Akshat Kumar
Research Collection School Of Computing and Information Systems
We present a new perspective on the classical shortest path routing (SPR) problem in graphs. We show that the SPR problem can be recast to that of probabilistic inference in a mixture of simple Bayesian networks. Maximizing the likelihood in this mixture becomes equivalent to solving the SPR problem. We develop the well known Expectation-Maximization (EM) algorithm for the SPR problem that maximizes the likelihood, and show that it does not get stuck in a locally optimal solution. Using the same probabilistic framework, we then address an NP-Hard network design problem where the goal is to repair a network of …