Search

Mobile crowdsensing has become increasingly popular due to its ability to collect a massive amount of data with the help of many individual smartphone users. A crowdsensing platform can utilize the collected data to extract effective information and provide diverse services. Designing an incentive mechanism to compensate the participants for their resources consumption is critical in attracting more participation. Offline incentive mechanism design has been widely studied in various crowdsensing applications, whereas the online scenario, is much more challenging due to the unavailability of future information when the platform makes user selection decisions. In this paper, we investigate the problem of online crowdsensing by considering a critical property that the values of users’ contributions decrease as time goes by. The time-discounting property is common in inter-temporal choice scenarios but has not been carefully addressed from the perspective of mechanism design. To handle this problem, we propose a new method to select users based on a time-dependent threshold, and present a strategy-proof framework where participants prefer to submit their true types, instead of manipulating the market by misreporting their private information. We consider two cases, one is that the total value is the summation of each participant's contributing value, the other is more general that the total value function is submodular. We call these two mechanisms TDM and TDMS, respectively. We prove that our two mechanisms can achieve computational efficiency, budget feasibility, strategy-proofness, and a constant competitive ratio, in the context of time-discounting values. By comparing our mechanisms with the state-of-the-art methods, we show that our design achieves better performance in terms of the total value. [ABSTRACT FROM AUTHOR]

Knowledge graph is becoming an indispensable resource that offers structured information for numerous AI applications. However, the knowledge graph often suffers from its incompleteness. Building a complete, high-quality knowledge graph is time-consuming and requires significant human annotation efforts. In this paper, we study the Knowledge Graph Population task, which aims at extending the scale of structured knowledge, with a special focus on reducing data preparation and annotation efforts. Previous works mainly based on discriminative methods build classifiers and verify candidate triplets that are extracted from texts, which heavily rely on the quality of data collection and co-occurrance of entities in the text. However, such methods fail to generalize on entity pairs that are not highly co-occurred, and fail to discover entity pairs that are not co-occurred at all in the given text corpus. We introduce a generative perspective to approach this task and define each relationship by learning the data distribution that embodies the core common properties for relational reasoning. A generative model KGGen is proposed, which samples from the learned data distribution for each relation and can generate triplets regardless of entity pair co-occurrence in the text corpus. To further improve the generation quality while alleviate human annotation efforts, adversarial learning is adopted to not only encourage generating high quality triplets, but also give model the ability to automatically assess the generation quality. Quantitative and qualitative experimental results conducted on two real-world generic knowledge graphs show that the proposed model KGGen generates novel and meaningful triplets with improved efficiency and less human annotation comparing with the state-of-the-art approaches. [ABSTRACT FROM AUTHOR]

Interictal epileptiform spike (referred to as spike) detected from electroencephalograms lasting only 20- to 200-ms can provide a reliable evidence-based indicator for clinical seizure type diagnosis. Recent feature representation approaches focus either on the concrete-level or abstract-level information mining of the spike, thus demonstrating suboptimal detection performance. Additionally, existing abstract-level information mining methods of the spike based deep learning networks have not realized the effective feature representation of long-term dependent distinguished information within similar waveform cycles caused by morphological heterogeneity, which affects detection performance. Thus, a multilevel feature learning method for accurate spike detection was proposed in this study. Specifically, the spatio-temporal-frequency multidomain information in concrete-level first are inferred the common mimetic properties of the spike using the multidomain feature extractors. Then, the effective feature representation of long-term dependent distinguished information within similar waveform cycles caused by morphological heterogeneity is suitably captured using the temporal convolutional network. Finally, the spatio-temporal-frequency multidomain long-term dependent feature representation of spike is calculated using the element-wise manner to fuse the feature representation in concrete- and abstract-levels. The experimental results indicate that the proposed method can achieve an accuracy of 90.62±1.38%, sensitivity of 90.38±1.52%, specificity of 91.00±1.60%, precision of 90.33±4.71%, and the false detection rate per minute is $0.148\pm 0.020\text{m}^{-1}$ , which are higher than when using the feature representation in the concrete-or abstract-level alone. Additionally, the detection results indicate that the proposed method avoids the subjectivity and inefficiency of visual inspection, and it enables a highly accurate detection of the spike. [ABSTRACT FROM AUTHOR]

We study common randomness generation problems where $n$ players aim to generate same sequences of random coin flips where some subsets of the players share an independent common coin which can be tossed multiple times, and there is a publicly seen blackboard through which the players communicate with each other. We provide a tight representation of the optimal communication rates via linear programming, and more importantly, propose explicit algorithms for the optimal distributed simulation for a wide class of hypergraphs. In particular, the optimal communication rate in complete hypergraphs is still achievable in sparser hypergraphs containing a path-connected cycle-free cluster of topologically connected components. Some key steps in analyzing the upper bounds rely on two different definitions of connectivity in hypergraphs, which may be of independent interest. [ABSTRACT FROM AUTHOR]