全文获取类型
收费全文 | 19724篇 |
免费 | 2225篇 |
国内免费 | 592篇 |
专业分类
化学 | 4793篇 |
晶体学 | 19篇 |
力学 | 942篇 |
综合类 | 102篇 |
数学 | 6845篇 |
物理学 | 5052篇 |
无线电 | 4788篇 |
出版年
2024年 | 47篇 |
2023年 | 259篇 |
2022年 | 306篇 |
2021年 | 505篇 |
2020年 | 538篇 |
2019年 | 496篇 |
2018年 | 380篇 |
2017年 | 477篇 |
2016年 | 726篇 |
2015年 | 668篇 |
2014年 | 1098篇 |
2013年 | 1438篇 |
2012年 | 1000篇 |
2011年 | 1026篇 |
2010年 | 899篇 |
2009年 | 1142篇 |
2008年 | 1344篇 |
2007年 | 1337篇 |
2006年 | 1109篇 |
2005年 | 887篇 |
2004年 | 756篇 |
2003年 | 812篇 |
2002年 | 751篇 |
2001年 | 577篇 |
2000年 | 565篇 |
1999年 | 485篇 |
1998年 | 450篇 |
1997年 | 299篇 |
1996年 | 259篇 |
1995年 | 234篇 |
1994年 | 215篇 |
1993年 | 173篇 |
1992年 | 159篇 |
1991年 | 108篇 |
1990年 | 97篇 |
1989年 | 108篇 |
1988年 | 111篇 |
1987年 | 74篇 |
1986年 | 70篇 |
1985年 | 105篇 |
1984年 | 87篇 |
1983年 | 30篇 |
1982年 | 53篇 |
1981年 | 50篇 |
1980年 | 50篇 |
1979年 | 40篇 |
1978年 | 33篇 |
1977年 | 37篇 |
1976年 | 32篇 |
1973年 | 9篇 |
排序方式: 共有10000条查询结果,搜索用时 19 毫秒
1.
In a typical embedded CPU, large on-chip storage is critical to meet high performance requirements. However, the fast increasing size of the on-chip storage based on traditional SRAM cells makes the area cost and energy consumption unsustainable for future embedded applications. Replacing SRAM with DRAM on the CPU’s chip is generally considered not worthwhile because DRAM is not compatible with the common CMOS logic and requires additional processing steps beyond what is required for CMOS. However a special DRAM technology, Gain-Cell embedded-DRAM (GC-eDRAM) [1], [2], [3] is logic compatible and retains some of the good properties of DRAM (small and low power). In this paper we evaluate the performance of a novel hybrid cache memory where the data array, generally populated with SRAM cells, is replaced with GC-eDRAM cells while the tag array continues to use SRAM cells. Our evaluation of this cache demonstrates that, compared to the conventional SRAM-based designs, our novel architecture exhibits comparable performance with less energy consumption and smaller silicon area, enabling the sustainable on-chip storage scaling for future embedded CPUs. 相似文献
2.
3.
4.
Synthesis and Photophysical Properties of a Sc3N@C80‐Corrole Electron Donor–Acceptor Conjugate 下载免费PDF全文
Bin Liu Hongyun Fang Prof. Xiaofang Li Wenting Cai Lipiao Bao Marc Rudolf Fabian Plass Prof. Louzhen Fan Prof. Xing Lu Prof. Dirk M. Guldi 《Chemistry (Weinheim an der Bergstrasse, Germany)》2015,21(2):746-752
Embedding endohdedral metallofullerenes (EMFs) into electron donor–acceptor systems is still a challenging task owing to their limited quantities and their still largely unexplored chemical properties. In this study, we have performed a 1,3‐dipolar cycloaddition reaction of a corrole‐based precursor with Sc3N@C80 to regioselectively form a [5,6]‐adduct ( 1 ). The successful attachment of the corrole moiety was confirmed by mass spectrometry. In the electronic ground state, absorption spectra suggest sizeable electronic communications between the electron acceptor and the electron donor. Moreover, the addition pattern occurring at a [5,6]‐bond junction is firmly proven by NMR spectroscopy and electrochemical investigations performed with 1 . In the electronically excited state, which is probed in photophysical assays with 1 , a fast electron‐transfer yields the radical ion pair state consisting of the one‐electron‐reduced Sc3N@C80 and of the one‐electron‐oxidized corrole upon its exclusive photoexcitation. As such, our results shed new light on the practical work utilizing EMFs as building blocks in photovoltaics. 相似文献
5.
6.
7.
Recent Progress in the $L_p$ Theory for Elliptic and Parabolic Equations with Discontinuous Coefficients 下载免费PDF全文
Hongjie Dong 《分析论及其应用》2020,36(2):161-199
In this paper, we review some results over the last 10-15 years on elliptic and parabolic equations with discontinuous coefficients. We begin with an approach given by N. V. Krylov to parabolic equations in the whole space with $\rm{VMO}_x$ coefficients. We then discuss some subsequent development including elliptic and parabolic equations with coefficients which are allowed to be merely measurable in one or two space directions, weighted $L_p$estimates with Muckenhoupt ($A_p$) weights, non-local elliptic and parabolic equations, as well as fully nonlinear elliptic and parabolic equations. 相似文献
8.
Ieva
Dauickait Amos S. Lawless Jennifer A. Scott Peter Jan van Leeuwen 《Numerical Linear Algebra with Applications》2020,27(5)
We consider the large sparse symmetric linear systems of equations that arise in the solution of weak constraint four‐dimensional variational data assimilation, a method of high interest for numerical weather prediction. These systems can be written as saddle point systems with a 3 × 3 block structure but block eliminations can be performed to reduce them to saddle point systems with a 2 × 2 block structure, or further to symmetric positive definite systems. In this article, we analyse how sensitive the spectra of these matrices are to the number of observations of the underlying dynamical system. We also obtain bounds on the eigenvalues of the matrices. Numerical experiments are used to confirm the theoretical analysis and bounds. 相似文献
9.
基于mobile agent的分布式网络自管理模型 总被引:2,自引:1,他引:1
为了解决大规模、异构网络环境下基于“管理员密集”的传统网络管理模式带来的低效率和高出错率问题,提出了一种网络自管理模型,从网络管理的自动初始化和动态自管理两个方面实现对网络自动、自主、自适应的管理;提出了管理定位服务这一关键技术,在多个管理站协同工作的分布式网络环境中为设备自动定位出合适的管理站及初始的管理任务;采用可伸缩的分布式体系结构,适应了大规模网络的规模可变性等特点;基于mobile agent的管理框架进一步提高了管理的自适应性和灵活性。 相似文献
10.
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. 相似文献