全文获取类型
收费全文 | 16252篇 |
免费 | 1178篇 |
国内免费 | 862篇 |
专业分类
化学 | 351篇 |
晶体学 | 2篇 |
力学 | 1470篇 |
综合类 | 203篇 |
数学 | 15003篇 |
物理学 | 1263篇 |
出版年
2024年 | 31篇 |
2023年 | 144篇 |
2022年 | 248篇 |
2021年 | 282篇 |
2020年 | 371篇 |
2019年 | 377篇 |
2018年 | 420篇 |
2017年 | 434篇 |
2016年 | 426篇 |
2015年 | 322篇 |
2014年 | 727篇 |
2013年 | 1256篇 |
2012年 | 743篇 |
2011年 | 853篇 |
2010年 | 762篇 |
2009年 | 1062篇 |
2008年 | 1068篇 |
2007年 | 1141篇 |
2006年 | 977篇 |
2005年 | 766篇 |
2004年 | 662篇 |
2003年 | 720篇 |
2002年 | 625篇 |
2001年 | 488篇 |
2000年 | 479篇 |
1999年 | 422篇 |
1998年 | 394篇 |
1997年 | 352篇 |
1996年 | 280篇 |
1995年 | 236篇 |
1994年 | 165篇 |
1993年 | 125篇 |
1992年 | 132篇 |
1991年 | 122篇 |
1990年 | 85篇 |
1989年 | 49篇 |
1988年 | 59篇 |
1987年 | 47篇 |
1986年 | 51篇 |
1985年 | 78篇 |
1984年 | 73篇 |
1983年 | 33篇 |
1982年 | 39篇 |
1981年 | 33篇 |
1980年 | 33篇 |
1979年 | 28篇 |
1978年 | 20篇 |
1977年 | 24篇 |
1976年 | 12篇 |
1936年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
961.
R. Sritharan 《Discrete Mathematics》2008,308(12):2581-2588
Golumbic, Kaplan, and Shamir [Graph sandwich problems, J. Algorithms 19 (1995) 449-473], in their paper on graph sandwich problems published in 1995, left the status of the sandwich problems for strongly chordal graphs and chordal bipartite graphs open. It was recently shown [C.M.H. de Figueiredo, L. Faria, S. Klein, R. Sritharan, On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs, Theoret. Comput. Sci., accepted for publication] that the sandwich problem for strongly chordal graphs is NP-complete. We show that given graph G with a proper vertex coloring c, determining whether there is a supergraph of G that is chordal bipartite and also is properly colored by c is NP-complete. This implies that the sandwich problem for chordal bipartite graphs is also NP-complete. 相似文献
962.
Nela Bosner 《Annali dell'Universita di Ferrara》2008,54(2):203-216
Inverse iteration is simple but not very efficient method for computing few eigenvalues with minimal absolute values and corresponding
eigenvectors of a symmetric matrix. The idea is to increase its efficiency by technique similar to multigrid methods used
for solving linear systems. This approach is not new, but until now multigrid was mostly used for solving linear system which
appear in Rayleigh quotient iteration, inverse iteration and related iterative methods. Instead of choosing appropriate coordinates
(grids), our algorithm performs inverse iteration on a sequence of subspaces with decreasing dimensions (multispace). Block Lanczos method is used for the selection of a smaller subspace. This will produce a banded matrix, which makes inverse
iteration even faster in the smaller dimensions.
相似文献
963.
S. Ramasubramanian 《Proceedings Mathematical Sciences》2008,118(2):161-182
2007 Abel prize has been awarded to S R S Varadhan for creating a unified theory of large deviations. We attempt to give a
flavour of this branch of probability theory, highlighting the role of Varadhan. 相似文献
964.
In this paper,we consider nonnegative solutions to Cauchy problem for the general nonlinear filtration equations ut-Dj(aij(x,t,u)Diφ(u))+bi(t,u)Diu+C(x,t,u)=0,and obtain the existence,uniqueness and blow-up in finite time of these solutions under some structure conditions. 相似文献
965.
G. Mastroeni 《Journal of Optimization Theory and Applications》2001,109(3):539-555
We consider the variational inequality that represents the first-order optimality condition for the class of variational problems with the property that the integrand in the objective functional does not depend on the derivative of the unknown function. This allows the development of an iterative method for solving the statistical decision problem of testing simple hypotheses. 相似文献
966.
Radu Ioan Bo? Sorin-Mihai Grad 《Journal of Mathematical Analysis and Applications》2008,337(2):1315-1325
We give some necessary and sufficient conditions which completely characterize the strong and total Lagrange duality, respectively, for convex optimization problems in separated locally convex spaces. We also prove similar statements for the problems obtained by perturbing the objective functions of the primal problems by arbitrary linear functionals. In the particular case when we deal with convex optimization problems having infinitely many convex inequalities as constraints the conditions we work with turn into the so-called Farkas-Minkowski and locally Farkas-Minkowski conditions for systems of convex inequalities, recently used in the literature. Moreover, we show that our new results extend some existing ones in the literature. 相似文献
967.
The structural and magnetic evolution in magnesium ferrite (MgFe2O4) caused by high-energy milling is investigated by Mössbauer spectroscopy. 相似文献
968.
Corina Fetecau M. Jamil Constantin Fetecau I. Siddique 《International Journal of Non》2009,44(10):854-1090
New exact solutions corresponding to the second problem of Stokes for Maxwell fluids have been established by means of Laplace transforms. For large times, these solutions reduce to the well-known steady-state solutions which are periodic in time and independent of the initial conditions. Furthermore, the transient solutions are in accordance with the previous solutions obtained using the Fourier sine transform. The required time to get the steady-state is determined by graphical illustrations. This time decreases if the frequency of the velocity increases. The effects of the material parameters on the decay of the transients in time are also investigated by graphs. 相似文献
969.
本文给出了一种求解波动方程反演问题的“多目标函数法”.这种方法简单、有效,并具有明确的物理意义.对于三维问题的程序化它有很强的优越性. 相似文献
970.
Martin Hanke Nuutti Hyvönen Manfred Lehn Stefanie Reusswig 《BIT Numerical Mathematics》2008,48(2):245-264
We investigate the inverse source problem of electrostatics in a bounded and convex domain with compactly supported source.
We try to extract all information about the unknown source support from the given Cauchy data of the associated potential,
adopting by this previous work of Kusiak and Sylvester to the case of electrostatics. We introduce, and for the unit disk
we also compute numerically, what we call the discoidal source support, i.e., the smallest set made up by the intersection of disks within the domain, which carries a source compatible with the
given data.
AMS subject classification (2000) 35R30, 65N21 相似文献