全文获取类型
收费全文 | 333篇 |
免费 | 21篇 |
国内免费 | 25篇 |
专业分类
化学 | 1篇 |
力学 | 6篇 |
综合类 | 12篇 |
数学 | 326篇 |
物理学 | 34篇 |
出版年
2023年 | 2篇 |
2022年 | 6篇 |
2021年 | 7篇 |
2020年 | 11篇 |
2019年 | 12篇 |
2018年 | 15篇 |
2017年 | 11篇 |
2016年 | 6篇 |
2015年 | 4篇 |
2014年 | 10篇 |
2013年 | 14篇 |
2012年 | 8篇 |
2011年 | 18篇 |
2010年 | 18篇 |
2009年 | 23篇 |
2008年 | 34篇 |
2007年 | 17篇 |
2006年 | 31篇 |
2005年 | 17篇 |
2004年 | 25篇 |
2003年 | 15篇 |
2002年 | 9篇 |
2001年 | 11篇 |
2000年 | 8篇 |
1999年 | 12篇 |
1998年 | 9篇 |
1997年 | 4篇 |
1996年 | 2篇 |
1995年 | 2篇 |
1994年 | 4篇 |
1993年 | 3篇 |
1991年 | 3篇 |
1990年 | 1篇 |
1986年 | 2篇 |
1984年 | 2篇 |
1981年 | 1篇 |
1979年 | 1篇 |
1975年 | 1篇 |
排序方式: 共有379条查询结果,搜索用时 15 毫秒
1.
A graph is called supereulerian if it has a spanning closed trail. Let G be a 2-edge-connected graph of order n such that each minimal edge cut SE(G) with |S|3 satisfies the property that each component of G−S has order at least (n−2)/5. We prove that either G is supereulerian or G belongs to one of two classes of exceptional graphs. Our results slightly improve earlier results of Catlin and Li. Furthermore, our main result implies the following strengthening of a theorem of Lai within the class of graphs with minimum degree δ4: If G is a 2-edge-connected graph of order n with δ(G)4 such that for every edge xyE(G) , we have max{d(x),d(y)}(n−2)/5−1, then either G is supereulerian or G belongs to one of two classes of exceptional graphs. We show that the condition δ(G)4 cannot be relaxed. 相似文献
2.
1.引 言 本文的目的是用求解偏微分方程(PDE)的方法来消除离散三角形曲面的噪声,所使用的方程是热传导方程到曲面的推广.热传导方程应用于图像处理已有二十余年的历史,有关参考文献相当丰富(见[1,11,12,19]).众所周知,对于给定的初始图像ρ0,热传导方程 在τ时刻的解与用Gauss滤波器Gσ(x)= (当标准差σ=2τ,时)和ρ0作卷积的结果相同.容易看出Gρ和ρ0的卷积运算相当于对ρ0做加权平均,当标准离差σ变大时,该加权平均在一个较大的范围实现,这解释了热传导方程的滤波作用.近来热传导方程已推广到空间曲面[4,5]以及高维空间中的二维流形(见[3]),对 相似文献
3.
A Necessary and Sufficient Condition for the Existence of a Heterochromatic Spanning Tree in a Graph
Kazuhiro Suzuki 《Graphs and Combinatorics》2006,22(2):261-269
We prove the following theorem. An edge-colored (not necessary to be proper) connected graph G of order n has a heterochromatic spanning tree if and only if for any r colors (1≤r≤n−2), the removal of all the edges colored with these r colors from G results in a graph having at most r+1 components, where a heterochromatic spanning tree is a spanning tree whose edges have distinct colors. 相似文献
4.
Song LI Guo Mao WANG Zhi Song LIU 《数学学报(英文版)》2005,21(6):1475-1486
The purpose of this paper is to investigate the mean size formula of wavelet packets in Lp for 0 〈 p ≤ ∞. We generalize a mean size formula of wavelet packets given in terms of the p-norm joint spectral radius and we also give some asymptotic formulas for the Lp-norm or quasi-norm on the subdivision trees. All results will be given in the general setting, 相似文献
5.
We study conditions on the matrix mask of a vector subdivision scheme ensuring that certain polynomial input vectors yield polynomial output again. The conditions are in terms of a recurrence formula for the vectors which determine the structure of polynomial input with this property. From this recurrence, we obtain an algorithm to determine polynomial input of maximal degree. The algorithm can be used in the design of masks to achieve a high order of polynomial reproduction. 相似文献
6.
Regularity of multiwavelets 总被引:7,自引:0,他引:7
The motivation for this paper is an interesting observation made by Plonka concerning the factorization of the matrix symbol associated with the refinement equation for B-splines with equally spaced multiple knots at integers and subsequent developments which relate this factorization to regularity of refinable vector fields over the real line. Our intention is to contribute to this train of ideas which is partially driven by the importance of refinable vector fields in the construction of multiwavelets. The use of subdivision methods will allow us to consider the problem almost entirely in the spatial domain and leads to exact characterizations of differentiability and Hölder regularity in arbitrary L p spaces. We first study the close relationship between vector subdivision schemes and a generalized notion of scalar subdivision schemes based on bi-infinite matrices with certain periodicity properties. For the latter type of subdivision scheme we will derive criteria for convergence and Hölder regularity of the limit function, which mainly depend on the spectral radius of a bi-infinite matrix induced by the subdivision operator, and we will show that differentiability of the limit functions can be characterized by factorization properties of the subdivision operator. By switching back to vector subdivision we will transfer these results to refinable vectors fields and obtain characterizations of regularity by factorization and spectral radius properties of the symbol associated to the refinable vector field. Finally, we point out how multiwavelets can be generated from orthonormal refinable bi-infinite vector fields. 相似文献
7.
Morten Nielsen 《Advances in Computational Mathematics》2007,27(2):195-209
Given a dilation matrix A :ℤd→ℤd, and G a complete set of coset representatives of 2π(A
−Tℤd/ℤd), we consider polynomial solutions M to the equation ∑
g∈G
M(ξ+g)=1 with the constraints that M≥0 and M(0)=1. We prove that the full class of such functions can be generated using polynomial convolution kernels. Trigonometric
polynomials of this type play an important role as symbols for interpolatory subdivision schemes. For isotropic dilation matrices,
we use the method introduced to construct symbols for interpolatory subdivision schemes satisfying Strang–Fix conditions of
arbitrary order.
Research partially supported by the Danish Technical Science Foundation, Grant No. 9701481, and by the Danish SNF-PDE network. 相似文献
8.
Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms 总被引:2,自引:0,他引:2
Hoang Tuy 《Journal of Global Optimization》1991,1(1):23-36
We investigate subdivision strategies that can improve the convergence and efficiency of some branch and bound algorithms of global optimization. In particular, a general class of so called weakly exhaustive simplicial subdivision processes is introduced that subsumes all previously known radial exhaustive processes. This result provides the basis for constructing flexible subdivision strategies that can be adapted to take advantage of various problem conditions. 相似文献
9.
关于k—消去图的若干新结果 总被引:2,自引:0,他引:2
汪长平 《数学物理学报(A辑)》1998,18(3):302-309
设G是一个图.k是自然数.图G的一个k-正则支撑子图称为G的一个k-因子.若对于G的每条边e.G—e都存在一个k-因子,则称G是一个k-消去图.该文得到了一个图是k-消去图的若干充分条件,推广了文[2—4]中有关结论. 相似文献
10.
《Operations Research Letters》2022,50(6):655-659
In finite graphs, greedy algorithms are used to find minimum spanning trees (MinST) and maximum spanning trees (MaxST). In infinite graphs, we illustrate a general class of problems where a greedy approach discovers a MaxST while a MinST may be unreachable. Our algorithm is a natural extension of Prim's to infinite graphs with summable and strictly positive edge weights, producing a sequence of finite trees that converge to a MaxST. 相似文献