首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   160714篇
  免费   26397篇
  国内免费   7072篇
电工技术   10222篇
技术理论   12篇
综合类   10043篇
化学工业   34965篇
金属工艺   7295篇
机械仪表   9087篇
建筑科学   11787篇
矿业工程   3714篇
能源动力   4751篇
轻工业   16726篇
水利工程   2869篇
石油天然气   5855篇
武器工业   1479篇
无线电   21783篇
一般工业技术   24279篇
冶金工业   5434篇
原子能技术   1661篇
自动化技术   22221篇
  2025年   17篇
  2024年   1867篇
  2023年   2543篇
  2022年   4217篇
  2021年   6043篇
  2020年   6304篇
  2019年   6401篇
  2018年   6639篇
  2017年   7354篇
  2016年   7466篇
  2015年   9096篇
  2014年   10234篇
  2013年   12360篇
  2012年   11117篇
  2011年   10972篇
  2010年   10843篇
  2009年   10379篇
  2008年   9670篇
  2007年   8927篇
  2006年   8428篇
  2005年   6855篇
  2004年   5418篇
  2003年   5131篇
  2002年   5471篇
  2001年   4753篇
  2000年   3868篇
  1999年   2865篇
  1998年   1650篇
  1997年   1392篇
  1996年   1295篇
  1995年   998篇
  1994年   840篇
  1993年   642篇
  1992年   532篇
  1991年   372篇
  1990年   316篇
  1989年   235篇
  1988年   170篇
  1987年   101篇
  1986年   100篇
  1985年   61篇
  1984年   41篇
  1983年   33篇
  1982年   38篇
  1981年   29篇
  1980年   34篇
  1979年   11篇
  1976年   5篇
  1959年   10篇
  1951年   20篇
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
991.
Li–CO2 batteries are an attractive technology for converting CO2 into energy. However, the decomposition of insulating Li2CO3 on the cathode during discharge is a barrier to practical application. Here, it is demonstrated that a high loading of single Co atoms (≈5.3%) anchored on graphene oxide (adjacent Co/GO) acts as an efficient and durable electrocatalyst for Li–CO2 batteries. This targeted dispersion of atomic Co provides catalytically adjacent active sites to decompose Li2CO3. The adjacent Co/GO exhibits a highly significant sustained discharge capacity of 17 358 mA h g?1 at 100 mA g?1 for >100 cycles. Density functional theory simulations confirm that the adjacent Co electrocatalyst possesses the best performance toward the decomposition of Li2CO3 and maintains metallic‐like nature after the adsorption of Li2CO3.  相似文献   
992.
The lack of cost effective, industrial‐scale production methods hinders the widespread applications of graphene materials. In spite of its applicability in the mass production of graphene flakes, arc discharge has not received considerable attention because of its inability to control the synthesis and heteroatom doping. In this study, a facile approach is proposed for improving doping efficiency in N‐doped graphene synthesis through arc discharge by utilizing anodic carbon fillers. Compared to the N‐doped graphene (1–1.5% N) synthesized via the arc process according to previous literature, the resulting graphene flakes show a remarkably increased doping level (≈3.5% N) with noticeable graphitic N enrichment, which is rarely achieved by the conventional process, while simultaneously retaining high turbostratic crystallinity. The electrolyte ion storage of synthesized materials is examined in which synthesized N‐doped graphene material exhibits a remarkable area normalized capacitance of 63 µF cm?2. The surprisingly high areal capacitance, which is superior to that of most carbon materials, is attributed to the synergistic effect of extrinsic pseudocapacitance, high crystallinity, and abundance of exposed graphene edges. These results highlight the great potentials of N‐doped graphene flakes produced by arc discharge in graphene‐based supercapacitors, along with well‐studied active exfoliated graphene and reduced graphene oxide.  相似文献   
993.
994.
995.
996.
997.
998.
Energy consumption is one of the most important design constraints when building a wireless sensor and actuator network since each device in the network has a limited battery capacity, and prolonging the lifetime of the network depends on saving energy. Overcoming this challenge requires a smart and reconfigurable network energy management strategy. The Software‐Defined Networking (SDN) paradigm aims at building a flexible and dynamic network structure, especially in wireless sensor networks. In this study, we propose an SDN‐enabled wireless sensor and actuator network architecture that has a new routing discovery mechanism. To build a flexible and energy‐efficient network structure, a new routing decision approach that uses a fuzzy‐based Dijkstra's algorithm is developed in the study. The proposed architecture can change the existing path during data transmission, which is the key property of our model and is achieved through the adoption of the SDN approach. All the components and algorithms of the proposed system are modeled and simulated using the Riverbed Modeler software for more realistic performance evaluation. The results indicate that the proposed SDN‐enabled structure with fuzzy‐based Dijkstra's algorithm outperforms the one using the regular Dijkstra's and the ZigBee‐based counterpart, in terms of the energy consumption ratio, and the proposed architecture can provide an effective cluster routing while prolonging the network lifetime.  相似文献   
999.
Equal‐cost multipath (ECMP)–based traffic engineering (TE) methods are commonly used in intra–data center (DC) networks to improve the transmission performance for east‐west traffic (ie, traffic from server to server within a DC). However, applying ECMP on inter‐DC wide area network (WAN) offers limited performance enhancement as a result of irregular network topology. Since TE can be intelligently and efficiently realized with software‐defined networking (SDN), SDN‐based multipath becomes a popular option. However, SDN suffers from scalability issue caused by limited ternary content‐addressable memory (TCAM) size. In this paper, we propose an SDN‐based TE method called dynamic flow‐entry‐saving multipath (DFSM) for inter‐DC traffic forwarding. DFSM adopts source‐destination–based multipath forwarding and latency‐aware traffic splitting to reduce the consumption of flow entries and achieve load balancing. The evaluation results indicate that DFSM saves 15% to 30% of system flow entries in practical topologies and reduces the standard deviation of path latencies from 10% to 7% than do label‐switched tunneling, and also reduces average latency by 10% to 48% by consuming 6% to 20% more flow entries than do ECMP in less‐interconnected topologies. Note that the performance gain may not always be proportional to flow entry investment, with the interconnectivity between nodes being an important factor. The evaluation also indicates that per‐flow provision consumes several times the flow entries consumed by DFSM but reduces latency by 10% at most. Besides, DFSM reduces the standard deviation of path latencies from 14% to 7% than do even traffic splitting.  相似文献   
1000.
This paper considers the state‐dependent interference relay channel (SIRC) in which one of the two users may operate as a secondary user and the relay has a noncausal access to the signals from both users. For discrete memoryless SIRC, we first establish the achievable rate region by carefully merging Han‐Kobayashi rate splitting encoding technique, superposition encoding, and Gelfand‐Pinsker encoding technique. Then, based on the achievable rate region that we derive, the capacity of the SIRC is established in many different scenarios including (a) the weak interference regime, (b) the strong interference regime, and (c) the very strong interference regime. This means that our capacity results contain all available known results in the literature. Next, the achievable rate region and the associated capacity results are also evaluated in the case of additive Gaussian noise. Additionally, many numerical examples are investigated to show the value of our theoretical derivations.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号