This paper is concerned with seeking the general solutions of matrix equation M（ξ）M＊ （ξ） = Is for the construction of multiple channel biorthogonal wavelets, provided that some special solution of its is known.
A unitary right R-module MR satisfies acc on d-annihilators if for every sequence（a;）;of elements of R the ascending chain AnnM（a;）■ AnnM（a;a;）■AnnM（a;a;a;）■… of submodules of MR stabilizes. In this paper ...A unitary right R-module MR satisfies acc on d-annihilators if for every sequence（a;）;of elements of R the ascending chain AnnM（a;）■ AnnM（a;a;）■AnnM（a;a;a;）■… of submodules of MR stabilizes. In this paper we first investigate some triangular matrix extensions of modules with acc on d-annihilators. Then we show that under some additional conditions,the Ore extension module M[x]R[x;α,δ]over the Ore extension ring R[x;α,δ] satisfies acc on d-annihilators if and only if the module MR satisfies acc on d-annihilators. Consequently, several known results regarding modules with acc on d-annihilators are extended to a more general setting.展开更多
The decoding algorithm for the correction of errors of arbitrary Mannheim weight has discussed for Lattice constellations and codes from quadratic number fields.Following these lines,the decoding algorithms for the co...The decoding algorithm for the correction of errors of arbitrary Mannheim weight has discussed for Lattice constellations and codes from quadratic number fields.Following these lines,the decoding algorithms for the correction of errors of n=p−12 length cyclic codes(C)over quaternion integers of Quaternion Mannheim(QM)weight one up to two coordinates have considered.In continuation,the case of cyclic codes of lengths n=p−12 and 2n−1=p−2 has studied to improve the error correction efficiency.In this study,we present the decoding of cyclic codes of length n=ϕ(p)=p−1 and length 2n−1=2ϕ(p)−1=2p−3(where p is prime integer andϕis Euler phi function)over Hamilton Quaternion integers of Quaternion Mannheim weight for the correction of errors.Furthermore,the error correction capability and code rate tradeoff of these codes are also discussed.Thus,an increase in the length of the cyclic code is achieved along with its better code rate and an adequate error correction capability.展开更多
Machine learning(ML)is a major subfield of artificial intelligence(AI).It has been seen as a feasi- ble way of avoiding the knowledge bottleneck problem in knowledge-based systems development.Re- search on ML has conc...Machine learning(ML)is a major subfield of artificial intelligence(AI).It has been seen as a feasi- ble way of avoiding the knowledge bottleneck problem in knowledge-based systems development.Re- search on ML has concentrated in the main on inductive learning,a paradigm for inducing rules from unordered sets of exmaples.AQ11 and ID3,the two most widespread algorithms in ML,are both induc- tive.This paper first summarizes AQ11,ID3 and the newly-developed extension matrix approach based HCV algorithm;and then reviews the recent development of inductive learing and automatic knowledge acquisition from data bases.展开更多
基金supported in part Professor Yuesheng Xu under the program of"One Hundred Outstanding Young Chinese Scientists" of the Chinese Academy of Sciencesthe Graduate Innovation Foundation of the Chinese Academy of Sciences
文摘This paper is concerned with seeking the general solutions of matrix equation M（ξ）M＊ （ξ） = Is for the construction of multiple channel biorthogonal wavelets, provided that some special solution of its is known.
基金The NSF(11471108) of Chinathe NSF(2015JJ2051,2016JJ2050) of Hunan Provincethe Teaching Reform Foundation(G21316) of Hunan Province
文摘A unitary right R-module MR satisfies acc on d-annihilators if for every sequence（a;）;of elements of R the ascending chain AnnM（a;）■ AnnM（a;a;）■AnnM（a;a;a;）■… of submodules of MR stabilizes. In this paper we first investigate some triangular matrix extensions of modules with acc on d-annihilators. Then we show that under some additional conditions,the Ore extension module M[x]R[x;α,δ]over the Ore extension ring R[x;α,δ] satisfies acc on d-annihilators if and only if the module MR satisfies acc on d-annihilators. Consequently, several known results regarding modules with acc on d-annihilators are extended to a more general setting.
基金The authors extend their gratitude to the Deanship of Scientific Research at King Khalid University for funding this work through research groups program under grant number R.G.P.1/85/42.
文摘The decoding algorithm for the correction of errors of arbitrary Mannheim weight has discussed for Lattice constellations and codes from quadratic number fields.Following these lines,the decoding algorithms for the correction of errors of n=p−12 length cyclic codes(C)over quaternion integers of Quaternion Mannheim(QM)weight one up to two coordinates have considered.In continuation,the case of cyclic codes of lengths n=p−12 and 2n−1=p−2 has studied to improve the error correction efficiency.In this study,we present the decoding of cyclic codes of length n=ϕ(p)=p−1 and length 2n−1=2ϕ(p)−1=2p−3(where p is prime integer andϕis Euler phi function)over Hamilton Quaternion integers of Quaternion Mannheim weight for the correction of errors.Furthermore,the error correction capability and code rate tradeoff of these codes are also discussed.Thus,an increase in the length of the cyclic code is achieved along with its better code rate and an adequate error correction capability.
文摘Machine learning(ML)is a major subfield of artificial intelligence(AI).It has been seen as a feasi- ble way of avoiding the knowledge bottleneck problem in knowledge-based systems development.Re- search on ML has concentrated in the main on inductive learning,a paradigm for inducing rules from unordered sets of exmaples.AQ11 and ID3,the two most widespread algorithms in ML,are both induc- tive.This paper first summarizes AQ11,ID3 and the newly-developed extension matrix approach based HCV algorithm;and then reviews the recent development of inductive learing and automatic knowledge acquisition from data bases.
