全文获取类型
收费全文 | 1102篇 |
免费 | 589篇 |
国内免费 | 17篇 |
专业分类
电工技术 | 96篇 |
综合类 | 27篇 |
化学工业 | 59篇 |
金属工艺 | 3篇 |
机械仪表 | 18篇 |
建筑科学 | 8篇 |
矿业工程 | 10篇 |
能源动力 | 101篇 |
轻工业 | 2篇 |
水利工程 | 5篇 |
石油天然气 | 7篇 |
武器工业 | 2篇 |
无线电 | 49篇 |
一般工业技术 | 12篇 |
冶金工业 | 7篇 |
原子能技术 | 1篇 |
自动化技术 | 1301篇 |
出版年
2023年 | 102篇 |
2022年 | 15篇 |
2021年 | 8篇 |
2020年 | 188篇 |
2019年 | 190篇 |
2018年 | 145篇 |
2017年 | 152篇 |
2016年 | 182篇 |
2015年 | 157篇 |
2014年 | 186篇 |
2013年 | 23篇 |
2012年 | 26篇 |
2011年 | 57篇 |
2010年 | 55篇 |
2009年 | 48篇 |
2008年 | 19篇 |
2007年 | 28篇 |
2006年 | 23篇 |
2005年 | 33篇 |
2004年 | 12篇 |
2003年 | 18篇 |
2002年 | 11篇 |
2001年 | 3篇 |
2000年 | 10篇 |
1999年 | 4篇 |
1998年 | 1篇 |
1996年 | 4篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1993年 | 2篇 |
1991年 | 1篇 |
1989年 | 2篇 |
1988年 | 1篇 |
排序方式: 共有1708条查询结果,搜索用时 296 毫秒
21.
Capturing exposure sequences to compute high dynamic range (HDR) images causes motion blur in cases of camera movement. This also applies to light‐field cameras: frames rendered from multiple blurred HDR light‐field perspectives are also blurred. While the recording times of exposure sequences cannot be reduced for a single‐sensor camera, we demonstrate how this can be achieved for a camera array. Thus, we decrease capturing time and reduce motion blur for HDR light‐field video recording. Applying a spatio‐temporal exposure pattern while capturing frames with a camera array reduces the overall recording time and enables the estimation of camera movement within one light‐field video frame. By estimating depth maps and local point spread functions (PSFs) from multiple perspectives with the same exposure, regional motion deblurring can be supported. Missing exposures at various perspectives are then interpolated. 相似文献
22.
23.
Kaiyu Zhao Matthew O. Ward Elke A. Rundensteiner Huong N. Higgins 《Computer Graphics Forum》2014,33(3):331-340
Linear models are commonly used to identify trends in data. While it is an easy task to build linear models using pre‐selected variables, it is challenging to select the best variables from a large number of alternatives. Most metrics for selecting variables are global in nature, and thus not useful for identifying local patterns. In this work, we present an integrated framework with visual representations that allows the user to incrementally build and verify models in three model spaces that support local pattern discovery and summarization: model complementarity, model diversity, and model representivity. Visual representations are designed and implemented for each of the model spaces. Our visualizations enable the discovery of complementary variables, i.e., those that perform well in modeling different subsets of data points. They also support the isolation of local models based on a diversity measure. Furthermore, the system integrates a hierarchical representation to identify the outlier local trends and the local trends that share similar directions in the model space. A case study on financial risk analysis is discussed, followed by a user study. 相似文献
24.
There is increasing evidence that user characteristics can have a significant impact on visualization effectiveness, suggesting that visualizations could be designed to better fit each user's specific needs. Most studies to date, however, have looked at static visualizations. Studies considering interactive visualizations have only looked at a limited number of user characteristics, and consider either low‐level tasks (e.g., value retrieval), or high‐level tasks (in particular: discovery), but not both. This paper contributes to this line of work by looking at the impact of a large set of user characteristics on user performance with interactive visualizations, for both low and high‐level tasks. We focus on interactive visualizations that support decision making, exemplified by a visualization known as Value Charts. We include in the study two versions of ValueCharts that differ in terms of layout, to ascertain whether layout mediates the impact of individual differences and could be considered as a form of personalization. Our key findings are that (i) performance with low and high‐level tasks is affected by different user characteristics, and (ii) users with low visual working memory perform better with a horizontal layout. We discuss how these findings can inform the provision of personalized support to visualization processing. 相似文献
25.
M. Schulze J. Martinez Esturo T. Günther C. Rössl H.‐P. Seidel T. Weinkauf H. Theisel 《Computer Graphics Forum》2014,33(3):1-10
Stream surfaces are a well‐studied and widely used tool for the visualization of 3D flow fields. Usually, stream surface seeding is carried out manually in time‐consuming trial and error procedures. Only recently automatic selection methods were proposed. Local methods support the selection of a set of stream surfaces, but, contrary to global selection methods, they evaluate only the quality of the seeding lines but not the quality of the whole stream surfaces. Global methods, on the other hand, only support the selection of a single optimal stream surface until now. However, for certain flow fields a single stream surface is not sufficient to represent all flow features. In our work, we overcome this limitation by introducing a global selection technique for a set of stream surfaces. All selected surfaces optimize global stream surface quality measures and are guaranteed to be mutually distant, such that they can convey different flow features. Our approach is an efficient extension of the most recent global selection method for single stream surfaces. We illustrate its effectiveness on a number of analytical and simulated flow fields and analyze the quality of the results in a user study. 相似文献
26.
In the literature on optimal regular volume sampling, the Body‐Centered Cubic (BCC) lattice has been proven to be optimal for sampling spherically band‐limited signals above the Nyquist limit. On the other hand, if the sampling frequency is below the Nyquist limit, the Face‐Centered Cubic (FCC) lattice was demonstrated to be optimal in reducing the prealiasing effect. In this paper, we confirm that the FCC lattice is indeed optimal in this sense in a certain interval of the sampling frequency. By theoretically estimating the prealiasing error in a realistic range of the sampling frequency, we show that in other frequency intervals, the BCC lattice and even the traditional Cartesian Cubic (CC) lattice are expected to minimize the prealiasing. The BCC lattice is superior over the FCC lattice if the sampling frequency is not significantly below the Nyquist limit. Interestingly, if the original signal is drastically undersampled, the CC lattice is expected to provide the lowest prealiasing error. Additionally, we give a comprehensible clarification that the sampling efficiency of the FCC lattice is lower than that of the BCC lattice. Although this is a well‐known fact, the exact percentage has been erroneously reported in the literature. Furthermore, for the sake of an unbiased comparison, we propose to rotate the Marschner‐Lobb test signal such that an undue advantage is not given to either lattice. 相似文献
27.
We address the problem of robust and efficient treatment of element collapse and inversion in corotational FEM simulations of deformable objects in two and three dimensions, and show that existing degeneration treatment methods have previously unreported flaws that seriously threaten robustness and physical plausibility in interactive applications. We propose a new method that avoids such flaws, yields faster and smoother degeneration recovery and extends the range of well‐behaved degenerate configurations without adding significant complexity or computational cost to standard explicit and quasi‐implicit solvers. 相似文献
28.
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. 相似文献
29.
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. 相似文献
30.
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. 相似文献