全文获取类型
收费全文 | 17183篇 |
免费 | 2732篇 |
国内免费 | 2205篇 |
学科分类
工业技术 | 22120篇 |
出版年
2024年 | 162篇 |
2023年 | 478篇 |
2022年 | 808篇 |
2021年 | 796篇 |
2020年 | 697篇 |
2019年 | 558篇 |
2018年 | 566篇 |
2017年 | 642篇 |
2016年 | 711篇 |
2015年 | 753篇 |
2014年 | 1042篇 |
2013年 | 1074篇 |
2012年 | 1411篇 |
2011年 | 1355篇 |
2010年 | 1054篇 |
2009年 | 1057篇 |
2008年 | 1028篇 |
2007年 | 1141篇 |
2006年 | 1017篇 |
2005年 | 861篇 |
2004年 | 722篇 |
2003年 | 626篇 |
2002年 | 481篇 |
2001年 | 483篇 |
2000年 | 383篇 |
1999年 | 371篇 |
1998年 | 301篇 |
1997年 | 262篇 |
1996年 | 196篇 |
1995年 | 185篇 |
1994年 | 160篇 |
1993年 | 136篇 |
1992年 | 101篇 |
1991年 | 98篇 |
1990年 | 75篇 |
1989年 | 54篇 |
1988年 | 55篇 |
1987年 | 22篇 |
1986年 | 25篇 |
1985年 | 28篇 |
1984年 | 32篇 |
1983年 | 19篇 |
1982年 | 30篇 |
1981年 | 10篇 |
1980年 | 9篇 |
1979年 | 6篇 |
1978年 | 5篇 |
1976年 | 11篇 |
1975年 | 4篇 |
1973年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
21.
22.
23.
通过密度测定和DSC热分析,观测了超高分子量聚乙烯的辐射效应。实验结果表明:在吸收剂量0—1.13MGy范围内,密度随吸收剂量的增加而增大,熔化热和熔点也有所增加,特别是在低剂量范围内增加十分明显。以上结果都说明,超高分子量聚乙烯在辐照过程中,结晶在完善或有新的结晶形成 相似文献
24.
本文在分析了双眼立体视觉面临的本质困难之后,提出了用金字塔图法匹配特征基元的三眼立体视觉方法,这种方法由于建筑在透视投影几何原理的稳固基础上,无须任何先验限制,也不以图象相似性为基础,故可较好地解决精度与匹配难度的矛盾,且运用金字塔图法进行匹配传播使在保证精度的基础上,匹配速度大大提高,对计算机人工图象的匹配结果表明,误匹配率几乎为零,且有较高的匹配速度和精度。 相似文献
25.
In this paper,a sequential algorithm computing the aww vertex pair distance matrix D and the path matrix Pis given.On a PRAM EREW model with p,1≤p≤n^2,processors,a parallel version of the sequential algorithm is shown.This method can also be used to get a parallel algorithm to compute transitive closure array A^* of an undirected graph.The time complexity of the parallel algorithm is O(n^3/p).If D,P and A^* are known,it is shown that the problems to find all connected components,to compute the diameter of an undirected graph,to determine the center of a directed graph and to search for a directed cycle with the minimum(maximum)length in a directed graph can all be solved in O(n^2/p logp)time. 相似文献
26.
采用封闭网络模型,按照电路元件参数,采用开路、短路和着色运算,将电路图逐层分解,得到网络展开图.给出网络展开图的概念和运算规则,指出网络展开图中从根到末稍每个路径的值就是网络行列式展开式中的一个有效项,从而由网络展开图得到符号网络函数.该方法直接对电路图进行运算,不需要建立任何形式的电路方程和行列式,适用于一般的有源电路,而且能生成各种类型的网络函数. 相似文献
27.
George Ter-Stepanian 《Bulletin of Engineering Geology and the Environment》2002,61(3):197-205
The paper discusses the postulated suspension force, by which it is possible to explain some enigmatic phenomena observed
in different types of mass movements. This force is generated in thick suspensions as a result of friction between sinking
solid particles and static water. The suspension force is related to the seepage force but they have opposite directions.
Both forces form flow networks. Having explained the suspension force, the paper describes how this influences the movement
of material, particularly in debris flows. Enigmatic features and the mechanism of debris flows and lahars are explained by
virtue of the suspension force.
Electronic Publication 相似文献
28.
Poly(vinyl alcohol) is crosslinked in dilute solution (c=0.1 wt%) with glutaraldehyde. The reaction product is characterized by viscometry and gel permeation chromatography (g.p.c.). The intrinsic viscosity decreases with increasing degree of crosslinking and does not depend on temperature. G.p.c. reveals that the reaction product is not homogeneous, but consists of a mixture of particles with different sizes, possibly both intra- and intermolecularly crosslinked molecules. The intramolecularly crosslinked molecules are smaller in size than the initial polymer molecules and their size depends on the degree of crosslinking. They possess a narrow particle size distribution even if the initial polymer sample had a broad molecular weight distribution. 相似文献
29.
A system for person-independent classification of hand postures against complex backgrounds in video images is presented. The system employs elastic graph matching, which has already been successfully applied for object and face recognition. We use the bunch graph technique to model variance in hand posture appearance between different subjects and variance in backgrounds. Our system does not need a separate segmentation stage but closely integrates finding the object boundaries with posture classification. 相似文献
30.
This paper describes the nature of mathematical discovery (including concept definition and exploration, example generation, and theorem conjecture and proof), and considers how such an intelligent process can be simulated by a machine. Although the material is drawn primarily from graph theory, the results are immediately relevant to research in mathematical discovery and learning.The thought experiment, a protocol paradigm for the empirical study of mathematical discovery, highlights behavioral objectives for machine simulation. This thought experiment provides an insightful account of the discovery process, motivates a framework for describing mathematical knowledge in terms of object classes, and is a rich source of advice on the design of a system to perform discovery in graph theory. The evaluation criteria for a discovery system, it is argued, must include both a set of behavior to display (behavioral objectives) and a target set of facts to be discovered (factual knowledge).Cues from the thought experiment are used to formulate two hierarchies of representational languages for graphy theory. The first hierarchy is based on the superficial terminology and knowledge of the thought experiment. Generated by formal grammars with set-theoretic semantics, this eminently reasonable approach ultimately fails to meet the factual knowledge criteria. The second hierarchy uses declarative expressions, each of which has a semantic interpretation as a stylized, recursive algorithm that defines a class by generating it correctly and completely. A simple version of one such representation is validated by a successful, implemented system called Graph Theorist (GT) for mathematical research in graph theory. GT generates correct examples, defines and explores new graph theory properties, and conjectures and proves theorems.Several themes run through this paper. The first is the dual goals, behavioral objectives and factural knowledge to be discovered, and the multiplicity of their demands on a discovery system. The second theme is the central role of object classes to knowledge representation. The third is the increased power and flexibility of a constructive (generator) definition over the more traditional predicate (tester) definition. The final theme is the importance of examples and recursion in mathematical knowledge. The results provide important guidance for further research in the simulation of mathematical discovery. 相似文献