全文获取类型
收费全文 | 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 毫秒
31.
Vojtech Blint 《Journal of Discrete Algorithms》2003,1(3-4):339-355
Let G be an undirected graph with two edge costs (c-cost and d-cost). We want to minimize the diameter of a spanning subgraph S (under d-cost) subject to the constraint that the total cost of the edges in S (with respect to c) does not exceed a given budget. We prove that this problem is non-approximable, even in some special cases. Similar results are proved if the stretch factor or the root stretch factor is considered instead of the diameter. 相似文献
32.
陈协彬 《数学物理学报(A辑)》2003,23(1):65-76
设G是路或圈的笛卡尔乘积图,t(G)表示G的支撑树数.该文借助于第二类Chebyshev多项式给出t(G)的公式,并考虑了t(G)的线性递归关系及渐近性态. 相似文献
33.
Binary 3-point scheme, developed by Hormann and Sabin [Hormann, K. and Sabin, Malcolm A., 2008, A family of subdivision schemes with cubic precision, Computer Aided Geometric Design, 25, 41-52], has been modified by introducing a tension parameter which generates a family of C1 limiting curves for certain range of tension parameter. Ternary 3-point scheme, introduced by Siddiqi and Rehan [Siddiqi, Shahid S. and Rehan, K., 2009, A ternary three point scheme for curve designing, International Journal of Computer Mathematics, In Press, DOI: 10.1080/00207160802428220], has also been modified by introducing a tension parameter which generates family of C1 and C2 limiting curves for certain range of tension parameter. Laurent polynomial method is used to investigate the continuity of the subdivision schemes. The performance of modified schemes has been demonstrated by considering different examples along with its comparison with the established subdivision schemes. 相似文献
34.
In our previous work, we have given an algorithm for segmenting a simplex in the n-dimensional space into rt n+ 1 polyhedrons and provided map F which maps the n-dimensional unit cube to these polyhedrons. In this paper, we prove that the map F is a one to one correspondence at least in lower dimensional spaces (n _〈 3). Moreover, we propose the approximating subdivision and the interpolatory subdivision schemes and the estimation of computational complexity for triangular Bézier patches on a 2-dimensional space. Finally, we compare our schemes with Goldman's in computational complexity and speed. 相似文献
35.
贺国权 《南昌大学学报(理科版)》2005,29(3):266-268
激光衍射测微的精度关键在于衍射图样暗纹间距的精确测量,暗纹间距的测量目前主要采用高位数、小中心距的固体图象传感器线阵,为此,提出了一种硬件插值细分的方法。介绍了激光衍射的测量原理,分析了图像传感器的功能,根据采样和恢复定理,对输出的视频信号进行间距插值细分的可行性进行了论证,给出了插值细分的电路框图。分析表明其测量精度不受器件中心距大小的限制,为低位数、大中心距的固体图象传感器线阵的应用提供了方便。 相似文献
36.
Wavelets for multichannel signals 总被引:1,自引:0,他引:1
In this paper, we introduce and investigate multichannel wavelets, which are wavelets for vector fields, based on the concept of full rank subdivision operators. We prove that, like in the scalar and multiwavelet case, the existence of a scaling function with orthogonal integer translates guarantees the existence of a wavelet function, also with orthonormal integer translates. In this context, however, scaling functions as well as wavelets turn out to be matrix-valued functions. 相似文献
37.
关于图的若干介值问题 总被引:2,自引:0,他引:2
对连通图G,以C_i(G),■(G)分别表G的有i条边的连通支撑子图之集与连通子图之集,以C~i(G),(?)(G)分别表G的顶点数为i的子树集与连通子图之集.本文讨论了这四类子图簇对若干基本参数及端点数的介值性,从而对已有的一些结果作了若干有意义的拓广. 相似文献
38.
Ghulam MUSTAFA 《数学年刊B辑(英文版)》2017,38(5):1077-1092
The objective of this article is to introduce a generalized algorithm to produce the m-point n-ary approximating subdivision schemes(for any integer m, n ≥ 2). The proposed algorithm has been derived from uniform B-spline blending functions. In particular, we study statistical and geometrical/traditional methods for the model selection and assessment for selecting a subdivision curve from the proposed family of schemes to model noisy and noisy free data. Moreover, we also discuss the deviation of subdivision curves generated by proposed family of schemes from convex polygonal curve. Furthermore, visual performances of the schemes have been presented to compare numerically the Gibbs oscillations with the existing family of schemes. 相似文献
39.
一类新的(2n-1)点二重动态逼近细分 总被引:1,自引:1,他引:0
利用正弦函数构造了一类新的带有形状参数ω的(2n-1)点二重动态逼近细分格式.从理论上分析了随n值变化时这类细分格式的C~k连续性和支集长度;算法的一个特色是随着细分格式中参数ω的取值不同,相应生成的极限曲线的表现张力也有所不同,而且这一类算法所对应的静态算法涵盖了Chaikin,Hormann,Dyn,Daniel和Hassan的算法.文末附出大量数值实例,在给定相同的初始控制顶点,且极限曲线达到同一连续性的前提下和现有几种算法做了比较,数值实例表明这类算法生成的极限曲线更加饱满,表现力更强. 相似文献
40.
For any graph G, let be the number of spanning trees of G, be the line graph of G, and for any nonnegative integer r, be the graph obtained from G by replacing each edge e by a path of length connecting the two ends of e. In this article, we obtain an expression for in terms of spanning trees of G by a combinatorial approach. This result generalizes some known results on the relation between and and gives an explicit expression if G is of order and size in which s vertices are of degree 1 and the others are of degree k. Thus we prove a conjecture on for such a graph G. 相似文献