全文获取类型
收费全文 | 12664篇 |
免费 | 1094篇 |
国内免费 | 950篇 |
专业分类
化学 | 2520篇 |
晶体学 | 27篇 |
力学 | 782篇 |
综合类 | 264篇 |
数学 | 9111篇 |
物理学 | 2004篇 |
出版年
2024年 | 28篇 |
2023年 | 163篇 |
2022年 | 229篇 |
2021年 | 229篇 |
2020年 | 361篇 |
2019年 | 395篇 |
2018年 | 388篇 |
2017年 | 392篇 |
2016年 | 322篇 |
2015年 | 262篇 |
2014年 | 448篇 |
2013年 | 880篇 |
2012年 | 466篇 |
2011年 | 611篇 |
2010年 | 633篇 |
2009年 | 830篇 |
2008年 | 880篇 |
2007年 | 788篇 |
2006年 | 753篇 |
2005年 | 640篇 |
2004年 | 495篇 |
2003年 | 510篇 |
2002年 | 577篇 |
2001年 | 442篇 |
2000年 | 405篇 |
1999年 | 363篇 |
1998年 | 363篇 |
1997年 | 265篇 |
1996年 | 235篇 |
1995年 | 209篇 |
1994年 | 162篇 |
1993年 | 146篇 |
1992年 | 117篇 |
1991年 | 103篇 |
1990年 | 64篇 |
1989年 | 59篇 |
1988年 | 58篇 |
1987年 | 50篇 |
1986年 | 46篇 |
1985年 | 60篇 |
1984年 | 43篇 |
1983年 | 23篇 |
1982年 | 47篇 |
1981年 | 46篇 |
1980年 | 32篇 |
1979年 | 25篇 |
1978年 | 22篇 |
1977年 | 8篇 |
1976年 | 11篇 |
1974年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 744 毫秒
71.
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. 相似文献
72.
We present integral-type Darboux transformation for the mKdV hierarchy and for the mKdV hierarchy withself-consistent sources. In contrast with the normal Darboux transformation, the integral-type Darboux transformationscan offer non-auto-Backlund transformation between two (2n 1)-th mKdV equations with self-consistent sources withdifferent degrees. This kind of Darboux transformation enables us to construct the N-soliton solution for the mKdVhierarchy with self-consistent sources. We also propose the formulas for the m times repeated integral-type Darbouxtransformations for both mKdV hierarchy and mKdV hierarchy with self-consistent sources. 相似文献
73.
Xuechao Li 《Graphs and Combinatorics》2006,22(4):503-513
In this paper, we give new lower bounds for the size of Δ-critical graphs with Δ=8,9 which improve the partial results of
Luo [6] and Y. Zhao [12]. 相似文献
74.
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. 相似文献
75.
76.
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. 相似文献
77.
M. Akdağ 《Acta Mathematica Hungarica》2007,116(1-2):35-45
We define a multifunction F: X ⇝ Y to be upper (lower) D*-supercontinuous if F
+(V) (F
−(V)) is d*-open in X for every open set V of Y. We obtain some characterizations and several properties concerning upper (lower) D*-supercontinuous multifunctions.
相似文献
78.
Valentin Brimkov 《Discrete Applied Mathematics》2007,155(14):1812-1825
We consider the problem of computing the Lovász theta function for circulant graphs Cn,J of degree four with n vertices and chord length J, 2?J?n. We present an algorithm that takes O(J) operations if J is an odd number, and O(n/J) operations if J is even. On the considered class of graphs our algorithm strongly outperforms the known algorithms for theta function computation. We also provide explicit formulas for the important special cases J=2 and J=3. 相似文献
79.
80.
We prove equivalence of the definitions by the author and by Korevaar and Schoen of the Sobolev classes of mappings of a domain of an arithmetic n-dimensional space to a metric space. 相似文献