全文获取类型
收费全文 | 1044篇 |
免费 | 179篇 |
国内免费 | 25篇 |
专业分类
电工技术 | 3篇 |
综合类 | 37篇 |
化学工业 | 27篇 |
金属工艺 | 28篇 |
机械仪表 | 93篇 |
建筑科学 | 65篇 |
矿业工程 | 5篇 |
能源动力 | 32篇 |
轻工业 | 3篇 |
水利工程 | 2篇 |
石油天然气 | 12篇 |
武器工业 | 5篇 |
无线电 | 42篇 |
一般工业技术 | 85篇 |
冶金工业 | 45篇 |
原子能技术 | 13篇 |
自动化技术 | 751篇 |
出版年
2024年 | 1篇 |
2023年 | 2篇 |
2022年 | 5篇 |
2021年 | 6篇 |
2020年 | 9篇 |
2019年 | 9篇 |
2018年 | 33篇 |
2017年 | 69篇 |
2016年 | 66篇 |
2015年 | 53篇 |
2014年 | 93篇 |
2013年 | 87篇 |
2012年 | 56篇 |
2011年 | 101篇 |
2010年 | 73篇 |
2009年 | 81篇 |
2008年 | 85篇 |
2007年 | 87篇 |
2006年 | 50篇 |
2005年 | 65篇 |
2004年 | 39篇 |
2003年 | 30篇 |
2002年 | 21篇 |
2001年 | 21篇 |
2000年 | 9篇 |
1999年 | 9篇 |
1998年 | 10篇 |
1997年 | 18篇 |
1996年 | 11篇 |
1995年 | 4篇 |
1994年 | 5篇 |
1993年 | 7篇 |
1992年 | 7篇 |
1991年 | 5篇 |
1990年 | 3篇 |
1989年 | 5篇 |
1988年 | 5篇 |
1987年 | 2篇 |
1986年 | 2篇 |
1985年 | 1篇 |
1984年 | 1篇 |
1978年 | 2篇 |
排序方式: 共有1248条查询结果,搜索用时 46 毫秒
31.
通过几何着色器生成Shadow Volume实时阴影。利用几何着色器能生成新顶点与输出流的特性,将以往由CPU完成的产生封闭阴影体的计算转移到图形处理器中实现。该实现能提高算法渲染效率,可以进一步解放CPU的处理时间。比传统先由CPU生成阴影体雏形的方法更简单,性能更优秀。 相似文献
32.
Nicolas Cuntz Andreas Kolb Robert Strzodka Daniel Weiskopf 《Computer Graphics Forum》2008,27(3):719-726
Typically, flow volumes are visualized by defining their boundary as iso‐surface of a level set function. Grid‐based level sets offer a good global representation but suffer from numerical diffusion of surface detail, whereas particle‐based methods preserve details more accurately but introduce the problem of unequal global representation. The particle level set (PLS) method combines the advantages of both approaches by interchanging the information between the grid and the particles. Our work demonstrates that the PLS technique can be adapted to volumetric dye advection via streak volumes, and to the visualization by time surfaces and path volumes. We achieve this with a modified and extended PLS, including a model for dye injection. A new algorithmic interpretation of PLS is introduced to exploit the efficiency of the GPU, leading to interactive visualization. Finally, we demonstrate the high quality and usefulness of PLS flow visualization by providing quantitative results on volume preservation and by discussing typical applications of 3D flow visualization. 相似文献
33.
Although considerable attention in recent years has been given to the problem of symmetry detection in general shapes, few methods have been developed that aim to detect and quantify the intrinsic symmetry of a shape rather than its extrinsic, or pose‐dependent symmetry. In this paper, we present a novel approach for efficiently computing symmetries of a shape which are invariant up to isometry preserving transformations. We show that the intrinsic symmetries of a shape are transformed into the Euclidean symmetries in the signature space defined by the eigenfunctions of the Laplace‐Beltrami operator. Based on this observation, we devise an algorithm which detects and computes the isometric mappings from the shape onto itself. We show that our approach is both computationally efficient and robust with respect to small non‐isometric deformations, even if they include topological changes. 相似文献
34.
M. Dellepiane N. Pietroni N. Tsingos M. Asselot R. Scopigno 《Computer Graphics Forum》2008,27(7):1719-1727
Visual fidelity and interactivity are the main goals in Computer Graphics research, but recently also audio is assuming an important role. Binaural rendering can provide extremely pleasing and realistic three‐dimensional sound, but to achieve best results it's necessary either to measure or to estimate individual Head Related Transfer Function (HRTF). This function is strictly related to the peculiar features of ears and face of the listener. Recent sound scattering simulation techniques can calculate HRTF starting from an accurate 3D model of a human head. Hence, the use of binaural rendering on large scale (i.e. video games, entertainment) could depend on the possibility to produce a sufficiently accurate 3D model of a human head, starting from the smallest possible input. In this paper we present a completely automatic system, which produces a 3D model of a head starting from simple input data (five photos and some key‐points indicated by user). The geometry is generated by extracting information from images and accordingly deforming a 3D dummy to reproduce user head features. The system proves to be fast, automatic, robust and reliable: geometric validation and preliminary assessments show that it can be accurate enough for HRTF calculation. 相似文献
35.
We present an algorithm for detecting and extracting the silhouette edges of a triangle mesh in real time using Graphical Processing Units (GPUs). We also propose a tessellation strategy for visualizing the mesh with smooth silhouettes through a continuous blend between Bézier patches with varying level of detail. Furthermore, we show how our techniques can be integrated with displacement and normal mapping. We give details on our GPU implementation and provide a performance analysis with respect to mesh size. 相似文献
36.
Data sets coming from simulations or sampling of real‐world phenomena often contain noise that hinders their processing and analysis. Automatic filtering and denoising can be challenging: when the nature of the noise is unknown, it is difficult to distinguish between noise and actual data features; in addition, the filtering process itself may introduce “artificial” features into the data set that were not originally present. In this paper, we propose a smoothing method for 2D scalar fields that gives the user explicit control over the data features. We define features as critical points of the given scalar function, and the topological structure they induce (i.e., the Morse‐Smale complex). Feature significance is rated according to topological persistence. Our method allows filtering out spurious features that arise due to noise by means of topological simplification, providing the user with a simple interface that defines the significance threshold, coupled with immediate visual feedback of the remaining data features. In contrast to previous work, our smoothing method guarantees a C1‐continuous output scalar field with the exact specified features and topological structures. 相似文献
37.
We present a new approach aimed at understanding the structure of connections in edge‐bundling layouts. We combine the advantages of edge bundles with a bundle‐centric simplified visual representation of a graph's structure. For this, we first compute a hierarchical edge clustering of a given graph layout which groups similar edges together. Next, we render clusters at a user‐selected level of detail using a new image‐based technique that combines distance‐based splatting and shape skeletonization. The overall result displays a given graph as a small set of overlapping shaded edge bundles. Luminance, saturation, hue, and shading encode edge density, edge types, and edge similarity. Finally, we add brushing and a new type of semantic lens to help navigation where local structures overlap. We illustrate the proposed method on several real‐world graph datasets. 相似文献
38.
Juyong Zhang Chunlin Wu Jianfei Cai Jianmin Zheng Xue‐cheng Tai 《Computer Graphics Forum》2010,29(2):517-526
This paper considers the problem of interactively finding the cutting contour to extract components from a given mesh. Some existing methods support cuts of arbitrary shape but require careful and tedious input from the user. Others need little user input however they are sensitive to user input and need a postprocessing step to smooth the generated jaggy cutting contours. The popular geometric snake can be used to optimize the cutting contour, but it cannot deal with the topology change. In this paper, we propose a geodesic curvature flow based framework to overcome all these problems. Since in many cases the meaningful cutting contour on a 3D mesh is locally shortest in the sense of some weighted curve length, the geodesic curvature flow is an ideal tool for our problem. It evolves the cutting contour to the nearby local minimum. We should mention that the previous numerical scheme, discretized geodesic curvature flow (dGCF) is too slow and has not been applied to mesh segmentation. With a careful observation to dGCF, we devise here a fast computation scheme called fast geodesic curvature flow (FGCF), which only needs to solve a smaller and easier problem. The initial cutting contour is generated by a variant of random walks algorithm, which is very fast and gives reasonable cutting result with little user input. Experiment results on the benchmark mesh segmentation data set show that our proposed framework is robust to user input and capable of producing good results reflecting geometric features and human shape perception. 相似文献
39.
We present a new intuitive UI, which we call cross‐boundary brushes, for interactive mesh decomposition. The user roughly draws one or more strokes across a desired cut and our system automatically returns a best cut running through all the strokes. By the different natures of part components (i.e., semantic parts) and patch components (i.e., flatter surface patches) in general models, we design two corresponding brushes: part‐brush and patch‐brush. These two types of brushes share a common user interface, enabling easy switch between them. The part‐brush executes a cut along an isoline of a harmonic field driven by the user‐specified strokes. We show that the inherent smoothness of the harmonic field together with a carefully designed isoline selection scheme lead to segmentation results that are insensitive to noise, pose, tessellation and variation in user's strokes. Our patch‐brush uses a novel facet‐based surface metric that alleviates sensitivity to noise and fine details common in region‐growing algorithms. Extensive experimental results demonstrate that our cutting tools can produce user‐desired segmentations for a wide variety of models even with single strokes. We also show that our tools outperform the state‐of‐art interactive segmentation tools in terms of ease of use and segmentation quality. 相似文献
40.
By modeling mass transfer phenomena, we simulate solids and liquids dissolving or changing to other substances. We also deal with the very small‐scale phenomena that occur when a fluid spreads out at the interface of another fluid. We model the pressure at the interfaces between fluids with Darcy's Law and represent the viscous fingering phenomenon in which a fluid interface spreads out with a fractal‐like shape. We use hybrid grid‐based simulation and smoothed particle hydrodynamics (SPH) to simulate intermolecular diffusion and attraction using particles at a computable scale. We have produced animations showing fluids mixing and objects dissolving. 相似文献