全文获取类型
收费全文 | 5527篇 |
免费 | 848篇 |
国内免费 | 679篇 |
专业分类
电工技术 | 423篇 |
综合类 | 594篇 |
化学工业 | 112篇 |
金属工艺 | 109篇 |
机械仪表 | 684篇 |
建筑科学 | 186篇 |
矿业工程 | 60篇 |
能源动力 | 67篇 |
轻工业 | 31篇 |
水利工程 | 75篇 |
石油天然气 | 144篇 |
武器工业 | 110篇 |
无线电 | 631篇 |
一般工业技术 | 528篇 |
冶金工业 | 51篇 |
原子能技术 | 15篇 |
自动化技术 | 3234篇 |
出版年
2024年 | 27篇 |
2023年 | 104篇 |
2022年 | 154篇 |
2021年 | 158篇 |
2020年 | 229篇 |
2019年 | 205篇 |
2018年 | 193篇 |
2017年 | 196篇 |
2016年 | 268篇 |
2015年 | 275篇 |
2014年 | 355篇 |
2013年 | 366篇 |
2012年 | 374篇 |
2011年 | 433篇 |
2010年 | 297篇 |
2009年 | 318篇 |
2008年 | 348篇 |
2007年 | 391篇 |
2006年 | 348篇 |
2005年 | 312篇 |
2004年 | 293篇 |
2003年 | 218篇 |
2002年 | 205篇 |
2001年 | 144篇 |
2000年 | 172篇 |
1999年 | 118篇 |
1998年 | 103篇 |
1997年 | 97篇 |
1996年 | 69篇 |
1995年 | 57篇 |
1994年 | 54篇 |
1993年 | 31篇 |
1992年 | 29篇 |
1991年 | 28篇 |
1990年 | 19篇 |
1989年 | 18篇 |
1988年 | 9篇 |
1987年 | 6篇 |
1986年 | 5篇 |
1985年 | 4篇 |
1984年 | 5篇 |
1983年 | 2篇 |
1982年 | 3篇 |
1981年 | 5篇 |
1980年 | 1篇 |
1979年 | 5篇 |
1976年 | 2篇 |
1973年 | 1篇 |
排序方式: 共有7054条查询结果,搜索用时 15 毫秒
21.
本文提出一种新的ATM交换排队结构——成组输入排队结构(GIQ),其基本思想是将输入端分组,同一组的输入端共享排队缓存。GIQ不仅能提高缓存的利用率和系统的吞吐率(达到96.2%),而且还能大大改善交换结构的抗突发能力。采用计算机仿真模拟的方法,分析了GIQ在均匀连续业务流和突发业务流下的性能,并与其它输入排队结构的性能进行了比较。 相似文献
22.
Alexander Brodsky 《Constraints》1997,2(1):35-44
This paper describes the state of Constraint Databases (CDBs), a young discipline at the intersection of Database Management, Constraint Programming, Computational Geometry and Operations Research. As in Constraint Logic Programming, constraints in CDBs are a first class data type, and can play many modeling roles including spatial and temporal behavior, complex design requirements, and partial and incomplete information, for which existing databases have proven inadequate. We motivate the importance of CDBs, outline the work in the area that has been done, the current trends, and future directions and challenges. We briefly discuss (1) constraint modeling, canonical forms and algebras, (2) data models and query languages, (3) indexing and approximation-based filtering, (4) constraint algebra algorithms and global optimization, and (5) systems and case studies. We argue that CDBs are a promising technology that will impact many important application realms, and furthermore have the potential to be integrated into future database systems, and operations research and constraint programming tools. 相似文献
23.
The heat affect zone (HAZ) is in many cases considered to be the most critical part of a weldment. In this paper, the effect of crack size and weld metal mismatch on the HAZ cleavage toughness of wide plate specimens with X-groove has been investigated by the J-Q-M theories and a simple micromechanism for cleavage fracture. Two crack sizes have been studied (a/w = 0.1 and 0.3). In the analyses, the HAZ yield strength is assumed to be higher than the base metal. For each crack size, weld metal local overmatch and local evenmatch with respect to the HAZ are considered. For a given global strain, the results indicate that weld metal overmatch and evenmatch yield the same crack tip loading in terms of J-integral for a/w = 0.3. For a/w = 0.1, overmatch gives lower crack tip loading than evenmatch. For a given crack tip loading, weld metal local evenmatch in general results in less effective crack tip loading than the overmatch. Overmatch is detrimental to HAZ toughness, but this detrimental effect becomes less significant when the crack size decreases. 相似文献
24.
25.
一族Liouville可积系及其双约束流的Hamilton系统 总被引:3,自引:0,他引:3
构造了Loop代数 A2的一个子代数,由此建立了一个3×3等谱问题,由屠规彰格式得到了一族Liouville意义下的可积Hamilton方程族。通过建立双对称约束,得到了该方程族的两组约束流,并将其化为广义Hamilton系统。 相似文献
26.
本文较系统、通俗地介绍了模拟视频特技切换台的矩阵输入、混合/效果放大器(M/E)、下游键、系统控制和同步发生器等电路单元,介绍了特技切换台的切换、混合、扫变、键控的基本原理和功能。 相似文献
27.
Shumin Zhai Jing Kong Xiangshi Ren 《International journal of human-computer studies》2004,61(6):823-856
Pointing tasks in human–computer interaction obey certain speed–accuracy tradeoff rules. In general, the more accurate the task to be accomplished, the longer it takes and vice versa. Fitts’ law models the speed–accuracy tradeoff effect in pointing as imposed by the task parameters, through Fitts’ index of difficulty (Id) based on the ratio of the nominal movement distance and the size of the target. Operating with different speed or accuracy biases, performers may utilize more or less area than the target specifies, introducing another subjective layer of speed–accuracy tradeoff relative to the task specification. A conventional approach to overcome the impact of the subjective layer of speed–accuracy tradeoff is to use the a posteriori “effective” pointing precision We in lieu of the nominal target width W. Such an approach has lacked a theoretical or empirical foundation. This study investigates the nature and the relationship of the two layers of speed–accuracy tradeoff by systematically controlling both Id and the index of target utilization Iu in a set of four experiments. Their results show that the impacts of the two layers of speed–accuracy tradeoff are not fundamentally equivalent. The use of We could indeed compensate for the difference in target utilization, but not completely. More logical Fitts’ law parameter estimates can be obtained by the We adjustment, although its use also lowers the correlation between pointing time and the index of difficulty. The study also shows the complex interaction effect between Id and Iu, suggesting that a simple and complete model accommodating both layers of speed–accuracy tradeoff may not exist. 相似文献
28.
基于概念网络的文本信息监控技术 总被引:1,自引:0,他引:1
由于网上信息的迅速增长,文本信息监控已经成为网上信息管理中的热点研究课题。本文在模糊集和语义网络的理论基础上,构建了模糊值动态约束性概念网络,介绍了该概念网络的基本构建方法,并提出了基于概念网络的文本分析算法。 相似文献
29.
Evaluate the performance of a stochastic-flow network with cost attribute in terms of minimal cuts 总被引:2,自引:0,他引:2
This paper proposes a performance index to measure the quality level of a stochastic-flow network in which each node has a designated capacity, which will have different lower levels due to various partial and complete failures. The performance index is the probability that the maximum flow of the network equals the demand d without exceeding the budget b. A simple algorithm in terms of minimal cuts is first proposed to generate all upper boundary points for (d, b), and then the probability that the maximum flow is less than or equal to d can be calculated in terms of such points. The upper boundary point for (d, b) is a maximal vector representing the capacity of each arc such that the maximum flow of the network under the budget b is d. The performance index can be calculated by repeating the proposed algorithm to obtain all upper boundary point for (d−1, b). A benchmark example is shown to illustrate the solution procedure. 相似文献
30.
This paper investigates the title problem from the perspective ofdetermining which forcesystems, although different, will have the same dynamic effectwhen applied to a mechanical system.A procedure is presented for determining how differences incontrol force/moment input are nullifiedby constraints on the system. This in turn provides a basis foroptimal control. The theoreticaldevelopment is illustrated by a series of examples with a model ofa redundant manipulator – a constrained/controlled triple pendulum. 相似文献