Multi-space crowd sensing has emerged as a promising paradigm for 3D urban perception. However, it faces critical challenges including space coupling, task heterogeneity, and dynamic resource availability. To address these issues, the Multi-Space Fairness Task Allocation (MSFTA) problem is formulated, aiming to maximize task completion while ensuring fairness across spatial dimensions. The problem is proven to be NP-hard, and a dynamic collaborative optimization framework is proposed. Within this framework, a Multi-Space Clustering QuadTree Voronoi Partition (MCQVP) is developed for fine-grained multi-dimensional partitioning by leveraging DBSCAN and quadtree structures. In addition, a Group Urgency-Based Multi-Shortest Path (GUBMSP) scheduler is incorporated to prioritize time-sensitive task groups via urgency-aware critical paths. Furthermore, a Fairness-Aware Pareto Multi-Objective Ant-Q Learning (FA-PMOAQL) allocator is introduced to integrate Q-learning and ant-colony optimization under fairness-aware multi-objective guidance. These designs establish a unified framework that not only improves task allocation efficiency through multi-space partitioning and urgency-driven scheduling, but also ensures equitable resource utilization by embedding fairness into the learning process. Comparison experiments on Tokyo and New York datasets demonstrate that the proposed approach achieves up to 12.8% higher task completion rate compared with baseline algorithms, while maintaining relatively low runtime. In cross-layer scenarios, the completion rate improves by 20% when agent resources increase, and under heavy task loads it sustains competitive performance with only moderate decline.

The advent of large language models (LLMs) offers unprecedented opportunities to reimagine peer review beyond the constraints of traditional workflows. Despite these opportunities, prior efforts have largely focused on replicating traditional review workflows with LLMs serving as direct substitutes for human reviewers, while limited attention has been given to exploring new paradigms that fundamentally rethink how LLMs can participate in the academic review process. In this paper, we introduce and explore a novel mechanism that employs LLM agents to perform pairwise comparisons among manuscripts instead of individual scoring. By aggregating outcomes from substantial pairwise evaluations, this approach enables a more accurate and robust measure of relative manuscript quality. Our experiments demonstrate that this comparative approach significantly outperforms traditional rating-based methods in identifying high-impact papers. However, our analysis also reveals emergent biases in the selection process, notably a reduced novelty in research topics and an increased institutional imbalance. These findings highlight both the transformative potential of rethinking peer review with LLMs and critical challenges that future systems must address to ensure equity and diversity.

As network and information systems become widely adopted across industries, cybersecurity concerns have grown more prominent. Among these concerns, insider threats are considered particularly covert and destructive. Insider threats refer to malicious insiders exploiting privileged access to networks, systems, and data to intentionally compromise organizational security. Detecting these threats is challenging due to the complexity and variability of user behavior data, combined with the subtle and covert nature of insider actions. Traditional detection methods often fail to capture both long-term dependencies and short-term fluctuations in time-series data, which are crucial for identifying anomalous behaviors. To address these issues, this paper introduces the Test-Time Training (TTT) model for the first time in the field of insider threat detection, and proposes a detection method based on the TTT-ECA-ResNet model. First, the dataset is preprocessed. TTT is applied to extract long-term dependencies in features, effectively capturing dynamic sequence changes. The Residual Network, incorporating the Efficient Channel Attention mechanism, is used to extract local feature patterns, capturing relationships between different positions in time-series data. Finally, a Linear layer is employed for more precise detection of insider threats. The proposed approaches were evaluated using the CMU CERT Insider Threat Dataset, achieving an AUC of 98.75% and an F1-score of 96.81%. The experimental results demonstrate the effectiveness of the proposed methods, outperforming other state-of-the-art approaches.

Unmanned agents represent a significant advancement in unmanned control and constitute an important element in the future agent warfare. Their autonomous decision-making capabilities are integral to accomplishing tasks independently. To address challenges inherent in multiparty game scenarios that traditional method struggle with and enhance the applicability and accuracy of game decision-making, this article proposes a novel multiagent confrontation method for unmanned vessels, tailored to a three-party dynamic multistrategy evolutionary game in incomplete information scenarios. The approach introduces a new incentive mechanism designed to enhance both individual and collective profits of agents. Using evolutionary game theory, a three-party model is developed, incorporating interactions among player, enemy, and neutral agents. The model tracks the evolution of strategies to identify stable equilibria across various perceptual conditions. Simulations validate the effectiveness of the proposed method in selecting optimal strategies for unmanned vessels in complex battlefield scenarios, demonstrating its potential for improving autonomous decision-making in multiparty confrontations.

With the rapid progression of mobile crowdsourcing (MCS) technology, its growing influence in our daily lives has established it as a crucial component of modern society. However, while the convenience of MCS is widely appreciated, it also poses significant threats to personal privacy, particularly location privacy. This article introduces a novel system for personalized location privacy protection in MCS. The system is divided into three main parts. The first part presents an innovative algorithm that calculates the location privacy level of crowd workers. This algorithm is crucial in determining the location privacy level required by each individual crowd worker. The second part involves the design of a personalized differential privacy protection (P-DP) algorithm, which is based on the exponential mechanism. This algorithm provides varying degrees of privacy protection strength, tailored to the location privacy protection level of each crowd worker. Furthermore, we incorporate a trusted third party (TP) server to act as an intermediary. This server eliminates any correlation between the crowd workers and the data. It is also tasked with calculating the location privacy level and reward for each crowd worker. The third part of the system is the personalized localized differential privacy (LDP) protection (P- LDP) algorithm, this algorithm is designed to further solve the problem of privacy disclosure caused by the TP server being attacked. Finally, we have conducted a comprehensive evaluation of the proposed location privacy protection system using real data sets, and the results demonstrate that the system can effectively balance the location privacy protection of crowd workers and the availability of location data, thereby improving the efficiency and reliability of MCS.

Mobile crowdsourcing (MCS) is a new paradigm that uses various mobile devices to collect sensed data. Mobile edge computing (MEC) can effectively utilize the device resources of mobile edge, greatly relieve the pressure of network bandwidth and improve the response speed. In this article, we construct a four-party evolutionary game model consisting of the platform, crowd workers, task requesters, and edge servers. The computing tasks are conducted on edge servers, which greatly reduce remote data transmission and network operating costs and improve service quality. Taking into account the collusion between the platform and workers, and that between the platform and requesters, we analyze the stability of the strategic equilibrium in MCS using replicator dynamics methods. The optimal payoff strategies of the participants in different initial states are obtained. To prevent cheating and false-reporting problems, reward and punishment strategies are provided. Finally, the stability of the equilibrium of the four-party evolutionary game system is verified by simulation experiments, and an incentive strategy is designed to motivate all parties to choose the trust strategies.