全文获取类型
收费全文 | 4475篇 |
免费 | 227篇 |
国内免费 | 312篇 |
专业分类
电工技术 | 95篇 |
综合类 | 228篇 |
化学工业 | 130篇 |
金属工艺 | 166篇 |
机械仪表 | 254篇 |
建筑科学 | 237篇 |
矿业工程 | 28篇 |
能源动力 | 43篇 |
轻工业 | 111篇 |
水利工程 | 8篇 |
石油天然气 | 96篇 |
武器工业 | 10篇 |
无线电 | 564篇 |
一般工业技术 | 171篇 |
冶金工业 | 15篇 |
原子能技术 | 18篇 |
自动化技术 | 2840篇 |
出版年
2023年 | 33篇 |
2022年 | 57篇 |
2021年 | 62篇 |
2020年 | 75篇 |
2019年 | 66篇 |
2018年 | 58篇 |
2017年 | 77篇 |
2016年 | 105篇 |
2015年 | 139篇 |
2014年 | 207篇 |
2013年 | 191篇 |
2012年 | 269篇 |
2011年 | 319篇 |
2010年 | 238篇 |
2009年 | 226篇 |
2008年 | 254篇 |
2007年 | 297篇 |
2006年 | 313篇 |
2005年 | 260篇 |
2004年 | 215篇 |
2003年 | 235篇 |
2002年 | 178篇 |
2001年 | 116篇 |
2000年 | 120篇 |
1999年 | 103篇 |
1998年 | 105篇 |
1997年 | 87篇 |
1996年 | 90篇 |
1995年 | 79篇 |
1994年 | 52篇 |
1993年 | 32篇 |
1992年 | 43篇 |
1991年 | 26篇 |
1990年 | 15篇 |
1989年 | 15篇 |
1988年 | 14篇 |
1986年 | 9篇 |
1985年 | 13篇 |
1984年 | 18篇 |
1983年 | 28篇 |
1982年 | 23篇 |
1981年 | 26篇 |
1980年 | 21篇 |
1979年 | 17篇 |
1978年 | 20篇 |
1977年 | 15篇 |
1976年 | 16篇 |
1975年 | 7篇 |
1974年 | 8篇 |
1973年 | 10篇 |
排序方式: 共有5014条查询结果,搜索用时 15 毫秒
1.
Although greedy algorithms possess high efficiency, they often receive suboptimal solutions of the ensemble pruning problem, since their exploration areas are limited in large extent. And another marked defect of almost all the currently existing ensemble pruning algorithms, including greedy ones, consists in: they simply abandon all of the classifiers which fail in the competition of ensemble selection, causing a considerable waste of useful resources and information. Inspired by these observations, an interesting greedy Reverse Reduce-Error (RRE) pruning algorithm incorporated with the operation of subtraction is proposed in this work. The RRE algorithm makes the best of the defeated candidate networks in a way that, the Worst Single Model (WSM) is chosen, and then, its votes are subtracted from the votes made by those selected components within the pruned ensemble. The reason is because, for most cases, the WSM might make mistakes in its estimation for the test samples. And, different from the classical RE, the near-optimal solution is produced based on the pruned error of all the available sequential subensembles. Besides, the backfitting step of RE algorithm is replaced with the selection step of a WSM in RRE. Moreover, the problem of ties might be solved more naturally with RRE. Finally, soft voting approach is employed in the testing to RRE algorithm. The performances of RE and RRE algorithms, and two baseline methods, i.e., the method which selects the Best Single Model (BSM) in the initial ensemble, and the method which retains all member networks of the initial ensemble (ALL), are evaluated on seven benchmark classification tasks under different initial ensemble setups. The results of the empirical investigation show the superiority of RRE over the other three ensemble pruning algorithms. 相似文献
2.
根据Flether等人的研究,基于感知独立性假设的子带识别方法被用于抗噪声鲁棒语音识别。本文拓展子带方法,采用基于噪声污染假定的多带框架来减少噪声影响。论文不仅从理论上分析了噪声污染假定多带框架在识别性能上的潜在优势,而且提出了多带环境下的鲁棒语音识别算法。研究表明:多带框架不仅回避了独立感知假设要求,而且与子带方法相比,多带方法能更好的减少噪声影响,提高系统识别性能。 相似文献
3.
With the creation of a pattern recognition system for metal transfer mode, this article has collected five kinds of spectrum signals in gas metal arc welding (MIG, MAG and CO2) and take them as training samples. These samples have been pretreated by computer, several key characteristic parameters of the spectrum signal have been creatively extracted, and a corresponding recognition function and a minimum-distance-classifier have been constructed. The results show that the pattern recognition of several kinds of metal transfer modes for the metal gas arc welding can be done successfully, and relative important parameters in welding process, such as the frequency of droplet transfer and the approximate diameter of each droplet, can also be obtained. 相似文献
4.
简要介绍世界几种主要薄板坯连铸工艺。着重叙述应用大型通用商业软件MSC.MARC。模拟液芯压下时铸坯的变形,确定最佳压下方案的有限元分析,液芯压下应该在结晶器出口处及二冷区扇形段开始部分进行,这样能减小铸坯的应变。 相似文献
5.
Cezar Câmpeanu 《Information Processing Letters》2004,92(6):267-274
We define the pattern expressions as an extension of both regular expressions and patterns. We prove several properties of the new family of languages, similar to those of extended regex languages [Câmpeanu et al., Int. J. Found. Comput. Sci. 14 (6) (2003) 1007-1018]. We also define an automata system that recognizes these languages. Differences between regex and pattern expressions are also discussed. 相似文献
6.
This paper presents a mechanism which infers a user's plans from his/her utterances by directing the inference process towards the more likely interpretations of a speaker's statements among many possible interpretations. Our mechanism uses Bayesian theory of probability to assess the likelihood of an interpretation, and it complements this assessment by taking into consideration two aspects of an interpretation: its coherence and its information content. The coherence of an interpretation is determined by the relationships between the different statements in the discourse. The information content of an interpretation is a measure of how well defined the interpretation is in terms of the actions to be performed on the basis of this interpretation. This measure is used to guide the inference process towards interpretations with higher information content. The information content of an interpretation depends on the specificity and the certainty of the inferences in it, where the certainty of an inference depends on the knowledge on which the inference is based. Our mechanism has been developed for use in task-oriented consultation systems. The particular domain that we have chosen for exploration is that of travel booking. 相似文献
7.
以地震资料精细处理和解释在大庆长垣外围徐家围子油田开发中的成功应用为例,论述了地震地质综合描述技术在地质情况复杂的低、特低渗透油田开发中的应用效果。 相似文献
8.
语音识别算法的确定与实现 总被引:1,自引:0,他引:1
在语音识别的实验中,对几种算法方案进行了比较、分析和择优淘劣,标准是在一定词汇量的条件下,权衡占用机器的内存空间、(正确)识别率和响应速度。力争使与话者有关的单词语音识别系统的设计达到优化,取得满意的结果。本文即是此项实验的总结。 相似文献
9.
The tree representation of evolutionary relationship oversimplifies the view of the process of evolution as it cannot take into account the events such as horizontal gene transfer, hybridization, homoplasy and genetic recombination. Several algorithms exist for constructing phylogenetic networks which result from events such as horizontal gene transfer, hybridization and homoplasy. Very little work has been published on the algorithmic detail of phylogenetic networks with constrained recombination. The problem of minimizing the number of recombinations in a phylogenetic network, constructed using binary DNA sequences, is NP-hard. In this paper, we propose a pattern recognition-based O(n2) time approach for constructing the phylogenetic network, where n is the number of nodes or sequences in the input data. The network is constructed with the restriction that no two cycles in the network share a common node. 相似文献
10.
This paper presents an orientation-based representation for planar curves and shapes. The new representation can uniquely represent all types, of planar shapes, be it convex, nonconvex, polygonal, smoothly curved, or piecewise smooth shapes. It is based on a new parameterization, theabsolute integral orientation. This representation is invariant under translation and rotation. The absolute integral orientation is a parameter invariant under scaling. As a result, matching of similar shapes (i.e., determination of the relative orientation and the scaling factor) using the absolute integral orientation as the parameter is easier than using the arclength as the parameter. In addition, the new representation has the feature of adaptive sampling, making it more compact and efficient than arc-length-based representations. 相似文献