首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   4830篇
  免费   188篇
  国内免费   16篇
电工技术   49篇
综合类   3篇
化学工业   881篇
金属工艺   125篇
机械仪表   132篇
建筑科学   220篇
矿业工程   19篇
能源动力   153篇
轻工业   392篇
水利工程   53篇
石油天然气   15篇
无线电   326篇
一般工业技术   852篇
冶金工业   1155篇
原子能技术   53篇
自动化技术   606篇
  2023年   59篇
  2022年   75篇
  2021年   114篇
  2020年   119篇
  2019年   114篇
  2018年   121篇
  2017年   108篇
  2016年   121篇
  2015年   87篇
  2014年   117篇
  2013年   246篇
  2012年   181篇
  2011年   244篇
  2010年   178篇
  2009年   190篇
  2008年   238篇
  2007年   192篇
  2006年   145篇
  2005年   142篇
  2004年   104篇
  2003年   103篇
  2002年   67篇
  2001年   86篇
  2000年   86篇
  1999年   99篇
  1998年   222篇
  1997年   147篇
  1996年   135篇
  1995年   99篇
  1994年   78篇
  1993年   69篇
  1992年   37篇
  1991年   39篇
  1990年   50篇
  1989年   46篇
  1988年   36篇
  1987年   41篇
  1986年   50篇
  1985年   54篇
  1984年   37篇
  1983年   31篇
  1982年   44篇
  1981年   39篇
  1980年   50篇
  1979年   32篇
  1978年   33篇
  1977年   36篇
  1976年   52篇
  1975年   29篇
  1973年   28篇
排序方式: 共有5034条查询结果,搜索用时 171 毫秒
121.
122.
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.  相似文献   
123.
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.  相似文献   

124.
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.  相似文献   
125.
126.
127.
Satellite images, along with oceanographic, meteorological, and whale aerial survey data, are used to illustrate aspects of ocean circulation associated with a bowhead whale feeding ‘hotspot’ near Barrow, Alaska. In response to weak winds, a strong front forms near the shelf-break along the southern edge of Barrow Canyon when the Alaska Coastal Current flows adjacent to the southern flank of Barrow Canyon or intrudes onto the western Beaufort shelf. This front is of particular local interest because it is indicative of aggregation and retention of zooplankton on the western Beaufort shelf and, as a result, is a locus for bowhead whales pausing to feed during their westward fall migration. Groups (4 or more individuals) of bowhead whales are primarily seen on the western Beaufort shelf following wind conditions that promote the formation of this front.  相似文献   
128.
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.  相似文献   
129.
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.  相似文献   
130.
The verification process of reactive systems in local model checking [1,7] and in explicit state model checking is[13,15] on-the-fly. Therefore only those states of a system have to be traversed that are necessary to prove a property. In addition, if the property does not hold, than often only a small subset of the state space has to be traversed to produce a counterexample. Global model checking [6,23] and, in particular, symbolic model checking [4,22] can utilize compact representations of the state space, e.g. BDDs [3], to handle much larger designs than what is possible with local and explicit model checking. We present a new model checking algorithm for LTL that combines both approaches. In essence, it is a generalization of the tableau construction of [1] that enables the use of BDDs but still is on-the-fly.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号