全文获取类型
收费全文 | 15094篇 |
免费 | 1264篇 |
国内免费 | 1360篇 |
专业分类
化学 | 2170篇 |
晶体学 | 27篇 |
力学 | 897篇 |
综合类 | 313篇 |
数学 | 10939篇 |
物理学 | 3372篇 |
出版年
2024年 | 24篇 |
2023年 | 150篇 |
2022年 | 181篇 |
2021年 | 307篇 |
2020年 | 346篇 |
2019年 | 414篇 |
2018年 | 398篇 |
2017年 | 459篇 |
2016年 | 527篇 |
2015年 | 357篇 |
2014年 | 642篇 |
2013年 | 1738篇 |
2012年 | 600篇 |
2011年 | 831篇 |
2010年 | 748篇 |
2009年 | 869篇 |
2008年 | 959篇 |
2007年 | 985篇 |
2006年 | 875篇 |
2005年 | 787篇 |
2004年 | 712篇 |
2003年 | 692篇 |
2002年 | 654篇 |
2001年 | 499篇 |
2000年 | 480篇 |
1999年 | 403篇 |
1998年 | 383篇 |
1997年 | 345篇 |
1996年 | 256篇 |
1995年 | 195篇 |
1994年 | 133篇 |
1993年 | 119篇 |
1992年 | 102篇 |
1991年 | 102篇 |
1990年 | 49篇 |
1989年 | 60篇 |
1988年 | 44篇 |
1987年 | 25篇 |
1986年 | 39篇 |
1985年 | 33篇 |
1984年 | 34篇 |
1983年 | 18篇 |
1982年 | 22篇 |
1981年 | 20篇 |
1980年 | 16篇 |
1979年 | 21篇 |
1978年 | 13篇 |
1977年 | 17篇 |
1976年 | 9篇 |
1973年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 968 毫秒
71.
运输网络中最小饱和流的求解 总被引:4,自引:0,他引:4
运输网络中常常由于流量的不可控易发生堵塞现象.网络发生堵塞时的饱和流值达不到最大流值.最小饱和流是运输网络,尤其是紧急疏散网络设计中很重要的一个参数.通过建立网络的割集矩阵来确定网络的堵塞截面,基于此提出了求解最小饱和流的线性规划模型及算法.举例分析表明,利用该算法计算网络最小饱和流更加简便、更加实用. 相似文献
72.
戴伏生 《数学的实践与认识》2006,36(2):186-192
经典的D IJKSTRA和BELLM AN-F LOYD通信网络路由算法,只能根据特定网络参数得到最佳路由,却无法获得网络存在的全部可用路由,而通信网理论研究及网络管理等方面,往往需要获得节点之间的全部可用路由.研究出一种路由新算法,遵循逻辑代数运算规则、采用关联矩阵中行与行之间整合与删除方式计算,N个节点的网络只需N-1次整合及删除运算,就能得到源节点到任意节点两点之间全部路由结果.详细论证了算法的正确性与合理性,简介了算法的并行运算可行性及与经典路由算法的兼容性等问题.通过算例详细说明算法的计算过程,并验证其正确性. 相似文献
73.
A set of new multi-component matrix Lie algebra is constructed, which is devoted to obtaining a new loop algebra A-2M. It follows that an isospectral problem is established. By making use of Tu scheme, a Liouville integrable multi-component hierarchy of soliton equations is generated, which possesses the multi-component Hamiltonian structures. As its reduction cases, the multi-component C-KdV hierarchy is given. Finally, the multi-component integrable coupling system of C-KdV hierarchy is presented through enlarging matrix spectral problem. 相似文献
74.
Onofrio Mario Di Vincenzo Plamen Koshlukov Roberto La Scala 《Advances in Applied Mathematics》2006,37(4):541
In this paper we describe completely the involutions of the first kind of the algebra UTn(F) of n×n upper triangular matrices. Every such involution can be extended uniquely to an involution on the full matrix algebra. We describe the equivalence classes of involutions on the upper triangular matrices. There are two distinct classes for UTn(F) when n is even and a single class in the odd case.Furthermore we consider the algebra UT2(F) of the 2×2 upper triangular matrices over an infinite field F of characteristic different from 2. For every involution *, we describe the *-polynomial identities for this algebra. We exhibit bases of the corresponding ideals of identities with involution, and compute the Hilbert (or Poincaré) series and the codimension sequences of the respective relatively free algebras.Then we consider the *-polynomial identities for the algebra UT3(F) over a field of characteristic zero. We describe a finite generating set of the ideal of *-identities for this algebra. These generators are quite a few, and their degrees are relatively large. It seems to us that the problem of describing the *-identities for the algebra UTn(F) of the n×n upper triangular matrices may be much more complicated than in the case of ordinary polynomial identities. 相似文献
75.
76.
设$p\geq 7$素数,$A$为模$p$的Steenrod代数. 我们利用Adams谱序列证明了球面稳定同伦群$\pi_{\ast}S$中,存在由$b_1g_0\tilde{\gamma}_{s}\in Ext_A^{s+4,(s+1)p^2q+spq+sq+s-3}(Z_p,Z_p)$所表示的新的非平凡元素族,其中$q=2(p-1)$, $3\leq s
相似文献
77.
王筑娟 《数学的实践与认识》2006,36(11):217-222
讨论Dx广义正定阵的问题,给出了Dx广义正定阵的一些等价性的刻划,同时还讨论了Dx广义正定阵的若干性质. 相似文献
78.
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. 相似文献
79.
Let G be a graph and let Pm(G) denote the number of perfect matchings of G.We denote the path with m vertices by Pm and the Cartesian product of graphs G and H by G×H. In this paper, as the continuance of our paper [W. Yan, F. Zhang, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, Adv. Appl. Math. 32 (2004) 175-188], we enumerate perfect matchings in a type of Cartesian products of graphs by the Pfaffian method, which was discovered by Kasteleyn. Here are some of our results:1. Let T be a tree and let Cn denote the cycle with n vertices. Then Pm(C4×T)=∏(2+α2), where the product ranges over all eigenvalues α of T. Moreover, we prove that Pm(C4×T) is always a square or double a square.2. Let T be a tree. Then Pm(P4×T)=∏(1+3α2+α4), where the product ranges over all non-negative eigenvalues α of T.3. Let T be a tree with a perfect matching. Then Pm(P3×T)=∏(2+α2), where the product ranges over all positive eigenvalues α of T. Moreover, we prove that Pm(C4×T)=[Pm(P3×T)]2. 相似文献
80.
R. Thomas conjectured, 20 years ago, that the presence of a positive circuit in the interaction graph of a dynamical system is a necessary condition for the presence of several stable states. Recently, E. Remy et al. stated and proved the conjecture for Boolean dynamical systems. Using a similar approach, we generalize the result to discrete dynamical systems, and by focusing on the asynchronous dynamics that R. Thomas used in the course of his analysis of genetic networks, we obtain a more general variant of R. Thomas’ conjecture. In this way, we get a necessary condition for genetic networks to lead to differentiation. 相似文献