全文获取类型
收费全文 | 225569篇 |
免费 | 19549篇 |
国内免费 | 10008篇 |
专业分类
电工技术 | 14123篇 |
技术理论 | 30篇 |
综合类 | 22434篇 |
化学工业 | 27816篇 |
金属工艺 | 10885篇 |
机械仪表 | 13695篇 |
建筑科学 | 30847篇 |
矿业工程 | 12803篇 |
能源动力 | 8353篇 |
轻工业 | 16433篇 |
水利工程 | 10603篇 |
石油天然气 | 11999篇 |
武器工业 | 3240篇 |
无线电 | 14172篇 |
一般工业技术 | 17514篇 |
冶金工业 | 11713篇 |
原子能技术 | 1703篇 |
自动化技术 | 26763篇 |
出版年
2024年 | 1032篇 |
2023年 | 3008篇 |
2022年 | 5674篇 |
2021年 | 7465篇 |
2020年 | 7277篇 |
2019年 | 5487篇 |
2018年 | 5223篇 |
2017年 | 6534篇 |
2016年 | 7868篇 |
2015年 | 8543篇 |
2014年 | 15299篇 |
2013年 | 13946篇 |
2012年 | 15922篇 |
2011年 | 17853篇 |
2010年 | 13143篇 |
2009年 | 13400篇 |
2008年 | 12280篇 |
2007年 | 14877篇 |
2006年 | 13518篇 |
2005年 | 11764篇 |
2004年 | 9788篇 |
2003年 | 8571篇 |
2002年 | 6994篇 |
2001年 | 5801篇 |
2000年 | 4925篇 |
1999年 | 3900篇 |
1998年 | 2796篇 |
1997年 | 2450篇 |
1996年 | 1997篇 |
1995年 | 1639篇 |
1994年 | 1382篇 |
1993年 | 986篇 |
1992年 | 793篇 |
1991年 | 552篇 |
1990年 | 484篇 |
1989年 | 445篇 |
1988年 | 247篇 |
1987年 | 192篇 |
1986年 | 163篇 |
1985年 | 186篇 |
1984年 | 135篇 |
1983年 | 116篇 |
1982年 | 61篇 |
1981年 | 78篇 |
1980年 | 82篇 |
1979年 | 37篇 |
1978年 | 21篇 |
1977年 | 22篇 |
1975年 | 16篇 |
1959年 | 25篇 |
排序方式: 共有10000条查询结果,搜索用时 16 毫秒
971.
Motion capture cannot generate cartoon‐style animation directly. We emulate the rubber‐like exaggerations common in traditional character animation as a means of converting motion capture data into cartoon‐like movement. We achieve this using trajectory‐based motion exaggeration while allowing the violation of link‐length constraints. We extend this technique to obtain smooth, rubber‐like motion by dividing the original links into shorter sub‐links and computing the positions of joints using Bézier curve interpolation and a mass‐spring simulation. This method is fast enough to be used in real time. 相似文献
972.
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. 相似文献
973.
We present an approach for extracting extremal feature lines of scalar indicators on surface meshes, based on discrete Morse Theory. By computing initial Morse‐Smale complexes of the scalar indicators of the mesh, we obtain a candidate set of extremal feature lines of the surface. A hierarchy of Morse‐Smale complexes is computed by prioritizing feature lines according to a novel criterion and applying a cancellation procedure that allows us to select the most significant lines. Given the scalar indicators on the vertices of the mesh, the presented feature line extraction scheme is interpolation free and needs no derivative estimates. The technique is insensitive to noise and depends only on one parameter: the feature significance. We use the technique to extract surface features yielding impressive, non photorealistic images. 相似文献
974.
In this paper we introduce the constrained tetrahedralization as a new acceleration structure for ray tracing. A constrained tetrahedralization of a scene is a tetrahedralization that respects the faces of the scene geometry. The closest intersection of a ray with a scene is found by traversing this tetrahedralization along the ray, one tetrahedron at a time. We show that constrained tetrahedralizations are a viable alternative to current acceleration structures, and that they have a number of unique properties that set them apart from other acceleration structures: constrained tetrahedralizations are not hierarchical yet adaptive; the complexity of traversing them is a function of local geometric complexity rather than global geometric complexity; constrained tetrahedralizations support deforming geometry without any effort; and they have the potential to unify several data structures currently used in global illumination. 相似文献
975.
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. 相似文献
976.
The paper describes a technique to generate high‐quality light field representations from volumetric data. We show how light field galleries can be created to give unexperienced audiences access to interactive high‐quality volume renditions. The proposed light field representation is lightweight with respect to storage and bandwidth capacity and is thus ideal as exchange format for visualization results, especially for web galleries. The approach expands an existing sphere‐hemisphere parameterization for the light field with per‐pixel depth. High‐quality paraboloid maps from volumetric data are generated using GPU‐based ray‐casting or slicing approaches. Different layers, such as isosurfaces, but not restricted to, can be generated independently and composited in real time. This allows the user to interactively explore the model and to change visibility parameters at run‐time. 相似文献
977.
Ming Hao Daniel A. Keim Umeshwar Dayal Daniela Oelke Chantal Tremblay 《Computer Graphics Forum》2008,27(3):895-902
In many business applications, large data workloads such as sales figures or process performance measures need to be monitored in real‐time. The data analysts want to catch problems in flight to reveal the root cause of anomalies. Immediate actions need to be taken before the problems become too expensive or consume too many resources. In the meantime, analysts need to have the “big picture” of what the information is about. In this paper, we derive and analyze two real‐time visualization techniques for managing density displays: (1) circular overlay d isplays which visualize large volumes of data without data shift movements after the display is full, thus freeing the analyst from adjusting the mental picture of the data after each data shift; and (2) variable resolution density displays which allow users to get the entire view without cluttering. We evaluate these techniques with respect to a number of evaluation measures, such as constancy of the display and usage of display space, and compare them to conventional d isplays with periodic shifts. Our real time data monitoring system also provides advanced interactions such as a local root cause analysis for further exploration. The applications using a number of real‐world data sets show the wide applicability and usefulness of our ideas. 相似文献
978.
Miloš Hašan Edgar Velázquez‐Armendáriz Fabio Pellacini Kavita Bala 《Computer Graphics Forum》2008,27(4):1105-1114
Rendering animations of scenes with deformable objects, camera motion, and complex illumination, including indirect lighting and arbitrary shading, is a long‐standing challenge. Prior work has shown that complex lighting can be accurately approximated by a large collection of point lights. In this formulation, rendering of animation sequences becomes the problem of efficiently shading many surface samples from many lights across several frames. This paper presents a tensor formulation of the animated many‐light problem, where each element of the tensor expresses the contribution of one light to one pixel in one frame. We sparsely sample rows and columns of the tensor, and introduce a clustering algorithm to select a small number of representative lights to efficiently approximate the animation. Our algorithm achieves efficiency by reusing representatives across frames, while minimizing temporal flicker. We demonstrate our algorithm in a variety of scenes that include deformable objects, complex illumination and arbitrary shading and show that a surprisingly small number of representative lights is sufficient for high quality rendering. We believe out algorithm will find practical use in applications that require fast previews of complex animation. 相似文献
979.
A hidden‐picture puzzle contains objects hidden in a background image, in such a way that each object fits closely into a local region of the background. Our system converts image of the background and objects into line drawing, and then finds places in which to hide transformed versions of the objects using rotation‐invariant shape context matching. During the hiding process, each object is subjected to a slight deformation to enhance its similarity to the background. The results were assessed by a panel of puzzle‐solvers. 相似文献
980.
An Example-based Procedural System for Element Arrangement 总被引:2,自引:0,他引:2
We present a method for synthesizing two dimensional (2D) element arrangements from an example. The main idea is to combine texture synthesis techniques based‐on a local neighborhood comparison and procedural modeling systems based‐on local growth. Given a user‐specified reference pattern, our system analyzes neigh‐borhood information of each element by constructing connectivity. Our synthesis process starts with a single seed and progressively places elements one by one by searching a reference element which has local features that are the most similar to the target place of the synthesized pattern. To support creative design activities, we introduce three types of interaction for controlling global features of the resulting pattern, namely a spray tool, a flow field tool, and a boundary tool. We also introduce a global optimization process that helps to avoid local error concentrations. We illustrate the feasibility of our method by creating several types of 2D patterns. 相似文献