首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   43855篇
  免费   4005篇
  国内免费   5630篇
测绘学   2356篇
大气科学   6022篇
地球物理   9549篇
地质学   21800篇
海洋学   3389篇
天文学   2543篇
综合类   4198篇
自然地理   3633篇
  2024年   98篇
  2023年   404篇
  2022年   916篇
  2021年   1090篇
  2020年   911篇
  2019年   1001篇
  2018年   5561篇
  2017年   4786篇
  2016年   3568篇
  2015年   1165篇
  2014年   1354篇
  2013年   1253篇
  2012年   2076篇
  2011年   3806篇
  2010年   3036篇
  2009年   3329篇
  2008年   2761篇
  2007年   3178篇
  2006年   813篇
  2005年   996篇
  2004年   939篇
  2003年   995篇
  2002年   847篇
  2001年   611篇
  2000年   715篇
  1999年   1018篇
  1998年   831篇
  1997年   885篇
  1996年   819篇
  1995年   688篇
  1994年   569篇
  1993年   518篇
  1992年   397篇
  1991年   293篇
  1990年   232篇
  1989年   183篇
  1988年   174篇
  1987年   126篇
  1986年   107篇
  1985年   76篇
  1984年   53篇
  1983年   46篇
  1982年   37篇
  1981年   49篇
  1980年   60篇
  1979年   28篇
  1978年   15篇
  1976年   17篇
  1975年   14篇
  1958年   18篇
