全文获取类型
收费全文 | 4509篇 |
免费 | 261篇 |
国内免费 | 55篇 |
专业分类
电工技术 | 13篇 |
综合类 | 69篇 |
化学工业 | 651篇 |
金属工艺 | 88篇 |
机械仪表 | 159篇 |
建筑科学 | 274篇 |
矿业工程 | 34篇 |
能源动力 | 321篇 |
轻工业 | 38篇 |
水利工程 | 44篇 |
石油天然气 | 13篇 |
武器工业 | 12篇 |
无线电 | 147篇 |
一般工业技术 | 434篇 |
冶金工业 | 71篇 |
原子能技术 | 51篇 |
自动化技术 | 2406篇 |
出版年
2024年 | 11篇 |
2023年 | 47篇 |
2022年 | 70篇 |
2021年 | 70篇 |
2020年 | 122篇 |
2019年 | 115篇 |
2018年 | 107篇 |
2017年 | 145篇 |
2016年 | 184篇 |
2015年 | 228篇 |
2014年 | 304篇 |
2013年 | 260篇 |
2012年 | 195篇 |
2011年 | 390篇 |
2010年 | 262篇 |
2009年 | 351篇 |
2008年 | 315篇 |
2007年 | 264篇 |
2006年 | 229篇 |
2005年 | 177篇 |
2004年 | 129篇 |
2003年 | 164篇 |
2002年 | 102篇 |
2001年 | 32篇 |
2000年 | 33篇 |
1999年 | 50篇 |
1998年 | 70篇 |
1997年 | 47篇 |
1996年 | 39篇 |
1995年 | 33篇 |
1994年 | 50篇 |
1993年 | 27篇 |
1992年 | 27篇 |
1991年 | 23篇 |
1990年 | 14篇 |
1989年 | 14篇 |
1988年 | 19篇 |
1987年 | 8篇 |
1986年 | 14篇 |
1985年 | 19篇 |
1984年 | 7篇 |
1983年 | 9篇 |
1982年 | 10篇 |
1981年 | 5篇 |
1980年 | 10篇 |
1979年 | 10篇 |
1978年 | 6篇 |
1977年 | 4篇 |
1976年 | 2篇 |
1973年 | 1篇 |
排序方式: 共有4825条查询结果,搜索用时 17 毫秒
71.
Amir Vaxman 《Computer Graphics Forum》2014,33(8):121-131
We present a novel framework for polyhedral mesh editing with face‐based projective maps that preserves planarity by definition. Such meshes are essential in the field of architectural design and rationalization. By using homogeneous coordinates to describe vertices, we can parametrize the entire shape space of planar‐preserving deformations with bilinear equations. The generality of this space allows for polyhedral geometric processing methods to be conducted with ease. We demonstrate its usefulness in planar‐quadrilateral mesh subdivision, a resulting multi‐resolution editing algorithm, and novel shape‐space exploration with prescribed transformations. Furthermore, we show that our shape space is a discretization of a continuous space of conjugate‐preserving projective transformation fields on surfaces. Our shape space directly addresses planar‐quad meshes, on which we put a focus, and we further show that our framework naturally extends to meshes with faces of more than four vertices as well. 相似文献
72.
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. 相似文献
73.
Interactive rigid body simulation is an important part of many modern computer tools, which no authoring tool nor game engine can do without. Such high‐performance computer tools open up new possibilities for changing how designers, engineers, modelers and animators work with their design problems. This paper is a self contained state‐of‐the‐art report on the physics, the models, the numerical methods and the algorithms used in interactive rigid body simulation all of which have evolved and matured over the past 20 years. Furthermore, the paper communicates the mathematical and theoretical details in a pedagogical manner. This paper is not only a stake in the sand on what has been done, it also seeks to give the reader deeper insights to help guide their future research. 相似文献
74.
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. 相似文献
75.
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. 相似文献
76.
This paper proposes a new approach for color transfer between two images. Our method is unique in its consideration of the scene illumination and the constraint that the mapped image must be within the color gamut of the target image. Specifically, our approach first performs a white‐balance step on both images to remove color casts caused by different illuminations in the source and target image. We then align each image to share the same ‘white axis’ and perform a gradient preserving histogram matching technique along this axis to match the tone distribution between the two images. We show that this illuminant‐aware strategy gives a better result than directly working with the original source and target image's luminance channel as done by many previous methods. Afterwards, our method performs a full gamut‐based mapping technique rather than processing each channel separately. This guarantees that the colors of our transferred image lie within the target gamut. Our experimental results show that this combined illuminant‐aware and gamut‐based strategy produces more compelling results than previous methods. We detail our approach and demonstrate its effectiveness on a number of examples. 相似文献
77.
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. 相似文献
78.
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. 相似文献
79.
This paper studies the Voronoi diagrams on 2‐manifold meshes based on geodesic metric (a.k.a. geodesic Voronoi diagrams or GVDs), which have polyline generators. We show that our general setting leads to situations more complicated than conventional 2D Euclidean Voronoi diagrams as well as point‐source based GVDs, since a typical bisector contains line segments, hyperbolic segments and parabolic segments. To tackle this challenge, we introduce a new concept, called local Voronoi diagram (LVD), which is a combination of additively weighted Voronoi diagram and line‐segment Voronoi diagram on a mesh triangle. We show that when restricting on a single mesh triangle, the GVD is a subset of the LVD and only two types of mesh triangles can contain GVD edges. Based on these results, we propose an efficient algorithm for constructing the GVD with polyline generators. Our algorithm runs in O(nNlogN) time and takes O(nN) space on an n‐face mesh with m generators, where N = max{m, n}. Computational results on real‐world models demonstrate the efficiency of our algorithm. 相似文献
80.
无线传感器网络中一次性数字签名算法设计 总被引:1,自引:0,他引:1
一次性数字签名算法是构造密码协议的基础算法,可用于认证无线传感器网络(WSN)中传输数据的真实性和完整性。针对WSN的应用需求,给出一种高效的一次性数字签名算法。与现有一次性签名算法相比,该算法生成签名简单快捷,只需执行一次模指数乘法运算;签名长度短,只需传输一个群元素;适用范围广,能根据待签名消息的长度自动适配对应的公钥参数,该特性非常适合WSN中数据传输量较小的应用;同时该算法还能在标准模型下得到形式化的安全证明,其抗伪造攻击安全性可归约为双线性映射群中计算的Diffie-Hellman数学难题。 相似文献