全文获取类型
收费全文 | 492篇 |
免费 | 43篇 |
国内免费 | 28篇 |
专业分类
电工技术 | 11篇 |
综合类 | 64篇 |
化学工业 | 133篇 |
金属工艺 | 17篇 |
机械仪表 | 24篇 |
建筑科学 | 7篇 |
矿业工程 | 2篇 |
能源动力 | 6篇 |
轻工业 | 4篇 |
水利工程 | 4篇 |
石油天然气 | 5篇 |
无线电 | 23篇 |
一般工业技术 | 79篇 |
冶金工业 | 22篇 |
自动化技术 | 162篇 |
出版年
2024年 | 3篇 |
2023年 | 8篇 |
2022年 | 11篇 |
2021年 | 19篇 |
2020年 | 14篇 |
2019年 | 16篇 |
2018年 | 14篇 |
2017年 | 23篇 |
2016年 | 20篇 |
2015年 | 14篇 |
2014年 | 21篇 |
2013年 | 22篇 |
2012年 | 27篇 |
2011年 | 46篇 |
2010年 | 33篇 |
2009年 | 24篇 |
2008年 | 28篇 |
2007年 | 29篇 |
2006年 | 22篇 |
2005年 | 22篇 |
2004年 | 18篇 |
2003年 | 14篇 |
2002年 | 15篇 |
2001年 | 8篇 |
2000年 | 17篇 |
1999年 | 8篇 |
1998年 | 8篇 |
1997年 | 8篇 |
1996年 | 6篇 |
1995年 | 6篇 |
1994年 | 6篇 |
1993年 | 5篇 |
1992年 | 4篇 |
1991年 | 4篇 |
1990年 | 3篇 |
1989年 | 3篇 |
1988年 | 2篇 |
1985年 | 6篇 |
1984年 | 3篇 |
1983年 | 1篇 |
1982年 | 2篇 |
排序方式: 共有563条查询结果,搜索用时 15 毫秒
11.
针对基于二阶多节点多面体网格的表面重建过程中存在的准确拓扑及绘制、传输代价等问题,提出了一种基于关键特征控制的表面重建技术.研究并分析了二阶多节点多面体单元等参插值函数的性质特征,在网格单元棱边插值计算曲面轮廓点,在网格表面及体内提取曲面的几何特征关键点;根据3类插值关键点间的逻辑关系制定了令拓扑准确唯一的面片三角化规则及修复策略,设计了基于关键点的三角面片压缩索引结构.实验结果表明,该方法可准确计算并描述基于二阶多节点多面体网格单元的曲面几何拓扑结构,反映网格单元内部面片的真实凹凸性质,克服了拓扑二义性,具备对不同精度要求的适应性,并有效降低了绘制与传输代价. 相似文献
12.
为了克服椭圆检测过程中对椭圆完整性和边缘梯度信息依赖性较强的缺点,提高椭圆目标的检测速度,提出了一种新的基于弧段提取的椭圆拟合方法;首先将梯度方向符号相同的相邻边缘点连接成弧段,然后根据弧段的凸性和象限分类定义新的弧选择策略,利用位置约束和弧对的椭圆中心估计提取候选椭圆,最后采用改进的拟合算法拟合椭圆;实验结果表明,基于弧段提取的椭圆拟合方法相对于LMEDS算法和RHT3具有更好的准确性、鲁棒性和稳定性,实时性也有一定的提高。 相似文献
13.
提出一种新的增量式计算精确多面体可见外壳的算法IEPVH。首先,在新视图的图像平面,计算旧可见外壳的边被新光椎切割得到的交点。然后,恢复旧可见外壳的边上交点的局部方向信息并同时获得新光椎边上的交点。接着,恢复新光椎边上交点的局部方向信息。最后,新可见外壳的多边形面片通过一次遍历网格的边的过程被识别出来,并为了便于显示而被划分为三角面片。与EPVH等其他算法相比,IEPVH不但能够让用户更多地参与基于图像3维重建的过程,而且具有空间计算复杂度小。实验证明此算法的高效和鲁棒性。IEPVH的特点使其更易于在移动设备中得到应用。 相似文献
14.
15.
In this paper we present the sequence of linear Bernstein-type operators defined for f∈C[0,1] by Bn(f°τ−1)°τ, Bn being the classical Bernstein operators and τ being any function that is continuously differentiable ∞ times on [0,1], such that τ(0)=0, τ(1)=1 and τ′(x)>0 for x∈[0,1]. We investigate its shape preserving and convergence properties, as well as its asymptotic behavior and saturation. Moreover, these operators and others of King type are compared with each other and with Bn. We present as an interesting byproduct sequences of positive linear operators of polynomial type with nice geometric shape preserving properties, which converge to the identity, which in a certain sense improve Bn in approximating a number of increasing functions, and which, apart from the constant functions, fix suitable polynomials of a prescribed degree. The notion of convexity with respect to τ plays an important role. 相似文献
16.
E. Alper Yıldırım 《Optimization methods & software》2017,32(6):1163-1186
Every quadratic programming problem with a mix of continuous and binary variables can be equivalently reformulated as a completely positive optimization problem, that is, a linear optimization problem over the convex but computationally intractable cone of completely positive matrices. In this paper, we focus on general inner approximations of the cone of completely positive matrices on instances of completely positive optimization problems that arise from the reformulation of mixed binary quadratic programming problems. We provide a characterization of the feasibility of such an inner approximation as well as the optimal value of a feasible inner approximation. In particular, our results imply that polyhedral inner approximations are equivalent to a finite discretization of the feasible region of the original completely positive optimization problem. Our characterization yields, as a byproduct, an upper bound on the gap between the optimal value of an inner approximation and that of the original instance. We discuss the implications of this error bound for standard and box-constrained quadratic programs as well as general mixed binary quadratic programs with a bounded feasible region. 相似文献
17.
Representing Animations by Principal Components 总被引:11,自引:1,他引:10
In this paper, we present a representation for three-dimensional geometric animation sequences. Different from standard key-frame techniques, this approach is based on the determination of principal animation components and decouples the animation from the underlying geometry. The new representation supports progressive animation compression with spatial, as well as temporal, level-of-detail and high compression ratios. The distinction of animation and geometry allows for mapping animations onto other objects. 相似文献
18.
A method for image analysis, representation and re-synthesis is introduced. Unlike other schemes it is not pixel based but rather represents a picture as vector data, from which an altered version of the original image can be rendered. Representing an image as vector data allows performing operations such as zooming, retouching or colourising, avoiding common problems associated with pixel image manipulation. This paper brings together methods from the areas of computer vision, image compositing and image based rendering to prove that this type of image representation is a step towards accurate and efficient image manipulation. 相似文献
19.
Generation of Efficient Nested Loops from Polyhedra 总被引:1,自引:0,他引:1
Fabien Quilleré Sanjay Rajopadhye Doran Wilde 《International journal of parallel programming》2000,28(5):469-498
Automatic parallelization in the polyhedral model is based on affine transformations from an original computation domain (iteration space) to a target space-time domain, often with a different transformation for each variable. Code generation is an often ignored step in this process that has a significant impact on the quality of the final code. It involves making a trade-off between code size and control code simplification/optimization. Previous methods of doing code generation are based on loop splitting, however they have nonoptimal behavior when working on parameterized programs. We present a general parameterized method for code generation based on dual representation of polyhedra. Our algorithm uses a simple recursion on the dimensions of the domains, and enables fine control over the tradeoff between code size and control overhead. 相似文献
20.
热轧带钢中板形的计算和控制 总被引:1,自引:0,他引:1
热轧带钢中保持良好的板形是生产过程中极其重要的问题。首先,介绍了板形的基础知识包括板形的概念和计算,以及目前生产中板形控制方面实际存在的问题。在此基础上,讨论了影响板形的因素和控制策略,并对由带钢温度引起的缺陷,经过层流冷却获得良好板形的策略做了重点的讨论。从预防的角度阐明了板形的控制方法,并且介绍了一种实际生产中热轧带钢中浪板形控制方法,即PC设定控制方法的具体流程和实际应用效果。 相似文献