全文获取类型
收费全文 | 2783篇 |
免费 | 225篇 |
国内免费 | 212篇 |
专业分类
化学 | 479篇 |
晶体学 | 2篇 |
力学 | 357篇 |
综合类 | 29篇 |
数学 | 1859篇 |
物理学 | 494篇 |
出版年
2024年 | 4篇 |
2023年 | 29篇 |
2022年 | 49篇 |
2021年 | 44篇 |
2020年 | 70篇 |
2019年 | 75篇 |
2018年 | 74篇 |
2017年 | 90篇 |
2016年 | 68篇 |
2015年 | 74篇 |
2014年 | 101篇 |
2013年 | 333篇 |
2012年 | 74篇 |
2011年 | 149篇 |
2010年 | 132篇 |
2009年 | 146篇 |
2008年 | 177篇 |
2007年 | 152篇 |
2006年 | 155篇 |
2005年 | 145篇 |
2004年 | 119篇 |
2003年 | 124篇 |
2002年 | 111篇 |
2001年 | 88篇 |
2000年 | 90篇 |
1999年 | 85篇 |
1998年 | 67篇 |
1997年 | 64篇 |
1996年 | 50篇 |
1995年 | 33篇 |
1994年 | 41篇 |
1993年 | 21篇 |
1992年 | 29篇 |
1991年 | 21篇 |
1990年 | 16篇 |
1989年 | 11篇 |
1988年 | 15篇 |
1987年 | 6篇 |
1986年 | 7篇 |
1985年 | 16篇 |
1984年 | 12篇 |
1983年 | 4篇 |
1982年 | 8篇 |
1981年 | 5篇 |
1980年 | 8篇 |
1979年 | 11篇 |
1978年 | 5篇 |
1977年 | 4篇 |
1976年 | 5篇 |
1974年 | 2篇 |
排序方式: 共有3220条查询结果,搜索用时 15 毫秒
41.
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. 相似文献
42.
An analogy between social and hydrodynamic processes is developed. The relation of the state system to the passionarity theory suggested by L. N. Gumilev is discussed. 相似文献
43.
Albert Cohen Sidi Mahmoud Kaber Siegfried Mü ller Marie Postel. 《Mathematics of Computation》2003,72(241):183-225
The use of multiresolution decompositions in the context of finite volume schemes for conservation laws was first proposed by A. Harten for the purpose of accelerating the evaluation of numerical fluxes through an adaptive computation. In this approach the solution is still represented at each time step on the finest grid, resulting in an inherent limitation of the potential gain in memory space and computational time. The present paper is concerned with the development and the numerical analysis of fully adaptive multiresolution schemes, in which the solution is represented and computed in a dynamically evolved adaptive grid. A crucial problem is then the accurate computation of the flux without the full knowledge of fine grid cell averages. Several solutions to this problem are proposed, analyzed, and compared in terms of accuracy and complexity.
44.
Siaw-Lynn Ng 《Designs, Codes and Cryptography》2003,30(1):5-19
Deciding whether a matroid is secret sharing or not is a well-known open problem. In Ng and Walker [6] it was shown that a matroid decomposes into uniform matroids under strong connectivity. The question then becomes as follows: when is a matroid m with N uniform components secret sharing? When N = 1, m corresponds to a uniform matroid and hence is secret sharing. In this paper we show, by constructing a representation using projective geometry, that all connected matroids with two uniform components are secret sharing 相似文献
45.
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width 总被引:2,自引:0,他引:2
Gruia C
linescu Cristina G. Fernandes Bruce Reed 《Journal of Algorithms in Cognition, Informatics and Logic》2003,48(2):333-359
The Multicut problem can be defined as: given a graph G and a collection of pairs of distinct vertices {si,ti} of G, find a minimum set of edges of G whose removal disconnects each si from the corresponding ti. Multicut is known to be NP-hard and Max SNP-hard even when the input graph is restricted to being a tree. The main result of the paper is a polynomial-time approximation scheme (PTAS) for Multicut in unweighted graphs with bounded degree and bounded tree-width. That is, for any ε>0, we present a polynomial-time (1+ε)-approximation algorithm. In the particular case when the input is a bounded-degree tree, we have a linear-time implementation of the algorithm. We also provide some hardness results: we prove that Multicut is still NP-hard for binary trees and that it is Max SNP-hard if we drop any of the three conditions (unweighted, bounded-degree, bounded tree-width). Finally we show that some of these results extend to the vertex version of Multicut and to a directed version of Multicut. 相似文献
46.
Andrzej Skowronski Kunio Yamagata 《Proceedings of the American Mathematical Society》2004,132(3):659-667
We prove that a large class of self-injective algebras of tilted type is invariant under stable equivalences of module categories.
47.
Zhi Shui HU Chun SU 《数学学报(英文版)》2007,23(7):265-1270
Let {X(t), t ≥ 0} be a Lévy process with EX(1) = 0 and EX^2(1) 〈 ∞. In this paper, we shall give two precise asymptotic theorems for {X(t), t 〉 0}. By the way, we prove the corresponding conclusions for strictly stable processes and a general precise asymptotic proposition for sums of i.i.d. random variables. 相似文献
48.
二阶Melnikov函数及其应用 总被引:2,自引:0,他引:2
在Melnikov函数的种种应用中,目前常见到的仅是一阶形式。本文具体推导了二阶Melnikov函数的分析表达,提出了临界情况下考察双曲鞍点的稳定流形与不稳定流形相对位置的二阶判据,并成功地用于环面vanderPol方程的研究中。 相似文献
49.
50.
本文把文[1]、[2]的变换技巧推广到变系数线性系统(i=1,…,n),用函数方法,研究了n=2、3时零解的稳定性,得到了零解稳定的若干判据.有关系数a_(ij)(t)不必都限制为有界. 相似文献