Searcharxiv⌕ Search

arXiv subjects

Elizaveta A. Guseva

Publications and source records attributed to Elizaveta A. Guseva.

2 recordsLinked to original sources

Reply & Supply: Efficient crowdsourcing when workers do more than answer questions

Crowdsourcing works by distributing many small tasks to large numbers of workers, yet the true potential of crowdsourcing lies in workers doing more than performing simple tasks---they can apply their experience and creativity to provide new and unexpected information to the crowdsourcer. One such case is when workers not only answer a crowdsourcer's questions but also contribute new questions for subsequent crowd analysis, leading to a growing set of questions. This growth creates an inherent bias for early questions since a question introduced earlier by a worker can be answered by more subsequent workers than a question introduced later. Here we study how to perform efficient crowdsourcing with such growing question sets. By modeling question sets as networks of interrelated questions, we introduce algorithms to help curtail the growth bias by efficiently distributing workers between exploring new questions and addressing current questions. Experiments and simulations demonstrate that these algorithms can efficiently explore an unbounded set of questions without losing confidence in crowd answers.

cs.SI↗

Exact rule-based stochastic simulations for systems with unlimited number of molecular species

We introduce expandable partial propensity direct method (EPDM) - a new exact stochastic simulation algorithm suitable for systems involving many interacting molecular species. The algorithm is especially efficient for sparsely populated systems, where the number of species that may potentially be generated is much greater than the number of species actually present in the system at any given time. The number of operations per reaction scales linearly with the number of species, but only those which have one or more molecules. To achieve this kind of performance we are employing a data structure which allows to add and remove species and their interactions on the fly. When a new specie is added, its interactions with every other specie are generated dynamically by a set of user-defined rules. By removing the records involving the species with zero molecules, we keep the number of species as low as possible. This enables simulations of systems for which listing all species is not practical. The algorithm is based on partial propensities direct method (PDM) by Ramaswamy et al. for sampling trajectories of the chemical master equation.

cs.DS↗