Latest ArticlesNowadays, the blockchain ecosystem has been prospering and public blockchain applications and services have been booming. With the concept of Web3.0 getting heated, this trend would be more and more compelling. This fact, while granting more momentum to digital economy development, also brings about a greater challenge to the blockchain supervision practice. The technical traits of blockchain infrastructure and blockchain applications and the need of automatic, multiparty, hierarchical, and multi-dimensional supervision have been calling for innovation and compliance with the supervision schemes designed and implemented for Web2.0. To meet this requirement and face the challenge, we propose a multichain-collaborating, chain-supervising-chain supervision framework. This framework puts forward an architecture consisting of layered and hierarchical supervision chains and heterogeneous supervised chains and designs the basic procedure of blockchain supervision under this architecture. Then we abstract the supervision technologies under this architecture into substrate layer, decision layer, cross-chain layer, access layer, execution layer and data layer. With this abstraction, we propose a series of backbone supervision schemes that are most vital to supervision system construction. Under this framework, we implement a supervision system targeted at blockchain applications and show the effectiveness and feasibility of the system by experiment and exemplary applications.
With the rapid evolution of IPv6 in recent years, the significance of IPv6 network measurement and security analysis has grown substantially. Obtaining a substantial number of active IPv6 addresses has become a fundamental and critical task in this domain. However, the sheer size of the IPv6 address space and the sparsely distributed nature of active hosts present challenges that render brute-force scanning tools, such as ZMap and MASSCAN. While ZMap can scan the entire IPv4 network in just 5 minutes with a 10-gigabit bandwidth, it would take hundreds of millions of years to scan the entire IPv6 network using similar methods. In response to this challenge and in a bid to enhance the efficiency of IPv6-wide scans, researchers have introduced a series of innovative search strategies tailored to IPv6 scans. These strategies aim to enhance the ability to discover assets and mitigate risks within the IPv6 network. We undertake the task of categorizing, organizing, and summarizing the target generation-based scanning approaches proposed by researchers in this field. We conduct a comprehensive analysis, comparing the hit rate, marginal benefit, and time costs of state-of-the-art solutions through real-network scan experiments. Furthermore, we provide valuable insights into the current landscape and emerging trends in IPv6 target generation scanning techniques. By doing so, we contribute to a deeper understanding of IPv6 network analysis and security, ultimately fostering advancements in this critical area of networking research.
As smart terminals and social networks are increasingly integrated into people’s daily life, user behavior identification for social software plays an increasingly important role in network management, network environment supervision, and market research. Social software commonly uses end-to-end encryption protocols for encrypted data transmission, and existing methods usually extract statistical features of the encrypted data for behavior identification. However, these methods have unstable identification performance and require a large amount of data, and these drawbacks affect the practicality of these methods. We propose a social software user behavior identification method for encrypted traffic. First, stable control flow data are identified from the encrypted traffic, and the control service packet payload length sequence is extracted. Then, two neural network models are then designed to automatically extract features from control flow payload length sequences to identify user behavior at a fine granularity. Finally, experiments are conducted with WhatsApp as an example, and the precision, recall, and F1-score of the two neural network models for recognizing WhatsApp user behavior are over 96%. The experimental comparison with similar work proves the stability of the identification performance of the method. In addition, the method can achieve high identification precision with a few control packets, which is of great relevance to the study of real-time behavior identification.
Attackers use the domain names to carry out various kinds of network attacks flexibly. Many scholars have put forward some malicious domain name detection methods based on statistical characteristics and association relationship. However, the two methods have shortcomings in the representation of higher-order relationship of domain name attributes, and cannot accurately present the global higher-order relationship between domains. To solve these problems, a malicious domain name detection method based on embedded feature hypergraph learning is proposed. Firstly, the domain name hypergraph structure is constructed by decision tree based on domain name spatial statistical characteristics. The output of the penultimate node of the decision tree is used as a priori condition to form a hyperedge, and the multi-order correlation between domain name traffic is quickly and clearly represented. Secondly, the character embedding features are enhanced based on the hypergraph structure features, and the hidden higher-order relationships between characters are mined from the domain name data based on the statistical characteristics of domain name space and the encoding characteristics of domain name character embedding. Finally, combined with the real domain name system traffic of China Science and Technology Network, the validity and feasibility are analyzed and evaluated, which can quickly and efficiently detect hidden malicious domain names.
Collaborative learning technologies such as federated learning and swarming learning can fully use distributed data to deeply mine the knowledge contained in the data while protecting data privacy. It has a broad application prospect, especially in the medical and health field, where privacy practices and ethical constraints are emphasized. Collaborative efforts always require reliable participants. The performance of the global model in collaborative learning largely depends on participant selection. However, the existing studies need to pay more attention to the heterogeneity of medical participants’ data. As a result, the performance of the global model, including stability, is difficult to be guaranteed. We propose to solve this problem from the perspective of reputation. Through iterative collaborative learning, reputation participants are selected as much as possible to obtain a stable and reliable high-performance global model in collaborative learning. We first propose an AI medical promise (AMP) to describe a medical institution’s data quality and help form a good AI ecosystem in the medical field. Secondly, an iterative collaborative learning framework based on backward selection (colback-learning) is established. The backward selection method is used to iteratively calculate a well-performing and stable global model in polynomial time complexity to complete AMP calculation and accumulation in a single collaborative learning task. In calculating AMP, a scoring function that comprehensively considers global performance indicators is formulated to guide the training of the global model in the medical field. Finally, using real-world medical data to simulate various collaborative learning scenarios, we have shown that the colback-learning can select reliable participants to obtain a global model with good performance. The model’s performance stability is 1.3 to 6 times higher than that of the state-of-the-art methods. The interpretability of the global model maintains a high consistency with centralized learning.
The metaverse has emerged as a ubiquitous buzzword in the industry, with various sectors eagerly anticipating its potential to unlock forth new opportunities and foster exponential growth, and to serve as a driving force and powerful engine for the digital economy. However, there is a wide divergence of understanding regarding the metaverse across different domains and aspects. This paper aims to provide a framework for a systematic understanding and scientific research of the metaverse through a multidimensional approach. Firstly, we analyze several mainstream metaverse architectural frameworks and their pivotal components, revealing the intricate and multilayered structure of the metaverse. Secondly, we furnish a framework for a meticulous comprehension of metaverse, and propose the metaverse ecosystem architecture, elaborate on the requirements of various levels including the technology system, content system, economic system, collaboration system, and governance system, as well as highlight their interrelationships, and thereby construct the entire metaverse ecosystem. Furthermore, we place special emphasis on the analysis of the crucial role of blockchain technology within the metaverse, particularly underscoring its value in supporting data, digital assets, and collaboration. This study aims to provide a sturdy theoretical foundation and practical guidance for the future development of the metaverse field.
Current serverless computing providers use a coupled resource allocation strategy with low flexibility and a fixed CPU-to-memory allocation ratio. As more types of functions are deployed to the serverless computing platform, the coupled strategy can not satisfy the wide range of resource requirements for these functions. Due to the small granularity of resource allocation and high deployment density in serverless functions, if CPU and memory resource allocation are decoupled, the problem of resource configuration space explosion needs to be solved. In this paper, we present Semi-Share, a decoupled resource manager for serverless functions, which can find the optimal resource configurations for functions while reducing the interference between co-located functions. To solve the resource configuration space explosion problem, Semi-Share builds a two-layer resource allocation architecture, which divides the resource configuration space into multiple subspaces to reduce problem complexity. The first layer is the function cluster, which is based on the resource preference and historical load information of the functions. The resource configuration space is divided according to these clusters. The second layer is resource allocation, which leverages the Bayesian optimization and weighted scoring function to guide Semi-Share to search in the right direction in the configuration space and reduce the time overhead. The experimental results show that Semi-Share greatly reduces the search time of searching the optimal resource configuration by using the two-layer architecture, reduces the average configurations sample by 85.77% compared with the widely used gradient descent search method, and improves the function performance by 42.72% on average. Compared with COSE, a coupled resource allocation system that also uses Bayesian optimization, Semi-Share can improve the function performance by 32.25% on average.
Computing random-walk probabilities on graphs is the subject of extensive research in both graph theory and data mining research. However, existing work mainly focuses on static graphs, and cannot efficiently support dynamic weighted graphs, which are ubiquitous in real-world applications. We study the problem of computing random-walk probabilities on dynamic weighted graphs. We propose to use a sampling schema called coin flip sampling, rather than the more commonly adopted weighted sampling schema, for simulating random walks in dynamic weighted graphs. We demonstrate that simulations based on coin-flip sampling maintain the unbiasedness of the resulting random-walk probability approximations. Moreover, this approach allows us to simultaneously achieve a near-optimal query time complexity and an optimal
Triangle counting is a classical problem in large-scale graph analysis and widely applied in areas such as social network analysis, anomaly detection, and graph mining. In dynamic graph data streams, the topological structure of graph is constantly changing, involving edge insertions and deletions. Recent researches mainly focus on static streaming graphs and the corresponding streaming graph sampling algorithms only deal with edge insertions. Only a few single-machine sampling algorithms with low accuracy can handle edge deletion operations. We propose the edge hashing assignment-based distributed sampling (EHADS) algorithm, which is a distributed streaming algorithm designed for estimating the number of triangles in dynamic graph data streams. EHADS algorithm can rapidly and accurately estimate the counts of global triangles and local triangles associated with each vertex in dynamic streaming graphs. EHADS algorithm processes the input graph stream only once and samples edges across multiple machines. Compared with state-of-the-art single-machine streaming algorithms, the experimental results reflect that EHADS algorithm has the following advantages: 1) with the same sample capacity, EHADS algorithm achieves smaller estimation errors with less runtime, reducing the average estimation error of global triangle count by 31.79% and local triangle count by 23.35%; 2) EHADS algorithm provides unbiased estimations of the triangle count in streaming graph, and mathematical proofs demonstrate that the above-mentioned unbiased estimation has smaller variance.
Numerous multi-agent tasks exhibit a nearly decomposable structure, wherein interactions among agents within the same interaction set are strong while interactions between different sets are weak. Efficiently modeling this structure and leveraging it to coordinate agents can enhance the learning efficiency of multi-agent reinforcement learning algorithms for cooperative multi-agent tasks, while existing work typically neglects and fails. To address this limitation, we model the nearly decomposable structure using a dynamic graph and accordingly propose a novel algorithm named coordinated subtask pattern (CSP) that enhances both local and global coordination among agents. Specifically, CSP identifies agents’ interaction sets as subtasks and utilizes a bi-level structure to periodically distribute agents into multiple subtasks, which ensures accurate characterizations regarding their interactions on the dynamic graph. Based on the subtask assignment, CSP proposes intra-subtask and inter-subtask pattern constraints to facilitate both local and global coordination among agents. These two constraints ensure that partial agents within the same subtask are aware of their action selections and all agents select superior joint actions that maximize the overall task performance. Experimentally, we evaluate CSP across multiple maps of SMAC benchmark, and its superior performance against multiple baseline algorithms demonstrates its effectiveness on efficiently coordinating agents.