全文获取类型
收费全文 | 1102篇 |
免费 | 92篇 |
国内免费 | 93篇 |
专业分类
化学 | 50篇 |
晶体学 | 1篇 |
力学 | 126篇 |
综合类 | 35篇 |
数学 | 921篇 |
物理学 | 154篇 |
出版年
2024年 | 1篇 |
2023年 | 11篇 |
2022年 | 13篇 |
2021年 | 17篇 |
2020年 | 21篇 |
2019年 | 35篇 |
2018年 | 24篇 |
2017年 | 29篇 |
2016年 | 34篇 |
2015年 | 20篇 |
2014年 | 47篇 |
2013年 | 71篇 |
2012年 | 39篇 |
2011年 | 49篇 |
2010年 | 45篇 |
2009年 | 48篇 |
2008年 | 63篇 |
2007年 | 83篇 |
2006年 | 60篇 |
2005年 | 64篇 |
2004年 | 57篇 |
2003年 | 61篇 |
2002年 | 54篇 |
2001年 | 49篇 |
2000年 | 45篇 |
1999年 | 36篇 |
1998年 | 35篇 |
1997年 | 27篇 |
1996年 | 30篇 |
1995年 | 24篇 |
1994年 | 21篇 |
1993年 | 13篇 |
1992年 | 5篇 |
1991年 | 8篇 |
1990年 | 6篇 |
1989年 | 5篇 |
1988年 | 6篇 |
1987年 | 5篇 |
1986年 | 3篇 |
1985年 | 4篇 |
1984年 | 7篇 |
1983年 | 2篇 |
1982年 | 5篇 |
1980年 | 2篇 |
1979年 | 1篇 |
1975年 | 1篇 |
1966年 | 1篇 |
排序方式: 共有1287条查询结果,搜索用时 15 毫秒
1.
2.
Let ir(G) and γ(G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H)=γ(H), for every induced subgraph H of G. In this article we present a result which immediately implies three known conjectures on irredundance perfect graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 292–306, 2002 相似文献
3.
〈I〉型三角剖分下非张量积连续小波基的构造 总被引:1,自引:0,他引:1
多维非张量积小波是近年小波研究领域中的热点问题之一 ,它们与多维张量积小波相比具有更多的优势 .关于高维张量积、非张量积小波 ,目前已有一些很好的工作 (见文[2 ] [3 ] [4 ] ) ,但关于样条小波 ,还有许多问题有待于研究 .本文针对〈I〉型三角剖分下的二维线性元空间 ,讨论其具有紧支集和对称性的半正交样条小波基 .给定 x1 x2 平面上的〈I〉型三角剖分 (图 1 ( a)所示 ) ,记 j=( j1 ,j2 ) ,| j| =j1 + j2 ,πm= { 0≤ |j|≤ mCj1j2 xj11 xj22 ,Cj1,j2 是任意实数 }为次数不超过 m的代数多项式全体 .引入剖分尺度为 1的线性元空间 V0… 相似文献
4.
本文用B-网方法确定了△_(nm)~((2))剖分上二次双周期样条函数空间的维数,给出了插值条件的几种提法,证明了解的存在唯一性. 相似文献
5.
Rakhim Aitbayev 《Numerical Methods for Partial Differential Equations》2006,22(4):847-866
Efficient multilevel preconditioners are developed and analyzed for the quadrature finite element Galerkin approximation of the biharmonic Dirichlet problem. The quadrature scheme is formulated using the Bogner–Fox–Schmit rectangular element and the product two‐point Gaussian quadrature. The proposed additive and multiplicative preconditioners are uniformly spectrally equivalent to the operator of the quadrature scheme. The preconditioners are implemented by optimal algorithms, and they are used to accelerate convergence of the preconditioned conjugate gradient method. Numerical results are presented demonstrating efficiency of the preconditioners. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2006 相似文献
6.
Annegret K. Wagler 《Mathematical Methods of Operations Research》2002,56(1):127-149
An edge e of a perfect graph G is critical if G−e is imperfect. We would like to decide whether G−e is still “almost perfect” or already “very imperfect”. Via relaxations of the stable set polytope of a graph, we define two
superclasses of perfect graphs: rank-perfect and weakly rank-perfect graphs. Membership in those two classes indicates how
far an imperfect graph is away from being perfect. We study the cases, when a critical edge is removed from the line graph
of a bipartite graph or from the complement of such a graph. 相似文献
7.
Xuding Zhu 《Journal of Graph Theory》2005,48(3):186-209
For 1 ≤ d ≤ k, let Kk/d be the graph with vertices 0, 1, …, k ? 1, in which i ~j if d ≤ |i ? j| ≤ k ? d. The circular chromatic number χc(G) of a graph G is the minimum of those k/d for which G admits a homomorphism to Kk/d. The circular clique number ωc(G) of G is the maximum of those k/d for which Kk/d admits a homomorphism to G. A graph G is circular perfect if for every induced subgraph H of G, we have χc(H) = ωc(H). In this paper, we prove that if G is circular perfect then for every vertex x of G, NG[x] is a perfect graph. Conversely, we prove that if for every vertex x of G, NG[x] is a perfect graph and G ? N[x] is a bipartite graph with no induced P5 (the path with five vertices), then G is a circular perfect graph. In a companion paper, we apply the main result of this paper to prove an analog of Haj?os theorem for circular chromatic number for k/d ≥ 3. Namely, we shall design a few graph operations and prove that for any k/d ≥ 3, starting from the graph Kk/d, one can construct all graphs of circular chromatic number at least k/d by repeatedly applying these graph operations. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 186–209, 2005 相似文献
8.
Krzysztof Pawaowski 《K-Theory》1998,13(1):41-55
The paper presents a procedure for constructing smooth actions of finite perfect groups on spheres with fixed point sets having certain prescribed properties (Theorem A); in particular, having any prescribed configuration of Chern and Pontryagin numbers (Corollary C). The main ingredients used are equivariant thickening and equivariant surgery. 相似文献
10.
徐应祥 《宁波大学学报(理工版)》2007,20(2):206-210
应用三次紧支撑样条小波插值函数得到了求一类常微分方程组数值解的隐式公式,并求得到其局部截断误差为O(-h5).在此基础上给出1个显式校正求解公式,并讨论得到其局部截断误差为O(-h4). 相似文献