全文获取类型
收费全文 | 15866篇 |
免费 | 1209篇 |
国内免费 | 1170篇 |
专业分类
化学 | 1370篇 |
晶体学 | 21篇 |
力学 | 694篇 |
综合类 | 157篇 |
数学 | 6419篇 |
物理学 | 2094篇 |
综合类 | 7490篇 |
出版年
2024年 | 34篇 |
2023年 | 78篇 |
2022年 | 179篇 |
2021年 | 217篇 |
2020年 | 233篇 |
2019年 | 273篇 |
2018年 | 253篇 |
2017年 | 370篇 |
2016年 | 424篇 |
2015年 | 368篇 |
2014年 | 662篇 |
2013年 | 928篇 |
2012年 | 845篇 |
2011年 | 804篇 |
2010年 | 751篇 |
2009年 | 840篇 |
2008年 | 861篇 |
2007年 | 1067篇 |
2006年 | 983篇 |
2005年 | 865篇 |
2004年 | 790篇 |
2003年 | 685篇 |
2002年 | 677篇 |
2001年 | 635篇 |
2000年 | 565篇 |
1999年 | 528篇 |
1998年 | 436篇 |
1997年 | 384篇 |
1996年 | 390篇 |
1995年 | 310篇 |
1994年 | 270篇 |
1993年 | 235篇 |
1992年 | 237篇 |
1991年 | 186篇 |
1990年 | 162篇 |
1989年 | 145篇 |
1988年 | 114篇 |
1987年 | 98篇 |
1986年 | 77篇 |
1985年 | 53篇 |
1984年 | 54篇 |
1983年 | 17篇 |
1982年 | 34篇 |
1981年 | 18篇 |
1980年 | 20篇 |
1979年 | 24篇 |
1978年 | 11篇 |
1977年 | 15篇 |
1976年 | 11篇 |
1974年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
101.
We prove that simply connected open manifolds of bounded geometry, linear growth and sublinear filling growth (e.g. finite filling area) are simply connected at infinity. 相似文献
102.
This study investigates the robust output tracking problem for a class of uncertain linear systems. The uncertainties are assumed to be time invariant and to satisfy the matching conditions. According to the selected nominal parameters, an optimal solution with a prescribed degree of stability is determined. Then, an auxiliary input via the use of an adapting factor, connected to the nominal optimal control, is introduced to guarantee the robustness and prescribed degree of stability for the output tracking control of the uncertain linear systems. This method is very simple and effective and can reject bounded uncertainties imposed on the states. A maglev vehicle model example is given to show its effectiveness. 相似文献
103.
Eero Immonen 《Journal of Mathematical Analysis and Applications》2004,300(1):79-101
In this article, we study the effect of the chosen representation of a point value (and point evaluation) on the class of periodic signals realizable using a certain type of infinite-dimensional linear system. By suitably representing the point evaluation at the origin in a Hilbert space, we are able to give a complete characterization of its extensions. These extensions involve a new concept called δ-sequence, the use of which as an observation operator of an infinite-dimensional linear system is studied in this article. In particular, we consider their use in the realization of periodic signals. We also investigate how the use of δ-sequences affects the convergence properties of such realizations; we consider the rate and character of convergence and the removal of the Gibbs phenomenon. As still a further demonstration of the significance of the chosen concept of a point value, we discuss the use of distributional point values in the realization of periodic distributions. The possible applications of this work lie in regulator problems of infinite-dimensional control theory, as is indicated by the well-known internal model principle. 相似文献
104.
105.
A linear inequality system with infinitely many constraints is polynomial (analytical) if its index set is a compact interval
of the real line and all its coefficients are polynomial (analytical, respectively) functions of the index on this interval.
This paper provides an example of analytical system whose solution set cannot be the solution set of any polynomial system.
Research supported by DGES of Spain and FEDER of UE, Grant BFM2002-04114-C02-01.
Research supported by CONACyT of Mexico, Grant 130036.
Research partially supported by CONACyT of Mexico, Grant 44003. 相似文献
106.
考虑Yi=X^tiβ+g(ti)+εi,1≤i≤,忱里Xi是一固定设计点列,ti是独立同分布随机变量并且服从[0,1]上均匀分布。 相似文献
107.
Chu Maoquan 《安徽师范大学学报(自然科学版)》1995,(3)
本文对可用正线性算子{L_n}逼近的满足一定的可微性条件的函数类给出Woronovskaja——型定理,并将所得结果应用到几个特殊的正线性算子上,从而基本上解决了这些正线性算子的Woronovskaja——型问题。 相似文献
108.
109.
110.
Andrew V. Goldberg Michael D. Grigoriadis Robert E. Tarjan 《Mathematical Programming》1991,50(1-3):277-290
Goldfarb and Hao (1990) have proposed a pivot rule for the primal network simplex algorithm that will solve a maximum flow problem on ann-vertex,m-arc network in at mostnm pivots and O(n
2
m) time. In this paper we describe how to extend the dynamic tree data structure of Sleator and Tarjan (1983, 1985) to reduce the running time of this algorithm to O(nm logn). This bound is less than a logarithmic factor larger than those of the fastest known algorithms for the problem. Our extension of dynamic trees is interesting in its own right and may well have additional applications.Research partially supported by a Presidential Young Investigator Award from the National Science Foundation, Grant No. CCR-8858097, an IBM Faculty Development Award, and AT&T Bell Laboratories.Research partially supported by the Office of Naval Research, Contract No. N00014-87-K-0467.Research partially supported by the National Science Foundation, Grant No. DCR-8605961, and the Office of Naval Research, Contract No. N00014-87-K-0467. 相似文献