全文获取类型
收费全文 | 8333篇 |
免费 | 867篇 |
国内免费 | 522篇 |
专业分类
化学 | 516篇 |
晶体学 | 20篇 |
力学 | 309篇 |
综合类 | 227篇 |
数学 | 7209篇 |
物理学 | 1441篇 |
出版年
2024年 | 18篇 |
2023年 | 126篇 |
2022年 | 271篇 |
2021年 | 227篇 |
2020年 | 273篇 |
2019年 | 296篇 |
2018年 | 295篇 |
2017年 | 327篇 |
2016年 | 248篇 |
2015年 | 192篇 |
2014年 | 358篇 |
2013年 | 639篇 |
2012年 | 317篇 |
2011年 | 460篇 |
2010年 | 450篇 |
2009年 | 613篇 |
2008年 | 580篇 |
2007年 | 459篇 |
2006年 | 470篇 |
2005年 | 397篇 |
2004年 | 326篇 |
2003年 | 299篇 |
2002年 | 274篇 |
2001年 | 263篇 |
2000年 | 234篇 |
1999年 | 212篇 |
1998年 | 184篇 |
1997年 | 150篇 |
1996年 | 105篇 |
1995年 | 100篇 |
1994年 | 84篇 |
1993年 | 59篇 |
1992年 | 46篇 |
1991年 | 44篇 |
1990年 | 32篇 |
1989年 | 32篇 |
1988年 | 35篇 |
1987年 | 24篇 |
1986年 | 17篇 |
1985年 | 31篇 |
1984年 | 37篇 |
1983年 | 9篇 |
1982年 | 20篇 |
1981年 | 14篇 |
1980年 | 14篇 |
1979年 | 16篇 |
1978年 | 12篇 |
1976年 | 8篇 |
1975年 | 8篇 |
1974年 | 8篇 |
排序方式: 共有9722条查询结果,搜索用时 15 毫秒
31.
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.
32.
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 相似文献
33.
Heikki Hyyr 《Journal of Discrete Algorithms》2005,3(2-4):215-229
Using bit-parallelism has resulted in fast and practical algorithms for approximate string matching under Levenshtein edit distance, which permits a single edit operation to insert, delete or substitute a character. Depending on the parameters of the search, currently the fastest non-filtering algorithms in practice are the O(km/wn) algorithm of Wu and Manber, the O((k+2)(m−k)/wn) algorithm of Baeza-Yates and Navarro, and the O(m/wn) algorithm of Myers, where m is the pattern length, n is the text length, k is the error threshold and w is the computer word size. In this paper we discuss a uniform way of modifying each of these algorithms to permit also a fourth type of edit operation: transposing two adjacent characters in the pattern. This type of edit distance is also known as Damerau edit distance. In the end we also present an experimental comparison of the resulting algorithms. 相似文献
34.
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 相似文献
35.
李永祥 《数学物理学报(A辑)》2003,23(2):245-252
该文讨论四阶常微分方程边值问题u^(4)(t)=f(t,u,u″), t∈[0,1],u(0)=u(1)=u″(0)=u″(1)=0解的存在性, 其中f(t,u,v):[0,1]×R×R→R为Carathéodory函数. 在不限制f关于u,v的增长阶, 不假定f关于u,v的单调性的一般情形下, 用上下解方法获得了解的存在性结果,并讨论了单调迭代求解的有效性. 相似文献
36.
基于相对论平均场理论,研究了各种相互作用参数组(NL1、NL3、NLSH、TM1和GL-97)对中子星物质的性质和中子星整体结构的影响.发现参数组NL1、NL3和NLSH所给出的中子星内部的介子场强度、物质的组成比例、物态方程和中子星的整体特点基本相同,但与TM1和GL-97之间有较大的差别.相对于其他参数组,GL-97给出的介子场强度最弱,中子星的相对数密度最大,物态方程也最软,同时采用GL-97参数组计算的中子星的最大质量也最小. 相似文献
37.
分子生物学中基因无方向的反向基因组重排问题在数学上已被证明是一个NP困难问题.基于断点图的概念,给出一个时间复杂性为O(max{b^(π),nb(π)}),空间复杂性为0(n)的求其近似最优解的算法.其中n为基因组中基因个数,π=(π1,π2,…,πn)表示n个基因的一种排列,b(π)表示排列π中的断点数.数据实验的结果表明,该近似算法可以求得较好的结果. 相似文献
38.
39.
40.
This paper derives the optimal trajectories in a general fluid network with server control. The stationary optimal policy in the complete state space is constructed. The optimal policy is constant on polyhedral convex cones. An algorithm is derived that computes these cones and the optimal policy. Generalized Klimov indices are introduced, they are used for characterizing myopic and time-uniformly optimal policies.Received: November 2004 / Revised: February 2005The research of this author has been supported by the project ‘‘Stochastic Networks’’ of the Netherlands Organisation for Scientific Research NWO. 相似文献