全文获取类型
收费全文 | 17729篇 |
免费 | 3061篇 |
国内免费 | 1841篇 |
专业分类
电工技术 | 4037篇 |
综合类 | 2395篇 |
化学工业 | 518篇 |
金属工艺 | 315篇 |
机械仪表 | 1524篇 |
建筑科学 | 301篇 |
矿业工程 | 370篇 |
能源动力 | 379篇 |
轻工业 | 373篇 |
水利工程 | 246篇 |
石油天然气 | 311篇 |
武器工业 | 289篇 |
无线电 | 2469篇 |
一般工业技术 | 1038篇 |
冶金工业 | 190篇 |
原子能技术 | 62篇 |
自动化技术 | 7814篇 |
出版年
2024年 | 55篇 |
2023年 | 228篇 |
2022年 | 486篇 |
2021年 | 573篇 |
2020年 | 577篇 |
2019年 | 570篇 |
2018年 | 543篇 |
2017年 | 685篇 |
2016年 | 842篇 |
2015年 | 955篇 |
2014年 | 1260篇 |
2013年 | 1136篇 |
2012年 | 1645篇 |
2011年 | 1730篇 |
2010年 | 1385篇 |
2009年 | 1427篇 |
2008年 | 1440篇 |
2007年 | 1613篇 |
2006年 | 1326篇 |
2005年 | 1003篇 |
2004年 | 692篇 |
2003年 | 506篇 |
2002年 | 410篇 |
2001年 | 286篇 |
2000年 | 272篇 |
1999年 | 161篇 |
1998年 | 122篇 |
1997年 | 121篇 |
1996年 | 97篇 |
1995年 | 87篇 |
1994年 | 70篇 |
1993年 | 52篇 |
1992年 | 55篇 |
1991年 | 41篇 |
1990年 | 47篇 |
1989年 | 41篇 |
1988年 | 25篇 |
1987年 | 12篇 |
1986年 | 13篇 |
1985年 | 8篇 |
1984年 | 8篇 |
1983年 | 2篇 |
1982年 | 8篇 |
1980年 | 4篇 |
1979年 | 3篇 |
1976年 | 2篇 |
1975年 | 2篇 |
1974年 | 1篇 |
1963年 | 1篇 |
1954年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
21.
Christos Bouras Agisilaos Konidaris 《International Journal of Communication Systems》2005,18(2):119-142
Redundant data transfers over the Web, can be mainly attributed to the repeated transfers of unchanged data. Web caches and Web proxies are some of the solutions that have been proposed, to deal with the issue of redundant data transfers. In this paper we focus on the efficient estimation and reduction of redundant data transfers over the Web. We first prove that a vast amount of redundant data is transferred in Web pages that are considered to carry fresh data. We show this by following an approach based on Web page fragmentation and manipulation. Web pages are broken down to fragments, based on specific criteria. We then deal with these fragments as independent constructors of the Web page and study their change patterns independently and in the context of the whole Web page. After the fragmentation process, we propose solutions for dealing with redundant data transfers. This paper has been based on our previous work on ‘Web Components’ but also on related work by other researchers. It utilises a proxy based, client/server architecture, and imposes changes to the algorithms executed on the Proxy server and on clients. We show that our proposed solution can considerably reduce the amount of redundant data transferred on the Web. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
22.
一个矢量形式的双圆弧插值算法 总被引:3,自引:1,他引:2
本文在分析数控插补最常用的双圆弧插值算法特点的基础上,将以局部坐标系中的三角运算为核心的传统双圆弧插值算法,改造成为以整体坐标系中的线性运算为核心的矢量形式的双圆弧插值算法,从而减少了计算的复杂性和程序的复杂性,提高了效率和可靠性。 相似文献
23.
24.
25.
线性时变系统的区间稳定性与鲁棒稳定性 总被引:7,自引:0,他引:7
本文应用向量比较定理研究线性时变系统的区间稳定性和具非线性时变摄动的线性时变系统的鲁棒稳定性,所得的新结果包含文献的一些主要结果作为特例,本文的研究方法说明向量比较方法是分析区间稳定性和鲁棒稳定性的一种自然而有力的工具。 相似文献
26.
Melt index is considered an important quality variable determining product specifications. Reliable prediction of melt index (MI) is crucial in quality control of practical propylene polymerization processes. In this paper a least squares support vector machines (LS‐SVM) soft‐sensor model of propylene polymerization process is developed to infer the MI of polypropylene from other process variables. Considering the use of a SSE cost function without regularization might lead to less robust estimates; the weighted least squares support vector machines (weighted LS‐SVM) approach of propylene polymerization process is further proposed to obtain a robust estimation of melt index. The performance of standard SVM model is taken as a basis of comparison. A detailed comparison research among the standard SVM, LS‐SVM, and weighted LS‐SVM models is carried out. The research results confirm the effectiveness of the presented methods. © 2006 Wiley Periodicals, Inc. J Appl Polym Sci 101: 285–289, 2006 相似文献
27.
应用现代可靠性理论,从设计、工艺、技术等方面对油田集输系统进行了可靠性探讨,提出了增强系统可靠性的措施。 相似文献
28.
Support vector clustering involves three steps—solving an optimization problem, identification of clusters and tuning of hyper-parameters. In this paper, we introduce a pre-processing step that eliminates data points from the training data that are not crucial for clustering. Pre-processing is efficiently implemented using the R*-tree data structure. Experiments on real-world and synthetic datasets show that pre-processing drastically decreases the run-time of the clustering algorithm. Also, in many cases reduction in the number of support vectors is achieved. Further, we suggest an improvement for the step of identification of clusters. 相似文献
29.
30.
P. I. Stetsyuk 《Cybernetics and Systems Analysis》2006,42(1):54-64
New quadratic models are proposed to improve the upper-bound estimates in the maximum weighted cut problem. They are found
by two original methods for deriving redundant quadratic constraints. A well-known linear model is shown to follow from the
models proposed. Recommendations on how to develop its strengthened analogs are given.
This study is partially sponsored from the grant UM2-2574-KV-03 (CRDF Cooperative Grants Program).
__________
Translated from Kibernetika i Sistemnyi Analiz, No. 1, pp. 63—75, January–February 2006. 相似文献