Let a_(1),a_(2),a_(3)be nonzero integers with gcd(a_(1),a_(2),a_(3))=1,and let k be any positive integer,K=max[3,|a_(1)|,|a_(2)|,|a_(3)|,k].Suppose that l_(1),l_(2),l_(3)are integers each coprime to k.Suppose further ...Let a_(1),a_(2),a_(3)be nonzero integers with gcd(a_(1),a_(2),a_(3))=1,and let k be any positive integer,K=max[3,|a_(1)|,|a_(2)|,|a_(3)|,k].Suppose that l_(1),l_(2),l_(3)are integers each coprime to k.Suppose further that b is any integer satisfying some necessary congruent conditions.The solvability of linear equation a_(1)p_(1)+a_(2)p_(2)+a_(3)p_(3)=b(p_(j)=l_(j)(mod k),1≤j≤3)with prime variables pi,p_(2),ps is investigated.It is proved that if ai,a_(2),a_(3)are all positive,then the above equation is solvable whenever b≥K^(25);if a,a_(2),a_(3)are not all of the same sign,then the above equation has a solution p_(1),p_(2),p_(3)satisfying max(p_(1),p_(2),p_(3))≤3|b|+K^(25).展开更多
In order to decrease the calculation complexity of connectivity reliability of road networks, an improved recursive decomposition arithmetic is proposed. First, the basic theory of recursive decomposition arithmetic i...In order to decrease the calculation complexity of connectivity reliability of road networks, an improved recursive decomposition arithmetic is proposed. First, the basic theory of recursive decomposition arithmetic is reviewed. Then the characteristics of road networks, which are different from general networks, are analyzed. Under this condition, an improved recursive decomposition arithmetic is put forward which fits road networks better. Furthermore, detailed calculation steps are presented which are convenient for the computer, and the advantage of the approximate arithmetic is analyzed based on this improved arithmetic. This improved recursive decomposition arithmetic directly produces disjoint minipaths and avoids the non-polynomial increasing problems. And because the characteristics of road networks are considered, this arithmetic is greatly simplified. Finally, an example is given to prove its validity.展开更多
In this paper, we analyse a new chaos-based cryptosystem with an embedded adaptive arithmetic coder, which was proposed by Li Heng-Jian and Zhang J S （Li H J and Zhang J S 2010 Chin. Phys. B 19 050508）. Although thi...In this paper, we analyse a new chaos-based cryptosystem with an embedded adaptive arithmetic coder, which was proposed by Li Heng-Jian and Zhang J S （Li H J and Zhang J S 2010 Chin. Phys. B 19 050508）. Although this new method has a better compression performance than its original version, it is found that there are some problems with its security and decryption processes. In this paper, it is shown how to obtain a great deal of plain text from the cipher text without prior knowledge of the secret key. After discussing the security and decryption problems of the Li Heng-Jian et al. algorithm, we propose an improved chaos-based cryptosystem with an embedded adaptive arithmetic coder that is more secure.展开更多
A new interval arithmetic method is proposed to solve interval functions with correlated intervals through which the overestimation problem existing in interval analysis could be significantly alleviated. The correlat...A new interval arithmetic method is proposed to solve interval functions with correlated intervals through which the overestimation problem existing in interval analysis could be significantly alleviated. The correlation between interval parameters is defined by the multidimensional parallelepiped model which is convenient to describe the correlative and independent interval variables in a unified framework. The original interval variables with correlation are transformed into the standard space without correlation,and then the relationship between the original variables and the standard interval variables is obtained. The expressions of four basic interval arithmetic operations, namely addition, subtraction, multiplication, and division, are given in the standard space. Finally, several numerical examples and a two-step bar are used to demonstrate the effectiveness of the proposed method.展开更多
Dynamic fault tree analysis is widely used for the reliability analysis of the complex system with dynamic failure characteristics. In many circumstances, the exact value of system reliability is difficult to obtain d...Dynamic fault tree analysis is widely used for the reliability analysis of the complex system with dynamic failure characteristics. In many circumstances, the exact value of system reliability is difficult to obtain due to absent or insufficient data for failure probabilities or failure rates of components. The traditional fuzzy operation arithmetic based on extension principle or interval theory may lead to fuzzy accumulations. Moreover, the existing fuzzy dynamic fault tree analysis methods are restricted to the case that all system components follow exponential time-to-failure distributions. To overcome these problems, a new fuzzy dynamic fault tree analysis approach based on the weakest n-dimensional t-norm arithmetic and developed sequential binary decision diagrams method is proposed to evaluate system fuzzy reliability. Compared with the existing approach,the proposed method can effectively reduce fuzzy cumulative and be applicable to any time-tofailure distribution type for system components. Finally, a case study is presented to illustrate the application and advantages of the proposed approach.展开更多
A numerical model for shallow water flow has been developed based on the unsteady Reynolds-averaged Navier-Stokes equations with the hydrodynamic pressure instead of hydrostatic pressure assumption. The equations are ...A numerical model for shallow water flow has been developed based on the unsteady Reynolds-averaged Navier-Stokes equations with the hydrodynamic pressure instead of hydrostatic pressure assumption. The equations are transformed into the σ-coordinate system and the eddy viscosity is calculated with the standard k-ε turbulence model. The control volume method is used to discrete the equations, and the boundary conditions at the bed for shallow water models only include vertical diffusion terms expressed with wall functions. And the semi-implicit method for pressure linked equation arithmetic is adopted to solve the equations. The model is applied to the 2D vertical plane flow of a current over two steep-sided trenches for which experiment data are available for comparison and good agreement is obtained. And the model is used to predicting the flow in a channel with a steep-sided submerged breakwater at the bottom, and the streamline is drawn.展开更多
When the uncertainties of structures may be bounded in intervals, through some suitable discretization, interval finite element method can be constructed by combining the interval analysis with the traditional finite ...When the uncertainties of structures may be bounded in intervals, through some suitable discretization, interval finite element method can be constructed by combining the interval analysis with the traditional finite element method (FEM). The two parameters, median and deviation, were used to represent the uncertainties of interval variables. Based on the arithmetic rules of intervals, some properties and arithmetic rules of interval variables were demonstrated. Combining the procedure of interval analysis with FEM, a static linear interval finite element method was presented to solve the non-random uncertain structures. ne solving of the characteristic parameters of n-freedom uncertain displacement field of the static governing equation was transformed into 2 n-order linear equations. It is shown by a numerical example that the proposed method is practical and effective.展开更多
For protecting the copyright of a text and recovering its original content harmlessly,this paper proposes a novel reversible natural language watermarking method that combines arithmetic coding and synonym substitutio...For protecting the copyright of a text and recovering its original content harmlessly,this paper proposes a novel reversible natural language watermarking method that combines arithmetic coding and synonym substitution operations.By analyzing relative frequencies of synonymous words,synonyms employed for carrying payload are quantized into an unbalanced and redundant binary sequence.The quantized binary sequence is compressed by adaptive binary arithmetic coding losslessly to provide a spare for accommodating additional data.Then,the compressed data appended with the watermark are embedded into the cover text via synonym substitutions in an invertible manner.On the receiver side,the watermark and compressed data can be extracted by decoding the values of synonyms in the watermarked text,as a result of which the original context can be perfectly recovered by decompressing the extracted compressed data and substituting the replaced synonyms with their original synonyms.Experimental results demonstrate that the proposed method can extract the watermark successfully and achieve a lossless recovery of the original text.Additionally,it achieves a high embedding capacity.展开更多
Let φ(n) denote the Euler-totient function, we study the distribution of solutions of φ(n) ≤ x in arithmetic progressions, where n ≡ l(mod q) and an asymptotic formula was obtained by Perron formula.
For any x ∈ （0, 1] （except at most countably many points）, there exists a unique sequence {dn（x）}n≥1 of integers, called the digit sequence of x, such that x =∞ ∑j=1 1/d1（x）（d1（x）-1）……dj-1（x）（dj-1...For any x ∈ （0, 1] （except at most countably many points）, there exists a unique sequence {dn（x）}n≥1 of integers, called the digit sequence of x, such that x =∞ ∑j=1 1/d1（x）（d1（x）-1）……dj-1（x）（dj-1（x）-1）dj（x）. The dexter infinite series expansion is called the Liiroth expansion of x. This paper is con- cerned with the size of the set of points x whose digit sequence in its Liiroth expansion is strictly increasing and contains arbitrarily long arithmetic progressions with arbitrary com- mon difference. More precisely, we determine the Hausdorff dimension of the above set.展开更多
An approximately optimal adaptive arithmetic coding (AC) system using a forbidden symbol (FS) over noisy channels was proposed which allows one to jointly and adaptively design the source decoding and channel correcti...An approximately optimal adaptive arithmetic coding (AC) system using a forbidden symbol (FS) over noisy channels was proposed which allows one to jointly and adaptively design the source decoding and channel correcting in a single process, with superior performance compared with traditional separated techniques. The concept of adaptiveness is applied not only to the source model but also to the amount of coding redundancy. In addition, an improved branch metric computing algorithm and a faster sequential searching algorithm compared with the system proposed by Grangetto were proposed. The proposed system is tested in the case of image transmission over the AWGN channel, and compared with traditional separated system in terms of packet error rate and complexity. Both hard and soft decoding were taken into account.展开更多
Modular arithmetic is a fundamental operation and plays an important role in public key cryptosystem. A new method and its theory evidence on the basis of modular arithmetic with large integer modulus-changeable modul...Modular arithmetic is a fundamental operation and plays an important role in public key cryptosystem. A new method and its theory evidence on the basis of modular arithmetic with large integer modulus-changeable modulus algorithm is proposed to improve the speed of the modular arithmetic in the presented paper. For changeable modulus algorithm, when modular computation of modulo n is difficult, it can be realized by computation of modulo n-1 and n-2 on the perquisite of easy modular computations of modulo n-1 and modulo n-2. The conclusion is that the new method is better than the direct method by computing the modular arithmetic operation with large modulus. Especially, when computations of modulo n-1 and modulo n-2 are easy and computation of modulo n is difficult, this new method will be faster and has more advantages than other algorithms on modular arithmetic. Lastly, it is suggested that the proposed method be applied in public key cryptography based on modular multiplication and modular exponentiation with large integer modulus effectively展开更多
A comparison of arithmetic operations of two dynamic process optimization approaches called quasi-sequential approach and reduced Sequential Quadratic Programming(rSQP)simultaneous approach with respect to equality co...A comparison of arithmetic operations of two dynamic process optimization approaches called quasi-sequential approach and reduced Sequential Quadratic Programming(rSQP)simultaneous approach with respect to equality constrained optimization problems is presented.Through the detail comparison of arithmetic operations,it is concluded that the average iteration number within differential algebraic equations(DAEs)integration of quasi-sequential approach could be regarded as a criterion.One formula is given to calculate the threshold value of average iteration number.If the average iteration number is less than the threshold value,quasi-sequential approach takes advantage of rSQP simultaneous approach which is more suitable contrarily.Two optimal control problems are given to demonstrate the usage of threshold value.For optimal control problems whose objective is to stay near desired operating point,the iteration number is usually small.Therefore,quasi-sequential approach seems more suitable for such problems.展开更多
From such actual conditions as the effects of characteristics of miltilayer petroleum geology and permeation fluid mechanics, a new numerical model is put forward and coupling splitting-up implicit interactive scheme ...From such actual conditions as the effects of characteristics of miltilayer petroleum geology and permeation fluid mechanics, a new numerical model is put forward and coupling splitting-up implicit interactive scheme is formed. For the actual situation of Dongying hollow (four-layer) and Tanhai region (three-layer) of Shengli Petroleum Field, the numerical simulation test results and the actual conditions are coincident.展开更多
The key component of finite element analysis of structures with fuzzy parameters, which is associated with handling of some fuzzy information and arithmetic relation of fuzzy variables, was the solving of the governin...The key component of finite element analysis of structures with fuzzy parameters, which is associated with handling of some fuzzy information and arithmetic relation of fuzzy variables, was the solving of the governing equations of fuzzy finite element method. Based on a given interval representation of fuzzy numbers, some arithmetic rules of fuzzy numbers and fuzzy variables were developed in terms of the properties of interval arithmetic. According to the rules and by the theory of interval finite element method, procedures for solving the static governing equations of fuzzy finite element method of structures were presented. By the proposed procedure, the possibility distributions of responses of fuzzy structures can be generated in terms of the membership functions of the input fuzzy numbers. It is shown by a numerical example that the computational burden of the presented procedures is low and easy to implement. The effectiveness and usefulness of the presented procedures are also illustrated.展开更多
A cost-based selective maintenance decision-making method was presented.The purpose of this method was to find an optimal choice of maintenance actions to be performed on a selected group of machines for manufacturing...A cost-based selective maintenance decision-making method was presented.The purpose of this method was to find an optimal choice of maintenance actions to be performed on a selected group of machines for manufacturing systems.The arithmetic reduction of intensity model was introduced to describe the influence on machine failure intensity by different maintenance actions (preventive maintenance,minimal repair and overhaul).In the meantime,a resolution algorithm combining the greedy heuristic rules with genetic algorithm was provided.Finally,a case study of the maintenance decision-making problem of automobile workshop was given.Furthermore,the case study demonstrates the practicability of this method.展开更多
The coalescence and missed detection are two key challenges in Multi-Target Tracking(MTT).To balance the tracking accuracy and real-time performance,the existing Random Finite Set(RFS)based filters are generally diffi...The coalescence and missed detection are two key challenges in Multi-Target Tracking(MTT).To balance the tracking accuracy and real-time performance,the existing Random Finite Set(RFS)based filters are generally difficult to handle the above problems simultaneously,such as the Track-Oriented marginal Multi-Bernoulli/Poisson(TOMB/P)and Measurement-Oriented marginal Multi-Bernoulli/Poisson(MOMB/P)filters.Based on the Arithmetic Average(AA)fusion rule,this paper proposes a novel fusion framework for the Poisson Multi-Bernoulli(PMB)filter,which integrates both the advantages of the TOMB/P filter in dealing with missed detection and the advantages of the MOMB/P filter in dealing with coalescence.In order to fuse the different PMB distributions,the Bernoulli components in different Multi-Bernoulli(MB)distributions are associated with each other by Kullback-Leibler Divergence(KLD)minimization.Moreover,an adaptive AA fusion rule is designed on the basis of the exponential fusion weights,which utilizes the TOMB/P and MOMB/P updates to solve these difficulties in MTT.Finally,by comparing with the TOMB/P and MOMB/P filters,the performance of the proposed filter in terms of accuracy and efficiency is demonstrated in three challenging scenarios.展开更多
New operators are presented to introduce “arithmetic calculus”, where 1) the operators are just obvious mathematical facts, and 2) arithmetic calculus refers to summing and subtracting operations without solving equ...New operators are presented to introduce “arithmetic calculus”, where 1) the operators are just obvious mathematical facts, and 2) arithmetic calculus refers to summing and subtracting operations without solving equations. The sole aim of this paper is to make a case for arithmetic calculus, which is lurking in conventional mathematics and science but has no identity of its own. The underlying thinking is: 1) to shift the focus from the whole sequence to any of its single elements;and 2) to factorise each element to building blocks and rules. One outcome of this emerging calculus is to understand the interconnectivity in a family of sequences, without which they are seen as discrete entities with no interconnectivity. Arithmetic calculus is a step closer towards deriving a “Tree of Numbers” reminiscent of the Tree of Life. Another windfall outcome is to show that the deconvolution problem is explicitly well-posed but at the same time implicitly ill-conditioned;and this challenges a misconception that this problem is ill-posed. If the thinking in this paper is not new, this paper forges it through a mathematical spin by presenting new terms, definitions, notations and operators. The return for these out of the blue new aspects is far reaching.展开更多
In this work, power efficient butterfly unit based FFT architecture is presented. The butterfly unit is designed using floating-point fused arithmetic units. The fused arithmetic units include two-term dot product uni...In this work, power efficient butterfly unit based FFT architecture is presented. The butterfly unit is designed using floating-point fused arithmetic units. The fused arithmetic units include two-term dot product unit and add-subtract unit. In these arithmetic units, operations are performed over complex data values. A modified fused floating-point two-term dot product and an enhanced model for the Radix-4 FFT butterfly unit are proposed. The modified fused two-term dot product is designed using Radix-16 booth multiplier. Radix-16 booth multiplier will reduce the switching activities compared to Radix-8 booth multiplier in existing system and also will reduce the area required. The proposed architecture is implemented efficiently for Radix-4 decimation in time(DIT) FFT butterfly with the two floating-point fused arithmetic units. The proposed enhanced architecture is synthesized, implemented, placed and routed on a FPGA device using Xilinx ISE tool. It is observed that the Radix-4 DIT fused floating-point FFT butterfly requires 50.17% less space and 12.16% reduced power compared to the existing methods and the proposed enhanced model requires 49.82% less space on the FPGA device compared to the proposed design. Also, reduced power consumption is addressed by utilizing the reusability technique, which results in 11.42% of power reduction of the enhanced model compared to the proposed design.展开更多
文摘Let a_(1),a_(2),a_(3)be nonzero integers with gcd(a_(1),a_(2),a_(3))=1,and let k be any positive integer,K=max[3,|a_(1)|,|a_(2)|,|a_(3)|,k].Suppose that l_(1),l_(2),l_(3)are integers each coprime to k.Suppose further that b is any integer satisfying some necessary congruent conditions.The solvability of linear equation a_(1)p_(1)+a_(2)p_(2)+a_(3)p_(3)=b(p_(j)=l_(j)(mod k),1≤j≤3)with prime variables pi,p_(2),ps is investigated.It is proved that if ai,a_(2),a_(3)are all positive,then the above equation is solvable whenever b≥K^(25);if a,a_(2),a_(3)are not all of the same sign,then the above equation has a solution p_(1),p_(2),p_(3)satisfying max(p_(1),p_(2),p_(3))≤3|b|+K^(25).
基金The National Key Technology R& D Program of Chinaduring the 11th Five-Year Plan Period (No.2006BAJ18B03).
文摘In order to decrease the calculation complexity of connectivity reliability of road networks, an improved recursive decomposition arithmetic is proposed. First, the basic theory of recursive decomposition arithmetic is reviewed. Then the characteristics of road networks, which are different from general networks, are analyzed. Under this condition, an improved recursive decomposition arithmetic is put forward which fits road networks better. Furthermore, detailed calculation steps are presented which are convenient for the computer, and the advantage of the approximate arithmetic is analyzed based on this improved arithmetic. This improved recursive decomposition arithmetic directly produces disjoint minipaths and avoids the non-polynomial increasing problems. And because the characteristics of road networks are considered, this arithmetic is greatly simplified. Finally, an example is given to prove its validity.
基金Project supported by the National Natural Science Foundation of China (Grant Nos. 60573172 and 60973152)the Doctoral Program Foundation of Institution of Higher Education of China (Grant No. 20070141014)the Natural Science Foundation of Liaoning Province of China (Grant No. 20082165)
文摘In this paper, we analyse a new chaos-based cryptosystem with an embedded adaptive arithmetic coder, which was proposed by Li Heng-Jian and Zhang J S （Li H J and Zhang J S 2010 Chin. Phys. B 19 050508）. Although this new method has a better compression performance than its original version, it is found that there are some problems with its security and decryption processes. In this paper, it is shown how to obtain a great deal of plain text from the cipher text without prior knowledge of the secret key. After discussing the security and decryption problems of the Li Heng-Jian et al. algorithm, we propose an improved chaos-based cryptosystem with an embedded adaptive arithmetic coder that is more secure.
基金supported by the National Natural Science Foundation for Excellent Young Scholars(Grant 51222502)the National Natural Science Foundation of China(Grant 11172096)the Funds for State Key Laboratory of Construction Machinery(SKLCM2014-1)
文摘A new interval arithmetic method is proposed to solve interval functions with correlated intervals through which the overestimation problem existing in interval analysis could be significantly alleviated. The correlation between interval parameters is defined by the multidimensional parallelepiped model which is convenient to describe the correlative and independent interval variables in a unified framework. The original interval variables with correlation are transformed into the standard space without correlation,and then the relationship between the original variables and the standard interval variables is obtained. The expressions of four basic interval arithmetic operations, namely addition, subtraction, multiplication, and division, are given in the standard space. Finally, several numerical examples and a two-step bar are used to demonstrate the effectiveness of the proposed method.
基金supported by the National Defense Basic Scientific Research program of China (No.61325102)
文摘Dynamic fault tree analysis is widely used for the reliability analysis of the complex system with dynamic failure characteristics. In many circumstances, the exact value of system reliability is difficult to obtain due to absent or insufficient data for failure probabilities or failure rates of components. The traditional fuzzy operation arithmetic based on extension principle or interval theory may lead to fuzzy accumulations. Moreover, the existing fuzzy dynamic fault tree analysis methods are restricted to the case that all system components follow exponential time-to-failure distributions. To overcome these problems, a new fuzzy dynamic fault tree analysis approach based on the weakest n-dimensional t-norm arithmetic and developed sequential binary decision diagrams method is proposed to evaluate system fuzzy reliability. Compared with the existing approach,the proposed method can effectively reduce fuzzy cumulative and be applicable to any time-tofailure distribution type for system components. Finally, a case study is presented to illustrate the application and advantages of the proposed approach.
文摘A numerical model for shallow water flow has been developed based on the unsteady Reynolds-averaged Navier-Stokes equations with the hydrodynamic pressure instead of hydrostatic pressure assumption. The equations are transformed into the σ-coordinate system and the eddy viscosity is calculated with the standard k-ε turbulence model. The control volume method is used to discrete the equations, and the boundary conditions at the bed for shallow water models only include vertical diffusion terms expressed with wall functions. And the semi-implicit method for pressure linked equation arithmetic is adopted to solve the equations. The model is applied to the 2D vertical plane flow of a current over two steep-sided trenches for which experiment data are available for comparison and good agreement is obtained. And the model is used to predicting the flow in a channel with a steep-sided submerged breakwater at the bottom, and the streamline is drawn.
文摘When the uncertainties of structures may be bounded in intervals, through some suitable discretization, interval finite element method can be constructed by combining the interval analysis with the traditional finite element method (FEM). The two parameters, median and deviation, were used to represent the uncertainties of interval variables. Based on the arithmetic rules of intervals, some properties and arithmetic rules of interval variables were demonstrated. Combining the procedure of interval analysis with FEM, a static linear interval finite element method was presented to solve the non-random uncertain structures. ne solving of the characteristic parameters of n-freedom uncertain displacement field of the static governing equation was transformed into 2 n-order linear equations. It is shown by a numerical example that the proposed method is practical and effective.
基金This project is supported by National Natural Science Foundation of China(No.61202439)partly supported by Scientific Research Foundation of Hunan Provincial Education Department of China(No.16A008)partly supported by Hunan Key Laboratory of Smart Roadway and Cooperative Vehicle-Infrastructure Systems(No.2017TP1016).
文摘For protecting the copyright of a text and recovering its original content harmlessly,this paper proposes a novel reversible natural language watermarking method that combines arithmetic coding and synonym substitution operations.By analyzing relative frequencies of synonymous words,synonyms employed for carrying payload are quantized into an unbalanced and redundant binary sequence.The quantized binary sequence is compressed by adaptive binary arithmetic coding losslessly to provide a spare for accommodating additional data.Then,the compressed data appended with the watermark are embedded into the cover text via synonym substitutions in an invertible manner.On the receiver side,the watermark and compressed data can be extracted by decoding the values of synonyms in the watermarked text,as a result of which the original context can be perfectly recovered by decompressing the extracted compressed data and substituting the replaced synonyms with their original synonyms.Experimental results demonstrate that the proposed method can extract the watermark successfully and achieve a lossless recovery of the original text.Additionally,it achieves a high embedding capacity.
基金Supported by the National Natural Science Foundation of China（11271249） Supported by the Scientific and Technological Research Program of Chongqing Municipal Education Commission（1601213） Supported by the Scientific Research Program of Yangtze Normal University（2012XJYBO31）
文摘Let φ(n) denote the Euler-totient function, we study the distribution of solutions of φ(n) ≤ x in arithmetic progressions, where n ≡ l(mod q) and an asymptotic formula was obtained by Perron formula.
文摘For any x ∈ （0, 1] （except at most countably many points）, there exists a unique sequence {dn（x）}n≥1 of integers, called the digit sequence of x, such that x =∞ ∑j=1 1/d1（x）（d1（x）-1）……dj-1（x）（dj-1（x）-1）dj（x）. The dexter infinite series expansion is called the Liiroth expansion of x. This paper is con- cerned with the size of the set of points x whose digit sequence in its Liiroth expansion is strictly increasing and contains arbitrarily long arithmetic progressions with arbitrary com- mon difference. More precisely, we determine the Hausdorff dimension of the above set.
文摘An approximately optimal adaptive arithmetic coding (AC) system using a forbidden symbol (FS) over noisy channels was proposed which allows one to jointly and adaptively design the source decoding and channel correcting in a single process, with superior performance compared with traditional separated techniques. The concept of adaptiveness is applied not only to the source model but also to the amount of coding redundancy. In addition, an improved branch metric computing algorithm and a faster sequential searching algorithm compared with the system proposed by Grangetto were proposed. The proposed system is tested in the case of image transmission over the AWGN channel, and compared with traditional separated system in terms of packet error rate and complexity. Both hard and soft decoding were taken into account.
基金Supported by the National Natural Science Foun-dation of China (60373087)
文摘Modular arithmetic is a fundamental operation and plays an important role in public key cryptosystem. A new method and its theory evidence on the basis of modular arithmetic with large integer modulus-changeable modulus algorithm is proposed to improve the speed of the modular arithmetic in the presented paper. For changeable modulus algorithm, when modular computation of modulo n is difficult, it can be realized by computation of modulo n-1 and n-2 on the perquisite of easy modular computations of modulo n-1 and modulo n-2. The conclusion is that the new method is better than the direct method by computing the modular arithmetic operation with large modulus. Especially, when computations of modulo n-1 and modulo n-2 are easy and computation of modulo n is difficult, this new method will be faster and has more advantages than other algorithms on modular arithmetic. Lastly, it is suggested that the proposed method be applied in public key cryptography based on modular multiplication and modular exponentiation with large integer modulus effectively
基金Supported by the National Natural Science Foundation of China（20676117） the National Creative Research Groups Science Foundation of China（60421002）
文摘A comparison of arithmetic operations of two dynamic process optimization approaches called quasi-sequential approach and reduced Sequential Quadratic Programming(rSQP)simultaneous approach with respect to equality constrained optimization problems is presented.Through the detail comparison of arithmetic operations,it is concluded that the average iteration number within differential algebraic equations(DAEs)integration of quasi-sequential approach could be regarded as a criterion.One formula is given to calculate the threshold value of average iteration number.If the average iteration number is less than the threshold value,quasi-sequential approach takes advantage of rSQP simultaneous approach which is more suitable contrarily.Two optimal control problems are given to demonstrate the usage of threshold value.For optimal control problems whose objective is to stay near desired operating point,the iteration number is usually small.Therefore,quasi-sequential approach seems more suitable for such problems.
文摘From such actual conditions as the effects of characteristics of miltilayer petroleum geology and permeation fluid mechanics, a new numerical model is put forward and coupling splitting-up implicit interactive scheme is formed. For the actual situation of Dongying hollow (four-layer) and Tanhai region (three-layer) of Shengli Petroleum Field, the numerical simulation test results and the actual conditions are coincident.
基金Foundation items:the National Natural Science Foundation of China(59575040,59575032)the Areonautics Science Foundation of China(00B53010)
文摘The key component of finite element analysis of structures with fuzzy parameters, which is associated with handling of some fuzzy information and arithmetic relation of fuzzy variables, was the solving of the governing equations of fuzzy finite element method. Based on a given interval representation of fuzzy numbers, some arithmetic rules of fuzzy numbers and fuzzy variables were developed in terms of the properties of interval arithmetic. According to the rules and by the theory of interval finite element method, procedures for solving the static governing equations of fuzzy finite element method of structures were presented. By the proposed procedure, the possibility distributions of responses of fuzzy structures can be generated in terms of the membership functions of the input fuzzy numbers. It is shown by a numerical example that the computational burden of the presented procedures is low and easy to implement. The effectiveness and usefulness of the presented procedures are also illustrated.
基金Project(51105141,51275191)supported by the National Natural Science Foundation of ChinaProject(2009AA043301)supported by the National High Technology Research and Development Program of ChinaProject(2012TS073)supported by the Fundamental Research Funds for the Central University of HUST,China
文摘A cost-based selective maintenance decision-making method was presented.The purpose of this method was to find an optimal choice of maintenance actions to be performed on a selected group of machines for manufacturing systems.The arithmetic reduction of intensity model was introduced to describe the influence on machine failure intensity by different maintenance actions (preventive maintenance,minimal repair and overhaul).In the meantime,a resolution algorithm combining the greedy heuristic rules with genetic algorithm was provided.Finally,a case study of the maintenance decision-making problem of automobile workshop was given.Furthermore,the case study demonstrates the practicability of this method.
基金supported by the National Natural Science Foundation of China(No.61871301)。
文摘The coalescence and missed detection are two key challenges in Multi-Target Tracking(MTT).To balance the tracking accuracy and real-time performance,the existing Random Finite Set(RFS)based filters are generally difficult to handle the above problems simultaneously,such as the Track-Oriented marginal Multi-Bernoulli/Poisson(TOMB/P)and Measurement-Oriented marginal Multi-Bernoulli/Poisson(MOMB/P)filters.Based on the Arithmetic Average(AA)fusion rule,this paper proposes a novel fusion framework for the Poisson Multi-Bernoulli(PMB)filter,which integrates both the advantages of the TOMB/P filter in dealing with missed detection and the advantages of the MOMB/P filter in dealing with coalescence.In order to fuse the different PMB distributions,the Bernoulli components in different Multi-Bernoulli(MB)distributions are associated with each other by Kullback-Leibler Divergence(KLD)minimization.Moreover,an adaptive AA fusion rule is designed on the basis of the exponential fusion weights,which utilizes the TOMB/P and MOMB/P updates to solve these difficulties in MTT.Finally,by comparing with the TOMB/P and MOMB/P filters,the performance of the proposed filter in terms of accuracy and efficiency is demonstrated in three challenging scenarios.
文摘New operators are presented to introduce “arithmetic calculus”, where 1) the operators are just obvious mathematical facts, and 2) arithmetic calculus refers to summing and subtracting operations without solving equations. The sole aim of this paper is to make a case for arithmetic calculus, which is lurking in conventional mathematics and science but has no identity of its own. The underlying thinking is: 1) to shift the focus from the whole sequence to any of its single elements;and 2) to factorise each element to building blocks and rules. One outcome of this emerging calculus is to understand the interconnectivity in a family of sequences, without which they are seen as discrete entities with no interconnectivity. Arithmetic calculus is a step closer towards deriving a “Tree of Numbers” reminiscent of the Tree of Life. Another windfall outcome is to show that the deconvolution problem is explicitly well-posed but at the same time implicitly ill-conditioned;and this challenges a misconception that this problem is ill-posed. If the thinking in this paper is not new, this paper forges it through a mathematical spin by presenting new terms, definitions, notations and operators. The return for these out of the blue new aspects is far reaching.
文摘In this work, power efficient butterfly unit based FFT architecture is presented. The butterfly unit is designed using floating-point fused arithmetic units. The fused arithmetic units include two-term dot product unit and add-subtract unit. In these arithmetic units, operations are performed over complex data values. A modified fused floating-point two-term dot product and an enhanced model for the Radix-4 FFT butterfly unit are proposed. The modified fused two-term dot product is designed using Radix-16 booth multiplier. Radix-16 booth multiplier will reduce the switching activities compared to Radix-8 booth multiplier in existing system and also will reduce the area required. The proposed architecture is implemented efficiently for Radix-4 decimation in time(DIT) FFT butterfly with the two floating-point fused arithmetic units. The proposed enhanced architecture is synthesized, implemented, placed and routed on a FPGA device using Xilinx ISE tool. It is observed that the Radix-4 DIT fused floating-point FFT butterfly requires 50.17% less space and 12.16% reduced power compared to the existing methods and the proposed enhanced model requires 49.82% less space on the FPGA device compared to the proposed design. Also, reduced power consumption is addressed by utilizing the reusability technique, which results in 11.42% of power reduction of the enhanced model compared to the proposed design.
