全文获取类型
收费全文 | 7014篇 |
免费 | 547篇 |
国内免费 | 750篇 |
专业分类
化学 | 436篇 |
晶体学 | 5篇 |
力学 | 453篇 |
综合类 | 140篇 |
数学 | 6388篇 |
物理学 | 889篇 |
出版年
2024年 | 8篇 |
2023年 | 79篇 |
2022年 | 99篇 |
2021年 | 120篇 |
2020年 | 144篇 |
2019年 | 157篇 |
2018年 | 177篇 |
2017年 | 182篇 |
2016年 | 185篇 |
2015年 | 148篇 |
2014年 | 278篇 |
2013年 | 511篇 |
2012年 | 260篇 |
2011年 | 375篇 |
2010年 | 327篇 |
2009年 | 456篇 |
2008年 | 498篇 |
2007年 | 436篇 |
2006年 | 450篇 |
2005年 | 355篇 |
2004年 | 324篇 |
2003年 | 382篇 |
2002年 | 335篇 |
2001年 | 293篇 |
2000年 | 260篇 |
1999年 | 244篇 |
1998年 | 236篇 |
1997年 | 216篇 |
1996年 | 133篇 |
1995年 | 95篇 |
1994年 | 81篇 |
1993年 | 67篇 |
1992年 | 48篇 |
1991年 | 44篇 |
1990年 | 29篇 |
1989年 | 19篇 |
1988年 | 24篇 |
1987年 | 20篇 |
1986年 | 19篇 |
1985年 | 31篇 |
1984年 | 28篇 |
1983年 | 16篇 |
1982年 | 26篇 |
1981年 | 22篇 |
1980年 | 24篇 |
1979年 | 11篇 |
1978年 | 12篇 |
1977年 | 8篇 |
1976年 | 7篇 |
1974年 | 6篇 |
排序方式: 共有8311条查询结果,搜索用时 0 毫秒
61.
模糊集的分解集定理有两种形式,第一种形式与模糊集的λ—截集有关:A=其中A_λ是的λ—截集 ̄[1].第二种形式与集合套有关:其中H(λ)为集合套 ̄[2]或者A=其中H(λ)为集合套,Q为(0,1)的可列稠密子集_[3],.其实,这两种形式在本文提出的基本模糊集的概念下,可以统一起来成为任何模糊集可以分解为一些(可数或不可数)基本模糊集的和。不仅如此,本文还提出简单模糊集的概念,并证明了任何模糊集都可以表示成为可数个单调上升的简单模糊集的和,或等价地,可以表示成可数个单调上升的简单模糊集的极限,所用的证明方法是构造性的,所以对模糊集的结构也得出了一个清晰的认识. 相似文献
62.
63.
Alain Lascoux 《Bulletin des Sciences Mathématiques》2006,130(4):354-359
Eliminating the arbitrary coefficients in the equation of a generic plane curve of order n by computing sufficiently many derivatives, one obtains a differential equation. This is a projective invariant. The first one, corresponding to conics, has been obtained by Monge. Sylvester, Halphen, Cartan used invariants of higher order. The expression of these invariants is rather complicated, but becomes much simpler when interpreted in terms of symmetric functions. 相似文献
64.
We introduce an interesting hierarchy of rational order chaotic maps that possess an invariant measure. In contrast to the
previously introduced hierarchy of chaotic maps [1–5], with merely entropy production, the rational order chaotic maps can
simultaneously produce and consume entropy. We compute the Kolmogorov-Sinai entropy of these maps analytically and also their
Lyapunov exponent numerically, where the obtained numerical results support the analytical calculations. 相似文献
65.
凸集的广义Reuleaux三角形 总被引:1,自引:1,他引:0
常宽凸集的面积最小者为Reulaux三角形,而非常宽凸集的面积最小者为何呢?它就是本文将给出的广义Reuleaux三角形△R。 相似文献
66.
In this paper, we give a construction of RDS in Galois ring by using some bent function, and obtain the equivalent relationship between RDS and a kind of bent function. At the same time, its existence is demonstrated. 相似文献
67.
In this paper,we research general Defective Cion Problem under the model S,i.e,the number d of Defective cions is not fixed. For d=O,1,or 2. we get some good results. 相似文献
68.
The measure of uncertainty is adopted as a measure of information. The measures of fuzziness are known as fuzzy information measures. The measure of a quantity of fuzzy information gained from a fuzzy set or fuzzy system is known as fuzzy entropy. Fuzzy entropy has been focused and studied by many researchers in various fields. In this paper, firstly, the axiomatic definition of fuzzy entropy is discussed. Then, neural networks model of fuzzy entropy is proposed, based on the computing capability of neural networks. In the end, two examples are discussed to show the efficiency of the model. 相似文献
69.
We consider two problems: given a collection of n fat objects in a fixed dimension, (1) ( packing) find the maximum subcollection of pairwise disjoint objects, and (2) ( piercing) find the minimum point set that intersects every object. Recently, Erlebach, Jansen, and Seidel gave a polynomial-time approximation scheme (PTAS) for the packing problem, based on a shifted hierarchical subdivision method. Using shifted quadtrees, we describe a similar algorithm for packing but with a smaller time bound. Erlebach et al.'s algorithm requires polynomial space. We describe a different algorithm, based on geometric separators, that requires only linear space. This algorithm can also be applied to piercing, yielding the first PTAS for that problem. 相似文献
70.
A new co‐ordinate invariant streamwise upwind formulation for convection dominated flows is developed. The eddy diffusivity/viscosity is added directly to the equations in order to remove the oscillations in the solution. The equations then can be solved by any high‐order scheme and the solution retains the accuracy of the high‐order scheme. The accuracy and reduced lateral thickness growth rate are demonstrated with several numerical examples, including pure convective flows and lid‐driven cavity flow. The lateral spreading due to the numerical diffusion is controlled by the anisotropic tensor. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献