全文获取类型
收费全文 | 1365篇 |
免费 | 116篇 |
国内免费 | 83篇 |
专业分类
电工技术 | 40篇 |
综合类 | 89篇 |
化学工业 | 73篇 |
金属工艺 | 65篇 |
机械仪表 | 188篇 |
建筑科学 | 64篇 |
矿业工程 | 29篇 |
能源动力 | 34篇 |
轻工业 | 30篇 |
水利工程 | 14篇 |
石油天然气 | 84篇 |
武器工业 | 11篇 |
无线电 | 95篇 |
一般工业技术 | 74篇 |
冶金工业 | 21篇 |
原子能技术 | 24篇 |
自动化技术 | 629篇 |
出版年
2024年 | 1篇 |
2023年 | 8篇 |
2022年 | 8篇 |
2021年 | 16篇 |
2020年 | 11篇 |
2019年 | 18篇 |
2018年 | 20篇 |
2017年 | 29篇 |
2016年 | 49篇 |
2015年 | 37篇 |
2014年 | 72篇 |
2013年 | 67篇 |
2012年 | 82篇 |
2011年 | 107篇 |
2010年 | 81篇 |
2009年 | 85篇 |
2008年 | 83篇 |
2007年 | 105篇 |
2006年 | 94篇 |
2005年 | 81篇 |
2004年 | 61篇 |
2003年 | 62篇 |
2002年 | 54篇 |
2001年 | 30篇 |
2000年 | 39篇 |
1999年 | 33篇 |
1998年 | 43篇 |
1997年 | 46篇 |
1996年 | 24篇 |
1995年 | 29篇 |
1994年 | 24篇 |
1993年 | 10篇 |
1992年 | 6篇 |
1991年 | 13篇 |
1990年 | 7篇 |
1989年 | 3篇 |
1988年 | 9篇 |
1987年 | 3篇 |
1986年 | 1篇 |
1985年 | 4篇 |
1984年 | 4篇 |
1983年 | 1篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1978年 | 1篇 |
排序方式: 共有1564条查询结果,搜索用时 15 毫秒
31.
This paper presents a novel multi-directional blending method for heterogeneous object design. Contrary to earlier studies, this paper introduces material blending through multiple features with different heterogeneous material composition. Feature-based method is used to represent and design heterogeneous objects with multi-directional material composition. The Voronoi diagram of multiple curves is constructed to generate bisector of the geometric domain. Then, metamorphosis from the bounding curve to multiple internal curves is performed using dynamic programming based optimization approach in two steps. First, optimum curve matching between internal curves and enclosing Voronoi cells is obtained. Then, an optimum ruling line alignment and insertion technique between the Voronoi diagram and the bounding curve is developed. Metamorphosis through complex concavities is also achieved. Finally, multi-directional material composition is mapped based on a set of relations. 相似文献
32.
We introduce a fully automatic algorithm which optimizes the high‐level structure of a given quadrilateral mesh to achieve a coarser quadrangular base complex. Such a topological optimization is highly desirable, since state‐of‐the‐art quadrangulation techniques lead to meshes which have an appropriate singularity distribution and an anisotropic element alignment, but usually they are still far away from the high‐level structure which is typical for carefully designed meshes manually created by specialists and used e.g. in animation or simulation. In this paper we show that the quality of the high‐level structure is negatively affected by helical configurations within the quadrilateral mesh. Consequently we present an algorithm which detects helices and is able to remove most of them by applying a novel grid preserving simplification operator (GP‐operator) which is guaranteed to maintain an all‐quadrilateral mesh. Additionally it preserves the given singularity distribution and in particular does not introduce new singularities. For each helix we construct a directed graph in which cycles through the start vertex encode operations to remove the corresponding helix. Therefore a simple graph search algorithm can be performed iteratively to remove as many helices as possible and thus improve the high‐level structure in a greedy fashion. We demonstrate the usefulness of our automatic structure optimization technique by showing several examples with varying complexity. 相似文献
33.
We present a method for calculating the boundary of objects from Discrete Indicator Functions that store 2‐material volume fractions with a high degree of accuracy. Although Marching Cubes and its derivatives are effective methods for calculating contours of functions sampled over discrete grids, these methods perform poorly when contouring non‐smooth functions such as Discrete Indicator Functions. In particular, Marching Cubes will generate surfaces that exhibit aliasing and oscillations around the exact surface. We derive a simple solution to remove these problems by using a new function to calculate the positions of vertices along cell edges that is efficient, easy to implement, and does not require any optimization or iteration. Finally, we provide empirical evidence that the error introduced by our contouring method is significantly less than is introduced by Marching Cubes. 相似文献
34.
We introduce a new variational formulation for the problem of reconstructing a watertight surface defined by an implicit equation, from a finite set of oriented points; a problem which has attracted a lot of attention for more than two decades. As in the Poisson Surface Reconstruction approach, discretizations of the continuous formulation reduce to the solution of sparse linear systems of equations. But rather than forcing the implicit function to approximate the indicator function of the volume bounded by the implicit surface, in our formulation the implicit function is forced to be a smooth approximation of the signed distance function to the surface. Since an indicator function is discontinuous, its gradient does not exist exactly where it needs to be compared with the normal vector data. The smooth signed distance has approximate unit slope in the neighborhood of the data points. As a result, the normal vector data can be incorporated directly into the energy function without implicit function smoothing. In addition, rather than first extending the oriented points to a vector field within the bounding volume, and then approximating the vector field by a gradient field in the least squares sense, here the vector field is constrained to be the gradient of the implicit function, and a single variational problem is solved directly in one step. The formulation allows for a number of different efficient discretizations, reduces to a finite least squares problem for all linearly parameterized families of functions, and does not require boundary conditions. The resulting algorithms are significantly simpler and easier to implement, and produce results of quality comparable with state‐of‐the‐art algorithms. An efficient implementation based on a primal‐graph octree‐based hybrid finite element‐finite difference discretization, and the Dual Marching Cubes isosurface extraction algorithm, is shown to produce high quality crack‐free adaptive manifold polygon meshes. 相似文献
35.
Mid-level processes on images often return outputs in functional form. In this context the use of functional data analysis (FDA) in image analysis is considered. In particular, attention is focussed on shape analysis, where the use of FDA in the functional approach (contour functions) shows its superiority over other approaches, such as the landmark based approach or the set theory approach, on two different problems (principal component analysis and discriminant analysis) in a well-known database of bone outlines. Furthermore, a problem that has hardly ever been considered in the literature is dealt with: multivariate functional discrimination. A discriminant function based on independent component analysis for indicating where the differences between groups are and what their level of discrimination is, is proposed. The classification results obtained with the methodology are very promising. Finally, an analysis of hippocampal differences in Alzheimer’s disease is carried out. 相似文献
36.
Ahmad H. Nasri 《The Visual computer》2000,16(1):3-14
C
0 (creases) or C
1 continuity across the interpolated curves. 相似文献
37.
38.
39.
We provide a method for improving the parameterization of patching schemes that approximate Catmull‐Clark subdivision surfaces, such that the new parameterization conforms better to that of the original subdivision surface. We create this reparameterization in real‐time using a method that only depends on the topology of the surface and is independent of the surface's geometry. Our method can handle patches with more than one extraordinary vertex and avoids the combinatorial increase in both complexity and storage associated with multiple extraordinary vertices. Moreover, the reparameterization function is easy to implement and fast. 相似文献
40.
基于智能卡的远程用户认证协议比基于口令的安全协议能提供更好的安全性。2011年Chen等提出一种对Hsiang-Shih方案改进的基于智能卡的远程认证协议,并称解决了相关方案中存在的各种攻击问题。指出Chen等方案仍然存在着内部攻击、丢失智能卡攻击、重放攻击和身份冒充攻击,并针对基于口令和智能卡的远程认证协议类存在的离线口令猜测攻击提出一种基于智能卡和椭圆曲线离散对数问题的认证协议。该协议能抵抗提到的所有攻击,在登陆和认证阶段只需要一个点乘运算。 相似文献