排序方式: 共有10000条查询结果,搜索用时 108 毫秒
121.
对确定三层BP网络隐层节点数的理论依据和现有做法进行了研究,提出了一种三层BP网络隐层节点数的双向确定法  相似文献   
122.
基于彩色图像像素3刺激值与相应网点面积率之间的α幂修正的Neugebauer方程,建立由常规的调幅网为基础的调频挂网计算模型,以此实现分色胶片随机挂网  相似文献   
123.
Wu  Yun  Liu  Xiaolei  Liu  Wanke  Ren  Jie  Lou  Yidong  Dai  Xiaolei  Fang  Xing 《GPS Solutions》2017,21(4):1907-1922
GPS Solutions - We derive orbit and clock errors for BeiDou satellites from March 1, 2013, to September 30, 2016 by comparing broadcast ephemerides with the precise ephemerides produced by Wuhan...  相似文献   
124.
Zhao  Qile  Wang  Chen  Guo  Jing  Yang  Guanglin  Liao  Mi  Ma  Hongyang  Liu  Jingnan 《GPS Solutions》2017,21(3):1179-1190
GPS Solutions - A key limitation for precise orbit determination of BeiDou satellites, particularly for satellites in geostationary orbit (GEO), is the relative weak geometry of ground stations....  相似文献   
125.
We use the recently released data of lookback time (LT)-redshift relation, the cosmic microwave background shift parameter and the baryon acoustic oscillation measurements to constrain cosmological parameters of f (R) gravity in the Palatini formalism by considering the f (R) form of type (a) f (R) = R β/Rn and (b) f (R) = R + α ln R β. Under the assumption of a Friedmann-Robertson-Walker universe, we achieved the best fitting results of the free parameters (Ωm0, n) for (a) and (Ωm0, α) for (b). We find tha...  相似文献   
126.
The accuracy and efficiency of the simulations in distributed hydrological models must depend on the proper estimation of flow directions and paths. Numerous studies have been carried out to delineate the drainage patterns based on gridded digital elevation models (DEMs). The triangulated irregular network (TIN) has been increasingly applied in hydrological applications due to the advantages of high storage efficiency and multi‐scale adaptive performance. Much of the previous literature focuses mainly on filling the depressions on gridded DEMs rather than treating the special cases in TIN structures, which has hampered its applications to hydrological models. This study proposes a triangulation‐based solution for the removal of flat areas and pits to enhance the simulation of flow routing on triangulated facet networks. Based on the drainage‐constrained TIN generated from only a gridded DEM by the compound point extraction (CPE) method, the inconsistent situations including flat triangles, V‐shape flat edges and sink nodes are respectively identified and rectified. The optimization algorithm is an iterative process of TIN reconstruction, in which the flat areas are generalized into their center points and the pits are rectified by embedding break lines. To verify the proposed algorithm and investigate the potential for flow routing, flow paths of steepest descent are derived by the vector‐based tracking algorithm based on the optimized TIN. A case study of TIN optimization and flow path tracking was performed on a real‐world DEM. The outcomes indicate that the proposed approach can effectively solve the problem of inconsistencies without a significant loss in accuracy of the terrain model.  相似文献   
127.
Understanding the spatiotemporal dynamics of urban population is crucial for addressing a wide range of urban planning and management issues. Aggregated geospatial big data have been widely used to quantitatively estimate population distribution at fine spatial scales over a given time period. However, it is still a challenge to estimate population density at a fine temporal resolution over a large geographical space, mainly due to the temporal asynchrony of population movement and the challenges to acquiring a complete individual movement record. In this article, we propose a method to estimate hourly population density by examining the time‐series individual trajectories, which were reconstructed from call detail records using BP neural networks. We first used BP neural networks to predict the positions of mobile phone users at an hourly interval and then estimated the hourly population density using log‐linear regression at the cell tower level. The estimated population density is linearly correlated with population census data at the sub‐district level. Trajectory clustering results show five distinct diurnal dynamic patterns of population movement in the study area, revealing spatially explicit characteristics of the diurnal commuting flows, though the driving forces of the flows need further investigation.  相似文献   
128.
Buildings and other human-made constructions have been accepted as an indicator of human habitation and are identified as built-up area. Identification of built-up area in a region and its subsequent measurement is a key step in many fields of studies like urban planning, environmental studies, and population demography. Remote sensing techniques utilising medium resolution images (e.g. LISS III, Landsat) are extensively used for the extraction of the built-up area as high-resolution images are expensive, and its processing is difficult. Extraction of built land use from medium resolution images poses a challenge in regions like Western-Ghats, North-East regions of India, and countries in tropical region, due to the thick evergreen tree cover. The spectral signature of individual houses with a small footprint are easily overpowered by the overlapping tree canopy in a medium resolution image when the buildings are not clustered. Kerala is a typical case for this scenario. The research presented here proposes a stochastic-dasymetric process to aid in the built-up area recognition process by taking Kerala as a case study. The method utilises a set of ancillary information to derive a probability surface. The ancillary information used here includes distance from road junctions, distance from road network, population density, built-up space visible in the LISS III image, the population of the region, and the household size. The methodology employs logistic regression and Monte Carlo simulation in two sub processes. The algorithm estimates the built-up area expected in the region and distributes the estimated built-up area among pixels according to the probability estimated from the ancillary information. The output of the algorithm has two components. The first component is an example scenario of the built-up area distribution. The second component is a probability surface, where the value of each pixel denotes the probability of that pixel to have a significant built-up area within it. The algorithm is validated for regions in Kerala and found to be significant. The model correctly predicted the built-up pixel count count over a validation grid of 900 m in 95.2% of the cases. The algorithm is implemented using Python and ArcGIS.  相似文献   
129.
130.
It is difficult to obtain digital elevation model (DEM) in the mountainous regions. As an emerging technology, Light Detection and Ranging (LiDAR) is an enabling technology. However, the amount of points obtained by LiDAR is huge. When processing LiDAR point cloud, huge data will lead to a rapid decline in data processing speed, so it is necessary to thin LiDAR point cloud. In this paper, a new terrain sampling rule had been built based on the integrated terrain complexity, and then based on the rule a LiDAR point cloud simplification method, which was referred as to TCthin, had been proposed. The TCthin method was evaluated by experiments in which XUthin and Lasthin were selected as the TCthin’s comparative methods. The TCthin’s simplification degree was estimated by the simplification rate value, and the TCthin’s simplification quality was evaluated by Root Mean Square Deviation. The experimental results show that the TCthin method can thin LiDAR point cloud effectively and improve the simplification quality, and at 5 m, 10 m, 30 m scale levels, the TCthin method has a good applicability in the areas with different terrain complexity. This study has theoretical and practical value in sampling theory, thinning LiDAR point cloud, building high-precision DEM and so on.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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