KissKissBan: A Competitive Human Computation Game for Image Annotation

•

2 likes•1,070 views

In this paper, we propose a competitive human computation game, KissKissBan (KKB), for image annotation. KKB is different from other human computation games since it integrates both collaborative and competitive elements in the game design. In a KKB game, one player, the blocker, competes with the other two collaborative players, the couples; while the couples try to find consensual descriptions about an image, the blocker’s mission is to prevent the couples from reaching consensus. Because of its design, KKB possesses two nice properties over the traditional human computation game. First, since the blocker is encouraged to stop the couples from reaching consensual descriptions, he will try to detect and prevent coalition between the couples; therefore, these efforts naturally form a player-level cheating-proof mechanism. Second, to evade the restrictions set by the blocker, the couples would endeavor to bring up a more diverse set of image annotations. Experiments hosted on Amazon Mechanical Turk and a gameplay survey involving 17 participants have shown that KKB is a fun and efficient game for collecting diverse image annotations.

Technology Entertainment & Humor Design

KissKissBan
A Competitive Human Computation
Game for Image Annotation
Chien-Ju Ho*, Tao-Hsuan Chang+, Jong-Chuan Lee+,
Jane Yun-jen Hsu+, Kuan-Ta Chen*
*Academia Sinica
+National Taiwan University

Human Computation Game

Collaborative Mechanisms

Coalition Problem

Limited Data Diversity

The ESP Game

• Coalition problem
• partner with themselves
• uniﬁed strategy
• Limited diversity
• easy words ﬁrst

Player 1 Player 2

DOG CUTE
FLOWER WOOD
FLOOR DOG

Player 1 Player 2

DOG CUTE
FLOWER WOOD
FLOOR DOG

DELIVER EMOTION BY TYPING THE SAME WORD

Couple Couple

DOG CUTE
FLOWER WOOD
FLOOR DOG

DELIVER EMOTION BY TYPING THE SAME WORD

Blocker
Couple Couple

DOG
DOG CUTE
WHITE
FLOWER WOOD
FLOOR DOG

Blocker
Couple Couple

DOG
DOG CUTE
WHITE
FLOWER WOOD
FLOOR DOG

KissKissBan
A Competitive Human Computation
Game for Image Annotation

Blocker
Couple Couple

DOG CUTE
DOG Blocked
WHITE WOOD
FLOWER
FLOWER
FLOOR The blocked words
-5s game time -5s game time

1. First, the blocker has 7 seconds to type words
2. Then, the couples has 30 seconds to type words

Blocker
Couple Couple

DOG CUTE
DOG
WHITE WOOD
FLOWER
FLOWER
FLOOR
Couples win for matching within time limit
1. First, the blocker has 7 seconds to type words
2. Then, the couples has 30 seconds to type words

Incentive Structure

• Zero sum game
• strict competitive
• players can not beneﬁt from coalition
• Different decision time periods
• harder words, longer consideration [Barry et al. 2001]

• diverse data contribution

Small-scale Experiment

• Image Source
• 125 images randomly from ESP dataset
• Experiment Setup
• 17-player gameplay survey
• Data collection on Mechanical Turk

Gameplay Survey

• Fun
• 3.76/5 overall rating
• 15/17 players claim that would play again
• over 60% like to play as a blocker

MTurk Experiment

• Collecting data from anonymous users
• Publish two games for comparison
• KissKissBan
• ESP Game without taboo words
• Each game is played for ~5000 rounds

Example of Collected Data
ESP ML-KKB BL-KKB
beach 3
sea 9
water 3
man 21 man 8
sand 3
beach 10 ocean 3
sea 2
karate 5 black 1
ninja 1
water 1 china 1
kungfu 1
sand 1
ocean 1

ML-KKB: matching between couples
BL-KKB: matching between couple and blocker

MTurk Experiment

• Data property
• For each image
• ESP: 39.96 labels, 6.56 distinct labels
• KKB: 44.17 labels, 11.53 distinct labels
• A more diverse player contribution

Conclusion

• We proposed a competitive human
computation game, KissKissBan.
• KissKissBan has two nice properties
• a player-level anti-coalition mechanism
• diverse player input

More in the Future

• Publish the game on Facebook within the
next one to two months.
• Study the different tagging behaviors of the
blocker and the couples.
• Apply the competitive mechanism to more
general human computation game design.

More from Academia Sinica

Although online games have been an important Internet activity today, players inevitably suffer from lag from time to time due to the Internet’s non-QoS-guaranteed architecture. Here by lag we refer to the phenomena when a game fails to respond to user commands or update the screen in a timely fashion due to long system processing or network delays. Currently, little is known about how game players feel about lag and how they react when encountering lag during game play. In this paper, we present an Internet survey that is designed to understand the following questions: 1) How do players perceive lag, 2) what do players think of the causes of lag, and 3) how do players react to lag. Our results show that game players often struggle with lag, because they are unable to identify the root cause. Therefore, they have to try any combination of possible solutions found on the Internet, blame game companies, or learn to cope. These findings manifest a strong demand for an automatic diagnostic tool that can identify the root cause of lag for gamers.

