全文获取类型
收费全文 | 387篇 |
免费 | 42篇 |
国内免费 | 20篇 |
专业分类
化学 | 13篇 |
力学 | 33篇 |
综合类 | 4篇 |
数学 | 213篇 |
物理学 | 75篇 |
无线电 | 111篇 |
出版年
2022年 | 3篇 |
2021年 | 3篇 |
2020年 | 8篇 |
2019年 | 7篇 |
2018年 | 10篇 |
2017年 | 8篇 |
2016年 | 12篇 |
2015年 | 9篇 |
2014年 | 17篇 |
2013年 | 24篇 |
2012年 | 16篇 |
2011年 | 28篇 |
2010年 | 17篇 |
2009年 | 23篇 |
2008年 | 30篇 |
2007年 | 25篇 |
2006年 | 25篇 |
2005年 | 16篇 |
2004年 | 28篇 |
2003年 | 15篇 |
2002年 | 16篇 |
2001年 | 17篇 |
2000年 | 11篇 |
1999年 | 14篇 |
1998年 | 16篇 |
1997年 | 14篇 |
1996年 | 11篇 |
1995年 | 4篇 |
1994年 | 9篇 |
1993年 | 2篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1987年 | 2篇 |
1985年 | 1篇 |
1984年 | 2篇 |
1982年 | 2篇 |
排序方式: 共有449条查询结果,搜索用时 796 毫秒
121.
V. Lombardo T. Marzulli C. Pappalettere P. Sforza 《Optics and Lasers in Engineering》2003,39(2):247-254
This paper reports the development of an electro-optic device for relative distance measurement. The time-of-scan triangulation technique has been used as measurement principle and a rotating mirror employed as beam deflection system. A calibration technique is needed to calculate the geometrical parameters of the system. The device has an accuracy of 100 μm, a working distance of 20 cm and a range of 10 mm. The accuracy obtained depends on the instability of the rotation speed of the mechanical scanner that affects the measurement of the scanning time. 相似文献
122.
123.
A triangulation is said to be even if each vertex has even degree. For even triangulations, define the N‐flip and the P2‐flip as two deformations preserving the number of vertices. We shall prove that any two even triangulations on the sphere with the same number of vertices can be transformed into each other by a sequence of N‐ and P2‐flips. © 2005 Wiley Periodicals, Inc. J. Graph Theory 相似文献
124.
三维物体表面重建广泛采用三角网格方法,密集的数据采样可以重建出精确的三维表面,但是庞大的数据量不利于多分辨率三维实时显示和三维物体网络传输,因此三维表面网格简化是迫切需要解决的问题之一.近年来表面简化问题得到了广泛地研究.本文提出基于面聚类的网格简化新算法,通过最小化最大类内距离算法进行面聚类实现区域划分,然后提取区域特征,进而根据特征点和边对区域进行受限三角剖分.实验说明本文提出的面聚类网格简化算法在保持三维表面几何拓扑特征的基础上取得了很好的简化效果. 相似文献
125.
126.
It is well-known that the basic properties of a bivariate spline space such as dimension and approximation order depend on the geometric structure of the partition. The dependence of geometric structure results in the fact that the dimension of a C
1 cubic spline space over an arbitrary triangulation becomes a well-known open problem. In this paper, by employing a new group of smoothness conditions and conformality conditions, we determine the dimension of bivariate C
1 cubic spline spaces over a so-called even stratified triangulation. 相似文献
127.
Estimation of the Bezout number for piecewise algebraic curve 总被引:3,自引:0,他引:3
A piecewise algebraic curve is a curve determined by the zero set of a bivariate spline function.In this paper.a coniecture on trianguation is confirmed The relation between the piecewise linear algebraiccurve and four-color conjecture is also presented.By Morgan-Scott triangulation, we will show the instabilityof Bezout number of piecewise algebraic curves. By using the combinatorial optimization method,an upper 相似文献
128.
Smooth surface reconstruction via natural neighbour interpolation of distance functions 总被引:5,自引:0,他引:5
We present an algorithm to reconstruct smooth surfaces of arbitrary topology from unorganised sample points and normals. The method uses natural neighbour interpolation, works in any dimension and accommodates non-uniform samples. The reconstructed surface interpolates the data points and is implicitly represented as the zero set of some pseudo-distance function. It can be meshed so as to satisfy a user-defined error bound, which makes the method especially relevant for small point sets. Experimental results are presented for surfaces in
. 相似文献
129.
We extend Whitney's Theorem that every plane triangulation without separating triangles is hamiltonian by allowing some separating triangles. More precisely, we define a decomposition of a plane triangulation G into 4‐connected ‘pieces,’ and show that if each piece shares a triangle with at most three other pieces then G is hamiltonian. We provide an example to show that our hypothesis that each piece shares a triangle with at most three other pieces' cannot be weakened to ‘four other pieces.’ As part of our proof, we also obtain new results on Tutte cycles through specified vertices in planar graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 138–150, 2002 相似文献
130.