全文获取类型
收费全文 | 21051篇 |
免费 | 3835篇 |
国内免费 | 4894篇 |
专业分类
测绘学 | 1045篇 |
大气科学 | 4189篇 |
地球物理 | 5411篇 |
地质学 | 10742篇 |
海洋学 | 2446篇 |
天文学 | 953篇 |
综合类 | 2422篇 |
自然地理 | 2572篇 |
出版年
2024年 | 98篇 |
2023年 | 402篇 |
2022年 | 911篇 |
2021年 | 1091篇 |
2020年 | 904篇 |
2019年 | 993篇 |
2018年 | 1196篇 |
2017年 | 1069篇 |
2016年 | 1274篇 |
2015年 | 944篇 |
2014年 | 1273篇 |
2013年 | 1223篇 |
2012年 | 1125篇 |
2011年 | 1204篇 |
2010年 | 1138篇 |
2009年 | 1130篇 |
2008年 | 1003篇 |
2007年 | 980篇 |
2006年 | 766篇 |
2005年 | 821篇 |
2004年 | 582篇 |
2003年 | 619篇 |
2002年 | 616篇 |
2001年 | 571篇 |
2000年 | 668篇 |
1999年 | 1002篇 |
1998年 | 809篇 |
1997年 | 884篇 |
1996年 | 817篇 |
1995年 | 686篇 |
1994年 | 565篇 |
1993年 | 514篇 |
1992年 | 395篇 |
1991年 | 291篇 |
1990年 | 232篇 |
1989年 | 182篇 |
1988年 | 174篇 |
1987年 | 126篇 |
1986年 | 107篇 |
1985年 | 76篇 |
1984年 | 53篇 |
1983年 | 46篇 |
1982年 | 37篇 |
1981年 | 28篇 |
1980年 | 41篇 |
1979年 | 28篇 |
1978年 | 15篇 |
1976年 | 11篇 |
1975年 | 14篇 |
1958年 | 18篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
101.
102.
C-IMAGE: city cognitive mapping through geo-tagged photos 总被引:3,自引:0,他引:3
103.
104.
105.
This paper presents a new type of rainfall retrieval algorithm, called the model-oriented statistical and Volterra integration. It is a combination of the model-oriented statistical (MOS) and Volterra integral equation (VIE) approaches. The steps involved in this new algorithm can be briefly illustrated as follows. Firstly, information such as the start point and width of the rain is obtained through pre-analysis of the data received by synthetic aperture radar (SAR). Secondly, the VIE retrieval algorithm is employed over a short distance to obtain information on the shape of the rain. Finally, the rain rate can be calculated by using the MOS retrieval algorithm. Simulation results show that the proposed algorithm is effective and simple, and can lead to time savings of nearly 50% compared with MOS. An example of application of SAR data is also discussed, involving the retrieval of precipitation information over the South China Sea. 相似文献
106.
107.
108.
109.
110.
Multiobjective optimization deals with mathematical optimization problems where two or more objective functions (cost functions) are to be optimized (maximized or minimized) simultaneously. In most cases of interest, the objective functions are in conflict, i.e., there does not exist a decision (design) vector (vector of optimization variables) at which every objective function takes on its optimal value. The solution of a multiobjective problem is commonly defined as a Pareto front, and any decision vector which maps to a point on the Pareto front is said to be Pareto optimal. We present an original derivation of an analytical expression for the steepest descent direction for multiobjective optimization for the case of two objectives. This leads to an algorithm which can be applied to obtain Pareto optimal points or, equivalently, points on the Pareto front when the problem is the minimization of two conflicting objectives. The method is in effect a generalization of the steepest descent algorithm for minimizing a single objective function. The steepest-descent multiobjective optimization algorithm is applied to obtain optimal well controls for two example problems where the two conflicting objectives are the maximization of the life-cycle (long-term) net-present-value (NPV) and the maximization of the short-term NPV. The results strongly suggest the multiobjective steepest-descent (MOSD) algorithm is more efficient than competing multiobjective optimization algorithms. 相似文献