全文获取类型
收费全文 | 10731篇 |
免费 | 1029篇 |
国内免费 | 559篇 |
专业分类
电工技术 | 605篇 |
技术理论 | 1篇 |
综合类 | 765篇 |
化学工业 | 1732篇 |
金属工艺 | 789篇 |
机械仪表 | 716篇 |
建筑科学 | 752篇 |
矿业工程 | 368篇 |
能源动力 | 292篇 |
轻工业 | 748篇 |
水利工程 | 222篇 |
石油天然气 | 712篇 |
武器工业 | 106篇 |
无线电 | 1179篇 |
一般工业技术 | 1289篇 |
冶金工业 | 515篇 |
原子能技术 | 129篇 |
自动化技术 | 1399篇 |
出版年
2024年 | 50篇 |
2023年 | 242篇 |
2022年 | 380篇 |
2021年 | 528篇 |
2020年 | 373篇 |
2019年 | 330篇 |
2018年 | 349篇 |
2017年 | 431篇 |
2016年 | 301篇 |
2015年 | 459篇 |
2014年 | 585篇 |
2013年 | 683篇 |
2012年 | 763篇 |
2011年 | 732篇 |
2010年 | 733篇 |
2009年 | 643篇 |
2008年 | 590篇 |
2007年 | 592篇 |
2006年 | 636篇 |
2005年 | 484篇 |
2004年 | 350篇 |
2003年 | 278篇 |
2002年 | 286篇 |
2001年 | 236篇 |
2000年 | 205篇 |
1999年 | 222篇 |
1998年 | 166篇 |
1997年 | 140篇 |
1996年 | 111篇 |
1995年 | 98篇 |
1994年 | 88篇 |
1993年 | 46篇 |
1992年 | 55篇 |
1991年 | 40篇 |
1990年 | 25篇 |
1989年 | 17篇 |
1988年 | 18篇 |
1987年 | 9篇 |
1986年 | 18篇 |
1985年 | 3篇 |
1984年 | 3篇 |
1983年 | 11篇 |
1982年 | 3篇 |
1981年 | 2篇 |
1980年 | 4篇 |
1951年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 234 毫秒
71.
Achieving fast and bandwidth-efficient shared-path protection 总被引:4,自引:0,他引:4
Yizhi Xiong Dahai Xu Chunming Qiao 《Lightwave Technology, Journal of》2003,21(2):365-371
Dynamic provisioning of restorable bandwidth guaranteed paths is a challenge in the design of broad-band transport networks, especially next-generation optical networks. A common approach is called (failure-independent) path protection, whereby for every mission-critical active path to be established, a link (or node) disjoint backup path (BP) is also established. To optimize network resource utilization, shared path protection should be adopted, which often allows a new BP to share the bandwidth allocated to some existing BPs. However, it usually leads the backup paths to use too many links, with zero cost in term of additional backup bandwidth, along its route. It will violate the restoration time guarantee. In this paper, we propose novel integer linear programming (ILP) formulations by introducing two parameters (/spl epsi/ and /spl mu/) in both the sharing with complete information (SCI) scheme and the distributed partial information management (DPIM) scheme. Our results show that the proposed ILP formulations can not only improve the network resource utilization effectively, but also keep the BPs as short as possible. 相似文献
72.
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. 相似文献
73.
Ying-Xia Du Qiao Yang Wang-Ting Lu Qing-Yu Guan Fei-Fei Cao Geng Zhang 《Advanced functional materials》2023,33(27):2300895
Single metal atom isolated in nitrogen-doped carbon materials (M N C) are effective electrocatalysts for oxygen reduction reaction (ORR), which produces H2O2 or H2O via 2-electron or 4-electron process. However, most of M N C catalysts can only present high selectivity for one product, and the selectivity is usually regulated by complicated structure design. Herein, a carbon black-supported Co N C catalyst (CB@Co N C) is synthesized. Tunable 2-electron/4-electron behavior is realized on CB@Co-N-C by utilizing its H2O2 yield dependence on electrolyte pH and catalyst loading. In acidic media with low catalyst loading, CB@Co N C presents excellent mass activity and high selectivity for H2O2 production. In flow cell with gas diffusion electrode, a H2O2 production rate of 5.04 mol h−1 g−1 is achieved by CB@Co N C on electrolyte circulation mode, and a long-term H2O2 production of 200 h is demonstrated on electrolyte non-circulation mode. Meanwhile, CB@Co N C exhibits a dominant 4-electron ORR pathway with high activity and durability in pH neutral media with high catalyst loading. The microbial fuel cell using CB@Co N C as the cathode catalyst shows a peak power density close to that of benchmark Pt/C catalyst. 相似文献
74.
Lubin Yang Xiaowei Wang Xiaomin Cheng Yongzheng Zhang Cheng Ma Yayun Zhang Jitong Wang Wenming Qiao Licheng Ling 《Advanced functional materials》2023,33(38):2303705
Lithium-sulfur batteries (LSBs) suffer from uncontrollable shuttling behavior of lithium polysulfides (LiPSs: Li2Sx, 4 ≤ x ≤8) and the sluggish reaction kinetics of bidirectional liquid-solid transformations, which are commonly coped through a comprehensive adsorption-catalysis strategy. Herein, a unique Fe N V pre-coordination is introduced to regulate the content of “dissociative Fe3+” in liquid phase, realizing the successful construction of N-doped micro-mesoporous “urchin-like” hollow carbon nanospheres decorated with single atom Fe-N4 sites and VN nanoparticles (denoted as SA-Fe/VN@NMC). The strong chemisorption ability toward LiPSs and catalyzed Li2S decomposition behavior on VN, along with the boosted reaction kinetics for sulfur reduction on SA-Fe sites are experimentally and theoretically evidenced. Moreover, the nanoscale-neighborhood distribution of VN and SA-Fe active sites presents synergistic effect for the anchoring-reduction-decomposition process of sulfur species. Thus SA-Fe/VN@NMC presents an optimized adsorption-catalysis effect for the whole sulfur conversion. Therefore, the SA-Fe/VN@NMC based Li-S cells exhibit high cyclic stability (a low decay of 0.024% per cycle over 700 cycles at 1 C, sulfur content: 70 wt%) and considerable rate performance (683.2 mAh g−1 at 4 C). Besides, a high areal capacity of 5.06 mAh cm−2 is retained after 100 cycles under the high sulfur loading of 5.6 mg cm−2. This work provides a new perspective to design the integrated electrocatalysts comprising hetero-formed bimetals in LSBs. 相似文献
75.
利用多圈光电编码器具有体积小、量程大以及数字量输出等优点,设计了基于双读数系统的航天级多圈绝对式光电编码器。根据航天相机的精度要求,采用精度高、分辨率高的绝对式矩阵玻璃码盘作为一级码盘完成角度测量;根据电机转动的计数要求,采用重量轻,体积小的绝对式矩阵金属码盘作为二级码盘完成对一级码盘的转动圈数计数;其具有的双狭缝及双读数系统可实现信号处理电路冷备份。按照鉴定级航天产品要求,通过热学环境实验和力学环境实验对编码器性能进行了验证。实验结果表明,所设计的编码器精度范围为±100″内、分辨率为80″、测量圈数为16圈、外形尺寸为φ50 mm×50 mm、重量为270 g,稳定性高、可靠性强,且满足高分辨率航天设备设计指标。 相似文献
76.
77.
应用数理统计理论及线性回归分析方法详细分析了在子孔径拼接检测中样本容量对测量精度的影响,通过计算确定了当子孔径拼接干涉检测中样本容量大于10 4时,即可保证检测精度,又能减小计算的复杂程度。 相似文献
78.
针对胶囊网络(capsule network,CapsNet)特 征提取结构单一和数据处理中参数量过大的问题,提出 多尺度混合注意力胶囊网络 模型。首先,在网络初始端添加不同尺度的卷积核来多角度提取 特征,并引 入混合注意力机制,通过聚焦更具分辨性的特征区域来降低复杂背景干扰。其次,采用局部 剪枝算法优 化动态路由,减少参数量,缩短模型训练时间。最后,在海洋鱼类数据集F4K(Fish4Knowled ge)上验证, 结果表明,与传统残差网络(residual network50,ResNet-50)、双线性网络(bilinear convo l utional neural network,B-CNN)、分层精简双线性注意力网络(spatial transformation netw ork and hierarchical compact bilinear pooling,STN-H-CBP)以及CapsNet模型相比,该算法 识别精度为98.65%,比ResNet-50模型提升 了5.92%;训练时间为2.2 h,相比于CapsNet 缩短了近40 min,验证了该算法的可行性。 相似文献
79.
80.