Sampling average approximation method for a class of stochastic Nash equilibrium problems

We consider a class of stochastic Nash equilibrium problems (SNEP). Under some mild conditions, we reformulate the SNEP as a stochastic mixed complementarity problem (SMCP). We apply the well-known sample average approximation (SAA) method to solve the SMCP. We further introduce a semismooth Newton method to solve the SAA problems. The comprehensive convergence analysis is given as well. In addition, we demonstrate the proposed approach on a stochastic Nash equilibrium model in the wholesale gas–oil markets.     

基于智能客户端的巡检系统设计与实现

针对健康检查中心医生外出进行健康检查作业时,健康检查系统无法离线使用的问题,本文应用智能客户端技术构建巡检系统。该巡检系统可以在离线状态完成健检系统功能,待系统连线以后,通过调用Web Service访问健康检查中心数据库进行数据上传和下载。对系统进行总体设计,给出体系结构图,并且详细介绍相关技术及实现。     

基于改进型精密整流电路的电容式微位移传感器设计

介绍了一种改进型精密整流电路,该电路基于一个模拟多路复用器,无需二极管和匹配电阻,克服了传统整流电路中的非线性问题。同时基于该精密整流电路设计了一种电容式微位移传感器。测试结果表明,在0～1.6mm的量程内,该电容式微位移传感器的非线性误差小于0.6‰,灵敏度约为4.3V/mm。     

A statistical model of cluster stability

In the current paper we present a method for assessing cluster stability. This method, combined with a clustering algorithm, yields an estimate of the data partition, namely, the number of clusters. We adopt the cluster stability standpoint where clusters are imagined as islands of “high” density in a sea of “low” density. Explicitly, a cluster is associated with its high density core. Our approach offers to evaluate the goodness of a cluster by the similarity amongst the entire cluster and its core. We propose to measure this resemblance by two-sample tests or by probability distances between appropriate probability distributions. The distances are calculated on clustered samples drawn from the source population according to two different distributions. The first law is the underlying set distribution. The second law is constructed so that it represents the clusters’ cores. Here, a variant of the k-nearest neighbor density estimation is applied, so that items belonging to cores have a much higher chance to be selected. As the sample distribution is unknown a distribution-free two-sample test is required to examine the mentioned correspondence. For constructing such a test, we use distance functions built on negative definite kernels. In practice, outliers in the samples and limitations of the clustering algorithm heavily contribute to the noise level. As a result of this shortcoming the distance values have to be determined for many pairs of samples and therefore an empirical distance's distribution is obtained. The distribution is dependent on the examined number of clusters. To prevent this property for biasing the results we normalize the distances. It is conjectured that the true number of clusters yields the most concentrated normalized distribution. To measure the concentration we use the sample mean and the sample 25th percentile. The paper exhibits the good performance of the proposed method on synthetic and real-world data.     

一种基于Vague-Sigmoid核的支持向量机研究

Sigmoid核最初起源于神经网络,目前在支持向量机中也得到了广泛应用,但由于核矩阵的非半正定性,其应用受到一些限制.研究表明Sigmoid核可以用简单的模糊三角隶属函数来近似替代,使得其学习效率能进一步提高.本文首先分析模糊支持向量机的特性,将模糊理论用于支持向量机的核中,并在此基础上提出了基于Vague-Sigmoid核函数的支持向量分类器.该方法充分结合了Vague集的自身优势,用基于Vague集的相似度量来代替了常规中的样本间的点积计算方法.将文中提出的方法应用于标准数据集中,并与传统的Sigmoid核方法、Fuzzy -Sigmoid核方法进行了实验分析, 实验表明文中提出的方法在不损失精度的情况下,能较好的提高算法的执行效率,取得了较好的实验结果;同时也表明在支持向量机中能利用Vague-S igmoid核取代替传统的Sigmoid核,从而减少对Sigmoid核的限制.     

基于NMF图像重构的人脸识别

由传统的人脸识别方法产生的人脸特征子空间通常是由人脸库中所有训练样本产生的一个通用子空间,该空间更多地包含了所有人脸样本的共性特征,而忽略了个性特征。该文提出一种基于NMF图像重构的方法,以单个人的训练样本集获取其人脸特征子空间,将识别图像向每一个特征子空间中进行映射及重构,并以重构图像的误差作为判据实现人脸识别。在ORL标准人脸库进行的计算机仿真证实了该方法的有效性。     

粒子群算法求解任务可拆分项目调度问题

首先针对任务可拆分的项目调度问题,提出一种带有局部搜索的粒子群算法LSPSO;然后采用基于任务排列的粒子表示方法,将遗传算法中的定位交叉引入粒子的更新过程中,并采用局部搜索技术对更新后的粒子进行改进;最后对Patterson测试集中110个问题实例进行了测试,实验结果表明,算法LSPSO具有较快的速度,所给出的调度方案较优.     

一种工业过程稳态优化控制算法

针对带有输出关联约束的工业过程,提出一种确定其稳态优化控制的算法.首先通过对数变换将原问题转化为一个等价而且可在对数空间求解的优化控制问题;然后为避免事先选择一个合适罚系数的困难,在算法中引入了目标函数的线性化形式.该优化算法不仅能收敛到正确的系统最优解,而且可用现有的二次规划算法计算.应用简单的滤波技术,改善了算法在有量测噪声情况下的性能.仿真结果表明,所提出的优化算法是有效的.