全文获取类型
收费全文 | 20693篇 |
免费 | 896篇 |
国内免费 | 867篇 |
专业分类
化学 | 4663篇 |
晶体学 | 30篇 |
力学 | 164篇 |
综合类 | 201篇 |
数学 | 10814篇 |
物理学 | 4583篇 |
无线电 | 2001篇 |
出版年
2024年 | 41篇 |
2023年 | 175篇 |
2022年 | 293篇 |
2021年 | 254篇 |
2020年 | 354篇 |
2019年 | 397篇 |
2018年 | 384篇 |
2017年 | 427篇 |
2016年 | 344篇 |
2015年 | 251篇 |
2014年 | 452篇 |
2013年 | 1379篇 |
2012年 | 811篇 |
2011年 | 1021篇 |
2010年 | 897篇 |
2009年 | 3446篇 |
2008年 | 2831篇 |
2007年 | 1386篇 |
2006年 | 1072篇 |
2005年 | 787篇 |
2004年 | 688篇 |
2003年 | 535篇 |
2002年 | 474篇 |
2001年 | 403篇 |
2000年 | 374篇 |
1999年 | 318篇 |
1998年 | 387篇 |
1997年 | 301篇 |
1996年 | 149篇 |
1995年 | 350篇 |
1994年 | 281篇 |
1993年 | 240篇 |
1992年 | 288篇 |
1991年 | 247篇 |
1990年 | 98篇 |
1989年 | 104篇 |
1988年 | 70篇 |
1987年 | 24篇 |
1986年 | 16篇 |
1985年 | 22篇 |
1984年 | 24篇 |
1983年 | 8篇 |
1982年 | 15篇 |
1981年 | 6篇 |
1980年 | 6篇 |
1979年 | 9篇 |
1977年 | 4篇 |
1976年 | 2篇 |
1975年 | 3篇 |
1974年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
11.
Mathematical Notes - 相似文献
12.
Let G=(V(G),E(G)) be a graph. A (n,G, λ)‐GD is a partition of the edges of λKn into subgraphs (G‐blocks), each of which is isomorphic to G. The (n,G,λ)‐GD is named as graph design for G or G‐decomposition. The large set of (n,G,λ)‐GD is denoted by (n,G,λ)‐LGD. In this work, we obtain the existence spectrum of (n,P3,λ)‐LGD. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 151–159, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10008 相似文献
13.
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. 相似文献
14.
We investigate the conjecture that every circulant graph X admits a k‐isofactorization for every k dividing |E(X)|. We obtain partial results with an emphasis on small values of k. © 2006 Wiley Periodicals, Inc. J Combin Designs 14: 406–414, 2006 相似文献
15.
16.
In this note we show how coverings induced by voltage assignments can be used to produce packings of disjoint copies of the Hoffman‐Singleton graph into K50. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 408–412, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10049 相似文献
17.
18.
The semi‐iterative method (SIM) is applied to the hyper‐power (HP) iteration, and necessary and sufficient conditions are given for the convergence of the semi‐iterative–hyper‐power (SIM–HP) iteration. The root convergence rate is computed for both the HP and SIM–HP methods, and the quotient convergence rate is given for the HP iteration. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
19.
Michael T. Jury David W. Kribs 《Proceedings of the American Mathematical Society》2005,133(1):213-222
Given a row contraction of operators on a Hilbert space and a family of projections on the space that stabilizes the operators, we show there is a unique minimal joint dilation to a row contraction of partial isometries that satisfy natural relations. For a fixed row contraction the set of all dilations forms a partially ordered set with a largest and smallest element. A key technical device in our analysis is a connection with directed graphs. We use a Wold decomposition for partial isometries to describe the models for these dilations, and we discuss how the basic properties of a dilation depend on the row contraction.
20.
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 相似文献