全文获取类型
收费全文 | 4996篇 |
免费 | 176篇 |
国内免费 | 6篇 |
专业分类
电工技术 | 63篇 |
综合类 | 2篇 |
化学工业 | 1242篇 |
金属工艺 | 76篇 |
机械仪表 | 113篇 |
建筑科学 | 231篇 |
矿业工程 | 7篇 |
能源动力 | 175篇 |
轻工业 | 367篇 |
水利工程 | 28篇 |
石油天然气 | 11篇 |
无线电 | 577篇 |
一般工业技术 | 858篇 |
冶金工业 | 547篇 |
原子能技术 | 61篇 |
自动化技术 | 820篇 |
出版年
2022年 | 55篇 |
2021年 | 81篇 |
2020年 | 47篇 |
2019年 | 61篇 |
2018年 | 85篇 |
2017年 | 102篇 |
2016年 | 125篇 |
2015年 | 88篇 |
2014年 | 113篇 |
2013年 | 255篇 |
2012年 | 213篇 |
2011年 | 258篇 |
2010年 | 212篇 |
2009年 | 222篇 |
2008年 | 212篇 |
2007年 | 219篇 |
2006年 | 224篇 |
2005年 | 162篇 |
2004年 | 174篇 |
2003年 | 142篇 |
2002年 | 147篇 |
2001年 | 112篇 |
2000年 | 103篇 |
1999年 | 83篇 |
1998年 | 160篇 |
1997年 | 136篇 |
1996年 | 110篇 |
1995年 | 103篇 |
1994年 | 97篇 |
1993年 | 84篇 |
1992年 | 55篇 |
1991年 | 40篇 |
1990年 | 50篇 |
1989年 | 43篇 |
1988年 | 46篇 |
1987年 | 45篇 |
1986年 | 26篇 |
1985年 | 79篇 |
1984年 | 58篇 |
1983年 | 54篇 |
1982年 | 46篇 |
1981年 | 80篇 |
1980年 | 46篇 |
1979年 | 50篇 |
1978年 | 17篇 |
1977年 | 37篇 |
1976年 | 44篇 |
1975年 | 41篇 |
1974年 | 30篇 |
1973年 | 26篇 |
排序方式: 共有5178条查询结果,搜索用时 0 毫秒
91.
Manipulating Electrical and Fluidic Access in Integrated Nanopore‐Microfluidic Arrays Using Microvalves
下载免费PDF全文
![点击此处可从《Small (Weinheim an der Bergstrasse, Germany)》网站下载免费的PDF全文](/ch/ext_images/free.gif)
92.
93.
Olivier Llopis Jean-Marc Dienot Jacques Verdier Robert Plana Michel Gayral Jacques Graffeuil 《电信纪事》1996,51(3-4):121-129
The conversion of low frequency noise into phase noise in microwave oscillators is studied through an analytical calculation of the pushing factor. This calculation is based on a simplified equivalent circuit for two types of active devices : field effect transistors (Fet) and heterojunction bipolar transistors (hbt). The preeminence in the conversion process of the gate- source capacitance in theFet and the base- emitter junction in thehbt is pointed out. Practical methods are proposed to reduce the phase noise in these circuits. 相似文献
94.
We investigated whether, in rheumatoid arthritis (RA), the CD45 isoform expression of peripheral blood T-lymphocytes (T-PBL) is related to auto-immune processes (e.g. IgM rheumatoid factors) and to clinical manifestations. By three-colour flow cytometry, we quantified three subsets of CD4+ or CD8+ T-PBL: "naive" CD45RA+,RO-, "transient" CD45RA+,RO+, and "memory" CD45RA-,RO+ cells, in 102 patients with RA and in 41 age- and sex-matched controls. The serum levels of rheumatoid factors (RF) were determined--besides conventional agglutination tests--by ELISA (IgM-RF). Extensive clinical examination was performed at the time of blood sampling. In RA, age, sex and drug therapy did not constitute major influences on the CD45RA/RO patterns. In "healthy" men, higher age significantly' correlated with fewer naive and more memory CD4+ T-PBL (P < 0.01). In RA, distinct correlations between the T-PBL subsets, autoimmune and clinical manifestations became obvious when patients with low and high levels of RF against human IgG Fc fragments, as determined by ELISA, were analysed separately. RA patients with high IgM-RF had elevated proportions of CD45RO+ T-PBL (P < 0.05), that correlated with clinical parameters of disease activity (tender joint count, Ritchie index, P < 0.05) and outcome (Health Assessment Questionnaire, Larsen radiographic scores, P < 0.05). The proportions of memory CD4+ and CD8+ T-PBL correlated strongly (P < 0.001) with the IgM-RF levels. Within 1 year, only three of 34 patients (disease duration of 5-9 years) showed seroconversion from low to high levels of IgM-RF (and positive agglutination tests); this was paralleled by reductions in naive and increases in transient T-PBL (P < 0.02). Thus, in RA, the proportions of memory CD4+ and CD8+ T-PBL correlate with the level of IgM-RF and, together with transient T-PBL, with clinical parameters of disease activity and outcome. 相似文献
95.
Exploring the power of shared memory communication objects and models, and the limits of distributed computability are among the most exciting research areas of distributed computing. In that spirit, this paper focuses on a problem that has received considerable interest since its introduction in 1987, namely the renaming problem. It was the first non-trivial problem known to be solvable in an asynchronous distributed system despite process failures. Many algorithms for renaming and variants of renaming have been proposed, and sophisticated lower bounds have been proved, that have been a source of new ideas of general interest to distributed computing. It has consequently acquired a paradigm status in distributed fault-tolerant computing.In the renaming problem, processes start with unique initial names taken from a large name space, then deciding new names such that no two processes decide the same new name and the new names are from a name space that is as small as possible.This paper presents an introduction to the renaming problem in shared memory systems, for non-expert readers. It describes both algorithms and lower bounds. Also, it discusses strong connections relating renaming and other important distributed problems such as set agreement and symmetry breaking. 相似文献
96.
Improving the spatio-temporal distribution of surface solar radiation data by merging ground and satellite measurements 总被引:2,自引:0,他引:2
Appropriate information on solar resources is very important for a variety of technological areas, such as: agriculture, meteorology, forestry engineering, water resources and in particular in the designing and sizing of solar energy systems. However, the availability of observed solar radiation measurements has proven to be spatially and temporally inadequate for many applications. In this paper we propose to merge the global solar radiation measurements from the Royal Meteorological Institute of Belgium solar measurements network with the operationally derived surface incoming global short-wave radiation products from Meteosat Second Generation satellites imageries to improve the spatio-temporal resolution of the surface global solar radiation data over Belgium. We evaluate several merging methods with various degrees of complexity (from mean field bias correction to geostatistical merging techniques) together with interpolated ground measurements and satellite-derived values only. The performance of the different methods is assessed by leave-one-out cross-validation. 相似文献
97.
Emmanuel Bruno Nicolas Faessel Herv�� Glotin Jacques Le Maitre Michel Scholl 《World Wide Web》2011,14(5-6):623-649
We present in this paper a model for indexing and querying web pages, based on the hierarchical decomposition of pages into blocks. Splitting up a page into blocks has several advantages in terms of page design, indexing and querying such as (i) blocks of a page most similar to a query may be returned instead of the page as a whole (ii) the importance of a block can be taken into account, as well as (iii) the permeability of the blocks to neighbor blocks: a block b is said to be permeable to a block b?? in the same page if b?? content (text, image, etc.) can be (partially) inherited by b upon indexing. An engine implementing this model is described including: the transformation of web pages into blocks hierarchies, the definition of a dedicated language to express indexing rules and the storage of indexed blocks into an XML repository. The model is assessed on a dataset of electronic news, and a dataset drawn from web pages of the ImagEval campaign where it improves by 16% the mean average precision of the baseline. 相似文献
98.
Yehuda Afek Eli Gafni Sergio Rajsbaum Michel Raynal Corentin Travers 《Distributed Computing》2010,22(3):185-195
This paper introduces and investigates the k-simultaneous consensus task: each process participates at the same time in k independent consensus instances until it decides in any one of them. It is shown that the k-simultaneous consensus task is equivalent to the k-set agreement task in the wait-free read/write shared memory model, and furthermore k-simultaneous consensus possesses properties that k-set does not. In particular we show that the multivalued version and the binary version of the k-simultaneous consensus task are wait-free equivalent. These equivalences are independent of the number of processes. Interestingly, this provides us with a new characterization of the k-set agreement task that is based on the fundamental binary consensus problem. 相似文献
99.
Véronique Souchère Laurent Millair Javier Echeverria François Bousquet Christophe Le Page Michel Etienne 《Environmental Modelling & Software》2010,25(11):1359-1370
Erosive runoff is a recurring problem and is a source of sometimes deadly muddy floods in the Pays de Caux (France). The risk results from a conjunction of natural factors and human activity. Efficient actions against runoff in agricultural watersheds are well known. However they are still difficult to implement as they require co-operation between stakeholders. Local actors thus need tools to help them understand the collective consequences of their individual decisions and help to initiate a process of negotiation between them. We decided to use a participatory approach called companion modelling (ComMod), and, in close collaboration with one of the first group of local stakeholders, to create a role-playing game (RPG) to facilitate negotiations on the future management of erosive runoff. This paper describes and discusses the development of the RPG and its use with other groups of local stakeholders within the framework of two game sessions organized by two different watershed management committees. During the joint construction step, stakeholders shared their viewpoints about the environment, agents, rules, and how to model runoff in preparation for the creation of the RPG. During the RPG sessions, two groups of eight players, including farmers, mayors and watershed advisors, were confronted with disastrous runoff in a fictive agricultural watershed. Results showed that they managed to reduce runoff by 20–50% by engaging a dialogue about grass strips, storage ponds and management of the intercrop period. However, further progress is still needed to better control runoff through the implementation of better agricultural practices because, during the RPG sessions, the watershed advisors did not encourage farmers to do so. Because of the complexity of management problems, results of jointly constructing the game and the RPG sessions showed that modelling and simulation can be a very useful way of accompanying the collective learning process. This new way of working was welcomed by the participants who expressed their interest in organizing further RPG sessions. 相似文献
100.