全文获取类型
收费全文 | 10580篇 |
免费 | 1269篇 |
国内免费 | 728篇 |
专业分类
化学 | 1127篇 |
晶体学 | 14篇 |
力学 | 1185篇 |
综合类 | 315篇 |
数学 | 6902篇 |
物理学 | 3034篇 |
出版年
2024年 | 23篇 |
2023年 | 82篇 |
2022年 | 135篇 |
2021年 | 233篇 |
2020年 | 293篇 |
2019年 | 277篇 |
2018年 | 266篇 |
2017年 | 321篇 |
2016年 | 362篇 |
2015年 | 262篇 |
2014年 | 452篇 |
2013年 | 788篇 |
2012年 | 481篇 |
2011年 | 578篇 |
2010年 | 459篇 |
2009年 | 554篇 |
2008年 | 628篇 |
2007年 | 629篇 |
2006年 | 590篇 |
2005年 | 545篇 |
2004年 | 510篇 |
2003年 | 496篇 |
2002年 | 507篇 |
2001年 | 397篇 |
2000年 | 387篇 |
1999年 | 338篇 |
1998年 | 300篇 |
1997年 | 238篇 |
1996年 | 201篇 |
1995年 | 138篇 |
1994年 | 155篇 |
1993年 | 101篇 |
1992年 | 100篇 |
1991年 | 98篇 |
1990年 | 86篇 |
1989年 | 72篇 |
1988年 | 67篇 |
1987年 | 52篇 |
1986年 | 44篇 |
1985年 | 51篇 |
1984年 | 67篇 |
1983年 | 28篇 |
1982年 | 32篇 |
1981年 | 35篇 |
1980年 | 16篇 |
1979年 | 21篇 |
1978年 | 16篇 |
1977年 | 13篇 |
1976年 | 13篇 |
1973年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
71.
Eckhard Steffen 《Discrete Mathematics》2004,280(1-3):191-214
Cubic bridgeless graphs with chromatic index four are called uncolorable. We introduce parameters measuring the uncolorability of those graphs and relate them to each other. For k=2,3, let ck be the maximum size of a k-colorable subgraph of a cubic graph G=(V,E). We consider r3=|E|−c3 and
. We show that on one side r3 and r2 bound each other, but on the other side that the difference between them can be arbitrarily large. We also compare them to the oddness ω of G, the smallest possible number of odd circuits in a 2-factor of G. We construct cyclically 5-edge connected cubic graphs where r3 and ω are arbitrarily far apart, and show that for each 1c<2 there is a cubic graph such that ωcr3. For k=2,3, let ζk denote the largest fraction of edges that can be k-colored. We give best possible bounds for these parameters, and relate them to each other. 相似文献
72.
Thomas Wanner 《Transactions of the American Mathematical Society》2004,356(6):2251-2279
Many interesting and complicated patterns in the applied sciences are formed through transient pattern formation processes. In this paper we concentrate on the phenomenon of spinodal decomposition in metal alloys as described by the Cahn-Hilliard equation. This model depends on a small parameter, and one is generally interested in establishing sharp lower bounds on the amplitudes of the patterns as the parameter approaches zero. Recent results on spinodal decomposition have produced such lower bounds. Unfortunately, for higher-dimensional base domains these bounds are orders of magnitude smaller than what one would expect from simulations and experiments. The bounds exhibit a dependence on the dimension of the domain, which from a theoretical point of view seemed unavoidable, but which could not be observed in practice.
In this paper we resolve this apparent paradox. By employing probabilistic methods, we can improve the lower bounds for certain domains and remove the dimension dependence. We thereby obtain optimal results which close the gap between analytical methods and numerical observations, and provide more insight into the nature of the decomposition process. We also indicate how our results can be adapted to other situations.
73.
We model the motion of a receptor on the membrane surface of a synapse as free Brownian motion in a planar domain with intermittent trappings in and escapes out of corrals with narrow openings. We compute the mean confinement time of the Brownian particle in the asymptotic limit of a narrow opening and calculate the probability to exit through a given small opening, when the boundary contains more than one. Using this approach, it is possible to describe the Brownian motion of a random particle in an environment containing domains with small openings by a coarse grained diffusion process. We use the results to estimate the confinement time as a function of the parameters and also the time it takes for a diffusing receptor to be anchored at its final destination on the postsynaptic membrane, after it is inserted in the membrane. This approach provides a framework for the theoretical study of receptor trafficking on membranes. This process underlies synaptic plasticity, which relates to learning and memory. In particular, it is believed that the memory state in the brain is stored primarily in the pattern of synaptic weight values, which are controlled by neuronal activity. At a molecular level, the synaptic weight is determined by the number and properties of protein channels (receptors) on the synapse. The synaptic receptors are trafficked in and out of synapses by a diffusion process. Following their synthesis in the endoplasmic reticulum, receptors are trafficked to their postsynaptic sites on dendrites and axons. In this model the receptors are first inserted into the extrasynaptic plasma membrane and then random walk in and out of corrals through narrow openings on their way to their final destination. 相似文献
74.
Ghulam Mustafa 《数学研究及应用》2003,23(3):413-421
本文引入了一种满足更一般的收缩不等式的多重函数类,并证明了属于该类的可测多重函数对的一些随机重合点定理。 相似文献
75.
Some previous works show that symmetric fixed- and variable-stepsize linear multistep methods for second-order systems which do not have any parasitic root in their first characteristic polynomial give rise to a slow error growth with time when integrating reversible systems. In this paper, we give a technique to construct variable-stepsize symmetric methods from their fixed-stepsize counterparts, in such a way that the former have the same order as the latter. The order and symmetry of the integrators obtained is proved independently of the order of the underlying fixed-stepsize integrators. As this technique looks for efficiency, we concentrate on explicit linear multistep methods, which just make one function evaluation per step, and we offer some numerical comparisons with other one-step adaptive methods which also show a good long-term behaviour.
76.
Here we prove a limit theorem in the sense of the weak convergence of probability measures in the space of meromorphic functions
for a general Dirichlet series. The explicit form of the limit measure in this theorem is given.
Partially supported by Lithuanian Foundation of Studies and Science 相似文献
77.
设{Xni:1≤i≤n,n≥1}为行间独立的B值r.v.阵列,g(z)是指数为1/p的正则变化函数,r>0,{ani 1≤t≤n,n≥1}为实数阵列,本文得到了使(?)成立的条件,推广并改进了Stout及Sung等的著名结论. 相似文献
78.
可交换随机变量序列的随机极限定理 总被引:1,自引:0,他引:1
本文讨论了可交换随机变量序列{Xn:n≥1}的极限定理,得到了可交换随机变量序列的随机强大数律及加权和定理,并推广了文[4]中的结果. 相似文献
80.
Donald W. Barnes 《Transactions of the American Mathematical Society》2003,355(7):2755-2769
The concept of a spectral sequence constructor is generalised to Hopf Galois extensions. The spectral sequence constructions that are given by Guichardet for crossed product algebras are also generalised and shown to provide examples. It is shown that all spectral sequence constructors for Hopf Galois extensions construct the same spectral sequence. 相似文献