全文获取类型
收费全文 | 18412篇 |
免费 | 384篇 |
国内免费 | 161篇 |
专业分类
化学 | 1341篇 |
晶体学 | 64篇 |
力学 | 153篇 |
综合类 | 18篇 |
数学 | 16219篇 |
物理学 | 1162篇 |
出版年
2023年 | 42篇 |
2022年 | 71篇 |
2021年 | 63篇 |
2020年 | 89篇 |
2019年 | 365篇 |
2018年 | 394篇 |
2017年 | 203篇 |
2016年 | 180篇 |
2015年 | 221篇 |
2014年 | 442篇 |
2013年 | 1036篇 |
2012年 | 518篇 |
2011年 | 1115篇 |
2010年 | 915篇 |
2009年 | 1123篇 |
2008年 | 1312篇 |
2007年 | 1349篇 |
2006年 | 957篇 |
2005年 | 672篇 |
2004年 | 549篇 |
2003年 | 481篇 |
2002年 | 393篇 |
2001年 | 319篇 |
2000年 | 320篇 |
1999年 | 463篇 |
1998年 | 436篇 |
1997年 | 349篇 |
1996年 | 425篇 |
1995年 | 454篇 |
1994年 | 405篇 |
1993年 | 380篇 |
1992年 | 357篇 |
1991年 | 248篇 |
1990年 | 220篇 |
1989年 | 255篇 |
1988年 | 149篇 |
1987年 | 151篇 |
1986年 | 149篇 |
1985年 | 216篇 |
1984年 | 201篇 |
1983年 | 116篇 |
1982年 | 183篇 |
1981年 | 164篇 |
1980年 | 106篇 |
1979年 | 82篇 |
1978年 | 114篇 |
1977年 | 74篇 |
1976年 | 59篇 |
1975年 | 25篇 |
1974年 | 20篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
2.
M. Brokate D. Rachinskii 《NoDEA : Nonlinear Differential Equations and Applications》2006,13(4):385-411
The paper is concerned with the study of plasticity models described by differential equations with stop and play operators.
We suggest sufficient conditions for the global stability of a unique periodic solution for the scalar models and for the
vector models with biaxial inputs of a particular form, namely the sum of a uniaxial function and a constant term. For another
class of simple biaxial inputs, we present an example of the existence of unstable periodic solutions.
The paper was written during the research stay of D. Rachinskii at the Technical University Munich supported by the research
fellowship from the Alexander von Humboldt Foundation. His work was partially supported by the Russian Science Support Foundation, Russian Foundation for Basic Research (Grant No. 01-01-00146, 03-01-00258), and the Grants of the President of Russia (Grant No. MD-87.2003.01, NS-1532.2003.1). The support is gratefully acknowledged. 相似文献
3.
A. M. Vinogradov 《Acta Appl Math》1989,15(1-2):3-21
The main notions and results which are necessary for finding higher symmetries and conservation laws for general systems of partial differential equations are given. These constitute the starting point for the subsequent papers of this volume. Some problems are also discussed. 相似文献
4.
Camillo Costantini 《Topology and its Applications》2006,153(7):1056-1078
For X a metrizable space and (Y,ρ) a metric space, with Y pathwise connected, we compute the density of (C(X,(Y,ρ)),σ)—the space of all continuous functions from X to (Y,ρ), endowed with the supremum metric σ. Also, for (X,d) a metric space and (Y,‖⋅‖) a normed space, we compute the density of (UC((X,d),(Y,ρ)),σ) (the space of all uniformly continuous functions from (X,d) to (Y,ρ), where ρ is the metric induced on Y by ‖⋅‖). We also prove that the latter result extends only partially to the case where (Y,ρ) is an arbitrary pathwise connected metric space.To carry such an investigation out, the notions of generalized compact and generalized totally bounded metric space, introduced by the author and A. Barbati in a former paper, turn out to play a crucial rôle. Moreover, we show that the first-mentioned concept provides a precise characterization of those metrizable spaces which attain their extent. 相似文献
5.
A Volterra type integral equation in a Hilbert space with an additional linear operator L and a spectral parameter depending
on time is considered. If the parameter does not belong to the spectrum of L unconditional solvability of the considered problem
is proved. In the case where the initial value of the parameter coincides with some isolated point of the spectrum of the
operator L sufficient conditions for solvability are established. The obtained results are applied to the partial integral
equations associated with a contact problem of the theory of elasticity. 相似文献
6.
Summary In this paper a Gauss-Jordan algorithm with column interchanges is presented and analysed. We show that, in contrast with Gaussian elimination, the Gauss-Jordan algorithm has essentially differing properties when using column interchanges instead of row interchanges for improving the numerical stability. For solutions obtained by Gauss-Jordan with column interchanges, a more satisfactory bound for the residual norm can be given. The analysis gives theoretical evidence that the algorithm yields numerical solutions as good as those obtained by Gaussian elimination and that, in most practical situations, the residuals are equally small. This is confirmed by numerical experiments. Moreover, timing experiments on a Cyber 205 vector computer show that the algorithm presented has good vectorisation properties. 相似文献
7.
Using Brown's construction (J. Algebra 15 (1970) 103) of an exact 6-term sequence for a fibration of groupoids we show how an exact 9-term sequence can be associated to a fibration of bigroupoids. Applications to topology and algebra are given. 相似文献
8.
Sauer, Shelah, Vapnik and Chervonenkis proved that if a set system on n vertices contains many sets, then the set system has full trace on a large set. Although the restriction on the size of the
groundset cannot be lifted, Frankl and Pach found a trace structure that is guaranteed to occur in uniform set systems even
if we do not bound the size of the groundset. In this note we shall give three sequences of structures such that every set
system consisting of sufficiently many sets contains at least one of these structures with many sets. 相似文献
9.
Using the theory of noncommutative symmetric functions, we introduce the higher order peak algebras (Sym(N))N≥1, a sequence of graded Hopf algebras which contain the descent algebra and the usual peak algebra as initial cases (N=1 and N=2). We compute their Hilbert series, introduce and study several combinatorial bases, and establish various algebraic identities
related to the multisection of formal power series with noncommutative coefficients.
Received November 19, 2004 相似文献
10.
The graph-theoretic operation of rooted subtree prune and regraft is increasingly being used as a tool for understanding and modelling reticulation events in evolutionary biology. In this paper, we show that computing the rooted subtree prune and regraft distance between two rooted binary phylogenetic trees on the same label set is NP-hard. This resolves a longstanding open problem. Furthermore, we show that this distance is fixed parameter tractable when parameterised by the distance between the two trees.Received March 16, 2004 相似文献