全文获取类型
收费全文 | 2096篇 |
免费 | 92篇 |
国内免费 | 243篇 |
专业分类
化学 | 128篇 |
晶体学 | 1篇 |
力学 | 118篇 |
综合类 | 27篇 |
数学 | 1972篇 |
物理学 | 185篇 |
出版年
2024年 | 2篇 |
2023年 | 24篇 |
2022年 | 42篇 |
2021年 | 43篇 |
2020年 | 42篇 |
2019年 | 57篇 |
2018年 | 61篇 |
2017年 | 66篇 |
2016年 | 44篇 |
2015年 | 53篇 |
2014年 | 85篇 |
2013年 | 281篇 |
2012年 | 71篇 |
2011年 | 102篇 |
2010年 | 100篇 |
2009年 | 136篇 |
2008年 | 161篇 |
2007年 | 139篇 |
2006年 | 121篇 |
2005年 | 88篇 |
2004年 | 87篇 |
2003年 | 98篇 |
2002年 | 87篇 |
2001年 | 55篇 |
2000年 | 54篇 |
1999年 | 54篇 |
1998年 | 71篇 |
1997年 | 48篇 |
1996年 | 28篇 |
1995年 | 22篇 |
1994年 | 25篇 |
1993年 | 16篇 |
1992年 | 8篇 |
1991年 | 10篇 |
1990年 | 5篇 |
1989年 | 9篇 |
1988年 | 2篇 |
1987年 | 4篇 |
1986年 | 3篇 |
1985年 | 5篇 |
1984年 | 3篇 |
1983年 | 1篇 |
1982年 | 6篇 |
1981年 | 4篇 |
1980年 | 4篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1976年 | 1篇 |
1969年 | 1篇 |
排序方式: 共有2431条查询结果,搜索用时 15 毫秒
1.
In this paper, we will propose algorithms for calculating a minimal ellipsoid circumscribing a polytope defined by a system
of linear inequalities. If we know all vertices of the polytope and its cardinality is not very large, we can solve the problem
in an efficient manner by a number of existent algorithms. However, when the polytope is defined by linear inequalities, these
algorithms may not work since the cardinality of vertices may be huge. Based on a fact that vertices determining an ellipsoid
are only a fraction of these vertices, we propose algorithms which iteratively calculate an ellipsoid which covers a subset
of vertices. Numerical experiment shows that these algorithms perform well for polytopes of dimension up to seven. 相似文献
2.
P.A. Grillet 《Acta Mathematica Hungarica》2005,106(4):301-315
Summary Three weak variants of compactness which lie strictly between compactness and quasicompactness, are introduced. Their basic properties are studied. The interplay with mapping and their direct and inverse preservation under mappings are investigated. In the process three decompositions of compactness are observed. 相似文献
3.
令H是有限维Hopf代数,A是左H-模代数。本文证明了A是Gorenstein代数的充分必要条件。A^H也是Gorenstein代数的条件。它是Enochs EE,GarciaJJ和del RioA关于群作用相应的理论的推广,同时给出A/A^H是Frobenius扩张的条件。 相似文献
4.
Let f :X→X be a continuous map of a compact metric space to itself. We prove that f is topologically conjugate to an adding machine map if and only if X is an infinite minimal set for f and each point of X is regularly recurrent. Moreover, if X is an infinite minimal set for f and one point of X is regularly recurrent, then f is semiconjugate to an adding machine map. 相似文献
5.
Rie Natsui 《Acta Mathematica Hungarica》2005,108(4):299-318
Summary Let Fq be a finite field with q elements. We consider formal Laurent series of Fq -coefficients with their continued fraction expansions by Fq -polynomials. We prove some arithmetic properties for almost every formal Laurent series with respect to the Haar measure. We construct a group extension of the non-archimedean continued fraction transformation and show its ergodicity. Then we get some results as an application of the individual ergodic theorem. We also discuss the convergence rate for limit behaviors. 相似文献
6.
本文是[1,12]的继续,研究描述架中概念的结构;本文讨论后半部分,内容涉及概念内涵与外延的转换,清晰关系的内投影与内变换,概念的结构*以及有关问题的注记。 相似文献
7.
对于那些由代数微分方程描述的具有输入输出关系的非线性控制系统,本文采用两种方法讨论了其最小实现问题:一种方法是直接计算系统的特征列;另一种方法则采用了本原元定理.两种方法给出的最小实现所需的状态变量最小数目是相等的.文中的大量代数与微分运算则可利用数学机械化来完成 相似文献
8.
9.
Florin Ambro 《Central European Journal of Mathematics》2006,4(3):358-370
We describe the set of minimal log discrepancies of toric log varieties, and study its accumulation points.
This work is supported by a 21st Century COE Kyoto Mathematics Fellowship, and a JSPS Grant-in-Aid No 17740011. 相似文献
10.
Brian Lucena 《Discrete Applied Mathematics》2007,155(8):1055-1065
One consequence of the graph minor theorem is that for every k there exists a finite obstruction set Obs(TW?k). However, relatively little is known about these sets, and very few general obstructions are known. The ones that are known are the cliques, and graphs which are formed by removing a few edges from a clique. This paper gives several general constructions of minimal forbidden minors which are sparse in the sense that the ratio of the treewidth to the number of vertices n does not approach 1 as n approaches infinity. We accomplish this by a novel combination of using brambles to provide lower bounds and achievable sets to demonstrate upper bounds. Additionally, we determine the exact treewidth of other basic graph constructions which are not minimal forbidden minors. 相似文献