On The Battle between Online Gamers and Lags

Academia Sinica

Despite all the efforts devoted to improving the QoS of networked multimedia services, the baseline for such improvements has yet to be defined. In other words, although it is well recognized that better network conditions generally yield better service quality, the exact minimum level of network QoS required to ensure satisfactory user experience remains an open question. In this paper, we propose a general, cheat-proof framework that enables researchers to systematically quantify the minimum QoS needs for real-time networked multimedia services. Our framework has two major features: 1) it measures the quality of a service that users find intolerable by intuitive responses and therefore reduces the burden on experiment participants; and 2) it is cheat-proof because it supports systematic verification of the participants' inputs. Via a pilot study involving 38 participants, we verify the efficacy of our framework by proving that even inexperienced participants can easily produce consistent judgments. In addition, by cross-application and cross-service comparative analysis, we demonstrate the usefulness of the derived QoS thresholds. Such knowledge will serve important reference in the evaluation of competitive applications, application recommendation, network planning, and resource arbitration.

Quantifying QoS Requirements of Network Services: A Cheat-Proof Framework

Academia Sinica

To satisfy players' gaming experience, there is a strong need for a technique that can measure a game's quality systemically, efficiently, and reliably. In this paper, we propose to use paired comparisons and probabilistic choice models to quantify online games's QoE under various network situations. The advantages of our methodology over the traditional MOS ratings are 1) the rating procedure is simpler thus less burden is on experiment participants, 2) it derives ratio-scale scores, and 3) it enables systematic verification of participants' inputs. As a demonstration, we apply our methodology to evaluate three popular FPS (first-person-shooter) games, namely, Alien Arena (Alien), Halo, and Unreal Tournament (UT), and investigate their network robustness. The results indicate that Halo performs the best in terms of their network robustness against packet delay and loss. However, if we take the degree of the games' sophistication into account, we consider that the robustness of UT against downlink delays should able be improved. We also show that our methodology can be a helpful tool for making decisions about design alternatives, such how dead reckoning algorithms and time synchronization mechanisms should be implemented.

Online Game QoE Evaluation using Paired Comparisons

Academia Sinica

Cloud gaming is a promising application of the rapidly expanding cloud computing infrastructure. Existing cloud gaming systems, however, are closed-source with proprietary protocols, which raises the bars to setting up testbeds for experiencing cloud games. In this paper, we present a complete cloud gaming system, called GamingAnywhere, which is to the best of our knowledge the first open cloud gaming system. In addition to its openness, we design GamingAnywhere for high extensibility, portability, and reconfigurability. We implement GamingAnywhere on Windows, Linux, and OS X, while its client can be readily ported to other OS's, including iOS and Android. We conduct extensive experiments to evaluate the performance of GamingAnywhere, and compare it against two well-known cloud gaming systems: OnLive and StreamMyGame. Our experimental results indicate that GamingAnywhere is efficient and provides high responsiveness and video quality. For example, GamingAnywhere yields a per-frame processing delay of 34 ms, which is 3+ and 10+ times shorter than OnLive and StreamMyGame, respectively. Our experiments also reveal that all these performance gains are achieved without the expense of higher network loads; in fact, GamingAnywhere incurs less network traffic. The proposed GamingAnywhere can be employed by the researchers, game developers, service providers, and end users for setting up cloud gaming testbeds, which, we believe, will stimulate more research innovations on cloud gaming systems. GamingAnywhere is now publicly available at http://gaminganywhere.org.

GamingAnywhere: An Open Cloud Gaming System

Academia Sinica

Cloud gaming makes any computer game playable on a thin client without worrying the hardware requirements as before. It frees players from the need to constantly upgrade their computers as they can now play games that host on remote servers with a broadband Internet connection and a thin client. However, cloud games are intrinsically more susceptible to latency than online games because game graphics are rendered on server nodes and thin clients do not possess game state information that is required by delay compensation techniques. In this paper, we investigate how the response latency would affect users' experience when playing games on clouds and how the impact of latency on players' experience varies across different games. We show that not all games are equally friendly to cloud gaming. The same degree of latency may have very different impact on a game's quality of experience depending on the game's real-time strictness. We thus develop a model that can predict a game's real-time strictness based on the rate of players' inputs and game screen dynamics. The model can be used to enhance players' experience in cloud gaming and optimize data center operation cost simultaneously.

Are All Games Equally Cloud-Gaming-Friendly? An Electromyographic Approach

Academia Sinica

Identifying MMORPG Bots: A Traffic Analysis Approach

Academia Sinica

