The analysis of interwell connectivity plays an important role in the formulation of oilfield development plans and the description of residual oil distribution. In fact, sandstone reservoirs in China's onshore oi...The analysis of interwell connectivity plays an important role in the formulation of oilfield development plans and the description of residual oil distribution. In fact, sandstone reservoirs in China's onshore oilfields generally have the characteristics of thin and many layers, so multi-layer joint production is usually adopted. It remains a challenge to ensure the accuracy of splitting and dynamic connectivity in each layer of the injection-production wells with limited field data. The three-dimensional well pattern of multi-layer reservoir and the relationship between injection-production wells can be equivalent to a directional heterogeneous graph. In this paper, an improved graph neural network is proposed to construct an interacting process mimics the real interwell flow regularity. In detail, this method is used to split injection and production rates by combining permeability, porosity and effective thickness, and to invert the dynamic connectivity in each layer of the injection-production wells by attention mechanism.Based on the material balance and physical information, the overall connectivity from the injection wells,through the water injection layers to the production layers and the output of final production wells is established. Meanwhile, the change of well pattern caused by perforation, plugging and switching of wells at different times is achieved by updated graph structure in spatial and temporal ways. The effectiveness of the method is verified by a combination of reservoir numerical simulation examples and field example. The method corresponds to the actual situation of the reservoir, has wide adaptability and low cost, has good practical value, and provides a reference for adjusting the injection-production relationship of the reservoir and the development of the remaining oil.展开更多
A novel inverse scattering method to reconstruct the permittivity profile of one-dimensional multi-layered media is proposed in this paper.Based on the equivalent network ofthe medium,a concept of time domain signal f...A novel inverse scattering method to reconstruct the permittivity profile of one-dimensional multi-layered media is proposed in this paper.Based on the equivalent network ofthe medium,a concept of time domain signal flow graph and its basic principles are introduced,from which the reflection coefficient of the medium in time domain can be shown to be a series ofDirac δ-functions(pulse responses).In terms of the pulse responses,we will reconstruct both thepermittivity and the thickness of each layer will accurately be reconstructed.Numerical examplesverify the applicability of this展开更多
In multi-layer satellite-terrestrial network, Contact Graph Routing(CGR) uses the contact information among satellites to compute routes. However, due to the resource constraints in satellites, it is extravagant to co...In multi-layer satellite-terrestrial network, Contact Graph Routing(CGR) uses the contact information among satellites to compute routes. However, due to the resource constraints in satellites, it is extravagant to configure lots of the potential contacts into contact plans. What's more, a huge contact plan makes the computing more complex, which further increases computing time. As a result, how to design an efficient contact plan becomes crucial for multi-layer satellite network, which usually has a large scaled topology. In this paper, we propose a distributed contact plan design scheme for multi-layer satellite network by dividing a large contact plan into several partial parts. Meanwhile, a duration based inter-layer contact selection algorithm is proposed to handle contacts disruption problem. The performance of the proposed design was evaluated on our Identifier/Locator split based satellite-terrestrial network testbed with 79 simulation nodes. Experiments showed that the proposed design is able to reduce the data delivery delay.展开更多
Quantum error-correction codes are immeasurable resources for quantum computing and quantum communication.However,the existing decoders are generally incapable of checking node duplication of belief propagation(BP)on ...Quantum error-correction codes are immeasurable resources for quantum computing and quantum communication.However,the existing decoders are generally incapable of checking node duplication of belief propagation(BP)on quantum low-density parity check(QLDPC)codes.Based on the probability theory in the machine learning,mathematical statistics and topological structure,a GF(4)(the Galois field is abbreviated as GF)augmented model BP decoder with Tanner graph is designed.The problem of repeated check nodes can be solved by this decoder.In simulation,when the random perturbation strength p=0.0115-0.0116 and number of attempts N=60-70,the highest decoding efficiency of the augmented model BP decoder is obtained,and the low-loss frame error rate(FER)decreases to 7.1975×10^(-5).Hence,we design a novel augmented model decoder to compare the relationship between GF(2)and GF(4)for quantum code[[450,200]]on the depolarization channel.It can be verified that the proposed decoder provides the widely application range,and the decoding performance is better in QLDPC codes.展开更多
Interconnection of all things challenges the traditional communication methods,and Semantic Communication and Computing(SCC)will become new solutions.It is a challenging task to accurately detect,extract,and represent...Interconnection of all things challenges the traditional communication methods,and Semantic Communication and Computing(SCC)will become new solutions.It is a challenging task to accurately detect,extract,and represent semantic information in the research of SCC-based networks.In previous research,researchers usually use convolution to extract the feature information of a graph and perform the corresponding task of node classification.However,the content of semantic information is quite complex.Although graph convolutional neural networks provide an effective solution for node classification tasks,due to their limitations in representing multiple relational patterns and not recognizing and analyzing higher-order local structures,the extracted feature information is subject to varying degrees of loss.Therefore,this paper extends from a single-layer topology network to a multi-layer heterogeneous topology network.The Bidirectional Encoder Representations from Transformers(BERT)training word vector is introduced to extract the semantic features in the network,and the existing graph neural network is improved by combining the higher-order local feature module of the network model representation network.A multi-layer network embedding algorithm on SCC-based networks with motifs is proposed to complete the task of end-to-end node classification.We verify the effectiveness of the algorithm on a real multi-layer heterogeneous network.展开更多
With the emphasis on user privacy and communication security, encrypted traffic has increased dramatically, which brings great challenges to traffic classification. The classification method of encrypted traffic based...With the emphasis on user privacy and communication security, encrypted traffic has increased dramatically, which brings great challenges to traffic classification. The classification method of encrypted traffic based on GNN can deal with encrypted traffic well. However, existing GNN-based approaches ignore the relationship between client or server packets. In this paper, we design a network traffic topology based on GCN, called Flow Mapping Graph (FMG). FMG establishes sequential edges between vertexes by the arrival order of packets and establishes jump-order edges between vertexes by connecting packets in different bursts with the same direction. It not only reflects the time characteristics of the packet but also strengthens the relationship between the client or server packets. According to FMG, a Traffic Mapping Classification model (TMC-GCN) is designed, which can automatically capture and learn the characteristics and structure information of the top vertex in FMG. The TMC-GCN model is used to classify the encrypted traffic. The encryption stream classification problem is transformed into a graph classification problem, which can effectively deal with data from different data sources and application scenarios. By comparing the performance of TMC-GCN with other classical models in four public datasets, including CICIOT2023, ISCXVPN2016, CICAAGM2017, and GraphDapp, the effectiveness of the FMG algorithm is verified. The experimental results show that the accuracy rate of the TMC-GCN model is 96.13%, the recall rate is 95.04%, and the F1 rate is 94.54%.展开更多
The girth plays an important role in the design of LDPC codes. In order to determine the girth of Tanner(5,7) quasi-cyclic( QC) LDPC codes with length 7p for p being a prime with the form 35 m + 1,the cycles of length...The girth plays an important role in the design of LDPC codes. In order to determine the girth of Tanner(5,7) quasi-cyclic( QC) LDPC codes with length 7p for p being a prime with the form 35 m + 1,the cycles of lengths 4,6,8,and 10 are analyzed. Then these cycles are classified into sixteen categories,each of which can be expressed as an ordered block sequence,or a certain type. It is also shown that the existence of these cycles is equal to polynomial equations over Fpwho has a 35th unit root. We check if these polynomial equations have a 35th unit root and obtain the girth values of Tanner(5,7) QC LDPC codes.展开更多
The relationship between users and items,which cannot be recovered by traditional techniques,can be extracted by the recommendation algorithm based on the graph convolution network.The current simple linear combinatio...The relationship between users and items,which cannot be recovered by traditional techniques,can be extracted by the recommendation algorithm based on the graph convolution network.The current simple linear combination of these algorithms may not be sufficient to extract the complex structure of user interaction data.This paper presents a new approach to address such issues,utilizing the graph convolution network to extract association relations.The proposed approach mainly includes three modules:Embedding layer,forward propagation layer,and score prediction layer.The embedding layer models users and items according to their interaction information and generates initial feature vectors as input for the forward propagation layer.The forward propagation layer designs two parallel graph convolution networks with self-connections,which extract higher-order association relevance from users and items separately by multi-layer graph convolution.Furthermore,the forward propagation layer integrates the attention factor to assign different weights among the hop neighbors of the graph convolution network fusion,capturing more comprehensive association relevance between users and items as input for the score prediction layer.The score prediction layer introduces MLP(multi-layer perceptron)to conduct non-linear feature interaction between users and items,respectively.Finally,the prediction score of users to items is obtained.The recall rate and normalized discounted cumulative gain were used as evaluation indexes.The proposed approach effectively integrates higher-order information in user entries,and experimental analysis demonstrates its superiority over the existing algorithms.展开更多
The effectiveness of recommendation systems heavily relies on accurately predicting user ratings for items based on user preferences and item attributes derived from ratings and reviews.However,the increasing presence...The effectiveness of recommendation systems heavily relies on accurately predicting user ratings for items based on user preferences and item attributes derived from ratings and reviews.However,the increasing presence of fake user data in these ratings and reviews poses significant challenges,hindering feature extraction,diminishing rating prediction accuracy,and eroding user trust in the system.To tackle this issue,we propose a robust rating prediction model for recommendation systems that integrates fake user detection and multi-layer feature fusion.Our model utilizes a GraphSAGE-based submodel to filter out fake user data from rating data and review texts.To strengthen fake user detection,we enhance GraphSAGE by selecting aggregation neighbors based on the collusion fraud degree among users,and employ an attention mechanism to weigh the contribution of each neighbor during representation aggregation.Furthermore,we introduce a multi-layer feature fusion submodel to integrate diverse features extracted from the filtered ratings and reviews.For deep feature extraction from review texts,we implement a temporal attention mechanism to analyze the relevance of reviews over time.For shallow feature extraction from rating data,we incorporate trust evaluation mechanism and cloud model to assess the influence of trusted neighbors’ratings.In our evaluation,we compare our model against six baseline models for fake user detection and four rating prediction models across five datasets.The results demonstrate that our model exhibits significant performance advantages in both fake user detection and rating prediction.展开更多
An efficient LDPC-coded multi-relay cooperation architecture is proposed based on virtual vertical Bell Labs layered space-time （V-BLAST） processing for uplink communication, where minimum-mean-square-error （MMSE）...An efficient LDPC-coded multi-relay cooperation architecture is proposed based on virtual vertical Bell Labs layered space-time （V-BLAST） processing for uplink communication, where minimum-mean-square-error （MMSE） and BP-based joint iterative decoding based on the introduced muhi-layer Tanner graph are effectively de- signed to detect and decode the corrupted received sequence at the destination. By introducing V-BLAST transmis- sion to the coded multi-relay cooperation, relays send their streams of symbols simultaneously, which increases the data rate and significantly reduces the transmission delay. The theoretical analysis and numerical results show that the new LDPC coded cooperation scheme outperforms the coded non-cooperation under the same code rate, and it also achieves a good trade-off among the performance, signal delay, and the encoding complexity associated with the number of relays. The performance gain can be credited to the proposed V-BLAST processing architecture and BP-based joint iterative decoding by the introduced multi-layer Tanner graph at a receiver-side.展开更多
基金the support of the National Nature Science Foundation of China(No.52074336)Emerging Big Data Projects of Sinopec Corporation(No.20210918084304712)。
文摘The analysis of interwell connectivity plays an important role in the formulation of oilfield development plans and the description of residual oil distribution. In fact, sandstone reservoirs in China's onshore oilfields generally have the characteristics of thin and many layers, so multi-layer joint production is usually adopted. It remains a challenge to ensure the accuracy of splitting and dynamic connectivity in each layer of the injection-production wells with limited field data. The three-dimensional well pattern of multi-layer reservoir and the relationship between injection-production wells can be equivalent to a directional heterogeneous graph. In this paper, an improved graph neural network is proposed to construct an interacting process mimics the real interwell flow regularity. In detail, this method is used to split injection and production rates by combining permeability, porosity and effective thickness, and to invert the dynamic connectivity in each layer of the injection-production wells by attention mechanism.Based on the material balance and physical information, the overall connectivity from the injection wells,through the water injection layers to the production layers and the output of final production wells is established. Meanwhile, the change of well pattern caused by perforation, plugging and switching of wells at different times is achieved by updated graph structure in spatial and temporal ways. The effectiveness of the method is verified by a combination of reservoir numerical simulation examples and field example. The method corresponds to the actual situation of the reservoir, has wide adaptability and low cost, has good practical value, and provides a reference for adjusting the injection-production relationship of the reservoir and the development of the remaining oil.
文摘A novel inverse scattering method to reconstruct the permittivity profile of one-dimensional multi-layered media is proposed in this paper.Based on the equivalent network ofthe medium,a concept of time domain signal flow graph and its basic principles are introduced,from which the reflection coefficient of the medium in time domain can be shown to be a series ofDirac δ-functions(pulse responses).In terms of the pulse responses,we will reconstruct both thepermittivity and the thickness of each layer will accurately be reconstructed.Numerical examplesverify the applicability of this
基金supported by National High Technology of China ("863 program") under Grant No. 2015AA015702NSAF under Grant No. U1530118+1 种基金NSFC under Grant No. 61602030National Basic Research Program of China ("973 program") under Grant No. 2013CB329101
文摘In multi-layer satellite-terrestrial network, Contact Graph Routing(CGR) uses the contact information among satellites to compute routes. However, due to the resource constraints in satellites, it is extravagant to configure lots of the potential contacts into contact plans. What's more, a huge contact plan makes the computing more complex, which further increases computing time. As a result, how to design an efficient contact plan becomes crucial for multi-layer satellite network, which usually has a large scaled topology. In this paper, we propose a distributed contact plan design scheme for multi-layer satellite network by dividing a large contact plan into several partial parts. Meanwhile, a duration based inter-layer contact selection algorithm is proposed to handle contacts disruption problem. The performance of the proposed design was evaluated on our Identifier/Locator split based satellite-terrestrial network testbed with 79 simulation nodes. Experiments showed that the proposed design is able to reduce the data delivery delay.
基金the National Natural Science Foundation of China(Grant Nos.11975132 and 61772295)the Natural Science Foundation of Shandong Province,China(Grant No.ZR2019YQ01)the Higher Education Science and Technology Program of Shandong Province,China(Grant No.J18KZ012).
文摘Quantum error-correction codes are immeasurable resources for quantum computing and quantum communication.However,the existing decoders are generally incapable of checking node duplication of belief propagation(BP)on quantum low-density parity check(QLDPC)codes.Based on the probability theory in the machine learning,mathematical statistics and topological structure,a GF(4)(the Galois field is abbreviated as GF)augmented model BP decoder with Tanner graph is designed.The problem of repeated check nodes can be solved by this decoder.In simulation,when the random perturbation strength p=0.0115-0.0116 and number of attempts N=60-70,the highest decoding efficiency of the augmented model BP decoder is obtained,and the low-loss frame error rate(FER)decreases to 7.1975×10^(-5).Hence,we design a novel augmented model decoder to compare the relationship between GF(2)and GF(4)for quantum code[[450,200]]on the depolarization channel.It can be verified that the proposed decoder provides the widely application range,and the decoding performance is better in QLDPC codes.
基金supported by National Natural Science Foundation of China(62101088,61801076,61971336)Natural Science Foundation of Liaoning Province(2022-MS-157,2023-MS-108)+1 种基金Key Laboratory of Big Data Intelligent Computing Funds for Chongqing University of Posts and Telecommunications(BDIC-2023-A-003)Fundamental Research Funds for the Central Universities(3132022230).
文摘Interconnection of all things challenges the traditional communication methods,and Semantic Communication and Computing(SCC)will become new solutions.It is a challenging task to accurately detect,extract,and represent semantic information in the research of SCC-based networks.In previous research,researchers usually use convolution to extract the feature information of a graph and perform the corresponding task of node classification.However,the content of semantic information is quite complex.Although graph convolutional neural networks provide an effective solution for node classification tasks,due to their limitations in representing multiple relational patterns and not recognizing and analyzing higher-order local structures,the extracted feature information is subject to varying degrees of loss.Therefore,this paper extends from a single-layer topology network to a multi-layer heterogeneous topology network.The Bidirectional Encoder Representations from Transformers(BERT)training word vector is introduced to extract the semantic features in the network,and the existing graph neural network is improved by combining the higher-order local feature module of the network model representation network.A multi-layer network embedding algorithm on SCC-based networks with motifs is proposed to complete the task of end-to-end node classification.We verify the effectiveness of the algorithm on a real multi-layer heterogeneous network.
基金supported by the National Key Research and Development Program of China No.2023YFA1009500.
文摘With the emphasis on user privacy and communication security, encrypted traffic has increased dramatically, which brings great challenges to traffic classification. The classification method of encrypted traffic based on GNN can deal with encrypted traffic well. However, existing GNN-based approaches ignore the relationship between client or server packets. In this paper, we design a network traffic topology based on GCN, called Flow Mapping Graph (FMG). FMG establishes sequential edges between vertexes by the arrival order of packets and establishes jump-order edges between vertexes by connecting packets in different bursts with the same direction. It not only reflects the time characteristics of the packet but also strengthens the relationship between the client or server packets. According to FMG, a Traffic Mapping Classification model (TMC-GCN) is designed, which can automatically capture and learn the characteristics and structure information of the top vertex in FMG. The TMC-GCN model is used to classify the encrypted traffic. The encryption stream classification problem is transformed into a graph classification problem, which can effectively deal with data from different data sources and application scenarios. By comparing the performance of TMC-GCN with other classical models in four public datasets, including CICIOT2023, ISCXVPN2016, CICAAGM2017, and GraphDapp, the effectiveness of the FMG algorithm is verified. The experimental results show that the accuracy rate of the TMC-GCN model is 96.13%, the recall rate is 95.04%, and the F1 rate is 94.54%.
基金Sponsored by the National Natural Science Foundation of China(Grant Nos.61372074 and 91438101)the National High Technology Research and Development Program of China(Grant No.2015AA01A709)
文摘The girth plays an important role in the design of LDPC codes. In order to determine the girth of Tanner(5,7) quasi-cyclic( QC) LDPC codes with length 7p for p being a prime with the form 35 m + 1,the cycles of lengths 4,6,8,and 10 are analyzed. Then these cycles are classified into sixteen categories,each of which can be expressed as an ordered block sequence,or a certain type. It is also shown that the existence of these cycles is equal to polynomial equations over Fpwho has a 35th unit root. We check if these polynomial equations have a 35th unit root and obtain the girth values of Tanner(5,7) QC LDPC codes.
基金supported by the Fundamental Research Funds for Higher Education Institutions of Heilongjiang Province(145209126)the Heilongjiang Province Higher Education Teaching Reform Project under Grant No.SJGY20200770.
文摘The relationship between users and items,which cannot be recovered by traditional techniques,can be extracted by the recommendation algorithm based on the graph convolution network.The current simple linear combination of these algorithms may not be sufficient to extract the complex structure of user interaction data.This paper presents a new approach to address such issues,utilizing the graph convolution network to extract association relations.The proposed approach mainly includes three modules:Embedding layer,forward propagation layer,and score prediction layer.The embedding layer models users and items according to their interaction information and generates initial feature vectors as input for the forward propagation layer.The forward propagation layer designs two parallel graph convolution networks with self-connections,which extract higher-order association relevance from users and items separately by multi-layer graph convolution.Furthermore,the forward propagation layer integrates the attention factor to assign different weights among the hop neighbors of the graph convolution network fusion,capturing more comprehensive association relevance between users and items as input for the score prediction layer.The score prediction layer introduces MLP(multi-layer perceptron)to conduct non-linear feature interaction between users and items,respectively.Finally,the prediction score of users to items is obtained.The recall rate and normalized discounted cumulative gain were used as evaluation indexes.The proposed approach effectively integrates higher-order information in user entries,and experimental analysis demonstrates its superiority over the existing algorithms.
基金funded by the National Natural Science Foundation of China(No.72072091)the Natural Science Foundation of Colleges and Universities of Jiangsu Province(Nos.21KJA520002 and 22KJA520005)+1 种基金the Ministry of Education Supply and Demand Matching Employment and Education Project(No.2023121801795)the Postgraduate Research&Practice Innovation Program of Jiangsu Province(Nos.KYCX23_2345 and SJCX24_1164).
文摘The effectiveness of recommendation systems heavily relies on accurately predicting user ratings for items based on user preferences and item attributes derived from ratings and reviews.However,the increasing presence of fake user data in these ratings and reviews poses significant challenges,hindering feature extraction,diminishing rating prediction accuracy,and eroding user trust in the system.To tackle this issue,we propose a robust rating prediction model for recommendation systems that integrates fake user detection and multi-layer feature fusion.Our model utilizes a GraphSAGE-based submodel to filter out fake user data from rating data and review texts.To strengthen fake user detection,we enhance GraphSAGE by selecting aggregation neighbors based on the collusion fraud degree among users,and employ an attention mechanism to weigh the contribution of each neighbor during representation aggregation.Furthermore,we introduce a multi-layer feature fusion submodel to integrate diverse features extracted from the filtered ratings and reviews.For deep feature extraction from review texts,we implement a temporal attention mechanism to analyze the relevance of reviews over time.For shallow feature extraction from rating data,we incorporate trust evaluation mechanism and cloud model to assess the influence of trusted neighbors’ratings.In our evaluation,we compare our model against six baseline models for fake user detection and four rating prediction models across five datasets.The results demonstrate that our model exhibits significant performance advantages in both fake user detection and rating prediction.
基金Supported by the Science and Technology on Avionics Integration Laboratory and National Aeronautical Science Foundation of China(20105552)
文摘An efficient LDPC-coded multi-relay cooperation architecture is proposed based on virtual vertical Bell Labs layered space-time （V-BLAST） processing for uplink communication, where minimum-mean-square-error （MMSE） and BP-based joint iterative decoding based on the introduced muhi-layer Tanner graph are effectively de- signed to detect and decode the corrupted received sequence at the destination. By introducing V-BLAST transmis- sion to the coded multi-relay cooperation, relays send their streams of symbols simultaneously, which increases the data rate and significantly reduces the transmission delay. The theoretical analysis and numerical results show that the new LDPC coded cooperation scheme outperforms the coded non-cooperation under the same code rate, and it also achieves a good trade-off among the performance, signal delay, and the encoding complexity associated with the number of relays. The performance gain can be credited to the proposed V-BLAST processing architecture and BP-based joint iterative decoding by the introduced multi-layer Tanner graph at a receiver-side.
