全文获取类型
收费全文 | 9022篇 |
免费 | 152篇 |
国内免费 | 7篇 |
专业分类
电工技术 | 226篇 |
综合类 | 1篇 |
化学工业 | 2053篇 |
金属工艺 | 263篇 |
机械仪表 | 173篇 |
建筑科学 | 437篇 |
矿业工程 | 88篇 |
能源动力 | 254篇 |
轻工业 | 217篇 |
水利工程 | 49篇 |
石油天然气 | 45篇 |
武器工业 | 1篇 |
无线电 | 1754篇 |
一般工业技术 | 1298篇 |
冶金工业 | 1181篇 |
原子能技术 | 163篇 |
自动化技术 | 978篇 |
出版年
2021年 | 60篇 |
2016年 | 60篇 |
2015年 | 88篇 |
2014年 | 137篇 |
2013年 | 650篇 |
2012年 | 134篇 |
2011年 | 212篇 |
2010年 | 195篇 |
2009年 | 257篇 |
2008年 | 218篇 |
2007年 | 189篇 |
2006年 | 236篇 |
2005年 | 221篇 |
2004年 | 196篇 |
2003年 | 214篇 |
2002年 | 246篇 |
2001年 | 237篇 |
2000年 | 223篇 |
1999年 | 216篇 |
1998年 | 244篇 |
1997年 | 237篇 |
1996年 | 227篇 |
1995年 | 198篇 |
1994年 | 233篇 |
1993年 | 212篇 |
1992年 | 218篇 |
1991年 | 189篇 |
1990年 | 215篇 |
1989年 | 219篇 |
1988年 | 167篇 |
1987年 | 149篇 |
1986年 | 137篇 |
1985年 | 105篇 |
1984年 | 113篇 |
1983年 | 93篇 |
1982年 | 97篇 |
1981年 | 112篇 |
1980年 | 94篇 |
1979年 | 96篇 |
1978年 | 94篇 |
1977年 | 105篇 |
1976年 | 85篇 |
1975年 | 97篇 |
1974年 | 74篇 |
1973年 | 73篇 |
1972年 | 89篇 |
1971年 | 78篇 |
1970年 | 78篇 |
1969年 | 68篇 |
1965年 | 68篇 |
排序方式: 共有9181条查询结果,搜索用时 0 毫秒
111.
112.
113.
Patrick Ciarlet Jr. Grace Hechme 《Computer Methods in Applied Mechanics and Engineering》2008,198(2):358-365
Costabel and Dauge proposed a variational setting to solve numerically the time-harmonic Maxwell equations in 3D polyhedral geometries, with a continuous approximation of the electromagnetic field. In order to remove spurious eigenmodes, three computational strategies are then possible. The original method, which requires a parameterization of the variational formulation. The second method, which is based on an a posteriori filtering of the computed eigenmodes. And the third method, which uses a mixed variational setting so that all spurious modes are removed a priori. In this paper, we discuss the relative merits of the approaches, which are illustrated by a series of 3D numerical examples. 相似文献
114.
In telecommunication and transportation systems, the uncapacitated multiple allocation hub location problem (UMAHLP) arises when we must flow commodities or information between several origin–destination pairs. Instead of establishing a direct node to node connection from an origin to its destination, the flows are concentrated with others at facilities called hubs. These flows are transported on links established between hubs, being then splitted and delivered to its final destination. Systems with this sort of topology are named hub-and-spoke (HS) systems or hub-and-spoke networks. They are designed to exploit the scale economies attainable through the shared use of high capacity links between hubs. Therefore, the problem is to find the least expensive HS network, selecting hubs and assigning traffic to them, given the demands between each origin–destination pair and the respective transportation costs. In the present paper, we present efficient Benders decomposition algorithms based on a well known formulation to tackle the UMAHLP. We have been able to solve some large instances, considered ‘out of reach’ of other exact methods in reasonable time. 相似文献
115.
S.T. Newman A. Nassehi X.W. Xu R.S.U. Rosso Jr. L. Wang Y. Yusof L. Ali R. Liu L.Y. Zheng S. Kumar P. Vichare V. Dhokia 《Robotics and Computer》2008
In the domain of manufacturing, computer numerically controllers (CNC) technology is a major contributor to the production capacity of the enterprises. The advances in CNC technology coupled with enhancements in computing systems have provided the basis to re-examine the way in which computer-aided systems (CAx) can be used to enable global manufacturing. Interoperability of the various components of the CAx chain is therefore a major prerequisite for manufacturing enterprises for becoming strategically agile and consequently globally competitive. Being interoperable, resources can be utilized interchangeably in a plug-and-produce manner. Over the last 8 years the eminence of a STEP standard for machining entitled STEP-NC (numerical control) has become a well-known vehicle for research to improve the level of information availability at the CNC machine tool. In this paper, the authors introduce the background to the evolution of CNC manufacturing over the last 50 years and the current standards available for programming. A review of the literature in interoperable CNC manufacturing is then provided relating to milling, turn–mill and other NC processes. The major part of the paper provides a strategic view of how interoperability can be implemented across the CAx chain with a range of standards used to regulate the flow of information. Finally, the paper outlines the advantages and major issues for future developments in interoperability, identifying future key requirements and limiting factors. 相似文献
116.
Nature takes a variety of approaches regarding risk concentration. Stationary life tends to bend but not break, whereas mobile life tends toward risk concentration with stout border protection. Client and network devices tend to follow the latter model. 相似文献
117.
Indices are a common and useful way to summarize a changing field for both the lay and the specialist reader, and it's time that we had them for information security. 相似文献
118.
Summary Poly(phenylene sulfide) (PPS) was cured in the melt and solid states under air and/or nitrogen environments. Crystallization behavior of such cured materials as a function of cure time at 320°C and 255°C was studied via differential scanning calorimetry. It was found, on general, that while short-time curing leads to an increase in crystallization rate, prolonged curing leads to a decrease in both crystallinity and crystallization rate. In contrast to the enhanced crystallization rate caused by curing in nitrogen at the melt state, no significant change of crystallization rate is observed while curing is done in the solid state (in nitrogen). 相似文献
119.
The Graphics Processing Unit (GPU) is a powerful tool for parallel computing. In the past years the performance and capabilities of GPUs have increased, and the Compute Unified Device Architecture (CUDA) - a parallel computing architecture - has been developed by NVIDIA to utilize this performance in general purpose computations. Here we show for the first time a possible application of GPU for environmental studies serving as a basement for decision making strategies. A stochastic Lagrangian particle model has been developed on CUDA to estimate the transport and the transformation of the radionuclides from a single point source during an accidental release. Our results show that parallel implementation achieves typical acceleration values in the order of 80-120 times compared to CPU using a single-threaded implementation on a 2.33 GHz desktop computer. Only very small differences have been found between the results obtained from GPU and CPU simulations, which are comparable with the effect of stochastic transport phenomena in atmosphere. The relatively high speedup with no additional costs to maintain this parallel architecture could result in a wide usage of GPU for diversified environmental applications in the near future. 相似文献
120.
Caio César Mori Carélo Ives Renê Venturini Pola Ricardo Rodrigues Ciferri Agma Juci Machado Traina Caetano Traina Jr Cristina Dutra de Aguiar Ciferri 《Information Systems》2011
Searching in a dataset for elements that are similar to a given query element is a core problem in applications that manage complex data, and has been aided by metric access methods (MAMs). A growing number of applications require indices that must be built faster and repeatedly, also providing faster response for similarity queries. The increase in the main memory capacity and its lowering costs also motivate using memory-based MAMs. In this paper, we propose the Onion-tree, a new and robust dynamic memory-based MAM that slices the metric space into disjoint subspaces to provide quick indexing of complex data. It introduces three major characteristics: (i) a partitioning method that controls the number of disjoint subspaces generated at each node; (ii) a replacement technique that can change the leaf node pivots in insertion operations; and (iii) range and k-NN extended query algorithms to support the new partitioning method, including a new visit order of the subspaces in k-NN queries. Performance tests with both real-world and synthetic datasets showed that the Onion-tree is very compact. Comparisons of the Onion-tree with the MM-tree and a memory-based version of the Slim-tree showed that the Onion-tree was always faster to build the index. The experiments also showed that the Onion-tree significantly improved range and k-NN query processing performance and was the most efficient MAM, followed by the MM-tree, which in turn outperformed the Slim-tree in almost all the tests. 相似文献