全文获取类型
收费全文 | 3019篇 |
免费 | 424篇 |
国内免费 | 34篇 |
专业分类
化学 | 6篇 |
晶体学 | 1篇 |
力学 | 3篇 |
综合类 | 25篇 |
数学 | 466篇 |
物理学 | 117篇 |
无线电 | 2859篇 |
出版年
2024年 | 9篇 |
2023年 | 44篇 |
2022年 | 45篇 |
2021年 | 49篇 |
2020年 | 66篇 |
2019年 | 62篇 |
2018年 | 55篇 |
2017年 | 81篇 |
2016年 | 113篇 |
2015年 | 136篇 |
2014年 | 194篇 |
2013年 | 237篇 |
2012年 | 193篇 |
2011年 | 220篇 |
2010年 | 175篇 |
2009年 | 206篇 |
2008年 | 179篇 |
2007年 | 257篇 |
2006年 | 214篇 |
2005年 | 161篇 |
2004年 | 172篇 |
2003年 | 152篇 |
2002年 | 114篇 |
2001年 | 111篇 |
2000年 | 60篇 |
1999年 | 31篇 |
1998年 | 26篇 |
1997年 | 26篇 |
1996年 | 20篇 |
1995年 | 23篇 |
1994年 | 8篇 |
1993年 | 8篇 |
1992年 | 9篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1985年 | 10篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1970年 | 1篇 |
排序方式: 共有3477条查询结果,搜索用时 750 毫秒
1.
空时分组码技术结合信道编码、调制和天线分集技术,当发送天线一定时,他的解码复杂度正比于发送速率,在3G标准中,该技术有着重要的地位。对空时分组码及相关知识进行了介绍,并对可变速率的空时分组码设计进行了探讨,最后展望了空时分组码技术的应用前景。 相似文献
2.
3.
一种支持QoS的拓扑自适应动态组播路由算法 总被引:3,自引:0,他引:3
YAM、QoSMIC、DSDMR等一类支持QoS的动态组播路由算法允许组播成员动态地加入和离开,同时为接收方提供多个可选择的组播接入路径,以满足不同应用的QoS需求。但这些算法普遍存在控制信令开销大和结点加入时延长,可扩展性不好等问题。本文在分析这些算法的基础上,提出改进的支持QoS的动态组播路由算法,即拓扑自适应动态组播路由(Topology Adaptive Dynamic Multicast Routing,TADMR)算法。该算法避免了以往算法中大部分盲目的路径搜索,并使结点加入时延不再受限于固定的等待时钟,而与网络拓扑相自适应。性能分析和仿真结果表明,该算法具有较低的控制信令开销和结点加入时延,适用于各种网络规模和群组规模,具有良好的可扩展性。 相似文献
4.
自动交换光网络的概念一经提出即受到业界的广泛关注,运营商尤其对其寄予了厚望。本文首先概要地介绍了ASON的优点,然后重点论述了ASON的信令与路由功能,包括对它们的要求以及标准化工作。 相似文献
5.
Recent technological advances have made it possible to support long lifetime and large volume streaming data transmissions
in sensor networks. A major challenge is to maximize the lifetime of battery-powered sensors to support such transmissions.
Battery, as the power provider of the sensors, therefore emerges as the key factor for achieving high performance in such
applications. Recent study in battery technology reveals that the behavior of battery discharging is more complex than we
used to think. Battery powered sensors might waste a huge amount of energy if we do not carefully schedule and budget their
discharging. In this paper we study the effect of battery behavior on routing for streaming data transmissions in wireless
sensor networks. We first give an on-line computable energy model to mathematically model battery discharge behavior. We show
that the model can capture and describe battery behavior accurately at low computational complexity and thus is suitable for
on-line battery capacity computation. Based on this battery model we then present a battery-aware routing (BAR) protocol to
schedule the routing in wireless sensor networks. The routing protocol is sensitive to the battery status of routing nodes
and avoids energy loss. We use the battery data from actual sensors to evaluate the performance of our protocol. The results
show that the battery-aware protocol proposed in this paper performs well and can save a significant amount of energy compared
to existing routing protocols for streaming data transmissions. Network lifetime is also prolonged with maximum data throughput.
As far as we know, this is the first work considering battery-awareness with an accurate analytical on-line computable battery
model in sensor network routing. We believe the battery model can be used to explore other energy efficient schemes for wireless
networks as well. 相似文献
6.
7.
The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study 总被引:1,自引:0,他引:1
Bram Verweij Shabbir Ahmed Anton J. Kleywegt George Nemhauser Alexander Shapiro 《Computational Optimization and Applications》2003,24(2-3):289-333
The sample average approximation (SAA) method is an approach for solving stochastic optimization problems by using Monte Carlo simulation. In this technique the expected objective function of the stochastic problem is approximated by a sample average estimate derived from a random sample. The resulting sample average approximating problem is then solved by deterministic optimization techniques. The process is repeated with different samples to obtain candidate solutions along with statistical estimates of their optimality gaps.We present a detailed computational study of the application of the SAA method to solve three classes of stochastic routing problems. These stochastic problems involve an extremely large number of scenarios and first-stage integer variables. For each of the three problem classes, we use decomposition and branch-and-cut to solve the approximating problem within the SAA scheme. Our computational results indicate that the proposed method is successful in solving problems with up to 21694 scenarios to within an estimated 1.0% of optimality. Furthermore, a surprising observation is that the number of optimality cuts required to solve the approximating problem to optimality does not significantly increase with the size of the sample. Therefore, the observed computation times needed to find optimal solutions to the approximating problems grow only linearly with the sample size. As a result, we are able to find provably near-optimal solutions to these difficult stochastic programs using only a moderate amount of computation time. 相似文献
8.
Consider a network where two routes are available for users wishing to travel from a source to a destination. On one route (which could be viewed as private transport) service slows as traffic increases. On the other (which could be viewed as public transport) the service frequency increases with demand. The Downs-Thomson paradox occurs when improvements in service produce an overall decline in performance as user equilibria adjust. Using the model proposed by Calvert [10], with a ⋅|M|1 queue corresponding to the private transport route, and a bulk-service infinite server queue modelling the public transport route, we give a complete analysis of this system in the setting of probabilistic routing. We obtain the user equilibria (which are not always unique), and determine their stability.AMS subject classification: 60K30, 90B15, 90B20, 91A10, 91A13This revised version was published online in June 2005 with corrected coverdate 相似文献
9.
10.
A novel dynamic survivable routing in WDM optical networks with/without sparse wavelength conversion
Vinh Trong Le Xiaohong Jiang Son Hong Ngo Susumu Horiguchi Yasushi Inoguchi 《Optical Switching and Networking》2006,3(3-4):173-190
In this paper, we study the dynamic survivable routing problem, both in optical networks without wavelength conversion and in optical networks with sparse wavelength conversion, and propose a novel hybrid algorithm for it based on the combination of mobile agents technique and genetic algorithms (GA). By keeping a suitable number of mobile agents in the network to cooperatively explore the network states and continuously report cycles (that are formed by two disjoint-link routes) into the routing tables, our new hybrid algorithm can promptly determine the first population of cycles for a new request based on the routing table of its source node, without the time consuming process associated with current GA-based lightpath protection schemes. We further improve the performance of our algorithm by introducing a more advanced fitness function that is suitable for both the above networks. Extensive simulation studies on the ns-2 network simulator show that our hybrid algorithm achieves a significantly lower blocking probability than the conventional survivable routing algorithms for all the cases we studied. 相似文献