Intrusion Detection Model Using Chaotic MAP for Network Coding Enabled Mobile Small Cells

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.

Recurrent neural network decoding of rotated surface codes based on distributed strategy

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.

Adoption of network and plan-do-check-action in the international classification of disease 10 coding

BACKGROUND with the widespread application of computer network systems in the medical field,the plan-do-check-action(PDCA)and the international classification of diseases tenth edition(ICD-10)coding system have also achieved favorable results in clinical medical record management.However,research on their combined application is relatively lacking.Objective:it was to explore the impact of network systems and PDCA management mode on ICD-10 encoding.Material and Method:a retrospective collection of 768 discharged medical records from the Medical Record Management Department of Meishan People’s Hospital was conducted.They were divided into a control group(n=232)and an observation group(n=536)based on whether the PDCA management mode was implemented.The two sets of coding accuracy,time spent,case completion rate,satisfaction,and other indicators were compared.AIM To study the adoption of network and PDCA in the ICD-10.METHODS A retrospective collection of 768 discharged medical records from the Medical Record Management Department of Meishan People’s Hospital was conducted.They were divided into a control group(n=232)and an observation group(n=536)based on whether the PDCA management mode was implemented.The two sets of coding accuracy,time spent,case completion rate,satisfaction,and other indicators were compared.RESULTS In the 3,6,12,18,and 24 months of PDCA cycle management mode,the coding accuracy and medical record completion rate were higher,and the coding time was lower in the observation group as against the controls(P<0.05).The satisfaction of coders(80.22%vs 53.45%)and patients(84.89%vs 51.72%)in the observation group was markedly higher as against the controls(P<0.05).CONCLUSION The combination of computer networks and PDCA can improve the accuracy,efficiency,completion rate,and satisfaction of ICD-10 coding.

A New Network Coding Mechanism Balancing Coding Opportunities, Energy and QoS in WSNs

A new Network Coding mechanism in WSNs(Wireless Sensor Networks), which is named COEQ and aims at balancing coding opportunities, energy and QoS, is proposed and analyzed. Implemented on the basis of traditional AODV protocol, COEQ evaluates several metrics of paths comprehensively with TOPSIS method including minimum remaining energy, coding opportunities, QoS and so on, so as to select the optimal transmitting route. Experiments on NS[2] show that COEQ can improve throughput and save energy when the transmitting rate is low.

Mobile Coded Caching in Small Cell Networks:Algorithm Design and Performance Analysis

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.

Multiway Relay Based Framework for Network Coding in Multi-Hop WSNs

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.

Network Coding Cooperation Performance Analysis in Wireless Network over a Lossy Channel, M Users and a Destination Scenario

Network coding (NC), introduced at the turn of the century, enables nodes in a network to combine data algebraically before either sending or forwarding them. Random network coding has gained popularity over the years by combining the received packet randomly before forwarding them, resulting in a complex Jordan Gaussian Elimination (JGE) decoding process. The effectiveness of random NC is through cooperation among nodes. In this paper, we propose a simple, low-complexity cooperative protocol that exploits NC in a deterministic manner resulting in improved diversity, data rate, and less complex JGE decoding process. The proposed system is applied over a lossy wireless network. The scenario under investigation is as follows: M users must send their information to a common destination D and to exchange the information between each others, over erasure channels;typically the channels between the users and the destination are worse than the channels between users. It is possible to significantly reduce the traffic among users and destination, achieving significant bandwidth savings, by combining packets from different users in simple, deterministic ways without resorting to extensive header information before being forwarded to the destination and the M users. The key problem we try to address is how to efficiently combine the packets at each user while exploiting user cooperation and the probability of successfully recovering information from all users at D with k < 2M unique linear equations, accounting for the fact that the remaining packets will be lost in the network and there are two transmission stages. Simulation results show the behaviour for two and three transmission stages. Our results show that applying NC protocols in two or three stages decreases the traffic significantly, beside the fact that the proposed protocols enable the system to retrieve the lost packets rather than asking for ARQ, resulting in improved data flow, and less power consumption. In fact, in some protocols the ARQ dropped from the rate 10ˉ1 to 10ˉ4, because of the proposed combining algorithm that enables the nodes to generate additional unique linear equations to broadcast rather than repeating the same ones via ARQ. Moreover, the number of the transmitted packets in each cooperative stage dropped from M (M - 1) to just M packets, resulting to 2 M packets instead 2 (M2 - 1) when three stages of transmission system are used instead of one stage (two cooperative stages).

