期刊文献+
共找到1,825篇文章
< 1 2 92 >
每页显示 20 50 100
Sea-based JPALS ionospheric gradient monitoring based on multi-reference Boolean collaborative decision rule 认领 引用
1
作者 Xin Xu Liang Li +3 位作者 Jiachang Jiang Yilin Wei Ruifan Tang Xiuyun Shi 《Satellite Navigation》 SCIE EI CSCD 2026年第1期343-366,I0007,共24页
Anomalous ionospheric gradients are hazardous to the integrity of precision approach operations supported by Sea Based Joint Precision Approach and Landing System(SB-JPALS).Carrier phase measurements collected from mu... Anomalous ionospheric gradients are hazardous to the integrity of precision approach operations supported by Sea Based Joint Precision Approach and Landing System(SB-JPALS).Carrier phase measurements collected from mul tiple short-baseline reference receivers are widely utilized to detect the threat of ionospheric gradients.However,the conventional carrier phase-based monitoring methods are vulnerable to the undetectable dead zones caused by ambiguity resolution failure,thereby degrading both navigation integrity and continuity.To mitigate the impact of ambiguity resolution failure on ionospheric gradient monitoring,a novel monitoring method based on the Boolean collaborative decision rule is proposed.The integrity risk and continuity risk associated with incorrect ambiguity reso lution can be effectively bounded by adjusting the collaborative decision threshold.Dynamic experiments conducted using BeiDou Navigation Satellite System(BDS)demonstrate that the impact of ambiguity resolution failure can be isolated so that the undetectable dead zones can be eliminated.Furthermore,the proposed method improves moni toring sensitivity by 12%compared with conventional monitoring methods. 展开更多
关键词 SB-JPALS Integrity monitoring Ionospheric gradient Receiver array Boolean collaborative decision rule
BFROU: A Reconfigurable Operation Unit Design Approach Using NPN Equivalence and Reed-Muller Logic Unit for Boolean Functions in Stream Ciphers 认领 引用
2
作者 Zhaoxu Zhou Yanjiang Liu +1 位作者 Zibin Dai Junwei Li 《Computers, Materials & Continua》 SCIE EI 2026年第8期806-832,共27页
Stream ciphers are simple to implement and fast at encrypting and decrypting data,making them very important in information security.Boolean functions are a core part of stream ciphers.However,their mainstream hardwar... Stream ciphers are simple to implement and fast at encrypting and decrypting data,making them very important in information security.Boolean functions are a core part of stream ciphers.However,their mainstream hardware implementations face two main problems,including wasted area resources and excessive critical path delay.These issues limit the energy efficiency and integration level of stream cipher chips.To address these problems,this paper proposes an energy-efficient design method for a 64-bit Boolean function reconfigurable operation unit(BFROU),aiming to improve the computational efficiency of Boolean functions in stream ciphers.To optimize the design of BFROU,this paper takes the NPN equivalence theory as a guide.First,customized designs at the transistor level were performed for both 2-and 3-variable RM logic units(denoted as TRM).On this basis,this paper uses the port sharing strategy to further optimize the design of 4-to-6-variable TRM logic units and construct a multi-variable TRM process library.Then,by combining multi-variable TRM logic units with the mathematical definition of Boolean functions,this paper proposes a theoretical model of BFROU.Based on this model and combined with the statistical analysis results of Boolean functions,the optimal TRM unit configuration is determined,and the overall optimization of the 64-bit BFROU is finally completed.Experimental results show that when TRM-3 and TRM-4 units are mixed as the first-level operation module of BFROU,its area-delay product(ADP)reaches the minimum.The 64-bit BFROU unit implemented according to this scheme has an actual measured area of 137.28μm2 and a critical path delay of 0.278 ns under the SMIC 40 nm typical process corner.This unit supports Boolean function operations with up to 64 variables,and 94.4%of the functions can complete mapping within 2 iterations.Compared with existing schemes such as look-up table(LUT)architecture and And-Inverter Cone(AIC)array,the BFROU proposed in this paper has obvious advantages in area,delay,ADP and number of iterations,providing effective hardware support for the design of high-energy-efficiency stream cipher chips. 展开更多
关键词 Boolean function reconfigurable operation unit stream cipher TRM units NPN equivalence theory
暂未订购 下载PDF
BWSS:结合可疑集合簇计算极小碰集的Boolean算法 认领 引用
3
作者 赵相福 黄森 +3 位作者 魏霞 童向荣 欧阳丹彤 张立明 《软件学报》 EI CSCD 北大核心 2025年第7期3226-3238,共13页
在基于模型的诊断领域中,因为极小冲突集(minimal conflict set,MCS)的极小碰集(minimal hitting set,MHS)即为待诊断设备的候选诊断,所以计算极小碰集是候选诊断的一个关键步骤.其中,极小碰集是一个NPhard约束求解问题,随着问题规模增... 在基于模型的诊断领域中,因为极小冲突集(minimal conflict set,MCS)的极小碰集(minimal hitting set,MHS)即为待诊断设备的候选诊断,所以计算极小碰集是候选诊断的一个关键步骤.其中,极小碰集是一个NPhard约束求解问题,随着问题规模增大,求解难度成指数级增长.Boolean算法是计算极小碰集的经典算法,然在求解过程中,解集的极小化却占据运算的绝大部分时间.为了解决该问题并提升计算效率,提出了结合可疑集合簇计算极小碰集的BWSS(Boolean with suspicious sets)算法,通过深度分析Boolean算法生成树规则,找到使候选解成为超集的集合,在向根节点扩展元素时,如果候选解与可疑集合簇中至少1个集合交集为空,那么该解为极小候选解,否则删除该解,通过递归的策略保证算法结束时产生且仅产生所有极小碰集.除此之外,每个候选解在极小化时,至少存在m(m≥1)个元素甚至整个解无须极小化.理论上,BWSS算法的复杂度要远低于Boolean算法.通过随机数据及大量基准电路数据,实验结果表明,所提算法与目前最先进的几种算法相比,运行时间减少了几个数量级. 展开更多
关键词 基于模型诊断 极小碰集 Boolean算法 候选解 冲突集
暂未订购 下载PDF
Construction of Even-Variable 2-Output Almost Optimal Five-Valued Spectra Boolean Functions 认领 引用
4
作者 SONG Chao-Fan JI Yan-Han SUN Yu-Juan 《密码学报(中英文)》 CSCD 北大核心 2025年第3期714-728,共15页
Five-valued Boolean functions play an important role in the design of symmetric cryptography.While the design and properties of single-output almost optimal five-valued spectra Boolean functions have been extensively ... Five-valued Boolean functions play an important role in the design of symmetric cryptography.While the design and properties of single-output almost optimal five-valued spectra Boolean functions have been extensively studied over the past few decades,there has been limited research on the construction of almost optimal five-valued spectra vectorial Boolean functions.In this paper,we present a construction method for even-variable 2-output almost optimal five-valued spectra balanced Boolean functions,whose Walsh spectra values belong to the set{0,±2n/2,±2n/2+1},at the same time,we discuss the existence of sufficient conditions in the construction.Additionally,this paper presents a novel construction method for balanced single-output Boolean functions with even variables featuring a special five-valued spectral structure,whose Walsh spectra values are constrained to the set{0,±2n/2,±3·2n/2}.These functions provide new canonical examples for the study of Boolean function spectral theory. 展开更多
关键词 Boolean function Walsh transform semi-bent function five-valued function totally disjoint spectra functions
暂未订购 下载PDF
Boolean方阵的注记 认领 引用 被引量:1
5
作者 宋占杰 鹿玲娣 +2 位作者 刘丽霞 佟宏志 杜同凯 《河北师范大学学报(自然科学版)》 CAS 2000年第2期164-165,共2页
Discussed some properties of Boolean square matrices mainly.
关键词 Boolean向量 Boolean方阵 单位矩阵
暂未订购 下载PDF
广义Boolean-like环 认领 引用
6
作者 秦蕊 《杭州师范大学学报(自然科学版)》 CAS 2013年第2期119-123,共5页
广义Boolean-like环是Boolean-like环的一个推广,文章主要介绍了广义Boolean-like环的构建,从而列举了若干广义Boolean-like环的相关例子及基本性质.并且,考虑了广义Boolean-like环的部分扩张,如上三角矩阵环.
关键词 Boolean-like环 广义Boolean-like环 Boolean 幂等元 幂零元
暂未订购 下载PDF
J-Boolean like环 认领 引用
7
作者 秦蕊 《杭州师范大学学报(自然科学版)》 CAS 2013年第5期413-417,共5页
本文首先引进了Boolean-like环的一类新的扩张J-Boolean like环,即对任意环R中元素a,b都有(a-a2)(b-b2)∈J(R),这里J(R)为环R的Jacobson根,则环R称为J-Boolean like环.证明了两个定理分别为(1)设D是一个环,C是D的一个子环,R[D,C]是一个J... 本文首先引进了Boolean-like环的一类新的扩张J-Boolean like环,即对任意环R中元素a,b都有(a-a2)(b-b2)∈J(R),这里J(R)为环R的Jacobson根,则环R称为J-Boolean like环.证明了两个定理分别为(1)设D是一个环,C是D的一个子环,R[D,C]是一个J-Boolean like环(a)C,D是J-Boolean like环,(b)J2(C)■J(D).(2)如果B/J(B)是Boolean环,并且B[i]={a+bi|i2=ui+η,a,b,u,η∈B},那么B[i]是J-Boolean like环当且仅当uη∈J(B). 展开更多
关键词 Boolean Boolean-like环 J-Boolean like环 Jacobson根 R[D,C]环
暂未订购 下载PDF
原子Boolean格代数的模中有限秩算子的性质 认领 引用
8
作者 赵文玲 宋道金 《淄博学院学报(自然科学与工程版)》 2000年第4期11-15,共5页
本文对原子 Boolean格代数模中的有限秩算子进行了讨论,得到了一些结论,这些结论是子空间格代数中相应结论的推广 .
关键词 原子Boolean格代数 原子Boolean格代数的模 有限秩算子
暂未订购 下载PDF
A Class of Rotation Symmetric Boolean Functions with Optimum Algebraic Immunity 认领 引用 被引量:5
9
作者 LI Chunlei ZENG Xiangyong +1 位作者 SU Wei HU Lei 《Wuhan University Journal of Natural Sciences》 CAS 2008年第6期702-706,共5页
For an odd integer n ≥ 7, this paper presented a class of n-variable rotation symmetric Boolean functions (RSBFs) with optimum algebraic immunity. The nonlinearity of the constructed functions is determined.
关键词 rotation symmetric Boolean functions(RSBFs) algebraic immunity nonlinearity balancedness Krawtchouk polynomial
暂未订购 下载PDF
采用推理方法提高多面体Boolean运算的可靠性 认领 引用 被引量:4
10
作者 李新友 唐泽圣 孙家广 《软件学报》 北大核心 1991年第3期26-35,共10页
提高实体Boolean运算的可靠性是几何造型中最基本也是最迫切的工作。通过对国内外几何造型系统在实体Boolean运算可靠性方面的测试,我们发现,实体Boolean运算不可靠是一个普遍现象,运算失败的根本原因在于数值计算存在误差。数值计算误... 提高实体Boolean运算的可靠性是几何造型中最基本也是最迫切的工作。通过对国内外几何造型系统在实体Boolean运算可靠性方面的测试,我们发现,实体Boolean运算不可靠是一个普遍现象,运算失败的根本原因在于数值计算存在误差。数值计算误差决定了我们不能精确地确定集合成员分类。集合成员分类的结果与选定的计算容差有关,具 有相对性。从而相关分类之间会发生冲突。一旦分类之间发生冲突,Boolean运算就不能得到正确的结果。我们提出了一个相当可靠的Boolean运算算法。该算法采用推理的方法在进行Boolean运算之前解决由数值计算误差所引起的相关分类之间冲突。这些算法已在Apollo和SUN工作站上实现,并取代了GEMS 2.0造型系统,构成了一个新的造型系统GEMS 2.1。经测试和比较,这个系统的可靠性比SDRC公司的Geomod 3.9和Intergraph公司的I/EMS高得多。 展开更多
关键词 推理法 可靠性 几何造型 Boolean
暂未订购 下载PDF
多元Stancu算子的Boolean和迭代 认领 引用 被引量:3
11
作者 曹飞龙 王宏勇 《数学进展》 北大核心 2005年第5期600-608,共9页
定义单纯形上高维Stancu算子的Boolean和迭代算子并且研究它逼近连续函数的正定理、逆定理与饱和定理,得到了较高的逼近阶.
关键词 Stancu算子 Boolean 迭代算子 正定理 逆定理 饱和
暂未订购 下载PDF
Quantum Secure Multiparty Computation with Symmetric Boolean Functions 认领 引用 被引量:1
12
作者 Hao Cao Wenping Ma +2 位作者 Ge Liu Liangdong Lü Zheng-Yuan Xue 《Chinese Physics Letters》 SCIE EI CAS CSCD 2020年第5期10-14,共5页
We propose a class of n-variable Boolean functions which can be used to implement quantum secure multiparty computation.We also give an implementation of a special quantum secure multiparty computation protocol.An adv... We propose a class of n-variable Boolean functions which can be used to implement quantum secure multiparty computation.We also give an implementation of a special quantum secure multiparty computation protocol.An advantage of our protocol is that only 1 qubit is needed to compute the n-tuple pairwise AND function,which is more efficient comparing with previous protocols.We demonstrate our protocol on the IBM quantum cloud platform,with a probability of correct output as high as 94.63%.Therefore,our protocol presents a promising generalization in realization of various secure multipartite quantum tasks. 展开更多
关键词 computation. quantum Boolean
暂未订购 下载PDF
Set Stabilization of Large-Scale Stochastic Boolean Networks:A Distributed Control Strategy 认领 引用 被引量:1
13
作者 Lin Lin Jinde Cao +1 位作者 Jianquan Lu Leszek Rutkowski 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2024年第3期806-808,共3页
Dear Editor,This letter deals with the set stabilization of stochastic Boolean control networks(SBCNs)by the pinning control strategy,which is to realize the full control for systems by imposing control inputs on a fr... Dear Editor,This letter deals with the set stabilization of stochastic Boolean control networks(SBCNs)by the pinning control strategy,which is to realize the full control for systems by imposing control inputs on a fraction of agents. 展开更多
关键词 Boolean stabilization letter
暂未订购 下载PDF
Control of random Boolean networks via average sensitivity of Boolean functions 认领 引用 被引量:3
14
作者 陈士剑 洪奕光 《Chinese Physics B》 SCIE EI CAS CSCD 2011年第3期347-353,共7页
In this paper, we discuss how to transform the disordered phase into an ordered phase in random Boolean networks. To increase the effectiveness, a control scheme is proposed, which periodically freezes a fraction of t... In this paper, we discuss how to transform the disordered phase into an ordered phase in random Boolean networks. To increase the effectiveness, a control scheme is proposed, which periodically freezes a fraction of the network based on the average sensitivity of Boolean functions of the nodes. Theoretical analysis is carried out to estimate the expected critical value of the fraction, and shows that the critical value is reduced using this scheme compared to that of randomly freezing a fraction of the nodes. Finally, the simulation is given for illustrating the effectiveness of the proposed method. 展开更多
关键词 random Boolean network control average sensitivity
暂未订购 下载PDF
Boolean operations of STL models based on edge-facet intersection 认领 引用 被引量:1
15
作者 郭开波 张李超 +1 位作者 王从军 黄树槐 《Journal of Harbin Institute of Technology(New Series)》 EI CAS 2007年第5期711-717,共7页
For the data processing of the Rapid Prototyping Manufacturing, Boolean operation can offer a versatile tool for editing or modifying the STL model, adding the artificial construction, and creating the complex assista... For the data processing of the Rapid Prototyping Manufacturing, Boolean operation can offer a versatile tool for editing or modifying the STL model, adding the artificial construction, and creating the complex assistant support structure to meet the special technical requests. The topological structure of STL models was built firstly in order to obtain the neighborhood relationship among the triangular facets. The intersection test between every edge of one solid and every facet of another solid was taken to get the intersection points. According to the matching relationship of the triangle index recorded in the data structure of the intersection points, the intersection segments array and the intersection loop were traced out. Each intersected triangle was subdivided by the Constrained Delaunay Triangulations. The intersected surfaces were divided into several surface patches along the intersection loops. The inclusion prediction between the surface patch and the other solid was taken by testing whether the candidate point was inside or outside the solid region of the slice. Detecting the loops for determination of the valid intersection lines greatly increases the efficiency and the reliability of the process. 展开更多
关键词 STL model boolean operations segment-facet intersection loop detection Inclusion test
暂未订购 下载PDF
点态化完备代数正规类中的Jacobson代数和Boolean代数 认领 引用 被引量:6
16
作者 杨宗文 何青海 《理论数学》 2019年第9期1009-1014,共6页
定义了点态化完备代数正规类中的周期代数、Jacobson代数与Boolean代数,讨论了周期代数、Jacobson代数与Boolean代数的一些性质,证明了Jacobson代数类κ与Boolean代数类β都是遗传根类,但都不是超幂零根,从而都不是特殊根,并证明了正则... 定义了点态化完备代数正规类中的周期代数、Jacobson代数与Boolean代数,讨论了周期代数、Jacobson代数与Boolean代数的一些性质,证明了Jacobson代数类κ与Boolean代数类β都是遗传根类,但都不是超幂零根,从而都不是特殊根,并证明了正则根是遗传根,但不是超幂零根,从而不是特殊根。 展开更多
关键词 点态化完备代数正规类 周期代数 Jacobson代数 κ-根 Boolean代数 β-根 正则根
暂未订购 下载PDF
关于Boolean矩阵的加权广义逆 认领 引用 被引量:5
17
作者 张荣娥 《浙江大学学报(理学版)》 CAS 北大核心 2007年第3期241-244,共4页
对Boolean矩阵的各种加权广义逆进行了研究,主要研究了Boolean矩阵A的加权最小二乘广义逆(AM)l-和加权极小范数广义逆(AN)m-存在的几个等价条件,并用(AM)l-和(AN)m-给出了Boolean矩阵A的加权Moore-Penrose逆AM+N存在的几个条件和若干等... 对Boolean矩阵的各种加权广义逆进行了研究,主要研究了Boolean矩阵A的加权最小二乘广义逆(AM)l-和加权极小范数广义逆(AN)m-存在的几个等价条件,并用(AM)l-和(AN)m-给出了Boolean矩阵A的加权Moore-Penrose逆AM+N存在的几个条件和若干等价刻画. 展开更多
关键词 Boolean矩阵 广义逆 加权广义逆
暂未订购 下载PDF
基于Boolean编码的自下而上视觉显著性检测方法研究 认领 引用 被引量:1
18
作者 赵迪 王晓鹏 陈丹淇 《航天控制》 CSCD 北大核心 2017年第2期66-71,共6页
提出了一种利用Boolean编码的二值特征自下而上视觉显著性检测方法。该方法是基于视觉注意的Boolean分布图理论而提出的,同时结合多特征通道(如CIELab颜色空间),利用二进制值(即0/1)编码每个像素,以表征场景视觉认知的位置分布信息。根... 提出了一种利用Boolean编码的二值特征自下而上视觉显著性检测方法。该方法是基于视觉注意的Boolean分布图理论而提出的,同时结合多特征通道(如CIELab颜色空间),利用二进制值(即0/1)编码每个像素,以表征场景视觉认知的位置分布信息。根据显著区域和背景区域间各维度的Boolean编码的不同分布,通过低秩分解实现显著性检测。该模型不仅很容易实现,而且通过在2个公开的基准数据库中进行的实验结果表明该方法有效。 展开更多
关键词 自下而上 视觉显著性 Boolean编码 低秩分解
暂未订购 下载PDF
A general Boolean semantic modelling approach for complex and intelligent industrial systems in the framework of DES 认领 引用 被引量:1
19
作者 XU Changyi WANG Yun +1 位作者 DUAN Yiman ZHANG Chao 《Journal of Systems Engineering and Electronics》 SCIE CSCD 2024年第5期1219-1230,共12页
Discrete event system(DES)models promote system engineering,including system design,verification,and assessment.The advancement in manufacturing technology has endowed us to fabricate complex industrial systems.Conseq... Discrete event system(DES)models promote system engineering,including system design,verification,and assessment.The advancement in manufacturing technology has endowed us to fabricate complex industrial systems.Consequently,the adoption of advanced modeling methodologies adept at handling complexity and scalability is imperative.Moreover,industrial systems are no longer quiescent,thus the intelligent operations of the systems should be dynamically specified in the model.In this paper,the composition of the subsystem behaviors is studied to generate the complexity and scalability of the global system model,and a Boolean semantic specifying algorithm is proposed for generating dynamic intelligent operations in the model.In traditional modeling approaches,the change or addition of specifications always necessitates the complete resubmission of the system model,a resource-consuming and error-prone process.Compared with traditional approaches,our approach has three remarkable advantages:(i)an established Boolean semantic can be fitful for all kinds of systems;(ii)there is no need to resubmit the system model whenever there is a change or addition of the operations;(iii)multiple specifying tasks can be easily achieved by continuously adding a new semantic.Thus,this general modeling approach has wide potential for future complex and intelligent industrial systems. 展开更多
关键词 industrial complex system operation specifying Boolean semantic discrete event system(DES)theory intelligent operation
暂未订购 下载PDF
Quantale上的Boolean子代数 认领 引用 被引量:1
20
作者 潘芳芳 王顺钦 《南阳师范学院学报》 CAS 2008年第12期8-9,共2页
给出了单位Quantale上的Boolean子代数的概念,并讨论了Boolean子代数若干性质;同时介绍了左(右)保持元和左(右)零化子,并研究了最小左保持与最大左零化子限制在完备Boolean子代数上两者之间的关系.
关键词 Quantale Boolean子代数 左保持元 左零化子
暂未订购 下载PDF
上一页 1 2 92 下一页 到第
在线咨询 使用帮助 返回顶部 意见反馈