全文获取类型
收费全文 | 6447篇 |
免费 | 371篇 |
国内免费 | 669篇 |
专业分类
化学 | 528篇 |
晶体学 | 5篇 |
力学 | 74篇 |
综合类 | 117篇 |
数学 | 2381篇 |
物理学 | 420篇 |
综合类 | 3962篇 |
出版年
2024年 | 7篇 |
2023年 | 40篇 |
2022年 | 78篇 |
2021年 | 95篇 |
2020年 | 99篇 |
2019年 | 109篇 |
2018年 | 114篇 |
2017年 | 114篇 |
2016年 | 150篇 |
2015年 | 157篇 |
2014年 | 264篇 |
2013年 | 380篇 |
2012年 | 312篇 |
2011年 | 372篇 |
2010年 | 302篇 |
2009年 | 398篇 |
2008年 | 408篇 |
2007年 | 479篇 |
2006年 | 402篇 |
2005年 | 401篇 |
2004年 | 381篇 |
2003年 | 342篇 |
2002年 | 300篇 |
2001年 | 262篇 |
2000年 | 228篇 |
1999年 | 226篇 |
1998年 | 196篇 |
1997年 | 149篇 |
1996年 | 119篇 |
1995年 | 101篇 |
1994年 | 91篇 |
1993年 | 62篇 |
1992年 | 64篇 |
1991年 | 57篇 |
1990年 | 62篇 |
1989年 | 55篇 |
1988年 | 39篇 |
1987年 | 13篇 |
1986年 | 13篇 |
1985年 | 9篇 |
1984年 | 9篇 |
1983年 | 5篇 |
1982年 | 4篇 |
1981年 | 5篇 |
1979年 | 2篇 |
1977年 | 2篇 |
1974年 | 2篇 |
1959年 | 1篇 |
1955年 | 2篇 |
1936年 | 2篇 |
排序方式: 共有7487条查询结果,搜索用时 78 毫秒
61.
多目标最优化的一种积分型实现算法 总被引:2,自引:1,他引:1
在文[1]中给出了求解多目标最优化的一种积分总极值的概念性算法.本文利用数论中的一致分布佳点集列,较为简便的得出了多目标最优化的积分总极值的实现算法和算法终止准则.并经过有关函数数值计算表明该算法是有效的,可用来求解多目标最优化问题的有效解. 相似文献
62.
Jonas Sderberg 《Journal of Algebra》2004,280(2):610-623
In order to use dualization to study Hilbert functions of artinian level algebras we extend the notion of level sequences and cancellable sequences, introduced by Geramita and Lorenzini, to include Hilbert functions of certain artinian modules. As in the case of algebras a level sequence is cancellable, but now by dualization its reverse is also cancellable which gives a new condition on level sequences. We also give a characterization of the cancellable sequences involving Macaulay representations. 相似文献
63.
在误差序列为Lqmixingale情形下,给出了半参数回归模型中β和g(t)估计,研究了估计量的q阶平均相合性在较一般的条件下,得到了理想的结果 相似文献
64.
Mursaleen 《Journal of Mathematical Analysis and Applications》2004,293(2):523-531
The idea of almost convergence for double sequences was introduced by Moricz and Rhoades [Math. Proc. Cambridge Philos. Soc. 104 (1988) 283-294] and they also characterized the four dimensional strong regular matrices. In this paper we define and characterize the almost strongly regular matrices for double sequences and apply these matrices to establish a core theorem. 相似文献
65.
Balanced sampling plans excluding contiguous units (or BSEC) were first introduced by Hedayat, Rao, and Stufken in 1988. In this paper, we generalize the concept of a cyclic BSEC to a cyclic balanced sampling plan to avoid the selection of adjacent units (or CBSA for short) and use Langford and extended Langford sequences to construct a cyclic BSA(ν, 3, λ; α) with α = 2, 3. We finally establish the necessary and sufficient conditions for the existence of a cyclic BSA(ν, 3, λ; α) where α = 2, 3. © 2005 Wiley Periodicals, Inc. J Combin Designs. 相似文献
66.
Ioannis K. Argyros 《Journal of Mathematical Analysis and Applications》2004,298(2):374-397
We provide a local as well as a semilocal convergence analysis for two-point Newton-like methods in a Banach space setting under very general Lipschitz type conditions. Our equation contains a Fréchet differentiable operator F and another operator G whose differentiability is not assumed. Using more precise majorizing sequences than before we provide sufficient convergence conditions for Newton-like methods to a locally unique solution of equation F(x)+G(x)=0. In the semilocal case we show under weaker conditions that our error estimates on the distances involved are finer and the information on the location of the solution at least as precise as in earlier results. In the local case a larger radius of convergence is obtained. Several numerical examples are provided to show that our results compare favorably with earlier ones. As a special case we show that the famous Newton-Kantorovich hypothesis is weakened under the same hypotheses as the ones contained in the Newton-Kantorovich theorem. 相似文献
67.
68.
该文给出赋0rlicz范数的Musielak-Orlicz序列空间中Gateaux可微点(光滑点)与Frechet可微点(强光滑点)的判定准则.在此基础上推出了该空间具有光滑性或强光滑性的充分必要条件. 相似文献
69.
70.
Keith Jonathan M. Kroese Dirk P. Bryant Darryn 《Methodology and Computing in Applied Probability》2004,6(1):29-53
A recent development of the Markov chain Monte Carlo (MCMC) technique is the emergence of MCMC samplers that allow transitions between different models. Such samplers make possible a range of computational tasks involving models, including model selection, model evaluation, model averaging and hypothesis testing. An example of this type of sampler is the reversible jump MCMC sampler, which is a generalization of the Metropolis–Hastings algorithm. Here, we present a new MCMC sampler of this type. The new sampler is a generalization of the Gibbs sampler, but somewhat surprisingly, it also turns out to encompass as particular cases all of the well-known MCMC samplers, including those of Metropolis, Barker, and Hastings. Moreover, the new sampler generalizes the reversible jump MCMC. It therefore appears to be a very general framework for MCMC sampling. This paper describes the new sampler and illustrates its use in three applications in Computational Biology, specifically determination of consensus sequences, phylogenetic inference and delineation of isochores via multiple change-point analysis. 相似文献