高职教育财政拨款制度变迁的若干思考

伴随着高职教育体制的转变以及社会主义市场经济体系的逐步规范化,高职教育财政政策发生了一系列相应变化。一方面就是确立了高职教育多渠道筹集资金政策,另一方面建立了市场化的资金筹集和资金供给机制。在回顾我国高职教育财政拨款制度变迁的基础上,着重分析其对高职院校的影响以及高职院校应采取的对策。     

MIMO-OFDMA系统下行链路的一种自适应资源分配方案

为了在MIMO-OFDMA系统中利用延时的信道状态信息极大化系统吞吐量,提出了一种结合正交空时分组码与特征波束形成的传输方案,并在上述传输方案中提出一种低复杂度的两步子载波分配算法.首先根据用户平均信道质量与速率需求分配带宽,然后遵循标定星座距离最小的准则依次将各子载波指派给用户,获得多用户分集增益.最后在子载波间分配功率确保达到用户速率要求.仿真结果表明,该方案能充分利用具有时延的信道状态信息和多个发射天线有效提高系统吞吐量.     

基于博弈论的多机器人任务分配算法

为了寻找一种合理有效的多机器人任务分配算法,基于多机器人协作救火任务环境,以博弈论纳什均衡为基础,研究多机器人的任务分配问题。根据任务模型特点和纳什均衡的主要特征提出了一种基于博弈论的任务分配算法。博弈的效用函数同时考虑了距离、火势和燃烧时间等因素,机器人根据此效用函数选择行为策略,促使机器人尽快扑灭惩罚值较大的火灾而获得较大的奖励值。利用任务总收益函数值的大小评价算法的优劣性。收益函数与火势、燃烧时间和机器人扑灭火灾数有关,这切合实际救火模型。实验结果证明了该任务分配算法的有效性。     

Kalman滤波预测的多小区子载波分配方法

小区间干扰协调是3G演进系统中抑制小区间干扰的重要策略, 并且在各类小区间干扰协调方案包含着不同的频率复用方法。为了在抑制干扰的同时提高频谱利用率,提出了可用频率集合的概念。如何分配可用频率集合中不同频点的子载波直接关系到小区间干扰的强弱程度,而现有的子载波分配方法往往基于当前信道状况, 导致在分配过程中因时间的滞后性而带来较大的干扰。针对这种情况,提出了一种基于Kalman滤波预测的自适应子载波分配方法。该方法通过检测获取不同子载波对用户的信道增益干扰比(GIR), 进而采用Kalman滤波估计得到下一时刻的GIR预测值大小,并以该预测值作为子载波分配的依据。仿真结果表明,与固定子载波分配方法和基于当前GIR的子载波分配方法相比,该方法能有效降低不同频率复用方法下的小区间干扰,改善小区和用户的性能,具体表现在提高了小区吞吐量,降低了用户的阻塞率,以及改善了小区边缘用户的比特丢失率。     

基于VCG机制和POMDP强化学习的动态频谱分配算法

以认知无线网络动态频谱分配问题为研究对象,提出一种通用的动态频谱分配博弈框架,将频谱的动态变化、认知用户的可能影响频谱分配的自私的网络行为、频谱分配中的信息约束限制和分布式特性在动态频谱环境中加以考虑,通过VCG机制的部署和实施,有效的解决动态频谱分配问题,防止自私用户可能存在欺骗行为;为进一步提高认知无线网络中频谱分配方法的性能,提出了一种动态频谱分配的POMDP强化学习算法,通过认知用户依据它们自身历史信息的观察统计和学习,预测当前竞拍策略,通过累积折扣奖赏影响动态频谱分配。仿真结果表明,基于POMDP强化学习算法可以显著的改善认知用户的行为,提高动态频谱分配性能。     

Inhibition and recovery of cucumber roots given multiple treatments of ferulic acid in nutrient culture

