全文获取类型
收费全文 | 65528篇 |
免费 | 14347篇 |
国内免费 | 5249篇 |
专业分类
化学 | 61348篇 |
晶体学 | 749篇 |
力学 | 2483篇 |
综合类 | 334篇 |
数学 | 5891篇 |
物理学 | 14319篇 |
出版年
2024年 | 58篇 |
2023年 | 644篇 |
2022年 | 967篇 |
2021年 | 1227篇 |
2020年 | 2421篇 |
2019年 | 3605篇 |
2018年 | 2008篇 |
2017年 | 1621篇 |
2016年 | 4675篇 |
2015年 | 4754篇 |
2014年 | 4958篇 |
2013年 | 6175篇 |
2012年 | 5621篇 |
2011年 | 4858篇 |
2010年 | 4731篇 |
2009年 | 4625篇 |
2008年 | 4345篇 |
2007年 | 3530篇 |
2006年 | 3090篇 |
2005年 | 2980篇 |
2004年 | 2569篇 |
2003年 | 2315篇 |
2002年 | 2995篇 |
2001年 | 2213篇 |
2000年 | 1995篇 |
1999年 | 1143篇 |
1998年 | 706篇 |
1997年 | 586篇 |
1996年 | 564篇 |
1995年 | 496篇 |
1994年 | 445篇 |
1993年 | 398篇 |
1992年 | 323篇 |
1991年 | 289篇 |
1990年 | 278篇 |
1989年 | 190篇 |
1988年 | 146篇 |
1987年 | 100篇 |
1986年 | 110篇 |
1985年 | 79篇 |
1984年 | 63篇 |
1983年 | 53篇 |
1982年 | 49篇 |
1981年 | 35篇 |
1980年 | 15篇 |
1979年 | 14篇 |
1978年 | 10篇 |
1974年 | 11篇 |
1973年 | 9篇 |
1957年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
101.
Existence and Uniqueness of Endemic States for the Age-structured MSEIR Epidemic Model 总被引:1,自引:0,他引:1
Geni Gupur 《应用数学学报(英文版)》2002,18(3):441-454
The existence and uniqueness of positive steady states for the age-structured MSEIR epidemic model with age-dependent transmission coefficient is considered. Threshold results for the existence of endemic states are established; under certain conditions, uniqueness is also shown. 相似文献
102.
103.
104.
105.
106.
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 相似文献
107.
It is widely accepted that next-generation networks will provide guaranteed services, in contrast to the “best effort” approach today. We study and analyze queueing policies for network switches that support the QoS (Quality of Service) feature. One realization of the QoS feature is that packets are not necessarily all equal, with some having higher priorities than the others. We model this situation by assigning an intrinsic value to each packet. In this paper we are concerned with three different queueing policies: the nonpreemptive model, the FIFO preemptive model, and the bounded delay model. We concentrate on the situation where the incoming traffic overloads the queue, resulting in packet loss. The objective is to maximize the total value of packets transmitted by the queueing policy. The difficulty lies in the unpredictable nature of the future packet arrivals. We analyze the performance of the online queueing policies via competitive analysis, providing upper and lower bounds for the competitive ratios. We develop practical yet sophisticated online algorithms (queueing policies) for the three queueing models. The algorithms in many cases have provably optimal worst-case bounds. For the nonpreemptive model, we devise an optimal online algorithm for the common 2-value model. We provide a tight logarithmic bound for the general nonpreemptive model. For the FIFO preemptive model, we improve the general lower bound to 1.414, while showing a tight bound of 1.434 for the special case of queue size 2. We prove that the bounded delay model with uniform delay 2 is equivalent to a modified FIFO preemptive model with queue size 2. We then give improved upper and lower bounds on the 2-uniform bounded delay model. We also show an improved lower bound of 1.618 for the 2-variable bounded delay model, matching the previously known upper bound. 相似文献
108.
We study the structure of invertible substitutions on three-letter alphabet. We show that there exists a finite set
of invertible substitutions such that any invertible substitution can be written as Iwσ1σ2σk, where Iw is the inner automorphism associated with w, and
for 1jk. As a consequence, M is the matrix of an invertible substitution if and only if it is a finite product of non-negative elementary matrices. 相似文献
109.
This paper is devoted to a detailed theoretical study of an ion pair SN2 reaction LiNCO+CH3F in the gas phase and in solution at the level of MP2(full)/6-31+G**//HF/6-31+G**. Two possible reaction mechanisms, inversion and retention, are discussed. There are eight possible reaction pathways. The inversion mechanism is more favorable no matter in the gas phase or in solution based on analyses of the transition structures. Methyl isocyanate should form preferentially in the gas phase and more stable methyl cyanate is the main product in solution. The retardation of the reaction in solvents was attributed to the difference in solvation in the separated reactants and in the transition state. 相似文献
110.
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 相似文献