Previous research indicates that specific sub-networks within the attentional networks show abnormalities in individuals with problematic smartphone use. However, there has been insufficient exploration of the cognitive neurobiological mechanisms that underpin this phenomenon. We combined behavioural assessments with electrophysiological measures to address behavioural data limitations. Twenty-two individuals with problematic smartphone usage and twenty-two non-problematic smartphone users completed the behavioural data recording, while twenty-one individuals from each group completed the ERP data recording during the Attention Network Test (ANT). Behaviorally, the results indicated no difference in the three attention networks between the two groups. Electrophysiological data reveal that components associated with alerting and orienting (cue-N1) are similar between both groups, while differences are observed in components related to executive control (target-N2). These results suggest that individuals with problematic smartphone use may need to engage additional compensatory cognitive resources to achieve equivalent behavioural performance in executive control tasks compared to controls.

The advent of edge intelligence and escalating concerns for data privacy protection have sparked a surge of interest in device-cloud collaborative computing. Large-scale device deployments to validate prototype solutions are often prohibitively expensive and practically challenging, resulting in a pronounced demand for simulation tools that can emulate real-world scenarios. However, existing simulators predominantly rely solely on high-performance servers to emulate edge computing devices, overlooking (1) the discrepancies between virtual computing units and actual heterogeneous computing devices and (2) the simulation of device behaviors in real-world environments. In this paper, we propose a high-fidelity device simulation platform, called SimDC, which uses a hybrid heterogeneous resource and integrates high-performance servers and physical mobile phones. Utilizing this platform, developers can simulate numerous devices for functional testing cost-effectively and capture precise operational responses from varied real devices. To simulate real behaviors of heterogeneous devices, we offer a configurable device behavior traffic controller that dispatches results on devices to the cloud using a user-defined operation strategy. Comprehensive experiments on the public dataset show the effectiveness of our simulation platform and its great potential for application.1

This article is concerned with the issue of event-triggered asynchronous fault detection filtering (AFDF) for switched T-S fuzzy systems (STSFSs) under hybrid attacks. First, a resilient event-triggering mechanism (ETM) is introduced, which not only removes the constraint that the interval between two consecutive triggering instants must be strictly less than the average dwell time but also ensures the immediate release of data upon the cessation of attacks. Second, the paper takes into account the simultaneous presence of deception attacks and DoS attacks in the transmission of network information. Within this framework, the transmission signals are susceptible to attacks, and the ETM causes asynchronous behavior between filter modes and system modes, increasing the complexity of the filter design. To conquer this challenge, the dynamic characteristics of the initial system are integrated with the fault detection filter, hybrid attacks, and ETM to formulate a novel switching residual model. Third, a set of multiple Lyapunov functions, correlating with the filter modes, system modes, and attack signals, which is constructed to analyze the exponential stability and H ∞ performance of the switching residual system. Ultimately, the effectiveness of the proposed methods is validated through two illustrative examples.

Major Depressive Disorder (MDD) is a debilitating condition marked by persistent low mood, reduced interest, cognitive impairments, and vegetative neurological symptoms such as sleep and appetite disturbances. In this paper, we collected eye movement signals from 40 patients diagnosed with MDD and 40 healthy controls to study the relation between eye movements and cognitive processes for depression detection. The eye movement data were captured during a novel emotional cognition task using oil paintings. Subsequently, the data were transformed into multiview eye movement features, including heatmaps, trajectories, and statistical vectors. Rigorous statistical analyses were then conducted on these features to identify significant patterns and correlations between eye movements and depressive symptoms. A multiview invariant & specific eye movement model (MISEYE) was proposed to fuse different eye movement features. The proposed achieved an accuracy rate of 79.88% in depression detection. This performance surpassed not only the outcomes of single-mode approaches and combinations of any two features but also outperformed other fusion methodologies. These findings not only shed light on the intricate relationship between eye movement patterns and MDD but also underscore the potential of eye-tracking technology in psychiatric research.

