全文获取类型
收费全文 | 38602篇 |
免费 | 4519篇 |
国内免费 | 3646篇 |
专业分类
电工技术 | 3235篇 |
技术理论 | 2篇 |
综合类 | 6696篇 |
化学工业 | 1728篇 |
金属工艺 | 852篇 |
机械仪表 | 2764篇 |
建筑科学 | 2627篇 |
矿业工程 | 786篇 |
能源动力 | 778篇 |
轻工业 | 2405篇 |
水利工程 | 1026篇 |
石油天然气 | 853篇 |
武器工业 | 489篇 |
无线电 | 5176篇 |
一般工业技术 | 3788篇 |
冶金工业 | 861篇 |
原子能技术 | 502篇 |
自动化技术 | 12199篇 |
出版年
2024年 | 166篇 |
2023年 | 514篇 |
2022年 | 922篇 |
2021年 | 1003篇 |
2020年 | 1041篇 |
2019年 | 960篇 |
2018年 | 984篇 |
2017年 | 1186篇 |
2016年 | 1298篇 |
2015年 | 1365篇 |
2014年 | 2055篇 |
2013年 | 2320篇 |
2012年 | 2684篇 |
2011年 | 2891篇 |
2010年 | 2293篇 |
2009年 | 2467篇 |
2008年 | 2567篇 |
2007年 | 2953篇 |
2006年 | 2636篇 |
2005年 | 2344篇 |
2004年 | 1955篇 |
2003年 | 1621篇 |
2002年 | 1347篇 |
2001年 | 1150篇 |
2000年 | 999篇 |
1999年 | 836篇 |
1998年 | 674篇 |
1997年 | 583篇 |
1996年 | 537篇 |
1995年 | 472篇 |
1994年 | 408篇 |
1993年 | 286篇 |
1992年 | 258篇 |
1991年 | 214篇 |
1990年 | 194篇 |
1989年 | 172篇 |
1988年 | 113篇 |
1987年 | 68篇 |
1986年 | 36篇 |
1985年 | 35篇 |
1984年 | 27篇 |
1983年 | 33篇 |
1982年 | 23篇 |
1981年 | 12篇 |
1980年 | 14篇 |
1979年 | 9篇 |
1978年 | 6篇 |
1977年 | 6篇 |
1976年 | 7篇 |
1965年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
31.
In this paper, symbolic code matrix ,constant matrix and count matrix are defined .The first twomatrices are used to describe the elemental expression of augmented matrix and the nede admittance equa-tion is thus obtained. The third matrix is used to obtain the incoming degree matrix, and according to thematrix all the 1- factors of the Coates graph are given. By using the data code, the determinant is expandedand the same items in the expansion are merged. Thus the symbolic network function in which no term can-cellation occurs is generated. 相似文献
32.
Timothy Thomasma Kurt Hilbrecht 《International Journal of Flexible Manufacturing Systems》1991,3(3-4):231-250
Good methods are needed to specify, test, and debug material-handling control logic. This article surveys a number of representative methods for defining and describing control algorithms for programmable material-handling equipment used in flexible manufacturing systems. The methods are evaluated with regard to their suitability for communication between people and as bases for interfaces to automatic program generators. It is concluded that no single method is entirely satisfactory. Three methods (position diagrams, function block diagrams, and operation networks) have potential to be combined into an effective hybrid approach that minimizes the need for the user to switch between various conceptual models. 相似文献
33.
Specific interactions in blends containing Chitosan and functionalized polymers. Molecular dynamics simulations 总被引:2,自引:0,他引:2
Chitosan (CS)/poly(vinyl alcohol) (PVA) and Chitosan/poly(2-hydroxyethyl methacrylate) (P2HEM) blends have been studied through molecular dynamic simulations. In a previous work it was found miscibility between these polymers and it was attributed to hydrogen bonding formation. However, the experimental information obtained was not enough to know which of the interacting groups of Chitosan, i.e. -CH2OH or -NH2, are responsible of the interaction. Therefore, we have performed molecular dynamics simulation runs of 1 ns in order to calculate radial distribution functions (RDF) for the groups tentatively involved in the interaction. The results are correlated with our previous experimental data. This way, we have obtained a more precise conclusive information about the interactions involved as function of the blends composition. For low compositions of PVA and P2HEM the interaction is predominantly with the hydroxymethyl groups of CS while as the composition of PVA and P2HEM increases, the interaction with the amine groups increases. 相似文献
34.
George Weiss 《Mathematics of Control, Signals, and Systems (MCSS)》1991,4(2):193-203
We give an elementary proof of the well-known fact that shift-invariant operators onL
2[0, ∞) are represented by transfer functions which are bounded and analytic on the right open half-plane. We prove a generalization
to Banach space-valuedL
p
-functions, where 1≤p<∞. We show that the result no longer holds forp=∞.
This research was supported partially by the Weizmann Fellowship, and partially by the Air Force Office of Scientific Research
under Contract F49620-86-C-0111. 相似文献
35.
36.
张小蹦 《西安邮电学院学报》2008,13(1):139-140,148
本文的主要目的是利用初等方法研究Smarandache可乘函数在简单数集中的均值性质,并给出一个有趣的渐近公式。 相似文献
37.
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. 相似文献
38.
We propose a general modeling framework to evaluate the performance of cache consistency algorithms. In addition to the usual hit rate, we introduce the hit* rate as a consistency measure, which captures the fraction of non-stale downloads from the cache. We apply these ideas to the analysis of the fixed TTL consistency algorithm in the presence of network delays. The hit and hit* rates are evaluated when requests and updates are modeled by renewal processes. Classical results on the renewal function lead to various bounds. 相似文献
39.
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. 相似文献
40.
Gabriel Nivasch 《Information Processing Letters》2004,90(3):135-140
We present an algorithm for detecting periodicity in sequences produced by repeated application of a given function. Our algorithm uses logarithmic memory with high probability, runs in linear time, and is guaranteed to stop within the second loop through the cycle. We also present a partitioning technique that offers a time/memory tradeoff. Our algorithm is especially well suited for sequences where the cycle length is typically small compared to the length of the acyclic prefix. 相似文献