全文获取类型
收费全文 | 24612篇 |
免费 | 2851篇 |
国内免费 | 3358篇 |
专业分类
化学 | 9765篇 |
晶体学 | 105篇 |
力学 | 2099篇 |
综合类 | 184篇 |
数学 | 7764篇 |
物理学 | 10904篇 |
出版年
2024年 | 85篇 |
2023年 | 264篇 |
2022年 | 572篇 |
2021年 | 619篇 |
2020年 | 782篇 |
2019年 | 729篇 |
2018年 | 718篇 |
2017年 | 802篇 |
2016年 | 957篇 |
2015年 | 858篇 |
2014年 | 1228篇 |
2013年 | 2041篇 |
2012年 | 1311篇 |
2011年 | 1581篇 |
2010年 | 1230篇 |
2009年 | 1593篇 |
2008年 | 1633篇 |
2007年 | 1692篇 |
2006年 | 1415篇 |
2005年 | 1200篇 |
2004年 | 974篇 |
2003年 | 988篇 |
2002年 | 915篇 |
2001年 | 729篇 |
2000年 | 741篇 |
1999年 | 627篇 |
1998年 | 566篇 |
1997年 | 431篇 |
1996年 | 294篇 |
1995年 | 286篇 |
1994年 | 241篇 |
1993年 | 236篇 |
1992年 | 223篇 |
1991年 | 182篇 |
1990年 | 200篇 |
1989年 | 190篇 |
1988年 | 166篇 |
1987年 | 168篇 |
1986年 | 139篇 |
1985年 | 140篇 |
1984年 | 141篇 |
1983年 | 80篇 |
1982年 | 112篇 |
1981年 | 107篇 |
1980年 | 95篇 |
1979年 | 98篇 |
1978年 | 77篇 |
1977年 | 76篇 |
1976年 | 71篇 |
1973年 | 61篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
91.
On the Evaluation of Uncertain Courses of Action 总被引:3,自引:0,他引:3
Ronald R. Yager 《Fuzzy Optimization and Decision Making》2002,1(1):13-41
We consider the problem of decision making under uncertainty. The fuzzy measure is introduced as a general way of representing available information about the uncertainty. It is noted that generally in uncertain environments the problem of comparing alternative courses of action is difficult because of the multiplicity of possible outcomes for any action. One approach is to convert this multiplicity of possible of outcomes associated with an alternative into a single value using a valuation function. We describe various ways of providing a valuation function when the uncertainty is represented using a fuzzy measure. We then specialize these valuation functions to the cases of probabilistic and possibilistic uncertainty. 相似文献
92.
O.P. Hasekamp J. Landgraf 《Journal of Quantitative Spectroscopy & Radiative Transfer》2002,75(2):221-238
We present a plane parallel radiative transfer model for polarized light, that provides the intensity vector as well as the derivatives of the four Stokes parameters with respect to atmospheric trace gas profiles. These derivatives are essential for retrieval of height resolved trace gas information from satellite measurements of backscattered sunlight. The model uses the Gauss-Seidel iteration technique for solving the radiative transfer equation. For the first time, the forward-adjoint radiative perturbation theory is applied for the linearization of a radiative transfer model including polarization. The accuracy of the model is better than 0.025% for all four Stokes parameters and better than 0.03% for the derivatives. 相似文献
93.
P. -M. Binder 《Journal of statistical physics》1992,67(3-4):827-832
Average first-passage times for a single-variable stochastic model with a critical fixed point at the origin are computed by exact enumeration. The numerical measurements show excellent agreement with analytical results. The scaling function approaches the predicted asymptotic dependence. 相似文献
94.
Doug Bullock 《Topology and its Applications》1994,60(3):235-248
This paper addresses two problems in the skein theory of homotopy spheres first posed by P. Traczyk. Solutions to both problems are obtained for a large class of manifolds and, since one of the basic techniques used requires the first homology group of the ambient manifold to be torsion free, the extent to which this hypothesis is actually necessary is further explored. 相似文献
95.
96.
矩孔金属光栅矢量模式理论的数值计算 总被引:1,自引:0,他引:1
根据矩孔金属光栅的矢量模式理论,计算了不同入射方向,波长及偏振态情况下衍射场的分布,研究了不同光栅结构对衍射效率,偏振态变化的影响;同时,根据实际需要,加工制作了一批不同深度的矩孔光栅样品,进行了实验测量,并将计算值与实验值进行了比较,两者基本相符。 相似文献
97.
Let G=(V,E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of source-sink pairs of vertices of G, an important problem that arises in the computation of network reliability is the enumeration of minimal subsets of edges (arcs) that connect/disconnect all/at least one of the given source-sink pairs of P. For undirected graphs, we show that the enumeration problems for conjunctions of paths and disjunctions of cuts can be solved in incremental polynomial time. Furthermore, under the assumption that P consists of all pairs within a given vertex set, we also give incremental polynomial time algorithm for enumerating all minimal path disjunctions and cut conjunctions. For directed graphs, the enumeration problem for cut disjunction is known to be NP-complete. We extend this result to path conjunctions and path disjunctions, leaving open the complexity of the enumeration of cut conjunctions. Finally, we give a polynomial delay algorithm for enumerating all minimal sets of arcs connecting two given nodes s1 and s2 to, respectively, a given vertex t1, and each vertex of a given subset of vertices T2. 相似文献
98.
This paper is concerned with the spectral analysis of a one-velocity transport operator with Maxwell boundary condition in
L
1-space. After a detailed spectral analysis it is shown that the associated Cauchy problem is governed by a C
0-semigroup. Next, we discuss the irreducibility of the transport semigroup. In particular, we show that the transport semigroup
is irreducible. Finally, a spectral decomposition of the solutions into an asymptotic term and a transient one which will
be estimated for smooth initial data is given. 相似文献
99.
In contrast to stochastic differential equation models used for the calculation of the term structure of interest rates, we
develop an approach based on linear dynamical systems under non-stochastic uncertainty with perturbations. The uncertainty
is described in terms of known feasible sets of varying parameters. Observations are used in order to estimate these parameters
by minimizing the maximum of the absolute value of measurement errors, which leads to a linear or nonlinear semi-infinite
programming problem. A regularized logarithmic barrier method for solving (ill-posed) convex semi-infinite programming problems
is suggested. In this method a multi-step proximal regularization is coupled with an adaptive discretization strategy in the
framework of an interior point approach. A special deleting rule permits one to use only a part of the constraints of the
discretized problems. Convergence of the method and its stability with respect to data perturbations in the cone of convexC
1-functions are studied. On the basis of the solutions of the semi-infinite programming problems a technical trading system
for future contracts of the German DAX is suggested and developed.
Supported by the Stiftung Rheinland/Pfalz für Innovation, No. 8312-386261/307. 相似文献
100.