全文获取类型
收费全文 | 1961篇 |
免费 | 216篇 |
国内免费 | 104篇 |
专业分类
电工技术 | 78篇 |
综合类 | 99篇 |
化学工业 | 117篇 |
金属工艺 | 46篇 |
机械仪表 | 221篇 |
建筑科学 | 51篇 |
矿业工程 | 24篇 |
能源动力 | 41篇 |
轻工业 | 195篇 |
水利工程 | 9篇 |
石油天然气 | 77篇 |
武器工业 | 19篇 |
无线电 | 159篇 |
一般工业技术 | 93篇 |
冶金工业 | 46篇 |
原子能技术 | 18篇 |
自动化技术 | 988篇 |
出版年
2024年 | 3篇 |
2023年 | 16篇 |
2022年 | 20篇 |
2021年 | 27篇 |
2020年 | 31篇 |
2019年 | 28篇 |
2018年 | 39篇 |
2017年 | 53篇 |
2016年 | 37篇 |
2015年 | 57篇 |
2014年 | 132篇 |
2013年 | 122篇 |
2012年 | 167篇 |
2011年 | 163篇 |
2010年 | 123篇 |
2009年 | 115篇 |
2008年 | 134篇 |
2007年 | 142篇 |
2006年 | 131篇 |
2005年 | 82篇 |
2004年 | 78篇 |
2003年 | 92篇 |
2002年 | 67篇 |
2001年 | 54篇 |
2000年 | 33篇 |
1999年 | 40篇 |
1998年 | 26篇 |
1997年 | 28篇 |
1996年 | 28篇 |
1995年 | 33篇 |
1994年 | 23篇 |
1993年 | 22篇 |
1992年 | 14篇 |
1991年 | 9篇 |
1990年 | 11篇 |
1989年 | 11篇 |
1988年 | 2篇 |
1987年 | 3篇 |
1986年 | 7篇 |
1985年 | 7篇 |
1984年 | 13篇 |
1983年 | 6篇 |
1982年 | 9篇 |
1981年 | 15篇 |
1980年 | 11篇 |
1979年 | 4篇 |
1978年 | 8篇 |
1977年 | 5篇 |
排序方式: 共有2281条查询结果,搜索用时 78 毫秒
71.
72.
73.
74.
75.
76.
We develop theory on the efficiency of identifying (learning) timed automata. In particular, we show that: (i) deterministic timed automata cannot be identified efficiently in the limit from labeled data and (ii) that one-clock deterministic timed automata can be identified efficiently in the limit from labeled data. We prove these results based on the distinguishability of these classes of timed automata. More specifically, we prove that the languages of deterministic timed automata cannot, and that one-clock deterministic timed automata can be distinguished from each other using strings in length bounded by a polynomial. In addition, we provide an algorithm that identifies one-clock deterministic timed automata efficiently from labeled data.Our results have interesting consequences for the power of clocks that are interesting also out of the scope of the identification problem. 相似文献
77.
Xiao-Xiao LiFan Yang 《Computers & Mathematics with Applications》2011,62(6):2497-2505
This paper deals with the ill-posed problem of determining an unknown source depending only on the spatial variable in the heat equation. In this problem, the truncation method is employed to get the regularization solution. Moreover, the Hölder type error estimate is also obtained between this regularization solution and the exact solution. Various typical examples are given to verify the efficiency and accuracy of the proposed method. 相似文献
78.
79.
Recently, Yang et al. proposed an efficient user identification scheme with key distribution, in which it is possible for the user to anonymously log into a system and establish a secret key shared with the system. Mangipudi and Katti later demonstrated a Deniable-of-Service (DoS) attack on the Yang et al. scheme and then proposed an improvement to withstand such an attack. However, this paper demonstrates an identity disclosure attack to show that neither schemes’ claimed user anonymity requirement can be achieved. We further propose a novel user identification scheme with key distribution preserving user anonymity for distributed computer networks. The proposed scheme not only withstands the attacks mentioned above, but also achieves the following: (i) user anonymity, (ii) key distribution, (iii) mutual authentication, and (iv) key confirmation. The performance of our scheme is of greater efficiency than that of previously proposed schemes in terms of communication costs and computational complexities. 相似文献
80.
Mahdi Aliyari Shoorehdeli Mohammad Teshnehlab Ali Khaki Sedigh 《Neural computing & applications》2009,18(2):157-174
This paper suggests novel hybrid learning algorithm with stable learning laws for adaptive network based fuzzy inference system
(ANFIS) as a system identifier and studies the stability of this algorithm. The new hybrid learning algorithm is based on
particle swarm optimization (PSO) for training the antecedent part and gradient descent (GD) for training the conclusion part.
Lyapunov stability theory is used to study the stability of the proposed algorithm. This paper, studies the stability of PSO
as an optimizer in training the identifier, for the first time. Stable learning algorithms for the antecedent and consequent
parts of fuzzy rules are proposed. Some constraints are obtained and simulation results are given to validate the results.
It is shown that instability will not occur for the leaning rate and PSO factors in the presence of constraints. The learning
rate can be calculated on-line and will provide an adaptive learning rate for the ANFIS structure. This new learning scheme
employs adaptive learning rate that is determined by input–output data. 相似文献