全文获取类型
收费全文 | 1448篇 |
免费 | 159篇 |
国内免费 | 157篇 |
专业分类
电工技术 | 14篇 |
综合类 | 80篇 |
化学工业 | 22篇 |
金属工艺 | 10篇 |
机械仪表 | 70篇 |
建筑科学 | 206篇 |
矿业工程 | 29篇 |
能源动力 | 24篇 |
轻工业 | 71篇 |
水利工程 | 26篇 |
石油天然气 | 5篇 |
武器工业 | 5篇 |
无线电 | 105篇 |
一般工业技术 | 43篇 |
冶金工业 | 6篇 |
原子能技术 | 7篇 |
自动化技术 | 1041篇 |
出版年
2024年 | 10篇 |
2023年 | 11篇 |
2022年 | 29篇 |
2021年 | 23篇 |
2020年 | 38篇 |
2019年 | 27篇 |
2018年 | 36篇 |
2017年 | 38篇 |
2016年 | 39篇 |
2015年 | 46篇 |
2014年 | 80篇 |
2013年 | 86篇 |
2012年 | 103篇 |
2011年 | 137篇 |
2010年 | 95篇 |
2009年 | 113篇 |
2008年 | 101篇 |
2007年 | 120篇 |
2006年 | 114篇 |
2005年 | 101篇 |
2004年 | 67篇 |
2003年 | 78篇 |
2002年 | 53篇 |
2001年 | 36篇 |
2000年 | 25篇 |
1999年 | 23篇 |
1998年 | 19篇 |
1997年 | 19篇 |
1996年 | 11篇 |
1995年 | 14篇 |
1994年 | 7篇 |
1993年 | 5篇 |
1992年 | 9篇 |
1991年 | 4篇 |
1990年 | 7篇 |
1989年 | 5篇 |
1988年 | 3篇 |
1986年 | 4篇 |
1985年 | 3篇 |
1984年 | 6篇 |
1983年 | 3篇 |
1982年 | 2篇 |
1981年 | 3篇 |
1980年 | 1篇 |
1979年 | 2篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1976年 | 3篇 |
1975年 | 1篇 |
1972年 | 1篇 |
排序方式: 共有1764条查询结果,搜索用时 31 毫秒
21.
数据库、数据仓库以及其他存储信息库中潜藏着很多与商业、科学研究等活动的决策有关的数据和知识。对于数据挖掘中的数据分析,通常有两种常见的方法,即分类和预测,首先对数据库中的数据进行分类归纳,然后根据分类规则可以得到比较有价值的数据,然后我们可以根据这个数据来预测得到一些包含未来趋势的信息。在常见的分类算法中,决策树算法是一个有着很好扩展性的算法,可以应用到大型数据库中,可以对多种数据类型进行处理,分类模式容易转化为分类规则,结果也十分的浅显易懂易于理解。该文主要先介绍了几种常用的分类算法,然后具体介绍决策树算法的过程以及在分类算法实际应用中的优缺点。 相似文献
22.
23.
A hybrid scheme for the inversion of the Rahman-Pinty-Verstraete (RPV) model is presented. It combines the inversion technique described by Lavergne et al. (Lavergne, T., Kaminski, T., Pinty, B., Taberner, M., Gobron, N., Verstraete, M.M., Vossbeck, M., Widlowski, J.L., Giering, R. (2007). Application to MISR land products of an RPV model inversion package using adjoint and Hessian codes. Remote Sensing of Environment, 107, 362-375.) and a multilayer backpropagation feedforward neural network. The RPV inversion package is applied to a sample set of pixels within the satellite scene. Subsequently the pairs of bidirectional reflectance factors (BRF) and model parameters estimated from the sample set of pixels are used to train the neural network. Since the mathematical formulation of the RPV model is embedded in these training data variables, the neural network can efficiently retrieve the model parameters for the whole satellite scene. This scheme has been tested for a MISR L2 BRF scene, MISR L1B2-derived BRF data corresponding to two different dates and a mosaic of MISR L2 BRF scenes acquired over Southern Africa covering a large extent of Miombo woodland. The results show this strategy retrieves the RPV model parameters and uncertainties with high accuracy and considerable speed over large areas. 相似文献
24.
Floodplain roughness parameterization using airborne laser scanning and spectral remote sensing 总被引:1,自引:0,他引:1
Floodplain roughness parameterization is one of the key elements of hydrodynamic modeling of river flow, which is directly linked to exceedance levels of the embankments of lowland fluvial areas. The present way of roughness mapping is based on manually delineated floodplain vegetation types, schematized as cylindrical elements of which the height (m) and the vertical density (the projected plant area in the direction of the flow per unit volume, m− 1) have to be assigned using a lookup table. This paper presents a novel method of automated roughness parameterization. It delivers a spatially distributed roughness parameterization in an entire floodplain by fusion of CASI multispectral data with airborne laser scanning (ALS) data. The method consists of three stages: (1) pre-processing of the raw data, (2) image segmentation of the fused data set and classification into the dominant land cover classes (KHAT = 0.78), (3) determination of hydrodynamic roughness characteristics for each land cover class separately. In stage three, a lookup table provides numerical values that enable roughness calculation for the classes water, sand, paved area, meadows and built-up area. For forest and herbaceous vegetation, ALS data enable spatially detailed analysis of vegetation height and density. The hydrodynamic vegetation density of forest is mapped using a calibrated regression model. Herbaceous vegetation cover is further subdivided in single trees and non-woody vegetation. Single trees were delineated using a novel iterative cluster merging method, and their height is predicted (R2 = 0.41, rse = 0.84 m). The vegetation density of single trees was determined in an identical way as for forest. Vegetation height and density of non-woody herbaceous vegetation were also determined using calibrated regression models. A 2D hydrodynamic model was applied with the results of this novel method, and compared with a traditional roughness parameterization approach. The modeling results showed that the new method is well able to provide accurate output data. The new method provides a faster, repeatable, and more accurate way of obtaining floodplain roughness, which enables regular updating of river flow models. 相似文献
25.
An instance of the path hitting problem consists of two families of paths,
and ℋ, in a common undirected graph, where each path in ℋ is associated with a non-negative cost. We refer to
and ℋ as the sets of demand and hitting paths, respectively. When p∈ℋ and
share at least one mutual edge, we say that p
hits q. The objective is to find a minimum cost subset of ℋ whose members collectively hit those of
. In this paper we provide constant factor approximation algorithms for path hitting, confined to instances in which the underlying
graph is a tree, a spider, or a star. Although such restricted settings may appear to be very simple, we demonstrate that
they still capture some of the most basic covering problems in graphs. Our approach combines several novel ideas: We extend
the algorithm of Garg, Vazirani and Yannakakis (Algorithmica, 18:3–20, 1997) for approximate multicuts and multicommodity flows in trees to prove new integrality properties; we present a reduction
that involves multiple calls to this extended algorithm; and we introduce a polynomial-time solvable variant of the edge cover
problem, which may be of independent interest.
An extended abstract of this paper appeared in Proceedings of the 14th Annual European Symposium on Algorithms, 2006.
This work is part of D. Segev’s Ph.D. thesis prepared at Tel-Aviv University under the supervision of Prof. Refael Hassin. 相似文献
26.
左旭辉 《数字社区&智能家居》2009,5(9):7073-7074
为解决行为识别中运动特征提取的问题,该文提出了一种基于三阶帧差的运动特征提取方案,用于提取运动特征中的变化大小、运动变化的一致性、运动方向的一致性等。实验证明,新方法速度快,准确度高。 相似文献
27.
定义八近邻图像的边界跟踪自动机,利用自动机跟踪图像所有区域边界,自动机的输出为边界的顶点链码,在自动机跟踪所有边界的同时生成围线的树结构.跟踪算法复杂度是线性的,能跟踪任意复杂图像区域. 相似文献
28.
个性化、高性能的树形菜单有着广泛的应用。在分析.NET框架的TreeView控件的基础上,总结了基于.NET平台实现个性化树形菜单的基本方法,给出了优化树形菜单数据处理性能的基本策略。 相似文献
29.
Hrmel Nestra 《The Journal of Logic and Algebraic Programming》2009,78(7):573-592
Transfinite semantics is a semantics according to which program executions can continue working after an infinite number of steps. Such a view of programs can be useful in the theory of program transformations.So far, transfinite semantics have been succesfully defined for iterative loops. This paper provides an exhaustive definition for semantics that enable also infinitely deep recursion.The definition is actually a parametric schema that defines a family of different transfinite semantics. As standard semantics also match the same schema, our framework describes both standard and transfinite semantics in a uniform way.All semantics are expressed as greatest fixpoints of monotone operators on some complete lattices. It turns out that, for transfinite semantics, the corresponding lattice operators are cocontinuous. According to Kleene’s theorem, this shows that transfinite semantics can be expressed as a limit of iteration which is not transfinite. 相似文献
30.