全文获取类型
收费全文 | 8618篇 |
免费 | 607篇 |
国内免费 | 319篇 |
专业分类
电工技术 | 190篇 |
综合类 | 401篇 |
化学工业 | 1695篇 |
金属工艺 | 509篇 |
机械仪表 | 242篇 |
建筑科学 | 324篇 |
矿业工程 | 63篇 |
能源动力 | 193篇 |
轻工业 | 3290篇 |
水利工程 | 28篇 |
石油天然气 | 160篇 |
武器工业 | 32篇 |
无线电 | 584篇 |
一般工业技术 | 490篇 |
冶金工业 | 245篇 |
原子能技术 | 139篇 |
自动化技术 | 959篇 |
出版年
2024年 | 37篇 |
2023年 | 134篇 |
2022年 | 289篇 |
2021年 | 273篇 |
2020年 | 251篇 |
2019年 | 246篇 |
2018年 | 234篇 |
2017年 | 275篇 |
2016年 | 310篇 |
2015年 | 334篇 |
2014年 | 459篇 |
2013年 | 620篇 |
2012年 | 697篇 |
2011年 | 721篇 |
2010年 | 501篇 |
2009年 | 515篇 |
2008年 | 454篇 |
2007年 | 544篇 |
2006年 | 455篇 |
2005年 | 353篇 |
2004年 | 294篇 |
2003年 | 268篇 |
2002年 | 256篇 |
2001年 | 206篇 |
2000年 | 161篇 |
1999年 | 97篇 |
1998年 | 83篇 |
1997年 | 81篇 |
1996年 | 61篇 |
1995年 | 43篇 |
1994年 | 40篇 |
1993年 | 39篇 |
1992年 | 28篇 |
1991年 | 16篇 |
1990年 | 28篇 |
1989年 | 20篇 |
1988年 | 20篇 |
1987年 | 10篇 |
1986年 | 8篇 |
1985年 | 15篇 |
1984年 | 9篇 |
1983年 | 7篇 |
1982年 | 6篇 |
1981年 | 7篇 |
1980年 | 7篇 |
1979年 | 8篇 |
1977年 | 7篇 |
1976年 | 3篇 |
1975年 | 4篇 |
1959年 | 2篇 |
排序方式: 共有9544条查询结果,搜索用时 15 毫秒
51.
The interaction interface between two molecules can be represented as a bisector surface equidistant from the two sets of spheres of varying radii representing atoms. We recursively divide a box containing both sphere-sets into uniform pairs of sub-boxes. The distance from each new box to each sphere-set is conservatively approximated by an interval, and the number of sphere-box computations is greatly reduced by pre-partitioning each sphere-set using a kd-tree. The subdivision terminates at a specified resolution, creating a box partition (BP) tree. A piecewise linear approximation of the bisector surface is then obtained by traversing the leaves of the BP tree and connecting points equidistant from the sphere-sets. In 124 experiments with up to 16,728 spheres, a bisector surface with a resolution of 1/24 of the original bounding box was obtained in 28.8 ms on average. 相似文献
52.
53.
54.
Ana Gàl 《Computational Complexity》2001,10(4):277-296
We give a characterization of span program size by a
combinatorial-algebraic measure. The measure we consider is a generalization
of a measure on covers which has been used to prove lower
bounds on formula size and has also been studied with respect to communication
complexity.?In the monotone case our new methods yield lower bounds for
the monotone span program complexity of explicit Boolean functions in
n variables over arbitrary fields, improving the previous lower bounds
on monotone span program size. Our characterization of span program
size implies that any matrix with superpolynomial separation between
its rank and cover number can be used to obtain superpolynomial lower
bounds on monotone span program size. We also identify a property
of bipartite graphs that is suficient for constructing Boolean functions
with large monotone span program complexity.
Received: September 30, 2000. 相似文献
55.
该文阐述了在Linux下,利用V4L以及ALSA,在普通PC上组建视频音频采集系统以及远程传输的方法。 相似文献
56.
57.
One-leg methods and linear multistep methods are two class of important numerical methods applied to stiff initial value
problems of ordinary differential equations. The purpose of this paper is to present some convergence results of A-stable
one-leg and linear multistep methods for one-parameter multiply stiff singular perturbation problems and their corresponding
reduced problems which are a class of stiff differential-algebraic equations.
Received April 14, 2000; revised June 30, 2000 相似文献
58.
Cs. Imreh 《Computing》2001,66(3):289-296
A manufacturing system consists of operating units which convert their input materials into their output materials. In the
problem of designing a process network, we have to find a suitable network of operating units which produces the desired products
from the given raw materials. If we consider this process network design problem from a structural point of view, then we
obtain a combinatorial optimization problem called the Process Network Synthesis or (PNS) problem. It is known that the PNS
problem is NP-complete. Here, a new method is presented to reduce the solution of some more difficult PNS problems to the
solution of simpler ones, and using this method, a new well-solvable class of PNS problems is established.
Received February 12, 1999; revised October 24, 2000 相似文献
59.
Comments on an article by C. M. Stoup and L. T. Benjamin, Jr. (see record 1983-24200-001), in which they used various editions of Graduate Study in Psychology, published by the American Psychological Association (APA), to report the GPAs and Graduate Record Examination scores of master's and doctoral students across various areas of psychology. It is cautioned that the use of Graduate Study in Psychology as a data source calls for skepticism, as there is sufficient reason to question some of the data that are submitted to the APA by psychology departments. (3 ref) (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
60.
Pd supported on KL zeolite has been studied by temperature programmed reduction (TPR) and electron paramagnetic resonance (EPR) spectroscopy. It has been found that upon calcination in pure oxygen Pd3+ and Pd2+ ions are formed; the Pd3+ ions are identified by their EPR signal. As Pd3+ ions in the cancrinite cages are difficult to reduce, the H2 consumption in conventional TPR is below the stoichiometric amount. 相似文献