磁浮列车搭接结构的非线性解耦控制

磁浮列车的搭接结构是一个多输入多输出的非线性系统, 对该系统进行稳定控制是确保磁浮列车可靠性的关键. 本文采用微分几何方法对系统解耦; 采用反馈线性化方法对解耦后的系统进行线性化, 确保了系统的全局稳定性; 对线性化之后的系统采用极点配置的方法进行控制律设计, 使系统的动态性能达到一定的指标; 最后给出了应用此方法的一个实际例子.     

一种特征加权FCM算法的图像重建技术研究

针对传统FCM(Fuzzy C-means)算法中初始聚类中心选取的随机性以及对初始值敏感的问题,提出一种基于进化策略的色彩空间加权的FCM聚类算法.通过在RGB(Red Green Blue)色彩空间矢量中设置加权矩阵来补偿各色彩的非均匀性,并采用一种类内最小距离最大的统计聚类算法来初始化聚类中心.实验结果表明,该算法能有效减少颜色量化后的均方差值,保持重建图像的整体层次和局部特征细节,对研究图像处理技术有较强的实际意义.

Abstract：

Aiming at a defect on randomness of the initial clustering center choosing and sensitivity of initial value in tradition FCM(fuzzy C-means) algorithm, a clustering algorithm about FCM of weighted color space based on evolutionary strategy is proposed. By interposing weighted matrix in RGB(Red Green Blue) color space, the color's inhomogeneous is compensated. And by using a statistics clustering algorithm of minimal maximal distance, clustering center is initiated. The experimental results show that the algorithm can decrease effectively the mean square deviation of color quantization, keep overall arrangement of ideas and part characteristic detail in image reconstruction, and has practical value to the study of the image process technology.     

基于模糊理论的非处方药的满意度评价系统

为了帮助顾客从众多对症的非处方药中选出最满意的药品,提出了开发1个基于Web的非处方药满意度评价系统。系统根据顾客提供的典型症状,采用疾病与症状相结合的选药策略,查找出所有对症的非处方药,并以药品安全性、疗效、稳定性、易用性、价格作为评价因素,根据顾客的关注角度和关注程度确定各因素权重,用模型b=W·R对对症药品进行满意度评价,按满意度高低依次推荐。经实际应用,系统推荐准确度在70%以上。     

面向多层次知识表达的贝叶斯分类模型研究

提出多模式贝叶斯分类算法,由变量值之间的条件独立和条件相关性推断因果关系,根据每个完整随机样本而非整个样本空间构造子模式.结合局部计算近似推理进行概率密度和条件概率分布估计,在此基础上采用后离散化策略自动确定连续变量边界.在UCI机器学习数据集上的实验结果证明了该算法的合理性和有效性.     

基于非结构化控制流的进化测试方法

结构性测试中,进化测试是一种高效的自动生成高质量测试用例的技术.然而,当程序中出现非结构化特征时,在面向节点的测试标准下,其效率极其低下甚至不及随机测试生成方法.在考虑循环体内部出现跳转(goto、retum)语句的情况下,提出了一种适应度计算方法.该方法在结合传统进化测试适应度计算的基础上,充分考虑了循环次数对于进化搜索的影响.实验结果表明,本适应度函数可以很好地引导进化搜索,并以较小的代价生成测试用例.     

基于系统动力学的环境污染演化博弈问题研究

用系统动力学建立环境污染管理问题中政府管理部门与生产排污企业之间的一个混合战略演化博弈模型.仿真结果表明:非对称结构的2*2混合策略演化博弈模型不存在演化均衡.从监管部门的角度出发,改变博弈支付矩阵在演化博弈过程始终保持不变的情况,在博弈支付矩阵中考虑动态惩罚策略.结果表明,本策略的演化博弈模型存在演化稳定均衡,即Nash均衡.系统动力学为演化博弈理论的验证和应用提供一个政策仿真实验平台.     

不确定系统的稳定广义预测控制

