The Effects of Filtered Channel Quality Feedback on Throughput of Proportional Fair Algorithm

1　IntroductionSchedulingalgorithmsarewidelystudiedforwirelesspacketdatasystems,whichgenerallyhavetwobasiccategories,oneisoptimizedforsystemthroughputandfairness[1～ 2 ] ,andtheotherisforthequalityofservice[3～6] .Forsystemswherepack etdataaretimedivisionmultiplexedacrossusersonthedownlink ,orfromBaseStation (BS)tomultipleMobileStations(MS) ,theBSusesschedulingalgo rithmstodecidewhichuseristransmittedto .ItisindicatedinRefs.[7,8]thatschedulingonlyoneus eratatimeisoptimalfromthepointofviewo…     

Improvement on threshold proxy signcryption scheme

Signcryption is a public key or asymmetric cryptographic method that provides simultaneously both message confidentiality and integrity at a lower computational and communication cost. This paper presents a （t, n） threshold proxy signcryption scheme in which no less than t proxy agents in the proxy group can produce the signcryption cryptogram. combines the functionality of threshold proxy signing and encryption. The proposed scheme combines the functionality of both threshold proxy signing and encryption, and provides fair protection for the sender and the proxy agents. This scheme is secure against attack of public key substitution. It also satisfies security properties such as confidentiality and authenticity.     

股票期权的会计处理方法研究

经理人股票期权是对管理者实行的长期激励制度，由于我国制度上的缺陷，目前在我国没有统一的处理方法，本文讨论的主要是在国际上股票期权的确认、计量以及在会计报表中披露的会计方法。     

Usable optimistic fair exchange

Fairly exchanging digital content is an everyday problem. It has been shown that fair exchange cannot be achieved without a trusted third party (called the Arbiter). Yet, even with a trusted party, it is still non-trivial to come up with an efficient solution, especially one that can be used in a p2p file sharing system with a high volume of data exchanged.We provide an efficient optimistic fair exchange mechanism for bartering digital files, where receiving a payment in return for a file (buying) is also considered fair. The exchange is optimistic, removing the need for the Arbiter’s involvement unless a dispute occurs. While the previous solutions employ costly cryptographic primitives for every file or block exchanged, our protocol employs them only once per peer, therefore achieving an O(n) efficiency improvement when n blocks are exchanged between two peers. Our protocol uses very efficient cryptography, making it perfectly suitable for a p-2-p file sharing system where tens of peers exchange thousands of blocks and they do not know beforehand which ones they will end up exchanging. Therefore, our system yields up to one-to-two orders of magnitude improvement in terms of both computation and communication (40 s vs. 42 min, 1.6 MB vs. 200 MB). Thus, for the first time, a provably secure (and privacy-respecting when payments are made using e-cash) fair exchange protocol can be used in real bartering applications (e.g., BitTorrent) [14] without sacrificing performance.     

中继增强蜂窝系统中的比例公平资源分配

针对中继增强蜂窝系统,提出了一种基于比例公平准则的资源分配算法.在基站和中继节点分别独立地调度所服务用户的情况下,通过资源划分和用户调度两个步骤,实现蜂窝小区内所有用户的比例公平资源分配目标.仿真结果表明,该算法可在保证用户公平性的前提下,获得比传统算法更好的系统吞吐量增益.     

面向多用户的集群资源部署策略

集群系统中面向多用户的资源部署策略优先考虑的是资源能够在不同用户之间进行公平分配,同时实现用户之间的资源共享。为了充分利用集群资源,用户以一定的原则通常是采用权重比的方式共用集群资源。该策略并不关心每个用户所获取的资源总量,只关心用户所获取的资源比例是否总是符合原则,这样可以保证空闲资源总是能够被充分利用。该策略包括资源的定额分配和自主申请两部分,以满足用户的需求。同时提出了采用用户占用资源量与占用时间共同作为公平分配依据的策略,以适应更加复杂的情况。     

分数频率复用的帧结构及性能分析

针对现代无线通信系统在干扰控制方面越来越高的要求,利用通信帧中子载波的重新分配,提出了帧结构设计中一种新的分数频率复用方法—时频分分数频率复用,并将其与传统的分数频率复用方式进行比较。这一新方法是在对系统容量进行建模之后,综合资源块分配中的时分和频分模式提出的,其对应的帧结构相对于传统的FFR具有更高的调节粒度。实验结果验证了这种设计以少量系统容量为代价,在提升系统公平性、提高边缘用户吞吐率方面的性能优势。     

博物馆智能投币控制系统设计

主要介绍了博物馆智能投币系统设计的具体方案。其适用于无人操作以投币方式触发控制周边设备。主要通过涡流传感器对投入硬币币值的检测及真假币判断,并由此产生相关控制信号来模拟开关动作或控制周边强电设备,使游客能够自主参与各种互动环节。     

基于聚类和一致Hash的数据布局算法

如何有效地对数据进行布局是大规模网络存储系统面临的重大挑战,需要一种能够自适应存储规模变化、公平有效的数据布局算法.提出的CCHDP(clustering-based and consistent hashing-aware data placement)算法将聚类算法与一致hash方法相结合,引入少量的虚拟设备,极大地减少了存储空间.理论和实验证明,CCHDP算法可以按照设备的权重公平地分布数据,自适应存储设备的增加和删除,在存储规模发生变化时迁移最少的数据量,并且可以快速地定位数据,对存储空间的消耗较少.     

多跳无线 Ad hoc网络的分布式公平调度算法

为兼顾无线Ad hoc网络信道资源的公平利用及网络吞吐量,提出针对多跳无线Ad hoc网络的分布式公平调度算法。该算法采用链路竞争图说明网络中各子流的竞争关系,通过着色算法得到最大无竞争流的集合,通过邻居节点之间的信息交换得到局部(本地)流的信息,而无需全局流的信息交换。实验模拟结果表明,该算法可以在保证Ad hoc网络中各流公平性的同时,有效提高网络资源的利用率。