全文获取类型
收费全文 | 4993篇 |
免费 | 176篇 |
国内免费 | 6篇 |
专业分类
电工技术 | 63篇 |
综合类 | 2篇 |
化学工业 | 1240篇 |
金属工艺 | 76篇 |
机械仪表 | 113篇 |
建筑科学 | 231篇 |
矿业工程 | 7篇 |
能源动力 | 175篇 |
轻工业 | 367篇 |
水利工程 | 28篇 |
石油天然气 | 11篇 |
无线电 | 577篇 |
一般工业技术 | 856篇 |
冶金工业 | 548篇 |
原子能技术 | 61篇 |
自动化技术 | 820篇 |
出版年
2022年 | 55篇 |
2021年 | 81篇 |
2020年 | 47篇 |
2019年 | 61篇 |
2018年 | 85篇 |
2017年 | 102篇 |
2016年 | 125篇 |
2015年 | 88篇 |
2014年 | 113篇 |
2013年 | 254篇 |
2012年 | 213篇 |
2011年 | 258篇 |
2010年 | 212篇 |
2009年 | 222篇 |
2008年 | 212篇 |
2007年 | 219篇 |
2006年 | 223篇 |
2005年 | 162篇 |
2004年 | 174篇 |
2003年 | 142篇 |
2002年 | 147篇 |
2001年 | 111篇 |
2000年 | 103篇 |
1999年 | 82篇 |
1998年 | 159篇 |
1997年 | 136篇 |
1996年 | 111篇 |
1995年 | 103篇 |
1994年 | 98篇 |
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篇 |
排序方式: 共有5175条查询结果,搜索用时 15 毫秒
91.
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. 相似文献
92.
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. 相似文献
93.
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. 相似文献
94.
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. 相似文献
95.
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. 相似文献
96.
97.
98.
Souleiman Naciri Naoufel Cheikhrouhou Michel Pouly Jean-Charles Binggeli Rémy Glardon 《Expert systems with applications》2011,38(2):1203-1212
Nowadays, all product life cycle processes are investigated deeply in order to get an advantage over competitors. To support these processes, several software applications are available. However, this wide range of heterogeneous applications leads to a large variety of hardware and operating systems, data management software, data models, schemas, and data semantics that hinder the information sharing process. To tackle this problem, Hitachi Company has developed a modeling language called Generic Product Model (GPM) in addition to several translators from native formats to GPM for storing, sharing and visualizing product data in a single data warehouse. In order to broaden the range of application data able to be stored and shared using the GPM data warehouse, this paper presents a methodology and a translator that allow management data to be included in a GPM data warehouse. Given the fact that most management data are stored in Enterprise Resource Planning (ERP) software, and that the latter allows extraction of database contents into Excel files, we propose a translator that handles Enterprise Resource Planning management data that are already extracted into Excel Format.The proposed framework enables data management contained in flat Excel Files to be translated into structured GPM data. Translation methodologies are given for the translation of mass production and customized product data through two case studies, one in the computer retail sector and the other in the extrusion machine industry. 相似文献
99.
This paper describes an efficient Web page detection approach based on restricting the similarity computations between two
versions of a given Web page to the nodes with the same HTML tag type. Before performing the similarity computations, the
HTML Web page is transformed into an XML-like structure in which a node corresponds to an open-closed HTML tag. Analytical
expressions and supporting experimental results are used to quantify the improvements that are made when comparing the proposed
approach to the traditional one, which computes the similarities across all nodes of both pages. It is shown that the improvements
are highly dependent on the diversity of tags in the page. That is, the more diverse the page is (i.e., contains mixed content
of text, images, links, etc.), the greater the improvements are, while the more uniform it is, the lesser they are. 相似文献
100.
Thomas Neumann Matthias Bender Sebastian Michel Ralf Schenkel Peter Triantafillou Gerhard Weikum 《Distributed and Parallel Databases》2009,26(1):3-27
Top-k query processing is a fundamental building block for efficient ranking in a large number of applications. Efficiency is a
central issue, especially for distributed settings, when the data is spread across different nodes in a network. This paper
introduces novel optimization methods for top-k aggregation queries in such distributed environments. The optimizations can be applied to all algorithms that fall into the
frameworks of the prior TPUT and KLEE methods. The optimizations address three degrees of freedom: 1) hierarchically grouping
input lists into top-k operator trees and optimizing the tree structure, 2) computing data-adaptive scan depths for different input sources, and
3) data-adaptive sampling of a small subset of input sources in scenarios with hundreds or thousands of query-relevant network
nodes. All optimizations are based on a statistical cost model that utilizes local synopses, e.g., in the form of histograms,
efficiently computed convolutions, and estimators based on order statistics. The paper presents comprehensive experiments,
with three different real-life datasets and using the ns-2 network simulator for a packet-level simulation of a large Internet-style
network. 相似文献