全文获取类型
收费全文 | 8237篇 |
免费 | 1412篇 |
国内免费 | 1996篇 |
专业分类
测绘学 | 408篇 |
大气科学 | 1979篇 |
地球物理 | 2092篇 |
地质学 | 4203篇 |
海洋学 | 864篇 |
天文学 | 387篇 |
综合类 | 803篇 |
自然地理 | 909篇 |
出版年
2024年 | 33篇 |
2023年 | 170篇 |
2022年 | 377篇 |
2021年 | 419篇 |
2020年 | 338篇 |
2019年 | 341篇 |
2018年 | 447篇 |
2017年 | 411篇 |
2016年 | 466篇 |
2015年 | 356篇 |
2014年 | 469篇 |
2013年 | 464篇 |
2012年 | 360篇 |
2011年 | 391篇 |
2010年 | 432篇 |
2009年 | 424篇 |
2008年 | 419篇 |
2007年 | 374篇 |
2006年 | 342篇 |
2005年 | 309篇 |
2004年 | 219篇 |
2003年 | 264篇 |
2002年 | 263篇 |
2001年 | 225篇 |
2000年 | 290篇 |
1999年 | 412篇 |
1998年 | 373篇 |
1997年 | 385篇 |
1996年 | 340篇 |
1995年 | 279篇 |
1994年 | 254篇 |
1993年 | 185篇 |
1992年 | 166篇 |
1991年 | 127篇 |
1990年 | 85篇 |
1989年 | 97篇 |
1988年 | 84篇 |
1987年 | 57篇 |
1986年 | 42篇 |
1985年 | 36篇 |
1984年 | 21篇 |
1983年 | 25篇 |
1982年 | 10篇 |
1981年 | 14篇 |
1980年 | 21篇 |
1979年 | 10篇 |
1978年 | 5篇 |
1977年 | 4篇 |
1958年 | 9篇 |
1954年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 18 毫秒
21.
传统基于“图层付象”的组织方法,没有考虑三维城市模型的不同内容以及不同细节层次的粒度差异,导致在网络环境下的传输效率低,难以满足多用户并发访问的流畅可视化。深入分析了大范围漫游与小范围聚焦的用户体验特点,通过元数据统筹管理和对象离散化,即时响应用户请求,减少无效数据传输,保证了多用户并发环境下的高效调度和浏览。针对模型LoI)和分解的对象,设计了结构统一的对象ID,隐式存储关联关系并支持分布式模型存储管理。以分布式数据库MongoDB为平台进行实验,验证了本文方法的可行性和有效性。 相似文献
22.
针对高频雷达强海杂波和干扰环境下的多目标检测问题,结合S-method时频分布和Vitcrbi算法提出了一种多分量线性调频信号瞬时频率估计方法—SMVF法(S-method viterbi fitting),然后根据所提取的瞬时频率的直线拟合性能,提出了一种自适应多目标检测算法。实测数据的处理结果,表明了该算法在低信噪比时,与WDM法(wigncr distribution maxima) , WDV法( wigncr distribution vitcrbi)相比,估计精度提高约2000,验证了该算法的可行性和有效性。 相似文献
23.
24.
25.
根据抗差估计中误差的最基本假设一对称分布,考虑到ρ函数的条件及把反对称估计作为抗差估计计算迭代的初始值,验证了定位参数的抗差估计值也一定是反对称估计,满足无偏性条件,得到定位参数的抗差估计是无偏估计. 相似文献
26.
洪洲 《测绘与空间地理信息》2013,(3):118-121,124,128
空间索引技术在诸多领域均有十分重要的研究意义,目前已存在很多种建立方法,各有优缺点。MapInfo软件功能强大易用,但不具有建立空间索引这项功能,因此本文主要研究在MAPX基础上建立一种适合MapInfo数据的空间索引。该方法主要针对车载导航系统中的一个基本算法地图匹配来进行研究。采用单层规则格网建立的空间索引并对其进行改进,在第一步划分的基础上再次进行网格划分,建立起两级交错式划分方法的空间索引。通过实验表明该方法使实时路段搜索过程的实现简单、方便、明了。 相似文献
27.
The research work has been seldom done about cloverleaf junction expression in a 3-dimensional city model (3DCM). The main reason is that the cloverleaf junction is often in a complex and enormous construction. Its main body is bestraddle in air, and has aerial intersections between its parts. This complex feature made cloverleaf junction quite different from buildings and terrain, therefore, it is difficult to express this kind of spatial objects in the same way as for buildings and terrain. In this paper, authors analyze spatial characteristics of cloverleaf junction, propose an all-constraint points TIN algorithm to partition cloverleaf junction road surface, and develop a method to visualize cloverleaf junction road, surface using TIN. In order to manage cloverleaf junction data efficiently, the authors also analyzed the mechanism of 3DCM data management, extended BLOB type in relational database, and combined R-tree index to manage 3D spatial data. Based on this extension, an appropriate data structure for cloverleaf junction in 3DCM is proposed. 相似文献
28.
29.
ABSTRACTSocial, economic, and environmental statistical data associated with geographic points are currently globally available in large amounts. When conventional thematic maps, such as proportional symbol maps or point diagram maps, are used to represent these data, the maps appear cluttered if the point data volumes are relatively large or cover a relatively dense region. To overcome these limitations, we propose a new type of thematic map for statistical data associated with geographic points: the point grid map. In a point grid map, an input point data set is transformed into a grid in which each point is represented by a square grid cell of equal size while preserving the relative position of each point, which leads to a clear and uncluttered appearance, and the grid cells can be shaded or patterned with symbols or diagrams according to the attributes of the points. We present an algorithm to construct a point grid map and test it with several simulated and real data sets. Furthermore, we present some variants of the point grid map. 相似文献
30.
Selective omission is necessary for road network generalisation. This study investigates the use of supervised learning approaches for selective omission in a road network. To be specific, at first, the properties to measure the importance of a road in the network are viewed as input attributes, and the decision of such a road is retained or not at a specific scale is viewed as an output class; then, a number of samples with known input and output are used to train a classifier; finally, this classifier can be used to determine whether other roads to be retained or not. In this study, a total of nine supervised learning approaches, i.e., ID3, C4·5, CRT, Random Tree, support vector machine (SVM), naive Bayes (NB), K-nearest neighbour (KNN), multilayer perception (MP) and binary logistic regression (BLR), are applied to three road networks for selective omission. The performances of these approaches are evaluated by both quantitative assessment and visual inception. Results show that: (1) in most cases, these approaches are effective and their classification accuracy is between 70% and 90%; (2) most of these approaches have similar performances, and they do not have any statistically significant difference; (3) but sometimes, ID3 and BLR performs significantly better than NB and SVM; NB and KNN perform significantly worse than MP, SVM and BLR. 相似文献