全文获取类型
收费全文 | 397524篇 |
免费 | 3939篇 |
国内免费 | 869篇 |
专业分类
电工技术 | 6835篇 |
综合类 | 307篇 |
化学工业 | 61952篇 |
金属工艺 | 21368篇 |
机械仪表 | 14571篇 |
建筑科学 | 7565篇 |
矿业工程 | 4868篇 |
能源动力 | 7974篇 |
轻工业 | 21308篇 |
水利工程 | 6029篇 |
石油天然气 | 16373篇 |
武器工业 | 52篇 |
无线电 | 37310篇 |
一般工业技术 | 93137篇 |
冶金工业 | 59490篇 |
原子能技术 | 14050篇 |
自动化技术 | 29143篇 |
出版年
2021年 | 4254篇 |
2019年 | 4118篇 |
2018年 | 7740篇 |
2017年 | 7992篇 |
2016年 | 8557篇 |
2015年 | 4796篇 |
2014年 | 8066篇 |
2013年 | 17040篇 |
2012年 | 11548篇 |
2011年 | 14280篇 |
2010年 | 11668篇 |
2009年 | 13017篇 |
2008年 | 13132篇 |
2007年 | 12668篇 |
2006年 | 10562篇 |
2005年 | 9451篇 |
2004年 | 8948篇 |
2003年 | 8646篇 |
2002年 | 8377篇 |
2001年 | 8274篇 |
2000年 | 8092篇 |
1999年 | 7595篇 |
1998年 | 16348篇 |
1997年 | 12073篇 |
1996年 | 9150篇 |
1995年 | 7090篇 |
1994年 | 6402篇 |
1993年 | 6691篇 |
1992年 | 5388篇 |
1991年 | 5460篇 |
1990年 | 5398篇 |
1989年 | 5205篇 |
1988年 | 5115篇 |
1987年 | 4800篇 |
1986年 | 4759篇 |
1985年 | 5200篇 |
1984年 | 4973篇 |
1983年 | 4771篇 |
1982年 | 4434篇 |
1981年 | 4465篇 |
1980年 | 4525篇 |
1979年 | 4718篇 |
1978年 | 4839篇 |
1977年 | 5032篇 |
1976年 | 5776篇 |
1975年 | 4451篇 |
1974年 | 4467篇 |
1973年 | 4562篇 |
1972年 | 4056篇 |
1971年 | 3707篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
141.
A. N. Prikhod'ko 《Cybernetics and Systems Analysis》1994,30(4):591-603
Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 140–155, July–August 1994. 相似文献
142.
143.
Conclusion In the optimization problem [f
0(x)│hi(x)<-0,i=1,…,l] relaxation of the functionf
0(x)+Nh+(x) does not produce, as we know [6, 7], αk=1 in Newton's method with the auxiliary problem (5), (6), whereF(x)=f
0′(x). For this reason, Newton type methods based on relaxation off
0(x)+Nh+(x) are not superlinearly convergent (so-called Maratos effect). The results of this article indicate that if (F(x)=f
0′(x), then replacement of the initial optimization problem with a larger equivalent problem (7) eliminates the Maratos effect
in the proposed quasi-Newton method. This result is mainly of theoretical interest, because Newton type optimization methods
in the space of the variablesx ∈R
n are less complex. However to the best of our knowledge, the difficulties with nonlocal convergence arising in these methods
(choice of parameters, etc.) have not been fully resolved [10, 11]. The discussion of these difficulties and comparison with
the proposed method fall outside the scope of the present article, which focuses on solution of variational inequalities (1),
(2) for the general caseF′(x)≠F′
T(x).
Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 78–91, November–December, 1994. 相似文献
144.
145.
146.
Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 95–112, March–April, 1994. 相似文献
147.
N. Yu. Kuznetsov 《Cybernetics and Systems Analysis》1994,30(3):419-439
Published in Kibernetika i Sistemnyi Analiz, No. 3, pp. 128–150, May–June, 1994. 相似文献
148.
149.
Panagiotis N. Zarros Myung J. Lee Tarek N. Saadawi 《Journal of Network and Systems Management》1994,2(4):361-382
In this paper, an algorithm to determine the set of packets generated continuously and periodically from different participants that are arriving at a node either for mixing at the master of a conference, or for simply playing back at a regular participant of a conference, is proposed. The essence of the algorithm is to estimate the expected packet arrival time (or reference time) for each participant. With the reference time at hand, the maximum jitter and the optimum waiting time for a mixer to wait packets from all participants can be determined. An enhancement to improve synchronization which deals with the estimation of the time offsets between the individual periods of the sources and the period of the receiver is also presented. The error of the proposed algorithm is enumerated by the Chernoff bound and demonstrated by simulation and is shown to be acceptable in practical application. The algorithm can also be employed when traffic sources operate with different periods. 相似文献
150.