Performance of Physical-Layer Network Coding in Asymmetric Two-Way Relay Channels

In this paper, we study the performance of physical-layer network coding in asymmetric two-way relay channels using four different cases having different poor channels:phase asymmetry, downlink asymmetry, uplink asymmetry and node asymmetry. The decision and mapping rule for symmetric and asymmetric cases are studied. The performance in terms of bit error rate for each case will be studied and analysed by computer simulation. Analytical and simulation results show that uplink asymmetry is the worst case;intra-phase asymmetry and unreliable uplink channels will more severely affect the performance degradation, which is caused by channel asymmetry.

Deep Belief Network for Lung Nodule Segmentation and Cancer Detection

Cancer disease is a deadliest disease cause more dangerous one.By identifying the disease through Artificial intelligence to getting the mage features directly from patients.This paper presents the lung knob division and disease characterization by proposing an enhancement calculation.Most of the machine learning techniques failed to observe the feature dimensions leads inaccuracy in feature selection and classification.This cause inaccuracy in sensitivity and specificity rate to reduce the identification accuracy.To resolve this problem,to propose a Chicken Sine Cosine Algorithm based Deep Belief Network to identify the disease factor.The general technique of the created approach includes four stages,such as pre-processing,segmentation,highlight extraction,and the order.From the outset,the Computerized Tomography(CT)image of the lung is taken care of to the division.When the division is done,the highlights are extricated through morphological factors for feature observation.By getting the features are analysed and the characterization is done dependent on the Deep Belief Network(DBN)which is prepared by utilizing the proposed Chicken-Sine Cosine Algorithm(CSCA)which distinguish the lung tumour,giving two classes in particular,knob or non-knob.The proposed system produce high performance as well compared to the other system.The presentation assessment of lung knob division and malignant growth grouping dependent on CSCA is figured utilizing three measurements to be specificity,precision,affectability,and the explicitness.

Incorporating Network Coding into TCP Grounded on Network Utility Maximization in Multi-Radio Multi-Channel Wireless Mesh Networks

A new approach, named TCP-I2NC, is proposed to improve the interaction between network coding and TCP and to maximize the network utility in interference-free multi-radio multi-channel wireless mesh networks. It is grounded on a Network Utility Maxmization (NUM) formulation which can be decomposed into a rate control problem and a packet scheduling problem. The solutions to these two problems perform resource allocation among different flows. Simulations demonstrate that TCP-I2NC results in a significant throughput gain and a small delay jitter. Network resource is fairly allocated via the solution to the NUM problem and the whole system also runs stably. Moreover, TCP-I2NC is compatible with traditional TCP variants.

On Latency Reductions in Vehicle-to-Vehicle Networks by Random Linear Network Coding

In the Internet of vehicles(IoV),direct communication between vehicles,i.e.,vehicle-tovehicle(V2V)may have lower latency,compared to the schemes with help of Road Side Unit(RSU)or base station.In this paper,the scenario where the demands of a vehicle are satisfied by cooperative transmissions from those one in front is considered.Since the topology of the vehicle network is dynamic,random linear network coding is applied in such a multisource single-sink vehicle-to-vehicle network,where each vehicle is assumed to broadcast messages to others so that the intermediate vehicles between sources and sink can reduce the latency collaboratively.It is shown that the coding scheme can significantly reduce the time delay compared with the non-coding scheme even in the channels with high packet loss rate.In order to further optimize the coding scheme,one can increase the generation size,where the generation size means the number of raw data packets sent by the source node to the sink node in each round of communication.Under the premise of satisfying the coding validity,we can dynamically select the Galois field size according to the number of intermediate nodes.It is not surprised that the reduction in the Galois field size can further reduce the transmission latency.

In-Network Puncturing for Delay-Efficient Rate Control of Distributed Video Coding in Wireless Video Sensor Networks

