全文获取类型
收费全文 | 60055篇 |
免费 | 7190篇 |
国内免费 | 5219篇 |
专业分类
化学 | 15637篇 |
晶体学 | 1111篇 |
力学 | 16219篇 |
综合类 | 807篇 |
数学 | 19055篇 |
物理学 | 19635篇 |
出版年
2024年 | 127篇 |
2023年 | 654篇 |
2022年 | 1198篇 |
2021年 | 1393篇 |
2020年 | 1732篇 |
2019年 | 1448篇 |
2018年 | 1497篇 |
2017年 | 2006篇 |
2016年 | 2255篇 |
2015年 | 1888篇 |
2014年 | 2940篇 |
2013年 | 4354篇 |
2012年 | 3483篇 |
2011年 | 4070篇 |
2010年 | 3299篇 |
2009年 | 3824篇 |
2008年 | 3734篇 |
2007年 | 3714篇 |
2006年 | 3419篇 |
2005年 | 3093篇 |
2004年 | 2729篇 |
2003年 | 2469篇 |
2002年 | 2183篇 |
2001年 | 1819篇 |
2000年 | 1721篇 |
1999年 | 1528篇 |
1998年 | 1427篇 |
1997年 | 1271篇 |
1996年 | 1075篇 |
1995年 | 947篇 |
1994年 | 820篇 |
1993年 | 694篇 |
1992年 | 685篇 |
1991年 | 514篇 |
1990年 | 439篇 |
1989年 | 340篇 |
1988年 | 299篇 |
1987年 | 209篇 |
1986年 | 166篇 |
1985年 | 210篇 |
1984年 | 196篇 |
1983年 | 93篇 |
1982年 | 155篇 |
1981年 | 82篇 |
1980年 | 39篇 |
1979年 | 57篇 |
1978年 | 40篇 |
1977年 | 39篇 |
1976年 | 19篇 |
1957年 | 19篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
101.
用三个关系式与Mathematica软件求第二类自然数幂和公式 总被引:1,自引:1,他引:0
首先介绍三个第二类自然数幂和关系式并对其中的两式给出证明,接着利用这些关系式与数学软件M athem atica4.0,给出求解第二类自然数幂和公式的若干机械计算方法. 相似文献
102.
Jian‐guo Tang 《Mathematical Methods in the Applied Sciences》2006,29(11):1327-1338
An implicit iterative method is applied to solving linear ill‐posed problems with perturbed operators. It is proved that the optimal convergence rate can be obtained after choosing suitable number of iterations. A generalized Morozov's discrepancy principle is proposed for the problems, and then the optimal convergence rate can also be obtained by an a posteriori strategy. The convergence results show that the algorithm is a robust regularization method. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
103.
A. A. Maleev 《Computational Mathematics and Mathematical Physics》2006,46(12):2031-2039
Stationary and nonstationary Jacobi-like iterative processes for solving systems of linear algebraic equations are examined. For a system whose coefficient matrix A is an H-matrix, it is shown that the convergence rate of any Jacobi-like process is at least as high as that of the point Jacobi method as applied to a system with 〈A〉 as the coefficient matrix, where 〈A〉 is a comparison matrix of A. 相似文献
104.
We consider a multipath maximum flow problem introduced by Kishimoto (Networks 27(4)(1996)279-291). The focus is on efficient transformation from arc flows into multipath flows, where a multipath flow is a nonnegative combination of multipaths. A new algorithm that is more efficient than existing ones is proposed for the transformation. 相似文献
105.
李明融 《数学物理学报(B辑英文版)》2007,27(4):703-734
In this article the author works with the ordinary differential equation u" = |u|^p for some p 〉 0 and obtains some interesting phenomena concerning blow-up, blow-up rate, life-span, stability, instability, zeros and critical points of solutions to this equation. 相似文献
106.
Ledzewicz U. Nowakowski A. Schättler H. 《Journal of Optimization Theory and Applications》2004,122(2):345-370
It is shown that, if a parametrized fämily of extremals F can be stratified in a way compatible with the flow map generated by F, then those trajectories of the family which realize the minimal values of the cost in F are indeed optimal in comparison with all trajectories which lie in the region R covered by the trajectories of F. It is not assumed that F is a field covering the state space injectively. As illustration, an optimal synthesis is constructed for a system where the flow of extremals exhibits a simple cusp singularity. 相似文献
107.
This paper has demonstrated that the Schwartz alternating process must converge if D-N alternating process has converged. Its technique is that the overlapping regions in Schwartz alternating process are considered as independent domains, then Schwartz alternating process could be transformed into D-N alter-nating process. Finally the convergence estimation of Schwartz alternating process could be obtained. The results show that its convergence rate is same as that of D-N alternating process. 相似文献
108.
We study the asymptotic distribution of the fill‐up level in a binary trie built over n independent strings generated by a biased memoryless source. The fill‐up level is the number of full levels in a tree. A level is full if it contains the maximum allowable number of nodes (e.g., in a binary tree level k can have up to 2k nodes). The fill‐up level finds many interesting applications, e.g., in the internet IP lookup problem and in the analysis of level compressed tries (LC tries). In this paper, we present a complete asymptotic characterization of the fill‐up distribution. In particular, we prove that this distribution concentrates on one or two points around the most probably value k = ?log1/qn ? log log log n + 1 + log log(p/q)?, where p > q = 1 ? p is the probability of generating the more likely symbol (while q = 1 ? p is the probability of the less likely symbol). We derive our results by analytic methods such as generating functions, Mellin transform, the saddle point method, and analytic depoissonization. We also present some numerical verification of our results. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004 相似文献
109.
A new parallel storm surge model, the Parallel Environmental Model (PEM), is developed and tested by comparisons with analytic solutions. The PEM is a 2‐D vertically averaged, wetting and drying numerical model and can be operated in explicit, semi‐implicit and fully implicit modes. In the implicit mode, the propagation, Coriolis and bottom friction terms can all be treated implicitly. The advection and diffusion terms are solved with a parallel Eulerian–Lagrangian scheme developed for this study. The model is developed specifically for use on parallel computer systems and will function accordingly in either explicit of implicit modes. Storm boundary conditions are based on a simple exponential decay of pressure from the centre of a storm. The simulated flooding caused by a major Category 5 hurricane making landfall in the Indian River Lagoon, Florida is then presented as an example application of the PEM. Copyright © 2003 John Wiley & Sons, Ltd. 相似文献
110.
In this paper, an interior point cutting plane method (IPCPM)is applied to solve optimal power flow (OPF) problems. Comparedwith the simplex cutting plane method (SCPM), the IPCPM is simpler,and efficient because of its polynomial-time characteristic.Issues in implementing IPCPM for OPF problems are addressed,including (1) how to generate cutting planes without using thesimplex tableau, (2) how to identify the basis variables inIPCPM, and (3) how to generate mixed integer cutting planes.The calculation speed of the proposed algorithm is further enhancedby utilizing the sparsity features of the OPF formulation. Numericalsimulations on IEEE 14-300-bus test systems have shown thatthe proposed method is effective. 相似文献