全文获取类型
收费全文 | 967篇 |
免费 | 45篇 |
国内免费 | 1篇 |
专业分类
电工技术 | 5篇 |
综合类 | 3篇 |
化学工业 | 262篇 |
金属工艺 | 38篇 |
机械仪表 | 24篇 |
建筑科学 | 25篇 |
矿业工程 | 2篇 |
能源动力 | 29篇 |
轻工业 | 65篇 |
水利工程 | 3篇 |
石油天然气 | 10篇 |
无线电 | 57篇 |
一般工业技术 | 271篇 |
冶金工业 | 41篇 |
原子能技术 | 15篇 |
自动化技术 | 163篇 |
出版年
2024年 | 3篇 |
2023年 | 13篇 |
2022年 | 53篇 |
2021年 | 54篇 |
2020年 | 19篇 |
2019年 | 25篇 |
2018年 | 34篇 |
2017年 | 29篇 |
2016年 | 41篇 |
2015年 | 26篇 |
2014年 | 44篇 |
2013年 | 89篇 |
2012年 | 74篇 |
2011年 | 64篇 |
2010年 | 34篇 |
2009年 | 40篇 |
2008年 | 47篇 |
2007年 | 55篇 |
2006年 | 41篇 |
2005年 | 27篇 |
2004年 | 32篇 |
2003年 | 26篇 |
2002年 | 22篇 |
2001年 | 20篇 |
2000年 | 14篇 |
1999年 | 14篇 |
1998年 | 6篇 |
1997年 | 12篇 |
1996年 | 13篇 |
1995年 | 5篇 |
1994年 | 10篇 |
1993年 | 5篇 |
1992年 | 6篇 |
1991年 | 1篇 |
1990年 | 2篇 |
1987年 | 1篇 |
1984年 | 2篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1976年 | 1篇 |
1975年 | 3篇 |
1971年 | 1篇 |
排序方式: 共有1013条查询结果,搜索用时 0 毫秒
11.
This paper resolves the problem of predicting as well as the best expert up to an additive term of the order o(n), where n is the length of a sequence of letters from a finite alphabet. We call the games that permit this weakly mixable and give a geometrical characterisation of the class of weakly mixable games. Weak mixability turns out to be equivalent to convexity of the finite part of the set of superpredictions. For bounded games we introduce the Weak Aggregating Algorithm that allows us to obtain additive terms of the form . 相似文献
12.
Sangram Ganguly Arindam Samanta Mitchell A. Schull Nikolay V. Shabanov Cristina Milesi Ramakrishna R. Nemani Yuri Knyazikhin Ranga B. Myneni 《Remote sensing of environment》2008,112(12):4318-4332
The evaluation of a new global monthly leaf area index (LAI) data set for the period July 1981 to December 2006 derived from AVHRR Normalized Difference Vegetation Index (NDVI) data is described. The physically based algorithm is detailed in the first of the two part series. Here, the implementation, production and evaluation of the data set are described. The data set is evaluated both by direct comparisons to ground data and indirectly through inter-comparisons with similar data sets. This indirect validation showed satisfactory agreement with existing LAI products, importantly MODIS, at a range of spatial scales, and significant correlations with key climate variables in areas where temperature and precipitation limit plant growth. The data set successfully reproduced well-documented spatio-temporal trends and inter-annual variations in vegetation activity in the northern latitudes and semi-arid tropics. Comparison with plot scale field measurements over homogeneous vegetation patches indicated a 7% underestimation when all major vegetation types are taken into account. The error in mean values obtained from distributions of AVHRR LAI and high-resolution field LAI maps for different biomes is within 0.5 LAI for six out of the ten selected sites. These validation exercises though limited by the amount of field data, and thus less than comprehensive, indicated satisfactory agreement between the LAI product and field measurements. Overall, the inter-comparison with short-term LAI data sets, evaluation of long term trends with known variations in climate variables, and validation with field measurements together build confidence in the utility of this new 26 year LAI record for long term vegetation monitoring and modeling studies. 相似文献
13.
14.
Data discretization unification 总被引:2,自引:1,他引:1
15.
Dynamic system of relative degree two controlled by discontinuous‐hybrid‐impulsive feedback in the presence of bounded perturbations is considered. The state feedback impulsive‐twisting control exhibits a uniform exact finite time convergence to the second‐order sliding mode with zero convergence time. The output feedback discontinuous control augmented by a simplified hybrid‐impulsive functions provides uniform exact convergence with zero convergence time of the system's states to a real second‐order sliding mode in the presence of bounded perturbations. Only ‘snap’ knowledge of the output derivative, that is, the knowledge of the output derivative in isolated time instants, is required. The output feedback hybrid‐impulsive control with practically implemented impulsive actions asymptotically drives the system's states to the origin. The Lyapunov analysis of the considered hybrid‐impulsive‐discontinuous system proves the system's stability. The efficacy of the proposed control technique is illustrated via computer simulations. Copyright © 2016 John Wiley & Sons, Ltd. 相似文献
16.
This paper describes a simple method of fast background subtraction based upon disparity verification that is invariant to arbitrarily rapid run-time changes in illumination. Using two or more cameras, the method requires the off-line construction of disparity fields mapping the primary background images. At runtime, segmentation is performed by checking background image to each of the additional auxiliary color intensity values at corresponding pixels. If more than two cameras are available, more robust segmentation can be achieved and, in particular, the occlusion shadows can be generally eliminated as well. Because the method only assumes fixed background geometry, the technique allows for illumination variation at runtime. Since no disparity search is performed, the algorithm is easily implemented in real-time on conventional hardware. 相似文献
17.
明天的航海电气系统将同今天的系统有极大的不同。电力电子给予船舶上包括推进、电力分配、备用电源、声纳和雷达等在内的各种系统的进展以重要的影响。刚刚出现的新材料、新器件和新的系统概念(诸如宽带半导体材料、碳化硅基的电力半导体器件、电力电子模组(PEBB),以及集成功率系统)正在使、并将持续地使未来的航海系统有别于今天的系统,如同内燃船舶有别于蒸汽船舶。但是,这些正在实现的技术和有关概念还未被大家所周知,而且还有难于理解的地方。本文就将介绍这些新概念和新技术,指出潜在的影响力,并揭示新的设计方法,以推动航海电气系统的发展。 相似文献
18.
Presented is a method of smooth sliding mode control design to provide for an asymptotic second‐order sliding mode on the selected sliding surface. The control law is a nonlinear dynamic feedback that in absence of unknown disturbances provides for an asymptotic second‐order sliding mode. Application of the second‐order disturbance observer in a combination with the proposed continuous control law practically gives the second‐order sliding accuracy in presence of unknown disturbances and discrete‐time control update. The piecewise constant control feedback is “smooth” in the sense that its derivative numerically taken at sampling rate does not contain high frequency components. A numerical example is presented. 相似文献
19.
In recent years the processing speed of computers has increased dramatically. This in turn has allowed search algorithms to execute more iterations in a given amount of real-time. Does this necessarily always lead to an improvement in the quality of final solutions? This paper is devoted to the investigation of that question. We present two variants of local search where the search time can be set as an input parameter. These two approaches are: a time-predefined variant of simulated annealing and an adaptation of the “great deluge” method. We present a comprehensive series of experiments which show that these approaches significantly outperform the previous best results (in terms of solution quality) on a range of benchmark exam timetabling problems. Of course, there is a price to pay for such better results: increased execution time. We discuss the impact of this trade-off between quality and execution time. In particular we discuss issues involving the proper estimation of the algorithm's execution time and the assessment of its importance. 相似文献
20.
Gold introduced the notion of learning in the limit where a class S is learnable iff there is a recursive machine M which reads the course of values of a function f and converges to a program for f whenever f is in S. An important measure for the speed of convergence in this model is the quantity of mind changes before the onset of convergence. The oldest model is to consider a constant bound on the number of mind changes M makes on any input function; such a bound is referred here as type 1. Later this was generalized to a bound of type 2 where a counter ranges over constructive ordinals and is counted down at every mind change. Although ordinal bounds permit the inference of richer concept classes than constant bounds, they still are a severe restriction. Therefore the present work introduces two more general approaches to bounding mind changes. These are based on counting by going down in a linearly ordered set (type 3) and on counting by going down in a partially ordered set (type 4). In both cases the set must not contain infinite descending recursive sequences. These four types of mind changes yield a hierarchy and there are identifiable classes that cannot be learned with the most general mind change bound of type 4. It is shown that existence of type 2 bound is equivalent to the existence of a learning algorithm which converges on every (also nonrecursive) input function and the existence of type 4 is shown to be equivalent to the existence of a learning algorithm which converges on every recursive function. A partial characterization of type 3 yields a result of independent interest in recursion theory. The interplay between mind change complexity and choice of hypothesis space is investigated. It is established that for certain concept classes, a more expressive hypothesis space can sometimes reduce mind change complexity of learning these classes. The notion of mind change bound for behaviourally correct learning is indirectly addressed by employing the above four types to restrict the number of predictive errors of commission in finite error next value learning (NV′′)—a model equivalent to behaviourally correct learning. Again, natural characterizations for type 2 and type 4 bounds are derived. Their naturalness is further illustrated by characterizing them in terms of branches of uniformly recursive families of binary trees. 相似文献