全文获取类型
收费全文 | 38842篇 |
免费 | 4274篇 |
国内免费 | 2181篇 |
专业分类
电工技术 | 3069篇 |
技术理论 | 3篇 |
综合类 | 4912篇 |
化学工业 | 2053篇 |
金属工艺 | 747篇 |
机械仪表 | 1869篇 |
建筑科学 | 4752篇 |
矿业工程 | 2000篇 |
能源动力 | 1122篇 |
轻工业 | 4282篇 |
水利工程 | 2175篇 |
石油天然气 | 4310篇 |
武器工业 | 868篇 |
无线电 | 2520篇 |
一般工业技术 | 2560篇 |
冶金工业 | 1209篇 |
原子能技术 | 288篇 |
自动化技术 | 6558篇 |
出版年
2024年 | 238篇 |
2023年 | 627篇 |
2022年 | 1156篇 |
2021年 | 1389篇 |
2020年 | 1508篇 |
2019年 | 1230篇 |
2018年 | 1184篇 |
2017年 | 1267篇 |
2016年 | 1591篇 |
2015年 | 1632篇 |
2014年 | 2744篇 |
2013年 | 2419篇 |
2012年 | 3108篇 |
2011年 | 3202篇 |
2010年 | 2315篇 |
2009年 | 2377篇 |
2008年 | 2153篇 |
2007年 | 2577篇 |
2006年 | 2247篇 |
2005年 | 1966篇 |
2004年 | 1580篇 |
2003年 | 1321篇 |
2002年 | 961篇 |
2001年 | 864篇 |
2000年 | 647篇 |
1999年 | 559篇 |
1998年 | 406篇 |
1997年 | 394篇 |
1996年 | 317篇 |
1995年 | 268篇 |
1994年 | 205篇 |
1993年 | 156篇 |
1992年 | 101篇 |
1991年 | 104篇 |
1990年 | 66篇 |
1989年 | 81篇 |
1988年 | 37篇 |
1987年 | 37篇 |
1986年 | 30篇 |
1985年 | 25篇 |
1984年 | 29篇 |
1983年 | 32篇 |
1982年 | 15篇 |
1981年 | 13篇 |
1979年 | 11篇 |
1978年 | 9篇 |
1977年 | 8篇 |
1975年 | 7篇 |
1963年 | 7篇 |
1959年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
61.
系统地评述了车辆四轮转向系统的原理及其控制方法的发展,在此基础上指出四轮转向系统的研究必须以闭环综合评价为出发点,并与其它主动安全技术相结合才能真正达到实用阶段。 相似文献
62.
对给排水专业在优化专业教学体系,深化专科教学模式及教学内容改革中,实施的四次大型综合性实践教学,进行了认真总结.经过改变随课跟进的实验教学旧模式,在教学计划中增设了“水质指标综合测试与水质评价”实习内容使分散的教学实验得以“水质监测与评价”为骨架,有机穿插在实践教学中,为专科学校培养复合应用型人才,进行了有益的探索与实践,并获得较好效果. 相似文献
63.
以微型计算机原理及应用课程网络教学改革为例,详细介绍一种基于网络资源利用的主题协作学习的模式,并提出网络环境下学生学习态度、网络教学环境、教师指导和自我评价表质量等建议。 相似文献
64.
65.
We consider the determinism checking of XML Schema content models, as required by the W3C Recommendation. We argue that currently applied solutions have flaws and make processors vulnerable to exponential resource needs by pathological schemas, and we help to eliminate this potential vulnerability of XML Schema based systems. XML Schema content models are essentially regular expressions extended with numeric occurrence indicators. A previously published polynomial-time solution to check the determinism of such expressions is improved to run in linear time, and the improved algorithm is implemented and evaluated experimentally. When compared to the corresponding method of a popular production-quality XML Schema processor, the new implementation runs orders of magnitude faster. Enhancing the solution to take further extensions of XML Schema into account without compromising its linear scalability is also discussed. 相似文献
66.
Yang et al. [J.P. Yang, S.H. Cheng, Q. Wu, Recursive equations for compound distribution with the severity distribution of the mixed type, Science in China Series A 48 (2005) 594-609] investigated a recursive procedure for a kind of compound distributions with the number of claims belonging to (a,b)-family and the severity distribution of the mixed type. In this paper, we extend their results by assuming that the claim number belongs to a larger class. As applications, the excess-of-loss reinsurance treaty is discussed and concrete examples are considered in some detail. 相似文献
67.
Adrian Fernandez Emilio Insfran Silvia Abrahão 《Information and Software Technology》2011,53(8):789-817
Context
In recent years, many usability evaluation methods (UEMs) have been employed to evaluate Web applications. However, many of these applications still do not meet most customers’ usability expectations and many companies have folded as a result of not considering Web usability issues. No studies currently exist with regard to either the use of usability evaluation methods for the Web or the benefits they bring.Objective
The objective of this paper is to summarize the current knowledge that is available as regards the usability evaluation methods (UEMs) that have been employed to evaluate Web applications over the last 14 years.Method
A systematic mapping study was performed to assess the UEMs that have been used by researchers to evaluate Web applications and their relation to the Web development process. Systematic mapping studies are useful for categorizing and summarizing the existing information concerning a research question in an unbiased manner.Results
The results show that around 39% of the papers reviewed reported the use of evaluation methods that had been specifically crafted for the Web. The results also show that the type of method most widely used was that of User Testing. The results identify several research gaps, such as the fact that around 90% of the studies applied evaluations during the implementation phase of the Web application development, which is the most costly phase in which to perform changes. A list of the UEMs that were found is also provided in order to guide novice usability practitioners.Conclusions
From an initial set of 2703 papers, a total of 206 research papers were selected for the mapping study. The results obtained allowed us to reach conclusions concerning the state-of-the-art of UEMs for evaluating Web applications. This allowed us to identify several research gaps, which subsequently provided us with a framework in which new research activities can be more appropriately positioned, and from which useful information for novice usability practitioners can be extracted. 相似文献68.
Prakash Ramanan 《Journal of Computer and System Sciences》2009,75(8):465-485
We consider the XPath evaluation problem: Evaluate an XPath query Q on a streaming XML document D; i.e., determine the set Q(D) of document elements selected by Q. We mainly consider Conjunctive XPath queries that involve only the child and descendant axes. Previously known in-memory algorithms for this problem use O(|D|) space and O(|Q||D|) time. Several previously known algorithms for the streaming version use Ω(dn) space and Ω(dn|D|) time in the worst case; d denotes the depth of D, and n denotes the number of location steps in Q. Their exponential space requirement could well exceed the O(|D|) space used by the in-memory algorithms. We present an efficient algorithm that uses O(d|Q|+nc) space and O((|Q|+dn)|D|) time in the worst case; c denotes the maximum number of elements of D that can be candidates for output, at any one instant. For some worst case Q and D, the memory space used by our algorithm matches our lower bound proved in a different paper; so, our algorithm uses optimal memory space in the worst case. 相似文献
69.
70.