This study proposes a novel multi-fractal spectrumbasedapproach to distinguish linear block codes from its selfsynchronousscrambled codes. Given that the linear block codeand self-synchronous scrambled linear block co...This study proposes a novel multi-fractal spectrumbasedapproach to distinguish linear block codes from its selfsynchronousscrambled codes. Given that the linear block codeand self-synchronous scrambled linear block code share the propertyof linear correlation, the existing linear correlation-basedidentification method is invalid for this case. This drawback can becircumvented by introducing a novel multi-fractal spectrum-basedmethod. Simulation results show that the new method has highrobustness and under the same conditions of bit error, the lowerthe code rate, the higher the recognition rate. Thus, the methodhas significant potential for future application in engineering.展开更多
The optimal and suboptimal structured algorithms of linear block codes from the geometrical perspective are represented.The minimum distance and weight property lemmas and the theorem are proved for the generator matr...The optimal and suboptimal structured algorithms of linear block codes from the geometrical perspective are represented.The minimum distance and weight property lemmas and the theorem are proved for the generator matrix.Based upon the property of generator matrix,the structured algorithms of linear block codes are demonstrated.Since the complexity of optimal structured algorithm is very high,the binary linear block codes is searched by using the suboptimal structured algorithm.The comparison with Bose-Chaudhuri-Hocquenqhem（BCH） codes shows that the searched linear block codes are equivalent on minimum distance and can be designed for more block lengths.Because the linear block codes are used widely in communication systems and digital applications,the optimal and suboptimal structured algorithms must have great future being widely used in many applications and perspectives.展开更多
Genetic algorithms offer very good performances for solving large optimization problems, especially in the domain of error-correcting codes. However, they have a major drawback related to the time complexity and memor...Genetic algorithms offer very good performances for solving large optimization problems, especially in the domain of error-correcting codes. However, they have a major drawback related to the time complexity and memory occupation when running on a uniprocessor computer. This paper proposes a parallel decoder for linear block codes, using parallel genetic algorithms (PGA). The good performance and time complexity are confirmed by theoretical study and by simulations on BCH(63,30,14) codes over both AWGN and flat Rayleigh fading channels. The simulation results show that the coding gain between parallel and single genetic algorithm is about 0.7 dB at BER = 10﹣5 with only 4 processors.展开更多
In order to promote development of linear/branched block polyethylenes based on new catalytic systems,we synthesized a novel a.dimine nickel(Ⅱ)complex with isopropyl substituents on ortho-N-aryl and hydroxymethyl phe...In order to promote development of linear/branched block polyethylenes based on new catalytic systems,we synthesized a novel a.dimine nickel(Ⅱ)complex with isopropyl substituents on ortho-N-aryl and hydroxymethyl phenyl substituents on para-Naryl structures.The activity of a-dimine nickl(Ⅱ)catalyst was 3.02x10^(6)g-mol_(ni)^(-1)·h^(-1) at 70℃,and resultant polyethylene possessed 135/1000C branches.The linear/branched block polyethylenes were synthesized from ethylene polymerization catalyzed by the a-dimine nicke(Ⅱ)complex/bis(phenoxy-imine)zirconium in the presence of diethyI zinc.With the addition of ZnEtz(from 0 to 400),the melting peak of resultant polyethylene changed from a single melting peak to bimodal melting peaks.The molecular weights of resultant polyethylene ranging from 26.8 kg/mol to 17.1 kg/mol and PDI values varying gradually from 24.4 to 15.2 were obtained vla adjusting ZnEt;equiv.and molar ratio of two catalysts.In addition,the branching degree of the polyethylene increased from 13/1000C to 56/1000 with the increase of the proportion of a dimine nickel(Ⅱ)catalyst.Using this binary catalyst system,the reaction temperature of chain shutting polymerization can be carried out at 70℃,which is more conducive to industrial application.展开更多
Therrno-responsive block copolymers poly（ethylene glycol）-block-poly（N-acryloyl-2,2-dimethyl-1,3-oxazolidine）, PEG-b-PADMO, based on linear PEG were prepared via a versatile reversible addition-fragmentation chain...Therrno-responsive block copolymers poly（ethylene glycol）-block-poly（N-acryloyl-2,2-dimethyl-1,3-oxazolidine）, PEG-b-PADMO, based on linear PEG were prepared via a versatile reversible addition-fragmentation chain transfer （RAFT） polymerization, PEG22 （Mw = 1000） was used as the hydrophilic component, whose dehydration was the main driving force for the phase transition of these copolymers, as demonstrated by the tH-NMR spectra. Their lower critical solution temperatures （LCSTs） could be tuned in the range of 20℃ to 35℃, by adjusting the degree of polymerization （DP） of PADMO between 14-27. Furthermore, a sharp phase transition at ca. 33℃, close to the physiological temperature with minimal hysteresis, was observed for the PEGzz-b-PADMO14 copolymer. Moreover, excellent reversibility and reproducibility were displayed for the same copolymer over 10 cycles of repeated temperature change between 25℃ （below the LCST） and 40℃ （above the LCST）.展开更多
Iterative methods that take advantage of efficient block operations and block communications are popular research topics in parallel computation. These methods are especially important on Massively Parallel Processors...Iterative methods that take advantage of efficient block operations and block communications are popular research topics in parallel computation. These methods are especially important on Massively Parallel Processors (MPP). This paper presents a block variant of the GMRES method for solving general unsymmetric linear systems. It is shown that the new algorithm with block size s, denoted by BVGMRES(s,m), is theoretically equivalent to the GMRES(s. m) method. The numerical results show that this algorithm can be more efficient than the standard GMRES method on a cache based single CPU computer with optimized BLAS kernels. Furthermore, the gain in efficiency is more significant on MPPs due to both efficient block operations and efficient block data communications. Our numerical results also show that in comparison to the standard GMRES method, the more PEs that are used on an MPP, the more efficient the BVGMRES(s,m) algorithm is.展开更多
The symmetric linear system gives us many simplifications and a possibility to adapt the computations to the computer at hand in order to achieve better performance. The aim of this paper is to consider the block bidi...The symmetric linear system gives us many simplifications and a possibility to adapt the computations to the computer at hand in order to achieve better performance. The aim of this paper is to consider the block bidiagonalization methods derived from a symmetric augmented multiple linear systems and make a comparison with the block GMRES and block biconjugate gradient methods.展开更多
This paper proposes a two-parameter block triangular splitting(TPTS)preconditioner for the general block two-by-two linear systems.The eigenvalues of the corresponding preconditioned matrix are proved to cluster aroun...This paper proposes a two-parameter block triangular splitting(TPTS)preconditioner for the general block two-by-two linear systems.The eigenvalues of the corresponding preconditioned matrix are proved to cluster around 0 or 1 under mild conditions.The limited numerical results show that the TPTS preconditioner is more efficient than the classic block-diagonal and block-triangular preconditioners when applied to the flexible generalized minimal residual(FGMRES)method.展开更多
In this paper, we provide new preconditioner for saddle point linear systems with (1,1) blocks that have a high nullity. The preconditioner is block triangular diagonal with two variable relaxation paremeters and it i...In this paper, we provide new preconditioner for saddle point linear systems with (1,1) blocks that have a high nullity. The preconditioner is block triangular diagonal with two variable relaxation paremeters and it is extension of results in [1] and [2]. Theoretical analysis shows that all eigenvalues of preconditioned matrix is strongly clustered. Finally, numerical tests confirm our analysis.展开更多
Many problems in science and engineering require solving large consistent linear systems. This paper presents a relaxed greedy block Kaczmarz method (RGBK) and an accelerated greedy block Kaczmarz method (AGBK) for so...Many problems in science and engineering require solving large consistent linear systems. This paper presents a relaxed greedy block Kaczmarz method (RGBK) and an accelerated greedy block Kaczmarz method (AGBK) for solving large-size consistent linear systems. The RGBK algorithm extends the greedy block Kaczmarz algorithm (GBK) presented by Niu and Zheng in <a href="#ref1">[1]</a> by introducing a relaxation parameter to the iteration formulation of GBK, and the AGBK algorithm uses different iterative update rules to minimize the running time. The convergence of the RGBK is proved and a method to determine an optimal parameter is provided. Several examples are presented to show the effectiveness of the proposed methods for overdetermined and underdetermined consistent linear systems with dense and sparse coefficient matrix.展开更多
In this paper, we provide a generalized block-by-block method for constructing block-by-block systems to solve the system of linear Volterra integral equations of the second kind, and then deduce some of the special c...In this paper, we provide a generalized block-by-block method for constructing block-by-block systems to solve the system of linear Volterra integral equations of the second kind, and then deduce some of the special cases. Compared with the expansion method and He＇s homotopy perturbation method, respectively numerical examples are given to certify the effectiveness of the method. The results show that the block-by-block method is very effective, simple, and of high accuracy in solving the system of linear Volterra integral equations of the second kind.展开更多
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.展开更多
In this paper, we investigate the block Lanczos algorithm for solving large sparse symmetric linear systems with multiple right-hand sides, and show how to incorporate deflation to drop converged linear systems using ...In this paper, we investigate the block Lanczos algorithm for solving large sparse symmetric linear systems with multiple right-hand sides, and show how to incorporate deflation to drop converged linear systems using a natural convergence criterion, and present an adaptive block Lanczos algorithm. We propose also a block version of Paige and Saunders’ MINRES method for iterative solution of symmetric linear systems, and describe important implementation details. We establish a relationship between the block Lanczos algorithm and block MINRES algorithm, and compare the numerical performance of the Lanczos algorithm and MINRES method for symmetric linear systems applied to a sequence of right hand sides with that of the block Lanczos algorithm and block MINRES algorithm for multiple linear systems simultaneously.[WT5,5”HZ]展开更多
In the experimental field, researchers need very often to select the best subset model as well as reach the best model estimation simultaneously. Selecting the best subset of variables will improve the prediction accu...In the experimental field, researchers need very often to select the best subset model as well as reach the best model estimation simultaneously. Selecting the best subset of variables will improve the prediction accuracy as noninformative variables will be removed. Having a model with high prediction accuracy allows the researchers to use the model for future forecasting. In this paper, we investigate the differences between various variable selection methods. The aim is to compare the analysis of the frequentist methodology (the backward elimination), penalised shrinkage method (the Adaptive LASSO) and the Least Angle Regression (LARS) for selecting the active variables for data produced by the blocked design experiment. The result of the comparative study supports the utilization of the LARS method for statistical analysis of data from blocked experiments.展开更多
The structural organization of initially random errors evolving in abarotropic tangent linear model, with time-dependent basic states taken from analyses, is examinedfor cases of block development, maturation and deca...The structural organization of initially random errors evolving in abarotropic tangent linear model, with time-dependent basic states taken from analyses, is examinedfor cases of block development, maturation and decay in the Southern Hemisphere atmosphere duringApril, November, and December 1989. The statistics of 100 evolved errors are studied for six-dayperiods and compared with the growth and structures of fast growing normal modes and finite-timenormal modes (FTNMs). The amplification factors of most initially random errors are slightly lessthan those of the fastest growing FTNM for the same time interval. During their evolution, thestandard deviations of the error fields become concentrated in the regions of rapid dynamicaldevelopment, particularly associated with developing and decaying blocks. We have calculatedprobability distributions and the mean and standard deviations of pattern correlations between eachof the 100 evolved error fields and the five fastest growing FTNMs for the same time interval. Themean of the largest pattern correlation, taken over the five fastest growing FTNMs, increases withincreasing time interval to a value close to 0.6 or larger after six days. FTNM 1 generally, but notalways, gives the largest mean pattern correlation with error fields. Corresponding patterncorrelations with the fast growing normal modes of the instantaneous basic state flow aresignificant' but lower than with FTNMs. Mean pattern correlations with fast growing FTNMs increasefurther when the time interval is increased beyond six days.展开更多
基金supported by the National Natural Science Foundation of China(61171170) the Natural Science Foundation of Anhui Province(1408085QF115)
文摘This study proposes a novel multi-fractal spectrumbasedapproach to distinguish linear block codes from its selfsynchronousscrambled codes. Given that the linear block codeand self-synchronous scrambled linear block code share the propertyof linear correlation, the existing linear correlation-basedidentification method is invalid for this case. This drawback can becircumvented by introducing a novel multi-fractal spectrum-basedmethod. Simulation results show that the new method has highrobustness and under the same conditions of bit error, the lowerthe code rate, the higher the recognition rate. Thus, the methodhas significant potential for future application in engineering.
文摘The optimal and suboptimal structured algorithms of linear block codes from the geometrical perspective are represented.The minimum distance and weight property lemmas and the theorem are proved for the generator matrix.Based upon the property of generator matrix,the structured algorithms of linear block codes are demonstrated.Since the complexity of optimal structured algorithm is very high,the binary linear block codes is searched by using the suboptimal structured algorithm.The comparison with Bose-Chaudhuri-Hocquenqhem（BCH） codes shows that the searched linear block codes are equivalent on minimum distance and can be designed for more block lengths.Because the linear block codes are used widely in communication systems and digital applications,the optimal and suboptimal structured algorithms must have great future being widely used in many applications and perspectives.
文摘Genetic algorithms offer very good performances for solving large optimization problems, especially in the domain of error-correcting codes. However, they have a major drawback related to the time complexity and memory occupation when running on a uniprocessor computer. This paper proposes a parallel decoder for linear block codes, using parallel genetic algorithms (PGA). The good performance and time complexity are confirmed by theoretical study and by simulations on BCH(63,30,14) codes over both AWGN and flat Rayleigh fading channels. The simulation results show that the coding gain between parallel and single genetic algorithm is about 0.7 dB at BER = 10﹣5 with only 4 processors.
基金by the National Natural Science Foundation of China(Nos.21004017 and 21004043)the Natural Science Foundation of Hebei Provinee(No.B2015202049).
文摘In order to promote development of linear/branched block polyethylenes based on new catalytic systems,we synthesized a novel a.dimine nickel(Ⅱ)complex with isopropyl substituents on ortho-N-aryl and hydroxymethyl phenyl substituents on para-Naryl structures.The activity of a-dimine nickl(Ⅱ)catalyst was 3.02x10^(6)g-mol_(ni)^(-1)·h^(-1) at 70℃,and resultant polyethylene possessed 135/1000C branches.The linear/branched block polyethylenes were synthesized from ethylene polymerization catalyzed by the a-dimine nicke(Ⅱ)complex/bis(phenoxy-imine)zirconium in the presence of diethyI zinc.With the addition of ZnEtz(from 0 to 400),the melting peak of resultant polyethylene changed from a single melting peak to bimodal melting peaks.The molecular weights of resultant polyethylene ranging from 26.8 kg/mol to 17.1 kg/mol and PDI values varying gradually from 24.4 to 15.2 were obtained vla adjusting ZnEt;equiv.and molar ratio of two catalysts.In addition,the branching degree of the polyethylene increased from 13/1000C to 56/1000 with the increase of the proportion of a dimine nickel(Ⅱ)catalyst.Using this binary catalyst system,the reaction temperature of chain shutting polymerization can be carried out at 70℃,which is more conducive to industrial application.
文摘Therrno-responsive block copolymers poly（ethylene glycol）-block-poly（N-acryloyl-2,2-dimethyl-1,3-oxazolidine）, PEG-b-PADMO, based on linear PEG were prepared via a versatile reversible addition-fragmentation chain transfer （RAFT） polymerization, PEG22 （Mw = 1000） was used as the hydrophilic component, whose dehydration was the main driving force for the phase transition of these copolymers, as demonstrated by the tH-NMR spectra. Their lower critical solution temperatures （LCSTs） could be tuned in the range of 20℃ to 35℃, by adjusting the degree of polymerization （DP） of PADMO between 14-27. Furthermore, a sharp phase transition at ca. 33℃, close to the physiological temperature with minimal hysteresis, was observed for the PEGzz-b-PADMO14 copolymer. Moreover, excellent reversibility and reproducibility were displayed for the same copolymer over 10 cycles of repeated temperature change between 25℃ （below the LCST） and 40℃ （above the LCST）.
文摘Iterative methods that take advantage of efficient block operations and block communications are popular research topics in parallel computation. These methods are especially important on Massively Parallel Processors (MPP). This paper presents a block variant of the GMRES method for solving general unsymmetric linear systems. It is shown that the new algorithm with block size s, denoted by BVGMRES(s,m), is theoretically equivalent to the GMRES(s. m) method. The numerical results show that this algorithm can be more efficient than the standard GMRES method on a cache based single CPU computer with optimized BLAS kernels. Furthermore, the gain in efficiency is more significant on MPPs due to both efficient block operations and efficient block data communications. Our numerical results also show that in comparison to the standard GMRES method, the more PEs that are used on an MPP, the more efficient the BVGMRES(s,m) algorithm is.
基金The research of this author was supported by the National Natural Science Foundation of China,the JiangsuProvince Natural Science Foundation,the Jiangsu Province"333Engineering" Foundation and the Jiangsu Province"Qinglan Engineering" Foundation
文摘The symmetric linear system gives us many simplifications and a possibility to adapt the computations to the computer at hand in order to achieve better performance. The aim of this paper is to consider the block bidiagonalization methods derived from a symmetric augmented multiple linear systems and make a comparison with the block GMRES and block biconjugate gradient methods.
基金the National Natural Science Foundation of China under Grant Nos.61273311 and 61803247.
文摘This paper proposes a two-parameter block triangular splitting(TPTS)preconditioner for the general block two-by-two linear systems.The eigenvalues of the corresponding preconditioned matrix are proved to cluster around 0 or 1 under mild conditions.The limited numerical results show that the TPTS preconditioner is more efficient than the classic block-diagonal and block-triangular preconditioners when applied to the flexible generalized minimal residual(FGMRES)method.
文摘In this paper, we provide new preconditioner for saddle point linear systems with (1,1) blocks that have a high nullity. The preconditioner is block triangular diagonal with two variable relaxation paremeters and it is extension of results in [1] and [2]. Theoretical analysis shows that all eigenvalues of preconditioned matrix is strongly clustered. Finally, numerical tests confirm our analysis.
文摘Many problems in science and engineering require solving large consistent linear systems. This paper presents a relaxed greedy block Kaczmarz method (RGBK) and an accelerated greedy block Kaczmarz method (AGBK) for solving large-size consistent linear systems. The RGBK algorithm extends the greedy block Kaczmarz algorithm (GBK) presented by Niu and Zheng in <a href="#ref1">[1]</a> by introducing a relaxation parameter to the iteration formulation of GBK, and the AGBK algorithm uses different iterative update rules to minimize the running time. The convergence of the RGBK is proved and a method to determine an optimal parameter is provided. Several examples are presented to show the effectiveness of the proposed methods for overdetermined and underdetermined consistent linear systems with dense and sparse coefficient matrix.
基金Supported by the National Natural Science Foundation of China(10962008)
文摘In this paper, we provide a generalized block-by-block method for constructing block-by-block systems to solve the system of linear Volterra integral equations of the second kind, and then deduce some of the special cases. Compared with the expansion method and He＇s homotopy perturbation method, respectively numerical examples are given to certify the effectiveness of the method. The results show that the block-by-block method is very effective, simple, and of high accuracy in solving the system of linear Volterra integral equations of the second kind.
基金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.
文摘In this paper, we investigate the block Lanczos algorithm for solving large sparse symmetric linear systems with multiple right-hand sides, and show how to incorporate deflation to drop converged linear systems using a natural convergence criterion, and present an adaptive block Lanczos algorithm. We propose also a block version of Paige and Saunders’ MINRES method for iterative solution of symmetric linear systems, and describe important implementation details. We establish a relationship between the block Lanczos algorithm and block MINRES algorithm, and compare the numerical performance of the Lanczos algorithm and MINRES method for symmetric linear systems applied to a sequence of right hand sides with that of the block Lanczos algorithm and block MINRES algorithm for multiple linear systems simultaneously.[WT5,5”HZ]
文摘In the experimental field, researchers need very often to select the best subset model as well as reach the best model estimation simultaneously. Selecting the best subset of variables will improve the prediction accuracy as noninformative variables will be removed. Having a model with high prediction accuracy allows the researchers to use the model for future forecasting. In this paper, we investigate the differences between various variable selection methods. The aim is to compare the analysis of the frequentist methodology (the backward elimination), penalised shrinkage method (the Adaptive LASSO) and the Least Angle Regression (LARS) for selecting the active variables for data produced by the blocked design experiment. The result of the comparative study supports the utilization of the LARS method for statistical analysis of data from blocked experiments.
文摘The structural organization of initially random errors evolving in abarotropic tangent linear model, with time-dependent basic states taken from analyses, is examinedfor cases of block development, maturation and decay in the Southern Hemisphere atmosphere duringApril, November, and December 1989. The statistics of 100 evolved errors are studied for six-dayperiods and compared with the growth and structures of fast growing normal modes and finite-timenormal modes (FTNMs). The amplification factors of most initially random errors are slightly lessthan those of the fastest growing FTNM for the same time interval. During their evolution, thestandard deviations of the error fields become concentrated in the regions of rapid dynamicaldevelopment, particularly associated with developing and decaying blocks. We have calculatedprobability distributions and the mean and standard deviations of pattern correlations between eachof the 100 evolved error fields and the five fastest growing FTNMs for the same time interval. Themean of the largest pattern correlation, taken over the five fastest growing FTNMs, increases withincreasing time interval to a value close to 0.6 or larger after six days. FTNM 1 generally, but notalways, gives the largest mean pattern correlation with error fields. Corresponding patterncorrelations with the fast growing normal modes of the instantaneous basic state flow aresignificant' but lower than with FTNMs. Mean pattern correlations with fast growing FTNMs increasefurther when the time interval is increased beyond six days.
