全文获取类型
收费全文 | 85604篇 |
免费 | 1068篇 |
国内免费 | 409篇 |
专业分类
电工技术 | 793篇 |
综合类 | 2321篇 |
化学工业 | 11965篇 |
金属工艺 | 4834篇 |
机械仪表 | 3045篇 |
建筑科学 | 2344篇 |
矿业工程 | 566篇 |
能源动力 | 1181篇 |
轻工业 | 3741篇 |
水利工程 | 1277篇 |
石油天然气 | 348篇 |
无线电 | 9375篇 |
一般工业技术 | 16655篇 |
冶金工业 | 2720篇 |
原子能技术 | 265篇 |
自动化技术 | 25651篇 |
出版年
2023年 | 28篇 |
2022年 | 54篇 |
2021年 | 78篇 |
2020年 | 50篇 |
2019年 | 72篇 |
2018年 | 14477篇 |
2017年 | 13413篇 |
2016年 | 10013篇 |
2015年 | 683篇 |
2014年 | 325篇 |
2013年 | 340篇 |
2012年 | 3258篇 |
2011年 | 9569篇 |
2010年 | 8355篇 |
2009年 | 5657篇 |
2008年 | 6882篇 |
2007年 | 7886篇 |
2006年 | 209篇 |
2005年 | 1283篇 |
2004年 | 1203篇 |
2003年 | 1215篇 |
2002年 | 591篇 |
2001年 | 124篇 |
2000年 | 208篇 |
1999年 | 83篇 |
1998年 | 76篇 |
1997年 | 49篇 |
1996年 | 70篇 |
1995年 | 29篇 |
1994年 | 26篇 |
1993年 | 22篇 |
1992年 | 26篇 |
1991年 | 31篇 |
1989年 | 16篇 |
1988年 | 14篇 |
1969年 | 25篇 |
1968年 | 43篇 |
1967年 | 33篇 |
1966年 | 42篇 |
1965年 | 44篇 |
1963年 | 28篇 |
1962年 | 22篇 |
1961年 | 18篇 |
1960年 | 30篇 |
1959年 | 35篇 |
1958年 | 38篇 |
1957年 | 36篇 |
1956年 | 34篇 |
1955年 | 63篇 |
1954年 | 68篇 |
排序方式: 共有10000条查询结果,搜索用时 8 毫秒
31.
Somsak Vanit-Anunchai Jonathan Billington Guy Edward Gallasch 《International Journal on Software Tools for Technology Transfer (STTT)》2008,10(1):29-56
State space explosion is a key problem in the analysis of finite state systems. The sweep-line method is a state exploration
method which uses a notion of progress to allow states to be deleted from memory when they are no longer required. This reduces
the peak number of states that need to be stored, while still exploring the full state space. The technique shows promise
but has never achieved reductions greater than about a factor of 10 in the number of states stored in memory for industrially
relevant examples. This paper discusses sweep-line analysis of the connection management procedures of a new Internet standard,
the Datagram Congestion Control Protocol (DCCP). As the intuitive approaches to sweep-line analysis are not effective, we
introduce new variables to track progress. This creates further state explosion. However, when used with the sweep-line, the
peak number of states is reduced by over two orders of magnitude compared with the original. Importantly, this allows DCCP
to be analysed for larger parameter values.
Somsak Vanit-Anunchai was partially supported by an Australian Research Council Discovery Grant (DP0559927) and Suranaree
University of Technology.
Guy Edward Gallasch was supported by an Australian Research Council Discovery Grant (DP0559927). 相似文献
32.
Takeshi Shiofuku Norihiro Abe Yoshihiro Tabuchi Hirokazu Taki Shoujie He 《Artificial Life and Robotics》2008,13(1):290-293
This paper presents an approach of measuring in real-time the vector of finger that is pointing to an object. DSP is used
in the operation processing unit in order to do the real-time processing. The steps include the extraction of flesh-colored
regions from an image, the labeling of the flesh-colored regions, and the detection of two characteristic positions on the
finger so that the direction that the finger is pointing at will be calculated. The entire process takes about 29 msec, which
makes it possible to have the frame rate of 34 fps. With this frame rate, this measurement approach is considered real-time
and promising to be merged into other application systems.
This work was presented in part at the 13th International Symposium on Artificial Life and Robotics, Oita, Japan, January
31–February 2, 2008 相似文献
33.
The multi-homogeneous Bezout number is a bound for the number of solutions of a system of multi-homogeneous polynomial equations,
in a suitable product of projective spaces. Given an arbitrary, not necessarily multi-homogeneous, system, one can ask for
the optimal multi-homogenization that would minimize the Bezout number. In this paper it is proved that the problem of computing,
or even estimating, the optimal multi-homogeneous Bezout number is actually NP-hard. In terms of approximation theory for
combinatorial optimization, the problem of computing the best multi-homogeneous structure does not belong to APX, unless P
= NP. Moreover, polynomial-time algorithms for estimating the minimal multi-homogeneous Bezout number up to a fixed factor
cannot exist even in a randomized setting, unless BPP ⫆ NP. 相似文献
34.
35.
36.
37.
38.
39.
Fanggao Chang Tao Li Yongxia Ge Zhenping Chen Zhongshi Liu Xiping Jing 《Journal of Materials Science》2007,42(17):7109-7115
DC resistivity, dielectric constant, dielectric loss and positron annihilation spectra of (Ba1−x
Ho
x
)TiO3 ceramics have been measured as a function of holmium concentration x. It has been found that the DC resistivity of (Ba1−x
Ho
x
)TiO3 is strongly dependent on the Ho content: it decreases three orders of magnitude and reaches a minimum at x = 0.4%. Doping with 0.6% holmium increases the permittivity of BaTiO3 by approximately three times (from ∼1,300 to ∼4,000), with only a slight increase in the corresponding dielectric loss. The
local electron density and defect concentration estimated using positron annihilation technique conforms well to the features
found in the dielectric and resistivity measurements. The results have been discussed in terms of a mixed compensation model. 相似文献
40.
Document caching and connection caching are extensively studied problems. In document caching, one has to maintain caches
containing documents accessible in a network. In connection caching, one has to maintain a set of open network connections
that handle data transfer. Previous work investigated these two problems separately while in practice the problems occur together:
In order to load a document, one has to establish a connection between network nodes if the required connection is not already
open. In this paper we present the first study that integrates document and connection caching. We first consider a very basic
model in which all documents have the same size and the cost of loading a document or establishing a connection is equal to
1. We present deterministic and randomized online algorithms that achieve nearly optimal competitive ratios unless the size
of the connection cache is extremely small. We then consider general settings where documents have varying sizes. We investigate
a FAULT model in which the loading cost of a document is 1 as well as a BIT model in which the loading cost is equal to the
size of the document. 相似文献