全文获取类型
收费全文 | 24579篇 |
免费 | 2740篇 |
国内免费 | 898篇 |
专业分类
化学 | 3239篇 |
晶体学 | 58篇 |
力学 | 2182篇 |
综合类 | 204篇 |
数学 | 5018篇 |
物理学 | 4201篇 |
无线电 | 13315篇 |
出版年
2024年 | 60篇 |
2023年 | 277篇 |
2022年 | 445篇 |
2021年 | 582篇 |
2020年 | 602篇 |
2019年 | 441篇 |
2018年 | 471篇 |
2017年 | 818篇 |
2016年 | 1019篇 |
2015年 | 1074篇 |
2014年 | 1763篇 |
2013年 | 1735篇 |
2012年 | 1701篇 |
2011年 | 1681篇 |
2010年 | 1307篇 |
2009年 | 1413篇 |
2008年 | 1524篇 |
2007年 | 1493篇 |
2006年 | 1339篇 |
2005年 | 1168篇 |
2004年 | 1038篇 |
2003年 | 1085篇 |
2002年 | 764篇 |
2001年 | 652篇 |
2000年 | 561篇 |
1999年 | 503篇 |
1998年 | 415篇 |
1997年 | 312篇 |
1996年 | 294篇 |
1995年 | 262篇 |
1994年 | 208篇 |
1993年 | 155篇 |
1992年 | 116篇 |
1991年 | 122篇 |
1990年 | 82篇 |
1989年 | 66篇 |
1988年 | 81篇 |
1987年 | 63篇 |
1986年 | 48篇 |
1985年 | 69篇 |
1984年 | 44篇 |
1983年 | 35篇 |
1982年 | 45篇 |
1981年 | 35篇 |
1980年 | 51篇 |
1979年 | 50篇 |
1978年 | 27篇 |
1977年 | 35篇 |
1976年 | 36篇 |
1974年 | 13篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
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. 相似文献
2.
移动通信系统中功率控制研究 总被引:2,自引:0,他引:2
在阐述功率控制在移动通信系统中的发展过程的基础上,着重研究了WCDMA系统的功率控制,最后对功率控制未来的研究方向做了简要的分析。 相似文献
3.
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. 相似文献
4.
为实现电源设备乃至通信机房的少人或无人值守和集中维护,必须建立一套完善的电信局动力环境集中监控系统。文中结合番禺区电信局的实际,讨论了提高系统运行可靠性的几点措施,包括硬件方面与软件方面的手段,关键在于加强系统的运行管理。 相似文献
5.
6.
讨论了输出终端带不等式约束情形的多输入多输出系统,说明了这些约束可以通过修改输入柔化系数而使其得以满足,在柔化系数的选择范围确定过程中,为了避免矩阵求逆,采用利用已知数据辨识参数的方法来确定柔化系数,从而使得问题简化。降低了计算量且加快了收敛速度。 相似文献
7.
动力环境网络监控精细管理 总被引:1,自引:0,他引:1
叙述动力环境运行质量分析管理,包括故障管理,性能管理和专题分析管理,以动力环境网络监控细致八微、言之有据的月度分析管理实例展现了其精细管理的效果。 相似文献
8.
9.
10.
Scheduling Algorithms for Packet-Oriented MAC Protocols in Wireless Multimedia Systems 总被引:1,自引:1,他引:0
Romano Fantacci Giovanni Giambene Francesco Petiti 《Wireless Personal Communications》2003,24(3):363-388
Future generation wireless multimediacommunications will require efficient Medium AccessControl (MAC) protocols able to guarantee suitable Qualityof Service (QoS) levels for different traffic classes whileachieving a high utilization of radio resources. This paperproposes a new scheduling technique to be adopted at the MAClevel in wireless access systems, named Dynamic Scheduling-Time DivisionDuplexing (DS-TDD), that efficiently managesvideo, voice, Web and background traffics. A theoretical approachis proposed in this paper to evaluate the DS-TDD performance withvoice and Web traffics. Simulation results have permitted tohighlight the following promising characteristics of the DS-TDDscheme: (i) a high capacity of real-time traffics isattained with a QoS insensitive to Web and background trafficloads; (ii) a high throughput can be guaranteed whilepreserving the QoS levels of the different traffic classes;(iii) heavier downlink traffic loads do not modify the QoSof uplink traffics. Finally, extensive comparisons with differentscheduling schemes proposed in the literature have permitted tohighlight the better performanceof DS-TDD. 相似文献