一种有效的优化的多载波通信系统的功率分配算法

本文提出一种关于DMT系统传输纯数据流业务的最佳的功率分配算法，该算法使用了一种有效的表格查手工艺工和拉格朗日乘法器对分搜索办法，能够较快的收敛到最佳的功率点。同时，易于用硬件和软件实现。     

一种具有弹性服务质量要求的多业务最优接纳控制策略

随着无线网络所支持的业务种类的增加和具有弹性服务质量要求的业务的大量出现，与服务质量保证密切相关的呼叫接纳控制问题成了近年来无线网络研究的热点之一。本文研究了基于准马尔可夫决策过程方法的多业务最优呼叫接纳控制问题。根据业务的特点，首先引入了带宽分配满意度函数和收益率函数，在此基础上，提出了基于带宽分配满意度的最优带宽分配算法和基于准马尔可夫决策过程方法的最优呼叫接纳控制策略。计算结果表明，本文方案能够在对各类业务的呼叫阻塞率进行适当权衡的前提下，进一步提高网络的期望收益率和期望带宽利用率，同时满足了各类业务的最低服务质量要求。     

通信瓶颈下的实时并行任务分配研究

提出了实时并行任务粒度划分的具体设计方法，采用了系统内通信迟延最小的约束条件进行多处理器上的任务分配，解决了高速实时信号处理中的数据通信瓶颈问题。在自行设计的超立方体结构的通用信号处理机上，实现了空时二维自适应信号处理和SAR实时成像，显著减小了数据通信迟延，提高了并行效率和性价比。     

信道粒度可变的分块自适应OFDM传输系统

满足不同服务质量(QoS)业务是Beyond 3G系统必须考虑的一个问题。本文提出一种可变信道粒度的分块自适应OFDM系统。系统能够根据不同用户多样化的速率需求，自适应地改变分块的大小，并且在每个分块上进行自适应调制，在满足用户速率要求的基础上降低了对子载波分配信息(SAI)和自适应调制信息(AMI)的需求。仿真结果表明，本文提出的系统在系统容量和频谱效率上比固定分块自适应OFDM系统有更好的性能。     

VaR and ES for linear portfolios with mixture of elliptic distributions risk factors

In this paper, we generalize the Linear VaR method from portfolios with normally distributed risk factors to portfolios with mixture of elliptically distributed ones. We treat both the Expected Shortfall and the Value-at-Risk of such portfolios. Special attention is given to the particular case of a mixture of multivariate t-distributions. This is a part of J. SADEFO-KAMDEM PhD Thesis[12] of the Université de Reims, France . It has been presented at the workshop on modelling and computation in Financial Engineering at Bad Herrenalb, Germany May 6-8, 2003. The author is an associate professor at the Department of mathematics, université d’Evry Val d’Essonne.     

Serial deployment of attention during visual search.

This study examined whether objects are attended in serial or in parallel during a demanding visual search task. A component of the event-related potential waveform, the N2pc wave, was used as a continuous measure of the allocation of attention to possible targets in the search arrays. Experiment 1 demonstrated that the relative allocation of attention shifts rapidly, favoring one item and then another. In Experiment 2, a paradigm was used that made it possible to track the absolute allocation of attention to individual items. This experiment showed that attention was allocated to one object for 100-150 ms before attention began to be allocated to the next object. These findings support models of attention that posit serial processing in demanding visual search tasks. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Seeking the truth about ad hoc join costs

In this paper, we re-examine the results of prior work on methods for computing ad hoc joins. We develop a detailed cost model for predicting join algorithm performance, and we use the model to develop cost formulas for the major ad hoc join methods found in the relational database literature. We show that various pieces of “common wisdom” about join algorithm performance fail to hold up when analyzed carefully, and we use our detailed cost model to derive op timal buffer allocation schemes for each of the join methods examined here. We show that optimizing their buffer allocations can lead to large performance improvements, e.g., as much as a 400% improvement in some cases. We also validate our cost model's predictions by measuring an actual implementation of each join algorithm considered. The results of this work should be directly useful to implementors of relational query optimizers and query processing systems. Edited by M. Adiba. Received May 1993 / Accepted April 1996     

山东省水资源配置思路浅析

山东省总体上属于资源性缺水省份，合理配置水资源已成为解决水资源供需矛盾、保障经济社会可持续发展的关键问题之一。通过对山东省水资源的基本特点进行分析，建立了水资源合理配置系统模型及生成配置方案，在供需平衡分析的基础上，提出了水资源合理配置的基本思路。     

An accurate and practical buffer allocation model for the buffer cache based on marginal gains

A new dynamic buffer allocation strategy based on the notion of marginal gains is presented for the buffer cache that is used by the operating system to store frequently accessed disk blocks in main memory, and the performance of the proposed strategy is compared with those of previous allocation strategies. In the proposed strategy, marginal gain values are predicted by exploiting functions that approximate the expected number of buffer hits per unit time. Experimental results from both trace-driven simulation and an actual implementation in the FreeBSD operating system show that the proposed strategy accurately predicts the marginal gain values for various workloads resulting in significantly improved buffer hit ratios.