逐位模2加运算与模2n加运算的相容程度分析

深入分析了逐位模2加运算和模2^n加运算的相客程度问题，给出了它们的相客概率的计算公式；同时给出了它们的一些性质．井对用这两种群运算的组合作为编码环节的特性做了一定的分析。     

定身加准基数的应用

定身加是种古老的算法，我们把这种古老的算法应用到现代珠算，来个珠脑结合，有许多数字相乘，根本用不着逐位实乘，只凭眼看用心脑算，就可很快得出答数来。方法就是定身加准基数。首先我们要了解，什么是准基数呢，凡两数相乘，如能利用数与数之间的特殊关系，利用数的运算规律和数的性质，采用     

下模(上模)不可加测度的条件期望(英文)

本文研究了下模(上模)不可加测度的条件期望.利用下模不可加测度μ的Choquet积分的最大可加表示定理定义了下模(上模)不可加测度的条件期望, 并且证明了这种条件期望的相关性质.     

复数运算的金钥匙——“模”

2017年版普通高中数学课程标准对复数版块做了局部调整,增加了复数三角表示.2021年全国新高考统一考试适应性训练和2020届高考数学全国卷(Ⅱ)(理科)对复数深度考查了与“模”有关的运算,本案例举几例复数求模问题,感受“模”在复数运算中的重要地位.     

关于1-Lipschitz函数模2~k微分的一个注记

给出了Klimov-Shamir型1-Lipschitz函数的模2~2-微分指标的一个直接计算,修正了Anashin关于模2~2-微分指标的一个结论.进一步地,利用Anashin的模2~2-微分指标定理构造了一大类形如f(x)=u(x)+u~2(x)∨5的单圈1-Lipschitz函数.     

一类模加差分方程系统解个数的期望与方差

模2~n加法是一个非常重要的密码运算部件,它已经被广泛用于各种对称密码算法的设计,如MD5、SNOW 3G、SPECK和ZUC等.差分故障攻击是针对密码算法实现的一种通用的安全性分析方法,该攻击假设攻击者能在算法运行过程中动态注入故障.在对采用模加运算的密码算法进行差分故障分析时,攻击者往往会导出一个模加差分方程系统,该方程系统中,方程的个数恰好等于法注入故障的次数,其与方程系统的解个数密切相关.由于注入故障次数和方程系统解个数是评估故障攻击复杂度的两个关键参数,因此,研究它们之间的关系非常有意义.本文讨论了上述模加差分方程系统中一类特殊方程系统(即模加差分相互独立且服从均匀分布)的解个数的统计特性.作为结果,本文给出了它们的期望和方差.本文的结果表明,对一般的模加差分方程系统,平均意义下,需要注入大约log_2(n)+5个故障可以确定方程系统的候选解.     

sl(2)的q-变形的不可分解的Harish-Chandra模的分类

本文对sl（2）的q-变形的不可分解的Harish－Chandra模进行了分类．     

基于Archimedean三角模的犹豫直觉模糊语言信息群决策方法

针对语言术语集下标运算不封闭的问题,基于Archimedean三角模讨论了犹豫直觉模糊语言信息下的封闭运算体系。首先提出基于Archimedean三角模的犹豫直觉模糊语言集,然后给出了相应的得分函数、精确函数、排序规则和集结算子,给出一种基于Archimedean三角模的犹豫直觉模糊语言信息的群决策方法,最后用一个实例说明了方法的有效性和优越性。     

“两位数加一位数进位加”教学设计及思考

正【课前思考】"两位数加一位数进位加"是在学生掌握了"两位数加一位数不进位加"的珠心算方法后进行教学的,通过本课学习后,要让学生理清两位数加一位数的进位加的算理和方法。本课主要让学生重点掌握三种类型的进位加:个位上直减进位加(如19+8)、个位上破五进位加(如27+7)和个位破五进位后同时十位满五的进位加(如47+6)的拨珠方法。考虑到一年级学生的年龄特征,为了让学生在掌握珠算方法、获得对数学理解的同时,也能在心算技能上得以初步尝试,进而让他们在能力和思维上     

sl_2(R)上Harish-Chandra模及其应用

将ｓｌ２（Ｒ）上不可约Ｈａｒｉｓｈ－Ｃｈａｎｄｒａ模及ｓｌ２（Ｒ）上不可分解的Ｈａｒｉｓｈ－Ｃｈａｎｄｒａ模进行了完全分类，得到了与ｓｌ２（Ｃ）上模分类的不同形式．作为应用，又构造了实Ｖｉｒａｓｏｒｏ代数的一类新的不可约表示．     

Unique addition modules

