Engineering Crowdsourced Stream Processing Systems

A crowdsourced stream processing system (CSP) is a system that incorporates crowdsourced tasks in the processing of a data stream. This can be seen as enabling crowdsourcing work to be applied on a sample of large-scale data at high speed, or equivalently, enabling stream processing to employ human intelligence. It also leads to a substantial expansion of the capabilities of data processing systems. Engineering a CSP system requires the combination of human and machine computation elements. From a general systems theory perspective, this means taking into account inherited as well as emerging properties from both these elements. In this paper, we position CSP systems within a broader taxonomy, outline a series of design principles and evaluation metrics, present an extensible framework for their design, and describe several design patterns. We showcase the capabilities of CSP systems by performing a case study that applies our proposed framework to the design and analysis of a real system (AIDR) that classifies social media messages during time-critical crisis events. Results show that compared to a pure stream processing system, AIDR can achieve a higher data classification accuracy, while compared to a pure crowdsourcing solution, the system makes better use of human workers by requiring much less manual work effort

Sustainability Standards and Stakeholder Engagement: Lessons From Carbon Markets

Stakeholders play an increasingly active role in private governance, including development of standards for measuring sustainability. Building on prior studies focused on standards and stakeholder engagement, we use an innovation management theoretical lens to compare stakeholder engagement and standards developed in two carbon markets: the Climate Action Reserve and the U.N.’s Clean Development Mechanism. We develop and test hypotheses regarding how different processes of stakeholder engagement in standard development affect the number, identity, and age of stakeholders involved, as well as the variation and quality of the resulting standards. In doing so, we contribute to the growing literature on stakeholder engagement in developing sustainability standards

Geoweb 2.0 for Participatory Urban Design: Affordances and Critical Success Factors

In this paper, we discuss the affordances of open-source Geoweb 2.0 platforms to support the participatory design of urban projects in real-world practices.We first introduce the two open-source platforms used in our study for testing purposes. Then, based on evidence from five different field studies we identify five affordances of these platforms: conversations on alternative urban projects, citizen consultation, design empowerment, design studio learning and design research. We elaborate on these in detail and identify a key set of success factors for the facilitation of better practices in the future

What’s in it for me? Incentive-compatible route coordination of crowdsourced resources

With the recent trend in crowdsourcing, i.e., using the power of crowds to assist in satisfying demand, the pool of resources suitable for GeoPresence-capable systems has expanded to include already roaming devices, such as mobile phones, and moving vehicles. We envision an environment, in which the motion of these crowdsourced mobile resources is coordinated, according to their preexisting schedules to satisfy geo-temporal demand on a mobility field. In this paper, we propose an incentive compatible route coordination mechanism for crowdsourced resources, in which participating mobile agents satisfy geo-temporal requests in return for monetary rewards. We define the Flexible Route Coordination (FRC) problem, in which an agent’s flexibility is exploited to maximize the coverage of a mobility field, with an objective to maximize the revenue collected from satisfied paying requests. Given that the FRC problem is NP-hard, we define an optimal algorithm to plan the route of a single agent on a graph with evolving labels, then we use that algorithm to define a 1/2-approximation algorithm to solve the problem in its general model, with multiple agents. Moreover, we define an incentive compatible, rational, and cash-positive payment mechanism, which guarantees that an agent’s truthfulness about its flexibility is an ex-post Nash equilibrium strategy. Finally, we analyze the proposed mechanisms theoretically, and evaluate their performance experimentally using real mobility traces from urban environments.Supported in part by NSF Grants, #1430145, #1414119, #1347522, #1239021, and #1012798

Incentive-compatible route coordination of crowdsourced resources

Technical ReportWith the recent trend in crowdsourcing, i.e., using the power of crowds to assist in satisfying demand, the pool of resources suitable for GeoPresen-ce-capable systems has expanded to include already roaming devices, such as mobile phones, and moving vehicles. We envision an environment, in which the motion of these crowdsourced mobile resources is coordinated, according to their preexisting schedules to satisfy geo-temporal demand on a mobility field. In this paper, we propose an incentive compatible route coordination mechanism for crowdsourced resources, in which participating mobile agents satisfy geo-temporal requests in return for monetary rewards. We define the Flexible Route Coordination (FRC) problem, in which an agent’s flexibility is exploited to maximize the coverage of a mobility field, with an objective to maximize the revenue collected from satisfied paying requests. Given that the FRC problem is NP-hard, we define an optimal algorithm to plan the route of a single agent on a graph with evolving labels, then we use that algorithm to define a 1-approximation algorithm to solve the 2 problem in its general model, with multiple agents. Moreover, we define an incentive compatible, rational, and cash-positive payment mechanism, which guarantees that an agent’s truthfulness about its flexibility is an ex-post Nash equilibrium strategy. Finally, we analyze the proposed mechanisms theoretically, and evaluate their performance experimentally using real mobility traces from urban environments