Wyner-Ziv Video Coding （WZVC） is considered as a promising video coding scheme for Wireless Video Sensor Networks （WVSNs） due to its high compression efficiency and error resilience functionalities, as well as its low encoding complex- ity. To achieve a good Rate-Distortion （R-D） per- formance, the current WZVC paradi^prls usually a- dopt an end-to-end rate control scheme in which the decoder repeatedly requests the additional deco- ding data from the encoder for decoding Wyner-Ziv frames. Therefore, the waiting time of the additional decoding data is especially long in multihop WVSNs. In this paper, we propose a novel pro- gressive in-network rate control scheme for WZVC. The proposed in-network puncturing-based rate control scheme transfers the partial channel codes puncturing task from the encoder to the relay nodes. Then, the decoder can request the addition- al decoding data from the relay nodes instead of the encoder, and the total waiting time for deco- ding Wyner-Ziv frames is reduced consequently. Simulation results validate the proposed rate con- trol scheme.

PERFORMANCE ANALYSIS OF USER FAIR-BASED RELAY ADAPTIVE POWER ALLOCATION IN PHYSICAL-LAYER NETWORK CODING COOPERATION

Network Coding (NC) is an effective technology to enhance the cooperative system spectral efficiency. However, since it is network-oriented, the existing performance metric of single-user outage can not comprehensively evaluate its gain and the impact to the entire network, which affect the user fairness. This paper proposes two novel user fair-based adaptive relay power allocation algorithms in single-relay NC cooperative multiple access channels. Firstly, common outage probability is employed as the performance metric, and to minimize it, a specific condition is deduced. On this basis, the instantaneous channel information-based adaptive relay power allocation scheme and the channel statistic information-based one with lower complexity are designed respectively, which make users' signals superimposed at accurately calculated proportion to maintain fairness. Simulation results show that compared with other existing schemes, the proposed schemes can best maintain user fairness, and effectively improve the common outage performance of the whole system, at the expense of small spectral efficiency.

An Encode-and CRT-Based Scalability Scheme for Optimizing Transmission in Blockchain

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%.

桃红四物汤对大脑中动脉闭塞大鼠lncRNA表达的影响

目的研究中药复方桃红四物汤(Tao Hong Si Wu decoction,THSWD)治疗大脑中动脉闭塞(middle cerebral artery occlusion,MCAO)大鼠长链非编码RNA(long non-coding RNA,lncRNA)的表达,并确定THSWD治疗MCAO大鼠可能的分子机制。方法从对照组、MCAO组和MCAO+THSWD组各获得3个大脑半球组织。采用RNA测序技术鉴定三组中的lncRNA基因表达。鉴定了THSWD调节的lncRNA基因,然后构建了THSWD调节的lncRNA-mRNA网络。通过MCODE插件鉴定lncRNA-mRNA网络的模块。基因本体(gene ontology,GO)和京都基因与基因组百科全书数据库(kyoto encyclopedia of genes and genomes,KEGG)用于分析富集的生物功能和信号通路。鉴定了THSWD调节的lncRNA的顺式和反式调控基因。采用逆转录实时定量聚合酶链式反应(RT-qPCR)验证lncRNA。分子对接用于验证lncRNA-mRNA网络靶点和通路相关蛋白结合能力。结果在MCAO大鼠中,THSWD共调节了302个lncRNA。生物信息学分析表明,一些核心lncRNA可能在THSWD治疗MCAO大鼠中发挥重要作用,此外,我们进一步发现THSWD可能也通过lncRNA-mRNA网络以及网络富集的补体和凝血级联反应等多通路治疗MCAO大鼠。分子对接结果表明,THSWD活性化合物没食子酸和苦杏仁苷与蛋白质靶点具有一定的结合能力。结论THSWD可以通过调节lncRNA保护MCAO大鼠脑损伤,为THSWD治疗缺血性中风提供了新见解。

A New Malicious Code Classification Method for the Security of Financial Software