Existing WiFi recognition schemes are capable of discovering patterns of indoor semantics, such as human activity, identity, indoor environment, and so on. We note that channel state information (CSI) presents an opportunity for hackers to learn indoor privacy, however, currently there is a lack of security research on CSI. In this article, we are the first to discuss and define the security problem of CSI signals, which is further extended to the problems of nontargeted protection and targeted protection. To solve them, we present two types of adversarial autoencoder networks (AAENs). Through replacing the original signals with the generated adversarial ones, the protected semantic features are modified, and the significant features of the other semantics required to be recognized are reserved. Intensive evaluations demonstrate that with the proposed AAENs, the recognition accuracy of the protected semantic can be significantly decreased, while still maintaining the other semantics to be identified correctly.

Recent works on adversarial examples for image classification focus on directly modifying pixels with minor perturbations. The small perturbation requirement is imposed to ensure the generated adversarial examples being natural and realistic to humans, which, however, puts a curb on the attack space thus limiting the attack ability and transferability especially for systems protected by a defense mechanism. In this paper, we propose the novel concepts of structure patterns and structure-aware perturbations that relax the small perturbation constraint while still keeping images natural. The key idea of our approach is to allow perceptible deviation in adversarial examples while keeping structure patterns that are central to a human classifier. Built upon these concepts, we propose a \emph{structure-preserving attack (SPA)} for generating natural adversarial examples with extremely high transferability. Empirical results on the MNIST and the CIFAR10 datasets show that SPA exhibits strong attack ability in both the white-box and black-box setting even defenses are applied. Moreover, with the integration of PGD or CW attack, its attack ability escalates sharply under the white-box setting, without losing the outstanding transferability inherited from SPA.

Point-of-interest (POI) retrieval that searches for relevant destination locations plays a significant role in on-demand ridehailing services. Existing solutions to POI retrieval mainly retrieve and rank POIs based on their semantic similarity scores. Although intuitive, quantifying the relevance of a Query-POI pair by single-field semantic similarity is subject to inherent limitations. In this paper, we propose a novel Query-POI relevance model for effective POI retrieval for ondemand ride-hailing services. Different from existing relevance models, we capture and represent multi-field and local&global semantic features of a Query-POI pair to measure the semantic similarity. Besides, we observe a hidden correlation between origin-destination locations in ride-hailing scenarios, and propose two location embeddings to characterize the specific correlation. By incorporating the geographic correlation with the semantic similarity, our model achieves better performance in POI ranking. Experimental results on two real-world click-through datasets demonstrate the improvements of our model over state-of-the-art methods.

In this paper, we consider some cosine similarity measures and distance measures between q-rung orthopair fuzzy sets (q-ROFSs). First, we define a cosine similarity measure and a Euclidean distance measure of q-ROFSs, their properties are also studied. Considering that the cosine measure does not satisfy the axiom of similarity measure, then we propose a method to construct other similarity measures between q-ROFSs based on the proposed cosine similarity and Euclidean distance measures, and it satisfies with the axiom of the similarity measure. Furthermore, we obtain a cosine distance measure between q-ROFSs by using the relationship between the similarity and distance measures, then we extend technique for order of preference by similarity to the ideal solution method to the proposed cosine distance measure, which can deal with the related decision-making problems not only from the point of view of geometry but also from the point of view of algebra. Finally, we give a practical example to illustrate the reasonableness and effectiveness of the proposed method, which is also compared with other existing methods.

In this paper, we first introduce the concept of q-rung orthopair hesitant fuzzy set ( q-ROHFS) and discuss the operational laws between any two q-ROHFSs. Then the distance measures between q-ROHFSs are proposed based on the concept of “multiple fuzzy sets”, and we develop the TOPSIS method to the proposed distance measures. The proposed distance measures not only retain the preference information expressed by q-ROHFSs, but also deal with the q-rung orthopair hesitant fuzzy decision information more objectively, In fact, the method can avoid the loss and distortion of the information in actual decision-making process. Furthermore, we give an illustrative example about the selection of energy projects to illustrate the reasonableness and effectiveness of the proposed method, which is also compared with other existing methods. Finally, we make the sensitivity analysis of the parameters in proposed distance measures about the selection of energy projects.

