全文获取类型
收费全文 | 15911篇 |
免费 | 2312篇 |
国内免费 | 2078篇 |
专业分类
化学 | 9529篇 |
晶体学 | 149篇 |
力学 | 661篇 |
综合类 | 165篇 |
数学 | 1315篇 |
物理学 | 3690篇 |
无线电 | 4792篇 |
出版年
2024年 | 81篇 |
2023年 | 320篇 |
2022年 | 374篇 |
2021年 | 511篇 |
2020年 | 584篇 |
2019年 | 565篇 |
2018年 | 539篇 |
2017年 | 499篇 |
2016年 | 685篇 |
2015年 | 717篇 |
2014年 | 942篇 |
2013年 | 1109篇 |
2012年 | 1176篇 |
2011年 | 1242篇 |
2010年 | 983篇 |
2009年 | 997篇 |
2008年 | 1072篇 |
2007年 | 952篇 |
2006年 | 934篇 |
2005年 | 751篇 |
2004年 | 734篇 |
2003年 | 639篇 |
2002年 | 763篇 |
2001年 | 606篇 |
2000年 | 455篇 |
1999年 | 385篇 |
1998年 | 275篇 |
1997年 | 212篇 |
1996年 | 200篇 |
1995年 | 188篇 |
1994年 | 134篇 |
1993年 | 111篇 |
1992年 | 106篇 |
1991年 | 75篇 |
1990年 | 68篇 |
1989年 | 41篇 |
1988年 | 40篇 |
1987年 | 26篇 |
1986年 | 40篇 |
1985年 | 33篇 |
1984年 | 21篇 |
1983年 | 18篇 |
1982年 | 15篇 |
1981年 | 14篇 |
1980年 | 9篇 |
1979年 | 11篇 |
1974年 | 7篇 |
1973年 | 7篇 |
1971年 | 4篇 |
1969年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
11.
Dekun Wu Dr. Qing Xu Dr. Jing Qian Prof. Xiaopeng Li Prof. Yuhan Sun 《Chemistry (Weinheim an der Bergstrasse, Germany)》2019,25(12):3105-3111
Covalent organic frameworks (COFs) are a new class of crystalline porous polymers comprised mainly of carbon atoms, and are versatile for the integration of heteroatoms such as B, O, and N into the skeletons. The designable structure and abundant composition render COFs useful as precursors for heteroatom-doped porous carbons for energy storage and conversion. Herein, we describe a multifunctional electrochemical catalyst obtained through pyrolysis of a bimetallic COF. The catalyst possesses hierarchical pores and abundant iron and cobalt nanoparticles embedded with standing carbon layers. By integrating these features, the catalyst exhibits excellent electrochemical catalytic activity in the oxygen reduction reaction (ORR), with a 50 mV positive half-wave potential, a higher limited diffusion current density, and a much smaller Tafel slope than a Pt-C catalyst. Moreover, the catalyst displays superior electrochemical performance toward the hydrogen evolution reaction (HER), with overpotentials of −0.26 V and −0.33 V in acidic and alkaline aqueous solution, respectively, at a current density of 10 mA cm−2. The overpotential in the catalysis of the oxygen evolution reaction (OER) was 1.59 V at the same current density. 相似文献
12.
Video transmission over IEEE 802.11e wireless networks still shows poor performance for large bandwidth demand and frequently changed environments. Thus, several enhancements of IEEE 802.11e were proposed. On the other hand, big frames and simultaneous sending of adjacent frames always cause packet dropping for buffer overflow. In the past, we proposed an IEEE 802.11e enhancement named DFAA and a content aware mechanism to solve the above problems. The motivation of this paper is to find a proper way to integrate these two mechanisms. A DFAA enhancement (DFAA-E) is proposed to make up the insufficiency of content aware mechanism. Experiments results show that the combination of DFAA-E and content aware mechanism improves the video decoded quality greatly. And its performance can be further enhanced by selecting the suitable settings of certain parameters. 相似文献
13.
Science China Mathematics - We prove that if a compact Riemannian 4-manifold with positive sectional curvature satisfies a strengthened Kato type inequality, then it is definite. We also discuss... 相似文献
14.
用CPLD实现SRAM工艺FPGA的安全应用 总被引:1,自引:0,他引:1
提出了一种利用CPLD产生的伪随机码来加密SRAM工艺FPGA的方法,并详细介绍了具体的电路和VHDL代码。 相似文献
15.
Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a
given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred
to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional
(resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional
(resp., unidirectional) topology is k-edge connected.
The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied
by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18],
which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19],
which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity.
In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity,
and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity
and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for
distributed implementation.
A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless
(Adhoc-Now 2003).
Research performed in part while visiting the Max-Plank-Institut fur Informatik.
Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting
researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University
of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms.
Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor
since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and
Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990.
His research interests include optical networks and wireless networks. 相似文献
16.
中国电信企业经过多年的高速发展,逐渐步入成熟期,增长率下降、利润降低将是必然趋势,因此目前亟需探索新的运营模式,向综合型全业务电信运营商的方向发展。法国电信集团历史悠久,市场转型起步早.其发展经验有许多地方值得借鉴,包括法国电信集团具有特色的品牌战咯、灵活的经营模式、为企业提供全方位服务的经营手段。中国电信企业应积极开展全业务经营,加快发展企业网市场,完善合作运营模式,争取早日走向世界。 相似文献
17.
18.
19.
20.