首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   372篇
  免费   56篇
  国内免费   15篇
测绘学   61篇
大气科学   33篇
地球物理   136篇
地质学   72篇
海洋学   40篇
天文学   6篇
综合类   49篇
自然地理   46篇
  2024年   1篇
  2023年   4篇
  2022年   4篇
  2021年   14篇
  2020年   14篇
  2019年   12篇
  2018年   17篇
  2017年   14篇
  2016年   11篇
  2015年   22篇
  2014年   22篇
  2013年   41篇
  2012年   18篇
  2011年   16篇
  2010年   24篇
  2009年   18篇
  2008年   26篇
  2007年   35篇
  2006年   18篇
  2005年   12篇
  2004年   12篇
  2003年   12篇
  2002年   13篇
  2001年   17篇
  2000年   4篇
  1999年   5篇
  1998年   8篇
  1997年   5篇
  1996年   6篇
  1995年   1篇
  1994年   3篇
  1993年   1篇
  1992年   2篇
  1991年   1篇
  1990年   1篇
  1989年   2篇
  1988年   4篇
  1985年   2篇
  1980年   1篇
排序方式: 共有443条查询结果,搜索用时 15 毫秒
81.
DEM流径算法的相似性分析   总被引:4,自引:0,他引:4  
刘学军  晋蓓  王彦芳 《地理研究》2008,27(6):1347-1357
流径算法是分布式水文模型、土壤侵蚀模拟等研究中的关键技术环节,决定着汇水面积、地形指数等许多重要的地形、水文参数的计算。本文以黄土高原两个典型样区的不同分辨率DEM为研究对象,对常用的五种流径算法(D8、Rho8、Dinf、MFD和DEMON)通过相对差系数、累积频率图、XY散点分布图等进行了定量的对比分析。结果表明:算法的差异主要集中在坡面区域,汇流区域各类算法的差别较小;算法差异在不同DEM尺度下都有所体现,但高分辨率下的差异会更明显;在地形复杂区域,多流向算法要优于单流向算法。研究也进一步指出汇水面积、地形指数等水文参数对流径算法具有强烈的依赖性。  相似文献   
82.
In this study,the detention rate of detention pond was defined to include both reduction and delay of peak flow.Flood routing experiments,with various combinations of inflow hydrographs and outlet devices in an in-site detention pond,were performed to examine the effectiveness of two analysis methods,namely the simplified method and the hydrological routing method;and to compare the detention rate of two types of outlet,namely the rectangular sharp-crested weir and the rectangular orifice.Comparison between...  相似文献   
83.
神经网络理论在河道洪水预报中的应用   总被引:2,自引:1,他引:1  
本文将神经网络用于松花江干流河道汇流计算和河道洪峰水位的预报.对各种转移函数的效果进行了比较,线性函数和双正切函的精度较好超过传统的马斯京根法,其中线性转移函数最好,说明对于大江大河线性转移函数最好.由上游断面洪峰水位预报下游断面洪峰水位也取得了良好的效果.  相似文献   
84.
Local search heuristics for very large-scale vehicle routing problems (VRPs) have made remarkable advances in recent years. However, few local search heuristics have focused on the use of the spatial neighborhood in Voronoi diagrams to improve local searches. Based on the concept of a k-ring shaped Voronoi neighbor, we propose a Voronoi spatial neighborhood-based search heuristic and algorithm to solve very large-scale VRPs. In this algorithm, k-ring Voronoi neighbors of a customer are limited to building and updating local routings, and rearranging local routings with improper links. This algorithm was evaluated using four sets of benchmark tests for 200–8683 customers. Solutions were compared with specific examples in the literature, such as the one-depot VRP. This algorithm produced better solutions than some of the best-known benchmark VRP solutions and requires less computational time. The algorithm outperformed previous methods used to solve very large-scale, real-world distance constrained capacitated VRP.  相似文献   
85.
Abstract

The estimation and review of discharge flow rates in hydraulic works is a fundamental problem in water management. In the case of dams with large regulating capacity, in order to estimate return periods of discharge flow rates from the spillways, it becomes necessary to consider both peak flow and volume of the incoming floods. In this paper, the results of the validation for several methods of assessing design floods for spillways of dams with a large flood control capacity are presented; the validation is performed by comparing the maximum outflows (or the maximum levels reached in the reservoir) obtained from the routing of the design floods with those obtained from the routing of the historical annual maximum floods. The basin of Malpaso Dam, Mexico, is used as the case study.

Editor D. Koutsoyiannis

Citation Domínguez, M.R. and Arganis, J.M.L., 2012. Validation of methods to estimate design discharge flow rates for dam spillways with large regulating capacity. Hydrological Sciences Journal, 57 (3), 460–478.  相似文献   
86.
Abstract

