全文获取类型
收费全文 | 19808篇 |
免费 | 2176篇 |
国内免费 | 1514篇 |
专业分类
化学 | 6584篇 |
晶体学 | 89篇 |
力学 | 1789篇 |
综合类 | 564篇 |
数学 | 8091篇 |
物理学 | 6381篇 |
出版年
2024年 | 32篇 |
2023年 | 200篇 |
2022年 | 529篇 |
2021年 | 578篇 |
2020年 | 639篇 |
2019年 | 532篇 |
2018年 | 479篇 |
2017年 | 629篇 |
2016年 | 733篇 |
2015年 | 615篇 |
2014年 | 928篇 |
2013年 | 1164篇 |
2012年 | 996篇 |
2011年 | 1168篇 |
2010年 | 1106篇 |
2009年 | 1377篇 |
2008年 | 1293篇 |
2007年 | 1307篇 |
2006年 | 1232篇 |
2005年 | 961篇 |
2004年 | 847篇 |
2003年 | 795篇 |
2002年 | 701篇 |
2001年 | 604篇 |
2000年 | 528篇 |
1999年 | 488篇 |
1998年 | 449篇 |
1997年 | 356篇 |
1996年 | 314篇 |
1995年 | 274篇 |
1994年 | 223篇 |
1993年 | 192篇 |
1992年 | 186篇 |
1991年 | 118篇 |
1990年 | 108篇 |
1989年 | 99篇 |
1988年 | 72篇 |
1987年 | 70篇 |
1986年 | 45篇 |
1985年 | 80篇 |
1984年 | 61篇 |
1983年 | 33篇 |
1982年 | 62篇 |
1981年 | 39篇 |
1980年 | 38篇 |
1979年 | 71篇 |
1978年 | 38篇 |
1977年 | 34篇 |
1976年 | 22篇 |
1974年 | 19篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
We discuss an error estimation procedure for the global error of collocation schemes applied to solve singular boundary value problems with a singularity of the first kind. This a posteriori estimate of the global error was proposed by Stetter in 1978 and is based on the idea of Defect Correction, originally due to Zadunaisky. Here, we present a new, carefully designed modification of this error estimate which not only results in less computational work but also appears to perform satisfactorily for singular problems. We give a full analytical justification for the asymptotical correctness of the error estimate when it is applied to a general nonlinear regular problem. For the singular case, we are presently only able to provide computational evidence for the full convergence order, the related analysis is still work in progress. This global estimate is the basis for a grid selection routine in which the grid is modified with the aim to equidistribute the global error. This procedure yields meshes suitable for an efficient numerical solution. Most importantly, we observe that the grid is refined in a way reflecting only the behavior of the solution and remains unaffected by the unsmooth direction field close to the singular point. 相似文献
2.
固体力学有限元体系的结构拓扑变化理论 总被引:2,自引:1,他引:1
本文是文[1]的继续.文[1]提出了杆件系统的结构拓扑变化理论和拓扑变化法本文将这一理论和方法推进到连续体有限元体系;且在此基础上揭示出有限元体系的一个新性质,称为基本位移之梯度的正交性定理,从而给出一套设计敏度的显式表达式,可直接用于计算. 相似文献
3.
浅析二阶齐次线性变系数微分方程的一个可积类型 总被引:1,自引:0,他引:1
姬志飞 《应用数学与计算数学学报》2006,20(1):125-128
本文讨论了二阶齐次线性变系数微分方程的特殊形式,给出了这种微分方程的一个可积类型. 相似文献
4.
On Quantum Team Games 总被引:2,自引:0,他引:2
E. Ahmed M. F. Elettreby A. S. Hegazi 《International Journal of Theoretical Physics》2006,45(5):880-886
Recently Liu and Simaan (2004) convex static multi-team classical games have been introduced. Here they are generalized to both nonconvex, dynamic and quantum games. Puu's incomplete information dynamical systems are modified and applied to Cournot team game. The replicator dynamics of the quantum prisoner's dilemma game is also studied. 相似文献
5.
Kasper K. Berthelsen Jesper Møller 《Bulletin of the Brazilian Mathematical Society》2002,33(3):351-367
This primer provides a self-contained exposition of the case where spatial birth-and-death processes are used for perfect
simulation of locally stable point processes. Particularly, a simple dominating coupling from the past (CFTP) algorithm and
the CFTP algorithms introduced in [13], [14], and [5] are studied. Some empirical results for the algorithms are discussed.
Received: 30 June 2002 相似文献
6.
Let G=(V(G),E(G)) be a graph. A (n,G, λ)‐GD is a partition of the edges of λKn into subgraphs (G‐blocks), each of which is isomorphic to G. The (n,G,λ)‐GD is named as graph design for G or G‐decomposition. The large set of (n,G,λ)‐GD is denoted by (n,G,λ)‐LGD. In this work, we obtain the existence spectrum of (n,P3,λ)‐LGD. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 151–159, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10008 相似文献
7.
不完全信息群体决策专家权重的集结 总被引:8,自引:5,他引:3
本文对于属性权重信息和属性效用信息都不完全的群体多属性决策问题,通过构造属性值区间和运用系统聚类分析法,对群体决策中的专家进行分类,并确定每位专家的权重. 相似文献
8.
Several new families of c‐Bhaskar Rao designs with block size 4 are constructed. The necessary conditions for the existence of a c‐BRD (υ,4,λ) are that: (1)λmin=?λ/3 ≤ c ≤ λ and (2a) c≡λ (mod 2), if υ > 4 or (2b) c≡ λ (mod 4), if υ = 4 or (2c) c≠ λ ? 2, if υ = 5. It is proved that these conditions are necessary, and are sufficient for most pairs of c and λ; in particular, they are sufficient whenever λ?c ≠ 2 for c > 0 and whenever c ? λmin≠ 2 for c < 0. For c < 0, the necessary conditions are sufficient for υ> 101; for the classic Bhaskar Rao designs, i.e., c = 0, we show the necessary conditions are sufficient with the possible exception of 0‐BRD (υ,4,2)'s for υ≡ 4 (mod 6). © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 361–386, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10009 相似文献
9.
The paper proposes a rational method to derive fairness measures for surfaces. It works in cases where isophotes, reflection lines, planar intersection curves, or other curves are used to judge the fairness of the surface. The surface fairness measure is derived by demanding that all the given curves should be fair with respect to an appropriate curve fairness measure. The method is applied to the field of ship hull design where the curves are plane intersections. The method is extended to the case where one considers, not the fairness of one curve, but the fairness of a one parameter family of curves. Six basic third order invariants by which the fairing measures can be expressed are defined. Furthermore, the geometry of a plane intersection curve is studied, and the variation of the total, the normal, and the geodesic curvature and the geodesic torsion is determined. 相似文献
10.
A Modified Quasi-Newton Method for Structured Optimization with Partial Information on the Hessian 总被引:2,自引:0,他引:2
This paper develops a modified quasi-Newton method for structured unconstrained optimization with partial information on the
Hessian, based on a better approximation to the Hessian in current search direction. The new approximation is decided by both
function values and gradients at the last two iterations unlike the original one which only uses the gradients at the last
two iterations. The modified method owns local and superlinear convergence. Numerical experiments show that the proposed method
is encouraging comparing with the methods proposed in [4] for structured unconstrained optimization
Presented at the 6th International Conference on Optimization: Techniques and Applications, Ballarat, Australia, December
9–11, 2004 相似文献