全文获取类型
收费全文 | 53439篇 |
免费 | 2209篇 |
国内免费 | 80篇 |
专业分类
电工技术 | 570篇 |
综合类 | 47篇 |
化学工业 | 10833篇 |
金属工艺 | 1038篇 |
机械仪表 | 1129篇 |
建筑科学 | 2943篇 |
矿业工程 | 162篇 |
能源动力 | 1534篇 |
轻工业 | 4491篇 |
水利工程 | 546篇 |
石油天然气 | 173篇 |
武器工业 | 6篇 |
无线电 | 3969篇 |
一般工业技术 | 9029篇 |
冶金工业 | 9513篇 |
原子能技术 | 448篇 |
自动化技术 | 9297篇 |
出版年
2023年 | 337篇 |
2022年 | 713篇 |
2021年 | 1126篇 |
2020年 | 794篇 |
2019年 | 964篇 |
2018年 | 1192篇 |
2017年 | 1059篇 |
2016年 | 1303篇 |
2015年 | 1165篇 |
2014年 | 1538篇 |
2013年 | 3406篇 |
2012年 | 2495篇 |
2011年 | 3162篇 |
2010年 | 2388篇 |
2009年 | 2335篇 |
2008年 | 2621篇 |
2007年 | 2487篇 |
2006年 | 2260篇 |
2005年 | 2000篇 |
2004年 | 1633篇 |
2003年 | 1522篇 |
2002年 | 1447篇 |
2001年 | 985篇 |
2000年 | 858篇 |
1999年 | 932篇 |
1998年 | 1299篇 |
1997年 | 1041篇 |
1996年 | 931篇 |
1995年 | 852篇 |
1994年 | 787篇 |
1993年 | 766篇 |
1992年 | 672篇 |
1991年 | 437篇 |
1990年 | 549篇 |
1989年 | 519篇 |
1988年 | 438篇 |
1987年 | 463篇 |
1986年 | 420篇 |
1985年 | 553篇 |
1984年 | 543篇 |
1983年 | 430篇 |
1982年 | 382篇 |
1981年 | 380篇 |
1980年 | 351篇 |
1979年 | 359篇 |
1978年 | 332篇 |
1977年 | 338篇 |
1976年 | 341篇 |
1975年 | 272篇 |
1974年 | 243篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
991.
Algorithm based on simulated annealing for land-use allocation 总被引:1,自引:0,他引:1
Inés Santé-Riveira Marcos Boullón-Magán Rafael Crecente-Maseda David Miranda-Barrós 《Computers & Geosciences》2008,34(3):259-268
This article describes the use of simulated annealing for allocation of land units to a set of possible uses on, the basis of their suitability for those uses, and the compactness of the total areas allotted to the same use or kind of use, which are fixed a priori. The results obtained for the Terra Chá district of Galicia (N.W. Spain) using different objective weighting schemes are compared with each other and with those obtained for this district under the same area constraints, using hierarchical optimization, ideal point analysis, and multi-objective land allocation (MOLA) to maximize average use suitability. Inclusion of compactness in the simulated annealing objective function avoids the highly disperse allocations typical of optimizations that ignore this sub-objective. 相似文献
992.
Michael Wand Alexander Berner Martin Bokeloh Philipp Jenke Arno Fleck Mark Hoffmann Benjamin Maier Dirk Staneker Andreas Schilling Hans-Peter Seidel 《Computers & Graphics》2008,32(2):204-220
This paper describes a new out-of-core multi-resolution data structure for real-time visualization, interactive editing and externally efficient processing of large point clouds. We describe an editing system that makes use of the novel data structure to provide interactive editing and preprocessing tools for large scanner data sets. Using the new data structure, we provide a complete tool chain for 3D scanner data processing, from data preprocessing and filtering to manual touch-up and real-time visualization. In particular, we describe an out-of-core outlier removal and bilateral geometry filtering algorithm, a toolset for interactive selection, painting, transformation, and filtering of huge out-of-core point-cloud data sets and a real-time rendering algorithm, which all use the same data structure as storage backend. The interactive tools work in real-time for small model modifications. For large scale editing operations, we employ a two-resolution approach where editing is planned in real-time and executed in an externally efficient offline computation afterwards. We evaluate our implementation on example data sets of sizes up to 63 GB, demonstrating that the proposed technique can be used effectively in real-world applications. 相似文献
993.
The vulnerability of structures to unforeseen events 总被引:2,自引:0,他引:2
A structure is vulnerable to an unforeseen event if it is not sufficiently robust. One insight into the lack of robustness is gained through the vulnerability of a structure to disproportionate collapse. In this paper, the importance of assessing the vulnerability of a structure to unforeseen events is highlighted and the nature of unforeseen events examined. A theory of structural vulnerability which examines the form of the structure to determine the most vulnerable sequence of failure events is briefly described. The potential for damage to propagate through a structure is examined through a new measure of hazard potential and vertical pushover analysis. An analysis of an example structure shows that such an approach is able to capture the weaknesses in a structure either due to form or external actions. 相似文献
994.
Mesh networks are a potential solution for providing communication infrastructure in an emergency. They can be rapidly deployed by first responders in the wake of a major disaster to augment an existing wireless or wired network. We imagine a mesh node with multiple radios embedded in each emergency vehicle arriving at the site to form the backbone of a mobile wireless mesh. The ability of such a mesh network to monitor itself, diagnose faults and anticipate problems are essential features for its sustainable operation. Typical SNMP-based centralized solutions introduce a single point of failure and are unsuitable for managing such a network. Mesh-Mon is a decentralized monitoring and management system designed for such a mobile, rapidly deployed, unplanned mesh network and works independently of the underlying mesh routing protocol. Mesh-Mon nodes are designed to actively cooperate and use localized algorithms to predict, detect, diagnose and resolve network problems in a scalable manner. Mesh-Mon is independent of the underlying routing protocol and can operate even if the mesh routing protocol completely fails. One novel aspect of our approach is that we employ mobile users of the mesh, running software called Mesh-Mon-Ami, to ferry management packets between physically-disconnected partitions in a delay-tolerant-network manner. The main contributions of this paper are the design, implementation and evaluation of a comprehensive monitoring and management architecture that helps a network administrator proactively identify, diagnose and resolve a range of issues that can occur in a dynamic mesh network. In experiments on Dart-Mesh, our 16-node indoor mesh testbed, we found Mesh-Mon to be effective in quickly diagnosing and resolving a variety of problems with high accuracy, without adding significant management overhead. 相似文献
995.
Sharp GC Lee SW Wehe DK 《IEEE transactions on pattern analysis and machine intelligence》2008,30(1):120-130
Missing data are common in range images, due to geometric occlusions, limitations in the sensor field of view, poor reflectivity, depth discontinuities, and cast shadows. Using registration to align these data often fails, because points without valid correspondences can be incorrectly matched. This paper presents a maximum likelihood method for registration of scenes with unmatched or missing data. Using ray casting, correspondences are formed between valid and missing points in each view. These correspondences are used to classify points by their visibility properties, including occlusions, field of view, and shadow regions. The likelihood of each point match is then determined using statistical properties of the sensor, such as noise and outlier distributions. Experiments demonstrate a high rates of convergence on complex scenes with varying degrees of overlap. 相似文献
996.
Liu S Kang K Tarel JP Cooper DB 《IEEE transactions on pattern analysis and machine intelligence》2008,30(1):131-146
In this paper, the duality in differential form is developed between a 3D primal surface and its dual manifold formed by the surface's tangent planes, i.e., each tangent plane of the primal surface is represented as a four-dimensional vector which constitutes a point on the dual manifold. The iterated dual theorem shows that each tangent plane of the dual manifold corresponds to a point on the original 3D surface, i.e., the dual of the dual goes back to the primal. This theorem can be directly used to reconstruct 3D surface from image edges by estimating the dual manifold from these edges. In this paper we further develop the work in our original conference papers resulting in the robust differential dual operator. We argue that the operator makes good use of the information available in the image data, by using both points of intensity discontinuity and their edge directions; we provide a simple physical interpretation of what the abstract algorithm is actually estimating and why it makes sense in terms of estimation accuracy; our algorithm operates on all edges in the images, including silhouette edges, self occlusion edges, and texture edges, without distinguishing their types (thus resulting in improved accuracy and handling locally concave surface estimation if texture edges are present); the algorithm automatically handles various degeneracies; and the algorithm incorporates new methodologies for implementing the required operations such as appropriately relating edges in pairs of images, evaluating and using the algorithm's sensitivity to noise to determine the accuracy of an estimated 3D point. Experiments with both synthetic and real images demonstrate that the operator is accurate, robust to degeneracies and noise, and general for reconstructing free-form objects from occluding edges and texture edges detected in calibrated images or video sequences. 相似文献
997.
998.
Liang J DeMenthon D Doermann D 《IEEE transactions on pattern analysis and machine intelligence》2008,30(4):591-605
Compared to typical scanners, handheld cameras offer convenient, flexible, portable, and non-contact image capture, which enables many new applications and breathes new life into existing ones. However, camera-captured documents may suffer from distortions caused by non-planar document shape and perspective projection, which lead to failure of current OCR technologies. We present a geometric rectification framework for restoring the frontal-flat view of a document from a single camera-captured image. Our approach estimates 3D document shape from texture flow information obtained directly from the image without requiring additional 3D/metric data or prior camera calibration. Our framework provides a unified solution for both planar and curved documents and can be applied in many, especially mobile, camera-based document analysis applications. Experiments show that our method produces results that are significantly more OCR compatible than the original images. 相似文献
999.
Chin TJ Suter D 《IEEE transactions on pattern analysis and machine intelligence》2008,30(9):1547-1556
We investigate the problem of extrapolating the embedding of a manifold learned from finite samples to novel out-of-sample data. We concentrate on the manifold learning method called Maximum Variance Unfolding (MVU) for which the extrapolation problem is still largely unsolved. Taking the perspective of MVU learning being equivalent to Kernel PCA, our problem reduces to extending a kernel matrix generated from an unknown kernel function to novel points. Leveraging on previous developments, we propose a novel solution which involves approximating the kernel eigenfunction using Gaussian basis functions. We also show how the width of the Gaussian can be tuned to achieve extrapolation. Experimental results which demonstrate the effectiveness of the proposed approach are also included. 相似文献
1000.
Favaro P Soatto S Burger M Osher SJ 《IEEE transactions on pattern analysis and machine intelligence》2008,30(3):518-531
Defocus can be modeled as a diffusion process and represented mathematically using the heat equation, where image blur corresponds to the diffusion of heat. This analogy can be extended to non-planar scenes by allowing a space-varying diffusion coefficient. The inverse problem of reconstructing 3-D structure from blurred images corresponds to an "inverse diffusion" that is notoriously ill-posed. We show how to bypass this problem by using the notion of relative blur. Given two images, within each neighborhood, the amount of diffusion necessary to transform the sharper image into the blurrier one depends on the depth of the scene. This can be used to devise a global algorithm to estimate the depth profile of the scene without recovering the deblurred image, using only forward diffusion. 相似文献