全文获取类型
收费全文 | 73166篇 |
免费 | 13366篇 |
国内免费 | 9795篇 |
专业分类
电工技术 | 8624篇 |
技术理论 | 1篇 |
综合类 | 9208篇 |
化学工业 | 1439篇 |
金属工艺 | 1317篇 |
机械仪表 | 5426篇 |
建筑科学 | 1275篇 |
矿业工程 | 994篇 |
能源动力 | 1434篇 |
轻工业 | 710篇 |
水利工程 | 1143篇 |
石油天然气 | 832篇 |
武器工业 | 1272篇 |
无线电 | 13012篇 |
一般工业技术 | 4725篇 |
冶金工业 | 816篇 |
原子能技术 | 277篇 |
自动化技术 | 43822篇 |
出版年
2024年 | 594篇 |
2023年 | 1338篇 |
2022年 | 2494篇 |
2021年 | 2714篇 |
2020年 | 3027篇 |
2019年 | 2545篇 |
2018年 | 2522篇 |
2017年 | 3011篇 |
2016年 | 3444篇 |
2015年 | 4088篇 |
2014年 | 5278篇 |
2013年 | 5145篇 |
2012年 | 6323篇 |
2011年 | 6592篇 |
2010年 | 5337篇 |
2009年 | 5503篇 |
2008年 | 5867篇 |
2007年 | 6248篇 |
2006年 | 4897篇 |
2005年 | 4055篇 |
2004年 | 3234篇 |
2003年 | 2561篇 |
2002年 | 1923篇 |
2001年 | 1531篇 |
2000年 | 1290篇 |
1999年 | 978篇 |
1998年 | 796篇 |
1997年 | 630篇 |
1996年 | 493篇 |
1995年 | 347篇 |
1994年 | 298篇 |
1993年 | 228篇 |
1992年 | 217篇 |
1991年 | 113篇 |
1990年 | 138篇 |
1989年 | 100篇 |
1988年 | 71篇 |
1987年 | 29篇 |
1986年 | 40篇 |
1985年 | 40篇 |
1984年 | 26篇 |
1983年 | 32篇 |
1982年 | 39篇 |
1981年 | 23篇 |
1980年 | 31篇 |
1979年 | 15篇 |
1978年 | 15篇 |
1977年 | 12篇 |
1975年 | 16篇 |
1959年 | 9篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
11.
The main difficulty with EM algorithm for mixture model concerns the number of components, say g. This is the question of model selection, and the EM algorithm itself could not estimate g. On the contrary, the algorithm requires g to be specified before the remaining parameters can be estimated. To solve this problem, a new algorithm, which is called stepwise split-and-merge EM (SSMEM) algorithm, is proposed. The SSMEM algorithm alternately splits and merges components, estimating g and other parameters of components simultaneously. Also, two novel criteria are introduced to efficiently select the components for split or merge. Experimental results on simulated and real data demonstrate the effectivity of the proposed algorithm. 相似文献
12.
Across 2 experiments, a new experimental procedure was used to investigate attentional capture by animal fear-relevant stimuli. In Experiment 1 (N = 34), unselected participants were slower to detect a neutral target animal in the presence of a spider than a cockroach distractor and in the presence of a snake than a large lizard distractor. This result confirms that phylogenetically fear-relevant animals capture attention specifically and to a larger extent than do non-fear-relevant animals. In Experiment 2 (N = 86), detection of a neutral target animal was slowed more in the presence of a feared fear-relevant distractor (e.g., a snake for snake-fearful participants) than in presence of a not-feared fear-relevant distractor (e.g., a spider for snake-fearful participants). These results indicate preferential attentional capture that is specific to phylogenetically fear-relevant stimuli and is selectively enhanced in individuals who fear these animals. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
13.
This study examined whether objects are attended in serial or in parallel during a demanding visual search task. A component of the event-related potential waveform, the N2pc wave, was used as a continuous measure of the allocation of attention to possible targets in the search arrays. Experiment 1 demonstrated that the relative allocation of attention shifts rapidly, favoring one item and then another. In Experiment 2, a paradigm was used that made it possible to track the absolute allocation of attention to individual items. This experiment showed that attention was allocated to one object for 100-150 ms before attention began to be allocated to the next object. These findings support models of attention that posit serial processing in demanding visual search tasks. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
14.
15.
张鸿宾 《计算机应用与软件》1994,11(5):15-19,53
使用BP算法训练多层网络的速度很慢而且事先难于确定隐节点和隐层的适当数目。本文提出一个有效的算法,先构造决策树,然后将构造的决策树转换为神经网。文中使用一个全局准则函数控制决策树的增长,它较好地匹配了树的复杂性和训练样本量及错分率界。实验结果,本文的算法比用BP算法训练多层网络要快,而其分类精度不低于用BP算法训练的多层神经网。 相似文献
16.
1.引言 在人工智能领域中,产生式系统是一种比较有效的知识表示方法,并得到了广泛应用。目前许多较为成功的专家系统都是用产生式系统实现的~[1]。随着应用领域的不断扩士其知识座的抓橄称渐增 相似文献
17.
This paper formulates the pickup and delivery problem, also known as the dial-a-ride problem, as an integer program. Its polyhedral structure is explored and four classes of valid inequalities developed. The results of a branch-and-cut algorithm based on these constraints are presented. 相似文献
18.
Based on the theory of light energy transfer between two differential diffuse surface areas, a generalized radiosity approach is presented. Unlike the conventional radiosity method, curved surfaces are subdivided into triangular surface patches, radiosity is assummed to be vary across each triangular surface patch. By adopting linear interpolation scheme over each triangular surface patch, we have established a complete set of approximated radiosity equations. Their unknowns are radiosities of differential surface areas located at all vertices of surface patches. The generalized radiosity equation has also been extended to non-diffuse environments. Theoretical analysis and experimental results demonstrate the great potential of this method, 相似文献
19.
We study the application of the geographic nearest neighbor approach to two problems. The first problem is the construction of an approximately minimum length rectilinear Steiner tree for a set ofn points in the plane. For this problem, we introduce a variation of a subgraph of sizeO(n) used by YaO [31] for constructing minimum spanning trees. Using this subgraph, we improve the running times of the heuristics discussed by Bern [6] fromO(n
2
log
n) toO(n log2
n). The second problem is the construction of a rectilinear minimum spanning tree for a set ofn noncrossing line segments in the plane. We present an optimalO(n logn) algorithm for this problem. The rectilinear minimum spanning tree for a set of points can thus be computed optimally without using the Voronoi diagram. This algorithm can also be extended to obtain a rectilinear minimum spanning tree for a set of nonintersecting simple polygons.The results in this paper are a part of Y. C. Yee's Ph.D. thesis done at SUNY at Albany. He was supported in part by NSF Grants IRI-8703430 and CCR-8805782. S. S. Ravi was supported in part by NSF Grants DCI-86-03318 and CCR-89-05296. 相似文献
20.
Thomas L. Landers Melinda K. Beavers Malik Sadiq Don E. Stuart 《Computers & Industrial Engineering》1994,27(1-4):245-248
This paper describes an approach, conceptual framework, and software architecture for dynamic reconfiguration of the order picking system. The research and development project was sponsored by the Material Handling Research Center (MHRC), a National Science Foundation sponsored Cooperative Industry/University Research Center. The storage configuration is assumed to be an in-the-aisle order picking system in which stockkeeping units (SKUs) can occupy variable capacity storage locations and stock-splitting is allowed among zones (clusters). The product mix may include multiple product families with different life cycles, correlated demand within families and commonality of demand across families. 相似文献