全文获取类型
收费全文 | 1803篇 |
免费 | 160篇 |
国内免费 | 115篇 |
专业分类
化学 | 245篇 |
晶体学 | 3篇 |
力学 | 89篇 |
综合类 | 12篇 |
数学 | 1060篇 |
物理学 | 669篇 |
出版年
2024年 | 1篇 |
2023年 | 15篇 |
2022年 | 37篇 |
2021年 | 35篇 |
2020年 | 41篇 |
2019年 | 40篇 |
2018年 | 37篇 |
2017年 | 62篇 |
2016年 | 64篇 |
2015年 | 54篇 |
2014年 | 112篇 |
2013年 | 203篇 |
2012年 | 84篇 |
2011年 | 109篇 |
2010年 | 95篇 |
2009年 | 156篇 |
2008年 | 139篇 |
2007年 | 124篇 |
2006年 | 97篇 |
2005年 | 72篇 |
2004年 | 69篇 |
2003年 | 51篇 |
2002年 | 53篇 |
2001年 | 39篇 |
2000年 | 32篇 |
1999年 | 38篇 |
1998年 | 34篇 |
1997年 | 37篇 |
1996年 | 29篇 |
1995年 | 30篇 |
1994年 | 14篇 |
1993年 | 15篇 |
1992年 | 3篇 |
1991年 | 7篇 |
1990年 | 9篇 |
1989年 | 2篇 |
1988年 | 3篇 |
1987年 | 5篇 |
1986年 | 2篇 |
1985年 | 6篇 |
1984年 | 5篇 |
1983年 | 3篇 |
1982年 | 3篇 |
1981年 | 4篇 |
1980年 | 1篇 |
1979年 | 3篇 |
1977年 | 1篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1974年 | 1篇 |
排序方式: 共有2078条查询结果,搜索用时 15 毫秒
1.
2.
M.Z. Arslanov 《Operations Research Letters》2007,35(5):636-644
We consider the problem of guillotine cutting a rectangular sheet into two rectangular pieces without rotations. The question is whether there exists a cutting pattern with given numbers of occurrences of both rectangular pieces. A polynomial time algorithm is described to construct the convex hull of solutions to this problem. 相似文献
3.
This article focuses on discontinuous Galerkin method for the two‐ or three‐dimensional stationary incompressible Navier‐Stokes equations. The velocity field is approximated by discontinuous locally solenoidal finite element, and the pressure is approximated by the standard conforming finite element. Then, superconvergence of nonconforming finite element approximations is applied by using least‐squares surface fitting for the stationary Navier‐Stokes equations. The method ameliorates the two noticeable disadvantages about the given finite element pair. Finally, the superconvergence result is provided under some regular assumptions. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 23: 421–436, 2007 相似文献
4.
Popularized by Zassenhaus in the seventies, several algorithms for factoring polynomials use a so-called lifting and recombination scheme. Concerning bivariate polynomials, we present a new algorithm for the recombination stage that requires a lifting up to precision twice the total degree of the polynomial to be factored. Its cost is dominated by the computation of reduced echelon solution bases of linear systems. We show that our bound on precision is asymptotically optimal.
5.
In this paper we characterize the local maxima of a continuous global optimization formulation for finding the independence
number of a graph. Classical Karush-Kuhn-Tucker conditions and simple combinatorial arguments are found sufficient to deduce
several interesting properties of the local and global maxima. These properties can be utilized in developing new approaches
to the maximum independent set problem. 相似文献
6.
Hu Haiyan 《Acta Mechanica Solida Sinica》1994,7(2):137-150
This paper deals with the numerical solution of high dimensional dynamic systems with nonsmooth characteristics, such as structural elastoplasticity, mechanical clearance and dry friction. As a stable periodic response of the system attracts its transient response, it may be extracted from the transient response somehow. The paper suggests a novel iteration scheme to extrapolate the periodic response from a short time history of its transient response by curve fitting. Compared with the current schemes such as shooting and incremental harmonic balancing, the present scheme makes full use of the information within the transient response and the system characters, then its computation efficiency has increased by an order and the numerical convergence depending on the initial iteration has greatly improved.The subject supported by the Chinese Foundation of Aeronautical Science 相似文献
7.
Comparison of Two Reformulation-Linearization Technique Based Linear Programming Relaxations for Polynomial Programming Problems 总被引:3,自引:0,他引:3
In this paper, we compare two strategies for constructing linear programmingrelaxations for polynomial programming problems using aReformulation-Linearization Technique (RLT). RLT involves an automaticreformulation of the problem via the addition of certain nonlinear impliedconstraints that are generated by using the products of the simple boundingrestrictions (among other products), and a subsequent linearization based onvariable redefinitions. We prove that applying RLT directly to the originalpolynomial program produces a bound that dominates in the sense of being atleast as tight as the value obtained when RLT is applied to the jointcollection of all equivalent quadratic problems that could be constructed byrecursively defining additional variables as suggested by Shor. 相似文献
8.
灰色Verhulst模型的样条插值函数的残差修正 总被引:4,自引:0,他引:4
本用样条函数对灰色Verhulst模型的残差序列进行插值拟合,然后作用于二阶线性微分方程,并以此修正原模型,得到一种新的预测模型的数值解,提高了拟合的精确度。 相似文献
9.
Josef Obermaier 《Journal of Approximation Theory》2003,125(2):303-312
Let
be compact with #S=∞ and let C(S) be the set of all real continuous functions on S. We ask for an algebraic polynomial sequence (Pn)n=0∞ with deg Pn=n such that every fC(S) has a unique representation f=∑i=0∞ αiPi and call such a basis Faber basis. In the special case of
, 0<q<1, we prove the existence of such a basis. A special orthonormal Faber basis is given by the so-called little q-Legendre polynomials. Moreover, these polynomials state an example with A(Sq)≠U(Sq)=C(Sq), where A(Sq) is the so-called Wiener algebra and U(Sq) is the set of all fC(Sq) which are uniquely represented by its Fourier series. 相似文献
10.
Likelihood estimation of soft-core interaction potentials for Gibbsian point patterns 总被引:3,自引:3,他引:0
Yosihiko Ogata Masaharu Tanemura 《Annals of the Institute of Statistical Mathematics》1989,41(3):583-600
The likelihood method is developed for the analysis of socalled regular point patterns. Approximating the normalizing factor of Gibbs canonical distribution, we simultaneously estimate two parameters, one for the scale and the other which measures the softness (or hardness), of repulsive interactions between points. The approximations are useful up to a considerably high density. Some real data are analyzed to illustrate the utility of the parameters for characterizing the regular point pattern. 相似文献