全文获取类型
收费全文 | 1246篇 |
免费 | 142篇 |
国内免费 | 132篇 |
专业分类
电工技术 | 28篇 |
综合类 | 132篇 |
化学工业 | 6篇 |
金属工艺 | 14篇 |
机械仪表 | 50篇 |
建筑科学 | 6篇 |
矿业工程 | 8篇 |
轻工业 | 10篇 |
石油天然气 | 9篇 |
武器工业 | 2篇 |
无线电 | 210篇 |
一般工业技术 | 55篇 |
冶金工业 | 4篇 |
原子能技术 | 2篇 |
自动化技术 | 984篇 |
出版年
2024年 | 3篇 |
2023年 | 13篇 |
2022年 | 23篇 |
2021年 | 28篇 |
2020年 | 20篇 |
2019年 | 32篇 |
2018年 | 16篇 |
2017年 | 34篇 |
2016年 | 41篇 |
2015年 | 38篇 |
2014年 | 59篇 |
2013年 | 61篇 |
2012年 | 94篇 |
2011年 | 86篇 |
2010年 | 81篇 |
2009年 | 81篇 |
2008年 | 79篇 |
2007年 | 85篇 |
2006年 | 78篇 |
2005年 | 88篇 |
2004年 | 53篇 |
2003年 | 42篇 |
2002年 | 41篇 |
2001年 | 37篇 |
2000年 | 47篇 |
1999年 | 50篇 |
1998年 | 27篇 |
1997年 | 31篇 |
1996年 | 24篇 |
1995年 | 23篇 |
1994年 | 16篇 |
1993年 | 14篇 |
1992年 | 9篇 |
1991年 | 15篇 |
1990年 | 14篇 |
1989年 | 8篇 |
1988年 | 6篇 |
1987年 | 2篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1983年 | 1篇 |
1982年 | 3篇 |
1981年 | 2篇 |
1980年 | 3篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1973年 | 1篇 |
排序方式: 共有1520条查询结果,搜索用时 15 毫秒
1.
Stream ciphers based on linear feedback shift register (LFSR) are suitable for constrained environments, such as satellite communications, radio frequency identification devices tag, sensor networks and Internet of Things, due to its simple hardware structures, high speed encryption and lower power consumption. LFSR, as a cryptographic primitive, has been used to generate a maximum period sequence. Because the switching of the status bits is regular, the power consumption of the LFSR is correlated in a linear way. As a result, the power consumption characteristics of stream cipher based on LFSR are vulnerable to leaking initialization vectors under the power attacks. In this paper, a new design of LFSR against power attacks is proposed. The power consumption characteristics of LFSR can be masked by using an additional LFSR and confused by adding a new filter Boolean function and a flip-flop. The design method has been implemented easily by circuits in this new design in comparison with the others. 相似文献
2.
Boole函数的线性可分性是前向人工神经网络理论中的一个比较困难的问题之一。目前仅对变量数n≤7的某些问题给予讨论。当n≥8时,尚无判别Boole函数线性可分的一般准则,更无线性可分Boole函数的计数公式。基于此,本文详细地研究了与Boole函数线性可分性有关的n-维超立方体的基本理论,包括n-维超立方体的基本性质、超立方体中的平行线、子超立方体的计数等,并给出了构造n-维超立方体图的一种新方法。 相似文献
3.
A revision algorithm is a learning algorithm that identifies the target concept, starting from an initial concept. Such an algorithm is considered efficient if its complexity (in terms of the resource one is interested in) is polynomial in the syntactic distance between the initial and the target concept, but only polylogarithmic in the number of variables in the universe. We give an efficient revision algorithm in the model of learning with equivalence and membership queries for threshold functions, and some negative results showing, for instance, that threshold functions cannot be revised efficiently from either type of query alone. The algorithms work in a general revision model where both deletion and addition type revision operators are allowed. 相似文献
4.
5.
We present a two-sorted algebra, called aPeirce algebra, of relations and sets interacting with each other. In a Peirce algebra, sets can combine with each other as in a Boolean algebra, relations can combine with each other as in a relation algebra, and in addition we have both a set-forming operator on relations (the Peirce product of Boolean modules) and a relation-forming operator on sets (a cylindrification operation). Two applications of Peirce algebras are given. The first points out that Peirce algebras provide a natural algebraic framework for modelling certain programming constructs. The second shows that the so-calledterminological logics arising in knowledge representation have evolved a semantics best described as a calculus of relations interacting with sets. 相似文献
6.
J. C. Sevy 《Calcolo》1993,30(1):41-68
Explicit error estimates are given for the iterated Boolean sum of a sequence of simultaneous approximants; the rate of convergence
is shown to be improved for smooth functions. The general results are applied in the case of the Bernstein, Durrmeyer and
Stancu operators. 相似文献
7.
关于布尔函数的二次逼近 总被引:2,自引:0,他引:2
本文首先利用矩阵形式引入了二阶walsh谱的概念并讨论了其性质,其次引入了二次bent函数的概念,同时论述了二次bent函数的密码学意义。 相似文献
8.
本文研究了加法复合布尔函数和乘法复合布尔函数,在平衡性、k次项系数、K次扩散准则(PC)、相关免疫 性(CI)、Walsh谱、代数次数、小项分布等方面得到了一批新结果。 相似文献
9.
B. E. Rytsar 《Cybernetics and Systems Analysis》2007,43(2):192-207
The paper considers the set-theoretical approach to the joint decomposition of systems of Boolean functions of variables specified
in different representation forms. The approach is based on the method of q-partitions of conjuncterms and concept of decomposition
clones. Theorems on joint decomposition of a system of full and partial functions are formulated. The approach is illustrated
by examples.
Parts I and II of this article are published in No. 5 (2001) and No. 1 (2002).
__________
Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 39–58, March–April 2007. 相似文献
10.
X3SAT最大海明距离问题是指对于一个X3SAT问题实例,寻找该问题的任意两组可满足赋值之间的最大海明距离。提出了一个基于DPLL的精确算法HMX来求解X3SAT最大海明距离问题,根据公式中某个变量在两组真值赋值中的不同取值进行分支。给出了多种化简规则,这些规则很好地提高了算法的时间效率。证明了该算法可以将X3SAT最大海明距离问题的最小上界由目前最好的O(1.7107n)缩小到O(1.6760n),其中n为公式中变量的数目。 相似文献