全文获取类型
收费全文 | 25168篇 |
免费 | 3786篇 |
国内免费 | 3007篇 |
专业分类
电工技术 | 2903篇 |
综合类 | 3376篇 |
化学工业 | 847篇 |
金属工艺 | 374篇 |
机械仪表 | 1729篇 |
建筑科学 | 1091篇 |
矿业工程 | 428篇 |
能源动力 | 556篇 |
轻工业 | 461篇 |
水利工程 | 618篇 |
石油天然气 | 422篇 |
武器工业 | 297篇 |
无线电 | 3213篇 |
一般工业技术 | 1422篇 |
冶金工业 | 573篇 |
原子能技术 | 217篇 |
自动化技术 | 13434篇 |
出版年
2024年 | 103篇 |
2023年 | 295篇 |
2022年 | 448篇 |
2021年 | 581篇 |
2020年 | 750篇 |
2019年 | 774篇 |
2018年 | 724篇 |
2017年 | 898篇 |
2016年 | 1107篇 |
2015年 | 1177篇 |
2014年 | 1624篇 |
2013年 | 1891篇 |
2012年 | 1971篇 |
2011年 | 2119篇 |
2010年 | 1676篇 |
2009年 | 1808篇 |
2008年 | 1893篇 |
2007年 | 1979篇 |
2006年 | 1690篇 |
2005年 | 1474篇 |
2004年 | 1171篇 |
2003年 | 1014篇 |
2002年 | 738篇 |
2001年 | 667篇 |
2000年 | 577篇 |
1999年 | 430篇 |
1998年 | 335篇 |
1997年 | 309篇 |
1996年 | 274篇 |
1995年 | 255篇 |
1994年 | 205篇 |
1993年 | 170篇 |
1992年 | 150篇 |
1991年 | 133篇 |
1990年 | 120篇 |
1989年 | 89篇 |
1988年 | 54篇 |
1987年 | 38篇 |
1986年 | 17篇 |
1985年 | 28篇 |
1984年 | 29篇 |
1983年 | 35篇 |
1982年 | 16篇 |
1981年 | 15篇 |
1980年 | 13篇 |
1979年 | 10篇 |
1976年 | 9篇 |
1964年 | 7篇 |
1963年 | 8篇 |
1961年 | 10篇 |
排序方式: 共有10000条查询结果,搜索用时 328 毫秒
41.
Interception problems are often dealt with by separating guidance and autopilot design. Guidance law can be obtained using optimal control theory and autopilot design is performed on a linearized system. In this paper, we introduce a new approach that determines a global guidance and autopilot law, based on direct output feedback design. Application of this method to exoatmospheric interception problem results in good performances. Extension to endoatmospheric case is under investigation. 相似文献
42.
A numerical solution of the inverse problem of the gravitational field at a single point is obtained using six field elements
for a point, a spherical cap, a differential spherical sector and a vertical segment. In the system of six equations obtained,
the unknowns are the mass of the body, the depth of its center, and the second, third, and fourth degree moments. The accuracy
of the solution of this system is ten times higher than when using three field elements.
__________
Translated from Izmeritel’naya Tekhnika, No. 5, pp. 3–8, May, 2007. 相似文献
43.
Moshe Koppel 《Machine Learning》1991,7(1):85-99
In this article we present an algorithm that learns to predict non-deterministically generated strings. The problem of learning to predict non-deterministically generated strings was raised by Dietterich and Michalski (1986). While their objective was to give heuristic techniques that could be used to rapidly and effectively learn to predict a somewhat limited class of strings, our objective is to give an algorithm which, though impractical, is capable of learning to predict a very general class. Our algorithm is meant to provide a general framework within which heuristic techniques can be effectively employed. 相似文献
44.
In recent years, constructing a virtual backbone by nodes in a connected dominating set (CDS) has been proposed to improve the performance of ad hoc wireless networks. In general, a dominating set satisfies that every vertex in the graph is either in the set or adjacent to a vertex in the set. A CDS is a dominating set that also induces a connected sub‐graph. However, finding the minimum connected dominating set (MCDS) is a well‐known NP‐hard problem in graph theory. Approximation algorithms for MCDS have been proposed in the literature. Most of these algorithms suffer from a poor approximation ratio, and from high time complexity and message complexity. In this paper, we present a new distributed approximation algorithm that constructs a MCDS for wireless ad hoc networks based on a maximal independent set (MIS). Our algorithm, which is fully localized, has a constant approximation ratio, and O(n) time and O(n) message complexity. In this algorithm, each node only requires the knowledge of its one‐hop neighbours and there is only one shortest path connecting two dominators that are at most three hops away. We not only give theoretical performance analysis for our algorithm, but also conduct extensive simulation to compare our algorithm with other algorithms in the literature. Simulation results and theoretical analysis show that our algorithm has better efficiency and performance than others. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
45.
46.
A method is considered to solve a conditional optimization problem with a linear-fractional objective function over permutations.
The performance of sub algorithms to solve this problem is evaluated. The practical efficiency of the algorithm is analyzed
by conducting numerical experiments.
__________
Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 133–146, July–August 2007. 相似文献
47.
L. M. CRUZ-ORIVE 《Journal of microscopy》2005,219(1):18-28
A new principle is presented to generate isotropic uniform random (IUR) test lines hitting a geometric structure in three-dimensional space (3D). The principle therefore concerns the estimation of surface area, volume, membrane thickness, etc., of arbitrary structures with piecewise smooth boundary. The principle states that a point-sampled test line on an isotropic plane through a fixed point in 3D is effectively an invariant test line in 3D. Particular attention is devoted to the stereology of particles, where an alternative to the surfactor method is obtained to estimate surface area. An interesting case arises when the particle is convex. The methods are illustrated with synthetic examples. 相似文献
48.
Garth Isaak 《Information Processing Letters》2004,92(3):107-111
Given a tournament with an acyclic tournament as a feedback arc set we give necessary and sufficient conditions for this feedback arc set to have minimum size. 相似文献
49.
50.