全文获取类型
收费全文 | 6679篇 |
免费 | 817篇 |
国内免费 | 561篇 |
专业分类
电工技术 | 341篇 |
综合类 | 952篇 |
化学工业 | 573篇 |
金属工艺 | 372篇 |
机械仪表 | 810篇 |
建筑科学 | 578篇 |
矿业工程 | 342篇 |
能源动力 | 191篇 |
轻工业 | 182篇 |
水利工程 | 235篇 |
石油天然气 | 252篇 |
武器工业 | 90篇 |
无线电 | 599篇 |
一般工业技术 | 741篇 |
冶金工业 | 214篇 |
原子能技术 | 33篇 |
自动化技术 | 1552篇 |
出版年
2024年 | 16篇 |
2023年 | 70篇 |
2022年 | 123篇 |
2021年 | 149篇 |
2020年 | 177篇 |
2019年 | 163篇 |
2018年 | 181篇 |
2017年 | 190篇 |
2016年 | 224篇 |
2015年 | 260篇 |
2014年 | 316篇 |
2013年 | 375篇 |
2012年 | 443篇 |
2011年 | 495篇 |
2010年 | 360篇 |
2009年 | 412篇 |
2008年 | 401篇 |
2007年 | 509篇 |
2006年 | 463篇 |
2005年 | 433篇 |
2004年 | 349篇 |
2003年 | 337篇 |
2002年 | 278篇 |
2001年 | 242篇 |
2000年 | 222篇 |
1999年 | 160篇 |
1998年 | 125篇 |
1997年 | 125篇 |
1996年 | 108篇 |
1995年 | 77篇 |
1994年 | 57篇 |
1993年 | 51篇 |
1992年 | 43篇 |
1991年 | 19篇 |
1990年 | 22篇 |
1989年 | 14篇 |
1988年 | 8篇 |
1987年 | 10篇 |
1986年 | 2篇 |
1985年 | 8篇 |
1984年 | 4篇 |
1983年 | 7篇 |
1982年 | 6篇 |
1981年 | 2篇 |
1979年 | 5篇 |
1966年 | 2篇 |
1965年 | 2篇 |
1958年 | 1篇 |
1957年 | 3篇 |
1955年 | 1篇 |
排序方式: 共有8057条查询结果,搜索用时 12 毫秒
1.
Common sense sometimes predicts events to be likely or unlikely rather than merely possible. We extend methods of qualitative reasoning to predict the relative likelihoods of possible qualitative behaviors by viewing the dynamics of a system as a Markov chain over its transition graph. This involves adding qualitative or quantitative estimates of transition probabilities to each of the transitions and applying the standard theory of Markov chains to distinguish persistent states from transient states and to calculate recurrence times, settling times, and probabilities for ending up in each state. Much of the analysis depends solely on qualitative estimates of transition probabilities, which follow directly from theoretical considerations and which lead to qualitative predictions about entire classes of systems. Quantitative estimates for specific systems are derived empirically and lead to qualitative and quantitative conclusions, most of which are insensitive to small perturbations in the estimated transition probabilities. The algorithms are straightforward and efficient. 相似文献
2.
In today's competitive business environment, it is important that customers are able to obtain their preferred items in the shops they visit, particularly for convenience store chains such as 7–Eleven where popular items are expected to be readily available on the shelves of the stores for buyers. To minimize the cost of running such store chains, it is essential that stocks be kept to a minimum and at the same time large varieties of popular items are available for customers. In this respect, the replenishment system needs to be able to cope with the taxing demands of minimal inventory but at the same time keeping large varieties of needed items. This paper proposes a replenishment system which is able to respond to the fluctuating demands of customers and provide a timely supply of needed items in a cost–effective way. The proposed system embraces the principle of fuzzy logic which is able to deal with uncertainties by virtue of its fuzzy rules reasoning mechanism, thereby leveraging the responsiveness of the entire replenishment system for the chain stores. To validate the feasibility of the approach, a case study has been conducted in an emulated environment with promising results. 相似文献
3.
4.
Gloria Galan-Marin Enrique Merida-Casermeiro Domingo Lopez-Rodriguez 《Neural Processing Letters》2007,26(2):133-143
Detection of isomorphism among kinematic chains is essential in mechanical design, but difficult and computationally expensive.
It has been shown that both traditional methods and previously presented neural networks still have a lot to be desired in
aspects such as simplifying procedure of identification and adapting automatic computation. Therefore, a new algorithm based
on a competitive Hopfield network is developed for automatic computation in the kinematic chain isomorphism problem. The neural
approach provides directly interpretable solutions and does not demand tuning of parameters. We have tested the algorithm
by solving problems reported in the recent mechanical literature. Simulation results show the effectiveness of the network
that rapidly identifies isomorphic kinematic chains. 相似文献
5.
6.
针对油封的大批量、多品种、流水线作业的生产特点以及"零废品率"的检测要求,利用机器视觉检测和计算机图象处理技术,研究开发了适应大批量生产和在线实时检测的油封尺寸机器视觉检测系统;建立了系统软硬件结构,分析了系统的组成和工作原理及工作过程,并对图像处理算法进行了设计;系统标定后的实验检测结果证明,该检测系统能实现产品100%检测的生产目标,具有非接触、在线实时、精度适中、成本低等特点,具有较好的生产通用性。 相似文献
7.
为了更为全面地表征语音情感状态,弥补线性情感特征参数在刻画不同情感类型上的不足,将相空间重构理论引入语音情感识别中来,通过分析不同情感状态下的混沌特征,提取Kolmogorov熵和关联维作为新的情感特征参数,并结合传统语音特征使用支持向量机(SVM)进行语音情感识别。实验结果表明,通过引入混沌参数,与传统物理特征进行识别的方案相比,准确率有了一定的提高,为语音情感的识别提供了一个新的研究途径。 相似文献
8.
为解决型腔体组件装配尺寸的检测问题,以某枪型的型腔体组件为例,分析该型腔体组件的结构特点,设计组合型检测装置,实现准确检测目的.归纳总结了型腔体组件装配尺寸检测技术运用过程中检测装置的设计要领,采用设计与被测型腔体组件相匹配的组合型检测装置,有效解决了型腔体组件装配尺寸检测过程中的定位困难、操作繁琐、检测准确性差等问题.该检测技术对确保型腔体组件装配尺寸的检测稳定性、检测可操作性、检测准确性等方面具有现实的指导意义. 相似文献
9.
Radical copolymerization is considered theoretically taking into account the effect of complexing on the configurational statistics of macromolecules formed. Akinetic model has been developed that considers, apart from the ordinary addition of single monomer units to a propagating chain, the possible addition of monomer unit pairs along with a complexing agent in the form of a ternary complex. Within the framework of this model, the problem of calculating the probabilities of formation of any sequences of monomer units (taking into account their microtacticity) in a macromolecule has been rigorously solved as well as the problem of finding the composition distribution of the copolymer formed. It has been shown that this distribution is described by a conventional Gauss law and the appropriate parameters are given. Possible generalizations of the suggested approach are indicated. 相似文献
10.
We consider the behaviour of a stochastic system composed of several identically distributed, but non independent, discrete-time absorbing Markov chains competing at each instant for a transition. The competition consists in determining at each instant, using a given probability distribution, the only Markov chain allowed to make a transition. We analyse the first time at which one of the Markov chains reaches its absorbing state. When the number of Markov chains goes to infinity, we analyse the asymptotic behaviour of the system for an arbitrary probability mass function governing the competition. We give conditions that ensure the existence of the asymptotic distribution and we show how these results apply to cluster-based distributed storage when the competition is handled using a geometric distribution. 相似文献