全文获取类型
收费全文 | 2644篇 |
免费 | 426篇 |
国内免费 | 335篇 |
学科分类
工业技术 | 3405篇 |
出版年
2024年 | 5篇 |
2023年 | 31篇 |
2022年 | 48篇 |
2021年 | 70篇 |
2020年 | 82篇 |
2019年 | 99篇 |
2018年 | 86篇 |
2017年 | 117篇 |
2016年 | 137篇 |
2015年 | 128篇 |
2014年 | 151篇 |
2013年 | 181篇 |
2012年 | 209篇 |
2011年 | 205篇 |
2010年 | 162篇 |
2009年 | 171篇 |
2008年 | 190篇 |
2007年 | 177篇 |
2006年 | 184篇 |
2005年 | 131篇 |
2004年 | 106篇 |
2003年 | 106篇 |
2002年 | 106篇 |
2001年 | 108篇 |
2000年 | 60篇 |
1999年 | 47篇 |
1998年 | 47篇 |
1997年 | 51篇 |
1996年 | 49篇 |
1995年 | 32篇 |
1994年 | 31篇 |
1993年 | 15篇 |
1992年 | 17篇 |
1991年 | 12篇 |
1990年 | 7篇 |
1989年 | 13篇 |
1988年 | 3篇 |
1987年 | 5篇 |
1986年 | 5篇 |
1985年 | 1篇 |
1984年 | 4篇 |
1983年 | 1篇 |
1982年 | 6篇 |
1981年 | 2篇 |
1980年 | 3篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1975年 | 1篇 |
1974年 | 1篇 |
排序方式: 共有3405条查询结果,搜索用时 15 毫秒
1.
On sorting triangles in a delaunay tessellation 总被引:1,自引:0,他引:1
In a two-dimensional Delaunay-triangulated domain, there exists a partial ordering of the triangles (with respect to a vertex) that is consistent with the two-dimensional visibility of the triangles from that vertex. An equivalent statement is that a polygon that is star-shaped with respect to a given vertex can be extended, one triangle at a time, until it includes the entire domain. Arbitrary planar triangulations do not possess this useful property which allows incremental processing of the triangles.This work was partially supported by the National Science Foundation's US-Italy Collaborative Research Program under Grant INT-8714578 and Information, Robotics, and Intelligent Research Grant IRI-8704781. 相似文献
2.
Youngjean Jung Panayiotis Papadopoulos R. O. Ritchie 《International journal for numerical methods in engineering》2004,60(2):429-460
This work concerns the micromechanical constitutive modelling, algorithmic implementation and numerical simulation of polycrystalline superelastic alloys under multiaxial loading. The model is formulated in finite deformations and incorporates the effect of texture. The numerical implementation is based on the constrained minimization of the Helmholtz free energy with dissipation. Simulations are conducted for thin tubes of Nitinol under tension–torsion, as well as for a simplified model of a biomedical stent. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
3.
Compared to other fields of engineering, in mechanical engineering, the Discrete Element Method (DEM) is not yet a well known
method. Nevertheless, there is a variety of simulation problems where the method has obvious advantages due to its meshless
nature. For problems where several free bodies can collide and break after having been largely deformed, the DEM is the method
of choice. Neighborhood search and collision detection between bodies as well as the separation of large solids into smaller
particles are naturally incorporated in the method. The main DEM algorithm consists of a relatively simple loop that basically
contains the three substeps contact detection, force computation and integration. However, there exists a large variety of
different algorithms to choose the substeps to compose the optimal method for a given problem. In this contribution, we describe
the dynamics of particle systems together with appropriate numerical integration schemes and give an overview over different
types of particle interactions that can be composed to adapt the method to fit to a given simulation problem. Surface triangulations
are used to model complicated, non-convex bodies in contact with particle systems. The capabilities of the method are finally
demonstrated by means of application examples.
Commemorative Contribution. 相似文献
4.
Rao V. Garimella 《International journal for numerical methods in engineering》2002,55(4):451-478
The data structure representing a mesh and the operators to create and query such a database play a crucial role in the performance of mesh generation and FE analysis applications. The design of such a database must balance the conflicting requirements of compactness and computational efficiency. In this article, 10 different mesh representations are reviewed for linear tetrahedral and hexahedral meshes. A methodology for calculating the storage and computational costs of mesh representations is presented and the 10 data structures are analysed. Also, a system for ranking different data structures based on their computational and storage costs is devised and the various mesh representations are ranked according to this measure. Copyright © 2002 John Wiley & Sons, Ltd. 相似文献
5.
周培德 《计算机辅助设计与图形学学报》2002,14(3):287-288
周培协三角剖分是否能得到最小权三角剖分,周培德在《周培德三角部分不是最小权三角剖分》一文撰写之前已有新的结论,本文还指出《周培德三角剖分不是最小权三角剖分》一文所举反例不成立。 相似文献
6.
7.
8.
9.
10.
Rex A. Dwyer 《Algorithmica》1987,2(1):137-151
An easily implemented modification to the divide-and-conquer algorithm for computing the Delaunay triangulation ofn sites in the plane is presented. The change reduces its (n logn) expected running time toO(n log logn) for a large class of distributions that includes the uniform distribution in the unit square. Experimental evidence presented demonstrates that the modified algorithm performs very well forn216, the range of the experiments. It is conjectured that the average number of edges it creates—a good measure of its efficiency—is no more than twice optimal forn less than seven trillion. The improvement is shown to extend to the computation of the Delaunay triangulation in theL
p
metric for 1<p.This research was supported by National Science Foundation Grants DCR-8352081 and DCR-8416190. 相似文献