全文获取类型
收费全文 | 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条查询结果,搜索用时 31 毫秒
41.
Michael Birsak Przemyslaw Musialski Peter Wonka Michael Wimmer 《Computer Graphics Forum》2014,33(2):449-458
We present a novel framework for the automatic generation of tourist brochures that include routing instructions and additional information presented in the form of so‐called detail lenses. The first contribution of this paper is the automatic creation of layouts for the brochures. Our approach is based on the minimization of an energy function that combines multiple goals: positioning of the lenses as close as possible to the corresponding region shown in an overview map, keeping the number of lenses low, and an efficient numbering of the lenses. The second contribution is a route‐aware simplification of the graph of streets used for traveling between the points of interest (POIs). This is done by reducing the graph consisting of all shortest paths through the minimization of an energy function. The output is a subset of street segments that enable traveling between all the POIs without considerable detours, while at the same time guaranteeing a clutter‐free visualization. 相似文献
42.
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. 相似文献
43.
The selection of meaningful lines for 3D line data visualization has been intensively researched in recent years. Most approaches focus on single line fields where one line passes through each domain point. This paper presents a selection approach for sets of line fields which is based on a global optimization of the opacity of candidate lines. For this, existing approaches for single line fields are modified such that significantly larger amounts of line representatives are handled. Furthermore, time coherence is addressed for animations, making this the first approach that solves the line selection problem for 3D time‐dependent flow. We apply our technique to visualize dense sets of pathlines, sets of magnetic field lines, and animated sets of pathlines, streaklines and masslines. 相似文献
44.
45.
46.
47.
Zhige Xie Kai Xu Wen Shan Ligang Liu Yueshan Xiong Hui Huang 《Computer Graphics Forum》2015,34(7):1-11
Feature learning for 3D shapes is challenging due to the lack of natural paramterization for 3D surface models. We adopt the multi‐view depth image representation and propose Multi‐View Deep Extreme Learning Machine (MVD‐ELM) to achieve fast and quality projective feature learning for 3D shapes. In contrast to existing multi‐view learning approaches, our method ensures the feature maps learned for different views are mutually dependent via shared weights and in each layer, their unprojections together form a valid 3D reconstruction of the input 3D shape through using normalized convolution kernels. These lead to a more accurate 3D feature learning as shown by the encouraging results in several applications. Moreover, the 3D reconstruction property enables clear visualization of the learned features, which further demonstrates the meaningfulness of our feature learning. 相似文献
48.
We propose guiding vectors to augment graph‐based tree synthesis, in which trees are collections of least‐cost paths in a graph. Each node has an associated guiding vector; edges parallel to the guiding vector are cheap, but edges are more expensive when their orientation differs from the guiding vector. We further propose an incremental method for assigning guiding vectors over the graph, in which a node's guiding vector is an incremental rotation of that of its parent. We present a complete procedural system for tree modeling; our use of guiding vectors enables the graph‐based method to produce high‐quality tree models resembling a variety of real‐world tree species. 相似文献
49.
Glossy to glossy reflections are lights bounced between glossy surfaces. Such directional light transports are important for humans to perceive glossy materials, but difficult to simulate. This paper proposes a new method for rendering screen‐space glossy to glossy reflections in realtime. We use spherical von Mises‐Fisher (vMF) distributions to model glossy BRDFs at surfaces, and employ screen space directional occlusion (SSDO) rendering framework to trace indirect light transports bounced in the screen space. As our main contributions, we derive a new parameterization of vMF distribution so as to convert the non‐linear fit of multiple vMF distributions into a linear sum in the new space. Then, we present a new linear filtering technique to build MIP‐maps on glossy BRDFs, which allows us to create filtered radiance transfer functions at runtime, and efficiently estimate indirect glossy to glossy reflections. We demonstrate our method in a realtime application for rendering scenes with dynamic glossy objects. Compared with screen space directional occlusion, our approach only requires one extra texture and has a negligible overhead, 3% ~ 6% loss at frame rate, but enables glossy to glossy reflections. 相似文献
50.
We developed a visual analysis tool to support the verification, assessment, and presentation of alleged cases of plagiarism. The analysis of a suspicious document typically results in a compilation of categorized “finding spots”. The categorization reveals the way in which the suspicious text fragment was created from the source, e.g. by obfuscation, translation, or by shake and paste. We provide a three‐level approach for exploring the finding spots in context. The overview shows the relationship of the entire suspicious document to the set of source documents. A glyph‐based view reveals the structural and textual differences and similarities of a set of finding spots and their corresponding source text fragments. For further analysis and editing of the finding spot's assessment, the actual text fragments can be embedded side‐by‐side in the diffline view. The different views are tied together by versatile navigation and selection operations. Our expert reviewers confirm that our tool provides a significant improvement over existing static visualizations for assessing plagiarism cases. 相似文献