全文获取类型
收费全文 | 5970篇 |
免费 | 260篇 |
国内免费 | 9篇 |
专业分类
电工技术 | 53篇 |
综合类 | 34篇 |
化学工业 | 1542篇 |
金属工艺 | 183篇 |
机械仪表 | 137篇 |
建筑科学 | 249篇 |
矿业工程 | 13篇 |
能源动力 | 245篇 |
轻工业 | 820篇 |
水利工程 | 37篇 |
石油天然气 | 28篇 |
武器工业 | 2篇 |
无线电 | 312篇 |
一般工业技术 | 941篇 |
冶金工业 | 678篇 |
原子能技术 | 62篇 |
自动化技术 | 903篇 |
出版年
2024年 | 13篇 |
2023年 | 56篇 |
2022年 | 138篇 |
2021年 | 214篇 |
2020年 | 145篇 |
2019年 | 151篇 |
2018年 | 213篇 |
2017年 | 206篇 |
2016年 | 228篇 |
2015年 | 172篇 |
2014年 | 242篇 |
2013年 | 423篇 |
2012年 | 376篇 |
2011年 | 452篇 |
2010年 | 326篇 |
2009年 | 308篇 |
2008年 | 293篇 |
2007年 | 220篇 |
2006年 | 213篇 |
2005年 | 186篇 |
2004年 | 137篇 |
2003年 | 145篇 |
2002年 | 136篇 |
2001年 | 87篇 |
2000年 | 75篇 |
1999年 | 53篇 |
1998年 | 190篇 |
1997年 | 146篇 |
1996年 | 89篇 |
1995年 | 67篇 |
1994年 | 62篇 |
1993年 | 66篇 |
1992年 | 25篇 |
1991年 | 22篇 |
1990年 | 19篇 |
1989年 | 23篇 |
1988年 | 21篇 |
1987年 | 23篇 |
1986年 | 20篇 |
1985年 | 23篇 |
1984年 | 14篇 |
1983年 | 15篇 |
1982年 | 14篇 |
1981年 | 21篇 |
1980年 | 15篇 |
1979年 | 17篇 |
1978年 | 14篇 |
1977年 | 13篇 |
1976年 | 31篇 |
1971年 | 11篇 |
排序方式: 共有6239条查询结果,搜索用时 0 毫秒
101.
Auction processes are commonly employed in many environments. With rapid advances in Internet and computing technologies, electronic auctions have become very popular. People sell and buy a wide range of goods and services online. There is a growing need for the proper management of online auctions and for providing support to parties involved. In this paper, we develop an interactive approach supporting both the buyer and the bidders in a multi-attribute, single-item, multi-round, reverse auction environment. We demonstrate the algorithm on a number of problems. 相似文献
102.
In this paper, we present a new irradiance caching scheme using Monte Carlo ray tracing for efficiently rendering participating media. The irradiance cache algorithm is extended to participating media. Our method allows to adjust the density of cached records depending on illumination changes. Direct and indirect contributions can be stored in the records but also multiple scattering. An adaptive shape of the influence zone of records, depending on geometrical features and irradiance variations, is introduced. To avoid a high density of cached records in low interest areas, a new method controls the density of the cache when adding new records. This record density control depends on the interpolation quality and on the photometric characteristics of the medium. Reducing the number of records accelerates both the computation pass and the rendering pass by decreasing the number of queries to the cache data structure (Kd-tree). Finally, instead of using an expensive ray marching to find records that cover the ray, we gather all the contributive records along the ray. With our method, pre-computing and rendering passes are significantly speeded-up. 相似文献
103.
Michaël Rao 《Theoretical computer science》2011,412(27):3010-3018
104.
Suppose a graph G is given with two vertex-disjoint sets of vertices Z1 and Z2. Can we partition the remaining vertices of G such that we obtain two connected vertex-disjoint subgraphs of G that contain Z1 and Z2, respectively? This problem is known as the 2-Disjoint Connected Subgraphs problem. It is already NP-complete for the class of n-vertex graphs G=(V,E) in which Z1 and Z2 each contain a connected set that dominates all vertices in V?(Z1∪Z2). We present an O∗(1.2051n) time algorithm that solves it for this graph class. As a consequence, we can also solve this problem in O∗(1.2051n) time for the classes of n-vertex P6-free graphs and split graphs. This is an improvement upon a recent O∗(1.5790n) time algorithm for these two classes. Our approach translates the problem to a generalized version of hypergraph 2-coloring and combines inclusion/exclusion with measure and conquer. 相似文献
105.
We give lower bounds on the growth rate of Dejean words, i.e. minimally repetitive words, over a k-letter alphabet, for 5≤k≤10. Put together with the known upper bounds, we estimate these growth rates with the precision of 0.005. As a consequence, we establish the exponential growth of the number of Dejean words over a k-letter alphabet, for 5≤k≤10. 相似文献
106.
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. 相似文献
107.
Tudor Bălănescu 《Formal Aspects of Computing》2000,12(6):473-484
Some conditions relating to the automata involved in the W-testing method are discussed. It is also shown how to use the
method for reduced automata instead of minimal automata. New design test conditions (weak output distinguishable, strong test-complete and output delimited type) are considered for the generalised stream X-machines (stream X-machines with basic functions replaced by relations and having as output strings of symbols rather than single
symbols). It is proved that testing methods similar to those already developed for ordinary deterministic stream X-machines
may be applied for generalised stream X-machines with output delimited types. A particular case of generalised stream X-machine
with output delimited type is the X-machine with output delimiter, which produces outputs having a distinct right end character.
Received October 2000 / Accepted in revised form January 2001 相似文献
108.
Lamarque M Tastet C Poncet J Demettre E Jouin P Vial H Dubremetz JF 《Proteomics. Clinical applications》2008,2(9):1361-1374
The Plasmodium falciparum food vacuole (FV) is a lysosome-like organelle where erythrocyte hemoglobin digestion occurs. It is a favorite target in the development of antimalarials. We have used a tandem mass spectrometry approach to investigate the proteome of an FV-enriched fraction and identified 116 proteins. The electron microscopy analysis and the Western blot data showed that the major component of the fraction was the FV and, as expected, the majority of previously known FV markers were recovered. Of particular interest, several proteins involved in vesicle-mediated trafficking were identified, which are likely to play a key role in FV biogenesis and/or FV protein trafficking. Recovery of parasite surface proteins lends support to the cytostomal pathway of hemoglobin ingestion as a FV trafficking route. We have identified 32 proteins described as hypothetical in the databases. This insight into FV protein content provides new clues towards understanding the biological function of this organelle in P. falciparum. 相似文献
109.
Barelli S Canellini G Thadikkaran L Crettaz D Quadroni M Rossier JS Tissot JD Lion N 《Proteomics. Clinical applications》2008,2(2):142-157
Protein oxidation mechanisms result in a wide array of modifications, from backbone cleavage or protein crosslinking to more subtle modifications such as side chain oxidations. Protein oxidation occurs as part of normal regulatory processes, as a defence mechanism against oxidative stress, or as a deleterious processes when antioxidant defences are overcome. Because blood is continually exposed to reactive oxygen and nitrogen species, blood proteomics should inherently adopt redox proteomic strategies. In this review, we recall the biochemical basis of protein oxidation, review the proteomic methodologies applied to analyse redox modifications, and highlight some physiological and in vitro responses to oxidative stress of various blood components. 相似文献
110.