LetV be a module over a ring R. We define V to be a unique addition module (UAM) if it is not possible to change the addition of V without changing the action of R on V. If R is a domain such that 1 is not the only unit in R and V is a torsion-free i2-module, then we show that V is a UAM if and only if V has rank 1 (or if V={0}). We also classify finitely generated unique addition modules over commutative Artinian rings.     

Total domination stable graphs upon edge addition

A set S of vertices in a graph G is a total dominating set if every vertex of G is adjacent to some vertex in S. The minimum cardinality of a total dominating set of G is the total domination number of G. A graph is total domination edge addition stable if the addition of an arbitrary edge has no effect on the total domination number. In this paper, we characterize total domination edge addition stable graphs. We determine a sharp upper bound on the total domination number of total domination edge addition stable graphs, and we determine which combinations of order and total domination number are attainable. We finish this work with an investigation of claw-free total domination edge addition stable graphs.     

大数定律MATLB随机模拟的规律性

第二作者等用一个哲学公式及0.9规格化了收敛过程,从而形象化地解释了概率论与随机计算中的若干定理,使模拟的数值规律化.基于数学软件MATLB进行了大数定律的随机模拟,直观形象地展示了1/n∑_(i=1)~nX_i到数学期望μ的收敛过程,与第二作者等的哲学公式相吻合,从而有助于学生理解和掌握大数定律.     

高维空间中的有界凸域

证明n维空间中的有界凸域D能被拟共形映射到n维单位球B~n(0,1),即D是拟球,从而说明拟共形映射中的黎曼定理在n维空间中的有界凸域类中是成立的．     

球上同伦群的不变量

<正> §1.设 S~(q+1)为 q+1维球.讨论同伦群 П_r(S~(q+1))时 H.Hopf,G.W.WhiteheadP.J.Hilton 等发展了广义 Hopf 不变量,H:П_r(S~(q+1))→П_r(S~(2q+1)). (1)在同伦群 П_r(S~(q+1))中,差数 r—(q+1)比 П_r(S~(2q+1))中的差数 r—(2q+1)大.在同伦群的计算中差数小的应该先计算,所以通过 Hopf不变量利用差数较小的同伦群表达差数较     

Fuzzy addition in the L-fuzzy real line

Under the hypothesis L is a chain, we construct a binary operation ⊕ on the L-fuzzy real line $\text{R}$(L) which reduces to the usual addition on $\text{R}$ if ⊕ is restricted to the embedded image of $\text{R}$ in $\text{R}$(L), which yields a partially ordered, abelian cancellation semigroup with identity, and which is jointly fuzzy continuous on $\text{R}$(L). We show ⊕ is unique, i.e. it is the only extension of addition to $\text{R}$(L) which is consistent. We study the relationship between ⊕ and other fuzzy continuous extensions of the usual addition. We also show that fuzzy translation is a weak fuzzy homeomorphism and, under certain conditions, a fuzzy homeomorphism.     

Multi-service multi-facility network design under uncertainty

The problem of designing high speed networks using different modules of link capacities, in the same model, in order to meet uncertain demands obtained from different probability distribution functions (PDF) is a very hard and challenging real network design problem. The novelty of the new model, compared to previous ones, is to allow installing more than one module per link having equal or different capacities. Moreover, the scenarios of traffic can be generated, according to practical observations, from the main classes of uncertain demands (multi-service) simulated from different PDFs, including heavy tailed ones. These classes of traffic are considered simultaneously for the scenario generation, different from related works in the literature that use only one probability distribution function to simulate the scenarios of traffic. In this work we present the problem formulation and report computational results using branch-and-bound and L-shaped decomposition solution approaches. We consider in the same model up to three different types of modular capacities (multi-facility), since it seems that using more than this can lead to an intractable model. The objective is to minimize penalty (in case of unmet demands) and investment costs. We obtain confidence intervals (with 95% of covering rate) on the expected optimal solution value for the resulting two-stage stochastic integer-modular problem and discuss when they are meaningful. Numerical experiments show that our model can handle up to medium real size instances.     

New results on global exponential stabilization of impulsive functional differential equations with infinite delays or finite delays

This paper studies the global exponential stabilization of impulsive functional differential equations with infinite delays or finite delays by using Lyapunov functions and improved Razumikhin technique. The results obtained in this paper improve and complement ones from some recent works. Moreover, the Razumikhin condition obtained is very simple and effective to implement in real problems and it is helpful for investigating the stability of control systems and synchronization control of chaotic systems. Finally, two examples and their simulations are given to show the effectiveness and advantages of our results.     

A complete set of addition laws for incomplete Edwards curves

Edwards curves were the first curves shown to have a complete addition law. However, the completeness of the addition law depends on the curve parameters and even a complete Edwards curve becomes incomplete over a quadratic field extension. This paper covers arbitrary Edwards curves and gives a set of two addition laws that for any pair of input points P₁, P₂ produce the sum P₁+P₂.