全文获取类型
收费全文 | 2143篇 |
免费 | 217篇 |
国内免费 | 107篇 |
专业分类
电工技术 | 133篇 |
综合类 | 104篇 |
化学工业 | 119篇 |
金属工艺 | 57篇 |
机械仪表 | 275篇 |
建筑科学 | 58篇 |
矿业工程 | 25篇 |
能源动力 | 42篇 |
轻工业 | 196篇 |
水利工程 | 10篇 |
石油天然气 | 79篇 |
武器工业 | 20篇 |
无线电 | 184篇 |
一般工业技术 | 105篇 |
冶金工业 | 47篇 |
原子能技术 | 19篇 |
自动化技术 | 994篇 |
出版年
2024年 | 5篇 |
2023年 | 18篇 |
2022年 | 22篇 |
2021年 | 29篇 |
2020年 | 36篇 |
2019年 | 29篇 |
2018年 | 44篇 |
2017年 | 56篇 |
2016年 | 43篇 |
2015年 | 64篇 |
2014年 | 139篇 |
2013年 | 128篇 |
2012年 | 174篇 |
2011年 | 177篇 |
2010年 | 129篇 |
2009年 | 127篇 |
2008年 | 141篇 |
2007年 | 151篇 |
2006年 | 146篇 |
2005年 | 93篇 |
2004年 | 95篇 |
2003年 | 98篇 |
2002年 | 75篇 |
2001年 | 59篇 |
2000年 | 39篇 |
1999年 | 44篇 |
1998年 | 30篇 |
1997年 | 31篇 |
1996年 | 30篇 |
1995年 | 34篇 |
1994年 | 24篇 |
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篇 |
排序方式: 共有2467条查询结果,搜索用时 15 毫秒
31.
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. 相似文献
32.
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. 相似文献
33.
34.
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. 相似文献
35.
36.
37.
38.
We illustrate procedures to identify a state-space representation of a lossless or dissipative system from a given noise-free trajectory; important special cases are passive systems and bounded-real systems. Computing a rank-revealing factorization of a Gramian-like matrix constructed from the data, a state sequence can be obtained; the state-space equations are then computed by solving a system of linear equations. This idea is also applied to perform model reduction by obtaining a balanced realization directly from data and truncating it to obtain a reduced-order model. 相似文献
39.
Research on the robustness of fuzzy logic systems (FLSs), an imperative factor in the design process, is very limited in the literature. Specifically, when a system is subjected to small deviations of the sampling points (operating points), it is of great interest to find the maximum tolerance of the system, which we refer to as the system’s robustness. In this paper, we present a methodology for the robustness analysis of interval type-2 FLSs (IT2 FLSs) that also holds for T1 FLSs, hence, making it more general. A procedure for the design of robust IT2 FLSs with a guaranteed performance better than or equal to their T1 counterparts is then proposed. Several examples are performed to demonstrate the effectiveness of the proposed methodologies. It was concluded that both T1 and IT2 FLSs can be designed to achieve robust behavior in various applications, and preference one or the other, in general, is application-dependant. IT2 FLSs, having a more flexible structure than T1 FLSs, exhibited relatively small approximation errors in the several examples investigated. The methodologies presented in this paper lay the foundation for the design of FLSs with robust properties that will be very useful in many practical modeling and control applications. 相似文献
40.
标签运动状态下的RFID系统反碰撞算法 总被引:1,自引:0,他引:1
针对现实应用中标签经常处于运动状态的情况,对传送带模型下的无线射频识别(RFID)系统进行了分析,并使用Matlab做了相应的仿真实验。结果证明,当标签密度D与传送带速度V保持不变时,识别率P在帧长度N与作用范围内未识别标签数n相等时最高。当时隙持续时间一定时,识别率P只与V和D有关,而与作用区域内传送带长度L无关。同时针对该模型,对现有的标签估算方法进行了修正,在此基础上提出了一种新的估算方法,该方法的准确度在标签数目较大时有着明显的提高。 相似文献