Further results of recursive evaluation for compound distribution with the severity distribution of mixed type

Yang et al. [J.P. Yang, S.H. Cheng, Q. Wu, Recursive equations for compound distribution with the severity distribution of the mixed type, Science in China Series A 48 (2005) 594-609] investigated a recursive procedure for a kind of compound distributions with the number of claims belonging to (a,b)-family and the severity distribution of the mixed type. In this paper, we extend their results by assuming that the claim number belongs to a larger class. As applications, the excess-of-loss reinsurance treaty is discussed and concrete examples are considered in some detail.     

Usability evaluation methods for the web: A systematic mapping study

Context

In recent years, many usability evaluation methods (UEMs) have been employed to evaluate Web applications. However, many of these applications still do not meet most customers’ usability expectations and many companies have folded as a result of not considering Web usability issues. No studies currently exist with regard to either the use of usability evaluation methods for the Web or the benefits they bring.

Objective

The objective of this paper is to summarize the current knowledge that is available as regards the usability evaluation methods (UEMs) that have been employed to evaluate Web applications over the last 14 years.

Method

A systematic mapping study was performed to assess the UEMs that have been used by researchers to evaluate Web applications and their relation to the Web development process. Systematic mapping studies are useful for categorizing and summarizing the existing information concerning a research question in an unbiased manner.

Results

The results show that around 39% of the papers reviewed reported the use of evaluation methods that had been specifically crafted for the Web. The results also show that the type of method most widely used was that of User Testing. The results identify several research gaps, such as the fact that around 90% of the studies applied evaluations during the implementation phase of the Web application development, which is the most costly phase in which to perform changes. A list of the UEMs that were found is also provided in order to guide novice usability practitioners.

Conclusions

From an initial set of 2703 papers, a total of 206 research papers were selected for the mapping study. The results obtained allowed us to reach conclusions concerning the state-of-the-art of UEMs for evaluating Web applications. This allowed us to identify several research gaps, which subsequently provided us with a framework in which new research activities can be more appropriately positioned, and from which useful information for novice usability practitioners can be extracted.     

Worst-case optimal algorithm for XPath evaluation over XML streams

We consider the XPath evaluation problem: Evaluate an XPath query Q on a streaming XML document D; i.e., determine the set Q(D) of document elements selected by Q. We mainly consider Conjunctive XPath queries that involve only the child and descendant axes. Previously known in-memory algorithms for this problem use O(|D|) space and O(|Q||D|) time. Several previously known algorithms for the streaming version use Ω(dn) space and Ω(dn|D|) time in the worst case; d denotes the depth of D, and n denotes the number of location steps in Q. Their exponential space requirement could well exceed the O(|D|) space used by the in-memory algorithms. We present an efficient algorithm that uses O(d|Q|+nc) space and O((|Q|+dn)|D|) time in the worst case; c denotes the maximum number of elements of D that can be candidates for output, at any one instant. For some worst case Q and D, the memory space used by our algorithm matches our lower bound proved in a different paper; so, our algorithm uses optimal memory space in the worst case.     

基于聚类的P2P电子商务信誉评价算法

提出基于聚类的P2P电子商务信誉评价算法。该算法根据节点行为的相似性将节点聚类成若干集合,将每个节点集合视为一个节点进行迭代信誉计算。诚实节点行为相似性较高,通常聚类为最大的节点集合,在迭代计算中占主导地位。实验结果表明,与基于社会网络和概率估计的信誉评价体系算法相比,该算法误差较小。     

基于视频三音子的双模态语料自动选取算法

为实现可视语音合成,建立符合条件的双模态语料库,提出双模态语料自动选取算法。根据视频中唇部发音特征,对已有的三音子模型归类,形成视频三音子,在其基础上从原始语料中自动选取语料,利用评估函数对原始语料中的句子打分。与其他双模态语料库相比,该语料库在覆盖率等指标上有较大改进,为实现具有真实感的可视语音合成奠定基础。     

基于改进基因表达式程序设计的股票指数预测

介绍基因表达式程序设计方法的基本原理,针对股票指数分析与预测问题,在经典的GEP算法基础上,提出一种基于动态变异算子的改进的GEP算法——IGEP算法,动态变异算子随着进化代数和染色体所含基因数目不同而变化,从而加快了GEP的收敛速度和精确度,对算法进行了复杂度和收敛性分析。设计一种基于IGEP的股票指数分析与预测算法,数值实验结果表明,该算法优于经典GEP算法,具有较广泛的通用性。     

粗关系数据库查询模型

针对粗关系数据库中数据的特性,提出一种不确定性数据的存储方法。基于汉明距离的一种变式,计算元组间距离,构成距离矩阵,根据距离矩阵将相同或相近的元组归类,从而有效地对表中的元组进行索引。借助粗集中的上、下近似,通过计算用户查询的数据与粗关系数据库中数据的相似度,查询出用户所需的数据。结合以上方法构建粗关系数据库查询模型,设计相应的查询算法并应用于实例中。     

基于改进灰色理论的威胁指标权重技术

针对各种网络指标之间的相互影响,同时考虑主客观2个方面的因素,提出用灰色理论中的灰关联度和传统层次分析法相结合的算法进行网络威胁指标权重的确定。实验证明,该方法数学理论严谨,具有良好的实用价值,使网络威胁评估方法在可信度方面有一定的 提高。     

无线传感器网络中的选择转发攻击检测

针对无线传感器网络中现有检测攻击方法需要节点协同或检测硬件的缺点,对选择转发攻击进行研究,提出一种基于信任度与丢包行为的检测方法。通过节点收发数据包的情况,计算节点的信任度,结合节点丢包行为评估,判断节点是否发动攻击。这种检测方法的计算与存储开销都集中于基站,且不需增加额外的检测设备。实验结果表明,这种方法较之现有检测方法,检测率更高。