Rock mass quality serves as a vital index for predicting the stability and safety status of rock tunnel faces.In tunneling practice,the rock mass quality is often assessed via a combination of qualitative and quantita...Rock mass quality serves as a vital index for predicting the stability and safety status of rock tunnel faces.In tunneling practice,the rock mass quality is often assessed via a combination of qualitative and quantitative parameters.However,due to the harsh on-site construction conditions,it is rather difficult to obtain some of the evaluation parameters which are essential for the rock mass quality prediction.In this study,a novel improved Swin Transformer is proposed to detect,segment,and quantify rock mass characteristic parameters such as water leakage,fractures,weak interlayers.The site experiment results demonstrate that the improved Swin Transformer achieves optimal segmentation results and achieving accuracies of 92%,81%,and 86%for water leakage,fractures,and weak interlayers,respectively.A multisource rock tunnel face characteristic(RTFC)dataset includes 11 parameters for predicting rock mass quality is established.Considering the limitations in predictive performance of incomplete evaluation parameters exist in this dataset,a novel tree-augmented naive Bayesian network(BN)is proposed to address the challenge of the incomplete dataset and achieved a prediction accuracy of 88%.In comparison with other commonly used Machine Learning models the proposed BN-based approach proved an improved performance on predicting the rock mass quality with the incomplete dataset.By utilizing the established BN,a further sensitivity analysis is conducted to quantitatively evaluate the importance of the various parameters,results indicate that the rock strength and fractures parameter exert the most significant influence on rock mass quality.展开更多
Quantum error correction is a crucial technology for realizing quantum computers.These computers achieve faulttolerant quantum computing by detecting and correcting errors using decoding algorithms.Quantum error corre...Quantum error correction is a crucial technology for realizing quantum computers.These computers achieve faulttolerant quantum computing by detecting and correcting errors using decoding algorithms.Quantum error correction using neural network-based machine learning methods is a promising approach that is adapted to physical systems without the need to build noise models.In this paper,we use a distributed decoding strategy,which effectively alleviates the problem of exponential growth of the training set required for neural networks as the code distance of quantum error-correcting codes increases.Our decoding algorithm is based on renormalization group decoding and recurrent neural network decoder.The recurrent neural network is trained through the ResNet architecture to improve its decoding accuracy.Then we test the decoding performance of our distributed strategy decoder,recurrent neural network decoder,and the classic minimum weight perfect matching(MWPM)decoder for rotated surface codes with different code distances under the circuit noise model,the thresholds of these three decoders are about 0.0052,0.0051,and 0.0049,respectively.Our results demonstrate that the distributed strategy decoder outperforms the other two decoders,achieving approximately a 5%improvement in decoding efficiency compared to the MWPM decoder and approximately a 2%improvement compared to the recurrent neural network decoder.展开更多
Recently,coded caching has been treated as a promising technique to alleviate the traffic burden in wireless networks.To support high efficient coded caching multicast transmissions,the time-varying heterogeneous chan...Recently,coded caching has been treated as a promising technique to alleviate the traffic burden in wireless networks.To support high efficient coded caching multicast transmissions,the time-varying heterogeneous channel conditions need to be considered.In this paper,a practical and novel multi-source spinal coding(MSSC)scheme is developed for coded caching multicast transmissions under heterogeneous channel conditions.By exploring joint design of network coding and spinal coding(SC),MSSC can achieve unequal link rates in multicast transmissions for different users.Moreover,by leveraging the rateless feature of SC in our design,MSSC can well adapt the link rates of all users in multicast transmissions without any feedback of time-varying channel conditions.A maximum likelihood(ML)based decoding process for MSSC is also developed,which can achieve a linear complexity with respect to the user number in the multicast transmission.Simulation results validate the effectiveness of the MSSC scheme.Compared to the existing scheme,the sum rate of MSSC in multicast transmissions is improved by about 20%.When applying MSSC in coded caching systems,the total transmission time can be reduced by up to 48% for time-varying channels.展开更多
When employing penetration ammunition to strike multi-story buildings,the detection methods using acceleration sensors suffer from signal aliasing,while magnetic detection methods are susceptible to interference from ...When employing penetration ammunition to strike multi-story buildings,the detection methods using acceleration sensors suffer from signal aliasing,while magnetic detection methods are susceptible to interference from ferromagnetic materials,thereby posing challenges in accurately determining the number of layers.To address this issue,this research proposes a layer counting method for penetration fuze that incorporates multi-source information fusion,utilizing both the temporal convolutional network(TCN)and the long short-term memory(LSTM)recurrent network.By leveraging the strengths of these two network structures,the method extracts temporal and high-dimensional features from the multi-source physical field during the penetration process,establishing a relationship between the multi-source physical field and the distance between the fuze and the target plate.A simulation model is developed to simulate the overload and magnetic field of a projectile penetrating multiple layers of target plates,capturing the multi-source physical field signals and their patterns during the penetration process.The analysis reveals that the proposed multi-source fusion layer counting method reduces errors by 60% and 50% compared to single overload layer counting and single magnetic anomaly signal layer counting,respectively.The model's predictive performance is evaluated under various operating conditions,including different ratios of added noise to random sample positions,penetration speeds,and spacing between target plates.The maximum errors in fuze penetration time predicted by the three modes are 0.08 ms,0.12 ms,and 0.16 ms,respectively,confirming the robustness of the proposed model.Moreover,the model's predictions indicate that the fitting degree for large interlayer spacings is superior to that for small interlayer spacings due to the influence of stress waves.展开更多
Wireless Network security management is difficult because of the ever-increasing number of wireless network malfunctions,vulnerabilities,and assaults.Complex security systems,such as Intrusion Detection Systems(IDS),a...Wireless Network security management is difficult because of the ever-increasing number of wireless network malfunctions,vulnerabilities,and assaults.Complex security systems,such as Intrusion Detection Systems(IDS),are essential due to the limitations of simpler security measures,such as cryptography and firewalls.Due to their compact nature and low energy reserves,wireless networks present a significant challenge for security procedures.The features of small cells can cause threats to the network.Network Coding(NC)enabled small cells are vulnerable to various types of attacks.Avoiding attacks and performing secure“peer”to“peer”data transmission is a challenging task in small cells.Due to the low power and memory requirements of the proposed model,it is well suited to use with constrained small cells.An attacker cannot change the contents of data and generate a new Hashed Homomorphic Message Authentication Code(HHMAC)hash between transmissions since the HMAC function is generated using the shared secret.In this research,a chaotic sequence mapping based low overhead 1D Improved Logistic Map is used to secure“peer”to“peer”data transmission model using lightweight H-MAC(1D-LM-P2P-LHHMAC)is proposed with accurate intrusion detection.The proposed model is evaluated with the traditional models by considering various evaluation metrics like Vector Set Generation Accuracy Levels,Key Pair Generation Time Levels,Chaotic Map Accuracy Levels,Intrusion Detection Accuracy Levels,and the results represent that the proposed model performance in chaotic map accuracy level is 98%and intrusion detection is 98.2%.The proposed model is compared with the traditional models and the results represent that the proposed model secure data transmission levels are high.展开更多
Distribution networks denote important public infrastructure necessary for people’s livelihoods.However,extreme natural disasters,such as earthquakes,typhoons,and mudslides,severely threaten the safe and stable opera...Distribution networks denote important public infrastructure necessary for people’s livelihoods.However,extreme natural disasters,such as earthquakes,typhoons,and mudslides,severely threaten the safe and stable operation of distribution networks and power supplies needed for daily life.Therefore,considering the requirements for distribution network disaster prevention and mitigation,there is an urgent need for in-depth research on risk assessment methods of distribution networks under extreme natural disaster conditions.This paper accessesmultisource data,presents the data quality improvement methods of distribution networks,and conducts data-driven active fault diagnosis and disaster damage analysis and evaluation using data-driven theory.Furthermore,the paper realizes real-time,accurate access to distribution network disaster information.The proposed approach performs an accurate and rapid assessment of cross-sectional risk through case study.The minimal average annual outage time can be reduced to 3 h/a in the ring network through case study.The approach proposed in this paper can provide technical support to the further improvement of the ability of distribution networks to cope with extreme natural disasters.展开更多
Multi-source network coding allows intermediate nodes to linearly combine packets from multiple sources, but it is vulnerable to pollution attacks which can cause multiple down- stream data to be polluted. To solve th...Multi-source network coding allows intermediate nodes to linearly combine packets from multiple sources, but it is vulnerable to pollution attacks which can cause multiple down- stream data to be polluted. To solve this problem, we take advan- tage of lattice signature and homomorphic property to build a se- cure multi-source network coding scheme. By means of the lattice basis delegation algorithms, our scheme can generate a public lattice for all source nodes and the homomorphic signatures can be calculated on this lattice. Consequently, the multi-source signature problem can be transformed into single-source signature problem only if all source nodes are considered as a whole. Scheme analy- sis shows the correctness and homomorphic property of the pro- posed scheme.展开更多
This paper presents an intelligent protograph construction algorithm.Protograph LDPC codes have shown excellent error correction performance and play an important role in wireless communications.Random search or manua...This paper presents an intelligent protograph construction algorithm.Protograph LDPC codes have shown excellent error correction performance and play an important role in wireless communications.Random search or manual construction are often used to obtain a good protograph,but the efficiency is not high enough and many experience and skills are needed.In this paper,a fast searching algorithm is proposed using the convolution neural network to predict the iterative decoding thresholds of protograph LDPC codes effectively.A special input data transformation rule is applied to provide stronger generalization ability.The proposed algorithm converges faster than other algorithms.The iterative decoding threshold of the constructed protograph surpasses greedy algorithm and random search by about 0.53 dB and 0.93 dB respectively under 100 times of density evolution.Simulation results show that quasi-cyclic LDPC(QC-LDPC)codes constructed from the proposed algorithm have competitive performance compared to other papers.展开更多
In coded caching,users cache pieces of files under a specific arrangement so that the server can satisfy their requests simultaneously in the broadcast scenario via e Xclusive OR(XOR)operation and therefore reduce the...In coded caching,users cache pieces of files under a specific arrangement so that the server can satisfy their requests simultaneously in the broadcast scenario via e Xclusive OR(XOR)operation and therefore reduce the amount of transmission data.However,when users’locations are changing,the uploading of caching information is frequent and extensive that the traffic increase outweighed the traffic reduction that the traditional coded caching achieved.In this paper,we propose mobile coded caching schemes to reduce network traffic in mobility scenarios,which achieve a lower cost on caching information uploading.In the cache placement phase,the proposed scheme first constructs caching patterns,and then assigns the caching patterns to users according to the graph coloring method and four color theorem in our centralized cache placement algorithm or randomly in our decentralized cache placement algorithm.Then users are divided into groups based on their caching patterns.As a benefit,when user movements occur,the types of caching pattern,rather than the whole caching information of which file pieces are cached,are uploaded.In the content delivery phase,XOR coded caching messages are reconstructed.Transmission data volume is derived to measure the performance of the proposed schemes.Numerical results show that the proposed schemes achieve great improvement in traffic offloading.展开更多
In today’s information technology(IT)world,the multi-hop wireless sensor networks(MHWSNs)are considered the building block for the Internet of Things(IoT)enabled communication systems for controlling everyday tasks o...In today’s information technology(IT)world,the multi-hop wireless sensor networks(MHWSNs)are considered the building block for the Internet of Things(IoT)enabled communication systems for controlling everyday tasks of organizations and industry to provide quality of service(QoS)in a stipulated time slot to end-user over the Internet.Smart city(SC)is an example of one such application which can automate a group of civil services like automatic control of traffic lights,weather prediction,surveillance,etc.,in our daily life.These IoT-based networks with multi-hop communication and multiple sink nodes provide efficient communication in terms of performance parameters such as throughput,energy efficiency,and end-to-end delay,wherein low latency is considered a challenging issue in next-generation networks(NGN).This paper introduces a single and parallels stable server queuing model with amulti-class of packets and native and coded packet flowto illustrate the simple chain topology and complexmultiway relay(MWR)node with specific neighbor topology.Further,for improving data transmission capacity inMHWSNs,an analytical framework for packet transmission using network coding at the MWR node in the network layer with opportunistic listening is performed by considering bi-directional network flow at the MWR node.Finally,the accuracy of the proposed multi-server multi-class queuing model is evaluated with and without network coding at the network layer by transmitting data packets.The results of the proposed analytical framework are validated and proved effective by comparing these analytical results to simulation results.展开更多
With the rapid development of the mobile Internet,users generate massive data in different forms in social network every day,and different characteristics of users are reflected by these social media data.How to integ...With the rapid development of the mobile Internet,users generate massive data in different forms in social network every day,and different characteristics of users are reflected by these social media data.How to integrate multiple heterogeneous information and establish user profiles from multiple perspectives plays an important role in providing personalized services,marketing,and recommendation systems.In this paper,we propose Multi-source&Multi-task Learning for User Profiles in Social Network which integrates multiple social data sources and contains a multi-task learning framework to simultaneously predict various attributes of a user.Firstly,we design their own feature extraction models for multiple heterogeneous data sources.Secondly,we design a shared layer to fuse multiple heterogeneous data sources as general shared representation for multi-task learning.Thirdly,we design each task’s own unique presentation layer for discriminant output of specific-task.Finally,we design a weighted loss function to improve the learning efficiency and prediction accuracy of each task.Our experimental results on more than 5000 Sina Weibo users demonstrate that our approach outperforms state-of-the-art baselines for inferring gender,age and region of social media users.展开更多
Network Coding (NC) is a recent technique which is used to improve the transmission data rate and the power efficiency. These goals are obtained by combining data together before transmitting them, resulting to less t...Network Coding (NC) is a recent technique which is used to improve the transmission data rate and the power efficiency. These goals are obtained by combining data together before transmitting them, resulting to less transmitted data that carry the same amount of information. NC research work over the physical layer and the upper layers are popular and needed to be more investigated. In this paper, we propose a practical system of large-number of connected multi-source network coding (LMSNC), at the physical layer that exploits the broadcast nature of the wireless channel, using the practical and bandwidth-efficient schemes decode-and-forward (DF) and then compare it with Amplify and Forward (AF). The theoretical analysis and the simulation results show the effect of the noise when it cumulates in AF system and how DF is solving this severe default. Moreover, we consider the MSNC for Small-number of connected sources (SMSNC) and the two-way communication setup where two users exchange their information over an intermediate network node (ideally called Base Station), as two reference cases to compare with. With SMSNC, the number of necessary downlink transmissions from the intermediate node to the users is reduced, and thus the throughput is increased. Simulation results obtained using high-performance non-binary turbo codes, based on Partial Unit Memory (PUM) codes (4, 2, 1, 4) and (8, 4, 3, 8);confirm that combining PUM Turbo Code (PUMTC) and NC in the proposed MSNC setup gives almost the same BER performance as that for SMSNC at the small number of processing steps mainly when PUMTC (8, 4, 3, 8) is performed, which is required to retrieve the received coded messages. In the scenario of AF, combining packets results to cumulate the noise, which justifies the reason we decided to increase the number of transmitted coded messages in the network, i.e., the BER performance improves when sending extra coded messages. Finally, the possibility for a trade-off among BER, data rate and the number of transmitted coded messages is shown for LMSNC through graphics and simulation results.展开更多
Blockchain technology has witnessed a burgeoning integration into diverse realms of economic and societal development.Nevertheless,scalability challenges,characterized by diminished broadcast efficiency,heightened com...Blockchain technology has witnessed a burgeoning integration into diverse realms of economic and societal development.Nevertheless,scalability challenges,characterized by diminished broadcast efficiency,heightened communication overhead,and escalated storage costs,have significantly constrained the broad-scale application of blockchain.This paper introduces a novel Encode-and CRT-based Scalability Scheme(ECSS),meticulously refined to enhance both block broadcasting and storage.Primarily,ECSS categorizes nodes into distinct domains,thereby reducing the network diameter and augmenting transmission efficiency.Secondly,ECSS streamlines block transmission through a compact block protocol and robust RS coding,which not only reduces the size of broadcasted blocks but also ensures transmission reliability.Finally,ECSS utilizes the Chinese remainder theorem,designating the block body as the compression target and mapping it to multiple modules to achieve efficient storage,thereby alleviating the storage burdens on nodes.To evaluate ECSS’s performance,we established an experimental platformand conducted comprehensive assessments.Empirical results demonstrate that ECSS attains superior network scalability and stability,reducing communication overhead by an impressive 72% and total storage costs by a substantial 63.6%.展开更多
In this work, the homomorphism of the classic linear block code in linear network coding for the case of binary field and its extensions is studied. It is proved that the classic linear error-control block code is hom...In this work, the homomorphism of the classic linear block code in linear network coding for the case of binary field and its extensions is studied. It is proved that the classic linear error-control block code is homomorphic network error-control code in network coding. That is, if the source packets at the source node for a linear network coding are precoded using a linear block code, then every packet flowing in the network regarding to the source satisfies the same constraints as the source. As a consequence, error detection and correction can be performed at every intermediate nodes of multicast flow, rather than only at the destination node in the conventional way, which can help to identify and correct errors timely at the error-corrupted link and save the cost of forwarding error-corrupted data to the destination node when the intermediate nodes are ignorant of the errors. In addition, three examples are demonstrated which show that homomorphic linear code can be combined with homomorphic signature, McEliece public-key cryptosystem and unequal error protection respectively and thus have a great potential of practical utility.展开更多
With the growth of the Internet,more and more business is being done online,for example,online offices,online education and so on.While this makes people’s lives more convenient,it also increases the risk of the netw...With the growth of the Internet,more and more business is being done online,for example,online offices,online education and so on.While this makes people’s lives more convenient,it also increases the risk of the network being attacked by malicious code.Therefore,it is important to identify malicious codes on computer systems efficiently.However,most of the existing malicious code detection methods have two problems:(1)The ability of the model to extract features is weak,resulting in poor model performance.(2)The large scale of model data leads to difficulties deploying on devices with limited resources.Therefore,this paper proposes a lightweight malicious code identification model Lightweight Malicious Code Classification Method Based on Improved SqueezeNet(LCMISNet).In this paper,the MFire lightweight feature extraction module is constructed by proposing a feature slicing module and a multi-size depthwise separable convolution module.The feature slicing module reduces the number of parameters by grouping features.The multi-size depthwise separable convolution module reduces the number of parameters and enhances the feature extraction capability by replacing the standard convolution with depthwise separable convolution with different convolution kernel sizes.In addition,this paper also proposes a feature splicing module to connect the MFire lightweight feature extraction module based on the feature reuse and constructs the lightweight model LCMISNet.The malicious code recognition accuracy of LCMISNet on the BIG 2015 dataset and the Malimg dataset reaches 98.90% and 99.58%,respectively.It proves that LCMISNet has a powerful malicious code recognition performance.In addition,compared with other network models,LCMISNet has better performance,and a lower number of parameters and computations.展开更多
A network-coding-based multisource LDPC-coded cooperative MIMO scheme is proposed,where multiple sources transmit their messages to the destination with the assistance from a single relay.The relay cooperates with mul...A network-coding-based multisource LDPC-coded cooperative MIMO scheme is proposed,where multiple sources transmit their messages to the destination with the assistance from a single relay.The relay cooperates with multiple sources simultaneously via network-coding.It avoids the issues of imperfect frequency/timing synchronization and large transmission delay which may be introduced by frequency-division multiple access(FDMA)/code-division multiple access(CDMA)and time-division multiple access(TDMA)manners.The proposed joint″Min-Sum″iterative decoding is effectively carried out in the destination.Such a decoding algorithm agrees with the introduced equivalent joint Tanner graph which can be used to fully characterize LDPC codes employed by the sources and relay.Theoretical analysis and numerical simulation show that the proposed scheme with joint iterative decoding can achieve significant cooperation diversity gain.Furthermore,for the relay,compared with the cascade scheme,the proposed scheme has much lower complexity of LDPC-encoding and is easier to be implemented in the hardware with similar bit error rate(BER)performance.展开更多
The Base Station (BS) or access point is the building block of wireless networks, so, we propose exploiting it together with the Network Coding (NC) principle. NC suffers from the complexity of the decoding processes,...The Base Station (BS) or access point is the building block of wireless networks, so, we propose exploiting it together with the Network Coding (NC) principle. NC suffers from the complexity of the decoding processes, i.e., complicated Jordan Gaussian Elimination (JGE) processes. So, this paper proposes a deterministic NC algorithm to reduce the number of sequential network decoding steps, and hence minimizing the complexity of JGE process resulting to better time delay and processing time. We propose an algorithm that combines higher number of the transmitted packets resulting to better data-rate but worse Bet Error Rate (BER). However, using such strong Forward error correction channel code, which is Partial Unit Memory Turbo Code (PUMTC) results to minimize the losses in the BER to a very acceptable lever, in fact, in Decode-and-Forward (DF) BS, the BER can be regarded as minimum. Simulation results, for both Amplify-and-Forward (AF) and DF BS schemes using PUMTC based on (8, 4, 3, 8) component codes, confirm that using PUMTC mitigates the problem of noise aggregation resulting from applying NC in the proposed schemes.展开更多
<div style="text-align:justify;"> Polar codes using successive-cancellation decoding always suffer from high latency for its serial nature. Fast simplified successive-cancellation decoding algorithm im...<div style="text-align:justify;"> Polar codes using successive-cancellation decoding always suffer from high latency for its serial nature. Fast simplified successive-cancellation decoding algorithm improves the situation in theoretically but not performs well as expected in practical for the workload of nodes identification and the existence of many short blocks. Meanwhile, Neural network (NN) based decoders have appeared as potential candidates to replace conventional decoders for polar codes. But the exponentially increasing training complexity with information bits is unacceptable which means it is only suitable for short codes. In this paper, we present an improvement that increases decoding efficiency without degrading the error-correction performance. The long polar codes are divided into several sub-blocks, some of which can be decoded adopting fast maximum likelihood decoding method and the remained parts are replaced by several short codes NN decoders. The result shows that time steps the proposed algorithm need only equal to 79.8% of fast simplified successive-cancellation decoders require. Moreover, it has up to 21.2 times faster than successive-cancellation decoding algorithm. More importantly, the proposed algorithm decreases the hardness when applying in some degree. </div>展开更多
基金supported by the National Natural Science Foundation of China(Nos.52279107 and 52379106)the Qingdao Guoxin Jiaozhou Bay Second Submarine Tunnel Co.,Ltd.,the Academician and Expert Workstation of Yunnan Province(No.202205AF150015)the Science and Technology Innovation Project of YCIC Group Co.,Ltd.(No.YCIC-YF-2022-15)。
文摘Rock mass quality serves as a vital index for predicting the stability and safety status of rock tunnel faces.In tunneling practice,the rock mass quality is often assessed via a combination of qualitative and quantitative parameters.However,due to the harsh on-site construction conditions,it is rather difficult to obtain some of the evaluation parameters which are essential for the rock mass quality prediction.In this study,a novel improved Swin Transformer is proposed to detect,segment,and quantify rock mass characteristic parameters such as water leakage,fractures,weak interlayers.The site experiment results demonstrate that the improved Swin Transformer achieves optimal segmentation results and achieving accuracies of 92%,81%,and 86%for water leakage,fractures,and weak interlayers,respectively.A multisource rock tunnel face characteristic(RTFC)dataset includes 11 parameters for predicting rock mass quality is established.Considering the limitations in predictive performance of incomplete evaluation parameters exist in this dataset,a novel tree-augmented naive Bayesian network(BN)is proposed to address the challenge of the incomplete dataset and achieved a prediction accuracy of 88%.In comparison with other commonly used Machine Learning models the proposed BN-based approach proved an improved performance on predicting the rock mass quality with the incomplete dataset.By utilizing the established BN,a further sensitivity analysis is conducted to quantitatively evaluate the importance of the various parameters,results indicate that the rock strength and fractures parameter exert the most significant influence on rock mass quality.
基金Project supported by Natural Science Foundation of Shandong Province,China (Grant Nos.ZR2021MF049,ZR2022LLZ012,and ZR2021LLZ001)。
文摘Quantum error correction is a crucial technology for realizing quantum computers.These computers achieve faulttolerant quantum computing by detecting and correcting errors using decoding algorithms.Quantum error correction using neural network-based machine learning methods is a promising approach that is adapted to physical systems without the need to build noise models.In this paper,we use a distributed decoding strategy,which effectively alleviates the problem of exponential growth of the training set required for neural networks as the code distance of quantum error-correcting codes increases.Our decoding algorithm is based on renormalization group decoding and recurrent neural network decoder.The recurrent neural network is trained through the ResNet architecture to improve its decoding accuracy.Then we test the decoding performance of our distributed strategy decoder,recurrent neural network decoder,and the classic minimum weight perfect matching(MWPM)decoder for rotated surface codes with different code distances under the circuit noise model,the thresholds of these three decoders are about 0.0052,0.0051,and 0.0049,respectively.Our results demonstrate that the distributed strategy decoder outperforms the other two decoders,achieving approximately a 5%improvement in decoding efficiency compared to the MWPM decoder and approximately a 2%improvement compared to the recurrent neural network decoder.
基金supported by National Natural Science Foundation of China(No.61801290 and 61771312).
文摘Recently,coded caching has been treated as a promising technique to alleviate the traffic burden in wireless networks.To support high efficient coded caching multicast transmissions,the time-varying heterogeneous channel conditions need to be considered.In this paper,a practical and novel multi-source spinal coding(MSSC)scheme is developed for coded caching multicast transmissions under heterogeneous channel conditions.By exploring joint design of network coding and spinal coding(SC),MSSC can achieve unequal link rates in multicast transmissions for different users.Moreover,by leveraging the rateless feature of SC in our design,MSSC can well adapt the link rates of all users in multicast transmissions without any feedback of time-varying channel conditions.A maximum likelihood(ML)based decoding process for MSSC is also developed,which can achieve a linear complexity with respect to the user number in the multicast transmission.Simulation results validate the effectiveness of the MSSC scheme.Compared to the existing scheme,the sum rate of MSSC in multicast transmissions is improved by about 20%.When applying MSSC in coded caching systems,the total transmission time can be reduced by up to 48% for time-varying channels.
文摘When employing penetration ammunition to strike multi-story buildings,the detection methods using acceleration sensors suffer from signal aliasing,while magnetic detection methods are susceptible to interference from ferromagnetic materials,thereby posing challenges in accurately determining the number of layers.To address this issue,this research proposes a layer counting method for penetration fuze that incorporates multi-source information fusion,utilizing both the temporal convolutional network(TCN)and the long short-term memory(LSTM)recurrent network.By leveraging the strengths of these two network structures,the method extracts temporal and high-dimensional features from the multi-source physical field during the penetration process,establishing a relationship between the multi-source physical field and the distance between the fuze and the target plate.A simulation model is developed to simulate the overload and magnetic field of a projectile penetrating multiple layers of target plates,capturing the multi-source physical field signals and their patterns during the penetration process.The analysis reveals that the proposed multi-source fusion layer counting method reduces errors by 60% and 50% compared to single overload layer counting and single magnetic anomaly signal layer counting,respectively.The model's predictive performance is evaluated under various operating conditions,including different ratios of added noise to random sample positions,penetration speeds,and spacing between target plates.The maximum errors in fuze penetration time predicted by the three modes are 0.08 ms,0.12 ms,and 0.16 ms,respectively,confirming the robustness of the proposed model.Moreover,the model's predictions indicate that the fitting degree for large interlayer spacings is superior to that for small interlayer spacings due to the influence of stress waves.
文摘Wireless Network security management is difficult because of the ever-increasing number of wireless network malfunctions,vulnerabilities,and assaults.Complex security systems,such as Intrusion Detection Systems(IDS),are essential due to the limitations of simpler security measures,such as cryptography and firewalls.Due to their compact nature and low energy reserves,wireless networks present a significant challenge for security procedures.The features of small cells can cause threats to the network.Network Coding(NC)enabled small cells are vulnerable to various types of attacks.Avoiding attacks and performing secure“peer”to“peer”data transmission is a challenging task in small cells.Due to the low power and memory requirements of the proposed model,it is well suited to use with constrained small cells.An attacker cannot change the contents of data and generate a new Hashed Homomorphic Message Authentication Code(HHMAC)hash between transmissions since the HMAC function is generated using the shared secret.In this research,a chaotic sequence mapping based low overhead 1D Improved Logistic Map is used to secure“peer”to“peer”data transmission model using lightweight H-MAC(1D-LM-P2P-LHHMAC)is proposed with accurate intrusion detection.The proposed model is evaluated with the traditional models by considering various evaluation metrics like Vector Set Generation Accuracy Levels,Key Pair Generation Time Levels,Chaotic Map Accuracy Levels,Intrusion Detection Accuracy Levels,and the results represent that the proposed model performance in chaotic map accuracy level is 98%and intrusion detection is 98.2%.The proposed model is compared with the traditional models and the results represent that the proposed model secure data transmission levels are high.
文摘Distribution networks denote important public infrastructure necessary for people’s livelihoods.However,extreme natural disasters,such as earthquakes,typhoons,and mudslides,severely threaten the safe and stable operation of distribution networks and power supplies needed for daily life.Therefore,considering the requirements for distribution network disaster prevention and mitigation,there is an urgent need for in-depth research on risk assessment methods of distribution networks under extreme natural disaster conditions.This paper accessesmultisource data,presents the data quality improvement methods of distribution networks,and conducts data-driven active fault diagnosis and disaster damage analysis and evaluation using data-driven theory.Furthermore,the paper realizes real-time,accurate access to distribution network disaster information.The proposed approach performs an accurate and rapid assessment of cross-sectional risk through case study.The minimal average annual outage time can be reduced to 3 h/a in the ring network through case study.The approach proposed in this paper can provide technical support to the further improvement of the ability of distribution networks to cope with extreme natural disasters.
基金Supported by the National Natural Science Foundation of China(61571024,61272501)the National Basic Research Program of China(2012CB315905)the Research Promotion Grants-in-Aid for KUT Graduates of Special Scholarship Program and the Fundamental Research Funds for Central Universities(YWF15GJSYS059)
文摘Multi-source network coding allows intermediate nodes to linearly combine packets from multiple sources, but it is vulnerable to pollution attacks which can cause multiple down- stream data to be polluted. To solve this problem, we take advan- tage of lattice signature and homomorphic property to build a se- cure multi-source network coding scheme. By means of the lattice basis delegation algorithms, our scheme can generate a public lattice for all source nodes and the homomorphic signatures can be calculated on this lattice. Consequently, the multi-source signature problem can be transformed into single-source signature problem only if all source nodes are considered as a whole. Scheme analy- sis shows the correctness and homomorphic property of the pro- posed scheme.
基金supported in part with the Project on the Industry Key Technologies of Jiangsu Province(No.BE2017153)the Industry-University-Research Fund of ZTE Corporation.
文摘This paper presents an intelligent protograph construction algorithm.Protograph LDPC codes have shown excellent error correction performance and play an important role in wireless communications.Random search or manual construction are often used to obtain a good protograph,but the efficiency is not high enough and many experience and skills are needed.In this paper,a fast searching algorithm is proposed using the convolution neural network to predict the iterative decoding thresholds of protograph LDPC codes effectively.A special input data transformation rule is applied to provide stronger generalization ability.The proposed algorithm converges faster than other algorithms.The iterative decoding threshold of the constructed protograph surpasses greedy algorithm and random search by about 0.53 dB and 0.93 dB respectively under 100 times of density evolution.Simulation results show that quasi-cyclic LDPC(QC-LDPC)codes constructed from the proposed algorithm have competitive performance compared to other papers.
基金supported by National Natural Science Foundation of China(No.61971060)。
文摘In coded caching,users cache pieces of files under a specific arrangement so that the server can satisfy their requests simultaneously in the broadcast scenario via e Xclusive OR(XOR)operation and therefore reduce the amount of transmission data.However,when users’locations are changing,the uploading of caching information is frequent and extensive that the traffic increase outweighed the traffic reduction that the traditional coded caching achieved.In this paper,we propose mobile coded caching schemes to reduce network traffic in mobility scenarios,which achieve a lower cost on caching information uploading.In the cache placement phase,the proposed scheme first constructs caching patterns,and then assigns the caching patterns to users according to the graph coloring method and four color theorem in our centralized cache placement algorithm or randomly in our decentralized cache placement algorithm.Then users are divided into groups based on their caching patterns.As a benefit,when user movements occur,the types of caching pattern,rather than the whole caching information of which file pieces are cached,are uploaded.In the content delivery phase,XOR coded caching messages are reconstructed.Transmission data volume is derived to measure the performance of the proposed schemes.Numerical results show that the proposed schemes achieve great improvement in traffic offloading.
文摘In today’s information technology(IT)world,the multi-hop wireless sensor networks(MHWSNs)are considered the building block for the Internet of Things(IoT)enabled communication systems for controlling everyday tasks of organizations and industry to provide quality of service(QoS)in a stipulated time slot to end-user over the Internet.Smart city(SC)is an example of one such application which can automate a group of civil services like automatic control of traffic lights,weather prediction,surveillance,etc.,in our daily life.These IoT-based networks with multi-hop communication and multiple sink nodes provide efficient communication in terms of performance parameters such as throughput,energy efficiency,and end-to-end delay,wherein low latency is considered a challenging issue in next-generation networks(NGN).This paper introduces a single and parallels stable server queuing model with amulti-class of packets and native and coded packet flowto illustrate the simple chain topology and complexmultiway relay(MWR)node with specific neighbor topology.Further,for improving data transmission capacity inMHWSNs,an analytical framework for packet transmission using network coding at the MWR node in the network layer with opportunistic listening is performed by considering bi-directional network flow at the MWR node.Finally,the accuracy of the proposed multi-server multi-class queuing model is evaluated with and without network coding at the network layer by transmitting data packets.The results of the proposed analytical framework are validated and proved effective by comparing these analytical results to simulation results.
基金This work is supported by State Grid Science and Technology Project under Grant No.520613180002,62061318C002the Fundamental Research Funds for the Central Universities(Grant No.HIT.NSRIF.201714)+4 种基金Weihai Science and Technology Development Program(2016DXGJMS15)Key Research and Development Program in Shandong Provincial(2017GGX90103)Sanming Science and Technology Project,Grant No.2015-G-6,Shandong province vocational education educational reform research project.Grant No.2017209Study and Development of Smart Agriculture Control System Based on Spark Big Data Decision(2017N0029)Jiangsu Province industrial Communication Technology Application Technology Innovation Team Project.
文摘With the rapid development of the mobile Internet,users generate massive data in different forms in social network every day,and different characteristics of users are reflected by these social media data.How to integrate multiple heterogeneous information and establish user profiles from multiple perspectives plays an important role in providing personalized services,marketing,and recommendation systems.In this paper,we propose Multi-source&Multi-task Learning for User Profiles in Social Network which integrates multiple social data sources and contains a multi-task learning framework to simultaneously predict various attributes of a user.Firstly,we design their own feature extraction models for multiple heterogeneous data sources.Secondly,we design a shared layer to fuse multiple heterogeneous data sources as general shared representation for multi-task learning.Thirdly,we design each task’s own unique presentation layer for discriminant output of specific-task.Finally,we design a weighted loss function to improve the learning efficiency and prediction accuracy of each task.Our experimental results on more than 5000 Sina Weibo users demonstrate that our approach outperforms state-of-the-art baselines for inferring gender,age and region of social media users.
文摘Network Coding (NC) is a recent technique which is used to improve the transmission data rate and the power efficiency. These goals are obtained by combining data together before transmitting them, resulting to less transmitted data that carry the same amount of information. NC research work over the physical layer and the upper layers are popular and needed to be more investigated. In this paper, we propose a practical system of large-number of connected multi-source network coding (LMSNC), at the physical layer that exploits the broadcast nature of the wireless channel, using the practical and bandwidth-efficient schemes decode-and-forward (DF) and then compare it with Amplify and Forward (AF). The theoretical analysis and the simulation results show the effect of the noise when it cumulates in AF system and how DF is solving this severe default. Moreover, we consider the MSNC for Small-number of connected sources (SMSNC) and the two-way communication setup where two users exchange their information over an intermediate network node (ideally called Base Station), as two reference cases to compare with. With SMSNC, the number of necessary downlink transmissions from the intermediate node to the users is reduced, and thus the throughput is increased. Simulation results obtained using high-performance non-binary turbo codes, based on Partial Unit Memory (PUM) codes (4, 2, 1, 4) and (8, 4, 3, 8);confirm that combining PUM Turbo Code (PUMTC) and NC in the proposed MSNC setup gives almost the same BER performance as that for SMSNC at the small number of processing steps mainly when PUMTC (8, 4, 3, 8) is performed, which is required to retrieve the received coded messages. In the scenario of AF, combining packets results to cumulate the noise, which justifies the reason we decided to increase the number of transmitted coded messages in the network, i.e., the BER performance improves when sending extra coded messages. Finally, the possibility for a trade-off among BER, data rate and the number of transmitted coded messages is shown for LMSNC through graphics and simulation results.
文摘Blockchain technology has witnessed a burgeoning integration into diverse realms of economic and societal development.Nevertheless,scalability challenges,characterized by diminished broadcast efficiency,heightened communication overhead,and escalated storage costs,have significantly constrained the broad-scale application of blockchain.This paper introduces a novel Encode-and CRT-based Scalability Scheme(ECSS),meticulously refined to enhance both block broadcasting and storage.Primarily,ECSS categorizes nodes into distinct domains,thereby reducing the network diameter and augmenting transmission efficiency.Secondly,ECSS streamlines block transmission through a compact block protocol and robust RS coding,which not only reduces the size of broadcasted blocks but also ensures transmission reliability.Finally,ECSS utilizes the Chinese remainder theorem,designating the block body as the compression target and mapping it to multiple modules to achieve efficient storage,thereby alleviating the storage burdens on nodes.To evaluate ECSS’s performance,we established an experimental platformand conducted comprehensive assessments.Empirical results demonstrate that ECSS attains superior network scalability and stability,reducing communication overhead by an impressive 72% and total storage costs by a substantial 63.6%.
基金supported by Natural Science Foundation of China (No.61271258)
文摘In this work, the homomorphism of the classic linear block code in linear network coding for the case of binary field and its extensions is studied. It is proved that the classic linear error-control block code is homomorphic network error-control code in network coding. That is, if the source packets at the source node for a linear network coding are precoded using a linear block code, then every packet flowing in the network regarding to the source satisfies the same constraints as the source. As a consequence, error detection and correction can be performed at every intermediate nodes of multicast flow, rather than only at the destination node in the conventional way, which can help to identify and correct errors timely at the error-corrupted link and save the cost of forwarding error-corrupted data to the destination node when the intermediate nodes are ignorant of the errors. In addition, three examples are demonstrated which show that homomorphic linear code can be combined with homomorphic signature, McEliece public-key cryptosystem and unequal error protection respectively and thus have a great potential of practical utility.
文摘With the growth of the Internet,more and more business is being done online,for example,online offices,online education and so on.While this makes people’s lives more convenient,it also increases the risk of the network being attacked by malicious code.Therefore,it is important to identify malicious codes on computer systems efficiently.However,most of the existing malicious code detection methods have two problems:(1)The ability of the model to extract features is weak,resulting in poor model performance.(2)The large scale of model data leads to difficulties deploying on devices with limited resources.Therefore,this paper proposes a lightweight malicious code identification model Lightweight Malicious Code Classification Method Based on Improved SqueezeNet(LCMISNet).In this paper,the MFire lightweight feature extraction module is constructed by proposing a feature slicing module and a multi-size depthwise separable convolution module.The feature slicing module reduces the number of parameters by grouping features.The multi-size depthwise separable convolution module reduces the number of parameters and enhances the feature extraction capability by replacing the standard convolution with depthwise separable convolution with different convolution kernel sizes.In addition,this paper also proposes a feature splicing module to connect the MFire lightweight feature extraction module based on the feature reuse and constructs the lightweight model LCMISNet.The malicious code recognition accuracy of LCMISNet on the BIG 2015 dataset and the Malimg dataset reaches 98.90% and 99.58%,respectively.It proves that LCMISNet has a powerful malicious code recognition performance.In addition,compared with other network models,LCMISNet has better performance,and a lower number of parameters and computations.
基金Supported by the Postdoctoral Science Foundation of China(2014M561694)the Science and Technology on Avionics Integration Laboratory and National Aeronautical Science Foundation of China(20105552)
文摘A network-coding-based multisource LDPC-coded cooperative MIMO scheme is proposed,where multiple sources transmit their messages to the destination with the assistance from a single relay.The relay cooperates with multiple sources simultaneously via network-coding.It avoids the issues of imperfect frequency/timing synchronization and large transmission delay which may be introduced by frequency-division multiple access(FDMA)/code-division multiple access(CDMA)and time-division multiple access(TDMA)manners.The proposed joint″Min-Sum″iterative decoding is effectively carried out in the destination.Such a decoding algorithm agrees with the introduced equivalent joint Tanner graph which can be used to fully characterize LDPC codes employed by the sources and relay.Theoretical analysis and numerical simulation show that the proposed scheme with joint iterative decoding can achieve significant cooperation diversity gain.Furthermore,for the relay,compared with the cascade scheme,the proposed scheme has much lower complexity of LDPC-encoding and is easier to be implemented in the hardware with similar bit error rate(BER)performance.
文摘The Base Station (BS) or access point is the building block of wireless networks, so, we propose exploiting it together with the Network Coding (NC) principle. NC suffers from the complexity of the decoding processes, i.e., complicated Jordan Gaussian Elimination (JGE) processes. So, this paper proposes a deterministic NC algorithm to reduce the number of sequential network decoding steps, and hence minimizing the complexity of JGE process resulting to better time delay and processing time. We propose an algorithm that combines higher number of the transmitted packets resulting to better data-rate but worse Bet Error Rate (BER). However, using such strong Forward error correction channel code, which is Partial Unit Memory Turbo Code (PUMTC) results to minimize the losses in the BER to a very acceptable lever, in fact, in Decode-and-Forward (DF) BS, the BER can be regarded as minimum. Simulation results, for both Amplify-and-Forward (AF) and DF BS schemes using PUMTC based on (8, 4, 3, 8) component codes, confirm that using PUMTC mitigates the problem of noise aggregation resulting from applying NC in the proposed schemes.
文摘<div style="text-align:justify;"> Polar codes using successive-cancellation decoding always suffer from high latency for its serial nature. Fast simplified successive-cancellation decoding algorithm improves the situation in theoretically but not performs well as expected in practical for the workload of nodes identification and the existence of many short blocks. Meanwhile, Neural network (NN) based decoders have appeared as potential candidates to replace conventional decoders for polar codes. But the exponentially increasing training complexity with information bits is unacceptable which means it is only suitable for short codes. In this paper, we present an improvement that increases decoding efficiency without degrading the error-correction performance. The long polar codes are divided into several sub-blocks, some of which can be decoded adopting fast maximum likelihood decoding method and the remained parts are replaced by several short codes NN decoders. The result shows that time steps the proposed algorithm need only equal to 79.8% of fast simplified successive-cancellation decoders require. Moreover, it has up to 21.2 times faster than successive-cancellation decoding algorithm. More importantly, the proposed algorithm decreases the hardness when applying in some degree. </div>