全文获取类型
收费全文 | 195068篇 |
免费 | 18276篇 |
国内免费 | 11652篇 |
专业分类
电工技术 | 14126篇 |
技术理论 | 7篇 |
综合类 | 15765篇 |
化学工业 | 29342篇 |
金属工艺 | 11661篇 |
机械仪表 | 12631篇 |
建筑科学 | 15684篇 |
矿业工程 | 6003篇 |
能源动力 | 5456篇 |
轻工业 | 15557篇 |
水利工程 | 4556篇 |
石油天然气 | 10201篇 |
武器工业 | 1821篇 |
无线电 | 22174篇 |
一般工业技术 | 21109篇 |
冶金工业 | 8638篇 |
原子能技术 | 2973篇 |
自动化技术 | 27292篇 |
出版年
2024年 | 1008篇 |
2023年 | 3185篇 |
2022年 | 6144篇 |
2021年 | 8270篇 |
2020年 | 6265篇 |
2019年 | 4948篇 |
2018年 | 5393篇 |
2017年 | 6177篇 |
2016年 | 5310篇 |
2015年 | 7871篇 |
2014年 | 9713篇 |
2013年 | 11619篇 |
2012年 | 13415篇 |
2011年 | 14291篇 |
2010年 | 13092篇 |
2009年 | 12517篇 |
2008年 | 12327篇 |
2007年 | 11919篇 |
2006年 | 11368篇 |
2005年 | 9409篇 |
2004年 | 7008篇 |
2003年 | 6309篇 |
2002年 | 6432篇 |
2001年 | 5819篇 |
2000年 | 4698篇 |
1999年 | 3991篇 |
1998年 | 2962篇 |
1997年 | 2486篇 |
1996年 | 2294篇 |
1995年 | 1991篇 |
1994年 | 1582篇 |
1993年 | 1128篇 |
1992年 | 936篇 |
1991年 | 733篇 |
1990年 | 540篇 |
1989年 | 489篇 |
1988年 | 384篇 |
1987年 | 266篇 |
1986年 | 182篇 |
1985年 | 114篇 |
1984年 | 81篇 |
1983年 | 64篇 |
1982年 | 74篇 |
1981年 | 56篇 |
1980年 | 56篇 |
1979年 | 26篇 |
1978年 | 4篇 |
1965年 | 5篇 |
1959年 | 25篇 |
1951年 | 13篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
992.
993.
994.
995.
996.
On the complexity of and algorithms for finding the shortest path with a disjoint counterpart 总被引:4,自引:0,他引:4
Dahai Xu Yang Chen Yizhi Xiong Chunming Qiao Xin He 《Networking, IEEE/ACM Transactions on》2006,14(1):147-158
Finding a disjoint path pair is an important component in survivable networks. Since the traffic is carried on the active (working) path most of the time, it is useful to find a disjoint path pair such that the length of the shorter path (to be used as the active path) is minimized. In this paper, we first address such a Min-Min problem. We prove that this problem is NP-complete in either single link cost (e.g., dedicated backup bandwidth) or dual link cost (e.g., shared backup bandwidth) networks. In addition, it is NP-hard to obtain a K-approximation to the optimal solution for any K>1. Our proof is extended to another open question regarding the computational complexity of a restricted version of the Min-Sum problem in an undirected network with ordered dual cost links (called the MSOD problem). To solve the Min-Min problem efficiently, we introduce a novel concept called conflicting link set which provides insights into the so-called trap problem, and develop a divide-and-conquer strategy. The result is an effective heuristic for the Min-Min problem called COnflicting Link Exclusion (COLE), which can outperform other approaches in terms of both the optimality and running time. We also apply COLE to the MSOD problem to efficiently provide shared path protection and conduct comprehensive performance evaluation as well as comparison of various schemes for shared path protection. We show that COLE not only processes connection requests much faster than existing integer linear programming (ILP)-based approaches but also achieves a good balance among the active path length, bandwidth efficiency, and recovery time. 相似文献
997.
We consider a special growth-curve (SGC) model with a known steering matrix and generalized waveform in the presence of unknown interference and noise. Several estimators of the complex amplitude based on this model are derived, including the methods of approximate maximum likelihood (AML), minimum variance distortionless response (MVDR), and amplitude and phase estimation (APES). We analyze the statistical properties of these estimators and show that in the presence of temporally white but spatially correlated noise and interference, AML is asymptotically statistically efficient for a large snapshot number while MVDR and APES are asymptotically equivalent but not statistically efficient. Via several numerical examples, we also show that when the noise and interference are both spatially and temporally correlated, the APES estimator can achieve better estimation accuracy and exhibit greater robustness than the other methods. 相似文献
998.
Jamming sensor networks: attack and defense strategies 总被引:1,自引:0,他引:1
Wireless sensor networks are built upon a shared medium that makes it easy for adversaries to conduct radio interference, or jamming, attacks that effectively cause a denial of service of either transmission or reception functionalities. These attacks can easily be accomplished by an adversary by either bypassing MAC-layer protocols or emitting a radio signal targeted at jamming a particular channel. In this article we survey different jamming attacks that may be employed against a sensor network. In order to cope with the problem of jamming, we discuss a two-phase strategy involving the diagnosis of the attack, followed by a suitable defense strategy. We highlight the challenges associated with detecting jamming. To cope with jamming, we propose two different but complementary approaches. One approach is to simply retreat from the interferer which may be accomplished by either spectral evasion (channel surfing) or spatial evasion (spatial retreats). The second approach aims to compete more actively with the interferer by adjusting resources, such as power levels and communication coding, to achieve communication in the presence of the jammer. 相似文献
999.
Zhi Li Guanrong Chen 《Circuits and Systems II: Express Briefs, IEEE Transactions on》2006,53(1):28-33
Global synchronization and asymptotic stability of complex dynamical networks are investigated in this paper. Based on a reference state, a sufficient condition for global synchronization and stability is derived. Unlike other approaches where only local results were obtained, the complex network is not linearized in this paper. Instead, the sufficient condition for the global synchronization and asymptotical stability is obtained here by introducing a reference state with the Lyapunov stability theorem rather than the Lyapunov exponents, and this condition is simply given in terms of the network coupling matrix therefore is very convenient to use. Furthermore, the developed technique is applied to networks consisting of nodes with unknown but bounded nonlinear functions. A typical example of a complex network with chaotic nodes is finally used to verify the theoretical results and the effectiveness of the proposed synchronization scheme. 相似文献
1000.
介绍了正在编写的《电工学习题精解》一书的内容结构、主要特色及编写思路。 相似文献