全文获取类型
收费全文 | 16230篇 |
免费 | 2517篇 |
国内免费 | 1999篇 |
专业分类
电工技术 | 1081篇 |
综合类 | 1861篇 |
化学工业 | 899篇 |
金属工艺 | 677篇 |
机械仪表 | 903篇 |
建筑科学 | 725篇 |
矿业工程 | 533篇 |
能源动力 | 400篇 |
轻工业 | 556篇 |
水利工程 | 382篇 |
石油天然气 | 899篇 |
武器工业 | 229篇 |
无线电 | 1971篇 |
一般工业技术 | 1582篇 |
冶金工业 | 261篇 |
原子能技术 | 152篇 |
自动化技术 | 7635篇 |
出版年
2024年 | 92篇 |
2023年 | 319篇 |
2022年 | 490篇 |
2021年 | 512篇 |
2020年 | 596篇 |
2019年 | 554篇 |
2018年 | 548篇 |
2017年 | 613篇 |
2016年 | 705篇 |
2015年 | 711篇 |
2014年 | 1082篇 |
2013年 | 1042篇 |
2012年 | 1350篇 |
2011年 | 1390篇 |
2010年 | 1046篇 |
2009年 | 1143篇 |
2008年 | 1136篇 |
2007年 | 1304篇 |
2006年 | 1008篇 |
2005年 | 953篇 |
2004年 | 736篇 |
2003年 | 596篇 |
2002年 | 507篇 |
2001年 | 384篇 |
2000年 | 339篇 |
1999年 | 276篇 |
1998年 | 197篇 |
1997年 | 183篇 |
1996年 | 174篇 |
1995年 | 134篇 |
1994年 | 110篇 |
1993年 | 90篇 |
1992年 | 83篇 |
1991年 | 65篇 |
1990年 | 47篇 |
1989年 | 48篇 |
1988年 | 18篇 |
1987年 | 20篇 |
1986年 | 15篇 |
1985年 | 15篇 |
1984年 | 15篇 |
1983年 | 19篇 |
1982年 | 12篇 |
1981年 | 9篇 |
1980年 | 12篇 |
1979年 | 7篇 |
1978年 | 6篇 |
1977年 | 9篇 |
1976年 | 6篇 |
1975年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
1.
2.
3.
为了进一步提高渤海油田J3井区缔合聚合物驱的技术经济效果,在渤海油田室内配方和先导性矿场试验研究基础上,利用化学驱油藏数值模拟软件FAPMS,分析和研究了高浓度缔合聚合物前置段塞、主段塞的大小和浓度以及段塞组合方式对驱油效果的影响,优化设计了渤海绥中油田J3井区块矿场试验的最佳注入程序及段塞大小。结果表明,通过对不同浓度的疏水缔合聚合物注入的前置段塞及主段塞和梯度式后续段塞的优化后,原油采收率比未优化时提高了约10个百分点。研究表明,渤海油田应该高度重视聚合物驱的注入方式和段塞优化设计,进一步提高聚合物的技术经济效果。 相似文献
4.
5.
在实际应用中常常需要将人像从照片的背景中有效地分割出来,通常的做法是通过提取照片中人像各部分特征来实现分割,其缺陷是计算复杂度较大,分割效果受各种干扰因素影响很大。现提出了一种基于主体外部轮廓信息的照片分割算法,通过梯度锐化、边缘保护、临近像素点相似度比较来确定图像的边界,该算法对于具有相对均匀背景的照片具有较高的计算效率。 相似文献
6.
7.
Education-driven research in CAD 总被引:1,自引:0,他引:1
We argue for a new research category, named education-driven research (EDR), which fills the gap between traditional field-specific research that is not concerned with educational objectives and research in education that focuses on fundamental teaching and learning principles and possibly on their customization to broad areas (such as mathematics or physics), but not to specific disciplines (such as CAD). The objective of EDR is to simplify the formulation of the underlying theoretical foundations and of specific tools and solutions in a specialized domain, so as to make them easy to understand and internalize. As such, EDR is a difficult and genuine research activity, which requires a deep understanding of the specific field and can rarely be carried out by generalists with primary expertise in broad education principles. We illustrate the concept of EDR with three examples in CAD: (1) the Split and Tweak subdivisions of a polygon and its use for generating curves, surfaces, and animations; (2) the construction of a topological partition of a plane induced by an arbitrary arrangement of edges; and (3) a romantic definition of the minimal and Hausdorff distances. These examples demonstrate the value of using analogies, of introducing evocative terminology, and of synthesizing the simplest fundamental building blocks. The intuitive understanding provided by EDR enables the students (and even the instructor) to better appreciate the limitations of a particular solution and to explore alternatives. In particular, in these examples, EDR has allowed the author to: (1) reduce the cost of evaluating a cubic B-spline curve; (2) develop a new subdivision curve that is better approximated by its control polygon than either a cubic B-spline or an interpolating 4-point subdivision curve; (3) discover how a circuit inclusion tree may be used for identifying the faces in an arrangement; and (4) rectify a common misconception about the computation of the Hausdorff error between triangle meshes. We invite the scientific community to encourage the development of EDR by publishing its results as genuine research contributions in peer-reviewed professional journals. 相似文献
8.
V. P. Efimov 《Journal of Mining Science》2003,39(4):384-386
The procedure is proposed for estimating the crack resistance and tensile strength of rocks by the results of experiments on disk samples with holes. The gradient approach to the strength problem is employed in processing the experimental data. 相似文献
9.
张鸿宾 《计算机应用与软件》1994,11(5):15-19,53
使用BP算法训练多层网络的速度很慢而且事先难于确定隐节点和隐层的适当数目。本文提出一个有效的算法,先构造决策树,然后将构造的决策树转换为神经网。文中使用一个全局准则函数控制决策树的增长,它较好地匹配了树的复杂性和训练样本量及错分率界。实验结果,本文的算法比用BP算法训练多层网络要快,而其分类精度不低于用BP算法训练的多层神经网。 相似文献
10.
We study the application of the geographic nearest neighbor approach to two problems. The first problem is the construction of an approximately minimum length rectilinear Steiner tree for a set ofn points in the plane. For this problem, we introduce a variation of a subgraph of sizeO(n) used by YaO [31] for constructing minimum spanning trees. Using this subgraph, we improve the running times of the heuristics discussed by Bern [6] fromO(n
2
log
n) toO(n log2
n). The second problem is the construction of a rectilinear minimum spanning tree for a set ofn noncrossing line segments in the plane. We present an optimalO(n logn) algorithm for this problem. The rectilinear minimum spanning tree for a set of points can thus be computed optimally without using the Voronoi diagram. This algorithm can also be extended to obtain a rectilinear minimum spanning tree for a set of nonintersecting simple polygons.The results in this paper are a part of Y. C. Yee's Ph.D. thesis done at SUNY at Albany. He was supported in part by NSF Grants IRI-8703430 and CCR-8805782. S. S. Ravi was supported in part by NSF Grants DCI-86-03318 and CCR-89-05296. 相似文献