Applicant reactions to face-to-face and technology-mediated interviews: A field investigation.

This field study examined applicant reactions (N = 802) toward face-to-face as compared with technology-mediated interviews (through videoconferencing or by telephone) for 346 organizations. Face-to-face interviews were perceived as more fair and led to higher job acceptance intentions than were videoconferencing and telephone interviews. Perceived interview outcomes were higher with face-to-face and telephone interviews over videoconferencing. Self-monitoring moderated the relationship between interview medium and perceptions of fairness. Specifically, this relationship was (a) positive for face-to-face, (b) negative for telephone, and (c) nonsignificant for videoconferencing interviews. Moreover, the number of offers an applicant received moderated the relationship between interview medium over, and perceived fairness. The relationship between number of offers and perceived fairness was positive for face-to-face and negative for technology-mediated interviews. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

图书馆促进社会包容性发展的思考

促进社会包容性发展是图书馆从诞生伊始就坚守的价值观,通过保障信息自由与信息公平、促进多元文化理解、提高公民媒介信息素养等途径,图书馆致力于支持和促进社会包容性发展。图书馆需要进一步强化服务意识、加强跨组织协同、切实发挥信息素养培养及社区教育的服务职能、促进社区参与,为社会包容性发展提供更大支持。     

车身曲面的光顺品质分析与应用

文章对车身反求工程中曲面光顺的含义、常用光顺检查方法( 曲面曲率法、光照模型法、等高线法、线性变换法)的特点及原理进行论述;介绍CATIA软件Freestyle模块的外形分析功能的使用,其目的是在图形终端屏幕上直观分析曲面光顺品质,满足用户对产品外形的视觉要求,给汽车外观赋予浓郁的时代感.     

λ网络中一种分布式速率分配算法

针对λ网络中的高性能传输问题,提出了一种分布式速率分配算法.该算法基于离散时间系统模型对λ网络进行建模,得到其速率分配问题的数学依赖关系,根据最大-最小公平准则,利用本地信息来分配每个源端和目的端之间的容量,以确保较低期望速率会话的速率最大化,并把剩余容量均匀地分配给全部会话,直至网络被充分利用.结果表明,所提出的分布式速率分配算法能快速收敛到一个最大-最小公平速率分配方式,而且还能实现自适应期望速率的快速变化.     

Power Allocation with Proportional Fairness in Downlink NOMA System

The non-orthogonal multiple access (NOMA) has been regarded as a candidate radio access technology in the 5th generation (5G) mobile networks. In this paper, the problem of power allocation is considered with proportional fairness for downlink NOMA. Our objective is to maximize the logarithmic throughput of the system, which achieves a good tradeoff between the system throughput and user fairness. The approximate optimal solution of this proposed method can be found by the means of quasi-Newton method. For any number of users K, the numerical results verify the accuracy and convergence of our proposed method. Compared to the exhaustive search method, the computational complexity is significantly reduced when the two methods achieve the same accuracy. Furthermore, we show that as the number of users increases, the number of iterations of our method increases with an approximately linear trend.     

认知无线电网络中基于信道跳频序列的异步交汇算法研究

认知无线电技术被公认为是未来通信网络中解决频谱资源稀缺和提高频谱利用率的关键技术。认知无线电用户以频谱共享方式机会式地接入授权用户的频段。异步认知无线电网络中的认知无线电用户在相互通信之前,首先需要完成交汇(Rendezvous)和信道协商。对近几年来基于信道跳频序列的异步交汇算法进行了综述,对文献中提出的三类算法进行理论分析,并通过Matlab仿真验证这三类中的八个算法在ETTR、MTTR和公平性三方面的性能表现,对比分析了这八个算法的优缺点。     

Efficient allocation of LTE downlink spectral resource to improve fairness and throughput

For the current generation of cellular communication systems, long‐term evolution (LTE) has been the major protocol to support high‐speed data transmission. It is critical to allocate downlink spectral resource in LTE, namely, resource blocks (RBs), but the issue is not well addressed in the standard. Therefore, the paper develops an efficient RB allocation algorithm with 4 mechanisms to improve both fairness and throughput in LTE. For fairness concern, our RB allocation algorithm uses a resource‐reservation mechanism to prevent cell‐edge user equipments from starvation, and a credit‐driven mechanism to keep track of the amount of resource given to each user equipment. For throughput concern, it adopts both weight‐assignment and RB‐matching mechanisms to allocate each RB to a packet according to its flow type and length. Through simulations, we demonstrate that the proposed RB allocation algorithm can significantly increase both throughput and fairness while reducing packet dropping and delays of real‐time flows, as compared with previous methods.     

无线网络中谈判解的协作带宽分配策略

为了促使无线网络中的"自私"节点参与合作,提出了谈判解协作带宽分配(CBA)策略,解决了节点间采用交换带宽资源协作传输,彼此以多大带宽中继对方数据的问题.首先,将两个节点的协作带宽分配问题建模为合作博弈中的谈判过程;之后,采用拉格朗日乘数法得到两个用户的纳什谈判解(NBS)协作带宽分配;其次,提出了一种新的Kalai-Smorodinsky谈判解(KSBS)协作带宽分配策略;最后,对两种谈判解协作带宽分配策略的公平性进行了研究.仿真表明,KSBS协作带宽分配策略和NBS协作带宽分配策略对提升用户效用的作用基本相同,但KSBS策略比NBS策略更为公平.     

基于共享资源量的动态多资源公平分配策略

针对云计算共享系统中多资源分配问题,提出一种基于共享资源量的动态多资源公平分配策略。该策略根据不同用户资源需求和共享资源量建立一个线性规划模型,同时证明该模型满足公平分配的4个重要属性：动态帕累托最优、激励共享、动态无嫉妒性和防止策略性操作,而且给出一种改进的动态多资源公平分配算法来提高算法运行效率。实验结果表明,所提动态多资源公平分配策略能够在满足任务资源需求的同时,尽可能保证公平分配下最大化占优资源份额,并且改进的分配算法能够有效地提高资源的分配效率。