How to present ideas in idea crowdsourcing communities? Pathways for idea convergence and divergence performances

Currently, idea crowdsourcing communities are widely used for solving problems and fostering innovation. However, when encountering substantial ideas delivered by idea crowdsourcing communities, individuals are hard to generate novel ideas (i.e., idea divergence) and evaluate the appropriateness of the delivered idea (i.e., idea convergence). To address this challenge, platform operators tend to improve the idea presentation design. However, the effectiveness of these idea presentation designs for idea crowdsourcing community users remains unclear. Therefore, we tend to uncover the influencing mechanism of four types of idea presentation design (idea tree, slides, lists, and grids) on idea divergence and convergence outcomes. Accordingly, we adopt dual pathway to creativity model as our theoretical framework and propose an experimental research design. This study will provide insights into platform attribute design and design strategies for improving idea divergence and convergence outcomes

A Performance Analysis Model of TCP over Multiple Heterogeneous Paths for 5G Mobile Services

Driven by the primary requirement of emerging 5G mobile services, the demand for concurrent multipath transfer (CMT) is still prominent. Yet, multipath transport protocols are not widely adopted and TCP-based CMT schemes will still be in dominant position in 5G. However, the performance of TCP flow transferred over multiple heterogeneous paths is prone to the link quality asymmetry, the extent of which was revealed to be significant by our field investigation. In this paper, we present a performance analysis model for TCP over multiple heterogeneous paths in 5G scenarios, where both bandwidth and delay asymmetry are taken into consideration. The evaluation adopting parameters from field investigation shows that the proposed model can achieve high accuracy in practical environments. Some interesting inferences can be drawn from the proposed model, such as the dominant factor that affect the performance of TCP over heterogeneous networks, and the criteria of determining the appropriate number of links to be used under different circumstances of path heterogeneity. Thus, the proposed model can provide a guidance to the design of TCP-based CMT solutions for 5G mobile services

RISE: Robust Wireless Sensing Using Probabilistic and Statistical Assessments

Peer reviewe

An incentive mechanism for data sharing based on blockchain with smart contracts

© 2020 Data sharing techniques have progressively drawn increasing attention as a means of significantly reducing repetitive work. However, in the process of data sharing, the challenges regarding formation of mutual-trust relationships and increasing the level of user participation are yet to be solved. The existing solution is to use a third party as a trust organization for data sharing, but there is no dynamic incentive mechanism for data sharing with a large number of users. Blockchain 2.0 with smart contract has the natural advantage of being able to enable trust and automated transactions between a large number of users. This paper proposes a data sharing incentive model based on evolutionary game theory using blockchain with smart contract. The smart contract mechanism can dynamically control the excitation parameters and continuously encourages users to participate in data sharing

Graph Meets LLM: A Novel Approach to Collaborative Filtering for Robust Conversational Understanding

Conversational AI systems such as Alexa need to understand defective queries to ensure robust conversational understanding and reduce user friction. These defective queries often arise from user ambiguities, mistakes, or errors in automatic speech recognition (ASR) and natural language understanding (NLU). Personalized query rewriting is an approach that focuses on reducing defects in queries by taking into account the user's individual behavior and preferences. It typically relies on an index of past successful user interactions with the conversational AI. However, unseen interactions within the user's history present additional challenges for personalized query rewriting. This paper presents our "Collaborative Query Rewriting" approach, which specifically addresses the task of rewriting new user interactions that have not been previously observed in the user's history. This approach builds a "User Feedback Interaction Graph" (FIG) of historical user-entity interactions and leverages multi-hop graph traversal to enrich each user's index to cover future unseen defective queries. The enriched user index is called a Collaborative User Index and contains hundreds of additional entries. To counteract precision degradation from the enlarged index, we add additional transformer layers to the L1 retrieval model and incorporate graph-based and guardrail features into the L2 ranking model. Since the user index can be pre-computed, we further investigate the utilization of a Large Language Model (LLM) to enhance the FIG for user-entity link prediction in the Video/Music domains. Specifically, this paper investigates the Dolly-V2 7B model. We found that the user index augmented by the fine-tuned Dolly-V2 generation significantly enhanced the coverage of future unseen user interactions, thereby boosting QR performance on unseen queries compared with the graph traversal only approach

Exploiting wireless received signal strength indicators to detect evil-twin attacks in smart homes

Evil-twin is becoming a common attack in Smart Home environments where an attacker can set up a fake AP to compromise the security of the connected devices. To identify the fake APs, The current approaches of detecting Evil-twin attacks all rely on information such as SSIDs, the MAC address of the genuine AP or network traffic patterns. However, such information can be faked by the attacker, often leading to low detection rates and weak protection. This paper presents a novel evil-twin attack detection method based on the received signal strength indicator (RSSI). Our key insight is that the location of the genuine AP rarely moves in a home environment and as a result the RSSI of the genuine AP is relatively stable. Our approach considers the RSSI as a fingerprint of APs and uses the fingerprint of the genuine AP to identify fake ones. We provide two schemes to detect a fake AP in two different scenarios where the genuine AP can be located at either a single or multiple locations in the property, by exploiting the multipath effect of the WIFI signal. As a departure from prior work, our approach does not rely on any professional measurement devices. Experimental results show that our approach can successfully detect 90% of the fake APs, at the cost of an one-off, modest connection delay

Exploiting dynamic scheduling for VM-based code obfuscation

Code virtualization built upon virtual machine (VM) technologies is emerging as a viable method for implementing code obfuscation to protect programs against unauthorized analysis. State-of-the-art VM-based protection approaches use a fixed scheduling structure where the program follows a single, static execution path for the same input. Such approaches, however, are vulnerable to certain scenarios where the attacker can reuse knowledge extracted from previously seen software to crack applications using similar protection schemes. This paper presents DSVMP, a novel VM-based code obfuscation approach for software protection. DSVMP brings together two techniques to provide stronger code protection than prior VM-based schemes. Firstly, it uses a dynamic instruction scheduler to randomly direct the program to execute different paths without violating the correctness across different runs. By randomly choosing the program execution paths, the application exposes diverse behavior, making it much more difficult for an attacker to reuse the knowledge collected from previous runs or similar applications to perform attacks. Secondly, it employs multiple VMs to further obfuscate the relationship between VM bytecode and their interpreters, making code analysis even harder. We have implemented DSVMP in a prototype system and evaluated it using a set of widely used applications. Experimental results show that DSVMP provides stronger protection with comparable runtime overhead and code size when compared to two commercial VMbased code obfuscation tools

Preparation of imine alkaloids from norditerpenoids alkaloids

682-68