Static search games played over graphs and general metric spaces

We define a general game which forms a basis for modelling situations of static search and concealment over regions with spatial structure. The game involves two players, the searching player and the concealing player, and is played over a metric space. Each player simultaneously chooses to deploy at a point in the space; the searching player receiving a payoff of 1 if his opponent lies within a predetermined radius r of his position, the concealing player receiving a payoff of 1 otherwise. The concepts of dominance and equivalence of strategies are examined in the context of this game, before focusing on the more specific case of the game played over a graph. Methods are presented to simplify the analysis of such games, both by means of the iterated elimination of dominated strategies and through consideration of automorphisms of the graph. Lower and upper bounds on the value of the game are presented and optimal mixed strategies are calculated for games played over a particular family of graphs.     

Analytic hierarchy process for multi-sensor data fusion based on belief function theory

Multi-sensor data fusion is an evolving technology whereby data from multiple sensor inputs are processed and combined. The data derived from multiple sensors can, however, be uncertain, imperfect, and conflicting. The present study is undertaken to help contribute to the continuous search for viable approaches to overcome the problems associated with data conflict and imperfection. Sensor readings, represented by belief functions, have to be fused according to their corresponding weights. Previous studies have often estimated the weights of sensor readings based on a single criterion. Mono-criteria approaches for the assessment of sensor reading weights are, however, often unreliable and inadequate for the reflection of reality. Accordingly, this work opts for the use of a multi-criteria decision aid. A modified Analytical Hierarchy Process (AHP) that incorporates several criteria is proposed to determine the weights of a sensor reading set. The approach relies on the automation of pairwise comparisons to eliminate subjectivity and reduce inconsistency. It assesses the weight of each sensor reading, and fuses the weighed readings obtained using a modified average combination rule. The efficiency of this approach is evaluated in a target recognition context. Several tests, sensitivity analysis, and comparisons with other approaches available in the literature are described.     

Data Envelopment Analysis of multiple response experiments

Taguchi method is the usual strategy in robust design and involves conducting experiments using orthogonal arrays and estimating the combination of factor levels that optimizes a given performance measure, typically a signal-to-noise ratio. The problem is more complex in the case of multiple responses since the combinations of factor levels that optimize the different responses usually differ. In this paper, an Artificial Neural Network, trained with the experiments results, is used to estimate the responses for all factor level combinations. After that, Data Envelopment Analysis (DEA) is used first to select the efficient (i.e. non-dominated) factor level combinations and then for choosing among them the one which leads to a most robust quality loss penalization. Mean Square Deviations of the quality characteristics are used as DEA inputs. Among the advantages of the proposed approach over traditional Taguchi method are the non-parametric, non-linear way of estimating quality loss measures for unobserved factor combinations and the non-parametric character of the performance evaluation of all the factor combinations. The proposed approach is applied to a number of case studies from the literature and compared with existing approaches.     

单重工作休假M/M/c排队驱动的流体模型分析

该文在M/M/c排队驱动系统中加入工作休假策略,研究了单重工作休假多服务台排队驱动的流体模型.利用拟生灭过程和矩阵几何解法得到驱动系统稳态队长分布.构建净输入率结构,导出流体模型的稳态联合分布函数满足的的矩阵微分方程组,进而利用Laplace-Stieltjes变换(LST)方法得到稳态下缓冲器库存量的空库概率及均值表...     

基于混合密度网络模型拟合收益统计分布与计算Expected Shortfall

基于混合密度网络模型估计金融时间序列的时变条件密件,提出数值模拟方法计算ExpectedShortfall。对香港恒生指数的实证研究表明,混合密度网络可以有效地描述收益的经验分布统计特征和波动规律,模型评估指标反映出预测效果良好,Value-at-R isk的预测精度在高端分位点表现较好,且可有效计算Expected shortfall指标,是金融市场风险测量的有效方法。     

求解无线传感器网络路由问题的蚁群最优化算法及其收敛性

首先将无线传感器网络的路由问题转化成求解最小Steiner树问题,然后给出了求解无线传感器网络路由的蚁群优化算法,并对算法的收敛性进行了证明．最后对找到最优解后信息素值的变化进行了分析．即在限制信息素取值的条件下,当迭代次数充分大时,该算法能以任意接近于1的概率找到最优解,并且当最优解找到后,最优树边上的信息素单调增加,而最优解以外边上的信息素在有限步达到最小值．     

Perovskite-type proton conductor for novel direct ionic thermoelectric hydrogen sensor

It was investigated whether a perovskite-type proton conductor, here BaCe_0.95Y_0.05O_3 − δ (BCY), is suitable as sensing material for a novel type of thermoelectric hydrogen sensor. Therefore, the hydrogen and oxygen concentration dependence of the thermopower of BaCe_0.95Y_0.05O_3 − δ was determined and was found to be in the same range as the value derived from theory. The hydrogen dependence was also measured at different temperatures, and only a comparatively small temperature dependence of the thermopower was observed.     

基于视频推荐技术的无线网络视频服务器设计

无线网络视频服务器中视频推荐技术已成为重要技术之一,视频推荐技术是为了用户在使用无线网络是视频务器时,更快的找到感兴趣的视频。采用当前方法对用户进行视频推荐时,未考虑用户的兴趣偏好是否随着时间有所变化,使视频推荐出现偏差。为此,提出一种基于视频推荐技术的无线网络视频服务器设计方法。该方法首先使用无线网络视频服务器硬件部分的MPEG-4进行视频数据采集,并对MPEG-4采集的视频数据进行整理。在由软件部分把采集到的视频数据储存到缓冲区,进行视频缓冲,并建立视频数据队列进行视频数据输送。以计算无线网络视频的相似度来搜索相近视频,将搜索到的视频与目标用户观看过的视频进行对比,对比相似度越接近1,则说明用户对推荐视频感兴趣的几率大,反之越接近-1用户对推荐视频越不感兴趣。此计算方法能有效的从海量视频数据中快速的搜索出目标用户感兴趣视频。实验结果表明,将视频推荐技术应用到无线网络视频中可以迅速准确的搜索出目标用户感兴趣视频。     

Detecting embedded pure network structures in LP problems

Recently, linear programming problems with special structures have assumed growing importance in mathematical programming. It is well known that exploiting network structures within linear programs can lead to considerable improvement of the computational solution of large-scale linear programming problems. A linear program is said to contain an embedded network structure provided that some subset of its constraints can be interpreted as specifying conservation of flow. If a column of the constraint matrix has at most two non-zeros, then it leads to embedded generalized network structure and if these non-zeros are unit elements and of opposite signs, then it leads to embedded pure network structure. In this paper, we are concerned with algorithms for detecting embedded pure network structures within linear programs. The network extraction methods are presented in two groups. The first group covers deletion and addition based algorithms and the second group covers GUB based algorithms. We have extended the GUB based algorithm appearing in the second group by introducing Markowitz merit count approach for exploiting matrix non zeros. A set of well known test problems has been used to carry out computational experiments which show that our extensions to the GUB based algorithms give better results than the algorithms reported earlier.