全文获取类型
收费全文 | 6998篇 |
免费 | 588篇 |
国内免费 | 701篇 |
专业分类
化学 | 823篇 |
晶体学 | 16篇 |
力学 | 834篇 |
综合类 | 120篇 |
数学 | 5142篇 |
物理学 | 1352篇 |
出版年
2024年 | 15篇 |
2023年 | 91篇 |
2022年 | 181篇 |
2021年 | 154篇 |
2020年 | 214篇 |
2019年 | 205篇 |
2018年 | 190篇 |
2017年 | 227篇 |
2016年 | 224篇 |
2015年 | 162篇 |
2014年 | 284篇 |
2013年 | 532篇 |
2012年 | 321篇 |
2011年 | 402篇 |
2010年 | 340篇 |
2009年 | 492篇 |
2008年 | 488篇 |
2007年 | 461篇 |
2006年 | 438篇 |
2005年 | 395篇 |
2004年 | 283篇 |
2003年 | 293篇 |
2002年 | 250篇 |
2001年 | 207篇 |
2000年 | 229篇 |
1999年 | 196篇 |
1998年 | 212篇 |
1997年 | 160篇 |
1996年 | 126篇 |
1995年 | 75篇 |
1994年 | 68篇 |
1993年 | 47篇 |
1992年 | 50篇 |
1991年 | 36篇 |
1990年 | 29篇 |
1989年 | 30篇 |
1988年 | 28篇 |
1987年 | 22篇 |
1986年 | 17篇 |
1985年 | 13篇 |
1984年 | 22篇 |
1983年 | 8篇 |
1982年 | 12篇 |
1981年 | 12篇 |
1980年 | 10篇 |
1979年 | 9篇 |
1978年 | 10篇 |
1974年 | 3篇 |
1972年 | 3篇 |
1970年 | 2篇 |
排序方式: 共有8287条查询结果,搜索用时 0 毫秒
41.
双环网络是计算机互连网络和通讯系统的一类重要拓扑结构.1993年,李乔等人提出一个系统的构造方法,构造出69类0紧优和33类1紧优双环网络的无限族,并提出研究下述问题:求k(k>1)紧优双环网络的无限族.2003年,徐俊明等人给出一个4紧优双环网络的无限族.本文首先证明从每一个具体的0紧优双环网络出发,都可以构造若干0紧优双环网络无限族;结合同余方程组理论和数论中的素数理论,给出若干求一般k(k≥0)紧优双环网络无限族(包括非单位步长双环网络无限族)的方法. 相似文献
42.
本利用矩阵给出了几类数列的通项公式的求法,把数列通项公式的求法转化为矩阵幂的计算,思路简单、计算简便,并能判别其敛散性。 相似文献
43.
Lingsheng Shi 《Journal of Graph Theory》2005,50(3):175-185
The Ramsey number R(G1,G2) of two graphs G1 and G2 is the least integer p so that either a graph G of order p contains a copy of G1 or its complement Gc contains a copy of G2. In 1973, Burr and Erd?s offered a total of $25 for settling the conjecture that there is a constant c = c(d) so that R(G,G)≤ c|V(G)| for all d‐degenerate graphs G, i.e., the Ramsey numbers grow linearly for d‐degenerate graphs. We show in this paper that the Ramsey numbers grow linearly for degenerate graphs versus some sparser graphs, arrangeable graphs, and crowns for example. This implies that the Ramsey numbers grow linearly for degenerate graphs versus graphs with bounded maximum degree, planar graphs, or graphs without containing any topological minor of a fixed clique, etc. © 2005 Wiley Periodicals, Inc. J Graph Theory 相似文献
44.
A new numerical method called linearized and rational approximation method is presented to solve non‐linear evolution equations. The utility of the method is demonstrated for the case of differentiation of functions involving steep gradients. The solution of Burgers' equation is presented to illustrate the effectiveness of the technique for the solution of non‐linear evolution equations exhibiting nearly discontinuous solutions. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
45.
We present a linear rational pseudospectral (collocation) method with preassigned poles for solving boundary value problems. It consists in attaching poles to the trial polynomial so as to make it a rational interpolant. Its convergence is proved by transforming the problem into an associated boundary value problem. Numerical examples demonstrate that the rational pseudospectral method is often more efficient than the polynomial method. 相似文献
46.
47.
This study investigates the robust output tracking problem for a class of uncertain linear systems. The uncertainties are assumed to be time invariant and to satisfy the matching conditions. According to the selected nominal parameters, an optimal solution with a prescribed degree of stability is determined. Then, an auxiliary input via the use of an adapting factor, connected to the nominal optimal control, is introduced to guarantee the robustness and prescribed degree of stability for the output tracking control of the uncertain linear systems. This method is very simple and effective and can reject bounded uncertainties imposed on the states. A maglev vehicle model example is given to show its effectiveness. 相似文献
48.
Ioan Tomescu 《Journal of Graph Theory》2003,43(3):210-222
In the set of graphs of order n and chromatic number k the following partial order relation is defined. One says that a graph G is less than a graph H if ci(G) ≤ ci(H) holds for every i, k ≤ i ≤ n and at least one inequality is strict, where ci(G) denotes the number of i‐color partitions of G. In this paper the first ? n/2 ? levels of the diagram of the partially ordered set of connected 3‐chromatic graphs of order n are described. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 210–222, 2003 相似文献
49.
50.
Dao-sheng Zheng 《计算数学(英文版)》1998,(2)
1.IntroductionSince1984,severalchinesemathematicianshaveobtailledmanyresultsboutmatrixoperatornormcondition.umbe.[ll'12'18].Twokindsmatrixconditionnllmbers[9]are:(1)IfAECoxsisnonsingular,thellunlberK.(A)~IIAll.llA--'if.iscalledtheor--normconditionnumberof… 相似文献