全文获取类型
收费全文 | 965篇 |
免费 | 517篇 |
专业分类
电工技术 | 10篇 |
综合类 | 1篇 |
化学工业 | 111篇 |
金属工艺 | 31篇 |
机械仪表 | 30篇 |
建筑科学 | 26篇 |
矿业工程 | 2篇 |
能源动力 | 10篇 |
轻工业 | 11篇 |
水利工程 | 3篇 |
石油天然气 | 1篇 |
武器工业 | 2篇 |
无线电 | 14篇 |
一般工业技术 | 39篇 |
冶金工业 | 9篇 |
自动化技术 | 1182篇 |
出版年
2023年 | 1篇 |
2022年 | 5篇 |
2021年 | 5篇 |
2020年 | 5篇 |
2019年 | 21篇 |
2018年 | 64篇 |
2017年 | 151篇 |
2016年 | 191篇 |
2015年 | 187篇 |
2014年 | 187篇 |
2013年 | 90篇 |
2012年 | 92篇 |
2011年 | 86篇 |
2010年 | 150篇 |
2009年 | 36篇 |
2008年 | 12篇 |
2007年 | 4篇 |
2006年 | 10篇 |
2005年 | 10篇 |
2004年 | 14篇 |
2003年 | 9篇 |
2002年 | 8篇 |
2001年 | 9篇 |
2000年 | 17篇 |
1999年 | 6篇 |
1998年 | 7篇 |
1997年 | 20篇 |
1996年 | 13篇 |
1995年 | 7篇 |
1994年 | 5篇 |
1993年 | 8篇 |
1992年 | 6篇 |
1991年 | 6篇 |
1990年 | 7篇 |
1989年 | 5篇 |
1988年 | 9篇 |
1987年 | 3篇 |
1986年 | 3篇 |
1985年 | 2篇 |
1984年 | 4篇 |
1983年 | 3篇 |
1982年 | 3篇 |
1981年 | 1篇 |
排序方式: 共有1482条查询结果,搜索用时 14 毫秒
101.
We present a method to design the deformation behavior of 3D printed models by an interactive tool, where the variation of bending elasticity at different regions of a model is realized by a change in shell thickness. Given a soft material to be used in 3D printing, we propose an experimental setup to acquire the bending behavior of this material on tubes with different diameters and thicknesses. The relationship between shell thickness and bending elasticity is stored in an echo state network using the acquired dataset. With the help of the network, an interactive design tool is developed to generate non‐uniformly hollowed models to achieve desired bending behaviors. The effectiveness of this method is verified on models fabricated by different 3D printers by studying whether their physical deformation can match the designed target shape. 相似文献
102.
Shape interpolation is a classical problem in computer graphics and has been widely investigated in the past two decades. Ideal shape interpolation should be natural and smooth which have good properties such as affine and conformal reproduction, bounded distortion, no fold‐overs, etc. In this paper, we present a new approach for planar shape interpolation based on Teichmüller maps ‐ a special type of maps in the class of quasi‐conformal maps. The algorithm consists of two steps. In the first step, a Teichmüller map is computed from the source shape to the target shape, and then the Beltrami coefficient is interpolated such that the conformal distortion is linear with respect to the time variable. In the second step, the intermediate shape is reconstructed by solving the Beltrami equation locally over each triangle and then stitching the mapped triangles by conformal transformations. The new approach preserves all the good properties mentioned above and produces more natural and more uniform intermediate shapes than the start‐of‐the‐art methods. Especially, the conformal distortion changes linearly with respect to the time variable. Experiment results show that our method can produce appealing results regardless of interpolating between the same or different objects. 相似文献
103.
This paper presents a novel method to enhance the performance of structure‐preserving image and texture filtering. With conventional edge‐aware filters, it is often challenging to handle images of high complexity where features of multiple scales coexist. In particular, it is not always easy to find the right balance between removing unimportant details and protecting important features when they come in multiple sizes, shapes, and contrasts. Unlike previous approaches, we address this issue from the perspective of adaptive kernel scales. Relying on patch‐based statistics, our method identifies texture from structure and also finds an optimal per‐pixel smoothing scale. We show that the proposed mechanism helps achieve enhanced image/texture filtering performance in terms of protecting the prominent geometric structures in the image, such as edges and corners, and keeping them sharp even after significant smoothing of the original signal. 相似文献
104.
Dan Song Ruofeng Tong Jian Chang Xiaosong Yang Min Tang Jian Jun Zhang 《Computer Graphics Forum》2016,35(7):147-156
Estimation of 3D body shapes from dressed‐human photos is an important but challenging problem in virtual fitting. We propose a novel automatic framework to efficiently estimate 3D body shapes under clothes. We construct a database of 3D naked and dressed body pairs, based on which we learn how to predict 3D positions of body landmarks (which further constrain a parametric human body model) automatically according to dressed‐human silhouettes. Critical vertices are selected on 3D registered human bodies as landmarks to represent body shapes, so as to avoid the time‐consuming vertices correspondences finding process for parametric body reconstruction. Our method can estimate 3D body shapes from dressed‐human silhouettes within 4 seconds, while the fastest method reported previously need 1 minute. In addition, our estimation error is within the size tolerance for clothing industry. We dress 6042 naked bodies with 3 sets of common clothes by physically based cloth simulation technique. To the best of our knowledge, We are the first to construct such a database containing 3D naked and dressed body pairs and our database may contribute to the areas of human body shapes estimation and cloth simulation. 相似文献
105.
Barycentric coordinates are very popular for interpolating data values on polyhedral domains. It has been recently shown that expressing them as complex functions has various advantages when interpolating two‐dimensional data in the plane, and in particular for holomorphic maps. We extend and generalize these results by investigating the complex representation of real‐valued barycentric coordinates, when applied to planar domains. We show how the construction for generating real‐valued barycentric coordinates from a given weight function can be applied to generating complex‐valued coordinates, thus deriving complex expressions for the classical barycentric coordinates: Wachspress, mean value, and discrete harmonic. Furthermore, we show that a complex barycentric map admits the intuitive interpretation as a complex‐weighted combination of edge‐to‐edge similarity transformations, allowing the design of “home‐made” barycentric maps with desirable properties. Thus, using the tools of complex analysis, we provide a methodology for analyzing existing barycentric mappings, as well as designing new ones. 相似文献
106.
We present a linear system for modelling 3D surfaces from curves. Our system offers better performance, stability and precision in control than previous non‐linear systems. By exploring the direct relationship between a standard higher‐order Laplacian editing framework and Hermite spline curves, we introduce a new form of Cauchy constraint that makes our system easy to both implement and control. We introduce novel workflows that simplify the construction of 3D models from sketches. We show how to convert existing 3D meshes into our curve‐based representation for subsequent editing and modelling, allowing our technique to be applied to a wide range of existing 3D content. 相似文献
107.
We present a camera lens simulation model capable of producing advanced photographic phenomena in a general spectral Monte Carlo image rendering system. Our approach incorporates insights from geometrical diffraction theory, from optical engineering and from glass science. We show how to efficiently simulate all five monochromatic aberrations, spherical and coma aberration, astigmatism, field curvature and distortion. We also consider chromatic aberration, lateral colour and aperture diffraction. The inclusion of Fresnel reflection generates correct lens flares and we present an optimized sampling method for path generation. 相似文献
108.
Human face is a complex biomechanical system and non‐linearity is a remarkable feature of facial expressions. However, in blendshape animation, facial expression space is linearized by regarding linear relationship between blending weights and deformed face geometry. This results in the loss of reality in facial animation. To synthesize more realistic facial animation, aforementioned relationship should be non‐linear to allow the greatest generality and fidelity of facial expressions. Unfortunately, few existing works pay attention to the topic about how to measure the non‐linear relationship. In this paper, we propose an optimization scheme that automatically explores the non‐linear relationship of blendshape facial animation from captured facial expressions. Experiments show that the explored non‐linear relationship is consistent with the non‐linearity of facial expressions soundly and is able to synthesize more realistic facial animation than the linear one. 相似文献
109.
We investigate the representation of signals defined on triangle meshes using linearly interpolated vertex attributes. Compared to texture mapping, storing data only at vertices yields significantly lower memory overhead and less expensive runtime reconstruction. However, standard approaches to determine vertex values such as point sampling or averaging triangle samples lead to suboptimal approximations. We discuss how an optimal solution can be efficiently calculated using continuous least‐squares. In addition, we propose a regularization term that allows us to minimize gradient discontinuities and mach banding artifacts while staying close to the optimum. Our method has been integrated in a game production lighting tool and we present examples of representing signals such as ambient occlusion and precomputed radiance transfer in real game scenes, where vertex baking was used to free up resources for other game components. 相似文献
110.
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. 相似文献