全文获取类型
收费全文 | 14660篇 |
免费 | 1548篇 |
国内免费 | 973篇 |
专业分类
化学 | 2362篇 |
晶体学 | 36篇 |
力学 | 1516篇 |
综合类 | 291篇 |
数学 | 9176篇 |
物理学 | 3800篇 |
出版年
2024年 | 23篇 |
2023年 | 137篇 |
2022年 | 192篇 |
2021年 | 277篇 |
2020年 | 394篇 |
2019年 | 397篇 |
2018年 | 367篇 |
2017年 | 442篇 |
2016年 | 549篇 |
2015年 | 362篇 |
2014年 | 699篇 |
2013年 | 1458篇 |
2012年 | 648篇 |
2011年 | 864篇 |
2010年 | 772篇 |
2009年 | 864篇 |
2008年 | 882篇 |
2007年 | 965篇 |
2006年 | 813篇 |
2005年 | 752篇 |
2004年 | 658篇 |
2003年 | 652篇 |
2002年 | 573篇 |
2001年 | 479篇 |
2000年 | 460篇 |
1999年 | 397篇 |
1998年 | 352篇 |
1997年 | 266篇 |
1996年 | 260篇 |
1995年 | 189篇 |
1994年 | 156篇 |
1993年 | 126篇 |
1992年 | 125篇 |
1991年 | 127篇 |
1990年 | 62篇 |
1989年 | 57篇 |
1988年 | 43篇 |
1987年 | 37篇 |
1986年 | 38篇 |
1985年 | 46篇 |
1984年 | 40篇 |
1983年 | 22篇 |
1982年 | 25篇 |
1981年 | 30篇 |
1980年 | 16篇 |
1979年 | 20篇 |
1978年 | 16篇 |
1977年 | 18篇 |
1976年 | 10篇 |
1974年 | 8篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
71.
运输网络中最小饱和流的求解 总被引:4,自引:0,他引:4
运输网络中常常由于流量的不可控易发生堵塞现象.网络发生堵塞时的饱和流值达不到最大流值.最小饱和流是运输网络,尤其是紧急疏散网络设计中很重要的一个参数.通过建立网络的割集矩阵来确定网络的堵塞截面,基于此提出了求解最小饱和流的线性规划模型及算法.举例分析表明,利用该算法计算网络最小饱和流更加简便、更加实用. 相似文献
72.
External difference families (EDFs) are a type of new combinatorial designs originated from cryptography. In this paper, some
earlier ideas of recursive and cyclotomic constructions of combinatorial designs are extended, and a number of classes of
EDFs and disjoint difference families are presented. A link between a subclass of EDFs and a special type of (almost) difference
sets is set up. 相似文献
73.
本文针对一类非饱和土壤水流问题,提出了基于二次插值的特征差分格式,得到了严谨的L2模误差估计.并作了数值试验,指明方法的有效性. 相似文献
74.
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. 相似文献
75.
王筑娟 《数学的实践与认识》2006,36(11):217-222
讨论Dx广义正定阵的问题,给出了Dx广义正定阵的一些等价性的刻划,同时还讨论了Dx广义正定阵的若干性质. 相似文献
76.
Let G be a graph and let Pm(G) denote the number of perfect matchings of G.We denote the path with m vertices by Pm and the Cartesian product of graphs G and H by G×H. In this paper, as the continuance of our paper [W. Yan, F. Zhang, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, Adv. Appl. Math. 32 (2004) 175-188], we enumerate perfect matchings in a type of Cartesian products of graphs by the Pfaffian method, which was discovered by Kasteleyn. Here are some of our results:1. Let T be a tree and let Cn denote the cycle with n vertices. Then Pm(C4×T)=∏(2+α2), where the product ranges over all eigenvalues α of T. Moreover, we prove that Pm(C4×T) is always a square or double a square.2. Let T be a tree. Then Pm(P4×T)=∏(1+3α2+α4), where the product ranges over all non-negative eigenvalues α of T.3. Let T be a tree with a perfect matching. Then Pm(P3×T)=∏(2+α2), where the product ranges over all positive eigenvalues α of T. Moreover, we prove that Pm(C4×T)=[Pm(P3×T)]2. 相似文献
77.
High even order generalizations of the traditional upwind method are introduced to solve second order ODE-BVPs without recasting
the problem as a first order system. Both theoretical analysis and numerical comparison with central difference schemes of
the same order show that these new methods may avoid typical oscillations and achieve high accuracy. Singular perturbation
problems are taken into account to emphasize the main features of the proposed methods.
AMS subject classification (2000) 65L10, 65L12, 65L50 相似文献
78.
R. Thomas conjectured, 20 years ago, that the presence of a positive circuit in the interaction graph of a dynamical system is a necessary condition for the presence of several stable states. Recently, E. Remy et al. stated and proved the conjecture for Boolean dynamical systems. Using a similar approach, we generalize the result to discrete dynamical systems, and by focusing on the asynchronous dynamics that R. Thomas used in the course of his analysis of genetic networks, we obtain a more general variant of R. Thomas’ conjecture. In this way, we get a necessary condition for genetic networks to lead to differentiation. 相似文献
79.
关于矩阵和算子迹的一组不等式 总被引:1,自引:1,他引:0
周其生 《数学的实践与认识》2006,36(3):252-256
给出关于半正定矩阵迹和正算子迹的一组不等式,得到与邱贤忠关于实数的不等式的类似结果. 相似文献
80.
We construct a new family of cyclic difference sets with parameters ((3
d
– 1)/2, (3
d – 1 – 1)/2, (3
d – 2 – 1)/2) for each odd d. The difference sets are constructed with certain maps that form Jacobi sums. These new difference sets are similar to Maschietti's hyperoval difference sets, of the Segre type, in characteristic two. We conclude by calculating the 3-ranks of the new difference sets. 相似文献