全文获取类型
收费全文 | 24877篇 |
免费 | 2130篇 |
国内免费 | 1788篇 |
专业分类
化学 | 780篇 |
晶体学 | 14篇 |
力学 | 1109篇 |
综合类 | 330篇 |
数学 | 6116篇 |
物理学 | 2992篇 |
综合类 | 17454篇 |
出版年
2024年 | 143篇 |
2023年 | 327篇 |
2022年 | 598篇 |
2021年 | 655篇 |
2020年 | 547篇 |
2019年 | 568篇 |
2018年 | 585篇 |
2017年 | 769篇 |
2016年 | 828篇 |
2015年 | 840篇 |
2014年 | 1329篇 |
2013年 | 1347篇 |
2012年 | 1442篇 |
2011年 | 1587篇 |
2010年 | 1191篇 |
2009年 | 1511篇 |
2008年 | 1527篇 |
2007年 | 1969篇 |
2006年 | 1777篇 |
2005年 | 1431篇 |
2004年 | 1252篇 |
2003年 | 1027篇 |
2002年 | 902篇 |
2001年 | 742篇 |
2000年 | 622篇 |
1999年 | 561篇 |
1998年 | 486篇 |
1997年 | 411篇 |
1996年 | 332篇 |
1995年 | 272篇 |
1994年 | 200篇 |
1993年 | 197篇 |
1992年 | 161篇 |
1991年 | 116篇 |
1990年 | 123篇 |
1989年 | 89篇 |
1988年 | 81篇 |
1987年 | 62篇 |
1986年 | 41篇 |
1985年 | 37篇 |
1984年 | 30篇 |
1983年 | 11篇 |
1982年 | 18篇 |
1981年 | 5篇 |
1980年 | 5篇 |
1979年 | 5篇 |
1978年 | 3篇 |
1977年 | 6篇 |
1959年 | 5篇 |
1955年 | 13篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
121.
In a seminal paper, Martin Clark (Communications Systems and Random Process Theory, Darlington, 1977, pp. 721–734, 1978) showed how the filtered dynamics giving the optimal estimate of a Markov chain observed in Gaussian noise can be expressed
using an ordinary differential equation. These results offer substantial benefits in filtering and in control, often simplifying
the analysis and an in some settings providing numerical benefits, see, for example Malcolm et al. (J. Appl. Math. Stoch.
Anal., 2007, to appear).
Clark’s method uses a gauge transformation and, in effect, solves the Wonham-Zakai equation using variation of constants.
In this article, we consider the optimal control of a partially observed Markov chain. This problem is discussed in Elliott
et al. (Hidden Markov Models Estimation and Control, Applications of Mathematics Series, vol. 29, 1995). The innovation in our results is that the robust dynamics of Clark are used to compute forward in time dynamics for a simplified
adjoint process. A stochastic minimum principle is established. 相似文献
122.
胡长松 《应用泛函分析学报》2007,9(2):153-157
设E是Banach空间,T∶E→2E*是极大单调算子,T-10≠ф.令x0∈E,yn=(J λnT)-1xn en,xn 1=J-1(αnJxn (1-αn)Jyn),n0,λn>0,αn∈[0,1],文章研究了{xn}收敛性. 相似文献
123.
B. Ivorra A. M. Ramos B. Mohammadi 《Journal of Optimization Theory and Applications》2007,135(3):549-561
This paper has two objectives. We introduce a new global optimization algorithm reformulating optimization problems in terms
of boundary-value problems. Then, we apply this algorithm to a pointwise control problem of the viscous Burgers equation,
where the control weight coefficient is progressively decreased. The results are compared with those obtained with a genetic
algorithm and an LM-BFGS algorithm in order to check the efficiency of our method and the necessity of using global optimization
techniques. 相似文献
124.
Zhengqian Luo Guoyong Sun Zhiping Cai Miaoling Si Qibo Li 《Optics Communications》2007,277(1):118-124
In this paper, continuous wave Yb3+-doped double-clad fiber lasers (DCFLs) with linear-cavity are investigated theoretically and numerically using the rate equations. Under the steady state conditions, the simplified analytic solutions of Yb3+-doped DCFLs under considering the scattering loss are deduced in the strongly pump condition. Compared with the known analytic solutions in published literatures, our analytic solutions are more accurate, especially, at higher reflectivity of output mirror. In addition, a fast and stable algorithm based on the Newton-Raphson method is proposed to simulate numerically Yb3+-doped DCFLs. The results by simplified analytic solutions are in good agreement with those by the numerical simulation. Moreover, we have performed the optimization of an Yb3+-doped DCFL using the simplified analytic solutions and the numerical simulations, respectively. 相似文献
125.
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 相似文献
126.
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. 相似文献
127.
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. 相似文献
128.
129.
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 相似文献
130.
Frozen Landweber Iteration for Nonlinear Ill-Posed Problems 总被引:1,自引:0,他引:1
J. Xu B. Han L. Li 《应用数学学报(英文版)》2007,23(2):329-336
In this paper we propose a modification of the Landweber iteration termed frozen Landweberiteration for nonlinear ill-posed problems.A convergence analysis for this iteration is presented.The numericalperformance of this frozen Landweber iteration for a nonlinear Hammerstein integral equation is compared withthat of the Landweber iteration.We obtain a shorter running time of the frozen Landweber iteration based onthe same convergence accuracy. 相似文献