全文获取类型
收费全文 | 3797篇 |
免费 | 191篇 |
国内免费 | 180篇 |
专业分类
化学 | 482篇 |
晶体学 | 10篇 |
力学 | 68篇 |
综合类 | 42篇 |
数学 | 3034篇 |
物理学 | 532篇 |
出版年
2023年 | 18篇 |
2022年 | 66篇 |
2021年 | 84篇 |
2020年 | 85篇 |
2019年 | 82篇 |
2018年 | 91篇 |
2017年 | 92篇 |
2016年 | 116篇 |
2015年 | 82篇 |
2014年 | 149篇 |
2013年 | 406篇 |
2012年 | 153篇 |
2011年 | 157篇 |
2010年 | 142篇 |
2009年 | 212篇 |
2008年 | 209篇 |
2007年 | 256篇 |
2006年 | 171篇 |
2005年 | 154篇 |
2004年 | 120篇 |
2003年 | 136篇 |
2002年 | 138篇 |
2001年 | 126篇 |
2000年 | 99篇 |
1999年 | 108篇 |
1998年 | 79篇 |
1997年 | 80篇 |
1996年 | 61篇 |
1995年 | 65篇 |
1994年 | 64篇 |
1993年 | 32篇 |
1992年 | 32篇 |
1991年 | 37篇 |
1990年 | 20篇 |
1989年 | 25篇 |
1988年 | 23篇 |
1987年 | 19篇 |
1986年 | 16篇 |
1985年 | 35篇 |
1984年 | 18篇 |
1983年 | 17篇 |
1982年 | 17篇 |
1981年 | 5篇 |
1980年 | 8篇 |
1979年 | 19篇 |
1978年 | 8篇 |
1977年 | 12篇 |
1976年 | 7篇 |
1975年 | 7篇 |
1973年 | 3篇 |
排序方式: 共有4168条查询结果,搜索用时 15 毫秒
21.
关于非齐次m阶马氏信源的渐近均分割性 总被引:4,自引:0,他引:4
本文研究非齐次m阶马氏信源的渐近均分割性,首先我们得到关于此种信源m 1元函数的一类强极限定理,作为推论,得到关于任意非齐次m阶马氏信源状态和熵密度的几个极限定理,最后得到一类非齐次m阶马氏信源的渐近均分割性。 相似文献
22.
Esa Nummelin 《Journal of Theoretical Probability》1994,7(4):739-756
The paper is concerned with characterization results for distributional regeneration. It is shown that distributional regeneration is equivalent to renewal representation of the associated (shift) Markov operator. A sufficient condition for the distributional regeneration of the transfer operator in terms of variation is also formulated. Finally, a minorization condition is formulated and proved to be sufficient for recurrent co-Feller operators. 相似文献
23.
教学质量的时齐马尔可夫链评估法 总被引:1,自引:0,他引:1
本文研究了教学质量评估中的一种定量分析方法──时齐马尔可夫链评估法.阐明了这种方法的理论依据及其实施程序、并指出它较之其他教学质量评估法更显合理. 相似文献
24.
Genetic algorithms are stochastic search algorithms that have been applied to optimization problems. In this paper we analyze the run-time complexity of a genetic algorithm when we are interested in one of a set of distinguished solutions. One such case occurs when multiple optima exist. We define the worst case scenario and derive a probabilistic worst case bound on the number of iterations required to find one of these multiple solutions of interest. 相似文献
25.
In this research, we investigate stopping rules for software testing and propose two stopping rules from the aspect of software reliability testing based on the impartial reliability model. The impartial reliability difference (IRD-MP) rule considers the difference between the impartial transition-probability reliabilities estimated for both software developer and consumers at their predetermined prior information levels. The empirical–impartial reliability difference (EIRD-MP) rule suggests stopping a software test when the computed empirical transition reliability is tending to its estimated impartial transition reliability. To insure the high-standard requirement for safety-critical software, both rules take the maximum probability (MP) of untested paths into account. 相似文献
26.
R. N. Miroshin 《Mathematical Notes》2007,82(3-4):357-365
Multiple integrals generalizing the iterated kernels of integral operators are expressed as single integrals in the case of a special representation of the kernel (this is our theorem). Besides integral equations, Markov processes involve these integrals as well. As a consequence of the theorem, we obtain transition probability densities of certain Markov processes. As an illustration, we consider nine examples. 相似文献
27.
28.
Optimal production and rationing decisions in supply chains with information sharing 总被引:1,自引:0,他引:1
Boray Huang 《Operations Research Letters》2007,35(5):669-676
This paper considers a two-echelon capacitated supply chain with two non-identical retailers and information sharing. We characterize the optimal inventory policies. We also study the benefits of the optimal stock rationing policy over the first come first served (FCFS) and the modified echelon-stock rationing (MESR) policies. 相似文献
29.
We construct random locally compact real trees called Lévy trees that are the genealogical trees associated with continuous-state
branching processes. More precisely, we define a growing family of discrete Galton–Watson trees with i.i.d. exponential branch
lengths that is consistent under Bernoulli percolation on leaves; we define the Lévy tree as the limit of this growing family
with respect to the Gromov–Hausdorff topology on metric spaces. This elementary approach notably includes supercritical trees
and does not make use of the height process introduced by Le Gall and Le Jan to code the genealogy of (sub)critical continuous-state
branching processes. We construct the mass measure of Lévy trees and we give a decomposition along the ancestral subtree of
a Poisson sampling directed by the mass measure.
T. Duquesne is supported by NSF Grants DMS-0203066 and DMS-0405779. M. Winkel is supported by Aon and the Institute of Actuaries,
EPSRC Grant GR/T26368/01, le département de mathématique de l’Université d’Orsay and NSF Grant DMS-0405779. 相似文献
30.
Robert S. Maier 《Random Structures and Algorithms》1991,2(4):379-420
We analyze the performance of a prototypical scheme for shared storage allocation: two initially empty stacks evolving in a contiguous block of memory of size m. We treat the case in which the stacks are more likely to shrink than grow, but with the probabilities of insertion and deletion allowed to depend arbitrarily on stack height as a fraction of m. New results are obtained on the m → ∞ asymptotics of the stack collision time, and of the final stack heights. The results of Wentzell and Freidlin on the large deviations of Markov chains are used, and the relation of their formalism to the Hamiltonian formulation of classical mechanics is emphasized. Certain results on higher-order asymptotics follow from WKB expansions. 相似文献