全文获取类型
收费全文 | 15380篇 |
免费 | 2018篇 |
国内免费 | 617篇 |
专业分类
化学 | 1400篇 |
晶体学 | 86篇 |
力学 | 3655篇 |
综合类 | 409篇 |
数学 | 7185篇 |
物理学 | 5280篇 |
出版年
2024年 | 28篇 |
2023年 | 133篇 |
2022年 | 386篇 |
2021年 | 404篇 |
2020年 | 359篇 |
2019年 | 334篇 |
2018年 | 348篇 |
2017年 | 520篇 |
2016年 | 614篇 |
2015年 | 446篇 |
2014年 | 776篇 |
2013年 | 1004篇 |
2012年 | 823篇 |
2011年 | 925篇 |
2010年 | 714篇 |
2009年 | 922篇 |
2008年 | 971篇 |
2007年 | 1023篇 |
2006年 | 933篇 |
2005年 | 822篇 |
2004年 | 687篇 |
2003年 | 650篇 |
2002年 | 588篇 |
2001年 | 521篇 |
2000年 | 465篇 |
1999年 | 396篇 |
1998年 | 348篇 |
1997年 | 313篇 |
1996年 | 254篇 |
1995年 | 210篇 |
1994年 | 161篇 |
1993年 | 152篇 |
1992年 | 135篇 |
1991年 | 91篇 |
1990年 | 96篇 |
1989年 | 48篇 |
1988年 | 51篇 |
1987年 | 52篇 |
1986年 | 51篇 |
1985年 | 56篇 |
1984年 | 46篇 |
1983年 | 18篇 |
1982年 | 31篇 |
1981年 | 13篇 |
1980年 | 13篇 |
1979年 | 12篇 |
1978年 | 16篇 |
1977年 | 13篇 |
1976年 | 15篇 |
1957年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
141.
应用等效原理,通过引入口面上等效磁流将含腔导电目标电磁散射简化为腔内、外两个等效 问题. 腔内问题分段求解并应用级联法获得口面等效导纳矩阵;腔内外的耦合关系应用近似 边界元方法描述并由此获得口面等效磁流;最后,这一具有混合源的腔体内外一体化散射问 题则应用所提出的广义混合场积分方程方法建立电磁模型,并用多层快速多极子方法实现高 效数值求解. 实例计算结果与测试结果具有很好的一致性.
关键词:
含腔目标
电磁散射
混合场积分方程
数值分析 相似文献
142.
Andreas Rößler 《BIT Numerical Mathematics》2006,46(1):97-110
A general class of stochastic Runge–Kutta methods for Itô stochastic differential equation systems w.r.t. a one-dimensional Wiener process is introduced. The colored rooted tree analysis is applied to derive conditions for the coefficients of the stochastic Runge–Kutta method assuring convergence in the weak sense with a prescribed order. Some coefficients for new stochastic Runge–Kutta schemes of order two are calculated explicitly and a simulation study reveals their good performance. 相似文献
143.
An energy-dependent partitioning scheme is explored for extracting a small number of eigenvalues of a real symmetric matrix with the help of genetic algorithm. The proposed method is tested with matrices of different sizes (30 × 30 to 1000 × 1000). Comparison is made with Löwdin’s strategy for solving the problem. The relative advantages and disadvantages of the GA-based method are analyzed 相似文献
144.
We give a competitive algorithm to identify all d defective edges in a hypergraph with d unknown. Damaschke did the d=1 case for 2-graphs, Triesch extended the d=1 case to r-graphs, and Johann did the general d case for 2-graphs. So ours is the first attempt to solve the searching for defective edges problem in its full generality. Further, all the above three papers assumed d known. We give a competitive algorithm where d is unknown. 相似文献
145.
We consider a trader who wants to direct his or her portfolio towards a set of acceptable wealths given by a convex risk measure. We propose a Monte Carlo algorithm, whose inputs are the joint law of stock prices and the convex risk measure, and whose outputs are the numerical values of initial capital requirement and the functional form of a trading strategy for achieving acceptability. We also prove optimality of the capital obtained. Explicit theoretical evaluations of hedging strategies are extremely difficult, and we avoid the problem by resorting to such computational methods. The main idea is to utilize the finite Vapnik–C?ervonenkis dimension of a class of possible strategies. 相似文献
146.
147.
Andreas Rößler 《BIT Numerical Mathematics》2007,47(3):657-680
The weak approximation of the solution of a system of Stratonovich stochastic differential equations with a m–dimensional Wiener process is studied. Therefore, a new class of stochastic Runge–Kutta methods is introduced. As the main
novelty, the number of stages does not depend on the dimension m of the driving Wiener process which reduces the computational effort significantly. The colored rooted tree analysis due
to the author is applied to determine order conditions for the new stochastic Runge–Kutta methods assuring convergence with
order two in the weak sense. Further, some coefficients for second order stochastic Runge–Kutta schemes are calculated explicitly.
AMS subject classification (2000) 65C30, 65L06, 60H35, 60H10 相似文献
148.
Multi-dimensional asymptotically quasi-Toeplitz Markov chains with discrete and continuous time are introduced. Ergodicity
and non-ergodicity conditions are proven. Numerically stable algorithm to calculate the stationary distribution is presented.
An application of such chains in retrial queueing models with Batch Markovian Arrival Process is briefly illustrated.
AMS Subject Classifications Primary 60K25 · 60K20 相似文献
149.
An inverse problem of the reconstruction of the right-hand side of the Euler-Darboux equation is studied. This problem is equivalent to the Volterra integral equation of the third kind with the operator of multiplication by a smooth nonincreasing function. Numerical solution of this problem is constructed using an integral representation of the solution of the inverse problem, the regularization method, and the method of quadratures. The convergence and stability of the numerical method is proved. 相似文献
150.