Auctions are believed to be effective methods to solve the problem of wireless spectrum allocation. Existing spectrum auction mechanisms are all centralized and suffer from several critical drawbacks of the centralized systems, which motivates the design of distributed spectrum auction mechanisms. However, extending a centralized spectrum auction to a distributed one broadens the strategy space of agents from one dimension (bid) to three dimensions (bid, communication, and computation), and thus cannot be solved by traditional approaches from mechanism design. In this paper, we propose two distributed spectrum auction mechanisms, namely distributed VCG and FAITH. Distributed VCG implements the celebrated Vickrey-Clarke-Groves mechanism in a distributed fashion to achieve optimal social welfare, at the cost of exponential communication overhead. In contrast, FAITH achieves sub-optimal social welfare with tractable computation and communication overhead. We prove that both of the two proposed mechanisms achieve faithfulness, i.e., the agents' individual utilities are maximized, if they follow the intended strategies. Besides, we extend FAITH to adapt to dynamic scenarios where agents can arrive or depart at any time, without violating the property of faithfulness. We implement distributed VCG and FAITH, and evaluate their performance in various setups. Evaluation results show that distributed VCG results in optimal allocation, while FAITH is more efficient in computation and communication.

In crowdsensing, appropriate rewards are always expected to compensate the participants for their consumptions of physical resources and involvements of manual efforts. While continuous low quality sensing data could do harm to the availability and preciseness of crowdsensing based services, few existing incentive mechanisms have ever addressed the issue of data quality. The design of quality based incentive mechanism is motivated by its potential to avoid inefficient sensing and unnecessary rewards. In this paper, we incorporate the consideration of data quality into the design of incentive mechanism for crowdsensing, and propose to pay the participants as how well they do, to motivate the rational participants to efficiently perform crowdsensing tasks. This mechanism estimates the quality of sensing data, and offers each participant a reward based on her effective contribution. We also implement the mechanism and evaluate its improvement in terms of quality of service and profit of service provider. The evaluation results show that our mechanism achieves superior performance when compared to general data collection model and uniform pricing scheme.

Auctions are believed to be effective methods to solve the problem of wireless spectrum allocation. Existing spectrum auction mechanisms are all centralized and suffer from several critical drawbacks of the centralized systems, which motivates the design of distributed spectrum auction mechanisms. However, extending a centralized spectrum auction to a distributed one broadens the strategy space of agents from one dimension (bid) to three dimensions (bid, communication, and computation), and thus cannot be solved by traditional approaches from mechanism design. In this paper, we propose two distributed spectrum auction mechanisms, namely distributed VCG and FAITH. Distributed VCG implements the celebrated Vickrey-Clarke-Groves mechanism in a distributed fashion to achieve optimal social welfare, at the cost of exponential communication overhead. In contrast, FAITH achieves sub-optimal social welfare with tractable computation and communication overhead. We prove that both of the two proposed mechanisms achieve faithfulness, i.e., the agents' individual utilities are maximized, if they follow the intended strategies. We also implement FAITH and evaluate its performance in various setups. Evaluation results show that FAITH achieves superior performance compared with the Nash equilibrium based approach.

In crowdsensing, appropriate rewards are always expected to compensate the participants for their consumptions of physical resources and involvements of manual efforts. While continuous low quality sensing data could do harm to the availability and preciseness of crowdsensing based services, few existing incentive mechanisms have ever addressed the issue of sensing data's quality. The design of quality based incentive mechanism is motivated by its potential to avoid inefficient sensing and unnecessary rewards. In this paper, we incorporate the consideration of data quality into the design of incentive mechanism for crowdsensing, and propose to pay the participants as how well they do, to motivate the rational participants to perform data sensing efficiently. This mechanism estimates the quality of sensing data, and offers each participant a reward based on her effective contribution. We also implement the mechanism and evaluate the improvements in terms of quality of service and profit of service provider. The evaluation results show that our mechanism achieves superior performance when compared to the uniform pricing scheme.

This paper studies the importance of visualization for discerning and interpreting patterns of data and its application for solving real problems, such as anomaly detection and data management. There are various ways to realize visualization to cater to the needs of numerous real life applications. Depending on needs, a combination of some of these ways may be required for presenting an effective visualization. The authors present visualization schemes for anomaly detection/condition monitoring and data management by leveraging network techniques and combining them with modern techniques such as sensor, database, mobile communication, GPS and GIS techniques. Two case studies are presented and analyzed. By stepping through the design and implementation processes of these projects, this paper aims to serve as a guide for other designers or researchers to create visual analysis tools or implement projects requiring such visualization.