全文获取类型
收费全文 | 5354篇 |
免费 | 712篇 |
国内免费 | 428篇 |
专业分类
化学 | 1227篇 |
晶体学 | 32篇 |
力学 | 506篇 |
综合类 | 80篇 |
数学 | 2872篇 |
物理学 | 1777篇 |
出版年
2024年 | 8篇 |
2023年 | 57篇 |
2022年 | 157篇 |
2021年 | 141篇 |
2020年 | 135篇 |
2019年 | 140篇 |
2018年 | 130篇 |
2017年 | 176篇 |
2016年 | 216篇 |
2015年 | 188篇 |
2014年 | 315篇 |
2013年 | 366篇 |
2012年 | 229篇 |
2011年 | 322篇 |
2010年 | 288篇 |
2009年 | 289篇 |
2008年 | 354篇 |
2007年 | 377篇 |
2006年 | 337篇 |
2005年 | 268篇 |
2004年 | 278篇 |
2003年 | 244篇 |
2002年 | 194篇 |
2001年 | 165篇 |
2000年 | 162篇 |
1999年 | 144篇 |
1998年 | 110篇 |
1997年 | 108篇 |
1996年 | 82篇 |
1995年 | 79篇 |
1994年 | 55篇 |
1993年 | 43篇 |
1992年 | 41篇 |
1991年 | 39篇 |
1990年 | 23篇 |
1989年 | 28篇 |
1988年 | 22篇 |
1987年 | 27篇 |
1986年 | 14篇 |
1985年 | 27篇 |
1984年 | 18篇 |
1983年 | 15篇 |
1982年 | 11篇 |
1981年 | 10篇 |
1980年 | 13篇 |
1979年 | 12篇 |
1978年 | 8篇 |
1977年 | 7篇 |
1976年 | 6篇 |
1973年 | 4篇 |
排序方式: 共有6494条查询结果,搜索用时 93 毫秒
1.
《Operations Research Letters》2022,50(3):274-280
The minimum k-enclosing ball problem seeks the ball with smallest radius that contains at least k of m given points. This problem is NP-hard. We present a branch-and-bound algorithm on the tree of the subsets of k points to solve this problem. Our method is able to solve the problem exactly in a short amount of time for small and medium sized datasets. 相似文献
2.
Renny Mathew Karolina A. Uchman Lydia Gkoura Chris J. Pickard Maria Baias 《Magnetic resonance in chemistry : MRC》2020,58(11):1018-1025
A combined experimental and computational approach was used to distinguish between different polymorphs of the pharmaceutical drug aspirin. This method involves the use of ab initio random structure searching (AIRSS), a density functional theory (DFT)-based crystal structure prediction method for the high-accuracy prediction of polymorphic structures, with DFT calculations of nuclear magnetic resonance (NMR) parameters and solid-state NMR experiments at natural abundance. AIRSS was used to predict the crystal structures of form-I and form-II of aspirin. The root-mean-square deviation between experimental and calculated 1H chemical shifts was used to identify form-I as the polymorph present in the experimental sample, the selection being successful despite the large similarities between the molecular environments in the crystals of the two polymorphs. 相似文献
3.
Mourad Kainane Mezadek Mohamed Kainane Mezadek Michael Reissig 《Mathematical Methods in the Applied Sciences》2020,43(6):3117-3147
In this paper, we study the global (in time) existence of small data solutions to the Cauchy problem for the semilinear wave equation with friction, viscoelastic damping, and a power nonlinearity. We are interested in the connection between regularity assumptions for the data and the admissible range of exponents p in the power nonlinearity. 相似文献
4.
基于时变Copula模型,获得预测方差,确定单个基金收益率序列的边缘分布.利用常见的静态Copula和时变Copula模型对基金收益率序列间两两相依关系进行建模并进行对比分析.应用研究表明,基于MCMC方法的时变Copula模型能更有效地度量基金收益率序列的风险. 相似文献
5.
Heinrich Saller 《International Journal of Theoretical Physics》2002,41(8):1491-1509
Unstable particles, together with their stable decay products, constitute probability collectives that are defined as Hilbert spaces with dimension higher than one, nondecomposable in a particle basis. Their structure is considered in the framework of Birkhoff-von Neumann's Hilbert subspace lattices. Bases with particle states are related to bases with a diagonal scalar product by a Hilbert-bein involving the characteristic decay parameters (in some analogy to the n-bein structures of metrical manifolds). Probability predictions as expectation values, involving unstable particles, have to take into account all members of the higher dimensional collective. For example, the unitarity structure of the S-matrix for an unstable particle collective can be established by a transformation with its Hilbert-bein. 相似文献
6.
根据Pegg-Barnett位相定义, 计算了一种新的奇偶非线性相干态的位相概率分布函数, 利用数值计算方法研究了它们的位相统计性质. 数值计算结果表明:新的奇偶非线性相干态的位相特性与通常奇偶相干态的位相特性截然不同. 相似文献
7.
带干扰的多险种风险模型 总被引:2,自引:0,他引:2
由于保险公司风险经营规模不断扩大,用单一险种的模型来描述风险过程存在局限性,本文讨论了带干扰多险种风险模型,应用鞅论方法,得出伦德伯格不等式和最终破产概率公式。 相似文献
8.
We obtain upper bounds for the tail distribution of the first nonnegative sum of a random walk and for the moments of the overshoot over an arbitrary nonnegative level if the expectation of jumps is positive and close to zero. In addition, we find an estimate for the expectation of the first ladder epoch. 相似文献
9.
Shunlong Luo 《Foundations of Physics》2002,32(11):1757-1772
We formulate an elementary statistical game which captures the essence of some fundamental quantum experiments such as photon polarization and spin measurement. We explore and compare the significance of the principle of maximum Shannon entropy and the principle of minimum Fisher information in solving such a game. The solution based on the principle of minimum Fisher information coincides with the solution based on an invariance principle, and provides an informational explanation of Malus' law for photon polarization. There is no solution based on the principle of maximum Shannon entropy. The result demonstrates the merits of Fisher information, and the demerits of Shannon entropy, in treating some fundamental quantum problems. It also provides a quantitative example in support of a general philosophy: Nature intends to hide Fisher information, while obeying some simple rules. 相似文献
10.
Evolutionary algorithms are applied as problem-independent optimization algorithms. They are quite efficient in many situations. However, it is difficult to analyze even the behavior of simple variants of evolutionary algorithms like the (1+1) EA on rather simple functions. Nevertheless, only the analysis of the expected run time and the success probability within a given number of steps can guide the choice of the free parameters of the algorithms. Here static (1+1) EAs with a fixed mutation probability are compared with dynamic (1+1) EAs with a simple schedule for the variation of the mutation probability. The dynamic variant is first analyzed for functions typically chosen as example-functions for evolutionary algorithms. Afterwards, it is shown that it can be essential to choose the suitable variant of the (1+1) EA. More precisely, functions are presented where each static (1+1) EA has exponential expected run time while the dynamic variant has polynomial expected run time. For other functions it is shown that the dynamic (1+1) EA has exponential expected run time while a static (1+1) EA with a good choice of the mutation probability has polynomial run time with overwhelming probability. 相似文献