全文获取类型
收费全文 | 4222篇 |
免费 | 189篇 |
国内免费 | 16篇 |
专业分类
化学 | 3461篇 |
晶体学 | 16篇 |
力学 | 67篇 |
数学 | 425篇 |
物理学 | 458篇 |
出版年
2023年 | 50篇 |
2022年 | 138篇 |
2021年 | 177篇 |
2020年 | 141篇 |
2019年 | 120篇 |
2018年 | 59篇 |
2017年 | 56篇 |
2016年 | 175篇 |
2015年 | 179篇 |
2014年 | 163篇 |
2013年 | 236篇 |
2012年 | 337篇 |
2011年 | 371篇 |
2010年 | 210篇 |
2009年 | 172篇 |
2008年 | 291篇 |
2007年 | 257篇 |
2006年 | 254篇 |
2005年 | 181篇 |
2004年 | 189篇 |
2003年 | 148篇 |
2002年 | 125篇 |
2001年 | 27篇 |
2000年 | 29篇 |
1999年 | 26篇 |
1998年 | 19篇 |
1997年 | 21篇 |
1996年 | 24篇 |
1995年 | 20篇 |
1994年 | 16篇 |
1993年 | 5篇 |
1991年 | 6篇 |
1990年 | 6篇 |
1989年 | 9篇 |
1988年 | 5篇 |
1987年 | 8篇 |
1986年 | 10篇 |
1985年 | 19篇 |
1984年 | 18篇 |
1983年 | 16篇 |
1982年 | 17篇 |
1981年 | 18篇 |
1980年 | 10篇 |
1979年 | 8篇 |
1978年 | 7篇 |
1977年 | 13篇 |
1976年 | 7篇 |
1975年 | 6篇 |
1974年 | 7篇 |
1973年 | 4篇 |
排序方式: 共有4427条查询结果,搜索用时 15 毫秒
1.
M. Castagnino R. Id Betan R. Laura 《International Journal of Theoretical Physics》2003,42(10):2423-2439
By extending the notion of mixed states to functionals acting on the space of observables with diagonal singularity we obtain a well-defined complex spectral decomposition of the time evolution for a quantum decaying system. In this formalism, generalized Gamow states are obtained with well-defined physical properties. 相似文献
2.
3.
This paper studies the problem of how changes in the design of the genetic algorithm (GA) have an effect on the results obtained in real-life applications. In this study, focused on the application of a GA to the tuning of technical trading rules in the context of financial markets, our tentative thesis is that the GA is robust with respect to design changes. The optimization of technical trading systems is a suitable area for the application of the GA metaheuristic, as the complexity of the problem grows exponentially as new technical rules are added to the system and as the answer time is crucial when applying the system to real-time data. Up to now, most of GAs applications to this subject obviated the question of possible “design dependence” in their results. The data we report, based on our experiments, do not allow us to refute the hypothesis of robustness of the GA to design implementation, when applying to technical trading systems tuning. 相似文献
4.
Laura Bader Nicola Durante Maska Law Guglielmo Lunardon Tim Penttila 《Designs, Codes and Cryptography》2003,29(1-3):41-50
We do the tentative beginnings of a study of BLT-sets of generalised quadrangles via their symmetries. In particular, the study of whorls about a line leads us to hyperbolic reflections preserving a BLT-set of Q(4, q). 相似文献
5.
6.
Demetrio Pitea Laura Bonati Elena Collina Ugo Cosentino Marina Lasagni Giorgio Moro Roberto Todeschini 《Fresenius' Journal of Analytical Chemistry》1994,348(1-2):111-120
Summary The role of multivariate analysis methods in evaluating, rationalizing, and working out complex environmental problems is discussed. The discussion is organized in two sections; a literature analysis of the application of chemometric methods to PCDD/PCDF data interpretation and source correlation and a review of the role of chemometric methods in analysing the results obtained by the Authors studying PCDD/PCDF formation and destruction mechanisms in MSW combustion processes. 相似文献
7.
8.
A q × n array with entries from 0, 1,…,q − 1 is said to form a difference matrix if the vector difference (modulo q) of each pair of columns consists of a permutation of [0, 1,… q − 1]; this definition is inverted from the more standard one to be found, e.g., in Colbourn and de Launey (1996). The following idea generalizes this notion: Given an appropriate δ (-[−1, 1]t, a λq × n array will be said to form a (t, q, λ, Δ) sign-balanced matrix if for each choice C1, C2,…, Ct of t columns and for each choice = (1,…,t) Δ of signs, the linear combination ∑j=1t jCj contains (mod q) each entry of [0, 1,…, q − 1] exactly λ times. We consider the following extremal problem in this paper: How large does the number k = k(n, t, q, λ, δ) of rows have to be so that for each choice of t columns and for each choice (1, …, t) of signs in δ, the linear combination ∑j=1t jCj contains each entry of [0, 1,…, q t- 1] at least λ times? We use probabilistic methods, in particular the Lovász local lemma and the Stein-Chen method of Poisson approximation to obtain general (logarithmic) upper bounds on the numbers k(n, t, q, λ, δ), and to provide Poisson approximations for the probability distribution of the number W of deficient sets of t columns, given a random array. It is proved, in addition, that arithmetic modulo q yields the smallest array - in a sense to be described. 相似文献
9.
10.