全文获取类型
收费全文 | 16070篇 |
免费 | 1095篇 |
国内免费 | 955篇 |
专业分类
化学 | 1615篇 |
晶体学 | 2篇 |
力学 | 1481篇 |
综合类 | 204篇 |
数学 | 13390篇 |
物理学 | 1428篇 |
出版年
2024年 | 33篇 |
2023年 | 168篇 |
2022年 | 283篇 |
2021年 | 261篇 |
2020年 | 419篇 |
2019年 | 459篇 |
2018年 | 454篇 |
2017年 | 491篇 |
2016年 | 463篇 |
2015年 | 314篇 |
2014年 | 671篇 |
2013年 | 1216篇 |
2012年 | 716篇 |
2011年 | 833篇 |
2010年 | 757篇 |
2009年 | 1029篇 |
2008年 | 1048篇 |
2007年 | 1106篇 |
2006年 | 968篇 |
2005年 | 762篇 |
2004年 | 662篇 |
2003年 | 732篇 |
2002年 | 633篇 |
2001年 | 474篇 |
2000年 | 475篇 |
1999年 | 426篇 |
1998年 | 388篇 |
1997年 | 347篇 |
1996年 | 264篇 |
1995年 | 232篇 |
1994年 | 149篇 |
1993年 | 126篇 |
1992年 | 127篇 |
1991年 | 111篇 |
1990年 | 81篇 |
1989年 | 39篇 |
1988年 | 44篇 |
1987年 | 39篇 |
1986年 | 42篇 |
1985年 | 55篇 |
1984年 | 53篇 |
1983年 | 28篇 |
1982年 | 28篇 |
1981年 | 25篇 |
1980年 | 18篇 |
1979年 | 22篇 |
1978年 | 14篇 |
1977年 | 15篇 |
1976年 | 9篇 |
1936年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 3 毫秒
131.
Capacity Constrained Transit Assignment with Common Lines 总被引:1,自引:0,他引:1
Fumitaka Kurauchi Michael G. H. Bell Jan-Dirk Schmöcker 《Journal of Mathematical Modelling and Algorithms》2003,2(4):309-327
This paper proposes the use of absorbing Markov chains to solve the capacity constrained transit network loading problem taking
common lines into account. The approach handles congested transit networks, where some passengers will not be able to board
because of the absence of sufficient space. The model also handles the common lines problem, where choice of route depends
on frequency of arrivals. The mathematical formulation of the problem is presented together with a numerical example.
This revised version was published online in July 2006 with corrections to the Cover Date. 相似文献
132.
LetB
1
be a ball of radiusr
1
inS
n
(ℍn), and letB
0
be a smaller ball of radiusr
0
such thatB
0
⊂B
1
. ForS
n
we considerr
1
π. Let u be a solution of the problem- δm = 1 in Ω :=B
1
/B
0
vanishing on the boundary. It is shown that the associated functionalJ (Ω) is minimal if and only if the balls are concentric. It is also shown that the first Dirichlet eigenvalue of the Laplacian
on Ω is maximal if and only if the balls are concentric. 相似文献
133.
周忆 《数学年刊B辑(英文版)》2003,24(3)
This paper considers the following Cauchy problem for semilinear wave equations in n spacedimensions□φ = F( φ),φ(0, x) = f(x), tφ(0, x) = g(x),The minimal value of s is determined such that the above Cauchy problem is locally well-posed in Hs. It turns out that for the general equation s must satisfyThis is due to Ponce and Sideris (when n = 3) and Tataru (when n ≥ 5). The purpose of thispaper is to supplement with a proof in the case n = 2, 4. 相似文献
134.
Comment on “A Hierarchy of Integrable Nonlinear Lattice Equations and New Integrable Symplectic Map“
Comment on a recent paper on Commun. Theor. Phys. (Beijing, China) 38 (2002) pp. 523-528. 相似文献
135.
THE COUPLING OF NATURAL BOUNDARY ELEMENT AND FINITE ELEMENT METHOD FOR 2D HYPERBOLIC EQUATIONS 总被引:2,自引:0,他引:2
De-haoYu Qi-kuiDu 《计算数学(英文版)》2003,21(5):585-594
In this paper, we investigate the coupling of natural boundary element and finite element methods of exterior initial boundary value problems for hyperbolic equations. The governing equation is first discretized in time, leading to a time-step scheme, where an exterior elliptic problem has to be solved in each time step. Second, a circular artificial boundary FR consisting of a circle of radius R is introduced, the original problem in an unbounded domain is transformed into the nonlocal boundary value problem in abounded subdomain. And the natural integral equation and the Poisson integral formula are obtained in the infinite domainΩ2 outside circle of radius R. The coupled variational formulation is given. Only the function itself, not its normal derivative at artificial boundary ΓR, appears in the variational equation, so that the unknown numbers are reducedand the boundary element stiffness matrix has a few different elements. Such a coupled method is superior to the one based on direct boundary element method. This paper discusses finite element discretization for variational problem and its corresponding numerical technique, and the convergence for the numerical solutions. Finally, the numerical example is presented to illustrate feasibility and efficiency of this method. 相似文献
136.
通过对非线性规划问题的K-T点的光滑路径跟踪方法研究,得出一种针对于既有不等式约束条件又有等式约束条件的优化问题光滑路径跟踪方法,证明了光滑跟踪路径的存在性。 相似文献
137.
A solution to the phase problem in optics is considered within the context of registration and analysis of two-dimensional stationary optical fields transformed by the object under study or fields forming an image. To obtain information on amplitude and phase distributions of the light field analyzed, a method of registration of two intensity distributions is used. The first distribution corresponds directly to the amplitude distribution. The other is formed for the sum of the initial field and the field shifted along a certain direction. The intensity distributions obtained allow one to calculate the two-dimensional structure of the field under study. It is noteworthy that the method requires no iteration procedures in solving the problem. This leads to speeding up of the processing and analysis of the information. Two variants of optical schemes for the analysis of light fields are considered. The first one corresponds to registration of the image of the analyzed plane and the second to registration of the spectrum of the spatial frequencies. 相似文献
138.
杨青 《高等学校计算数学学报(英文版)》2003,12(2)
The mathematical model of semiconductor devices is described by the initial boundary value problem of a system of three nonlinear partial differential equations. One equation in elliptic form is for the electrostatic potential; two equations of convection-dominated diffusion type are for the electron and hole concentrations. Finite volume element procedure are put forward for the electrostatic potential, while upwind 相似文献
139.
Mathematical Notes - 相似文献
140.
The state of the art iterative method for solving large linear systems is the conjugate gradient (CG) algorithm. Theoretical convergence analysis suggests that CG converges more rapidly than steepest descent. This paper argues that steepest descent may be an attractive alternative to CG when solving linear systems arising from the discretization of ill-posed problems. Specifically, it is shown that, for ill-posed problems, steepest descent has a more stable convergence behavior than CG, which may be explained by the fact that the filter factors for steepest descent behave much less erratically than those for CG. Moreover, it is shown that, with proper preconditioning, the convergence rate of steepest descent is competitive with that of CG.This revised version was published online in October 2005 with corrections to the Cover Date. 相似文献