全文获取类型
收费全文 | 622篇 |
免费 | 99篇 |
国内免费 | 16篇 |
专业分类
综合类 | 17篇 |
化学工业 | 3篇 |
金属工艺 | 5篇 |
机械仪表 | 23篇 |
建筑科学 | 19篇 |
矿业工程 | 2篇 |
能源动力 | 1篇 |
轻工业 | 5篇 |
无线电 | 66篇 |
一般工业技术 | 19篇 |
冶金工业 | 6篇 |
原子能技术 | 2篇 |
自动化技术 | 569篇 |
出版年
2025年 | 2篇 |
2023年 | 3篇 |
2021年 | 2篇 |
2020年 | 5篇 |
2019年 | 10篇 |
2018年 | 27篇 |
2017年 | 40篇 |
2016年 | 51篇 |
2015年 | 47篇 |
2014年 | 49篇 |
2013年 | 27篇 |
2012年 | 37篇 |
2011年 | 60篇 |
2010年 | 46篇 |
2009年 | 44篇 |
2008年 | 39篇 |
2007年 | 30篇 |
2006年 | 21篇 |
2005年 | 20篇 |
2004年 | 21篇 |
2003年 | 9篇 |
2002年 | 10篇 |
2001年 | 11篇 |
2000年 | 11篇 |
1999年 | 13篇 |
1998年 | 17篇 |
1997年 | 9篇 |
1996年 | 3篇 |
1995年 | 5篇 |
1994年 | 3篇 |
1993年 | 11篇 |
1992年 | 5篇 |
1991年 | 3篇 |
1988年 | 4篇 |
1987年 | 3篇 |
1985年 | 6篇 |
1984年 | 1篇 |
1983年 | 2篇 |
1982年 | 1篇 |
1981年 | 4篇 |
1980年 | 3篇 |
1979年 | 7篇 |
1978年 | 4篇 |
1977年 | 1篇 |
1976年 | 1篇 |
1974年 | 2篇 |
1973年 | 2篇 |
1964年 | 1篇 |
1962年 | 1篇 |
1954年 | 1篇 |
排序方式: 共有737条查询结果,搜索用时 15 毫秒
11.
Streamgraphs were popularized in 2008 when The New York Times used them to visualize box office revenues for 7500 movies over 21 years. The aesthetics of a streamgraph is affected by three components: the ordering of the layers, the shape of the lowest curve of the drawing, known as the baseline, and the labels for the layers. As of today, the ordering and baseline computation algorithms proposed in the paper of Byron and Wattenberg are still considered the state of the art. However, their ordering algorithm exploits statistical properties of the movie revenue data that may not hold in other data . In addition, the baseline optimization is based on a definition of visual energy that in some cases results in considerable amount of visual distortion. We offer an ordering algorithm that works well regardless of the properties of the input data , and propose a 1‐norm based definition of visual energy and the associated solution method that overcomes the limitation of the original baseline optimization procedure. Furthermore, we propose an efficient layer labeling algorithm that scales linearly to the data size in place of the brute‐force algorithm adopted by Byron and Wattenberg. We demonstrate the advantage of our algorithms over existing techniques on a number of real world data sets. 相似文献
13.
This paper proposes a patch‐based texture synthesis approach that cuts and stitches irregularly shaped texture patches to generate new texture images with minimized visual discontinuity. It works well on a wide range of textures. A semiautomatic algorithm is developed to obtain the irregularly shaped patches. To synthesize strictly structured textures, a regular pasting method is proposed to identify the texture structures and subsequently position the irregularly shaped patches according to the identified structures. The results and comparisons with related work are given. 相似文献
14.
Accurate depth estimation is a challenging, yet essential step in the conversion of a 2D image sequence to a 3D stereo sequence. We present a novel approach to construct a temporally coherent depth map for each image in a sequence. The quality of the estimated depth is high enough for the purpose of2D to 3D stereo conversion. Our approach first combines the video sequence into a panoramic image. A user can scribble on this single panoramic image to specify depth information. The depth is then propagated to the remainder of the panoramic image. This depth map is then remapped to the original sequence and used as the initial guess for each individual depth map in the sequence. Our approach greatly simplifies the required user interaction during the assignment of the depth and allows for relatively free camera movement during the generation of a panoramic image. We demonstrate the effectiveness of our method by showing stereo converted sequences with various camera motions. 相似文献
15.
Henning Gruendl Patrick Riehmann Yves Pausch Bernd Froehlich 《Computer Graphics Forum》2016,35(3):321-330
We present a natural extension of two‐dimensional parallel‐coordinates plots for revealing relationships in time‐dependent multi‐attribute data by building on the idea that time can be considered as the third dimension. A time slice through the visualization represents a certain point in time and can be viewed as a regular parallel‐coordinates display. A vertical slice through one of the axes of the parallel‐coordinates display would show a time‐series plot. For a focus‐and‐context Integration of both views, we embed time‐series plots between two adjacent axes of the parallel‐coordinates plot. Both time‐series plots are drawn using a pseudo three‐dimensional perspective with a single vanishing point. An independent parallel‐coordinates panel that connects the two perspectively displayed time‐series plots can move forward and backward in time to reveal changes in the relationship between the time‐dependent attributes. The visualization of time‐series plots in the context of the parallel‐coordinates plot facilitates the exploration of time‐related aspects of the data without the need to switch to a separate display. We provide a consistent set of tools for selecting and contrasting subsets of the data, which are important for various application domains. 相似文献
16.
3D box splines are defined by convolving a 1D box function with itself along different directions. In volume visualization, box splines are mainly used as reconstruction kernels that are easy to adapt to various sampling lattices, such as the Cartesian Cubic (CC), Body‐Centered Cubic (BCC), and Face‐Centered Cubic (FCC) lattices. The usual way of tailoring a box spline to a specific lattice is to span the box spline by exactly those principal directions that span the lattice itself. However, in this case, the preferred directions of the box spline and the lattice are the same, amplifying the anisotropic effects of each other. This leads to an anisotropic volume representation with strongly preferred directions. Therefore, in this paper, we retailor box splines to lattices such that the sets of vectors that span the box spline and the lattice are disjoint sets. As the preferred directions of the box spline and the lattice compensate each other, a more isotropic volume representation can be achieved. We demonstrate this by comparing different combinations of box splines and lattices concerning their anisotropic behavior in tomographic reconstruction and volume visualization. 相似文献
17.
Masanori Kakimoto Kaoru Matsuoka Tomoyuki Nishita Takeshi Naemura Hiroshi Harashima 《Computer Graphics Forum》2005,24(2):185-193
This paper proposes a novel and general method of glare generation based on wave optics. A glare image is regarded as a result of Fraunhofer diffraction, which is equivalent to a 2D Fourier transform of the image of given apertures or obstacles. In conventional methods, the shapes of glare images are categorized according to their source apertures, such as pupils and eyelashes and their basic shapes (e.g. halos, coronas, or radial streaks) are manually generated as templates, mainly based on statistical observation. Realistic variations of these basic shapes often depend on the use of random numbers. Our proposed method computes glare images fully automatically from aperture images and can be applied universally to all kinds of apertures, including camera diaphragms. It can handle dynamic changes in the position of the aperture relative to the light source, which enables subtle movement or rotation of glare streaks. Spectra can also be simulated in the glare, since the intensity of diffraction depends on the wavelength of light. The resulting glare image is superimposed onto a given computer‐generated image containing high‐intensity light sources or reflections, aligning the center of the glare image to the high‐intensity areas. Our method is implemented as a multipass rendering software. By precomputing the dynamic glare image set and putting it into texture memory, the software runs at an interactive rate. 相似文献
18.
We propose a personality trait exaggeration system emphasizing the impression of human face in images, based on multi‐level features learning and exaggeration. These features are called Personality Trait Model (PTM). Abstract level of PTM is social psychology trait of face perception such as amiable, mean, cute and so on. Concrete level of PTM is shape feature and texture feature. A training phase is presented to learn multi‐level features of faces from different images. Statistical survey is taken to label sample images with people's first impressions. From images with the same labels, we capture not only shape features but also texture features to enhance exaggeration effect. Texture feature is expressed by matrix to reflect depth of facial organs, wrinkles and so on. In application phase, original images will be exaggerated using PTM iteratively. And exaggeration rate for each iteration is constrained to keep likeness with the original face. Experimental results demonstrate that our system can emphasize chosen social psychology traits effectively. 相似文献
19.
Texture atlases are commonly used as representations for mesh parameterizations in numerous applications including texture and normal mapping. Therefore, packing is an important post‐processing step that tries to place and orient the single parameterizations in a way that the available space is used as efficiently as possible. However, since packing is NP hard, only heuristics can be used in practice to find near‐optimal solutions. In this publication we introduce the new search space of modulo valid packings. The key idea thereby is to allow the texture charts to wrap around in the atlas. By utilizing this search space we propose a new algorithm that can be used in order to automatically pack texture atlases. In the evaluation section we show that our algorithm achieves solutions with a significantly higher packing efficiency when compared to the state of the art, especially for complex packing problems. 相似文献
20.
Linear Discriminative Star Coordinates for Exploring Class and Cluster Separation of High Dimensional Data
下载免费PDF全文

Yunhai Wang Jingting Li Feiping Nie Holger Theisel Minglun Gong Dirk J. Lehmann 《Computer Graphics Forum》2017,36(3):401-410
One main task for domain experts in analysing their nD data is to detect and interpret class/cluster separations and outliers. In fact, an important question is, which features/dimensions separate classes best or allow a cluster‐based data classification. Common approaches rely on projections from nD to 2D, which comes with some challenges, such as: The space of projection contains an infinite number of items. How to find the right one? The projection approaches suffers from distortions and misleading effects. How to rely to the projected class/cluster separation? The projections involve the complete set of dimensions/features. How to identify irrelevant dimensions? Thus, to address these challenges, we introduce a visual analytics concept for the feature selection based on linear discriminative star coordinates (DSC), which generate optimal cluster separating views in a linear sense for both labeled and unlabeled data. This way the user is able to explore how each dimension contributes to clustering. To support to explore relations between clusters and data dimensions, we provide a set of cluster‐aware interactions allowing to smartly iterate through subspaces of both records and features in a guided manner. We demonstrate our features selection approach for optimal cluster/class separation analysis with a couple of experiments on real‐life benchmark high‐dimensional data sets. 相似文献