全文获取类型
收费全文 | 34701篇 |
免费 | 4930篇 |
国内免费 | 1316篇 |
专业分类
化学 | 3934篇 |
晶体学 | 123篇 |
力学 | 2499篇 |
综合类 | 335篇 |
数学 | 8985篇 |
物理学 | 7148篇 |
无线电 | 17923篇 |
出版年
2024年 | 60篇 |
2023年 | 372篇 |
2022年 | 600篇 |
2021年 | 848篇 |
2020年 | 914篇 |
2019年 | 753篇 |
2018年 | 733篇 |
2017年 | 1234篇 |
2016年 | 1437篇 |
2015年 | 1514篇 |
2014年 | 2365篇 |
2013年 | 2565篇 |
2012年 | 2439篇 |
2011年 | 2435篇 |
2010年 | 1899篇 |
2009年 | 2015篇 |
2008年 | 2256篇 |
2007年 | 2160篇 |
2006年 | 1958篇 |
2005年 | 1675篇 |
2004年 | 1455篇 |
2003年 | 1555篇 |
2002年 | 1179篇 |
2001年 | 974篇 |
2000年 | 862篇 |
1999年 | 747篇 |
1998年 | 590篇 |
1997年 | 524篇 |
1996年 | 445篇 |
1995年 | 387篇 |
1994年 | 304篇 |
1993年 | 223篇 |
1992年 | 169篇 |
1991年 | 174篇 |
1990年 | 125篇 |
1989年 | 105篇 |
1988年 | 94篇 |
1987年 | 84篇 |
1986年 | 71篇 |
1985年 | 116篇 |
1984年 | 66篇 |
1983年 | 46篇 |
1982年 | 59篇 |
1981年 | 47篇 |
1980年 | 55篇 |
1979年 | 61篇 |
1978年 | 40篇 |
1977年 | 45篇 |
1976年 | 47篇 |
1974年 | 19篇 |
排序方式: 共有10000条查询结果,搜索用时 625 毫秒
21.
《Tetrahedron letters》2019,60(24):1582-1586
Rh(II)-catalyzed decomposition of certain cyclic α-diazocarbonyl compounds in the presence of cyclic ethers has been shown to give bicyclic ring expansion products. These are thought to arise from a [1,4]-alkyl shift toward the carbonyl oxygen atom and are in contrast with the recently observed spirocyclic products of a Stevens-type [1,2]-alkyl shift within the postulated oxonium ylide intermediate. Quantum chemical calculations performed at the B3LYP/6-31G* level of theory showed that the former reaction pathway (toward fused bicycles) is kinetically preferred. 相似文献
22.
异构分层无线网络中基于逗留时间的动态流量均衡算法研究 总被引:1,自引:1,他引:0
为使异构分层无线网络能服务更多的移动用户,提出了一种基于逗留时间的动态流量均衡算法.该算法首先根据用户移动模型计算其在小区内的逗留时间,然后基于小区呼叫到达率和重叠覆盖小区的流量状态来确定一个周期内呼叫转移的数量,最后依据逗留时间门限值将重负载小区中满足条件的呼叫转移到轻负载的重叠覆盖小区中.为降低切换呼叫掉线率,还对异构网间的呼叫切换策略做了改进.仿真实验结果表明,本算法在新呼叫阻塞率和切换呼叫掉线率等性能指标上比传统方法有显著的提高. 相似文献
23.
24.
We investigate the problem of teleportation of unitary operations by unidirectional control-state telepor-tation and propose a scheme called unidirectional quantum remote control. The scheme is based on the isomorphismbetween operation and state. It allows us to store a unitary operation in a control state, thereby teleportation of theunitary operation can be implemented by unidirectional teleportation of the control-state. We find that the probabilityof success for implementing an arbitrary unitary operation on arbitrary M-qubit state by unidirectional control-stateteleportation is 4-M, and 2M ebits and 4M cbits are consumed in each teleportation. 相似文献
25.
Kurjenniemi Janne Hämäläinen Seppo Ristaniemi Tapani 《Wireless Personal Communications》2003,27(4):337-351
In this article we consider the performance of the 3.84 Mcpstime-division duplex (TDD) mode of UTRA (Universal TerrestrialRadio Access) network. We emphasize two of the radio resourcemanagement algorithms, handover and uplink power control, whoserole in the overall system performance is studied extensively.First, a handover algorithm used in WCDMA (Wideband Code DivisionMultiple Access) standard is considered in a TDD-mode operation.This gives rise to a careful setting of different handoverparameters, and the evaluation of the effects to the systemperformance. Secondly, the specified uplink power controlalgorithm is considered. Since it is based on several user-mademeasurements which may involve both random and systematic errors acareful study about the suitability of the power control scheme iscarried out. 相似文献
26.
移动通信系统中功率控制研究 总被引:2,自引:0,他引:2
在阐述功率控制在移动通信系统中的发展过程的基础上,着重研究了WCDMA系统的功率控制,最后对功率控制未来的研究方向做了简要的分析。 相似文献
27.
28.
29.
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. 相似文献
30.
Ratnabali Biswas Kaushik Chowdhury Dharma P. Agrawal 《International Journal of Wireless Information Networks》2006,13(4):303-315
Wireless sensor network is an emerging technology that enables remote monitoring of large geographical regions. In this paper, we address the problem of distributing attributes over such a large-scale sensor network so that the cost of data retrieval is minimized. The proposed scheme is a data-centric storage scheme where the attributes are distributed over the network depending on the correlations between them. The problem addressed here is similar to the Allocation Problem of distributed databases. In this paper, we have defined the Allocation Problem in the context of sensor networks and have proposed a scheme for finding a good distribution of attributes to the sensor network. We also propose an architecture for query processing given such a distribution of attributes. We analytically determine the conditions under which the proposed architecture is beneficial and present simulation results to demonstrate the same. To the best of our knowledge, this is the first attempt to determine an allocation of attributes over a sensor network based on the correlations between attributes. 相似文献