In mobile computing environments, most IoT devices connected to networks experience variable error rates and possess limited bandwidth. The conventional method of retransmitting lost information during transmission, c...In mobile computing environments, most IoT devices connected to networks experience variable error rates and possess limited bandwidth. The conventional method of retransmitting lost information during transmission, commonly used in data transmission protocols, increases transmission delay and consumes excessive bandwidth. To overcome this issue, forward error correction techniques, e.g., Random Linear Network Coding(RLNC) can be used in data transmission. The primary challenge in RLNC-based methodologies is sustaining a consistent coding ratio during data transmission, leading to notable bandwidth usage and transmission delay in dynamic network conditions. Therefore, this study proposes a new block-based RLNC strategy known as Adjustable RLNC(ARLNC), which dynamically adjusts the coding ratio and transmission window during runtime based on the estimated network error rate calculated via receiver feedback. The calculations in this approach are performed using a Galois field with the order of 256. Furthermore, we assessed ARLNC's performance by subjecting it to various error models such as Gilbert Elliott, exponential, and constant rates and compared it with the standard RLNC. The results show that dynamically adjusting the coding ratio and transmission window size based on network conditions significantly enhances network throughput and reduces total transmission delay in most scenarios. In contrast to the conventional RLNC method employing a fixed coding ratio, the presented approach has demonstrated significant enhancements, resulting in a 73% decrease in transmission delay and a 4 times augmentation in throughput. However, in dynamic computational environments, ARLNC generally incurs higher computational costs than the standard RLNC but excels in high-performance networks.展开更多
In this papert we give an approach for detecting one or more outliers inrandomized linear model.The likelihood ratio test statistic and its distributions underthe null hypothesis and the alternative hypothesis are giv...In this papert we give an approach for detecting one or more outliers inrandomized linear model.The likelihood ratio test statistic and its distributions underthe null hypothesis and the alternative hypothesis are given. Furthermore,the robustnessof the test statistic in a certain sense is proved. Finally,the optimality properties of thetest are derived.展开更多
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 scenar...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.展开更多
Combinatorial networks are widely applied in many practical scenarios. In this paper, we compute the closed-form probability expressions of successful decoding at a sink and at all sinks in the multicast scenario, in ...Combinatorial networks are widely applied in many practical scenarios. In this paper, we compute the closed-form probability expressions of successful decoding at a sink and at all sinks in the multicast scenario, in which one source sends messages to k destinations through m relays using random linear network coding over a Galois field. The formulation at a （all） sink（s） represents the impact of major parameters, i.e., the size of field, the number of relays （and sinks） and provides theoretical groundings to numerical results in the literature. Such condition maps to the receivers＇ capability to decode the original information and its mathematical characterization is helpful to design the coding. In addition, numerical results show that, under a fixed exact decoding probability, the required field size can be minimized.展开更多
Network processing in the current Internet is at the entirety of the data packet,which is problematic when encountering network congestion.The newly proposed Internet service named Qualitative Communication changes th...Network processing in the current Internet is at the entirety of the data packet,which is problematic when encountering network congestion.The newly proposed Internet service named Qualitative Communication changes the network processing paradigm to an even finer granularity,namely chunk level,which obsoletes many existing networking policies and schemes,especially the caching algorithms and cache replacement policies that have been extensively explored in Web Caching,Content Delivery Networks(CDN)or Information-Centric Networks(ICN).This paper outlines all the new factors that are brought by random linear network coding-based Qualitative Communication and proves the importance and necessity of considering them.A novel metric is proposed by taking these new factors into consideration.An optimization problem is formulated to maximize the metric value of all retained chunks in the local storage of network nodes under the constraint of storage limit.A cache replacement scheme that obtains the optimal result in a recursive manner is proposed correspondingly.With the help of the introduced intelligent cache replacement algorithm,the performance evaluations show remarkably reduced end-to-end latency compared to the existing schemes in various network scenarios.展开更多
The main aim of this paper was to calculate soil organic carbon stock(SOCS) with consideration of the pedogenetic horizons using expert knowledge and GIS-based methods in northeastern China.A novel prediction process ...The main aim of this paper was to calculate soil organic carbon stock(SOCS) with consideration of the pedogenetic horizons using expert knowledge and GIS-based methods in northeastern China.A novel prediction process was presented and was referred to as model-then-calculate with respect to the variable thicknesses of soil horizons(MCV).The model-then-calculate with fixed-thickness(MCF),soil profile statistics(SPS),pedological professional knowledge-based(PKB) and vegetation type-based(Veg) methods were carried out for comparison.With respect to the similar pedological information,nine common layers from topsoil to bedrock were grouped in the MCV.Validation results suggested that the MCV method generated better performance than the other methods considered.For the comparison of polygon based approaches,the Veg method generated better accuracy than both SPS and PKB,as limited soil data were incorporated.Additional prediction of the pedogenetic horizons within MCV benefitted the regional SOCS estimation and provided information for future soil classification and understanding of soil functions.The intermediate product,that is,horizon thickness maps were fluctuant enough and reflected many details in space.The linear mixed model indicated that mean annual air temperature(MAAT) was the most important predictor for the SOCS simulation.The minimal residual of the linear mixed models was achieved in the vegetation type-based model,whereas the maximal residual was fitted in the soil type-based model.About 95% of SOCS could be found in Argosols,Cambosols and Isohumosols.The largest SOCS was found in the croplands with vegetation of Triticum aestivum L.,Sorghum bicolor(L.) Moench,Glycine max(L.) Merr.,Zea mays L.and Setaria italica(L.) P.Beauv.展开更多
A stability problem of the linear networked control systems(NCSs) with multisensor having differen data missing rates is investigated in this paper.Each sensor of the multiple sensor-controller communication channels ...A stability problem of the linear networked control systems(NCSs) with multisensor having differen data missing rates is investigated in this paper.Each sensor of the multiple sensor-controller communication channels is assumed to have an individual stochastic data missing rate.The stochastic data missing is described by a Bernoulli binary distribution.Sufficient conditions are given for the closed-loop linear NCS which is exponentially stable in the mean square sense as the existence of random multiple data missing.The stability problem could b disposed by the MATLAB linear matrix inequality(LMI) tool easily.A simulation case is provided to illustrat the validity of the presented LMI approach.展开更多
In this paper, we first study the mean ergodicity of random linear operators using some techniques of measure theory and L;-convex analysis. Then, based on this, we give a characterization for a complete random normed...In this paper, we first study the mean ergodicity of random linear operators using some techniques of measure theory and L;-convex analysis. Then, based on this, we give a characterization for a complete random normed module to be mean ergodic.展开更多
We first prove various kinds of expressions for modulus of random convexity by using an L^0（F, R）-valued function＇s intermediate value theorem and the well known Hahn-Banach theorem for almost surely bounded random...We first prove various kinds of expressions for modulus of random convexity by using an L^0（F, R）-valued function＇s intermediate value theorem and the well known Hahn-Banach theorem for almost surely bounded random linear functionals, then establish some basic properties including continuity for modulus of random convexity. In particular, we express the modulus of random convexity of a special random normed module L^0（F, X） derived from a normed space X by the classical modulus of convexity of X.展开更多
Let Y={Y_n;n∈N^2} be a stationary linear random field generated by a two- dimensional martingale difference. Where N^2 denotes the two dimensional integer lattice. The main purpose of this paper is to obtain the LIL ...Let Y={Y_n;n∈N^2} be a stationary linear random field generated by a two- dimensional martingale difference. Where N^2 denotes the two dimensional integer lattice. The main purpose of this paper is to obtain the LIL convergence for the partial-sums of Y.展开更多
In this paper, the ocean acoustic channel is considered as a time-variant channel. In order to analyse the conjoint time-shift - frequency-delay distribution or the fading and spread statistical characteristics of the...In this paper, the ocean acoustic channel is considered as a time-variant channel. In order to analyse the conjoint time-shift - frequency-delay distribution or the fading and spread statistical characteristics of the channel. The TDWVS (Two Dimensional Wigner-Ville Spectrum) of the time - variant channel is defined. The relation between the WVS (Wigner-Ville Spectrum) of the input and the output of the channel is discussed and some examples for the specific channel are shown. Finally, the applications on the detection of signals in noise using the WVS and TDWVS are given and the advantage is obvious, when the detected signal is linear frequency-modulation signal.展开更多
In this paper, we have constructed a random weighting statistic to approximate the distribution of studentized least square estimator in a linear regression model with ideal accuracy o(n<sup>-1/2</sup>). T...In this paper, we have constructed a random weighting statistic to approximate the distribution of studentized least square estimator in a linear regression model with ideal accuracy o(n<sup>-1/2</sup>). Thus, we have provided a more practical distribution approximating method.展开更多
Semiparametric transformation models provide a class of flexible models for regression analysis of failure time data. Several authors have discussed them under different situations when covariates are time- independe...Semiparametric transformation models provide a class of flexible models for regression analysis of failure time data. Several authors have discussed them under different situations when covariates are time- independent （Chen et al., 2002; Cheng et al., 1995; Fine et al., 1998）. In this paper, we consider fitting these models to right-censored data when covariates are time-dependent longitudinal variables and, furthermore, may suffer measurement errors. For estimation, we investigate the maximum likelihood approach, and an EM algorithm is developed. Simulation results show that the proposed method is appropriate for practical application, and an illustrative example is provided.展开更多
Internet of Things(IoT)based sensor network is largely utilized in various field for transmitting huge amount of data due to their ease and cheaper installation.While performing this entire process,there is a high pos...Internet of Things(IoT)based sensor network is largely utilized in various field for transmitting huge amount of data due to their ease and cheaper installation.While performing this entire process,there is a high possibility for data corruption in the mid of transmission.On the other hand,the network performance is also affected due to various attacks.To address these issues,an efficient algorithm that jointly offers improved data storage and reliable routing is proposed.Initially,after the deployment of sensor nodes,the election of the storage node is achieved based on a fuzzy expert system.Improved Random Linear Network Coding(IRLNC)is used to create an encoded packet.This encoded packet from the source and neighboring nodes is transmitted to the storage node.Finally,to transmit the encoded packet from the storage node to the destination shortest path is found using the Destination Sequenced Distance Vector(DSDV)algorithm.Experimental analysis of the proposed work is carried out by evaluating some of the statistical metrics.Average residual energy,packet delivery ratio,compression ratio and storage time achieved for the proposed work are 8.8%,0.92%,0.82%,and 69 s.Based on this analysis,it is revealed that better data storage system and system reliability is attained using this proposed work.展开更多
In view of the fact that the quantum computer attack is not considered in the cloud storage environment,this paper selects the code-based public key encryption scheme as the security protection measure in the cloud st...In view of the fact that the quantum computer attack is not considered in the cloud storage environment,this paper selects the code-based public key encryption scheme as the security protection measure in the cloud storage.Based on random linear code encryption scheme,it employs the structure of the RLCE scheme and Polar code polarization properties,using the Polar code as underlying encoding scheme,through the method of RLCEspad,putting forward a kind of improved public key encryption scheme which considers semantic security and is resistant to adaptively chosen ciphertext attacks.The improved scheme is applied to cloud storage to ensure that the storage environment will not be attacked by quantum computer while ensuring the confidentiality,availability and reliability.展开更多
文摘In mobile computing environments, most IoT devices connected to networks experience variable error rates and possess limited bandwidth. The conventional method of retransmitting lost information during transmission, commonly used in data transmission protocols, increases transmission delay and consumes excessive bandwidth. To overcome this issue, forward error correction techniques, e.g., Random Linear Network Coding(RLNC) can be used in data transmission. The primary challenge in RLNC-based methodologies is sustaining a consistent coding ratio during data transmission, leading to notable bandwidth usage and transmission delay in dynamic network conditions. Therefore, this study proposes a new block-based RLNC strategy known as Adjustable RLNC(ARLNC), which dynamically adjusts the coding ratio and transmission window during runtime based on the estimated network error rate calculated via receiver feedback. The calculations in this approach are performed using a Galois field with the order of 256. Furthermore, we assessed ARLNC's performance by subjecting it to various error models such as Gilbert Elliott, exponential, and constant rates and compared it with the standard RLNC. The results show that dynamically adjusting the coding ratio and transmission window size based on network conditions significantly enhances network throughput and reduces total transmission delay in most scenarios. In contrast to the conventional RLNC method employing a fixed coding ratio, the presented approach has demonstrated significant enhancements, resulting in a 73% decrease in transmission delay and a 4 times augmentation in throughput. However, in dynamic computational environments, ARLNC generally incurs higher computational costs than the standard RLNC but excels in high-performance networks.
文摘In this papert we give an approach for detecting one or more outliers inrandomized linear model.The likelihood ratio test statistic and its distributions underthe null hypothesis and the alternative hypothesis are given. Furthermore,the robustnessof the test statistic in a certain sense is proved. Finally,the optimality properties of thetest are derived.
基金This work was supported in part by the Guangdong Basic and Applied Basic Research Foundation under Key Project 2019B1515120032in part by the National Science Foundation of China(NSFC)with grant no.61901534+3 种基金in part by the Science,Technology and Innovation Commission of Shenzhen Municipality with grant no.JCYJ20190807155617099in part by the University Basic Research Fund 20lgpy43in part by the Guangdong Natural Science Foundation of Grant No.2019A1515011622the Foundation of Grant No.2019-JCJQ-JJ-411.
文摘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.
基金Supported by the National Natural Science Foundation of China(61271174,61301178)the Science and Technology Innovation Foundation of Xi’an(CXY1352WL28)
文摘Combinatorial networks are widely applied in many practical scenarios. In this paper, we compute the closed-form probability expressions of successful decoding at a sink and at all sinks in the multicast scenario, in which one source sends messages to k destinations through m relays using random linear network coding over a Galois field. The formulation at a （all） sink（s） represents the impact of major parameters, i.e., the size of field, the number of relays （and sinks） and provides theoretical groundings to numerical results in the literature. Such condition maps to the receivers＇ capability to decode the original information and its mathematical characterization is helpful to design the coding. In addition, numerical results show that, under a fixed exact decoding probability, the required field size can be minimized.
文摘Network processing in the current Internet is at the entirety of the data packet,which is problematic when encountering network congestion.The newly proposed Internet service named Qualitative Communication changes the network processing paradigm to an even finer granularity,namely chunk level,which obsoletes many existing networking policies and schemes,especially the caching algorithms and cache replacement policies that have been extensively explored in Web Caching,Content Delivery Networks(CDN)or Information-Centric Networks(ICN).This paper outlines all the new factors that are brought by random linear network coding-based Qualitative Communication and proves the importance and necessity of considering them.A novel metric is proposed by taking these new factors into consideration.An optimization problem is formulated to maximize the metric value of all retained chunks in the local storage of network nodes under the constraint of storage limit.A cache replacement scheme that obtains the optimal result in a recursive manner is proposed correspondingly.With the help of the introduced intelligent cache replacement algorithm,the performance evaluations show remarkably reduced end-to-end latency compared to the existing schemes in various network scenarios.
基金Under the auspices of Basic Project of State Commission of Science Technology of China(No.2008FY110600)National Natural Science Foundation of China(No.91325301,41401237,41571212,41371224)Field Frontier Program of Institute of Soil Science,Chinese Academy of Sciences(No.ISSASIP1624)
文摘The main aim of this paper was to calculate soil organic carbon stock(SOCS) with consideration of the pedogenetic horizons using expert knowledge and GIS-based methods in northeastern China.A novel prediction process was presented and was referred to as model-then-calculate with respect to the variable thicknesses of soil horizons(MCV).The model-then-calculate with fixed-thickness(MCF),soil profile statistics(SPS),pedological professional knowledge-based(PKB) and vegetation type-based(Veg) methods were carried out for comparison.With respect to the similar pedological information,nine common layers from topsoil to bedrock were grouped in the MCV.Validation results suggested that the MCV method generated better performance than the other methods considered.For the comparison of polygon based approaches,the Veg method generated better accuracy than both SPS and PKB,as limited soil data were incorporated.Additional prediction of the pedogenetic horizons within MCV benefitted the regional SOCS estimation and provided information for future soil classification and understanding of soil functions.The intermediate product,that is,horizon thickness maps were fluctuant enough and reflected many details in space.The linear mixed model indicated that mean annual air temperature(MAAT) was the most important predictor for the SOCS simulation.The minimal residual of the linear mixed models was achieved in the vegetation type-based model,whereas the maximal residual was fitted in the soil type-based model.About 95% of SOCS could be found in Argosols,Cambosols and Isohumosols.The largest SOCS was found in the croplands with vegetation of Triticum aestivum L.,Sorghum bicolor(L.) Moench,Glycine max(L.) Merr.,Zea mays L.and Setaria italica(L.) P.Beauv.
基金the National Natural Science Foundation of China(No.U1204515)the Foundation of Young Teachers in Colleges and Universities of Shanghai(No.ZZSDJ12002)the Shanghai Municipal Natural Science Foundation(No.14ZR1417200)
文摘A stability problem of the linear networked control systems(NCSs) with multisensor having differen data missing rates is investigated in this paper.Each sensor of the multiple sensor-controller communication channels is assumed to have an individual stochastic data missing rate.The stochastic data missing is described by a Bernoulli binary distribution.Sufficient conditions are given for the closed-loop linear NCS which is exponentially stable in the mean square sense as the existence of random multiple data missing.The stability problem could b disposed by the MATLAB linear matrix inequality(LMI) tool easily.A simulation case is provided to illustrat the validity of the presented LMI approach.
基金Supported by the National Natural Science Foundation of China(Grant Nos.11301380,11401399 and 11301568)the Higher School Science and Technology Development Fund Project in Tianjin(Grant No.20131003)
文摘In this paper, we first study the mean ergodicity of random linear operators using some techniques of measure theory and L;-convex analysis. Then, based on this, we give a characterization for a complete random normed module to be mean ergodic.
基金Supported by National Natural Science Foundation of China(Grant No.11171015)Science Foundation of Chongqing Education Board(Grant No.KJ120732)
文摘We first prove various kinds of expressions for modulus of random convexity by using an L^0（F, R）-valued function＇s intermediate value theorem and the well known Hahn-Banach theorem for almost surely bounded random linear functionals, then establish some basic properties including continuity for modulus of random convexity. In particular, we express the modulus of random convexity of a special random normed module L^0（F, X） derived from a normed space X by the classical modulus of convexity of X.
文摘Let Y={Y_n;n∈N^2} be a stationary linear random field generated by a two- dimensional martingale difference. Where N^2 denotes the two dimensional integer lattice. The main purpose of this paper is to obtain the LIL convergence for the partial-sums of Y.
文摘In this paper, the ocean acoustic channel is considered as a time-variant channel. In order to analyse the conjoint time-shift - frequency-delay distribution or the fading and spread statistical characteristics of the channel. The TDWVS (Two Dimensional Wigner-Ville Spectrum) of the time - variant channel is defined. The relation between the WVS (Wigner-Ville Spectrum) of the input and the output of the channel is discussed and some examples for the specific channel are shown. Finally, the applications on the detection of signals in noise using the WVS and TDWVS are given and the advantage is obvious, when the detected signal is linear frequency-modulation signal.
基金Supported by the Doctoral Program Foundation of the Institute of Higher Educationthe National Natural Science Foundation of China.
文摘In this paper, we have constructed a random weighting statistic to approximate the distribution of studentized least square estimator in a linear regression model with ideal accuracy o(n<sup>-1/2</sup>). Thus, we have provided a more practical distribution approximating method.
文摘Semiparametric transformation models provide a class of flexible models for regression analysis of failure time data. Several authors have discussed them under different situations when covariates are time- independent （Chen et al., 2002; Cheng et al., 1995; Fine et al., 1998）. In this paper, we consider fitting these models to right-censored data when covariates are time-dependent longitudinal variables and, furthermore, may suffer measurement errors. For estimation, we investigate the maximum likelihood approach, and an EM algorithm is developed. Simulation results show that the proposed method is appropriate for practical application, and an illustrative example is provided.
文摘Internet of Things(IoT)based sensor network is largely utilized in various field for transmitting huge amount of data due to their ease and cheaper installation.While performing this entire process,there is a high possibility for data corruption in the mid of transmission.On the other hand,the network performance is also affected due to various attacks.To address these issues,an efficient algorithm that jointly offers improved data storage and reliable routing is proposed.Initially,after the deployment of sensor nodes,the election of the storage node is achieved based on a fuzzy expert system.Improved Random Linear Network Coding(IRLNC)is used to create an encoded packet.This encoded packet from the source and neighboring nodes is transmitted to the storage node.Finally,to transmit the encoded packet from the storage node to the destination shortest path is found using the Destination Sequenced Distance Vector(DSDV)algorithm.Experimental analysis of the proposed work is carried out by evaluating some of the statistical metrics.Average residual energy,packet delivery ratio,compression ratio and storage time achieved for the proposed work are 8.8%,0.92%,0.82%,and 69 s.Based on this analysis,it is revealed that better data storage system and system reliability is attained using this proposed work.
基金the National Natural Science Foundation of China(No.61572521)The Scientific Foundation of the Scientific Research and Innovation Team of Engineering University of PAP(No.KYTD201805).
文摘In view of the fact that the quantum computer attack is not considered in the cloud storage environment,this paper selects the code-based public key encryption scheme as the security protection measure in the cloud storage.Based on random linear code encryption scheme,it employs the structure of the RLCE scheme and Polar code polarization properties,using the Polar code as underlying encoding scheme,through the method of RLCEspad,putting forward a kind of improved public key encryption scheme which considers semantic security and is resistant to adaptively chosen ciphertext attacks.The improved scheme is applied to cloud storage to ensure that the storage environment will not be attacked by quantum computer while ensuring the confidentiality,availability and reliability.
