全文获取类型
收费全文 | 1854篇 |
免费 | 485篇 |
国内免费 | 31篇 |
专业分类
电工技术 | 13篇 |
综合类 | 70篇 |
化学工业 | 65篇 |
金属工艺 | 16篇 |
机械仪表 | 60篇 |
建筑科学 | 249篇 |
矿业工程 | 21篇 |
能源动力 | 63篇 |
轻工业 | 54篇 |
水利工程 | 11篇 |
石油天然气 | 165篇 |
武器工业 | 3篇 |
无线电 | 84篇 |
一般工业技术 | 45篇 |
冶金工业 | 17篇 |
原子能技术 | 15篇 |
自动化技术 | 1419篇 |
出版年
2024年 | 1篇 |
2023年 | 7篇 |
2022年 | 10篇 |
2021年 | 27篇 |
2020年 | 14篇 |
2019年 | 25篇 |
2018年 | 61篇 |
2017年 | 144篇 |
2016年 | 197篇 |
2015年 | 170篇 |
2014年 | 210篇 |
2013年 | 71篇 |
2012年 | 68篇 |
2011年 | 78篇 |
2010年 | 61篇 |
2009年 | 76篇 |
2008年 | 93篇 |
2007年 | 116篇 |
2006年 | 95篇 |
2005年 | 75篇 |
2004年 | 57篇 |
2003年 | 143篇 |
2002年 | 127篇 |
2001年 | 112篇 |
2000年 | 90篇 |
1999年 | 59篇 |
1998年 | 40篇 |
1997年 | 32篇 |
1996年 | 36篇 |
1995年 | 18篇 |
1994年 | 11篇 |
1993年 | 6篇 |
1992年 | 6篇 |
1991年 | 15篇 |
1990年 | 3篇 |
1989年 | 6篇 |
1988年 | 3篇 |
1987年 | 2篇 |
1982年 | 1篇 |
1980年 | 1篇 |
1978年 | 1篇 |
1966年 | 1篇 |
1961年 | 1篇 |
排序方式: 共有2370条查询结果,搜索用时 15 毫秒
21.
Modern MRI measurements deliver volumetric and time‐varying blood‐flow data of unprecedented quality. Visual analysis of these data potentially leads to a better diagnosis and risk assessment of various cardiovascular diseases. Recent advances have improved the speed and quality of the imaging data considerably. Nevertheless, the data remains compromised by noise and a lack of spatiotemporal resolution. Besides imaging data, also numerical simulations are employed. These are based on mathematical models of specific features of physical reality. However, these models require realistic parameters and boundary conditions based on measurements. We propose to use data assimilation to bring measured data and physically‐based simulation together, and to harness the mutual benefits. The accuracy and noise robustness of the coupled approach is validated using an analytic flow field. Furthermore, we present a comparative visualization that conveys the differences between using conventional interpolation and our coupled approach. 相似文献
22.
We present a novel approach to recording and computing panorama light fields. In contrast to previous methods that estimate panorama light fields from focal stacks or naive multi‐perspective image stitching, our approach is the first that processes ray entries directly and does not require depth reconstruction or matching of image features. Arbitrarily complex scenes can therefore be captured while preserving correct occlusion boundaries, anisotropic reflections, refractions, and other light effects that go beyond diffuse reflections of Lambertian surfaces. 相似文献
23.
Zhichao Huang Junfeng Yao Zichun Zhong Yang Liu Xiaohu Guo 《Computer Graphics Forum》2014,33(7):239-248
Sparse localized decomposition is a useful technique to extract meaningful deformation components out of a training set of mesh data. However, existing methods cannot capture large rotational motion in the given mesh dataset. In this paper we present a new decomposition technique based on deformation gradients. Given a mesh dataset, the deformation gradient field is extracted, and decomposed into two groups: rotation field and stretching field, through polar decomposition. These two groups of deformation information are further processed through the sparse localized decomposition into the desired components. These sparse localized components can be linearly combined to form a meaningful deformation gradient field, and can be used to reconstruct the mesh through a least squares optimization step. Our experiments show that the proposed method addresses the rotation problem associated with traditional deformation decomposition techniques, making it suitable to handle not only stretched deformations, but also articulated motions that involve large rotations. 相似文献
24.
Zhenbao Liu Sicong Tang Weiwei Xu Shuhui Bu Junwei Han Kun Zhou 《Computer Graphics Forum》2014,33(7):269-278
Since indoor scenes are frequently changed in daily life, such as re‐layout of furniture, the 3D reconstructions for them should be flexible and easy to update. We present an automatic 3D scene update algorithm to indoor scenes by capturing scene variation with RGBD cameras. We assume an initial scene has been reconstructed in advance in manual or other semi‐automatic way before the change, and automatically update the reconstruction according to the newly captured RGBD images of the real scene update. It starts with an automatic segmentation process without manual interaction, which benefits from accurate labeling training from the initial 3D scene. After the segmentation, objects captured by RGBD camera are extracted to form a local updated scene. We formulate an optimization problem to compare to the initial scene to locate moved objects. The moved objects are then integrated with static objects in the initial scene to generate a new 3D scene. We demonstrate the efficiency and robustness of our approach by updating the 3D scene of several real‐world scenes. 相似文献
25.
We present a data‐driven method for automatically recoloring a photo to enhance its appearance or change a viewer's emotional response to it. A compact representation called a RegionNet summarizes color and geometric features of image regions, and geometric relationships between them. Correlations between color property distributions and geometric features of regions are learned from a database of well‐colored photos. A probabilistic factor graph model is used to summarize distributions of color properties and generate an overall probability distribution for color suggestions. Given a new input image, we can generate multiple recolored results which unlike previous automatic results, are both natural and artistic, and compatible with their spatial arrangements. 相似文献
26.
Markus Steinberger Michael Kenzel Bernhard Kainz Peter Wonka Dieter Schmalstieg 《Computer Graphics Forum》2014,33(2):105-114
In this paper, we present a new approach for shape‐grammar‐based generation and rendering of huge cities in real‐time on the graphics processing unit (GPU). Traditional approaches rely on evaluating a shape grammar and storing the geometry produced as a preprocessing step. During rendering, the pregenerated data is then streamed to the GPU. By interweaving generation and rendering, we overcome the problems and limitations of streaming pregenerated data. Using our methods of visibility pruning and adaptive level of detail, we are able to dynamically generate only the geometry needed to render the current view in real‐time directly on the GPU. We also present a robust and efficient way to dynamically update a scene's derivation tree and geometry, enabling us to exploit frame‐to‐frame coherence. Our combined generation and rendering is significantly faster than all previous work. For detailed scenes, we are capable of generating geometry more rapidly than even just copying pregenerated data from main memory, enabling us to render cities with thousands of buildings at up to 100 frames per second, even with the camera moving at supersonic speed. 相似文献
27.
Symmetry is a common characteristic in natural and man‐made objects. Its ubiquitous nature can be exploited to facilitate the analysis and processing of computational representations of real objects. In particular, in computer graphics, the detection of symmetries in 3D geometry has enabled a number of applications in modeling and reconstruction. However, the problem of symmetry detection in incomplete geometry remains a challenging task. In this paper, we propose a vote‐based approach to detect symmetry in 3D shapes, with special interest in models with large missing parts. Our algorithm generates a set of candidate symmetries by matching local maxima of a surface function based on the heat diffusion in local domains, which guarantee robustness to missing data. In order to deal with local perturbations, we propose a multi‐scale surface function that is useful to select a set of distinctive points over which the approximate symmetries are defined. In addition, we introduce a vote‐based scheme that is aware of the partiality, and therefore reduces the number of false positive votes for the candidate symmetries. We show the effectiveness of our method in a varied set of 3D shapes and different levels of partiality. Furthermore, we show the applicability of our algorithm in the repair and completion of challenging reassembled objects in the context of cultural heritage. 相似文献
28.
Visual cryptography is an encryption technique that hides a secret image by distributing it between some shared images made up of seemingly random black‐and‐white pixels. Extended visual cryptography (EVC) goes further in that the shared images instead represent meaningful binary pictures. The original approach to EVC suffered from low contrast, so later papers considered how to improve the visual quality of the results by enhancing contrast of the shared images. This work further improves the appearance of the shared images by preserving edge structures within them using a framework of dithering followed by a detail recovery operation. We are also careful to suppress noise in smooth areas. 相似文献
29.
Jens Cornelis Markus Ihmsen Andreas Peer Matthias Teschner 《Computer Graphics Forum》2014,33(2):255-262
We propose to use Implicit Incompressible Smoothed Particle Hydrodynamics (IISPH) for pressure projection and boundary handling in Fluid‐Implicit‐Particle (FLIP) solvers for the simulation of incompressible fluids. This novel combination addresses two issues of existing SPH and FLIP solvers, namely mass preservation in FLIP and efficiency and memory consumption in SPH. First, the SPH component enables the simulation of incompressible fluids with perfect mass preservation. Second, the FLIP component efficiently enriches the SPH component with detail that is comparable to a standard SPH simulation with the same number of particles, while improving the performance by a factor of 7 and significantly reducing the memory consumption. We demonstrate that the proposed IISPH‐FLIP solver can simulate incompressible fluids with a quantifiable, imperceptible density deviation below 0.1%. We show large‐scale scenarios with up to 160 million particles that have been processed on a single desktop PC using only 15GB of memory. One‐ and two‐way coupled solids are illustrated. 相似文献
30.
Visualization of pathlines is common and highly relevant for the analysis of unsteady flow. However, pathlines can intersect, leading to visual clutter and perceptual issues. This makes it intrinsically difficult to provide expressive visualizations of the entire domain by an arrangement of multiple pathlines, in contrast to well‐established streamline placement techniques. We present an approach to reduce these problems. It is inspired by glyph‐based visualization and small multiples: we partition the domain into cells, each corresponding to a downscaled version of the entire domain. Inside these cells, a single downscaled pathline is drawn. On the overview scale, our pathline glyphs lead to emergent visual patterns that provide insight into time‐dependent flow behavior. Zooming‐in allows us to analyze individual pathlines in detail and compare neighboring lines. The overall approach is complemented with a context‐preserving zoom lens and interactive pathline‐based exploration. While we primarily target the visualization of 2D flow, we also address the extension to 3D. Our evaluation includes several examples, comparison to other flow visualization techniques, and a user study with domain experts. 相似文献