Interactive fuzzy stochastic multi-level 0–1 programming using tabu search and probability maximization

In this paper, we consider interactive fuzzy programming for multi-level 0–1 programming problems involving random variable coefficients both in objective functions and constraints. Following the probability maximization model together with the concept of chance constraints, the formulated stochastic multi-level 0–1 programming problems are transformed into deterministic ones. Taking into account vagueness of judgments of the decision makers, we present interactive fuzzy programming. In the proposed interactive method, after determining the fuzzy goals of the decision makers at all levels, a satisfactory solution is derived efficiently by updating satisfactory levels of the decision makers with considerations of overall satisfactory balance among all levels. For solving the transformed deterministic problems efficiently, we also introduce novel tabu search for general 0–1 programming problems. A numerical example for a three-level 0–1 programming problem is provided to illustrate the proposed method.     

FREQUENCY DOMAIN TESTS OF MULTIVARIATE GAUSSIANITY AND LINEARITY

A stationary multivariate time series { X _t } is defined as linear if it can be written in the form X _t = ∑^∞ _{j =−∞} A _j e _{t − j} where A _j are square matrices and e _t are independent and identically distributed random vectors. If the e _t } are normally distributed, then { X _t is a multivariate Gaussian linear process. This paper is concerned with the testing of departures of a vector stationary process from multivariate Gaussianity and linearity using the bispectral approach. First the definition and properties of cumulants of random matrices are used to obtain the expressions for the higher-order cumulant and spectral vectors of a linear vector process as defined above. Then it is shown that linearity of a vector process implies constancy of the modulus square of its normalized higher-order spectra whereas the component of such a vector process does not necessarily have a linear representation. Finally, statistics for the testing of multivariate Gaussianity and linearity are proposed.     

PP-R管材料熔融挤出过程MFR控制研究

分析了PP-R（无规共聚聚丙烯）管材料MFR（熔体流动速率）的变化对力学性能的影响，着重通过双螺杆挤出机研究了PP—R管材料熔融挤出过程中影响MFR变化的因素。结果表明，合适的加工工艺控制和优良的抗氧体系是保证PP-R管材料加工过程中MFR稳定的前提。     

Event-driven,pattern-based methodology for cost-effective development of standardized personal health devices

Experiences applying standards in personal health devices (PHDs) show an inherent trade-off between interoperability and costs (in terms of processing load and development time). Therefore, reducing hardware and software costs as well as time-to-market is crucial for standards adoption. The ISO/IEEE11073 PHD family of standards (also referred to as X73PHD) provides interoperable communication between PHDs and aggregators. Nevertheless, the responsibility of achieving inexpensive implementations of X73PHD in limited resource microcontrollers falls directly on the developer. Hence, the authors previously presented a methodology based on patterns to implement X73-compliant PHDs into devices with low-voltage low-power constraints. That version was based on multitasking, which required additional features and resources. This paper therefore presents an event-driven evolution of the patterns-based methodology for cost-effective development of standardized PHDs. The results of comparing between the two versions showed that the mean values of decrease in memory consumption and cycles of latency are 11.59% and 45.95%, respectively. In addition, several enhancements in terms of cost-effectiveness and development time can be derived from the new version of the methodology. Therefore, the new approach could help in producing cost-effective X73-compliant PHDs, which in turn could foster the adoption of standards.     

A RANDOM PARAMETER PROCESS FOR MODELING AND FORECASTING TIME SERIES

Abstract. A generalized autoregressive (GAR) process {Z ( t ) ; t = 0 , ±1, …} is defined to satisfy the recurrence relation Z(t) = A_θ (t)Z (t -l)+ u( t ), where {A_θ(t); t = 0,±1, …} is itself a stochastic process depending on a vector parameter θ and where {u( t ); t = 0, ±1, …} is white noise with Eu ² ( t ) = a ². This paper develops theory and methodology and implementing the class of GAR processes for time series modeling and forecasting. Conditions on the 'parameter process' { A _θ ( t ); t = 0, ±1, …} are obtained for the existence of a GAR process; necessary and sufficient conditions on { A_θ ( t ) ; t = 0, ±1, …} for existence of a stationary GAR process are also obtained. Procedures are developed for computing maximum likelihood estimates of the parameters 0 and u² and for computing the minimum mean squared error forecasts for GAR processes.     

一种新的无双线性对的无证书安全签密方案

针对现有的无证书签密方案存在安全性不高、计算效率较低等诸多不足, 在Sharmila签密方案的基础上, 设计了一种新的无双线性对的无证书安全签密方案, 并在随机预言模型下证明了方案具有机密性和不可伪造性。同时, 该方案不需要双线性对和指数运算, 并且在确保安全性的前提下, 仅比现有的最高效签密方案多出两次点乘运算。     

无双线性对的无证书安全签密方案

已有的无双线性对的无证书签密方案,大都存在着机密性漏洞和签名选择性伪造问题。针对此问题,基于有限乘法交换群上的离散对数难题,提出一种无双线性对的无证书签密方案,并进行了安全分析和证明。指出采用随机预言模型的证明方法可能忽略不解决DL难题时对签密方案的攻击,不能证明破解签密方案的难度与解决DL难题相等价。通过对参数的数学分析,证明了破解本签密方案的必要条件是解决DL难题,不存在不解决DL难题攻击本签密方案的多项式时间算法。与已知所有方案相比,所提方案安全性更高。     

基于蚁群聚集信息素的半监督文本分类算法

半监督文本分类中已标记数据与未标记数据分布不一致,可能导致分类器性能较低。为此,提出一种利用蚁群聚集信息素浓度的半监督文本分类算法。将聚集信息素与传统的文本相似度计算相融合,利用Top-k策略选取出未标记蚂蚁可能归属的种群,依据判断规则判定未标记蚂蚁的置信度,采用随机选择策略,把置信度高的未标记蚂蚁加入到对其最有吸引力的训练种群中。在标准数据集上与朴素贝叶斯算法和EM算法进行对比实验,结果表明,该算法在精确率、召回率以及F1度量方面都取得了更好的效果。     

基于条件随机场的低图像质量车牌字符分割

提出一种基于条件随机场的车牌字符分割算法,能够对光照不均、相机拍摄角度造成的低图像质量的车牌图像,特别是日益增多的车牌边框与字符相连接车牌图像进行有效的字符分割。算法首先进行车牌图像校正,然后利用标注车牌数据进行模型学习,对车牌图像像素列进行分类识别,最后组合成车牌字符分割结果。理论分析与实验结果验证了算法的有效性。     

随机环境下带有私人信息的单机能力分配策略

本文研究随机环境下考虑私人信息的单机能力分配问题.该问题中各部门的单位产品收益、需求信息及加工设备各时段的能力为私人信息,且各时段中产品的加工时间为随机变量.本文采用设备方与各部门协商的方法对问题进行求解,首先利用随机规划理论将能力分配问题清晰化,然后利用拉格朗日松弛和泰勒级数展开方法进行协商机制设计,接着给出基于偏转次梯度方法的协商参数更新法则,最后综合上述过程给出最终的问题求解算法.数值算例验证了算法的有效性并分析了关键参数对能力分配结果的影响.