Latest ArticlesGraphs often have rich temporal information and evolve dynamically over time, which can be modeled as temporal graph streams. A temporal graph stream consists of a set of vertices and a series of timestamped and directed edges, where new vertices and edges arrive continuously over time. Temporal motifs are generalizations of subgraph patterns in static graphs which take into account edge orderings and durations in addition to topologies. Counting the number of occurrences of temporal motifs is a fundamental problem for temporal graph analysis. However, traditional streaming subgraph counting methods cannot support temporal matching, and are only suitable for simple graphs that do not contain temporal information. In addition, existing temporal motifs counting methods suffer from poor performance in temporal graph streams. We thus study approximate temporal motif counting via random sampling in temporal graph streams. We propose a generic streaming edge sampling (SES) algorithm to estimate the number of instances of any temporal motif in a given temporal graph stream. We then provide comprehensive analyses of the theoretical bounds and time complexities of SES. Finally, we perform extensive experimental evaluations for SES on four real world datasets. The results show that SES achieves up to three orders of magnitude speedups over the state-of-the-art sampling methods while having comparable estimation errors for temporal motif counting in the streaming setting.
With the increasing demand for people counting, the technology of human flow monitoring based on channel state information (CSI) attracts much attention because of its advantages such as easy deployment, privacy protection and strong applicability. However, in the existing human flow monitoring work, the accuracy of pedestrian recognition is easily affected by the density of the crowd. To ensure the monitoring accuracy, the monitoring can only be carried out when the crowd is sparse, which leads to the lack of practicability of the human flow monitoring technology based on CSI. In order to solve this problem, a monitoring method that can identify continuous flow of people is proposed. The method firstly uses phase unwrapping and linear phase correction algorithm to eliminate random phase offset and phase compensation for original data, then extracts valid data packets from continuous flow data by standard deviation and variance, and finally inputs phase difference information in the time domain as feature signals into the deep learning convolutional, long short-term memory, deep neural network (CLDNN) for pedestrian recognition. After actual testing, the method achieves outdoor accuracy of 96.7% and indoor accuracy of 94.1% under the condition that the distance between pedestrians in front and back is not less than 1 m, outperforming the existing method of human flow monitoring.
The existing multi-view clustering algorithms exhibit limitations in accurately capturing the high-order information and complementary information embedded in multi-view data during the low-dimensional representations learning process. Meanwhile, these algorithms fail to capture the local information of data, and their information extraction methods lack robustness to noise and outliers. To address these challenges, an adaptive tensor singular value shrinkage multi-view clustering algorithm named ATSVS is proposed. ATSVS proposes a novel tensor log-determinant function to enforce the low-rank constraint on the representation tensor, which can adaptively enable adaptive shrinkage of singular values based on their magnitude. Consequently, ATSVS effectively captures high-order information and complementary information within multi-view data from the global perspective. Then, ATSVS captures the local information of the data by using the
Audio recognition has been widely applied in the typical scenarios, like auto-driving, Internet of things, and etc. In recent years, research on adversarial attacks in audio recognition has attracted extensive attention. However, most of the existing studies mainly rely on the coarse-grain audio features at the instance level, which leads to expensive generation time costs and weak universal attacking ability in real world. To address the problem, we propose a phonemic adversarial noise (PAN) generation paradigm, which exploits the audio features at the phoneme level to perform fast and universal adversarial attacks. Experiments are conducted using a variety of datasets commonly used in speech recognition tasks, such as LibriSpeech, to experimentally validate the effectiveness of the PAN proposed in this paper, its ability to generalize across datasets, its ability to migrate attacks across models, and its ability to migrate attacks across tasks, as well as further validating the effectiveness of the attack civilian-oriented Internet of things audio recognition application in the physical world devices. Extensive experiments demonstrate that the proposed PAN outperforms the comparative baselines by large margins (about 24 times speedup and 38% attacking ability improvement on average), and the sampling strategy and learning method proposed in this paper are significant in reducing the training time and improving the attack capability.
Given the frequent cybersecurity incidents, anomaly detection methods have been widely employed for the identification of malicious behaviors. However, these anomalous accesses often exhibit prominent characteristics only in certain attribute fields, rendering the detection results susceptible to interference from attributes where anomalies are less prominent. To address this issue, MNDetecctor, an anomaly access detection framework that introduces the multiplex network structure into this field is proposed. Through association analysis, closely associated attribute fields are constructed into single-layer networks, with cross-layer connections added to form a multiplex network. Subsequently, cross-layer walks are performed to obtain node sequences within the same layer and across layers, facilitating node embedding. Ultimately, a hierarchical generative adversarial network is employed to merge reconstruction losses and discriminative results across different layers, thereby achieving anomaly access detection. Experimental results demonstrate that MNDetector surpasses the performance of state-of-the-art detection methods on multiple public datasets, achieving an approximately 8% increase in F1 score compared with commonly used methods. In-depth case studies elucidate the variation in detection outcomes across diverse scenarios by analyzing the distribution of anomalous attributes within fields. Furthermore, an examination from a network structural perspective clarifies the disparities among results obtained from different layers, substantiating MNDetector’s efficacy in addressing the attribute interference issue caused by attribute fields with insignificant anomalous characteristics.
In order to improve the hiding capacity of information hiding algorithms while ensuring the quality of generated text, we propose a generative information hiding method based on couplet carrier. Firstly, we pre-train the couplet text data and build a couplet generation model based on a multi-flow pre-training and fine-tuning framework; secondly, we use the subject words as the input to generate the first line of a couplet, and the model can generate the first line of couplets on the same subject words; then we use the first line of a couplet as the input to generate the second line of a couplet. The method mitigates the semantic ambiguity in the current couplet generation model by utilizing the span-by-span learning approach, the padding generation mechanism and the noise perception mechanism to ensure that the generated couplets correspond to each other in terms of their metrical patterns. The secret information can be effectively hidden by different choices of subject words, candidate the first line of couplets and candidate words for generating the second line of a couplet. The experimental results show that the method can obtain high hiding capacity, and the average hiding capacity of 7-word couplets can reach 10.24B, and the generated couplets satisfy the strict form and content requirements of couplets, such as equal number of words, comparable lexicality, proportional structure and harmonious ping-ze. The overall performance of the proposed method is better than the current mainstream generative text information hiding schemes.
A large number of application practices have proven the effectiveness of fuzzy testing to detect program vulnerabilities. The existing fuzzy testing methods lack the analysis of differences in performance specific to the testing tasks and adjust testing policies appropriately. Instead, they mostly adopt a unified process, resulting in unsatisfactory testing results. It is necessary to modify the policy based on specific information during the testing process to achieve better testing performance, and a new program defect fuzzy testing method based on execution context orientation is proposed, which can break through the protection mechanism. By capturing and analyzing specific contextual information during the actual processing of input test cases by the tested program, and achieving rapid exploration of program structural features, the sample mutation policy can be optimized. Meanwhile, a prototype tool CBFuzzer for program defect fuzzy detection based on execution context orientation is implemented. The experimental results indicate that CBFuzzer can effectively explore the internal structure of programs (including breakthroughs in protection mechanisms), simulate unconventional program state transitions, and more efficiently expose vulnerability points. By comparison, CBFuzzer shows improvements ranging from 6.8% to 36.76% in terms of vulnerability exposure, with the highest increase in the number of actual vulnerabilities detected reaching up to 66.67%. With the investment of a small amount of additional testing resources within an acceptable range, CBFuzzer not only achieves improved detection performance for regular types of vulnerabilities but also exhibits higher detection capabilities for vulnerabilities with strong concealment. As of August 10, 2023, a total of 126 new vulnerabilities have been identified through the utilization of CBFuzzer in 13 testing tasks (reported to related software developers and submitted to CVE® organization).
Collective spatial keyword queries play an important role in the fields such as spatial databases, location services, intelligent recommendations, and group intelligence perception. The existing collective spatial keyword query methods do not consider the problem of requiring time-distance constrained and cost aware, and cannot meet the query needs of most users under time-distance constrained. Existing research results have significant limitations. To make up for the shortcomings of existing methods, collective spatial keyword query based on time-distance constrained and cost aware (called TDCCA-CoSKQ) is proposed. To address the issue of not being able to include both keyword information and time information in existing indexes, the TDCIR-Tree index is proposed, which combines inverted files and time attribute label files. TDCIR-Tree can reduce the cost of query calculation. TDCCA_PP algorithm is proposed to address the issue of subsequent screening of collections that meet query criteria for TDCCA-CoSKQ, including TDCCAPruning1, TDCCAPermutation, and TDCCAPruning2, and it can improve the efficiency of keyword queries. The TDC cost function and its corresponding sorting algorithm are proposed. The TDC cost function is composed of distance cost and time cost, which includes independent variable coefficients representing user preference α and β, and it can increase users’ freedom of choice. The problem of existing cost functions not meeting the collective spatial keyword query based on time-distance constrained and cost aware is effectively solved. Theoretical research and experiments have shown that the proposed method has good efficiency and accuracy.
The recommender system has a significant role in alleviating information overload, allowing users to conveniently obtain products and services on various application platforms like Tmall, TikTok, and Xiaohongshu. However, most of the recommendation systems focus on the accuracy rate as the center, which leads to adverse effects such as the limitation of users’ vision, fewer display opportunities for some merchants, a single content ecosystem of the platform, and an unbalanced allocation of resources and information, such as triggering the filter bubble and the Matthew effect. As a result, strengthening the diversity of the recommendation system has become a key research point to fulfill the increasingly diversified material demands in people’s lives. In recent years, research on diversified recommendations has developed rapidly. However, this aspect needs to be more systematic in organization and summarization. This paper systematically reviews the issue of diversified recommendations within recommendation systems. Firstly, we put forward the problem definition, technical framework, classification, and application scenarios of diversified recommendations. Secondly, we make comparisons and analyses of models and algorithms from four perspectives. Subsequently, we summarize the commonly used datasets and metrics for diversified recommendations. Finally, we deliberate on the problems and challenges in this field to inspire future innovation and promote development.
Knowledge base question answering is aimed to retrieval relevant information from the knowledge base for model inference, and return accurate answers. In recent years, with the development of deep learning and large language models, knowledge base question answering based on information retrieval has become the research focus, and many novel research methods have emerged. We summarize and analyze the methods of knowledge base question answering based on information retrieval from different aspects such as model methods and datasets. Firstly, we introduce the research significance and related definitions of knowledge base question answering. Then, according to the model processing stages, we explain the key problems and typical solutions faced in each stage from four stages: question parsing, information retrieval, model inference, and answer generation, and summarize the common network modules used in each stage. Then we analyze and sort out the inexplicability of knowledge base question answering based on information retrieval methods. In addition, relevant datasets with different characteristics and baseline models at different stages are classified and summarized. Finally, the summary and outlook are provided on each stage of knowledge base question answering based on information retrieval, as well as the overall development direction of the field.