全文获取类型
收费全文 | 128篇 |
免费 | 27篇 |
专业分类
化学 | 2篇 |
力学 | 2篇 |
综合类 | 2篇 |
数学 | 27篇 |
物理学 | 9篇 |
无线电 | 113篇 |
出版年
2023年 | 1篇 |
2021年 | 3篇 |
2020年 | 2篇 |
2019年 | 5篇 |
2018年 | 2篇 |
2017年 | 2篇 |
2016年 | 4篇 |
2015年 | 2篇 |
2014年 | 4篇 |
2013年 | 6篇 |
2012年 | 13篇 |
2011年 | 7篇 |
2010年 | 7篇 |
2009年 | 11篇 |
2008年 | 12篇 |
2007年 | 9篇 |
2006年 | 11篇 |
2005年 | 7篇 |
2004年 | 8篇 |
2003年 | 10篇 |
2002年 | 9篇 |
2001年 | 9篇 |
2000年 | 4篇 |
1999年 | 1篇 |
1998年 | 1篇 |
1997年 | 1篇 |
1996年 | 1篇 |
1994年 | 1篇 |
1984年 | 1篇 |
1979年 | 1篇 |
排序方式: 共有155条查询结果,搜索用时 15 毫秒
1.
张凡 《信息技术与标准化》2006,(12):31-33
介绍了时间戳规范的编制背景和时间戳系统部件组成.时间戳的产生和颁发、时间戳的管理、时间戳的格式和时间戳系统的安全等方面的具体内容。 相似文献
2.
Dirk Abendroth Martin E. Eckel Ulrich Killat 《AEUE-International Journal of Electronics and Communications》2006,60(5):404-407
In this article, we present two efficient weighted fair queueing (WFQ) scheduling algorithms leaned on the well-known token bucket and leaky bucket shaping/policing algorithms. The performance of the presented algorithms is compared to those of the state-of-the-art WFQ approximations such as weighted round robin (WRR) and the recently proposed bin sort fair queueing (BSFQ). Our simulation results show that the proposed algorithms provide a better fairness at a lower implementation complexity while simultaneously achieving a comparable network utilization. 相似文献
3.
The Effects of Filtered Channel Quality Feedback on Throughput of Proportional Fair Algorithm 总被引:1,自引:0,他引:1
1 IntroductionSchedulingalgorithmsarewidelystudiedforwirelesspacketdatasystems,whichgenerallyhavetwobasiccategories,oneisoptimizedforsystemthroughputandfairness[1~ 2 ] ,andtheotherisforthequalityofservice[3~6] .Forsystemswherepack etdataaretimedivisionmultiplexedacrossusersonthedownlink ,orfromBaseStation (BS)tomultipleMobileStations(MS) ,theBSusesschedulingalgo rithmstodecidewhichuseristransmittedto .ItisindicatedinRefs.[7,8]thatschedulingonlyoneus eratatimeisoptimalfromthepointofviewo… 相似文献
4.
Valuable insights into the problem of how to fund defined benefitpension schemes can be obtained by analysis using the standardBlackScholes/Merton option pricing model, consideringthe pension fund finances jointly with those of the sponsoringcompany. The nature of the fund assets and liabilities is completelydifferent, and this lies behind current controversies aboutthe appropriate discount rate, valuation, financial accountingand preferential status for pension fund claimants in insolvency. 相似文献
5.
Fair bandwidth allocation (FBA) has been studied in optical burst switching (OBS) networks, with the main idea being to map the max-min fairness in traditional IP networks to the fair-loss probability in OBS networks. This approach has proven to be fair in terms of the bandwidth allocation for differential connections, but the use of the ErlangB formula to calculate the theoretical loss probability has made this approach applicable only to Poisson flows. Furthermore, it is necessary to have a reasonable fairness measure to evaluate FBA models. This article proposes an approach involving throughput-based-FBA, called TFBA, and recommends a new fairness measure that is based on the ratio of the actual throughput to the allocated bandwidth. An analytical model for the performance of the output link with TFBA is also proposed. 相似文献
6.
本文结合青岛城域网的特点,讨论了部署QoS的相关问题,为下一步在城域网中承载多种业务提供了切合实际的参考。 相似文献
7.
实现多个数据流对无线信道的公平共享是802.11无线Ad Hoc网络中的一个重要议题,但802.11DCF机制在无线Ad Hoc网络中存在严重的公平性问题,甚至有可能出现单个节点或数据流独占信道而其他节点和数据流处于"饥饿"状态的情况.论文提出了一种新颖的保证数据流间公平性的MAC层接入机制FFMA(Flow rate-based Fair Medium Access),通过公平调度和公平竞争的方式,FFMA能够在数据流间公平地分配信道带宽资源.仿真结果表明,在无线Ad Hoc网络中,FFMA可以在保证信道吞吐量的前提下取得远优于802.11 DCF的数据流间的公平性. 相似文献
8.
Device-to-device (D2D) communications allow proximate cellular user equipments (UEs) to communicate with each other directly under the control of base station (BS). In this paper, considering the selection relaying (SR) rule which allows a subset of potential relays to forward the source’s data to the corresponding destination, we first establish a multi-relay system model where a D2D UE can act as not only a source but also a potential relay for another D2D link, and then analyze the cooperation behaviors among selfish UEs. Next a simple strategy is proposed to deal with the relay selection problem, and then the fair and efficient resource sharing problem among cooperating D2D UEs is formulated as a bargaining game. Since the game function is non-convex, we turn to an iterative method by introducing an auxiliary function to get the proportional fair resource allocation results. The system efficiency and fairness are proved by numeral simulation results. 相似文献
9.
Anastasios Stamoulis Georgios B. Giannakis 《The Journal of VLSI Signal Processing》2002,30(1-3):71-87
In integrated services networks, the provision of Quality of Service (QoS) guarantees depends critically upon the scheduling algorithm employed at the network layer. In this work we review fundamental results on scheduling, and we focus on Packet Fair Queueing (PFQ) algorithms, which have been proposed for QoS wireline-wireless networking. The basic notion in PFQ is that the bandwidth allocated to a session is proportional to a positive weight
i
. Because of the fixed weight assignment, the inherent in PFQ delay-bandwidth coupling imposes limitations on the range of QoS that can be supported. We develop PFQ with deterministic time-varying weight assignments, and we propose a low-overhead algorithm capable of supporting arbitrary piecewise linear service curves which achieve delay-bandwidth decoupling. Unlike existing service-curve based algorithms, our time-varying PFQ scheme does not exhibit the punishment phenomenon, and allows sessions to exploit the extra bandwidth in under-loaded networks. 相似文献
10.
We prove the following theorem. Let m and n be any positive integers with mn, and let
be a subset of the n-dimensional Euclidean space
n
. For each i=1, . . . , m, there is a class
of subsets M
i
j
of
Tn
. Assume that
for each i=1, . . . , m, that M
i
j
is nonempty and closed for all i, j, and that there exists a real number B(i, j) such that
and its jth component
xjB(i, j)
imply
. Then, there exists a partition
of {1, . . . , n} such that
for all i and
We prove this theorem based upon a generalization of a well-known theorem of Birkhoff and von Neumann. Moreover, we apply this theorem to the fair allocation problem of indivisible objects with money and obtain an existence theorem. 相似文献