全文获取类型
收费全文 | 4956篇 |
免费 | 211篇 |
国内免费 | 611篇 |
专业分类
化学 | 63篇 |
力学 | 47篇 |
综合类 | 91篇 |
数学 | 4797篇 |
物理学 | 780篇 |
出版年
2024年 | 7篇 |
2023年 | 47篇 |
2022年 | 63篇 |
2021年 | 90篇 |
2020年 | 74篇 |
2019年 | 136篇 |
2018年 | 145篇 |
2017年 | 148篇 |
2016年 | 125篇 |
2015年 | 96篇 |
2014年 | 141篇 |
2013年 | 871篇 |
2012年 | 142篇 |
2011年 | 219篇 |
2010年 | 189篇 |
2009年 | 261篇 |
2008年 | 344篇 |
2007年 | 327篇 |
2006年 | 291篇 |
2005年 | 246篇 |
2004年 | 254篇 |
2003年 | 241篇 |
2002年 | 237篇 |
2001年 | 169篇 |
2000年 | 168篇 |
1999年 | 141篇 |
1998年 | 139篇 |
1997年 | 155篇 |
1996年 | 80篇 |
1995年 | 52篇 |
1994年 | 28篇 |
1993年 | 27篇 |
1992年 | 18篇 |
1991年 | 20篇 |
1990年 | 10篇 |
1989年 | 13篇 |
1988年 | 9篇 |
1987年 | 4篇 |
1986年 | 7篇 |
1985年 | 6篇 |
1984年 | 12篇 |
1983年 | 4篇 |
1982年 | 5篇 |
1981年 | 2篇 |
1979年 | 3篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1974年 | 1篇 |
1936年 | 5篇 |
排序方式: 共有5778条查询结果,搜索用时 15 毫秒
21.
戴伏生 《数学的实践与认识》2006,36(2):186-192
经典的D IJKSTRA和BELLM AN-F LOYD通信网络路由算法,只能根据特定网络参数得到最佳路由,却无法获得网络存在的全部可用路由,而通信网理论研究及网络管理等方面,往往需要获得节点之间的全部可用路由.研究出一种路由新算法,遵循逻辑代数运算规则、采用关联矩阵中行与行之间整合与删除方式计算,N个节点的网络只需N-1次整合及删除运算,就能得到源节点到任意节点两点之间全部路由结果.详细论证了算法的正确性与合理性,简介了算法的并行运算可行性及与经典路由算法的兼容性等问题.通过算例详细说明算法的计算过程,并验证其正确性. 相似文献
22.
23.
We introduce the notion of n-nuanced MV-algebra by performing a Łukasiewicz–Moisil nuancing construction on top of MV-algebras. These structures extend both MV-algebras and Łukasiewicz–Moisil algebras, thus unifying two important types of structures in the algebra of logic. On a logical level, n-nuanced MV-algebras amalgamate two distinct approaches to many valuedness: that of the infinitely valued Łukasiewicz logic, more related in spirit to the fuzzy approach, and that of Moisil n-nuanced logic, which is more concerned with nuances of truth rather than truth degree. We study n-nuanced MV-algebras mainly from the algebraic and categorical points of view, and also consider some basic model-theoretic aspects. The relationship with a suitable notion of n-nuanced ordered group via an extension of the Γ construction is also analyzed. 相似文献
24.
A Multi-component Matrix Loop Algebra and Its Application 总被引:3,自引:0,他引:3
DONG Huan-He ZHANG Ning 《理论物理通讯》2005,44(6):997-1001
A set of multi-component matrix Lie algebra is constructed. It follows that a type of new loop algebra A^- M-1 is presented. An isospectral problem is established. Integrable multi-component hierarchy is obtained by Tu pattern, which possesses tri-Hamiltonian structures. Furthermore, it can be reduced to the well-known AKNS hierarchy and BPT hierarchy. Therefore, the major result of this paper can be regarded as a unified expression integrable model of the AKNS hierarchy and the BPT hierarchy. 相似文献
25.
26.
Alexander Zimmermann 《Algebras and Representation Theory》2004,7(1):19-34
In an earlier paper, Raphaël Rouquier and the author introduced the group of self-equivalences of a derived category. In the case of a Brauer tree algebra, we determined a nontrivial homomorphism of the Artin braid group to this group of self-equivalences. The class of Brauer tree algebras include blocks of finite group rings over a large enough field with cyclic defect groups. In the present paper we give an integral version of this homomorphism. Moreover, we identify some interesting arithmetic subgroups with natural groups of self-equivalences of the derived category. 相似文献
27.
Employing positive-definiteness arguments we analyse Boson field states, which combine classical and quantum mechanical features (signal and noise), in a constructive manner. Mathematically, they constitute Bauer simplexes within the convex, weak-*-compact state space of the C*-Weyl algebra, defined by a presymplectic test function space (smooth one-Boson wave functions) and are affinely homeomorphic to a state space of a classical field. The regular elements are expressed in terms of weak distributions (probability premeasures) on the dual test function space. The Bauer simplex arising from the bare vacuum is shown to generalize the quantum optical photon field states with positive P-functions. 相似文献
28.
We prove that every noetherian affine PI Hopf algebra has finite injective dimension, which answers a question of Brown (1998).
29.
Rafał Bocian Thorsten Holm Andrzej Skowroński 《Central European Journal of Mathematics》2004,2(1):67-75
Auslander’s representation dimension measures how far a finite dimensional algebra is away from being of finite representation
type. In [1], M. Auslander proved that a finite dimensional algebra A is of finite representation type if and only if the representation dimension of A is at most 2. Recently, R. Rouquier proved that there are finite dimensional algebras of an arbitrarily large finite representation
dimension. One of the exciting open problems is to show that all finite dimensional algebras of tame representation type have
representation dimension at most 3. We prove that this is true for all domestic weakly symmetric algebras over algebraically
closed fields having simply connected Galois coverings. 相似文献
30.
Marianne Gerny Burkhard Alpers 《International Journal of Computers for Mathematical Learning》2004,9(1):25-57
In this article we describe a mathematical microworld for investigating car motion on a racing course and its use with a group of grade 12 students. The microworld is concerned with the mathematical construction of courses and functions which describe car motion. It is implemented in the computer algebra system, Maple®, which provides the means to represent courses and functions symbolically and graphically. We describe the learning opportunities offered by the microworld in relation to the research literature on functions. Various facets and layers of the function concept are addressed in the microworld, and we suggest how work in the microworld might help in overcoming some well-known misconceptions.This revised version was published online in September 2005 with corrections to the Cover Date. 相似文献