The field of finance heavily relies on cybersecurity to safeguard its systems and clients from harmful software.The identification of malevolent code within financial software is vital for protecting both the financial system and individual clients.Nevertheless,present detection models encounter limitations in their ability to identify malevolent code and its variations,all while encompassing a multitude of parameters.To overcome these obsta-cles,we introduce a lean model for classifying families of malevolent code,formulated on Ghost-DenseNet-SE.This model integrates the Ghost module,DenseNet,and the squeeze-and-excitation(SE)channel domain attention mechanism.It substitutes the standard convolutional layer in DenseNet with the Ghost module,thereby diminishing the model’s size and augmenting recognition speed.Additionally,the channel domain attention mechanism assigns distinctive weights to feature channels,facilitating the extraction of pivotal characteristics of malevolent code and bolstering detection precision.Experimental outcomes on the Malimg dataset indicate that the model attained an accuracy of 99.14%in discerning families of malevolent code,surpassing AlexNet(97.8%)and The visual geometry group network(VGGNet)(96.16%).The proposed model exhibits reduced parameters,leading to decreased model complexity alongside enhanced classification accuracy,rendering it a valuable asset for categorizing malevolent code.

Network Coding.Based Interference Management Scheme in D2D Communications

In this paper,we propose an interference management scheme for device-to-device(D2D)communications in cellular networks.Considering the underlay D2D communications,the signal quality of cellular users would be affected by D2D users.To solve this problem,we explore the application of network coding and relay-assistance to mitigate interference.In the proposed scheme,helper nodes overhear the signal from cellular users,encode the received packets,and send the encoded packets to the base station.We design the helper node selection scheme and the transmission policy of helper nodes.The performance of the proposed scheme for different positions of the cellular user and D2D users is then evaluated.The results suggest that the cellular transmission scheme should be adjusted dynamically when underlay D2D communications are active.Compared with the existing solutions,the proposed scheme can effectively increase system throughput.

Performance analysis of amplify-and-forward cooperative diversity with multiple-antenna nodes via analog network coding

Network coding (NC), which works in the network layer, is an effective technology to improve the network throughput, by allowing the relay to encode the information from different users and ensuring the destination to retrieve the desired information. Employing network coding technique in a cooperative network can improve the network performance further. In this paper, we introduce analog network coding (ANC) to a simple two-user cooperative diversity network, which adopts amplify-and-forward (AF) mode and all nodes use multiple antennas. The impact of the number of antenna on the system achievable rate is investigated. And the bit error rate (BER) performances of the traditional relay cooperative network and the cooperative network based on analog network coding under different propagation conditions are discussed. The simulation results show that the performance of the traditional cooperative network has improved significantly due to the employ of network coding.

TWO-WAY DENOISE-AND-FORWARD NETWORK CODING OPPORTUNISTIC RELAYING AIMING AT MINIMIZING EUCLIDEAN DISTANCE IN MULTI-ACCESS PHASE

To exploit the effect of modulation schemes on the best relay selection,a novel Jointing Modulation schemes max-min criterion(JM-max-min) is proposed firstly for Two-Way De-Noise-and-Forward(DNF) Opportunistic Relaying systems(TW-DNF-OR) by aiming at minimizing the Pairwise Error Probability(PEP) of Multi-Access(MA) phase which dominates the error per-formance of TW-DNF-OR due to the presence of MA interference.The proposed JM-max-min criterion integrates perfectly the minimum distances of constellations and the relay links gains.Then,with the proposed JM-max-min criterion,we analyze the Symbol Error Probabilities(SEPs) of MA phase and BroadCast(BC) phase by using the approximated mathematics analysis,and present the corresponding closed-form expressions to SEPs.The numerical analysis shows,for a given modulations combination at both sources,the TW-DNF-OR systems with the proposed JM-max-min criterion outperform the one with the conventional max-min criterion.

Linear Network Coding Based Fast Data Synchronization for Wireless Ad Hoc Networks with Controlled Topology

Fast data synchronization in wireless ad hoc networks is a challenging and critical problem.It is fundamental for efficient information fusion,control and decision in distributed systems.Previously,distributed data synchronization was mainly studied in the latency-tolerant distributed databases,or assuming the general model of wireless ad hoc networks.In this paper,we propose a pair of linear network coding(NC)and all-to-all broadcast based fast data synchronization algorithms for wireless ad hoc networks whose topology is under operator’s control.We consider both data block selection and transmitting node selection for exploiting the benefits of NC.Instead of using the store-and-forward protocol as in the conventional uncoded approach,a compute-and-forward protocol is used in our scheme,which improves the transmission efficiency.The performance of the proposed algorithms is studied under different values of network size,network connection degree,and per-hop packet error rate.Simulation results demonstrate that our algorithms significantly reduce the times slots used for data synchronization compared with the baseline that does not use NC.