Peer-to-peer relaying is commonly used in realtime applications to cope with NAT and firewall restrictions and provide better quality network paths. As relaying is not natively supported by the Internet, it is usually implemented at the application layer. Also, in a modern operating system, the processor is shared, so the receive-process-forward process for each relay packet may take a considerable amount of time if the host is busy handling some other tasks. Thus, if we happen to select a loaded relay node, the relaying may introduce significant delays to the packet transmission time and even degrade the application performance. In this work, based on an extensive set of Internet traces, we pursue an understanding of the processing delays incurred at relay nodes and their impact on the application performance. Our contribution is three-fold: 1) we propose a methodology for measuring the processing delays at any relay node on the Internet; 2) we characterize the workload patterns of a variety of Internet relay nodes; and 3) we show that, serious VoIP quality degradation may occur due to relay processing, thus we have to monitor the processing delays of a relay node continuously to prevent the application performance from being degraded.

Toward an Understanding of the Processing Delay of Peer-to-Peer Relay Nodes

Academia Sinica

Normally, voice activity detection (VAD) refers to speech processing algorithms for detecting the presence or absence of human speech in segments of audio signals. In this paper, however, we focus on speech detection algorithms that take VoIP traffic instead of audio signals as input. We call this category of algorithms network-level VAD. Traditional VAD usually plays a fundamental role in speech processing systems because of its ability to delimit speech segments. Network-level VAD, on the other hand, can be quite helpful in network management, which is the motivation for our study. We propose the first real-time network-level VAD algorithm that can extract voice activity from encrypted and non-silence-suppressed Skype traffic. We evaluate the speech detection accuracy of the proposed algorithm with extensive reallife traces. The results show that our scheme achieve reasonably good performance even high degree of randomness has been injected into the network traffic.

Inferring Speech Activity from Encrypted Skype Traffic

Academia Sinica

In recent years, online gaming has become one of the most popular Internet activities, but cheating activity, such as the use of game bots, has increased as a consequence. Generally, the gaming community disagrees with the use of game bots, as bot users obtain unreasonable rewards without corresponding efforts. However, bots are hard to detect because they are designed to simulate human game playing behavior and they follow game rules exactly. Existing detection approaches either interrupt the players’gaming experience, or they assume game bots are run as standalone clients or assigned a specific goal, such as aim bots in FPS games. In this paper, we propose a trajectory-based approach to detect game bots. It is a general technique that can be applied to any game in which the avatar’s movement is controlled directly by the players. Through real-life data traces, we show that the trajectories of human players and those of game bots are very different. In addition, although game bots may endeavor to simulate players’ decisions, certain human behavior patterns are difficult to mimic because they are AI-hard. Taking Quake 2 as a case study, we evaluate our scheme’s performance based on reallife traces. The results show that the scheme can achieve a detection accuracy of 95% or higher given a trace of 200 seconds or longer.

Game Bot Detection Based on Avatar Trajectory

Academia Sinica

Improving Reliability of Web 2.0-based Rating Systems Using Per-user Trustiness

Academia Sinica

For current Web 2.0 services, manual examination of user uploaded content is normally required to ensure its legitimacy and appropriateness, which is a substantial burden to service providers. To reduce labor costs and the delays caused by content censoring, social moderation has been proposed as a front-line mechanism, whereby user moderators are encouraged to examine content before system moderation is required. Given the immerse amount of new content added to the Web each day, there is a need for automation schemes to facilitate rear system moderation. This kind of mechanism is expected to automatically summarize reports from user moderators and ban misbehaving users or remove inappropriate content whenever possible. However, the accuracy of such schemes may be reduced by collusion attacks, where some work together to mislead the automatic summarization in order to obtain shared benefits. In this paper, we propose a collusion-resistant automation scheme for social moderation systems. Because some user moderators may collude and dishonestly claim that a user misbehaves, our scheme detects whether an accusation from a user moderator is fair or malicious based on the structure of mutual accusations of all users in the system. Through simulations we show that collusion attacks are likely to succeed if an intuitive countbased automation scheme is used. The proposed scheme, which is based on the community structure of the user accusation graph, achieves a decent performance in most scenarios.

A Collusion-Resistant Automation Scheme for Social Moderation Systems

Academia Sinica

Determining how to transport delay-sensitive voice data has long been a problem in multimedia networking. The difficulty arises because voice and best-effort data are different by nature. It would not be fair to give priority to voice traffic and starve its best-effort counterpart; however, the voice data delivered might not be perceptible if each voice call is limited to the rate of an average TCP flow. To address the problem, we approach it from a user-centric perspective by tuning the voice data rate based on user satisfaction. Our contribution in this work is threefold. First, we investigate how Skype, the largest and fastest growing VoIP service on the Internet, adapts its voice data rate (i.e., the redundancy ratio) to network conditions. Second, by exploiting implementations of public domain codecs, we discover that Skype’s mechanism is not really geared to user satisfaction. Third, based on a set of systematic experiments that quantify user satisfaction under different levels of packet loss and burstiness, we derive a concise model that allows user-centric redundancy control. The model can be easily incorporated into general VoIP services (not only Skype) to ensure consistent user satisfaction.

Tuning Skype’s Redundancy Control Algorithm for User Satisfaction

Academia Sinica

