LINEAR_COMPLEXITY

作品数：53被引量：78H指数：5
导出分析报告
相关作者：胡卫群岳勤更多>>
相关机构：南京航空航天大学南京林业大学更多>>
相关期刊：《The Journal of China Universities of Posts and Telecommunications》《Progress in Natural Science:Materials International》《Frontiers of Mathematics in China》《Journal of Southeast University(English Edition)》更多>>
相关基金：国家自然科学基金福建省自然科学基金国家重点基础研究发展计划国家教育部博士点基金更多>>
-
在结果中检索

检索结果分析

结果分析中...
共 条 记 录，以下是1-10
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
TianXing:A Linear Complexity Transformer Model with Explicit Attention Decay for Global Weather Forecasting
《Advances in Atmospheric Sciences》2025年第1期9-25,共17页Shijin YUAN Guansong WANG Bin MU Feifan ZHOU 
supported in part by the Meteorological Joint Funds of the National Natural Science Foundation of China under Grant U2142211;in part by the National Natural Science Foundation of China under Grant 42075141,42341202;in part by the National Key Research and Development Program of China under Grant 2020YFA0608000;in part by the Shanghai Municipal Science and Technology Major Project(2021SHZDZX0100);the Fundamental Research Funds for the Central Universities。
In this paper,we introduce TianXing,a transformer-based data-driven model designed with physical augmentation for skillful and efficient global weather forecasting.Previous data-driven transformer models such as Pangu...
关键词：weather forecast deep learning physics augmentation linear attention 
Indexing dynamic encrypted database in cloud for efficient secure k-nearest neighbor query
《Frontiers of Computer Science》2024年第1期187-198,共12页Xingxin LI Youwen ZHU Rui XU Jian WANG Yushu ZHANG 
support by the National Key R&D Program of China(No.2020YFB1005900);the National Natural Science Foundation of China(Grant Nos.62172216,62032025,62071222,U20A201092);the Key R&D Program of Guangdong Province(No.2020B0101090002);the Natural Science Foundation of Jiangsu Province(No.BK20211180,BK20200418);the Research Fund of Guangxi Key Laboratory of Trusted Software(No.KX202034);JSPS Postdoctoral Fellowships for Research in Japan(No.P21073).
Secure k-Nearest Neighbor(k-NN)query aims to find k nearest data of a given query from an encrypted database in a cloud server without revealing privacy to the untrusted cloud and has wide applications in many areas,s...
关键词：cloud computing secure k-NN query sub-linear complexity dynamicupdate 
On the pseudorandom properties of d-ary generalized two-prime Sidelnikov sequences
《Frontiers of Mathematics in China》2023年第5期341-351,共11页Shimeng SHEN Huaning LIU 
Let p and q be two distinct odd primes and let d=(p-1,q-1).In this paper,we construct d-ary generalized two-prime Sidelnikov sequences and study the autocorrelation values and linear complexity.
关键词：Two-prime sequence Sidelnikov sequence character sum autocorrelation value linear complexity 
On the Linear Complexity of a Class of Periodic Sequences Derived from Euler Quotients
《Chinese Journal of Electronics》2023年第2期262-272,共11页LUO Bingyu ZHANG Jingwei ZHAO Chang’an 
supported by Guangdong Major Project of Basic and Applied Basic Research(2019B030302008);the National Natural Science Foundation of China(61972428);the Open Fund of State Key Laboratory of Information Security(Institute of Information Engineering,Chinese Academy of Sciences)(2020-ZD-02);Guangdong Basic and Applied Basic Research Foundation(2019A1515011797).
In this paper,a family of binary sequences derived from Euler quotients with RSA modulus pq is introduced.Here two primes p and q are distinct and satisfy gcd(pq,(p−1)(q−1))=1.The linear complexities and minimal polyn...
关键词：CRYPTOGRAPHY Binary sequences Linear complexity Euler quotients RSA modulus 
On the k-error linear complexity of 2p2-periodic binary sequences
《Science China(Information Sciences)》2020年第9期253-255,共3页Zhihua NIU Can YUAN Zhixiong CHEN Xiaoni DU Tao ZHANG 
State Key Program of National Nature Science Foundation of China(Grant No.61936001);National Nature Science Foundation of Shanghai(Grant Nos.16ZR1411200,17ZR1409800,19ZR1417700);Research and Development Program in Key Areas of Guangdong Province(Grant No.2018B010113001);National Nature Science Foundation of China(Grant No.61572309);partially supported by National Natural Science Foundation of China(Grant No.61772292);partially supported by National Natural Science Foundation of China(Grant No.61772022);Projects of International Cooperation and Exchanges NSFC-RFBR(Grant No.61911530130)。
Dear editor,Pseudorandom sequences play an important role in cryptography.In particular in symmetric cryptography they serve as the secret key.So the designs of pseudorandom sequences and cryptographic indicators are ...
关键词：SEQUENCES PERIODIC DIRECTIONS 
Multiscale ApEn and SampEn in Quantifying Nonlinear Complexity of Depressed MEG被引量：2
《Chinese Journal of Electronics》2019年第4期817-821,共5页YAO Wenpo HU Hui WANG Jun YAN Wei LI Jin HOU Fengzhen 
supported by the National Natural Science Foundation of China(No.61271082,No.61401518,No.31671006,No.61771251);Jiangsu Provincial Key R&D Program(Social Development)(No.BE2015700,No.BE2016773);the Natural Science Foundation of Jiangsu Province(No.BK20141432);Natural Science Research Major Program in Universities of Jiangsu Province(No.16KJA310002);Postgraduate Research&Practice Innovation Program of Jiangsu Province(No.KYCX17-0788)
Depression is a neurophysiological disorder with recurrent dysregulations of self-mental states.Multiscale Approximate entropy(ApEn)and Sample entropy(SampEn)are employed to characterize nonlinear complexity of Magnet...
关键词：MAGNETOENCEPHALOGRAPHY DEPRESSION Approximate ENTROPY Sample ENTROPY Multiscale 
Linear complexity and autocorrelation of a new class of binary generalized cyclotomic sequences of order two and length pqr被引量：1
《Journal of Systems Engineering and Electronics》2019年第4期651-661,共11页JIA Wenjuan GAO Juntao ZHANG Peng 
supported by the National Key Research and Development Program of China(2016YFB0800601);the Natural Science Foundation of China(61303217;61502372);the Fundamental Research Funds for the Central Universities(JB140115);the Natural Science Foundation of Shaanxi Province(2013JQ8002;2014JQ8313)
Cyclotomic sequences have good cryptographic properties and are closely related to difference sets.This paper proposes a new class of binary generalized cyclotomic sequences of order two and length pqr.Its linear comp...
关键词：GENERALIZED cyclotomic sequence linear complexity MINIMAL POLYNOMIAL AUTOCORRELATION value. 
Linear Complexity of d-Ary Sequence Derived from Euler Quotients over GF(q)被引量：1
《Chinese Journal of Electronics》2019年第3期529-534,共6页YE Zhifan KE Pinhui CHEN Zhixiong 
supported by the National Natural Science Foundation of China (No.61772292, No.61772476);the Provincial Natural Science Foundation of Fujian (No.2019J01273);the Foundation of FujianEducational Committee (No.JAT170627)
For an odd prime p and positive integers r,d such that 0
关键词：Linear complexity EULER QUOTIENT d-ary SEQUENCE 
Linear Complexity of Least Significant Bit of Polynomial Quotients被引量：2
《Chinese Journal of Electronics》2017年第3期573-578,共6页ZHAO Chun'e MA Wenping YAN Tongjiang SUN Yuhua 
supported by the National Natural Science Foundation of China(No.61170319,No.61072140,No.61373171);the 111 Project(No.B08038);the Specialized Research Fund for the Doctoral Program of Higher Education(No.20100203110003);the Fujian Provincial Key Laboratory of Network Security and Cryptology Research Fund(Fujian Normal University)(No.15002);the Shandong Provincial Natural Science Foundation of China(No.ZR2014FQ005);the Fundamental Research Funds for the Central Universities(No.15CX08011A,No.15CX02065A,No.15CX02060A,No.15CX05060A,No.16CX02013A);the Applied Basic Research Program of Qingdao(No.16-5-1-5-jch)
Binary sequences with large linear complexity have been found many applications in communication systems.We determine the linear complexity of a family of p^2-periodic binary sequences derived from polynomial quotient...
关键词：CRYPTOGRAPHY Polynomial quotient Fermat quotient Pseudo-random sequences Linear complexity 
On the GF(p) Linear Complexity of Hall's Sextic Sequences and Some Cyclotomic-Set-Based Sequences
《Chinese Annals of Mathematics,Series B》2016年第4期515-522,共8页Xianmang HE Liqin HU Dong LI 
supported by the National Natural Science Foundation of China(Nos.61202007,U1509213);Top Priority of the Discipline(Information and Communication Engineering)Open Foundation of Zhejiang;the Postdoctoral Science Foundation(No.2013M540323);the Outstanding Doctoral Dissertation in Nanjing University of Aeronautics and Astronautics(No.BCXJ 13-17)
Klapper(1994) showed that there exists a class of geometric sequences with the maximal possible linear complexity when considered as sequences over GF(2), but these sequences have very low linear complexities when con...
关键词：Linear complexity Hall＇s sextic residues sequence Cyclotomic set 
全选清除导出
共6页<123456>
检索报告 对象比较 聚类工具 使用帮助 返回顶部