针对一类有界不确定线性离散被控对象,采用Min-Max优化方法,提出一种新的稳定广义预测控制(MMSGPC)算法.引入内模控制结构,将干扰和不确定性从被控对象中分离出来,并利用局部反环节对其进行补偿;采用Min-Max优化方法,将终端约束条件转化为有界不确定性最差情况时应的线性方程;通过引入矩阵的Moore-Penrose逆,得到了终端约束线性方程的通解,并结合性能指标函数求得了最优控制律.通过仿真实例验证了该方法的稳定效果.     

Auto-tuning strategy for evolutionary algorithms: balancing between exploration and exploitation

Genetic Algorithms (GAs) and other Evolutionary Algorithms (EAs), as powerful and broadly applicable stochastic search and optimization techniques have been successfully applied in the area of management science, operations research and industrial engineering. In the past few years, researchers gave lots of great idea for improvement of evolutionary algorithms, which include population initialization, individual selection, evolution, parameter setting, hybrid approach with conventional heuristics etc. However, though lots of different versions of evolutionary computations have been created, all of them have turned most of its attention to the development of search abilities of approaches. In this paper, for improving the search ability, we focus on how to take a balance between exploration and exploitation of the search space. It is also very difficult to solve problem, because the balance between exploration and exploitation is depending on the characteristic of different problems. The balance also should be changed dynamically depend on the status of evolution process. Purpose of this paper is the design of an effective approach which it can correspond to most optimization problems. In this paper, we propose an auto-tuning strategy by using fuzzy logic control. The main idea is adaptively regulation for taking the balance among the stochastic search and local search probabilities based on the change of the average fitness of parents and offspring which is occurred at each generation. In addition, numerical analyses of different type optimization problems show that the proposed approach has higher search capability that improve quality of solution and enhanced rate of convergence.     

Ultrafast Switchable Passive Radiative Cooling Smart Windows with Synergistic Optical Modulation

Switchable passive radiative cooling (PRC) smart windows can modulate sunlight transmission and spontaneously emit heat to outer space through atmospheric transparent window, presenting great potential in building energy conservation. However, realizing stable and on-demand control of the cooling efficiency for PRC materials is still challenging. Herein, an electro-controlled polymer-dispersed liquid crystal (PDLC) smart window showing PRC property is designed and prepared by adding mid-infrared emitting reactive monomers into the conventional PDLC matrix. It is found that not only the electro-optical properties but also the PRC efficiency of PRC PDLC film are tunable by regulating the content of the mid-infrared emitting components, film thickness, and micromorphology. This advanced PRC PDLC material achieves a near/sub-ambient temperature when the solar irradiance is below 400 W m⁻² and can dynamically manage daytime cooling efficiency. Importantly, its PRC efficiency is capable of being tuned in an on-demand and ultrafast millisecond-scale way, whose controllable transparency enables multistage heat regulation. This study is hoped to provide new inspiration in the preparation of advanced optical devices and energy-efficient equipment.     

Improvisation of Node Mobility Using Cluster Routing-based Group Adaptive in MANET

In today's Internet routing infrastructure, designers have addressed scaling concerns in routing constrained multiobjective optimization problems examining latency and mobility concerns as a secondary constrain. In tactical Mobile Ad-hoc Network (MANET), hubs can function based on the work plan in various social affairs and the internally connected hubs are almost having the related moving standards where the topology between one and the other are tightly coupled in steady support by considering the touchstone of hubs such as a self-sorted out, self-mending and self-administration. Clustering in the routing process is one of the key aspects to increase MANET performance by coordinating the pathways using multiple criteria and analytics. We present a Group Adaptive Hybrid Routing Algorithm (GAHRA) for gathering portability, which pursues table-driven directing methodology in stable accumulations and on-request steering strategy for versatile situations. Based on this aspect, the research demonstrates an adjustable framework for commuting between the table-driven approach and the on-request approach, with the objectives of enhancing the output of MANET routing computation in each hub. Simulation analysis and replication results reveal that the proposed method is promising than a single well-known existing routing approach and is well-suited for sensitive MANET applications.