While psychologists analyze network game-playing behavior in terms of players’ social interaction and experience, understanding user behavior is equally important to network researchers, because how users act determines how well network systems, such as online games, perform. To gain a better understanding of patterns of player interaction and their implications for game design, we analyze a 1, 356-millionpacket trace of ShenZhou Online, a mid-sized commercial MMORPG. This work is dedicated to draw out hints and implications of player interaction patterns, which is inferred from network-level traces, for online games. We find that the dispersion of players in a virtual world is heavy-tailed, which implies that static and fixed-size partitioning of game worlds is inadequate. Neighbors and teammates tend to be closer to each other in network topology. This property is an advantage, because message delivery between the hosts of interacting players can be faster than between those of unrelated players. In addition, the property can make game playing fairer, since interacting players tend to have similar latencies to their servers. We also find that participants who have a higher degree of social interaction tend to play much longer, and players who are closer in network topology tend to team up for longer periods. This suggests that game designers could increase the “stickiness” of games by encouraging, or even forcing, team playing.

Network Game Design: Hints and Implications of Player Interaction

Academia Sinica

With the emergence of active worms, the targets of attacks have been moved from well-known Internet servers to generic Internet hosts, and since the rate at which patches can be applied is always much slower than the spread of a worm, an Internet worm can usually attack or infect millions of hosts in a short time. It is difficult to eliminate Internet attacks globally; thus, protecting client networks from being attacked or infected is a relatively critical issue. In this paper, we propose a method that protects client networks from being attacked by people who try to scan, attack, or infect hosts in local networks via unpatched vulnerabilities. Based on the symmetry of network traffic in both temporal and spatial domains, a bitmap filter is installed at the entry point of a client network to filter out possible attack traffic. Our evaluation shows that with a small amount of memory (less than 1 megabyte), more than 95% of attack traffic can be filtered out in a small- or medium-scale client network.

Mitigating Active Attacks Towards Client Networks Using the Bitmap Filter

Academia Sinica

Online gaming has become increasingly popular in recent years. Currently, the most common business model of online gaming is based on monthly subscription fees that game players pay to obtain credits, which allow them to start or continue a journey in the game’s virtual world. Therefore, from the perspective of game operators, predicting how many players will join a game and how long they will stay in the game is important since these two factors dominate their revenue. This paper represents a pilot study of the predictability of online gamers’ subscription time. Specifically, we study the gameplay hours of online gamers and investigate whether strong patterns are embedded in their game hours. Our ultimate goal is to provide a prediction model of online gamers, which takes a player’s game hours as the input and predicts whether the player will leave in the near future. Our study is based on real-life traces collected from World of Warcraft, a famous MMORPG (Massively Multiplayer Online Role- Playing Game). The traces contain the gameplay histories of 34, 524 players during a two-year period. We believe that our study would be useful for building a prediction model of players’ future game hours and unsubscription decisions; i.e., decisions not to renew subscriptions. .

An Analysis of WoW Players’ Game Hours

Academia Sinica

Online gaming is one of the most profitable businesses on the Internet. Of all the genres of online games, MMORPGs (Massive Multiplayer Online Role Playing Games) have become the most popular among network gamers, and now attract millions of users who play in an evolving virtual world simultaneously over the Internet. To gain a better understanding of game traffic and contribute to the economic well-being of the Internet, we analyze a 1, 356-million-packet trace from a sizeable MMORPG called ShenZhou Online. This work is, as far as we know, the first formal analysis of MMORPG server traces. We find that MMORPG and FPS (First-Person Shooting) games are similar in that they both generate small packets and require low bandwidths. In practice, the bandwidth requirement of MMORPGs is the lower of the two due to less real-time game playing. More distinctive features are the strong periodicity, temporal locality, irregularity, and self-similarity observed in MMORPG traffic. The periodicity is due to a common practice in game implementation, where game state updates are accumulated within a fixed time window before transmission. The temporal locality in game traffic is largely due to the game’s nature, whereby one action leads to another. The irregularity, which is unique to MMORPG traffic, is due to the diversity of the game’s design so that the behavior of users can vary drastically, depending on the quest at hand. The self-similarity of the aggregate traffic is due to the heavy-tailed active/idle activities of individual players. Moreover, we show that the arrival of game sessions within one hour can be modelled by a Poisson model, while the duration of game sessions is heavy-tailed.

Game Traffic Analysis: An MMORPG Perspective

Academia Sinica

In this paper, we propose an analytical model for computing the utility of ESP games, i.e., the throughput rate of appropriate labels for given images. The model targets generalized games, where the number of players, the consensus threshold, and the stopping condition are variable. Via extensive simulations, we show that our model can accurately predict the stopping condition that will yield the optimal utility of an ESP game under a specific game setting. A service provider can therefore utilize the model to ensure that the hosted ESP games produce high-quality labels efficiently, given that the number of players willing to invest time and effort in the game is limited.

An Analytical Approach to Optimizing The Utility of ESP Games

Academia Sinica

