全文获取类型
收费全文 | 291篇 |
免费 | 36篇 |
国内免费 | 50篇 |
专业分类
测绘学 | 81篇 |
大气科学 | 34篇 |
地球物理 | 72篇 |
地质学 | 111篇 |
海洋学 | 17篇 |
天文学 | 8篇 |
综合类 | 39篇 |
自然地理 | 15篇 |
出版年
2024年 | 1篇 |
2023年 | 1篇 |
2022年 | 5篇 |
2021年 | 8篇 |
2020年 | 14篇 |
2019年 | 14篇 |
2018年 | 8篇 |
2017年 | 15篇 |
2016年 | 17篇 |
2015年 | 17篇 |
2014年 | 18篇 |
2013年 | 17篇 |
2012年 | 22篇 |
2011年 | 19篇 |
2010年 | 19篇 |
2009年 | 15篇 |
2008年 | 19篇 |
2007年 | 13篇 |
2006年 | 12篇 |
2005年 | 14篇 |
2004年 | 20篇 |
2003年 | 11篇 |
2002年 | 11篇 |
2001年 | 7篇 |
2000年 | 3篇 |
1999年 | 9篇 |
1998年 | 13篇 |
1997年 | 8篇 |
1996年 | 4篇 |
1995年 | 2篇 |
1994年 | 4篇 |
1993年 | 6篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1990年 | 3篇 |
1987年 | 2篇 |
1984年 | 1篇 |
1980年 | 1篇 |
排序方式: 共有377条查询结果,搜索用时 15 毫秒
71.
72.
常规DCD(dynamic canonical descent)算法具有全局优化能力且无需考虑目标函数的可微性,只要预先定义优化空间即可,但是该算法的收敛速度有限,为此提出了变参数DCD算法,并建立了其相应的算法迭代格式。在数值试验和工程应用中将该变参数DCD算法与常规的DCD算法进行比较,其结果均表明:变参数DCD算法在全局优化能力和收敛速度上找到了一个均衡点,该算法不仅具有DCD算法的全局优化能力,而且收敛时所需的目标函数评估次数少,在优化过程中该算法展示出了稳定性强且优化结果可靠度高的一面。 相似文献
73.
John A. Knox 《Mathematical Geology》2000,32(2):203-215
The Fahrenheit-to-Celsius temperature-conversion equation is a basic component of many introductory earth science courses. Despite its simplicity, it presents a challenge to students and instructors alike because residents of the United States are unfamiliar with the Celsius scale. By solving for the point at which these two temperature scales are equal, it is possible to use the equations for temperature conversion as a springboard to more advanced topics. It is demonstrated that temperature-conversion equations and chaotic equations can be solved using identical numerical and graphical techniques. As a result, the fundamental concepts of chaos theory and numerical methods can be introduced to students in the context of the simplest equations in the earth sciences. These solution methods are applied to the quantitative theory of the extratropical cyclone as an example of the utility and broad scope of this educational approach. 相似文献
74.
75.
基于异步迭代算法的冲击地压预测 总被引:1,自引:0,他引:1
采用三层BP神经网络方法对冲击地压建立了数学模型。网络的训练算法采用具有松弛因子的动态异步迭代法,该算法在克服网络的麻痹现象及局部极小问题上都优于目前常用的训练方法,因而,采用此算法对网络进行了训练及震级的预报。基于新汶矿务局华丰煤矿1999~2000年的冲击地压现场监测数据,把冲击地压的能量、产生波的幅值、频次做为输入数据,相应期间的最大震级为输出数据,组成神经网络的训练样本及测试样本,对原始数据进行了数学预处理,网络结构采用了输入层3个结点,中间层7个结点,输出层1个结点的前向神经网络;网络最终的训练误差为0.06,预测结果的相对误差率平均为 9.2 %,预测效果比较理想。 相似文献
76.
传统的雨滴谱函数的拟合方法在不同的降水类型和不同分布函数下,可能存在拟合出来的雨滴谱函数与实际数据差异过大的情况,基于此问题,本文提出一种基于迭代重加权最小二乘法(Iterative Reweighed Least Square, IRLS)的雨滴谱函数拟合方法。利用Parsivel激光雨滴谱仪2019年7—10月在海南安定获得的225组层状云降水样本和110组对流云降水样本数据进行实验,通过不断更新权值,迭代计算,从而求出待估计参数。模拟结果表明了该方法应用在不同降水类型和不同分布函数下,对比阶矩法和最小二乘法得到的拟合优度都是最接近1的。 相似文献
77.
Gang-Hai Huang Yuan-Zhen Xu Xiong-Wei Yi Ming Xia Yu-Yong Jiao Shu Zhang 《国际地质力学数值与分析法杂志》2020,44(9):1301-1314
The efficiency of solving equations plays an important role in implicit-scheme discontinuous deformation analysis (DDA). A systematic investigation of six iterative methods, namely, symmetric successive over relaxation (SSOR), Jacobi (J), conjugate gradient (CG), and three preconditioned CG methods (ie, J-PCG, block J-PCG [BJ-PCG], and SSOR-PCG), for solving equations in three-dimensional sphere DDA (SDDA) is conducted in this paper. Firstly, simultaneous equations of the SDDA and iterative formats of the six solvers are presented. Secondly, serial and OpenMP-based parallel computing numerical tests are done on a 16-core PC, the result of which shows that (a) for serial computing, the efficiency of the solvers is in this order: SSOR-PCG > BJ-PCG > J-PCG > SSOR>J > CG, while for parallel computing, BJ-PCG is the best solver; and (b) CG is not only the most sensitive to the ill-condition of the equations but also the most time consuming under both serial and parallel computing. Thirdly, to estimate the effects of equation solvers acting on SDDA computations, an application example with 10 000 spheres and 200 000 calculation steps is simulated on this 16-core PC using serial and parallel computing. The result shows that SSOR-PCG is about six times faster than CG for serial computing, while BJ-PCG is about four times faster than CG for parallel computing. On the other hand, the whole computation time using BJ-PCG for parallel computing is 3.37 hours (ie, 0.061 s per step), which is about 36 times faster than CG for serial computing. Finally, some suggestions are given based on this investigation result. 相似文献
78.
79.
白亿同 《武汉大学学报(信息科学版)》1991,(2)
本文讨论了非线性最小二乘平差中高斯—牛顿法和阻尼最小二乘法迭代程序的收敛性问题,找出了影响收敛的因素,给出了估算迭代程序收敛性的方法。 相似文献
80.
Considering the attempts to model spatiotemporal topological relationships between moving object trajectories, the conceptual and computational framework for moving objects along a road network has not received much attention. This paper aims to draw an improved model based on Region Connection Calculus (RCC) theory to represent the spatiotemporal topological relationships between moving object trajectories along road networks. This paper first uses a dimension reduction method based on a linear-reference transformation to model the moving object trajectories segments, and then defines new time–connection and space–connection relations between two trajectory segments. On this basis, the paper proposes an extension to the RCC-based spatiotemporal binary relationship set so that the combined semantics of the spatiotemporal predicates can be described completely. A case study was carried out using Floating Car Data in Guangzhou city. The computational results show that in a real application, the occurrence frequencies of the RCC-based binary relationships are distributed nonuniformly and the semantics of some binary relationships with the highest occurrence are coarse. Therefore, the partition of the spatiotemporal connection relations and the finer aspects of the spatiotemporal relationship model may require further research work. 相似文献