全文获取类型
收费全文 | 2659篇 |
免费 | 226篇 |
国内免费 | 191篇 |
专业分类
电工技术 | 52篇 |
综合类 | 371篇 |
化学工业 | 21篇 |
金属工艺 | 17篇 |
机械仪表 | 119篇 |
建筑科学 | 15篇 |
矿业工程 | 12篇 |
能源动力 | 8篇 |
轻工业 | 45篇 |
水利工程 | 2篇 |
石油天然气 | 14篇 |
武器工业 | 8篇 |
无线电 | 284篇 |
一般工业技术 | 153篇 |
冶金工业 | 16篇 |
原子能技术 | 9篇 |
自动化技术 | 1930篇 |
出版年
2024年 | 5篇 |
2023年 | 16篇 |
2022年 | 24篇 |
2021年 | 22篇 |
2020年 | 27篇 |
2019年 | 48篇 |
2018年 | 25篇 |
2017年 | 60篇 |
2016年 | 61篇 |
2015年 | 86篇 |
2014年 | 121篇 |
2013年 | 136篇 |
2012年 | 168篇 |
2011年 | 178篇 |
2010年 | 144篇 |
2009年 | 176篇 |
2008年 | 171篇 |
2007年 | 179篇 |
2006年 | 169篇 |
2005年 | 140篇 |
2004年 | 116篇 |
2003年 | 103篇 |
2002年 | 88篇 |
2001年 | 78篇 |
2000年 | 84篇 |
1999年 | 87篇 |
1998年 | 79篇 |
1997年 | 63篇 |
1996年 | 52篇 |
1995年 | 63篇 |
1994年 | 43篇 |
1993年 | 50篇 |
1992年 | 44篇 |
1991年 | 27篇 |
1990年 | 33篇 |
1989年 | 17篇 |
1988年 | 16篇 |
1987年 | 9篇 |
1986年 | 11篇 |
1985年 | 4篇 |
1984年 | 9篇 |
1983年 | 6篇 |
1982年 | 7篇 |
1981年 | 10篇 |
1980年 | 5篇 |
1979年 | 2篇 |
1978年 | 4篇 |
1977年 | 7篇 |
1975年 | 1篇 |
1973年 | 1篇 |
排序方式: 共有3076条查询结果,搜索用时 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.
3.
Boole函数的线性可分性是前向人工神经网络理论中的一个比较困难的问题之一。目前仅对变量数n≤7的某些问题给予讨论。当n≥8时,尚无判别Boole函数线性可分的一般准则,更无线性可分Boole函数的计数公式。基于此,本文详细地研究了与Boole函数线性可分性有关的n-维超立方体的基本理论,包括n-维超立方体的基本性质、超立方体中的平行线、子超立方体的计数等,并给出了构造n-维超立方体图的一种新方法。 相似文献
4.
二维谐振子与二维氢原子的能量及波函数 总被引:4,自引:0,他引:4
借助于SU(1,1)代数,找出了二维谐振子与二维氢原子的能量及波函数间的关系. 相似文献
5.
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. 相似文献
6.
7.
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. 相似文献
8.
Modal Logic, Transition Systems and Processes 总被引:2,自引:0,他引:2
BENTHEM JOHAN VAN; EIJCK JAN VAN; STEBLETSOVA VERA 《Journal of Logic and Computation》1994,4(5):811-855
9.
The general mixed μ problem has been shown to be NP hard, so that the exact solution of the general problem is computationally intractable, except for small problems. In this paper we consider not the general problem, but a particular special case of this problem, the rank one mixed μ problem. We show that for this case the mixed μ problem is equivalent to its upper bound (which is convex), and it can in fact be computed easily (and exactly). This special case is shown to be equivalent to the so-called ‘affine parameter variation’ problem (for a polynomial with perturbed coefficients) which has been examined in detail in the literature, and for which several celebrated ‘Kharitonov-type’ results have been proven. 相似文献
10.