Ferulic acid, a frequently cited allelopathic agent, inhibited photosynthesis, leaf expansion, and root elongation of cucumber seedlings grown in aerated nutrient cultures in a growth chamber. Other effects were a reduction in the proportion of radioactivity fixed by photosynthesis translocated to roots, a stimulation in secondary root initiation, and an increase in root-shoot ratios. Inhibition of leaf expansion and root elongation induced by multiple ferulic acid treatments was rapidly lost once ferulic acid was removed from the root environment. The changes in general root morphology, i.e., average root length and root number, associated with ferulic acid treatments, were partially reversed or not affected when ferulic acid was removed from the root environment.Paper No. 11411 of the Journal Series of the North Carolina Agricultural Research Service, Raleigh, North Carolina 27695-7601. The use of trade names in this publication does not imply endorsement by the North Carolina Agricultural Research Service of the products named, nor criticism of similar ones not mentioned.     

无线Mesh网络中路由与信道联合分配研究

无线Mesh网络中路由器使用多射频接口并配备多信道传输能有效增加网络吞吐量及降低干扰。研究路由与信道分配问题的目的就是增加网络容量、减少延迟等。文中针对无线Mesh网络中多接口多信道的路由与信道分配问题做了统一考虑,根据路由约束、信道约束、干扰约束以及宽带约束建立了混合整数线性规划（MILP）模型,并提出了基于迭代搜索的启发式算法很好地解决了此问题。仿真结果表明该算法可以提高网络吞吐量,降低延迟。     

Multi-channel power allocation based on market competitive equilibrium in cognitive radio networks

Cognitive radios such as intelligent phones and Bluetooth devices have been considered essential goods in next-generation communication systems.Such devices will have to share the same frequency band owing to the limited bandwidth resource.To improve spectrum efciency,we formulate multi-channel power allocation as a market competitive equilibrium(CE)problem,and prove that its solution exists and is unique under the condition of weak interference.We then propose two distributed power allocation algorithms achieving CE,namely the fast convergent power allocation algorithm(FCPAA)and the social-fairness-aware FCPAA(SFAF).Theoretical analysis and simulation results demonstrate that the proposed algorithms lead to better system performance in terms of the guaranteed interference temperature constraint using the price mechanism instead of a strategy based on the Nash equilibrium.Moreover,it is shown that the FCPAA maximizes total utility,and converges more quickly than the method addressed in prior research with the help of improved round-robin rules.However,the FCPAA cannot ensure the same social fairness among secondary users as the SFAF scheme in both the non-fading channel and Rayleigh fading channel;the SFAF balances the individual utility by adjusting each user’s budget at the expense of a small quantity of system total throughput.     

Adaptive joint bandwidth and power allocation in heterogeneous wireless access environment

Joint bandwidth and power allocation for a multi-radio access(MRA)system in a heterogeneous wireless access environment is studied.Since both the number of users being served by the system and the wireless channel state are time-varying,the optimal resource allocation is no longer a static optimum and will change with the varying network state.Moreover,distributed resource allocation algorithms that require iterative updating and signaling interactions cannot converge in negligible time.Thus,it is unrealistic to assume that the active user number and the wireless channel state remain unchanged during the iterations.In this paper,we propose an adaptive joint bandwidth and power allocation algorithm based on a novel iteration stepsize selection method,which can adapt to the varying network state and accelerate the convergence rate.A distributed solution is also designed for the adaptive joint resource allocation implementation.Numerical results show that the proposed algorithm can not only track the varying optimal resource allocation result much more quickly than a traditional algorithm with fixed iteration stepsize,but can also reduce the data transmission time for users and increase the system throughput.     

MABP: an optimal resource allocation approach in data center networks

In data center networks, resource allocation based on workload is an effective way to allocate the infrastructure resources to diverse cloud applications and satisfy the quality of service for the users, which refers to mapping a large number of workloads provided by cloud users/tenants to substrate network provided by cloud providers. Although the existing heuristic approaches are able to find a feasible solution, the quality of the solution is not guaranteed. Concerning this issue, based on the minimum mapping cost, this paper solves the resource allocation problem by modeling it as a distributed constraint optimization problem. Then an efficient approach is proposed to solve the resource allocation problem, aiming to find a feasible solution and ensuring the optimality of the solution. Finally, theoretical analysis and extensive experiments have demonstrated the effectiveness and efficiency of our proposed approach.