TCP employs a self-clocking scheme that times the sending of packets. In that, the data packets are sent in a burst when the returning acknowledgement packet5 are received. This self-clocking scheme (also known as ack-clocking) is deemed a key factor to the the burstiness of TCP traffic and the source of various performance problemshigh packet loss, long delay, and high delay jitter. Previous work has suggested contradictively the effectiveness of TCP Pacing as a remedy to alleviate the traffic burstiness. In this paper, we analyze systematically and in more robust experiments the impact of network variabilities on the behavior of TCP clocking schemes. We find that 1) aggregated pacing traffic could be burstier than aggregated ack-clocking traffic. Physical explanation and experimental simulations are provided to support this argument. 2) The round-trip time heterogeneity and flow multiplexing significantly influence the behaviors of both ack-clocking and pacing schemes. Evaluating the performance of clocking schemes without considering these effects is prone to inconsistent results. 3) Pacing outperforms ack-clocking in more realistic settings from the trufic burstiness point of view.

The Impact of Network Variabilities on TCP Clocking Schemes

Academia Sinica

This paper presents a development of our comic generation system that automatically summarizes players' actions and interactions in the virtual world. The feature of the system is that it analyzes the log and screenshots of a game, decides which events are important and memorable, and then generates comics in a fully automatic manner. Also, the interface of our system allows users to customize their own comics. As a result, users can easily use the system to share their stories and create individual comics for archival purposes or storytelling.

Automatic Storytelling in Comics: A Case Study on World of Warcraft

Academia Sinica

In recent years, online gaming has become one of the most popular Internet activities, but cheating activity, such as the use of game bots, has increased as a consequence. Generally, the gaming community disapproves of the use of game bots, as bot users obtain unreasonable rewards without corresponding efforts. However, bots are hard to detect because they are designed to simulate human game playing behavior and they follow game rules exactly. Existing detection approaches either disrupt players’ gaming experiences, or they assume game bots are run as standalone clients or assigned a specific goal, such as aim bots in FPS games. In this paper, we propose a manifold learning approach for detecting game bots. It is a general technique that can be applied to any game in which avatars’ movement is controlled by the players directly. Through real-life data traces, we show that the trajectories of human players and those of game bots are very different. In addition, although game bots may endeavor to simulate players’ decisions, certain human behavior patterns are difficult to mimic because they are AI-hard. Taking Quake 2 as a case study, we evaluate our scheme’s performance based on real-life traces. The results show that the scheme can achieve a detection accuracy of 98% or higher on a trace of 700 seconds.

Game Bot Identification Based on Manifold Learning

Academia Sinica

More from Academia Sinica (20)

On The Battle between Online Gamers and Lags

Quantifying QoS Requirements of Network Services: A Cheat-Proof Framework

Online Game QoE Evaluation using Paired Comparisons

GamingAnywhere: An Open Cloud Gaming System

Are All Games Equally Cloud-Gaming-Friendly? An Electromyographic Approach

Identifying MMORPG Bots: A Traffic Analysis Approach

Toward an Understanding of the Processing Delay of Peer-to-Peer Relay Nodes

Inferring Speech Activity from Encrypted Skype Traffic

Game Bot Detection Based on Avatar Trajectory

Improving Reliability of Web 2.0-based Rating Systems Using Per-user Trustiness

A Collusion-Resistant Automation Scheme for Social Moderation Systems

Tuning Skype’s Redundancy Control Algorithm for User Satisfaction

Network Game Design: Hints and Implications of Player Interaction

Mitigating Active Attacks Towards Client Networks Using the Bitmap Filter

An Analysis of WoW Players’ Game Hours

Game Traffic Analysis: An MMORPG Perspective

An Analytical Approach to Optimizing The Utility of ESP Games

The Impact of Network Variabilities on TCP Clocking Schemes

Automatic Storytelling in Comics: A Case Study on World of Warcraft

Game Bot Identification Based on Manifold Learning

Recently uploaded

Three things you will take away from the session: • How to run an effective tenant-to-tenant migration • Best practices for before, during, and after migration • Tips for using migration as a springboard to prepare for Copilot in Microsoft 365 Main ideas: Migration Overview: The presentation covers the current reality of cross-tenant migrations, the triggers, phases, best practices, and benefits of a successful tenant migration Considerations: When considering a migration, it is important to consider the migration scope, performance, customization, flexibility, user-friendly interface, automation, monitoring, support, training, scalability, data integrity, data security, cost, and licensing structure Next Wave: The next wave of change includes the launch of Copilot, which requires businesses to be prepared for upcoming changes related to Copilot and the cloud, and to consolidate data and tighten governance ShareGate: ShareGate can help with pre-migration analysis, configurable migration tool, and automated, end-user driven collaborative governance

Strategize a Smooth Tenant-to-tenant Migration and Copilot Takeoff

sammart93

AWS Community Day CPH - Three problems of Terraform

Andrey Devyatkin

Boost Fertility New Invention Ups Success Rates.pdf

sudhanshuwaghmare1

