检索结果-南通市图书馆

Science China Mathematics 2010年第9期53卷 2203-2206页

作者： DESHOUILLERS Jean-Marc HASSANI Mehdi Institut Mathématique de Bordeaux UMR 5251Universit'e de Bordeaux et CNRS33405 TALENCE CedexFrance Department of Mathematics Institute for Advanced Studies in Basic Sciences(IASBS)Zanjan 45137-66731P.O.Box 45195-1159Iran

In two previous papers,the first named author jointly with Florian Luca and Henryk Iwaniec,have studied the distribution modulo 1 of sequences which have linear growth and are mean values of multiplicative functions on the set of all the integers.In this note,we give a first result concerning sequences with linear growth associated to the mean values of multiplicative functions on a set of polynomial values,proving the density modulo 1 of the sequencem[∑((m2+1))(m2+1)(m≤n)]n.This result is but an illustration of the theme which is currently being developed in the PhD thesis of the second named author.

关键词： distribution modulo 1 multiplicative function sieve

Evaluate All the Order of Every Element in the Higher Order of Group for Addition and Multiplication Composition

在线全文

学校读者我要写书评

暂无评论

International Journal of Modern Nonlinear Theory and Application 2022年第2期11卷 11-30页

作者： Md. Abdul Mannan Nazmun Nahar Halima Akter Momtaz Begum Md. Amanat Ullah Shabnam Mustari Department of Mathematics Uttara University Dhaka Bangladesh Department of Computer Science & Engineering Prime University Dhaka Bangladesh Department of Computer Science & Engineering Uttara University Dhaka Bangladesh Department of Mechanical Engineering Sonargaon University Dhaka Bangladesh

This paper aims at treating a study on the order of every element for addition and multiplication composition in the higher order of groups for different algebraic structures as groups;order of a group and order of element of a group in real numbers. Here we discuss the higher order of groups in different types of order which will give us practical knowledge to see the applications of the addition and multiplication composition. If G is a finite group, n is a positive integer and a ⋴G, then the order of the products na. When G is a finite group, every element must have finite order. However, the converse is false: there are infinite groups where each element has finite order. For example, in the group of all roots of unity in C× each element has finite order. Finally, we find out the order of every element of a group in different types of higher order of group.

关键词： Order of Element of a Group Addition Composition Multiplication Composition modulo

MAXIMAL PERIOD POLYNOMIALS OVER Z/(p^d)

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Science China Mathematics 1992年第3期35卷 270-275页

作者：黄民强 Institute of Systems Science Academia Sinica Beijing 100080 PRC

In tLis paper, we obtain a criterion (basically an algebraic discriminant) for f(x) to havethe maximal modulo p^d period. The principal part θ of the discriminant is based on thecoefficients of f(x) mod p and can be ... 详细信息

关键词： polynomial maximal period modulo p^d criterion.

On the Line Graph of the Complement Graph for the Ring of Gaussian Integers modulo n

在线全文

学校读者我要写书评

暂无评论

Open Journal of Discrete Mathematics 2012年第1期2卷 24-34页

作者： Manal Ghanem Khalida Nazzal 不详

The line graph for the complement of the zero divisor graph for the ring of Gaussian integers modulo n is studied. The diameter, the radius and degree of each vertex are determined. Complete characterization of Hamiltonian, Eulerian, planer, regular, locally and locally connected is given. The chromatic number when is a power of a prime is computed. Further properties for and are also discussed.

关键词： Complement of a Graph Chromatic Index Diameter Domination Number Eulerian Graph Gaussian Integers modulo n Hamiltonian Graph Line Graph Radius Zero Divisor Graph

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

软件流水中隐藏存储延迟的方法

软件学报 2005年第10期16卷 1833-1841页

作者：刘利李文龙陈彧李胜梅汤志忠清华大学计算机科学与技术系北京100084 Intel中国研究中心编译组北京100080

软件流水是一种重要的指令调度技术,它通过同时执行来自不同循环体的指令来加快循环的执行速度.随着处理机运行速度的逐渐提高,存储访问延迟成为性能提高的瓶颈.为了减轻存储系统影响,软件流水结合了一些存储优化技术,通过隐藏存储延迟... 详细信息

软件流水是一种重要的指令调度技术,它通过同时执行来自不同循环体的指令来加快循环的执行速度.随着处理机运行速度的逐渐提高,存储访问延迟成为性能提高的瓶颈.为了减轻存储系统影响,软件流水结合了一些存储优化技术,通过隐藏存储延迟来提高性能.提出了一种延迟可预测的模调度算法(foresightedlatencymoduloscheduling,简称FLMS),它根据循环的特点来确定load指令延迟.实验结果表明,FLMS算法减少了阻塞时间,提高了程序性能.

关键词：软件流水模调度涪储延迟 FLMS(foresighted latency modulo scheduling)

Jacket Matrix Based on Modular (3, 5, 6) Lattice Triangular Expansion

在线全文

学校读者我要写书评

暂无评论

Communications and Network 2013年第2期5卷 20-24页

作者： Wei Duan Haiyang Yu Wenjun Yu Moon Ho Lee Division of Electronics and Information Engineering Chonbuk National University Baekje-Daero Republic of Korea Division of Electronics and Information Engineering Chonbuk National University Deokjin-Gu Republic of Korea Division of Electronics and Information Engineering Chonbuk National University Jeollabuk-Do Republic of Korea Division of Electronics and Information Engineering Chonbuk National University Jeonju-Si Republic of Korea

A Lattice triangular expansion matrix is presented based on the classical Hadamard matrices, which is defined over the fields of finite characteristic. Also, the modular Lattice and Pentagon expansion matrices are structured from triangular 7x7 matrix, each of the expansion matrices are modular the sides of the shape p. The issue for the existence (necessary conditions) of odd and even order matrices of that kind is addressed. The modular Lattice code is highly efficient since it requires only additions, multiplications by constant modulo p. The modular 6 Lattice triangular expanded constellation is even possible efficiency to gain advantage from the channel selection and maximum likelihood (ML) decoding in the interference Lattice alignment (IA) system.

关键词： Element-Wise Inverse modulo Jacket Matrix the Sides of Shape Lattice Alignment ML Decoding

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

改进的RSA算法在数字签名中的应用

计算机工程与应用 2014年第17期50卷 106-109页

作者：肖振久胡驰陈虹辽宁工程技术大学软件学院辽宁葫芦岛125105 中国传媒大学计算机学院北京100024

针对传统RSA密码算法运算效率较低的问题,在标准RSA密码算法的自身结构和具体运算操作两方面做出了相应的改进,提出了一种新的RSA密码优化算法,并将该算法运用到数字签名技术中。然后通过仿真实验,将其与传统RSA算法以及基于乘同余对称... 详细信息

针对传统RSA密码算法运算效率较低的问题,在标准RSA密码算法的自身结构和具体运算操作两方面做出了相应的改进,提出了一种新的RSA密码优化算法,并将该算法运用到数字签名技术中。然后通过仿真实验,将其与传统RSA算法以及基于乘同余对称特性的SMM算法和指数2k进制化相结合的组合优化算法相比较,实验结果表明新的RSA密码优化算法在提升运算速度方面达到了较高的水平。

关键词： RSA算法数字签名乘同余对称模重复平方 Symmetry of modulo Multiplication(SMM)