全文获取类型
收费全文 | 100038篇 |
免费 | 4129篇 |
国内免费 | 2957篇 |
专业分类
化学 | 39949篇 |
晶体学 | 1056篇 |
力学 | 8008篇 |
综合类 | 239篇 |
数学 | 34332篇 |
物理学 | 23540篇 |
出版年
2023年 | 491篇 |
2022年 | 527篇 |
2021年 | 725篇 |
2020年 | 974篇 |
2019年 | 888篇 |
2018年 | 10976篇 |
2017年 | 10777篇 |
2016年 | 7008篇 |
2015年 | 1804篇 |
2014年 | 1515篇 |
2013年 | 1912篇 |
2012年 | 5767篇 |
2011年 | 12408篇 |
2010年 | 6956篇 |
2009年 | 7299篇 |
2008年 | 8009篇 |
2007年 | 10029篇 |
2006年 | 1536篇 |
2005年 | 2352篇 |
2004年 | 2357篇 |
2003年 | 2659篇 |
2002年 | 1607篇 |
2001年 | 754篇 |
2000年 | 796篇 |
1999年 | 739篇 |
1998年 | 674篇 |
1997年 | 570篇 |
1996年 | 629篇 |
1995年 | 501篇 |
1994年 | 431篇 |
1993年 | 417篇 |
1992年 | 321篇 |
1991年 | 291篇 |
1990年 | 281篇 |
1989年 | 215篇 |
1988年 | 177篇 |
1987年 | 139篇 |
1986年 | 153篇 |
1985年 | 111篇 |
1984年 | 79篇 |
1983年 | 75篇 |
1982年 | 78篇 |
1981年 | 58篇 |
1980年 | 54篇 |
1979年 | 48篇 |
1914年 | 45篇 |
1913年 | 40篇 |
1912年 | 40篇 |
1909年 | 41篇 |
1908年 | 40篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
101.
In this paper we obtain a number of Maharam-type slice integral representations, with respect to scalar measures, for positive
projections in Dedekind complete vector lattices and f-algebras.
AMS Classification: 47B65, 46A40, 06F25 相似文献
102.
Valery V. Kiselev 《Central European Journal of Physics》2004,2(3):523-534
We calculate the leptonic constant for the pseudoscalar ground state of the B
c
meson in the framework of a QCD-motivated potential model taking into account the two-loop anomalous dimension for the heavy
quark current in nonrelativistic QCD as matched with full QCD. 相似文献
103.
Gaston Casanova 《Advances in Applied Clifford Algebras》2004,14(2):249-252
We define analytic functions within Clifford Algebras CL, and study their trigonometric properties. We write the addition formulas when their arguments, A and B in CL, commute, this generalizes ordinary trigonometry. We examine in particular the case A2 = 1.
相似文献
104.
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. 相似文献
105.
M. Lashkarizadeh Bami 《Semigroup Forum》2004,69(2):219-229
In the present paper it is shown that if S1 and S2 are two
Clifford topological semigroups satisfying certain conditions
and T is an isometric isomorphism of LUC(S1*) onto LUC(S2*), then T
maps S1 topologically isomorphically onto S2. Furthermore, T
maps M
l
n(S1) (M(S1), respectively) isometrically
isomorphically onto M
l
n(S2) (M(S2), respectively). Indeed,
we have obtained a generalization of a well-known result of
Ghahramani, Lau and Losert for locally compact groups to a more
general setting of Clifford topological semigroups. 相似文献
106.
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. 相似文献
107.
Andrew Barton 《The Journal of the Operational Research Society》1987,38(10):965-974
This paper describes some work carried out in the Scientific Research and Development Branch (SRDB) of the Home Office, intended to contribute to an overall aim of building up internal expertise in the field of expert systems. This was done by carrying out a number of pilot and demonstrator projects, two of which are described in some detail. The plan, which proved successful, was to build as far as possible on the relevant skills already possessed by an OR group in the branch. The lessons learned from these are summarized in the hope that they will be of use to other groups who wish to become involved in this important area. 相似文献
108.
Sven Walter 《Acta Analytica》2005,20(3):32-47
Frank Jackson and Philip Pettit have defended a non-reductive account of causal relevance known as the ‘program explanation
account’. Allegedly, irreducible mental properties can be causally relevant in virtue of figuring in non-redundant program explanations which convey information not conveyed by explanations in terms of the physical properties that actually do the ‘causal work’.
I argue that none of the possible ways to spell out the intuitively plausible idea of a program explanation serves its purpose,
viz., defends non-reductive physicalism against Jaegwon Kim’s Causal Exclusion Argument according to which non-reductive physicalism is committed to epiphenomenalism because irreducible mental properties are ‘screened
off’ from causal relevance by their physical realizers. Jackson and Pettit’s most promising explication of a program explanation
appeals to the idea of invariance of effect under variation of realization, but I show that invariance of effect under variation of realization is neither necessary nor sufficient for causal relevance. 相似文献
109.
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 相似文献