The Coupled Routing and Excess STorage model (CREST, jointly developed by the University of Oklahoma and NASA SERVIR) is a distributed hydrological model developed to simulate the spatial and temporal variation of land surface, and subsurface water fluxes and storages by cell-to-cell simulation. CREST's distinguishing characteristics include: (1) distributed rainfall–runoff generation and cell-to-cell routing; (2) coupled runoff generation and routing via three feedback mechanisms; and (3) representation of sub-grid cell variability of soil moisture storage capacity and sub-grid cell routing (via linear reservoirs). The coupling between the runoff generation and routing mechanisms allows detailed and realistic treatment of hydrological variables such as soil moisture. Furthermore, the representation of soil moisture variability and routing processes at the sub-grid scale enables the CREST model to be readily scalable to multi-scale modelling research. This paper presents the model development and demonstrates its applicability for a case study in the Nzoia basin located in Lake Victoria, Africa.

Citation Wang, J., Yang, H., Li, L., Gourley, J. J., Sadiq, I. K., Yilmaz, K. K., Adler, R. F., Policelli, F. S., Habib, S., Irwn, D., Limaye, A. S., Korme, T. &; Okello, L. (2011) The coupled routing and excess storage (CREST) distributed hydrological model. Hydrol. Sci. J. 56(1), 84–98.  相似文献   
87.
OLSR (optimal link state routing) is one of the four basic routing protocols used in mobile ad hoc Networks by the MANET working group of IETF (Internet engineering task force). OLSR, a proactive routing protocol, is based on a multipoint relaying flooding technique to reduce the number of topology broadcast. OLSR uses periodic HELLO packets to neighbor detection. As introduced in Reference [1], the wormhole attack can form a serious threat in wireless Networks, especially against many ad hoc Network routing protocols and location-based wireless security systems. Here, a trust model to handle this attack in OLSR is provided and simulated in NS2.  相似文献   
88.
Car routing solutions are omnipresent and solutions for pedestrians also exist.Furthermore,public or commercial buildings are getting bigger and the complexity of their internal structure has increased.Consequently,the need for indoor routing solutions has emerged.Some prototypes are available,but they still lack semantically-enriched modelling (e.g.,access constraints,labels,etc.) and are not suitable for providing user-adaptive length-optimal routing in complex buildings.Previous approaches consider simple rooms,concave rooms,and corridors,but important characteristics such as distinct areas in huge rooms and solid obstacles inside rooms are not considered at all,although such details can increase navigation accuracy.By formally defining a weighted indoor routing graph,it is possible to create a detailed and user-adaptive model for route computation.The defined graph also contains semantic information such as room labels,door accessibility constraints,etc.Furthermore,one-way paths inside buildings are considered,as well as three-dimensional building parts,e.g.,elevators or stairways.A hierarchical structure is also possible with the presented graph model.  相似文献   
89.
Car-sharing system with electric cars is a very convenient service for urban transportation: it allows users to pick up a vehicle at a station and rent it during a short time. To manage this kind of system in the best way, it is necessary to solve the critical problem of vehicle stock imbalance across the stations. Several decision levels must be considered to balance the car distribution by taking into account the quality of service and the system operation cost. To this end, a linear programming model is proposed to formalize the problem in a mathematical framework, which allows the computation of optimal vehicle distribution strategies. To make our solution time efficient and usable for solving large problems, a greedy algorithm and a tabu search algorithm are proposed. These two algorithms are applied to the Auto Bleue network in Nice and its surrounding (France) using extensive simulations. Besides, an integrated mapping method is provided within the Geographical Information System QGIS to estimate flows and their locations. Numerical results demonstrate that the tabu search algorithm is able to find near-optimal solutions and good compromises between client satisfaction, number of staff agents and vehicles used, and computing time.  相似文献   
90.
ABSTRACT

Routing and navigation services for leisure activities are conditioned by special needs and trade-offs. The advent of online communities and large crowdsourced datasets offers opportunities to improve the adoption of a user’s perspective in these suggested paths. This paper focuses on achieving two goals. First, the presented methodology analyses a dataset of 190,610 historical GPS traces to gain insights into the appreciation or attractiveness of each edge in a real-world network for a specific leisure activity (i.e. road cycling). Second, as literature on these leisure activities is still sparse, we want to create a thorough understanding of the activities at hand for future work. An appreciation model is proposed and the spread of this score is analyzed in shortest-path alternatives of popular routing engines for this activity. This analysis successfully discriminates these shortest paths based on the scoring value and three morphological parameters of the path. However, the robustness of the model should be improved to ensure the viability of the proposed approach in future work. More specifically, further research on the local optimality of the route choices will be imperative.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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