全文获取类型
收费全文 | 1179篇 |
免费 | 20篇 |
国内免费 | 75篇 |
专业分类
化学 | 21篇 |
力学 | 44篇 |
综合类 | 5篇 |
数学 | 1077篇 |
物理学 | 127篇 |
出版年
2023年 | 12篇 |
2022年 | 22篇 |
2021年 | 22篇 |
2020年 | 23篇 |
2019年 | 31篇 |
2018年 | 28篇 |
2017年 | 22篇 |
2016年 | 22篇 |
2015年 | 19篇 |
2014年 | 51篇 |
2013年 | 162篇 |
2012年 | 31篇 |
2011年 | 58篇 |
2010年 | 55篇 |
2009年 | 108篇 |
2008年 | 99篇 |
2007年 | 79篇 |
2006年 | 69篇 |
2005年 | 37篇 |
2004年 | 46篇 |
2003年 | 42篇 |
2002年 | 23篇 |
2001年 | 28篇 |
2000年 | 22篇 |
1999年 | 23篇 |
1998年 | 25篇 |
1997年 | 26篇 |
1996年 | 21篇 |
1995年 | 21篇 |
1994年 | 8篇 |
1993年 | 8篇 |
1992年 | 2篇 |
1991年 | 3篇 |
1990年 | 5篇 |
1989年 | 2篇 |
1987年 | 2篇 |
1985年 | 4篇 |
1984年 | 5篇 |
1983年 | 2篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 1篇 |
排序方式: 共有1274条查询结果,搜索用时 15 毫秒
1.
2.
In this paper, we investigate the evolution of joint invariants under invariant geometric flows using the theory of equivariant moving frames and the induced invariant discrete variational complex. For certain arc length preserving planar curve flows invariant under the special Euclidean group , the special linear group , and the semidirect group , we find that the induced evolution of the discrete curvature satisfies the differential‐difference mKdV, KdV, and Burgers' equations, respectively. These three equations are completely integrable, and we show that a recursion operator can be constructed by precomposing the characteristic operator of the curvature by a certain invariant difference operator. Finally, we derive the constraint for the integrability of the discrete curvature evolution to lift to the evolution of the discrete curve itself. 相似文献
3.
本文对一类具有对称轴的图A_n(n≥0),得到了它的特征多项式及匹配多项式的精确表达式;同时还得到A_(?)的完美匹配数。 相似文献
4.
Yuanqiu Huang 《Discrete Applied Mathematics》2007,155(3):405-409
A stable set of a graph is a vertex set in which any two vertices are not adjacent. It was proven in [A. Brandstädt, V.B. Le, T. Szymczak, The complexity of some problems related to graph 3-colorability, Discrete Appl. Math. 89 (1998) 59-73] that the following problem is NP-complete: Given a bipartite graph G, check whether G has a stable set S such thatG-Sis a tree. In this paper we prove the following problem is polynomially solvable: Given a graph G with maximum degree 3 and containing no vertices of degree 2, check whether G has a stable set S such thatG-Sis a tree. Thus we partly answer a question posed by the authors in the above paper. Moreover, we give some structural characterizations for a graph G with maximum degree 3 that has a stable set S such that G-S is a tree. 相似文献
5.
M.Z. Arslanov 《Operations Research Letters》2007,35(5):636-644
We consider the problem of guillotine cutting a rectangular sheet into two rectangular pieces without rotations. The question is whether there exists a cutting pattern with given numbers of occurrences of both rectangular pieces. A polynomial time algorithm is described to construct the convex hull of solutions to this problem. 相似文献
6.
On Polynomial Functions over Finite Commutative Rings 总被引:1,自引:0,他引:1
Jian Jun JIANG Guo Hua PENG Qi SUN Qi Fan ZHANG 《数学学报(英文版)》2006,22(4):1047-1050
Let R be an arbitrary finite commutative local ring. In this paper, we obtain a necessary and sufficient condition for a function over R to be a polynomial function. Before this paper, necessary and sufficient conditions for a function to be a polynomial function over some special finite commutative local rings were obtained. 相似文献
7.
Let E\subset \Bbb R
s
be compact and let d
n
E
denote the dimension of the space of polynomials of degree at most n in s variables restricted to E . We introduce the notion of an asymptotic interpolation measure (AIM). Such a measure, if it exists , describes the asymptotic behavior of any scheme τ
n
={ \bf x
k,n
}
k=1
dnE
, n=1,2,\ldots , of nodes for multivariate polynomial interpolation for which the norms of the corresponding interpolation operators do
not grow geometrically large with n . We demonstrate the existence of AIMs for the finite union of compact subsets of certain algebraic curves in R
2
. It turns out that the theory of logarithmic potentials with external fields plays a useful role in the investigation. Furthermore,
for the sets mentioned above, we give a computationally simple construction for ``good' interpolation schemes.
November 9, 2000. Date revised: August 4, 2001. Date accepted: September 14, 2001. 相似文献
8.
Popularized by Zassenhaus in the seventies, several algorithms for factoring polynomials use a so-called lifting and recombination scheme. Concerning bivariate polynomials, we present a new algorithm for the recombination stage that requires a lifting up to precision twice the total degree of the polynomial to be factored. Its cost is dominated by the computation of reduced echelon solution bases of linear systems. We show that our bound on precision is asymptotically optimal.
9.
In this paper we characterize the local maxima of a continuous global optimization formulation for finding the independence
number of a graph. Classical Karush-Kuhn-Tucker conditions and simple combinatorial arguments are found sufficient to deduce
several interesting properties of the local and global maxima. These properties can be utilized in developing new approaches
to the maximum independent set problem. 相似文献
10.
The aim of this article is to derive stable generalized sampling in a shift-invariant space by using some special dual frames in L2(0,1). These sampling formulas involve samples of filtered versions of the functions in the shift-invariant space. The involved samples are expressed as the frame coefficients of an appropriate function in L2(0,1) with respect to some particular frame in L2(0,1). Since any shift-invariant space with stable generator is the image of L2(0,1) by means of a bounded invertible operator, our generalized sampling is derived from some dual frame expansions in L2(0,1). 相似文献