全文获取类型
收费全文 | 1905篇 |
免费 | 134篇 |
国内免费 | 132篇 |
专业分类
化学 | 289篇 |
晶体学 | 12篇 |
力学 | 120篇 |
综合类 | 24篇 |
数学 | 1336篇 |
物理学 | 390篇 |
出版年
2024年 | 3篇 |
2023年 | 32篇 |
2022年 | 29篇 |
2021年 | 45篇 |
2020年 | 47篇 |
2019年 | 64篇 |
2018年 | 53篇 |
2017年 | 37篇 |
2016年 | 39篇 |
2015年 | 41篇 |
2014年 | 94篇 |
2013年 | 198篇 |
2012年 | 82篇 |
2011年 | 113篇 |
2010年 | 111篇 |
2009年 | 152篇 |
2008年 | 140篇 |
2007年 | 131篇 |
2006年 | 87篇 |
2005年 | 81篇 |
2004年 | 78篇 |
2003年 | 69篇 |
2002年 | 55篇 |
2001年 | 40篇 |
2000年 | 44篇 |
1999年 | 48篇 |
1998年 | 52篇 |
1997年 | 35篇 |
1996年 | 33篇 |
1995年 | 25篇 |
1994年 | 14篇 |
1993年 | 14篇 |
1992年 | 7篇 |
1991年 | 14篇 |
1990年 | 8篇 |
1989年 | 4篇 |
1988年 | 5篇 |
1987年 | 5篇 |
1986年 | 3篇 |
1985年 | 9篇 |
1984年 | 7篇 |
1983年 | 3篇 |
1982年 | 5篇 |
1981年 | 4篇 |
1980年 | 2篇 |
1979年 | 1篇 |
1978年 | 3篇 |
1977年 | 2篇 |
1974年 | 1篇 |
1973年 | 2篇 |
排序方式: 共有2171条查询结果,搜索用时 22 毫秒
11.
Yan Zhibin 《东北数学》1998,(2)
SomeNotesaboutTanaka'sEquationYanZhibin(严质彬)(DepartmentofMathematics,HarbinInstituteofTechnology,Harbin,150001)AbstractLet{Wt... 相似文献
12.
13.
A generalization of strong regularity around a vertex subset C of a graph Γ, which makes sense even if Γis non-regular, is studied. Such a structure appears, together with a kind of distance-regularity around C , when an spectral bound concerning the so-called predistance polynomial of C is attained. As a main consequence of these results, it is shown that a regular (connected) graph Γwith d + 1 distinct eigenvalues is distance-regular, and its distance- d graph Γ d is strongly regular with parameters a = c , if and only if the number of vertices at distance d from each vertex satisfies an expression which depends only on the order of Γand the different eigenvalues of Γ. 相似文献
14.
A new method for constructing infinite families of k-tight optimal double loop networks 总被引:2,自引:0,他引:2
CHEN Xiebin Department of Mathematics Information Science Zhangzhou Teachers College Zhangzhou China 《中国科学A辑(英文版)》2006,49(4)
The double loop network (DLN) is a circulant digraph with n nodes and outdegree 2. DLN has been widely used in the designing of local area networks and distributed systems. In this paper, a new method for constructing infinite families of k-tight optimal DLN is presented. For k = 0,1,…,40, the infinite families of k-tight optimal DLN can be constructed by the new method, where the number nk(t,a) of their nodes is a polynomial of degree 2 in t and contains a parameter a. And a conjecture is proposed. 相似文献
15.
Nikolaos S. PAPAGEORGIOU Nikolaos YANNAKAKIS 《数学学报(英文版)》2005,21(5):977-996
This is the first part of a work on second order nonlinear, nonmonotone evolution inclusions defined in the framework of an evolution triple of spaces and with a multivalued nonlinearity depending on both x(t) and x(t). In this first part we prove existence and relaxation theorems. We consider the case of an usc, convex valued nonlinearity and we show that for this problem the solution set is nonempty and compact in C^1 (T, H). Also we examine the Isc, nonconvex case and again we prove the existence of solutions. In addition we establish the existence of extremal solutions and by strengthening our hypotheses, we show that the extremal solutions are dense in C^1 (T, H) to the solutions of the original convex problem (strong relaxation). An example of a nonlinear hyperbolic optimal control problem is also discussed. 相似文献
16.
林诒勋 《高校应用数学学报(英文版)》2003,18(3):361-369
§ 1 IntroductionThe cutwidth problem for graphs,as well as a class of optimal labeling and embed-ding problems,have significant applications in VLSI designs,network communicationsand other areas (see [2 ] ) .We shall follow the graph-theoretic terminology and notation of [1 ] .Let G=(V,E)be a simple graph with vertex set V,| V| =n,and edge set E.A labeling of G is a bijec-tion f:V→ { 1 ,2 ,...,n} ,which can by regarded as an embedding of G into a path Pn.Fora given labeling f of G,th… 相似文献
17.
Guang-hua DONG~ Yan-pei LIU Department of Mathematics School of Science Beijing Jiaotong University Beijing China 《中国科学A辑(英文版)》2007,50(11):1563-1570
In this paper,we provide a new class of up-embeddable graphs,and obtain a tight lower bound on the maximum genus of a class of 2-connected pseudographs of diameter 2 and of a class of diameter 4 multi-graphs.This extends a result of Skoviera. 相似文献
18.
对数似然比与整值随机变量序列的一类强律 总被引:2,自引:0,他引:2
本文引进对数似然比作为整值随机变量序列相对于服从几何分布的独立随机变量序列的偏差的一种度量,并通过限制对数似然比给出了样本空间的一个子集.在此子集上得到了一类用不等式表示的强律,其中包含整值随机变量序列与相对熵密度及几何分布的熵函数有关的若干极限性质. 相似文献
19.
侯旻 《新疆大学学报(理工版)》1991,(1)
本文比较了循环图类{c_p(n_1,…,n_p)}和{c-p(n_1…,n_p,p/α)}的直径下界。对于p和α满足一定条件的循环图类{c_p(n_1,n_2,p/α)},本文给出了达到或几乎达到此图类直径下界的一类几乎最优循环图{c_p(m,m+1,p/α)}。 相似文献
20.
In this paper we prove three conjectures of Revers on Lagrange interpolation for fλ(t)=|t|λ,λ>0, at equidistant nodes. In particular, we describe the rate of divergence of the Lagrange interpolants LN( fλ,t) for 0<|t|<1, and discuss their convergence at t=0. We also establish an asymptotic relation for max|t|1| |t|λ−LN( fλ,t)|. The proofs are based on strong asymptotics for |t|λ−LN( fλ,t), 0|t|<1. 相似文献