全文获取类型
收费全文 | 12315篇 |
免费 | 2162篇 |
国内免费 | 781篇 |
专业分类
化学 | 2162篇 |
晶体学 | 79篇 |
力学 | 1060篇 |
综合类 | 194篇 |
数学 | 6990篇 |
物理学 | 4773篇 |
出版年
2024年 | 13篇 |
2023年 | 115篇 |
2022年 | 254篇 |
2021年 | 328篇 |
2020年 | 367篇 |
2019年 | 396篇 |
2018年 | 365篇 |
2017年 | 500篇 |
2016年 | 526篇 |
2015年 | 413篇 |
2014年 | 684篇 |
2013年 | 1168篇 |
2012年 | 699篇 |
2011年 | 817篇 |
2010年 | 729篇 |
2009年 | 831篇 |
2008年 | 844篇 |
2007年 | 762篇 |
2006年 | 653篇 |
2005年 | 587篇 |
2004年 | 493篇 |
2003年 | 540篇 |
2002年 | 451篇 |
2001年 | 378篇 |
2000年 | 318篇 |
1999年 | 323篇 |
1998年 | 249篇 |
1997年 | 250篇 |
1996年 | 185篇 |
1995年 | 170篇 |
1994年 | 125篇 |
1993年 | 85篇 |
1992年 | 73篇 |
1991年 | 60篇 |
1990年 | 58篇 |
1989年 | 52篇 |
1988年 | 35篇 |
1987年 | 40篇 |
1986年 | 33篇 |
1985年 | 61篇 |
1984年 | 40篇 |
1983年 | 23篇 |
1982年 | 32篇 |
1981年 | 33篇 |
1980年 | 12篇 |
1979年 | 23篇 |
1978年 | 14篇 |
1977年 | 14篇 |
1976年 | 11篇 |
1973年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
61.
研制出了用于计算氚投料量在FEB聚变堆各个子系统中的分布及其随时间变化的数值模拟程序包SWITRIM。通过近5年的使用,表明其运行良好、计算结果可靠。用SWITRIM数值模拟研究了聚变堆起动过程中的“氚坑深度和氚坑时间”新现象。简单介绍了SWITRIM程序包的组成和用户使用说明以及最新的运用等。 相似文献
62.
Europium (Eu+) ions were confined in a Paul trap and detected by non-destructive method. Storage time of Eu+ ions achieved in vacuum was improved by orders of magnitude employing buffer gas cooling. The experimentally detected signal
was fitted to the ion response signal and the total number of ions trapped was estimated. It is found that the peak signal
amplitude as well as the product of FWHM and the peak signal amplitude is proportional to the total number of trapped ions.
The trapped ion secular frequency was swept at different rates and its effect on the absorption line profile was studied both
experimentally and theoretically. 相似文献
63.
Daria E. Lonsdale Geoffrey Johnston‐Hall Amanda Fawcett Craig A. Bell Carl N. Urbani Michael R. Whittaker Michael J. Monteiro 《Journal of polymer science. Part A, Polymer chemistry》2007,45(16):3620-3625
In this work, we propose that retardation in vinyl acetate polymerization rate in the presence of toluene is due to degradative chain transfer. The transfer constant to toluene (Ctrs) determined using the Mayo method is equal to 3.8 × 10?3, which is remarkably similar to the value calculated from the rate data, assuming degradative chain transfer (2.7 × 10?3). Simulations, including chain‐length‐dependent termination, were carried out to compare our degradative chain transfer model with experimental results. The conversion–time profiles showed excellent agreement between experiment and simulation. Good agreement was found for the Mn data as a function of conversion. The experimental and simulation data strongly support the postulate that degradative chain transfer is the dominant kinetic mechanism. © 2007 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 45: 3620–3625, 2007 相似文献
64.
Robert J. Rubin 《Journal of statistical physics》1991,65(5-6):1207-1216
A one-dimensional lattice random walk in the presence ofm equally spaced traps is considered. The step length distribution is a symmetric exponential. An explicit analytic expression is obtained for the probability that the random walk will be trapped at thejth trapping site. 相似文献
65.
We consider queuing systems where customers are not allowed to queue, instead of that they make repeated attempts, or retrials, in order to enter service after some time. We obtain the distribution of the number of retrials produced by a tagged customer, until he finds an available server. 相似文献
66.
Many recent algorithmic approaches involve the construction of a differential equation model for computational purposes, typically
by introducing an artificial time variable. The actual computational model involves a discretization of the now time-dependent differential system, usually
employing forward Euler. The resulting dynamics of such an algorithm is then a discrete dynamics, and it is expected to be
“close enough” to the dynamics of the continuous system (which is typically easier to analyze) provided that small – hence
many – time steps, or iterations, are taken. Indeed, recent papers in inverse problems and image processing routinely report
results requiring thousands of iterations to converge. This makes one wonder if and how the computational modeling process
can be improved to better reflect the actual properties sought.
In this article we elaborate on several problem instances that illustrate the above observations. Algorithms may often lend
themselves to a dual interpretation, in terms of a simply discretized differential equation with artificial time and in terms
of a simple optimization algorithm; such a dual interpretation can be advantageous. We show how a broader computational modeling
approach may possibly lead to algorithms with improved efficiency.
AMS subject classification (2000) 65L05, 65M32, 65N21, 65N22, 65D18 相似文献
67.
68.
In this paper, nonconvex multiobjective optimization problems are studied. New characterizations of a properly efficient solution in the sense of Geoffrion's are established in terms of the stability of one scalar optimization problem and the existence of an exact penalty function of a scalar constrained program, respectively. One of the characterizations is applied to derive necessary conditions for a properly efficient control-parameter pair of a nonconvex multiobjective discrete optimal control problem with linear constraints. 相似文献
69.
Masanobu Haraguchi David F. P. Pile Toshihiro Okamoto Masuo Fukui Dmitri K. Gramotnev 《Optical Review》2006,13(4):228-230
We have numerically shown the existence of coupled wedge plasmons (CWPs) which propagates along a nano gap of a twin metal
wedge. The CWPs are formed by wedge plasmons which can interact with each other. The dispersion relations of the wavenumber,
propagation distance, and beam area of CWPs, are described and show that the characteristics of CWPs are similar to those
of wedge plasmons and of gap plasmons. We also propose a new plasmon waveguide composed of twin metal wedges with a nano gap. 相似文献
70.
Yuanqiu Huang 《Discrete Applied Mathematics》2007,155(3):405-409
A stable set of a graph is a vertex set in which any two vertices are not adjacent. It was proven in [A. Brandstädt, V.B. Le, T. Szymczak, The complexity of some problems related to graph 3-colorability, Discrete Appl. Math. 89 (1998) 59-73] that the following problem is NP-complete: Given a bipartite graph G, check whether G has a stable set S such thatG-Sis a tree. In this paper we prove the following problem is polynomially solvable: Given a graph G with maximum degree 3 and containing no vertices of degree 2, check whether G has a stable set S such thatG-Sis a tree. Thus we partly answer a question posed by the authors in the above paper. Moreover, we give some structural characterizations for a graph G with maximum degree 3 that has a stable set S such that G-S is a tree. 相似文献