无线ILC系统测控信号延时效应补偿方法

针对通过无线信道进行测控信号传输的远程迭代学习控制( ILC)系统,研究信号传输延时对控制系统性能的影响.分析了测控信号延时情况下ILC系统的收敛性问题,通过引入预控制向量,提出了ILC系统信道延时效应补偿的向量更新方法.数值仿真结果表明了所提方法的有效性.     

一种新的码片内多径时延估计方法

根据信道冲激响应的稀疏特性,提出了一种频域的时延估计压缩感知模型,将时延估计问题转化为基于欠采样数据的稀疏向量估计问题.利用离散傅里叶变换(Discrete Fourier transform,DFT)矩阵的子矩阵所满足的受限等距性(Restricted isometry property,RIP)以及信道冲激响应的稀疏特性充分降低了时延估计所需数据量的要求.分析了本文模型具有码片内多径分辨能力以及良好抗噪性能的原因,并与多信号分类(Multiple signal classification,MUSIC)和旋转不变技术的信号参数估计(Estimation of signal parameters via rotational invariance technique,ESPRIT)算法的时延估计性能进行仿真比较.仿真结果表明,本文提出的方法不需要预知多径的条数,对码片内多径时延具有较高的估计精度,其时延估计性能在特定条件下优于MUSIC和ESPRIT算法.     

Entropy/cross entropy-based group decision making under intuitionistic fuzzy environment

We study the group decision making problem under intuitionistic fuzzy environment. Based on entropy and cross entropy, we give two methods to determine the optimal weights of attributes, and develop two pairs of entropy and cross entropy measures for intuitionistic fuzzy values. Then, we discuss the properties of these measures and the relations between them and the existing ones. Furthermore, we introduce three new aggregation operators, which treat the membership and non-membership information fairly, to aggregate intuitionistic fuzzy information. Finally, several practical examples are presented to illustrate the developed methods.     

A hybrid stock selection model using genetic algorithms and support vector regression

In the areas of investment research and applications, feasible quantitative models include methodologies stemming from soft computing for prediction of financial time series, multi-objective optimization of investment return and risk reduction, as well as selection of investment instruments for portfolio management based on asset ranking using a variety of input variables and historical data, etc. Among all these, stock selection has long been identified as a challenging and important task. This line of research is highly contingent upon reliable stock ranking for successful portfolio construction. Recent advances in machine learning and data mining are leading to significant opportunities to solve these problems more effectively. In this study, we aim at developing a methodology for effective stock selection using support vector regression (SVR) as well as genetic algorithms (GAs). We first employ the SVR method to generate surrogates for actual stock returns that in turn serve to provide reliable rankings of stocks. Top-ranked stocks can thus be selected to form a portfolio. On top of this model, the GA is employed for the optimization of model parameters, and feature selection to acquire optimal subsets of input variables to the SVR model. We will show that the investment returns provided by our proposed methodology significantly outperform the benchmark. Based upon these promising results, we expect this hybrid GA-SVR methodology to advance the research in soft computing for finance and provide an effective solution to stock selection in practice.     

Soft computing approach to fault diagnosis of centrifugal pump

Fault detection and isolation in rotating machinery is very important from an industrial viewpoint as it can help in maintenance activities and significantly reduce the down-time of the machine, resulting in major cost savings. Traditional methods have been found to be not very accurate. Soft computing based methods are now being increasingly employed for the purpose. The proposed method is based on a genetic programming technique which is known as gene expression programming (GEP). GEP is somewhat a new member of the genetic programming family. The main objective of this paper is to compare the classification accuracy of the proposed evolutionary computing based method with other pattern classification approaches such as support vector machine (SVM), Wavelet-GEP, and proximal support vector machine (PSVM). For this purpose, six states viz., normal, bearing fault, impeller fault, seal fault, impeller and bearing fault together, cavitation are simulated on centrifugal pump. Decision tree algorithm is used to select the features. The results obtained using GEP is compared with the performance of Wavelet-GEP, support vector machine (SVM) and proximal support vector machine (PSVM) based classifiers. It is observed that both GEP and SVM equally outperform the other two classifiers (PSVM and Wavelet-GEP) considered in the present study.     

A parallel Monte Carlo search algorithm for the conformational analysis of polypeptides