In this keynote, Asanka Abeysinghe, CTO,WSO2 will explore the shift towards platformless technology ecosystems and their importance in driving digital adaptability and innovation. We will discuss strategies for leveraging decentralized architectures and integrating diverse technologies, with a focus on building resilient, flexible, and future-ready IT infrastructures. We will also highlight WSO2's roadmap, emphasizing our commitment to supporting this transformative journey with our evolving product suite.

Platformless Horizons for Digital Adaptability

WSO2

Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows. We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases. This video focuses on the deployment of external web forms using Jotform for Bonterra Impact Management. This solution can be customized to your organization’s needs and deployed to support the common use cases below: - Intake and consent - Assessments - Surveys - Applications - Program registration Interested in deploying web form automations for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.

Web Form Automation for Bonterra Impact Management (fka Social Solutions Apri...

Jeffrey Haguewood

Effective data discovery is crucial for maintaining compliance and mitigating risks in today's rapidly evolving privacy landscape. However, traditional manual approaches often struggle to keep pace with the growing volume and complexity of data. Join us for an insightful webinar where industry leaders from TrustArc and Privya will share their expertise on leveraging AI-powered solutions to revolutionize data discovery. You'll learn how to: - Effortlessly maintain a comprehensive, up-to-date data inventory - Harness code scanning insights to gain complete visibility into data flows leveraging the advantages of code scanning over DB scanning - Simplify compliance by leveraging Privya's integration with TrustArc - Implement proven strategies to mitigate third-party risks Our panel of experts will discuss real-world case studies and share practical strategies for overcoming common data discovery challenges. They'll also explore the latest trends and innovations in AI-driven data management, and how these technologies can help organizations stay ahead of the curve in an ever-changing privacy landscape.

TrustArc Webinar - Unlock the Power of AI-Driven Data Discovery

TrustArc

Exploring Multimodal Embeddings with Milvus

Zilliz

ProductAnonymous-April2024-WinProductDiscovery-MelissaKlemke

Product Anonymous

Elevate Developer Efficiency & build GenAI Application with Amazon Q

Bhuvaneswari Subramani

EMPOWERMENT TECHNOLOGY GRADE 11 QUARTER 2 REVIEWER

MadyBayot

Strategies for Landing an Oracle DBA Job as a Fresher

Remote DBA Services

💉💊+971581248768>> SAFE AND ORIGINAL ABORTION PILLS FOR SALE IN DUBAI AND ABUDHABI}}+971581248768 +971581248768 Mtp-Kit (500MG) Prices » Dubai [(+971581248768**)] Abortion Pills For Sale In Dubai, UAE, Mifepristone and Misoprostol Tablets Available In Dubai, UAE CONTACT DR.Maya Whatsapp +971581248768 We Have Abortion Pills / Cytotec Tablets /Mifegest Kit Available in Dubai, Sharjah, Abudhabi, Ajman, Alain, Fujairah, Ras Al Khaimah, Umm Al Quwain, UAE, Buy cytotec in Dubai +971581248768''''Abortion Pills near me DUBAI | ABU DHABI|UAE. Price of Misoprostol, Cytotec” +971581248768' Dr.DEEM ''BUY ABORTION PILLS MIFEGEST KIT, MISOPROTONE, CYTOTEC PILLS IN DUBAI, ABU DHABI,UAE'' Contact me now via What's App…… abortion Pills Cytotec also available Oman Qatar Doha Saudi Arabia Bahrain Above all, Cytotec Abortion Pills are Available In Dubai / UAE, you will be very happy to do abortion in Dubai we are providing cytotec 200mg abortion pill in Dubai, UAE. Medication abortion offers an alternative to Surgical Abortion for women in the early weeks of pregnancy. We only offer abortion pills from 1 week-6 Months. We then advise you to use surgery if its beyond 6 months. Our Abu Dhabi, Ajman, Al Ain, Dubai, Fujairah, Ras Al Khaimah (RAK), Sharjah, Umm Al Quwain (UAQ) United Arab Emirates Abortion Clinic provides the safest and most advanced techniques for providing non-surgical, medical and surgical abortion methods for early through late second trimester, including the Abortion By Pill Procedure (RU 486, Mifeprex, Mifepristone, early options French Abortion Pill), Tamoxifen, Methotrexate and Cytotec (Misoprostol). The Abu Dhabi, United Arab Emirates Abortion Clinic performs Same Day Abortion Procedure using medications that are taken on the first day of the office visit and will cause the abortion to occur generally within 4 to 6 hours (as early as 30 minutes) for patients who are 3 to 12 weeks pregnant. When Mifepristone and Misoprostol are used, 50% of patients complete in 4 to 6 hours; 75% to 80% in 12 hours; and 90% in 24 hours. We use a regimen that allows for completion without the need for surgery 99% of the time. All advanced second trimester and late term pregnancies at our Tampa clinic (17 to 24 weeks or greater) can be completed within 24 hours or less 99% of the time without the need surgery. The procedure is completed with minimal to no complications. Our Women's Health Center located in Abu Dhabi, United Arab Emirates, uses the latest medications for medical abortions (RU-486, Mifeprex, Mifegyne, Mifepristone, early options French abortion pill), Methotrexate and Cytotec (Misoprostol). The safety standards of our Abu Dhabi, United Arab Emirates Abortion Doctors remain unparalleled. They consistently maintain the lowest complication rates throughout the nation. Our Physicians and staff are always available to answer questions and care for women in one of the most difficult times in their lives. The decision to have an abortion at the Abortion Cl

+971581248768>> SAFE AND ORIGINAL ABORTION PILLS FOR SALE IN DUBAI AND ABUDHA...

?#DUbAI#??##{{(☎️+971_581248768%)**%*]'#abortion pills for sale in dubai@

Vector Search -An Introduction in Oracle Database 23ai.pptx

Remote DBA Services

The microservices honeymoon is over. When starting a new project or revamping a legacy monolith, teams started looking for alternatives to microservices. The Modular Monolith, or 'Modulith', is an architecture that reaps the benefits of (vertical) functional decoupling without the high costs associated with separate deployments. This talk will delve into the advantages and challenges of this progressive architecture, beginning with exploring the concept of a 'module', its internal structure, public API, and inter-module communication patterns. Supported by spring-modulith, the talk provides practical guidance on addressing the main challenges of a Modultith Architecture: finding and guarding module boundaries, data decoupling, and integration module-testing. You should not miss this talk if you are a software architect or tech lead seeking practical, scalable solutions. About the author With two decades of experience, Victor is a Java Champion working as a trainer for top companies in Europe. Five thousands developers in 120 companies attended his workshops, so he gets to debate every week the challenges that various projects struggle with. In return, Victor summarizes key points from these workshops in conference talks and online meetups for the European Software Crafters, the world’s largest developer community around architecture, refactoring, and testing. Discover how Victor can help you on victorrentea.ro : company training catalog, consultancy and YouTube playlists.

Modular Monolith - a Practical Alternative to Microservices @ Devoxx UK 2024

Victor Rentea

Following the popularity of "Cloud Revolution: Exploring the New Wave of Serverless Spatial Data," we're thrilled to announce this much-anticipated encore webinar. In this sequel, we'll dive deeper into the Cloud-Native realm by uncovering practical applications and FME support for these new formats, including COGs, COPC, FlatGeoBuf, GeoParquet, STAC, and ZARR. Building on the foundation laid by industry leaders Michelle Roby of Radiant Earth and Chris Holmes of Planet in the first webinar, this second part offers an in-depth look at the real-world application and behind-the-scenes dynamics of these cutting-edge formats. We will spotlight specific use-cases and workflows, showcasing their efficiency and relevance in practical scenarios. Discover the vast possibilities each format holds, highlighted through detailed discussions and demonstrations. Our expert speakers will dissect the key aspects and provide critical takeaways for effective use, ensuring attendees leave with a thorough understanding of how to apply these formats in their own projects. Elevate your understanding of how FME supports these cutting-edge technologies, enhancing your ability to manage, share, and analyze spatial data. Whether you're building on knowledge from our initial session or are new to the serverless spatial data landscape, this webinar is your gateway to mastering cloud-native formats in your workflows.

Cloud Frontiers: A Deep Dive into Serverless Spatial Data and FME

Safe Software

[BuildWithAI] Introduction to Gemini.pdf

Sandro Moreira

The Good, the Bad and the Governed - Why is governance a dirty word? David O'Neill, Chief Operating Officer - APIContext Apidays New York 2024: The API Economy in the AI Era (April 30 & May 1, 2024) ------ Check out our conferences at https://www.apidays.global/ Do you want to sponsor or talk at one of our conferences? https://apidays.typeform.com/to/ILJeAaV8 Learn more on APIscene, the global media made by the community for the community: https://www.apiscene.io Explore the API ecosystem with the API Landscape: https://apilandscape.apiscene.io/

Apidays New York 2024 - The Good, the Bad and the Governed by David O'Neill, ...

apidays

"I see eyes in my soup": How Delivery Hero implemented the safety system for ...

Zilliz

DBX First Quarter 2024 Investor Presentation

Dropbox

Dubai, known for its towering skyscrapers, luxurious lifestyle, and relentless pursuit of innovation, often finds itself in the global spotlight. However, amidst the glitz and glamour, the emirate faces its own set of challenges, including the occasional threat of flooding. In recent years, Dubai has experienced sporadic but significant floods, disrupting normalcy and posing unique challenges to its infrastructure. Among the critical nodes in this bustling metropolis is the Dubai International Airport, a vital hub connecting the world. This article delves into the intersection of Dubai flood events and the resilience demonstrated by the Dubai International Airport in the face of such challenges.

Rising Above_ Dubai Floods and the Fortitude of Dubai International Airport.pdf

Orbitshub

Recently uploaded (20)

Strategize a Smooth Tenant-to-tenant Migration and Copilot Takeoff

AWS Community Day CPH - Three problems of Terraform

Boost Fertility New Invention Ups Success Rates.pdf

Platformless Horizons for Digital Adaptability

Web Form Automation for Bonterra Impact Management (fka Social Solutions Apri...

TrustArc Webinar - Unlock the Power of AI-Driven Data Discovery

Exploring Multimodal Embeddings with Milvus

ProductAnonymous-April2024-WinProductDiscovery-MelissaKlemke

Elevate Developer Efficiency & build GenAI Application with Amazon Q

EMPOWERMENT TECHNOLOGY GRADE 11 QUARTER 2 REVIEWER

Strategies for Landing an Oracle DBA Job as a Fresher

+971581248768>> SAFE AND ORIGINAL ABORTION PILLS FOR SALE IN DUBAI AND ABUDHA...

Vector Search -An Introduction in Oracle Database 23ai.pptx

Modular Monolith - a Practical Alternative to Microservices @ Devoxx UK 2024

Cloud Frontiers: A Deep Dive into Serverless Spatial Data and FME

[BuildWithAI] Introduction to Gemini.pdf

Apidays New York 2024 - The Good, the Bad and the Governed by David O'Neill, ...

"I see eyes in my soup": How Delivery Hero implemented the safety system for ...

DBX First Quarter 2024 Investor Presentation

Rising Above_ Dubai Floods and the Fortitude of Dubai International Airport.pdf

KissKissBan: A Competitive Human Computation Game for Image Annotation

1. KissKissBan A Competitive Human Computation Game for Image Annotation Chien-Ju Ho*, Tao-Hsuan Chang+, Jong-Chuan Lee+, Jane Yun-jen Hsu+, Kuan-Ta Chen* *Academia Sinica +National Taiwan University

2. Human Computation Game Collaborative Mechanisms

3. Coalition Problem Limited Data Diversity

4. The ESP Game • Coalition problem • partner with themselves • uniﬁed strategy • Limited diversity • easy words ﬁrst

5. Competitive Mechanism?

6. Player 1 Player 2 DOG CUTE FLOWER WOOD FLOOR DOG

7. Player 1 Player 2 DOG CUTE FLOWER WOOD FLOOR DOG DELIVER EMOTION BY TYPING THE SAME WORD

8. Couple Couple DOG CUTE FLOWER WOOD FLOOR DOG DELIVER EMOTION BY TYPING THE SAME WORD

9. Blocker Couple Couple DOG DOG CUTE WHITE FLOWER WOOD FLOOR DOG

10. Blocker Couple Couple DOG DOG CUTE WHITE FLOWER WOOD FLOOR DOG KissKissBan A Competitive Human Computation Game for Image Annotation

11. Blocker Couple Couple DOG CUTE DOG Blocked WHITE WOOD FLOWER FLOWER FLOOR The blocked words -5s game time -5s game time 1. First, the blocker has 7 seconds to type words 2. Then, the couples has 30 seconds to type words

12. Blocker Couple Couple DOG CUTE DOG WHITE WOOD FLOWER FLOWER FLOOR Couples win for matching within time limit 1. First, the blocker has 7 seconds to type words 2. Then, the couples has 30 seconds to type words

13. Screenshots of KissKissBan

14. Intuitions Behind the Game

15. Incentive Structure • Zero sum game • strict competitive • players can not beneﬁt from coalition • Different decision time periods • harder words, longer consideration [Barry et al. 2001] • diverse data contribution

16. Small-scale Experiment • Image Source • 125 images randomly from ESP dataset • Experiment Setup • 17-player gameplay survey • Data collection on Mechanical Turk

17. Gameplay Survey • Fun • 3.76/5 overall rating • 15/17 players claim that would play again • over 60% like to play as a blocker

18. MTurk Experiment • Collecting data from anonymous users • Publish two games for comparison • KissKissBan • ESP Game without taboo words • Each game is played for ~5000 rounds

19. Example of Collected Data ESP ML-KKB BL-KKB beach 3 sea 9 water 3 man 21 man 8 sand 3 beach 10 ocean 3 sea 2 karate 5 black 1 ninja 1 water 1 china 1 kungfu 1 sand 1 ocean 1 ML-KKB: matching between couples BL-KKB: matching between couple and blocker

20. MTurk Experiment • Data property • For each image • ESP: 39.96 labels, 6.56 distinct labels • KKB: 44.17 labels, 11.53 distinct labels • A more diverse player contribution

21. Conclusion • We proposed a competitive human computation game, KissKissBan. • KissKissBan has two nice properties • a player-level anti-coalition mechanism • diverse player input

22. More in the Future • Publish the game on Facebook within the next one to two months. • Study the different tagging behaviors of the blocker and the couples. • Apply the competitive mechanism to more general human computation game design.

23. Q &A

KissKissBan: A Competitive Human Computation Game for Image Annotation

Recommended

Recommended

More Related Content

More from Academia Sinica

More from Academia Sinica (20)

Recently uploaded

Recently uploaded (20)

KissKissBan: A Competitive Human Computation Game for Image Annotation