全文获取类型
收费全文 | 2405篇 |
免费 | 159篇 |
国内免费 | 138篇 |
专业分类
电工技术 | 108篇 |
综合类 | 160篇 |
化学工业 | 188篇 |
金属工艺 | 152篇 |
机械仪表 | 178篇 |
建筑科学 | 65篇 |
矿业工程 | 25篇 |
能源动力 | 32篇 |
轻工业 | 82篇 |
水利工程 | 9篇 |
石油天然气 | 44篇 |
武器工业 | 9篇 |
无线电 | 312篇 |
一般工业技术 | 269篇 |
冶金工业 | 38篇 |
原子能技术 | 35篇 |
自动化技术 | 996篇 |
出版年
2024年 | 6篇 |
2023年 | 18篇 |
2022年 | 35篇 |
2021年 | 51篇 |
2020年 | 50篇 |
2019年 | 51篇 |
2018年 | 72篇 |
2017年 | 68篇 |
2016年 | 64篇 |
2015年 | 72篇 |
2014年 | 120篇 |
2013年 | 158篇 |
2012年 | 174篇 |
2011年 | 190篇 |
2010年 | 132篇 |
2009年 | 157篇 |
2008年 | 121篇 |
2007年 | 126篇 |
2006年 | 121篇 |
2005年 | 109篇 |
2004年 | 96篇 |
2003年 | 84篇 |
2002年 | 76篇 |
2001年 | 58篇 |
2000年 | 52篇 |
1999年 | 62篇 |
1998年 | 72篇 |
1997年 | 43篇 |
1996年 | 34篇 |
1995年 | 38篇 |
1994年 | 36篇 |
1993年 | 30篇 |
1992年 | 24篇 |
1991年 | 20篇 |
1990年 | 10篇 |
1989年 | 18篇 |
1988年 | 9篇 |
1987年 | 7篇 |
1986年 | 4篇 |
1985年 | 3篇 |
1984年 | 7篇 |
1983年 | 5篇 |
1982年 | 6篇 |
1979年 | 3篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1976年 | 2篇 |
1975年 | 1篇 |
1974年 | 1篇 |
1973年 | 1篇 |
排序方式: 共有2702条查询结果,搜索用时 0 毫秒
51.
Cellular automata are used to model dynamical phenomena by focusing on their local behavior which depends on the neighboring cells in order to express their global behavior. The geometrical structure of the models suggests the algebraic structure of cellular automata. After modeling the dynamical phenomena, it is sometimes an important problem to be able to move backwards in order to understand it better. This is only possible if cellular automata is reversible. In this paper, 2D finite cellular automata defined by local rules based on hexagonal cell structure are studied. Rule matrix of the hexagonal finite cellular automaton is obtained. The rank of rule matrices representing the 2D hexagonal finite cellular automata via an algorithm is computed. It is a well known fact that determining the reversibility of a 2D cellular automata is a very difficult problem in general. Here, the reversibility problem of this family of 2D hexagonal cellular automata is also resolved completely. 相似文献
52.
53.
Matthew R. Graham Author Vitae Author Vitae Raymond A. de Callafon Author Vitae 《Automatica》2009,45(6):1489-1496
This paper introduces an alternative formulation of the Kalman-Yakubovich-Popov (KYP) Lemma, relating an infinite dimensional Frequency Domain Inequality (FDI) to a pair of finite dimensional Linear Matrix Inequalities (LMI). It is shown that this new formulation encompasses previous generalizations of the KYP Lemma which hold in the case the coefficient matrix of the FDI does not depend on frequency. In addition, it allows the coefficient matrix of the frequency domain inequality to vary affinely with the frequency parameter. One application of this results is illustrated in an example of computing upper bounds to the structured singular value with frequency-dependent scalings. 相似文献
54.
Sebastian Dörn 《Information Processing Letters》2009,109(6):325-328
In this paper we give tight quantum query complexity bounds of some important linear algebra problems. We prove Θ(n2) quantum query bounds for verify the determinant, rank, matrix inverse and the matrix power problem. 相似文献
55.
56.
57.
58.
传统的推荐系统往往是通过使用协同过滤或基于内容的方式来实现的,而文中将矩阵完整化的方法应用到推荐系统中。由于数据的稀疏性,直接使用矩阵完整化的方法会给推荐结果带来不小的误差。考虑到使用用户中存在一些活跃用户,挖掘出这些特殊用户,由他们组成的数据会降低稀疏性,而且对活跃用户提高 推荐质量,会产生更大的商业价值。提出了一种分块整合推荐的方法,实验结果表明该方法能够提升推荐精度。 相似文献
59.
Differential Matrix Riccati Equations (DMREs) appear in several branches of science such as applied physics and engineering. For example, these equations play a fundamental role in control theory, optimal control, filtering and estimation, decoupling and order reduction, etc. In this paper a new method based on a theorem proved in this paper is described for solving DMREs by a piecewise-linearized approach. This method is applied for developing two block-oriented algorithms based on diagonal Padé approximants. MATLAB versions of the above algorithms are developed, comparing, under equal conditions, accuracy and computational costs with other piecewise-linearized algorithms implemented by the authors. Experimental results show the advantages of solving stiff or non-stiff DMREs by the implemented algorithms. 相似文献
60.
We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case, our algorithm supports rank-one updates in O(n2logn) randomized time and queries in constant time, whereas in the general case the algorithm works in O(n2klogn) randomized time, where k is the number of invariant factors of the matrix. The algorithm is based on the first dynamic algorithm for computing normal forms of a matrix such as the Frobenius normal form or the tridiagonal symmetric form. The algorithm can be extended to solve the matrix eigenproblem with relative error 2−b in additional O(nlog2nlogb) time. Furthermore, it can be used to dynamically maintain the singular value decomposition (SVD) of a generic matrix. Together with the algorithm, the hardness of the problem is studied. For the symmetric case, we present an Ω(n2) lower bound for rank-one updates and an Ω(n) lower bound for element updates. 相似文献