In recent years several approaches have been proposed to overcome the multiple-minima problem associated with nonlinear optimization techniques used in the analysis of molecular conformations. One such technique based on a parallel Monte Carlo search algorithm is analyzed. Experiments on the Intel iPSC/2 confirm that the attainable parallelism is limited by the underlying acceptance rate in the Monte Carlo search. It is proposed that optimal performance can be achieved in combination with vector processing. Tests on both the IBM 3090 and Intel iPSC/2-VX indicate that vector performance is related to molecule size and vector pipeline latency.     

航空发动机传感器故障鲁棒检测方法

研究发动机传感器故障准确检测问题,现代航空发动机数字电子控制系统对传感器的可靠性要求日益提高。针对航空发动机结构复杂,又工作在高温和高压下,常规采用的传感器故障检测方法的准确性易受到建模误差与外界扰动的影响,造成漏报或误报。为了提高检测精度,提出建立航空发动机数控系统传感器未知输入故障模型,采用特征结构配置的方法,通过配置闭环系统左特征向量实现故障检测残差对不确定性因素的干扰解耦,降低扰动对故障诊断结果的影响。用某型涡扇发动机数控系统传感器故障数字仿真试验表明,所设计的方法对范数有界的不确定量可以实现干扰解耦,抑制干扰对故障检测的影响,改善检测算法的鲁棒性,提高检测结果的准确性,同时满足在线运算的实时性要求。提高了航空发动机的可靠性,保证了安全飞行。     

基于邻域彩色变化矢量场的图像边缘检测技术研究*

首先进行了边缘检测系统结构设计,建立了图像邻域彩色变化矢量场的数理模型,提出了用图像邻域彩色变化方向锐度描述图像边缘,进而应用模糊聚类自适应检测边缘.实验表明:与基于梯度的边缘检测技术相比,该方法在噪声抑制以及边缘准确定位上均取得了好的效果,是一种应用广泛的优秀边缘检测算法.     

Adenovirus-Mediated Inducible Expression of a PD-L1 Blocking Antibody in Combination with Macrophage Depletion Improves Survival in a Mouse Model of Peritoneal Carcinomatosis

Immune checkpoint inhibitors (ICIs) have demonstrated remarkable efficacy in a growing number of malignancies. However, overcoming primary or secondary resistances is difficult due to pharmacokinetics issues and side effects associated with high systemic exposure. Local or regional expression of monoclonal antibodies (mAbs) using gene therapy vectors can alleviate this problem. In this work, we describe a high-capacity adenoviral vector (HCA-EFZP-aPDL1) equipped with a mifepristone-inducible system for the controlled expression of an anti-programmed death ligand 1 (PD-L1) blocking antibody. The vector was tested in an immune-competent mouse model of colorectal cancer based on implantation of MC38 cells. A single local administration of HCA-EFZP-aPDL1 in subcutaneous lesions led to a significant reduction in tumor growth with minimal release of the antibody in the circulation. When the vector was tested in a more stringent setting (rapidly progressing peritoneal carcinomatosis), the antitumor effect was marginal even in combination with other immune-stimulatory agents such as polyinosinic-polycytidylic acid (pI:C), blocking mAbs for T cell immunoglobulin, mucin-domain containing-3 (TIM-3) or agonistic mAbs for 4-1BB (CD137). In contrast, macrophage depletion by clodronate liposomes enhanced the efficacy of HCA-EFZP-aPDL1. These results highlight the importance of addressing macrophage-associated immunoregulatory mechanisms to overcome resistance to ICIs in the context of colorectal cancer.     

Quadratic optimization fine tuning for the Support Vector Machines learning phase

This work presents a comparative analysis of specific, rather than general, mathematical programming implementation techniques of the quadratic optimization problem (QP) based on Support Vector Machines (SVM) learning process. Considering the Karush–Kuhn–Tucker (KKT) optimality conditions, we present a strategy of implementation of the SVM-QP following three classical approaches: (i) active set, also divided in primal and dual spaces, methods, (ii) interior point methods and (iii) linearization strategies. We also present the general extension to treat large-scale applications consisting in a general decomposition of the QP problem into smaller ones, conserving the exact solution approach. In the same manner, we propose a set of heuristics to take into account for a better than a random selection process for the initialization of the decomposition strategy. We compare the performances of the optimization strategies using some well-known benchmark databases.