全文获取类型
收费全文 | 3205篇 |
免费 | 148篇 |
国内免费 | 12篇 |
专业分类
电工技术 | 28篇 |
综合类 | 2篇 |
化学工业 | 664篇 |
金属工艺 | 71篇 |
机械仪表 | 86篇 |
建筑科学 | 144篇 |
矿业工程 | 12篇 |
能源动力 | 127篇 |
轻工业 | 278篇 |
水利工程 | 32篇 |
石油天然气 | 6篇 |
无线电 | 208篇 |
一般工业技术 | 655篇 |
冶金工业 | 632篇 |
原子能技术 | 25篇 |
自动化技术 | 395篇 |
出版年
2023年 | 52篇 |
2022年 | 82篇 |
2021年 | 104篇 |
2020年 | 107篇 |
2019年 | 103篇 |
2018年 | 101篇 |
2017年 | 92篇 |
2016年 | 92篇 |
2015年 | 70篇 |
2014年 | 100篇 |
2013年 | 182篇 |
2012年 | 145篇 |
2011年 | 208篇 |
2010年 | 143篇 |
2009年 | 143篇 |
2008年 | 185篇 |
2007年 | 150篇 |
2006年 | 107篇 |
2005年 | 101篇 |
2004年 | 75篇 |
2003年 | 70篇 |
2002年 | 44篇 |
2001年 | 48篇 |
2000年 | 47篇 |
1999年 | 54篇 |
1998年 | 54篇 |
1997年 | 43篇 |
1996年 | 51篇 |
1995年 | 43篇 |
1994年 | 28篇 |
1993年 | 19篇 |
1992年 | 26篇 |
1991年 | 15篇 |
1990年 | 26篇 |
1989年 | 25篇 |
1988年 | 17篇 |
1987年 | 21篇 |
1986年 | 23篇 |
1985年 | 27篇 |
1984年 | 15篇 |
1983年 | 18篇 |
1982年 | 21篇 |
1981年 | 23篇 |
1980年 | 28篇 |
1979年 | 18篇 |
1978年 | 24篇 |
1977年 | 19篇 |
1976年 | 20篇 |
1975年 | 16篇 |
1973年 | 18篇 |
排序方式: 共有3365条查询结果,搜索用时 28 毫秒
81.
Jun Cao Ayush Goyal Krista A. Novstrup Samuel P. Midkiff James M. Caruthers 《International journal of parallel programming》2009,37(2):127-152
Well designed domain specific languages have three important benefits: (1) the easy expression of problems, (2) the application
of domain specific optimizations (including parallelization), and (3) dramatic improvements in productivity for their users.
In this paper we describe a compiler and parallel runtime system for modeling the complex kinetics of rubber vulcanization
and olefin polymerization that achieves all of these goals. The compiler allows the development of a system of ordinary differential
equations describing a complex vulcanization reaction or single-site olefin polymerization reaction—a task that used to require
months—to be done in hours. A specialized common sub-expression elimination and other algebraic optimizations sufficiently
simplify the complex machine generated code to allow it to be compiled—eliminating all but 8.0% of the operations in our largest
program and enabling over 60 times faster execution on our largest benchmark codes. The parallel runtime and dynamic load
balancing scheme enables fast simulations of the model. 相似文献
82.
Samuel Aupetit Virginie Gallier Jacques Riff Stéphane Espié Flavien Delgehier 《Ergonomics》2016,59(8):1109-1120
This article sets out to identify the typical risky situations experienced by novice motorcyclists in the real world just after licensing. The procedure consists of a follow-up of six novices during their first two months of riding with their own motorbike instrumented with cameras. The novices completed logbooks on a daily basis in order to identify the risky situations they encountered, and were given face-to-face interviews to identify the context and their shortcomings during the reported events. Data show a large number of road configurations considered as risky by the riders (248 occurrences), especially during the first two weeks. The results revealed that a lack of hazard perception skills contributed to the majority of these incidents. These situations were grouped together to form clusters of typical incident scenarios on the basis of their similarities. The most frequent scenario corresponds to a lane change in dense traffic (15% of all incidents). The discussion shows how this has enhanced our understanding of novice riders’ behaviour and how the findings can improve training and licensing. Lastly, the main methodological limitations of the study and some guidelines for improving future naturalistic riding studies are presented.
Practitioner Summary:
This article aims to identify the risky situations of novice motorcyclists in real roads. Two hundred forty-eight events were recorded and 13 incident scenarios identified. Results revealed that a lack of hazard perception contributed to the majority of these events. The most frequent scenario corresponds to a lane change in dense traffic. 相似文献
83.
Bertrand Baud-Lavigne Samuel Bassetto Bruno Agard 《Journal of Intelligent Manufacturing》2016,27(4):741-749
This paper proposes a method for finding a robust solution to the problem of joint product family and supply chain design. Optimizing product design and the supply chain network at the same time brings substantial benefits. However, this approach involves decisions that can generate uncertainties in the long term. The challenge is to come up with a method that can adapt to most possible environments without straying too far from the optimal solution. Our approach is based on the generation of scenarios that correspond to combinations of uncertain parameters within the model. The performance of designs resulting from these scenario optimizations are compared to the performance of each of the other design scenarios, based on their probability of occurrence. The proposed methodology will allow practitioners to choose a suitable design, from the most profitable to the most reliable. 相似文献
84.
85.
Hasinoff SW Kutulakos KN 《IEEE transactions on pattern analysis and machine intelligence》2011,33(11):2203-2214
In this paper, we consider the problem of imaging a scene with a given depth of field at a given exposure level in the shortest amount of time possible. We show that by 1) collecting a sequence of photos and 2) controlling the aperture, focus, and exposure time of each photo individually, we can span the given depth of field in less total time than it takes to expose a single narrower-aperture photo. Using this as a starting point, we obtain two key results. First, for lenses with continuously variable apertures, we derive a closed-form solution for the globally optimal capture sequence, i.e., that collects light from the specified depth of field in the most efficient way possible. Second, for lenses with discrete apertures, we derive an integer programming problem whose solution is the optimal sequence. Our results are applicable to off-the-shelf cameras and typical photography conditions, and advocate the use of dense, wide-aperture photo sequences as a light-efficient alternative to single-shot, narrow-aperture photography. 相似文献
86.
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. 相似文献
87.
Design and Implementation of a PKI-Based End-to-End Secure Infrastructure for Mobile E-Commerce 总被引:2,自引:0,他引:2
The popularity of handheld mobile devices and deployment of the public key infrastructure in many parts of the world have led to the development of electronic commerce on mobile devices. For the current version of mobile phones, the main challenge is the limited computing capacity on these devices for PKI-based end-to-end secure transactions. This paper presents a new architecture and protocol for authentication and key exchange as well as the supporting infrastructure that is suitable for the mobile phone environment. The system requirements and our solutions in addressing these requirements in the restrictive environment are discussed. An evaluation of the system performance is also included. The system has been implemented and is supporting some real-life applications. 相似文献
88.
89.
The arguments given in this paper suggest that Grover’s and Shor’s algorithms are more closely related than one might at first
expect. Specifically, we show that Grover’s algorithm can be viewed as a quantum algorithm which solves a non-abelian hidden
subgroup problem (HSP). But we then go on to show that the standard non-abelian quantum hidden subgroup (QHS) algorithm can
not find a solution to this particular HSP. This leaves open the question as to whether or not there is some modification
of the standard non-abelian QHS algorithm which is equivalent to Grover’s algorithm.
相似文献
90.
The purpose of the study was to determine the level of energy expenditure and exposure to air pollution for bicycle messengers. Relationships between heart rate (HR) and oxygen uptake, and between HR and pulmonary ventilation (VE) for each participant were established in laboratory tests. Air pollution and HR were measured during one working day. The total oxygen uptake was then described as the total energy expenditure in Joule (J) and in multiples of the energy expenditure at rest (MET). The mean energy expenditure during a working day (8 h) was 12 MJ, (4.8 MET). The level of air pollution exposure when cycling seemed to be comparable with the levels of exposure when sitting inside a vehicle. The VE during cycling was four times higher than resting value. Increased VE led to increased exposure to air pollution. 相似文献