期刊文献+
共找到204篇文章
< 1 2 11 >
每页显示 20 50 100
The Monty Hall Problem and beyond: Digital-Mathematical and Cognitive Analysis in Boole’s Algebra, Including an Extension and Generalization to Related Cases 被引量:1
1
作者 Leo Depuydt 《Advances in Pure Mathematics》 2011年第4期136-154,共19页
The Monty Hall problem has received its fair share of attention in mathematics. Recently, an entire monograph has been devoted to its history. There has been a multiplicity of approaches to the problem. These approach... The Monty Hall problem has received its fair share of attention in mathematics. Recently, an entire monograph has been devoted to its history. There has been a multiplicity of approaches to the problem. These approaches are not necessarily mutually exclusive. The design of the present paper is to add one more approach by analyzing the mathematical structure of the Monty Hall problem in digital terms. The structure of the problem is described as much as possible in the tradition and the spirit—and as much as possible by means of the algebraic conventions—of George Boole’s Investigation of the Laws of Thought (1854), the Magna Charta of the digital age, and of John Venn’s Symbolic Logic (second edition, 1894), which is squarely based on Boole’s Investigation and elucidates it in many ways. The focus is not only on the digital-mathematical structure itself but also on its relation to the presumed digital nature of cognition as expressed in rational thought and language. The digital approach is outlined in part 1. In part 2, the Monty Hall problem is analyzed digitally. To ensure the generality of the digital approach and demonstrate its reliability and productivity, the Monty Hall problem is extended and generalized in parts 3 and 4 to related cases in light of the axioms of probability theory. In the full mapping of the mathematical structure of the Monty Hall problem and any extensions thereof, a digital or non-quantitative skeleton is fleshed out by a quantitative component. The pertinent mathematical equations are developed and presented and illustrated by means of examples. 展开更多
关键词 Binary structure booleAN algebra booleAN Operators boole’s algebra Brain science Cognition COGNITIVE science Digital MATHEMATICs Electrical Engineering Linguistics Logic Non-Quantitative and QUANTITATIVE MATHEMATICs Monty HALL Problem Neuroscience Probability Theory Rational Thought and Language
下载PDF
基于FPGA的SM4算法高效实现方案
2
作者 张宏科 袁浩楠 +3 位作者 丁文秀 闫峥 李斌 梁栋 《通信学报》 EI CSCD 北大核心 2024年第5期140-150,共11页
针对SM4算法的FPGA实现方案存在数据处理速度不够高和逻辑资源占用过高的问题,提出了基于现场可编程门阵列(FPGA)的高性能、低资源消耗的SM4算法实现方案。所提方案采用循环密钥扩展与32级流水线加解密相结合的架构,循环密钥扩展的方式... 针对SM4算法的FPGA实现方案存在数据处理速度不够高和逻辑资源占用过高的问题,提出了基于现场可编程门阵列(FPGA)的高性能、低资源消耗的SM4算法实现方案。所提方案采用循环密钥扩展与32级流水线加解密相结合的架构,循环密钥扩展的方式降低了逻辑资源消耗,32级流水线加解密的方式提高了数据吞吐率。同时,所提方案采用代数式S盒并通过合并线性运算以及在不可约多项式的合并矩阵中筛选最优矩阵运算的方式进一步减少S盒变换的运算量,从而达到降低逻辑资源占用与提高工程数据吞吐率的目的。测试结果显示,该方案比现有最佳方案在数据吞吐率上提升了43%,且资源占用率降低了10%。 展开更多
关键词 sM4算法 FPGA实现 流水线架构 代数式s
下载PDF
Higher Variations of the Monty Hall Problem (3.0, 4.0) and Empirical Definition of the Phenomenon of Mathematics, in Boole’s Footsteps, as Something the Brain Does 被引量:1
3
作者 Leo Depuydt Richard D. Gill 《Advances in Pure Mathematics》 2012年第4期243-273,共31页
In Advances in Pure Mathematics (www.scirp.org/journal/apm), Vol. 1, No. 4 (July 2011), pp. 136-154, the mathematical structure of the much discussed problem of probability known as the Monty Hall problem was mapped i... In Advances in Pure Mathematics (www.scirp.org/journal/apm), Vol. 1, No. 4 (July 2011), pp. 136-154, the mathematical structure of the much discussed problem of probability known as the Monty Hall problem was mapped in detail. It is styled here as Monty Hall 1.0. The proposed analysis was then generalized to related cases involving any number of doors (d), cars (c), and opened doors (o) (Monty Hall 2.0) and 1 specific case involving more than 1 picked door (p) (Monty Hall 3.0). In cognitive terms, this analysis was interpreted in function of the presumed digital nature of rational thought and language. In the present paper, Monty Hall 1.0 and 2.0 are briefly reviewed (§§2-3). Additional generalizations of the problem are then presented in §§4-7. They concern expansions of the problem to the following items: (1) to any number of picked doors, with p denoting the number of doors initially picked and q the number of doors picked when switching doors after doors have been opened to reveal goats (Monty Hall 3.0;see §4);(3) to the precise conditions under which one’s chances increase or decrease in instances of Monty Hall 3.0 (Monty Hall 3.2;see §6);and (4) to any number of switches of doors (s) (Monty Hall 4.0;see §7). The afore-mentioned article in APM, Vol. 1, No. 4 may serve as a useful introduction to the analysis of the higher variations of the Monty Hall problem offered in the present article. The body of the article is by Leo Depuydt. An appendix by Richard D. Gill (see §8) provides additional context by building a bridge to modern probability theory in its conventional notation and by pointing to the benefits of certain interesting and relevant tools of computation now available on the Internet. The cognitive component of the earlier investigation is extended in §9 by reflections on the foundations of mathematics. It will be proposed, in the footsteps of George Boole, that the phenomenon of mathematics needs to be defined in empirical terms as something that happens to the brain or something that the brain does. It is generally assumed that mathematics is a property of nature or reality or whatever one may call it. There is not the slightest intention in this paper to falsify this assumption because it cannot be falsified, just as it cannot be empirically or positively proven. But there is no way that this assumption can be a factual observation. It can be no more than an altogether reasonable, yet fully secondary, inference derived mainly from the fact that mathematics appears to work, even if some may deem the fact of this match to constitute proof. On the deepest empirical level, mathematics can only be directly observed and therefore directly analyzed as an activity of the brain. The study of mathematics therefore becomes an essential part of the study of cognition and human intelligence. The reflections on mathematics as a phenomenon offered in the present article will serve as a prelude to planned articles on how to redefine the foundations of probability as one type of mathematics in cognitive fashion and on how exactly Boole’s theory of probability subsumes, supersedes, and completes classical probability theory. §§2-7 combined, on the one hand, and §9, on the other hand, are both self-sufficient units and can be read independently from one another. The ultimate design of the larger project of which this paper is part remains the increase of digitalization of the analysis of rational thought and language, that is, of (rational, not emotional) human intelligence. To reach out to other disciplines, an effort is made to describe the mathematics more explicitly than is usual. 展开更多
关键词 Artificial INTELLIGENCE Binary structure booleAN algebra booleAN Operators boole’s algebra Brain science Cognition Cognitive science DEFINITION of MATHEMATICs DEFINITION of Probability Theory Digital MATHEMATICs Electrical Engineering Foundations of MATHEMATICs Human INTELLIGENCE Linguistics Logic Monty HALL Problem Neuroscience Non-quantitative and Quantitative MATHEMATICs Probability Theory Rational Thought and Language
下载PDF
弱Boole代数与具有条件(S)的关联BCK-代数
4
作者 毛影岩 《龙岩学院学报》 2006年第6期1-2,共2页
证明了具有条件(S)的关联BCK-代数(X;*,)о等价于弱Boole代数(X;∧,,о*)。
关键词 具有条件(s)的关联BCK-代数 boole代数 正关联交换BCK-代数
下载PDF
Heyting代数成为Boole代数的条件及其特征 被引量:21
5
作者 王国俊 《陕西师大学报(自然科学版)》 CSCD 1991年第4期1-6,共6页
给出了Heyting代数成为Boole代数的几个充要条件.即Heyting代数H(,→)为Boole代数当且仅当如下条件之一成立:■a=a,■a∨a=1;或■H=H(■a=a→0).并研究了Heyting代数的自身特征.
关键词 HEYTING代数 布尔代数 伪补元
下载PDF
R_0-代数的Boole可补元与直积分解 被引量:5
6
作者 朱怡权 《高校应用数学学报(A辑)》 CSCD 北大核心 2006年第4期495-500,共6页
在R0-代数中引进了Boole可补元的概念,讨论了Boole可补元的一些基本性质;利用Boole可补元构造了R0-代数的一种直积分解.这些结果在一定程度上反映了R0-代数内部结构的特征,有益于从语义的角度进一步研究格值模糊逻辑系统.
关键词 R0-代数 boole可补元 直积分解
下载PDF
一类Boole方程解集代数系统性质的探讨
7
作者 丁殿坤 吕端良 《大学数学》 2019年第2期20-22,共3页
给出了一类Boole方程F=G的解集S关于逻辑加、逻辑乘、逻辑非运算可构成Boole代数系统的结论,又给出了Boole代数系统(S,+,·,-)与Boole代数系统(B,+,·,-)同态,进而得到了(S,+,·,-)与(B,+,·,-)同构的性质,并给予逻辑证... 给出了一类Boole方程F=G的解集S关于逻辑加、逻辑乘、逻辑非运算可构成Boole代数系统的结论,又给出了Boole代数系统(S,+,·,-)与Boole代数系统(B,+,·,-)同态,进而得到了(S,+,·,-)与(B,+,·,-)同构的性质,并给予逻辑证明,也举例说明了两个代数系统同态、同构应具备的条件,从而更加完善了Boole代数系统理论. 展开更多
关键词 解集 boole代数系统 同态 同构 逻辑证明
下载PDF
有限Boole格上粗糙集模型的代数结构
8
作者 王莉 毕全起 《河北师范大学学报(自然科学版)》 CAS 2002年第2期130-132,共3页
粗糙集理论是解决分类问题的一种数学方法 .在信息系统中 ,属性值可以是数值 ,也可以是集合或 Fuzzy数 ,因此都可看成格值信息系统 .在有限 Boole格上 ,利用上、下近似定义了粗糙集模型 ,得到了与Pawlak粗糙集模型类似的一些性质 ,证明... 粗糙集理论是解决分类问题的一种数学方法 .在信息系统中 ,属性值可以是数值 ,也可以是集合或 Fuzzy数 ,因此都可看成格值信息系统 .在有限 Boole格上 ,利用上、下近似定义了粗糙集模型 ,得到了与Pawlak粗糙集模型类似的一些性质 ,证明了该模型可以定义为一个完备的 Stone代数 ,这样就把现有的粗糙集模型推广到更一般的情形 . 展开更多
关键词 有限boole 等价关系 sTONE代数 粗糙集理论 代数结构 粗糙集模型
下载PDF
A New Formulation of Maxwell’s Equations in Clifford Algebra 被引量:1
9
作者 Pirooz Mohazzabi Norbert J. Wielenberg Gary Clark Alexander 《Journal of Applied Mathematics and Physics》 2017年第8期1575-1588,共14页
A new unification of the Maxwell equations is given in the domain of Clifford algebras with in a fashion similar to those obtained with Pauli and Dirac algebras. It is shown that the new electromagnetic field multivec... A new unification of the Maxwell equations is given in the domain of Clifford algebras with in a fashion similar to those obtained with Pauli and Dirac algebras. It is shown that the new electromagnetic field multivector can be obtained from a potential function that is closely related to the scalar and the vector potentials of classical electromagnetics. Additionally it is shown that the gauge transformations of the new multivector and its potential function and the Lagrangian density of the electromagnetic field are in agreement with the transformation rules of the second-rank antisymmetric electromagnetic field tensor, in contrast to the results obtained by applying other versions of Clifford algebras. 展开更多
关键词 CLIFFORD algebra Maxwell’s EQUATIONs Electromagnetism VECTOR POTENTIAL
下载PDF
有界关联BCK-代数与Boole代数 被引量:2
10
作者 程业宏 《黄冈师专学报》 1997年第4期17-19,共3页
主要证明了有界关联BCK一代数与Boole代数是相互等价的代数系统.
关键词 有界关联 BCK-代数 boole代数 等价性
下载PDF
Contractions of Certain Lie Algebras in the Context of the DLF-Theory
11
作者 Alexander Levichev Oleg Sviderskiy 《Advances in Pure Mathematics》 2014年第1期1-10,共10页
Contractions of the Lie algebras d = u(2), f = u(1 ,1) to the oscillator Lie algebra l are realized via the adjoint action of SU(2,2) when d, l, f are viewed as subalgebras of su(2,2). Here D, L, F are the correspondi... Contractions of the Lie algebras d = u(2), f = u(1 ,1) to the oscillator Lie algebra l are realized via the adjoint action of SU(2,2) when d, l, f are viewed as subalgebras of su(2,2). Here D, L, F are the corresponding (four-dimensional) real Lie groups endowed with bi-invariant metrics of Lorentzian signature. Similar contractions of (seven-dimensional) isometry Lie algebras iso(D), iso(F) to iso(L) are determined. The group SU(2,2) acts on each of the D, L, F by conformal transformation which is a core feature of the DLF-theory. Also, d and f are contracted to T, S-abelian subalgebras, generating parallel translations, T, and proper conformal transformations, S (from the decomposition of su(2,2) as a graded algebra T + Ω + S, where Ω is the extended Lorentz Lie algebra of dimension 7). 展开更多
关键词 LIE algebras with Invariant LORENTZIAN Forms LORENTZIAN symmetric spaces CONTRACTIONs of LIE algebras Conformal LIE algebra segal’s Chronometric Theory DLF-Theory
下载PDF
Boole代数与双格半群
12
作者 王文良 《西华师范大学学报(自然科学版)》 2004年第2期156-158,共3页
指出Boole代数类是双格半群类的真子类;有限Boole代数类是F 格半群类的真子类;当格群是Boole代数时,该格群一定是平凡的,同时给出一个双格半群(S, ,≤)是Boole代数的充要条件是:1 0∈S, x∈S,0≤x,0 x=x 0=x;2 x,y∈S,(x⊙y) x=x;3 x... 指出Boole代数类是双格半群类的真子类;有限Boole代数类是F 格半群类的真子类;当格群是Boole代数时,该格群一定是平凡的,同时给出一个双格半群(S, ,≤)是Boole代数的充要条件是:1 0∈S, x∈S,0≤x,0 x=x 0=x;2 x,y∈S,(x⊙y) x=x;3 x∈S, x′∈S,x⊙x′=x;4 x,y,z∈S,x y=x z,x⊙y=x⊙z x=y. 展开更多
关键词 Boo1e代数 双格半群 F-格半群 格群
下载PDF
Solvability of Chandrasekhar’s Quadratic Integral Equations in Banach Algebra
13
作者 Hind H. G. Hashem Aml A. Alhejelan 《Applied Mathematics》 2017年第6期846-856,共11页
In this paper, we prove some results concerning the existence of solutions for some nonlinear functional-integral equations which contain various integral and functional equations that are considered in nonlinear anal... In this paper, we prove some results concerning the existence of solutions for some nonlinear functional-integral equations which contain various integral and functional equations that are considered in nonlinear analysis. Our considerations will be discussed in Banach algebra using a fixed point theorem instead of using the technique of measure of noncompactness. An important special case of that functional equation is Chandrasekhar’s integral equation which appears in radiative transfer, neutron transport and the kinetic theory of gases [1]. 展开更多
关键词 Nonlinear OPERATORs BANACH algebra Chandrasekhar’s INTEGRAL Equations
下载PDF
Cohomology of Weakly Reducible Maximal Triangular Algebras
14
作者 董浙 鲁世杰 《Northeastern Mathematical Journal》 CSCD 2000年第3期299-306,共8页
In this paper, we introduce the concept of weakly reducible maxi mal triangular algebras S*!which form a large class of maximal t riangular algebras. Let B be a weakly closed algebra containing S, we prove that the co... In this paper, we introduce the concept of weakly reducible maxi mal triangular algebras S*!which form a large class of maximal t riangular algebras. Let B be a weakly closed algebra containing S, we prove that the cohomology spaces Hn(S , B) ( n≥1) are trivial. 展开更多
关键词 weakly reducible maximal triangular algebra cohomology s pace
下载PDF
The Continuous Analogy of Newton’s Method for Solving a System of Linear Algebraic Equations
15
作者 Tugal Zhanlav Ochbadrakh Chuluunbaatar Gantumur Ankhbayar 《Applied Mathematics》 2013年第1期210-216,共7页
We propose a continuous analogy of Newton’s method with inner iteration for solving a system of linear algebraic equations. Implementation of inner iterations is carried out in two ways. The former is to fix the numb... We propose a continuous analogy of Newton’s method with inner iteration for solving a system of linear algebraic equations. Implementation of inner iterations is carried out in two ways. The former is to fix the number of inner iterations in advance. The latter is to use the inexact Newton method for solution of the linear system of equations that arises at each stage of outer iterations. We give some new choices of iteration parameter and of forcing term, that ensure the convergence of iterations. The performance and efficiency of the proposed iteration is illustrated by numerical examples that represent a wide range of typical systems. 展开更多
关键词 CONTINUOUs ANALOGY of Newton’s Method sOLVING the system of Linear algebraIC Equations Convergence CHOICE of ITERATION Parameter
下载PDF
Two properties of sequence of vector measures on effect algebras
16
作者 LIN Qing-shui LI Rong-lu 《Applied Mathematics(A Journal of Chinese Universities)》 SCIE CSCD 2010年第4期475-480,共6页
Let (L, ,0, 1) be an effect algebra and let X be a Banach space. A function : L→ X is called a vector measure if μ(a b) =μ(a) + μ(b) whenever a⊥b in L. The function μ is said to be 8-bounded if limn... Let (L, ,0, 1) be an effect algebra and let X be a Banach space. A function : L→ X is called a vector measure if μ(a b) =μ(a) + μ(b) whenever a⊥b in L. The function μ is said to be 8-bounded if limn→∞μ(an) = 0 in X for any orthogonal sequence (an)n∈N in L. In this paper, we introduce two properties of sequence of s-bounded vector measures and give some results on these properties. 展开更多
关键词 Effect algebra s-bounded vector measure.
下载PDF
ALGEBRAIC EXTENSION OF *-A OPERATOR
17
作者 左红亮 左飞 《Acta Mathematica Scientia》 SCIE CSCD 2014年第6期1885-1891,共7页
In this paper, we study various properties of algebraic extension of *-A operator.Specifically, we show that every algebraic extension of *-A operator has SVEP and is isoloid.And if T is an algebraic extension of *... In this paper, we study various properties of algebraic extension of *-A operator.Specifically, we show that every algebraic extension of *-A operator has SVEP and is isoloid.And if T is an algebraic extension of *-A operator, then Weyl's theorem holds for f(T), where f is an analytic functions on some neighborhood of σ(T) and not constant on each of the components of its domain. 展开更多
关键词 algebraic extension of *-A operator sVEP isoloid Weyl's theorem
下载PDF
一种AES S盒改进方案及其硬件设计
18
作者 钟鑫林 吴新春 《计算机应用研究》 CSCD 北大核心 2023年第12期3784-3788,共5页
为提高高级加密标准(advanced encryption standard, AES)算法的安全性,提出了一种新的S盒生成方案。在分析了现有S盒存在的问题后,基于S盒的构造原理和密码学性质,通过选择新的不可约多项式和仿射变换对,同时调整仿射变换与乘法逆的运... 为提高高级加密标准(advanced encryption standard, AES)算法的安全性,提出了一种新的S盒生成方案。在分析了现有S盒存在的问题后,基于S盒的构造原理和密码学性质,通过选择新的不可约多项式和仿射变换对,同时调整仿射变换与乘法逆的运算顺序,构造出一种新的S盒;对生成的新S盒与AES的S盒以及其他改进S盒在代数式项数、严格雪崩标准距离等方面进行了比较,结果显示,新S盒具有更好的代数性质,能够有效抵御代数攻击;还对新S盒进行了硬件设计并优化,DC综合结果显示新S盒复域优化实现消耗的资源比传统复域实现少12%,比查找表法实现少41%。新S盒在安全性方面优于现有S盒,将其应用于AES软件设计和硬件设计,并通过仿真测试验证了其正确性。 展开更多
关键词 AEs s 严格雪崩准则距离 仿射变换 代数性质 硬件设计
下载PDF
Algebraic Cryptanalysis of GOST Encryption Algorithm
19
作者 Ludmila Babenko Ekaterina Maro 《Journal of Computer and Communications》 2014年第4期10-17,共8页
This paper observes approaches to algebraic analysis of GOST 28147-89 encryption algorithm (also known as simply GOST), which is the basis of most secure information systems in Russia. The general idea of algebraic an... This paper observes approaches to algebraic analysis of GOST 28147-89 encryption algorithm (also known as simply GOST), which is the basis of most secure information systems in Russia. The general idea of algebraic analysis is based on the representation of initial encryption algorithm as a system of multivariate quadratic equations, which define relations between a secret key and a cipher text. Extended linearization method is evaluated as a method for solving the nonlinear sys- tem of equations. 展开更多
关键词 ENCRYPTION Algorithm GOsT GOsT s-BOX systems of MULTIVARIATE Quadratic Equations algebraIC CRYPTANALYsIs Extended LINEARIZATION Method Gaussian Elimination
下载PDF
Shift, the Law of the Invention of Zero
20
作者 Emmanuel Cadier Anaxhaoza 《Advances in Pure Mathematics》 2023年第5期237-249,共13页
After posing the axiom of linear algebra, the author develops how this allows the calculation of arbitrary base powers, which provides an instantaneous calculation of powers in a particular base such as base ten;first... After posing the axiom of linear algebra, the author develops how this allows the calculation of arbitrary base powers, which provides an instantaneous calculation of powers in a particular base such as base ten;first of all by developing the any base calculation of these powers, then by calculating triangles following the example of the “arithmetical” triangle of Pascal and showing how the formula of the binomial of Newton is driving the construction. The author also develops the consequences of the axiom of linear algebra for the decimal writing of numbers and the result that this provides for the calculation of infinite sums of the inverse of integers to successive powers. Then the implications of these new forms of calculation on calculator technologies, with in particular the storage of triangles which calculate powers in any base and the use of a multiplication table in a very large canonical base are discussed. 展开更多
关键词 AXIOM Axiom of Linear algebra {ALA} Any Base Calculation ABC Theory Number’s Origin Number Theory Newton’s Binomial Formula Pascal’s Triangle Base Z Canonical Bases Calculator Revolution Infinite sums of Inverse of Integer to the successive Powers Information Completion Theory Cipher Factorizations That Are Numbers Infinite Numbers That Are Infinite sums
下载PDF
上一页 1 2 11 下一页 到第
使用帮助 返回顶部