Forest fires are natural disasters that can occur suddenly and can be very damaging,burning thousands of square kilometers.Prevention is better than suppression and prediction models of forest fire occurrence have dev...Forest fires are natural disasters that can occur suddenly and can be very damaging,burning thousands of square kilometers.Prevention is better than suppression and prediction models of forest fire occurrence have developed from the logistic regression model,the geographical weighted logistic regression model,the Lasso regression model,the random forest model,and the support vector machine model based on historical forest fire data from 2000 to 2019 in Jilin Province.The models,along with a distribution map are presented in this paper to provide a theoretical basis for forest fire management in this area.Existing studies show that the prediction accuracies of the two machine learning models are higher than those of the three generalized linear regression models.The accuracies of the random forest model,the support vector machine model,geographical weighted logistic regression model,the Lasso regression model,and logistic model were 88.7%,87.7%,86.0%,85.0%and 84.6%,respectively.Weather is the main factor affecting forest fires,while the impacts of topography factors,human and social-economic factors on fire occurrence were similar.展开更多
Based on the Bayesian information criterion, this paper proposes the improved local linear prediction method to predict chaotic time series. This method uses spatial correlation and temporal correlation simultaneously...Based on the Bayesian information criterion, this paper proposes the improved local linear prediction method to predict chaotic time series. This method uses spatial correlation and temporal correlation simultaneously. Simulation results show that the improved local linear prediction method can effectively make multi-step and one-step prediction of chaotic time series and the multi-step prediction performance and one-step prediction accuracy of the improved local linear prediction method are superior to those of the traditional local linear prediction method.展开更多
In this paper, we propose an adaptive strategy based on the linear prediction of queue length to minimize congestion in Barabaisi-Albert （BA） scale-free networks. This strategy uses local knowledge of traffic condit...In this paper, we propose an adaptive strategy based on the linear prediction of queue length to minimize congestion in Barabaisi-Albert （BA） scale-free networks. This strategy uses local knowledge of traffic conditions and allows nodes to be able to self-coordinate their accepting probability to the incoming packets. We show that the strategy can delay remarkably the onset of congestion and systems avoiding the congestion can benefit from hierarchical organization of accepting rates of nodes. Furthermore, with the increase of prediction orders, we achieve larger values for the critical load together with a smooth transition from free-flow to congestion.展开更多
Recently,linear codes with a few weights have been extensively studied due to their applications in secret sharing schemes,constant composition codes,strongly regular graphs and so on.In this paper,based on the Weil s...Recently,linear codes with a few weights have been extensively studied due to their applications in secret sharing schemes,constant composition codes,strongly regular graphs and so on.In this paper,based on the Weil sums,several classes of two-weight or three-weight linear codes are presented by choosing a proper defining set,and their weight enumerators and complete weight enumerators are determined.Furthermore,these codes are proven to be minimal.By puncturing these linear codes,two classes of two-weight projective codes are obtained,and the parameters of the corresponding strongly regular graph are given.This paper generalizes the results of[7].展开更多
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.展开更多
The problem of blind adaptive equalization of underwater single-input multiple-output (SIMO) acoustic channels was analyzed by using the linear prediction method.Minimum mean square error (MMSE) blind equalizers with ...The problem of blind adaptive equalization of underwater single-input multiple-output (SIMO) acoustic channels was analyzed by using the linear prediction method.Minimum mean square error (MMSE) blind equalizers with arbitrary delay were described on a basis of channel identification.Two methods for calculating linear MMSE equalizers were proposed.One was based on full channel identification and realized using RLS adaptive algorithms,and the other was based on the zero-delay MMSE equalizer and realized using LMS and RLS adaptive algorithms,respectively.Performance of the three proposed algorithms and comparison with two existing zero-forcing (ZF) equalization algorithms were investigated by simulations utilizing two underwater acoustic channels.The results show that the proposed algorithms are robust enough to channel order mismatch.They have almost the same performance as the corresponding ZF algorithms under a high signal-to-noise (SNR) ratio and better performance under a low SNR.展开更多
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.展开更多
Abraham Lempel et al made a connection between linear codes and systems of bilinear forms over finite fields. In this correspondence, a new simple proof of a theorem in [1] is presented; in addition, the encoding proc...Abraham Lempel et al made a connection between linear codes and systems of bilinear forms over finite fields. In this correspondence, a new simple proof of a theorem in [1] is presented; in addition, the encoding process and the decoding procedure of RS codes are simplified via circulant matrices. Finally, the results show that the correspondence between bilinear forms and linear codes is not unique.展开更多
Let F_qbe afinite field with q=pmelements,where pis an odd prime and mis apositive integer.Here,let D_0={(x_1,x_2)∈F_q^2\{(0,0)}:Tr(x_1^(pk1+1)+x_2^(pk2+1))=c},where c∈F_q,Tr is the trace function fromFF_qtoFpand m/...Let F_qbe afinite field with q=pmelements,where pis an odd prime and mis apositive integer.Here,let D_0={(x_1,x_2)∈F_q^2\{(0,0)}:Tr(x_1^(pk1+1)+x_2^(pk2+1))=c},where c∈F_q,Tr is the trace function fromFF_qtoFpand m/(m,k_1)is odd,m/(m,k_2)is even.Define ap-ary linear code C_D =c(a_1,a_2):(a_1,a_2)∈F_q^2},where c(a_1,a_2)=(Tr(a_1x_1+a_2x_2))_((x1,x2)∈D).At most three-weight distributions of two classes of linear codes are settled.展开更多
A new architecture of space-time codes as a combination of orthogonal space-time block codes （OSTBC） and linear dispersion codes （LDC） is proposed in order to improve the bit error rate（BER） performance of OSTBC...A new architecture of space-time codes as a combination of orthogonal space-time block codes （OSTBC） and linear dispersion codes （LDC） is proposed in order to improve the bit error rate（BER） performance of OSTBC.The scheme proposed is named linear dispersion orthogonal space-time block codes （LDOSTBC）.In LDOSTBC scheme,firstly,the data is coded into LDC codewords.Then,the coded LDC substreams are coded into OSTBC codewords again.The decoding algorithm of LDOSTBC combines linear decoding of OSTBC and ML decoding or suboptimum detection algorithms of LDC.Compared with OSTBC scheme when the rate of LDC is MtR,the performance of LDOSTBC scheme can be improved without decreasing the data rate,where Mt is the number of transmit antennas and R is the spectral efficiency of the modulation constellation.If some rate penalty is allowed,when the rate of LDC is less than MtR the performance of LDOSTBC can be improved further.展开更多
Numerical simulations are presented about the effects of gas rarefaction on hypersonic flow field.Due to the extremely difficult experiment,limited wind-tunnel conditions and high cost,most problems in rarefied flow r...Numerical simulations are presented about the effects of gas rarefaction on hypersonic flow field.Due to the extremely difficult experiment,limited wind-tunnel conditions and high cost,most problems in rarefied flow regime are investigated through numerical methods,in which the direct simulation Monte-Carlo(DSMC)method is widely adopted.And the unstructured DSMC method is employed here.Flows around a vertical plate at a given velocity 7 500 m/s are simulated.For gas rarefaction is judged by the free-stream Knudsen number(Kn),two vital factors are considered:molecular number density and the plate′s length.Cases in which Kn varies from 0.035 to13.36 are simulated.Flow characters in the whole rarefied regime are described,and flow-field structure affected by Knis analyzed.Then,the dimensionless position D*of a certain velocity in the stagnation line is chosen as the marker of flow field to measure its variation.Through flow-field tracing and least-square numerical method analyzing,it is proved that hypersonic rarefied flow field expands outward linearly with the increase of 1/2Kn.An empirical method is proposed,which can be used for the prediction of the hypersonic flow-field structure at a given inflow velocity,especially the shock wave position.展开更多
基金This research was funded by the National Natural Science Foundation of China(grant no.32271881).
文摘Forest fires are natural disasters that can occur suddenly and can be very damaging,burning thousands of square kilometers.Prevention is better than suppression and prediction models of forest fire occurrence have developed from the logistic regression model,the geographical weighted logistic regression model,the Lasso regression model,the random forest model,and the support vector machine model based on historical forest fire data from 2000 to 2019 in Jilin Province.The models,along with a distribution map are presented in this paper to provide a theoretical basis for forest fire management in this area.Existing studies show that the prediction accuracies of the two machine learning models are higher than those of the three generalized linear regression models.The accuracies of the random forest model,the support vector machine model,geographical weighted logistic regression model,the Lasso regression model,and logistic model were 88.7%,87.7%,86.0%,85.0%and 84.6%,respectively.Weather is the main factor affecting forest fires,while the impacts of topography factors,human and social-economic factors on fire occurrence were similar.
文摘Based on the Bayesian information criterion, this paper proposes the improved local linear prediction method to predict chaotic time series. This method uses spatial correlation and temporal correlation simultaneously. Simulation results show that the improved local linear prediction method can effectively make multi-step and one-step prediction of chaotic time series and the multi-step prediction performance and one-step prediction accuracy of the improved local linear prediction method are superior to those of the traditional local linear prediction method.
基金Project supported by the National Natural Science Foundation of China (Grant No. 60672095)the Fundamental Research Funds for the Central Universities of China (Grant No. KYZ201300)+1 种基金the Natural Science Foundation of Jiangsu Province, China (Grant No. BK2013000)the Youth Sci-Tech Innovation Fund of Nanjing Agricultural University, China (Grant No. KJ2010024)
文摘In this paper, we propose an adaptive strategy based on the linear prediction of queue length to minimize congestion in Barabaisi-Albert （BA） scale-free networks. This strategy uses local knowledge of traffic conditions and allows nodes to be able to self-coordinate their accepting probability to the incoming packets. We show that the strategy can delay remarkably the onset of congestion and systems avoiding the congestion can benefit from hierarchical organization of accepting rates of nodes. Furthermore, with the increase of prediction orders, we achieve larger values for the critical load together with a smooth transition from free-flow to congestion.
基金supported by the Natural Science Foundation of China (No.11901062)the Sichuan Natural Science Foundation (No.2024NSFSC0417)。
文摘Recently,linear codes with a few weights have been extensively studied due to their applications in secret sharing schemes,constant composition codes,strongly regular graphs and so on.In this paper,based on the Weil sums,several classes of two-weight or three-weight linear codes are presented by choosing a proper defining set,and their weight enumerators and complete weight enumerators are determined.Furthermore,these codes are proven to be minimal.By puncturing these linear codes,two classes of two-weight projective codes are obtained,and the parameters of the corresponding strongly regular graph are given.This paper generalizes the results of[7].
基金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.
基金Supported by the National Natural Science Foundation of China under Grant No.60372086the Foundation for the Author of National Excellent Doctoral Dissertation of China under Grant No.200753
文摘The problem of blind adaptive equalization of underwater single-input multiple-output (SIMO) acoustic channels was analyzed by using the linear prediction method.Minimum mean square error (MMSE) blind equalizers with arbitrary delay were described on a basis of channel identification.Two methods for calculating linear MMSE equalizers were proposed.One was based on full channel identification and realized using RLS adaptive algorithms,and the other was based on the zero-delay MMSE equalizer and realized using LMS and RLS adaptive algorithms,respectively.Performance of the three proposed algorithms and comparison with two existing zero-forcing (ZF) equalization algorithms were investigated by simulations utilizing two underwater acoustic channels.The results show that the proposed algorithms are robust enough to channel order mismatch.They have almost the same performance as the corresponding ZF algorithms under a high signal-to-noise (SNR) ratio and better performance under a low SNR.
基金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.
基金She was with the Department of Mathematics in Wuhan University while writting this paper.
文摘Abraham Lempel et al made a connection between linear codes and systems of bilinear forms over finite fields. In this correspondence, a new simple proof of a theorem in [1] is presented; in addition, the encoding process and the decoding procedure of RS codes are simplified via circulant matrices. Finally, the results show that the correspondence between bilinear forms and linear codes is not unique.
文摘Let F_qbe afinite field with q=pmelements,where pis an odd prime and mis apositive integer.Here,let D_0={(x_1,x_2)∈F_q^2\{(0,0)}:Tr(x_1^(pk1+1)+x_2^(pk2+1))=c},where c∈F_q,Tr is the trace function fromFF_qtoFpand m/(m,k_1)is odd,m/(m,k_2)is even.Define ap-ary linear code C_D =c(a_1,a_2):(a_1,a_2)∈F_q^2},where c(a_1,a_2)=(Tr(a_1x_1+a_2x_2))_((x1,x2)∈D).At most three-weight distributions of two classes of linear codes are settled.
基金Sponsored by the "111" Project of China (B08038)Important National Science & Technology Specific Projects (2009ZX03003-003+2 种基金2009ZX03003-004) the NSFC-Guangdong (U0635003)Program for Changjiang Scholars and Innovative Research Team in University(IRT0852)
文摘A new architecture of space-time codes as a combination of orthogonal space-time block codes （OSTBC） and linear dispersion codes （LDC） is proposed in order to improve the bit error rate（BER） performance of OSTBC.The scheme proposed is named linear dispersion orthogonal space-time block codes （LDOSTBC）.In LDOSTBC scheme,firstly,the data is coded into LDC codewords.Then,the coded LDC substreams are coded into OSTBC codewords again.The decoding algorithm of LDOSTBC combines linear decoding of OSTBC and ML decoding or suboptimum detection algorithms of LDC.Compared with OSTBC scheme when the rate of LDC is MtR,the performance of LDOSTBC scheme can be improved without decreasing the data rate,where Mt is the number of transmit antennas and R is the spectral efficiency of the modulation constellation.If some rate penalty is allowed,when the rate of LDC is less than MtR the performance of LDOSTBC can be improved further.
文摘Numerical simulations are presented about the effects of gas rarefaction on hypersonic flow field.Due to the extremely difficult experiment,limited wind-tunnel conditions and high cost,most problems in rarefied flow regime are investigated through numerical methods,in which the direct simulation Monte-Carlo(DSMC)method is widely adopted.And the unstructured DSMC method is employed here.Flows around a vertical plate at a given velocity 7 500 m/s are simulated.For gas rarefaction is judged by the free-stream Knudsen number(Kn),two vital factors are considered:molecular number density and the plate′s length.Cases in which Kn varies from 0.035 to13.36 are simulated.Flow characters in the whole rarefied regime are described,and flow-field structure affected by Knis analyzed.Then,the dimensionless position D*of a certain velocity in the stagnation line is chosen as the marker of flow field to measure its variation.Through flow-field tracing and least-square numerical method analyzing,it is proved that hypersonic rarefied flow field expands outward linearly with the increase of 1/2Kn.An empirical method is proposed,which can be used for the prediction of the hypersonic flow-field structure at a given inflow velocity,especially the shock wave position.
