全文获取类型
收费全文 | 4525篇 |
免费 | 245篇 |
国内免费 | 55篇 |
专业分类
电工技术 | 13篇 |
综合类 | 69篇 |
化学工业 | 651篇 |
金属工艺 | 88篇 |
机械仪表 | 159篇 |
建筑科学 | 274篇 |
矿业工程 | 34篇 |
能源动力 | 321篇 |
轻工业 | 38篇 |
水利工程 | 44篇 |
石油天然气 | 13篇 |
武器工业 | 12篇 |
无线电 | 147篇 |
一般工业技术 | 434篇 |
冶金工业 | 71篇 |
原子能技术 | 51篇 |
自动化技术 | 2406篇 |
出版年
2024年 | 11篇 |
2023年 | 47篇 |
2022年 | 70篇 |
2021年 | 70篇 |
2020年 | 122篇 |
2019年 | 115篇 |
2018年 | 107篇 |
2017年 | 145篇 |
2016年 | 184篇 |
2015年 | 228篇 |
2014年 | 304篇 |
2013年 | 260篇 |
2012年 | 195篇 |
2011年 | 390篇 |
2010年 | 262篇 |
2009年 | 351篇 |
2008年 | 315篇 |
2007年 | 264篇 |
2006年 | 229篇 |
2005年 | 177篇 |
2004年 | 129篇 |
2003年 | 164篇 |
2002年 | 102篇 |
2001年 | 32篇 |
2000年 | 33篇 |
1999年 | 50篇 |
1998年 | 70篇 |
1997年 | 47篇 |
1996年 | 39篇 |
1995年 | 33篇 |
1994年 | 50篇 |
1993年 | 27篇 |
1992年 | 27篇 |
1991年 | 23篇 |
1990年 | 14篇 |
1989年 | 14篇 |
1988年 | 19篇 |
1987年 | 8篇 |
1986年 | 14篇 |
1985年 | 19篇 |
1984年 | 7篇 |
1983年 | 9篇 |
1982年 | 10篇 |
1981年 | 5篇 |
1980年 | 10篇 |
1979年 | 10篇 |
1978年 | 6篇 |
1977年 | 4篇 |
1976年 | 2篇 |
1973年 | 1篇 |
排序方式: 共有4825条查询结果,搜索用时 0 毫秒
101.
102.
103.
Paul E. Dunne 《Artificial Intelligence》2009,173(18):1559-1591
We analyse the computational complexity of the recently proposed ideal semantics within both abstract argumentation frameworks (afs) and assumption-based argumentation frameworks (abfs). It is shown that while typically less tractable than credulous admissibi-lity semantics, the natural decision problems arising with this extension-based model can, perhaps surprisingly, be decided more efficiently than sceptical preferred semantics. In particular the task of finding the unique ideal extension is easier than that of deciding if a given argument is accepted under the sceptical semantics. We provide efficient algorithmic approaches for the class of bipartite argumentation frameworks and, finally, present a number of technical results which offer strong indications that typical problems in ideal argumentation are complete for the class of languages decidable by polynomial time algorithms allowed to make non-adaptive queries to a C oracle, where C is an upper bound on the computational complexity of deciding credulous acceptance: C=np for afs and logic programming (lp) instantiations of abfs; for abfs modelling default theories. 相似文献
104.
Given a list of n items and a function defined over sub-lists, we study the space required for computing the function for arbitrary sub-lists in constant time.For the function mode we improve the previously known space bound O(n2/logn) to O(n2loglogn/log2n) words.For median the space bound is improved to O(n2loglog2n/log2n) words from O(n2⋅log(k)n/logn), where k is an arbitrary constant and log(k) is the iterated logarithm. 相似文献
105.
In this paper we describe and solve the following geometric optimisation problem: given a set S of n points on the plane (antennas) and two points A and B, find the smallest radial range r∈ℜ+ (power transmission range of the antennas) so that a path with endpoints A and B exists in which all points are within the range of at least two antennas. The solution to the problem has several applications (e.g., in the planning of safe routes). We present an O(nlogn) time solution, which is based on the second order Voronoi diagram. We also show how to obtain a path with such characteristics. 相似文献
106.
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. 相似文献
107.
We consider incompressible flow problems with defective boundary conditions prescribing only the net flux on some inflow and outflow sections of the boundary. As a paradigm for such problems, we simply refer to Stokes flow. After a brief review of the problem and of its well posedness, we discretize the corresponding variational formulation by means of finite elements and looking at the boundary conditions as constraints, we exploit a penalty method to account for them. We perform the analysis of the method in terms of consistency, boundedness and stability of the discrete bilinear form and we show that the application of the penalty method does not affect the optimal convergence properties of the finite element discretization. Since the additional terms introduced to account for the defective boundary conditions are non-local, we also analyze the spectral properties of the equivalent algebraic formulation and we exploit the analysis to set up an efficient solution strategy. In contrast to alternative discretization methods based on Lagrange multipliers accounting for the constraints on the boundary, the present scheme is particularly effective because it only mildly affects the structure and the computational cost of the numerical approximation. Indeed, it does not require neither multipliers nor sub-iterations or additional adjoint problems with respect to the reference problem at hand. 相似文献
108.
Many shapes resulting from important geometric operations in industrial applications such as Minkowski sums or volume swept by a moving object can be seen as the projection of higher dimensional objects. When such a higher dimensional object is a smooth manifold, the boundary of the projected shape can be computed from the critical points of the projection. In this paper, using the notion of polyhedral chains introduced by Whitney, we introduce a new general framework to define an analogous of the set of critical points of piecewise linear maps defined over discrete objects that can be easily computed. We illustrate our results by showing how they can be used to compute Minkowski sums of polyhedra and volumes swept by moving polyhedra. 相似文献
109.
We developed an interactive system to design a customized cover for a given three‐dimensional (3D) object such as a camera, teapot, or car. The system first computes the convex hull of the input geometry. The user segments it into several cloth patches by drawing on the 3D surface. This paper provides two technical contributions. First, it introduces a specialized flattening algorithm for cover patches. It makes each two‐dimensional edge in the flattened pattern equal to or longer than the original 3D edge; a smaller patch would fail to cover the object, and a larger patch would result in extra wrinkles. Second, it introduces a mechanism to verify that the user‐specified opening would be large enough for the object to be removed. Starting with the initial configuration, the system virtually “pulls” the object out of the cover while avoiding excessive stretching of cloth patches. We used the system to design real covers and confirmed that it functions as intended. 相似文献
110.
A connected algebraic group in characteristic 0 is uniquely determined by its Lie algebra. In this paper algorithms are given for constructing an algebraic group in characteristic 0, given its Lie algebra. In particular, this leads to an algorithm for finding a maximal reductive subgroup and the unipotent radical of an algebraic group. 相似文献