全文获取类型
收费全文 | 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条查询结果,搜索用时 343 毫秒
991.
俞锋 《制冷空调与电力机械》2011,32(5):85-88
主要介绍国华宁海电厂2×1000MW超超临界燃煤机组协调控制(CCS)原理、协调回路的构成及相关的逻辑关系;分析了调试过程中出现的一些故障原因、处理过程及协调优化改进的措施。 相似文献
992.
Hao Peng Peiqing Liu Lin Lu Andrei Sharf Lin Liu Dani Lischinski Baoquan Chen 《Computer Graphics Forum》2020,39(5):15-27
QR code is a 2D matrix barcode widely used for product tracking, identification, document management and general marketing. Recently, there have been various attempts to utilize QR codes in 3D manufacturing by carving QR codes on the surface of the printed 3D shape. Nevertheless, significant shape editing and modulation may be required to allow readability of the embedded 3D-QR-codes with good decoding accuracy. In this paper, we introduce a novel QR code 3D fabrication framework aimed at unobtrusive embedding of 3D-QR-codes in the shape hence introducing minimal shape modulation. Essentially, our method computes bi-directional carvings in the 3D shape surface to obtain the black-and-white QR pattern. By using a directional light source, the black-and-white QR pattern emerges as lighted and shadow casted blocks on the shape respectively. To account for minimal modulation and elusiveness, we optimize the QR code carving w.r.t. shape geometry, visual disparity and light source position. Our technique employs a simulation of lighting phenomena through carved modules on the shape to ensure adequate contrast of the printed 3D-QR-code. 相似文献
993.
A. C. Bauer H. Abbasi J. Ahrens H. Childs B. Geveci S. Klasky K. Moreland P. O'Leary V. Vishwanath B. Whitlock E. W. Bethel 《Computer Graphics Forum》2016,35(3):577-597
The considerable interest in the high performance computing (HPC) community regarding analyzing and visualization data without first writing to disk, i. e., in situ processing, is due to several factors. First is an I/O cost savings, where data is analyzed/visualized while being generated, without first storing to a filesystem. Second is the potential for increased accuracy, where fine temporal sampling of transient analysis might expose some complex behavior missed in coarse temporal sampling. Third is the ability to use all available resources, CPU's and accelerators, in the computation of analysis products. This STAR paper brings together researchers, developers and practitioners using in situ methods in extreme‐scale HPC with the goal to present existing methods, infrastructures, and a range of computational science and engineering applications using in situ analysis and visualization. 相似文献
994.
In this paper we introduce TimeArcs, a novel visualization technique for representing dynamic relationships between entities in a network. Force‐directed layouts provide a way to highlight related entities by positioning them near to each other Entities are brought closer to each other (forming clusters) by forces applied on nodes and connections between nodes. In many application domains, relationships between entities are not temporally stable, which means that cluster structures and cluster memberships also may vary across time. Our approach merges multiple force‐directed layouts at different time points into a single comprehensive visualization that provides a big picture overview of the most significant clusters within a user‐defined period of time. TimeArcs also supports a range of interactive features, such as allowing users to drill‐down in order to see details about a particular cluster. To highlight the benefits of this technique, we demonstrate its application to various datasets, including the IMDB co‐star network, a dataset showing conflicting evidences within biomedical literature of protein interactions, and collocated popular phrases obtained from political blogs. 相似文献
995.
996.
997.
We present a novel highly parallel method for optimizing bounding volume hierarchies (BVH) targeting contemporary GPU architectures. The core of our method is based on the insertion‐based BVH optimization that is known to achieve excellent results in terms of the SAH cost. The original algorithm is, however, inherently sequential: no efficient parallel version of the method exists, which limits its practical utility. We reformulate the algorithm while exploiting the observation that there is no need to remove the nodes from the BVH prior to finding their optimized positions in the tree. We can search for the optimized positions for all nodes in parallel while simultaneously tracking the corresponding SAH cost reduction. We update in parallel all nodes for which better position was found while efficiently handling potential conflicts during these updates. We implemented our algorithm in CUDA and evaluated the resulting BVH in the context of the GPU ray tracing. The results indicate that the method is able to achieve the best ray traversal performance among the state of the art GPU‐based BVH construction methods. 相似文献
998.
Rickard Brüel-Gabrielsson Vignesh Ganapathi-Subramanian Primoz Skraba Leonidas J. Guibas 《Computer Graphics Forum》2020,39(5):197-207
We present an approach to incorporate topological priors in the reconstruction of a surface from a point scan. We base the reconstruction on basis functions which are optimized to provide a good fit to the point scan while satisfying predefined topological constraints. We optimize the parameters of a model to obtain a likelihood function over the reconstruction domain. The topological constraints are captured by persistence diagrams which are incorporated within the optimization algorithm to promote the correct topology. The result is a novel topology-aware technique which can (i) weed out topological noise from point scans, and (ii) capture certain nuanced properties of the underlying shape which could otherwise be lost while performing surface reconstruction. We show results reconstructing shapes with multiple potential topologies, compare to other classical surface construction techniques, and show the completion of real scan data. 相似文献
999.
1000.
Automatically computing a cinematographic consistent sequence of shots over a set of actions occurring in a 3D world is a complex task which requires not only the computation of appropriate shots (viewpoints) and appropriate transitions between shots (cuts), but the ability to encode and reproduce elements of cinematographic style. Models proposed in the literature, generally based on finite state machine or idiom‐based representations, provide limited functionalities to build sequences of shots. These approaches are not designed in mind to easily learn elements of cinematographic style, nor do they allow to perform significant variations in style over the same sequence of actions. In this paper, we propose a model for automated cinematography that can compute significant variations in terms of cinematographic style, with the ability to control the duration of shots and the possibility to add specific constraints to the desired sequence. The model is parametrized in a way that facilitates the application of learning techniques. By using a Hidden Markov Model representation of the editing process, we demonstrate the possibility of easily reproducing elements of style extracted from real movies. Results comparing our model with state‐of‐the‐art first‐order Markovian representations illustrate these features, and robustness of the learning technique is demonstrated through cross‐validation. 相似文献