全文获取类型
收费全文 | 48699篇 |
免费 | 4980篇 |
国内免费 | 3353篇 |
专业分类
电工技术 | 2782篇 |
技术理论 | 4篇 |
综合类 | 5370篇 |
化学工业 | 6738篇 |
金属工艺 | 3334篇 |
机械仪表 | 2088篇 |
建筑科学 | 3673篇 |
矿业工程 | 2699篇 |
能源动力 | 2257篇 |
轻工业 | 3536篇 |
水利工程 | 1645篇 |
石油天然气 | 2955篇 |
武器工业 | 853篇 |
无线电 | 4648篇 |
一般工业技术 | 5211篇 |
冶金工业 | 3262篇 |
原子能技术 | 1084篇 |
自动化技术 | 4893篇 |
出版年
2024年 | 192篇 |
2023年 | 638篇 |
2022年 | 1313篇 |
2021年 | 1572篇 |
2020年 | 1795篇 |
2019年 | 1507篇 |
2018年 | 1453篇 |
2017年 | 1873篇 |
2016年 | 2049篇 |
2015年 | 2033篇 |
2014年 | 3071篇 |
2013年 | 3354篇 |
2012年 | 3759篇 |
2011年 | 3797篇 |
2010年 | 2833篇 |
2009年 | 2836篇 |
2008年 | 2561篇 |
2007年 | 3089篇 |
2006年 | 2643篇 |
2005年 | 2275篇 |
2004年 | 1955篇 |
2003年 | 1660篇 |
2002年 | 1422篇 |
2001年 | 1211篇 |
2000年 | 1055篇 |
1999年 | 860篇 |
1998年 | 707篇 |
1997年 | 615篇 |
1996年 | 567篇 |
1995年 | 484篇 |
1994年 | 373篇 |
1993年 | 274篇 |
1992年 | 263篇 |
1991年 | 202篇 |
1990年 | 180篇 |
1989年 | 126篇 |
1988年 | 91篇 |
1987年 | 58篇 |
1986年 | 54篇 |
1985年 | 39篇 |
1984年 | 37篇 |
1983年 | 22篇 |
1982年 | 22篇 |
1981年 | 18篇 |
1980年 | 17篇 |
1979年 | 6篇 |
1978年 | 8篇 |
1977年 | 7篇 |
1975年 | 9篇 |
1959年 | 9篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
61.
62.
本文着重分析了社交网站常见的法律问题,并通过比较研究各国的做法,试图总结出我国加强社交网站管理的监管措施。 相似文献
63.
提出一种多重查询调度算法——连续读取特性(CRP)调度算法,该算法应用连续读取特性,使查询的数据可以重组出某些连续关系,从而使之具有连续读取特性,解决了现有算法中有部分系统资源闲置的问题,提高查询速度。仿真实验结果表明,CRP调度算法的系统利用率和系统性能均优于其他算法。 相似文献
64.
65.
66.
针对多数无线传感器网络时钟同步方案存在的仅纠正时钟偏移问题,提出一种新的解决方案,整合时钟偏移同步和时钟速率同步,通过3个连续的消息传输实现单跳同步,采用分层的生成树实现多跳同步。仿真实验结果表明,与现有的同步方案比较,该方案的同步错误更小,能够获得更长的再同步周期。 相似文献
67.
In this paper, a cold standby repairable system consisting of two dissimilar components and one repairman is studied. When failures occur, the repair of both component 1 and component 2 are not ‘as good as new’. The consecutive operating times of component 1 after repair constitute a decreasing geometric process, while the repair times of component 1 are independent and identically distributed. For component 2, its failure is rectified by minimal repair, and the repair time is negligible. Component 1 has priority in use when both components are good. The replacement policy N is based on the failure number of component 1. Under policy N, we derive the explicit expression of the long-run average cost rate C(N) as well as the average number of repairs of component 2 before the system replaced. The optimal replacement policy N*, which minimises the long-run average cost rate C(N), is obtained theoretically. If the failure rate r(t) of component 2 is increasing, the existence and uniqueness of the optimal policy N* is also proved. Finally, a numerical example is given to validate the developed theoretical model. Some sensitivity analyses are provided to show the influence of some parameters, such as the costs for replacement and repair, and the parameters of the lifetime and repair time distributions of both components, to the optimal replacement policy N* and corresponding average cost rate C(N*). 相似文献
68.
69.
Active worms have posed a major security threat to the Internet and many research efforts have focused on them. However, defending against them remains challenging due to their continuous evolution. In this paper, we study a new class of defense-oriented evolved worms, the Varying Scan Rate worm (the VSR worm in short). In order to circumvent detection by existing worm detection schemes, the VSR worm deliberately varies its scan rate according to these schemes’ weaknesses. To counteract the VSR worm, we design a new worm-detection scheme, the attack-target Distribution Entropy-based Dynamic detection scheme (DED detection for short). DED detection utilizes the attack-target distribution and robust statistical feature in conjunction with dynamic decision adaptation to distinguish worm-scan traffic from non-worm-scan traffic. We present a comparatively complete space of detection schemes and conduct extensive performance evaluations on the DED detection scheme compared with other schemes, using real-world Internet traces as background scan traffic. Our data clearly demonstrate the effectiveness of the DED detection scheme in detecting both the VSR worm and the traditional worm. 相似文献
70.
Vidroha Debroy Author VitaeW. Eric WongAuthor Vitae 《Journal of Systems and Software》2011,84(4):587-602
Test set size in terms of the number of test cases is an important consideration when testing software systems. Using too few test cases might result in poor fault detection and using too many might be very expensive and suffer from redundancy. We define the failure rate of a program as the fraction of test cases in an available test pool that result in execution failure on that program. This paper investigates the relationship between failure rates and the number of test cases required to detect the faults. Our experiments based on 11 sets of C programs suggest that an accurate estimation of failure rates of potential fault(s) in a program can provide a reliable estimate of adequate test set size with respect to fault detection and should therefore be one of the factors kept in mind during test set construction. Furthermore, the model proposed herein is fairly robust to incorrect estimations in failure rates and can still provide good predictive quality. Experiments are also performed to observe the relationship between multiple faults present in the same program using the concept of a failure rate. When predicting the effectiveness against a program with multiple faults, results indicate that not knowing the number of faults in the program is not a significant concern, as the predictive quality is typically not affected adversely. 相似文献