全文获取类型
收费全文 | 17690篇 |
免费 | 3329篇 |
国内免费 | 785篇 |
专业分类
化学 | 2160篇 |
晶体学 | 82篇 |
力学 | 958篇 |
综合类 | 167篇 |
数学 | 4664篇 |
物理学 | 5178篇 |
无线电 | 8595篇 |
出版年
2024年 | 36篇 |
2023年 | 174篇 |
2022年 | 297篇 |
2021年 | 449篇 |
2020年 | 520篇 |
2019年 | 461篇 |
2018年 | 434篇 |
2017年 | 675篇 |
2016年 | 767篇 |
2015年 | 726篇 |
2014年 | 1096篇 |
2013年 | 1434篇 |
2012年 | 1332篇 |
2011年 | 1359篇 |
2010年 | 1107篇 |
2009年 | 1051篇 |
2008年 | 1238篇 |
2007年 | 1185篇 |
2006年 | 1073篇 |
2005年 | 900篇 |
2004年 | 764篇 |
2003年 | 779篇 |
2002年 | 652篇 |
2001年 | 545篇 |
2000年 | 451篇 |
1999年 | 387篇 |
1998年 | 288篇 |
1997年 | 295篇 |
1996年 | 223篇 |
1995年 | 194篇 |
1994年 | 152篇 |
1993年 | 104篇 |
1992年 | 84篇 |
1991年 | 82篇 |
1990年 | 61篇 |
1989年 | 50篇 |
1988年 | 39篇 |
1987年 | 40篇 |
1986年 | 33篇 |
1985年 | 58篇 |
1984年 | 36篇 |
1983年 | 20篇 |
1982年 | 32篇 |
1981年 | 25篇 |
1980年 | 11篇 |
1979年 | 21篇 |
1978年 | 14篇 |
1977年 | 13篇 |
1976年 | 11篇 |
1973年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
41.
42.
43.
带干扰的多险种风险模型 总被引:2,自引:0,他引:2
由于保险公司风险经营规模不断扩大,用单一险种的模型来描述风险过程存在局限性,本文讨论了带干扰多险种风险模型,应用鞅论方法,得出伦德伯格不等式和最终破产概率公式。 相似文献
44.
Blaise Faugeras Jé rô me Pousin Franck Fontvieille. 《Mathematics of Computation》2006,75(253):209-222
A numerical scheme based on an operator splitting method and a dense output event location algorithm is proposed to integrate a diffusion-dissolution/precipitation chemical initial-boundary value problem with jumping nonlinearities. The numerical analysis of the scheme is carried out and it is proved to be of order 2 in time. This global order estimate is illustrated numerically on a test case.
45.
Claudio Simeone 《General Relativity and Gravitation》2002,34(11):1887-1893
A consistent quantization with a clear notion of time and evolution is given for the anisotropic Kantowski–Sachs cosmological model. It is shown that a suitable coordinate choice allows to obtain a solution of the Wheeler–DeWitt equation in the form of definite energy states, and that the results can be associated to two disjoint equivalent theories, one for each sheet of the constraint surface. 相似文献
46.
可变抽样区间的非参数控制图 总被引:1,自引:1,他引:0
最近几年一些学者研究了可变抽样区间的质量控制图。Amin等提出了可变抽样区间(VSI)的非参数控制图———符号 (Sign)统计量图〔1〕。本文在此基础上研究位置VSI符号控制图的制定方法 ,并设计离散VSI符号控制图。符号控制图的优点是对非正态总体亦可应用 ,并且不需要过程方差的信息。本文将所设计的VSI符号控制图同固定抽样区间 (FSI)的常规图作比较 ,并举实例说明符号控制图的应用 相似文献
47.
A Dirac picture perturbation theory is developed for the time evolution operator in classical dynamics in the spirit of the Schwinger–Feynman–Dyson perturbation expansion and detailed rules are derived for computations. Complexification formalisms are given for the time evolution operator suitable for phase space analyses, and then extended to a two-dimensional setting for a study of the geometrical Berry phase as an example. Finally a direct integration of Hamilton's equations is shown to lead naturally to a path integral expression, as a resolution of the identity, as applied to arbitrary functions of generalized coordinates and momenta. 相似文献
48.
Murad Nour Mohammad Belfiore Jean Claude Guisantes George Rodriguez 《Wireless Personal Communications》2002,20(2):145-161
In DS-WCDMA mobile systems such the UMTS, asynchronous cell site operation,assigning different long spreading code to each cell, yields the advantageof flexible system deployment. We can design an indoor system basedon an outdoor one. However, in general, much longer search time isrequired in asynchronous operation than in synchronous. This paperproposes three techniques to take decisions about synchronizationbased on observation of correlated signals. Classical decision criterialike maximum and threshold criterion are presented. A new decisioncriteria that we call Threshold&Max combined decision criteriais analyzed. The results of this new introduced technique is comparedwith the classical ones. 相似文献
49.
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. 相似文献
50.