全文获取类型
收费全文 | 4003篇 |
免费 | 215篇 |
国内免费 | 139篇 |
专业分类
化学 | 87篇 |
晶体学 | 1篇 |
力学 | 12篇 |
综合类 | 33篇 |
数学 | 4021篇 |
物理学 | 203篇 |
出版年
2024年 | 14篇 |
2023年 | 62篇 |
2022年 | 88篇 |
2021年 | 74篇 |
2020年 | 119篇 |
2019年 | 116篇 |
2018年 | 126篇 |
2017年 | 115篇 |
2016年 | 82篇 |
2015年 | 69篇 |
2014年 | 140篇 |
2013年 | 302篇 |
2012年 | 174篇 |
2011年 | 199篇 |
2010年 | 199篇 |
2009年 | 363篇 |
2008年 | 344篇 |
2007年 | 250篇 |
2006年 | 236篇 |
2005年 | 156篇 |
2004年 | 134篇 |
2003年 | 126篇 |
2002年 | 108篇 |
2001年 | 98篇 |
2000年 | 81篇 |
1999年 | 86篇 |
1998年 | 76篇 |
1997年 | 71篇 |
1996年 | 50篇 |
1995年 | 33篇 |
1994年 | 32篇 |
1993年 | 27篇 |
1992年 | 24篇 |
1991年 | 19篇 |
1990年 | 19篇 |
1989年 | 15篇 |
1988年 | 14篇 |
1987年 | 4篇 |
1986年 | 7篇 |
1985年 | 22篇 |
1984年 | 16篇 |
1983年 | 10篇 |
1982年 | 14篇 |
1981年 | 8篇 |
1980年 | 15篇 |
1979年 | 4篇 |
1978年 | 9篇 |
1977年 | 4篇 |
1970年 | 1篇 |
1969年 | 1篇 |
排序方式: 共有4357条查询结果,搜索用时 109 毫秒
11.
T-型树谱唯一性的一个简单刻画 总被引:1,自引:0,他引:1
图G称为谱唯一的,如果任何与G谱相同的图一定与G同构.一棵树称为T-型树如果其仅有一个最大度为3的顶点.本文给出了T-型树谱唯一性的一个简单刻画,从而完全解决了T-型树的谱唯一性问题. 相似文献
12.
Signed graphs for portfolio analysis in risk management 总被引:1,自引:0,他引:1
Harary Frank; Lim Meng-Hiot; Wunsch Donald C. 《IMA Journal of Management Mathematics》2002,13(3):201-210
We introduce the notion of structural balance for signed graphsin the context of portfolio analysis. A portfolio of securitiescan be represented as a signed graph with the nodes denotingthe securities and the edges representing the correlation betweenthe securities. With signed graphs, the characteristics of aportfolio from a risk management perspective can be uncoveredfor analysis purposes. It is shown that a portfolio characterizedby a signed graph of positive and negative edges that is structurallybalanced is characteristically more predictable. Investors whoundertake a portfolio position with all positively correlatedsecurities do so with the intention to speculate on the upside(or downside). If the portfolio consists of negative edges andis balanced, then it is likely that the position has a hedgingdisposition within it. On the other hand, an unbalanced signedgraph is representative of an investment portfolio which ischaracteristically unpredictable. 相似文献
13.
On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes 总被引:1,自引:0,他引:1
It is well known that the complexity, i.e. the number of vertices, edges and faces, of the 3-dimensional Voronoi diagram of n points can be as bad as Θ(n2). It is also known that if the points are chosen Independently Identically Distributed uniformly from a 3-dimensional region such as a cube or sphere, then the expected complexity falls to O(n). In this paper we introduce the problem of analyzing what occurs if the points are chosen from a 2-dimensional region in 3-dimensional space. As an example, we examine the situation when the points are drawn from a Poisson distribution with rate n on the surface of a convex polytope. We prove that, in this case, the expected complexity of the resulting Voronoi diagram is O(n). 相似文献
14.
A graph G is N2‐locally connected if for every vertex ν in G, the edges not incident with ν but having at least one end adjacent to ν in G induce a connected graph. In 1990, Ryjá?ek conjectured that every 3‐connected N2‐locally connected claw‐free graph is Hamiltonian. This conjecture is proved in this note. © 2004 Wiley Periodicals, Inc. J Graph Theory 48: 142–146, 2005 相似文献
15.
Francis K. Bell 《Journal of Graph Theory》2003,43(2):137-149
It is shown that, if t is an integer ≥3 and not equal to 7 or 8, then there is a unique maximal graph having the path Pt as a star complement for the eigenvalue ?2. The maximal graph is the line graph of Km,m if t = 2m?1, and of Km,m+1 if t = 2m. This result yields a characterization of L(G ) when G is a (t + 1)‐vertex bipartite graph with a Hamiltonian path. The graphs with star complement Pr ∪ Ps or Pr ∪ Cs for ?2 are also determined. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 137–149, 2003 相似文献
16.
A locally convex space is said to be a Gateaux differentiability space (GDS)provided every continuous convex function defined on a nonempty convex open subset D of the space is densely Gateaux differentiable in D.This paper shows that the product of a GDS and a family of separable Frechet spaces is a GDS,and that the product of a GDS and an arbitrary locally convex space endowed with the weak topology is a GDS. 相似文献
17.
A signed graph has a plus or minus sign on each edge. A simple cycle is positive or negative depending on whether it contains an even or odd number of negative edges, respectively. We consider embeddings of a signed graph in the projective plane for which a simple cycle is essential if and only if it is negative. We characterize those signed graphs that have such a projective-planar embedding. Our characterization is in terms of a related signed graph formed by considering the theta subgraphs in the given graph. 相似文献
18.
关于Banach空间中凸泛函的广义次梯度不等式 总被引:2,自引:0,他引:2
本文在前人^[1,2]的基础之上,以凸泛函的次梯度不等式为工具,将Jensen不等式推广到Banach空间中的凸泛函,导出了Banach空间中的Bochner积分型的广义Jensen不等式,给出其在Banach空间概率论中某些应用,从而推广了文献[3—6]的工作. 相似文献
19.
In the present paper we give necessary and sufficient conditions for the subgroup separability of the fundamental group of a finite graph of groups with finitely generated abelian vertex groups.
20.
Lahcne Mezrag 《Mathematische Nachrichten》2004,266(1):60-67
In [5], it is proved that a bounded linear operator u, from a Banach space Y into an Lp(S, ν) factors through Lp1 (S, ν) for some p1 > 1, if Y* is of finite cotype; (S, ν) is a probability space for p = 0, and any measure space for 0 < p < 1. In this paper, we generalize this result to uv, where u : Y → Lp(S, ν) and v : X → Y are linear operators such that v* is of finite Ka?in cotype. This result gives also a new proof of Grothendieck's theorem. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献