车间调度作为车间制造系统的重要组成部分,影响着整个车间制造系统的敏捷性和智能性.但是,由于资源和工艺约束的并存,使得车间调度成为一类NP-hard问题.基于静态的智能算法与动态的多Agent思想,提出了一种结合通用部分全局规划(generalized partial global planning,GPGP)机制与多种智能算法的多Agent车间调度模型,设计了从"初始宏观调度"到"微观再调度"的大规模复杂问题的调度步骤,并构建了一个柔性强且Agent可自我动态调度的仿真系统.同时,从理论上总结了GPGP基本协同机制的策略,实现了二级多目标优化调度.最后使用DECAF仿真Agent软件模拟了车间调度的GPGP协同机制,并与CNP,NONE机制进行了比较.结果表明,所提出的模型不仅提高了调度的效率,而且降低了资源的损耗.
Detecting the boundaries of protein domains is an important and challenging task in both experimental and computational structural biology. In this paper, a promising method for detecting the domain structure of a protein from sequence information alone is presented. The method is based on analyzing multiple sequence alignments derived from a database search. Multiple measures are defined to quantify the domain information content of each position along the sequence. Then they are combined into a single predictor using support vector machine. What is more important, the domain detection is first taken as an imbalanced data learning problem. A novel undersampling method is proposed on distance-based maximal entropy in the feature space of Support Vector Machine (SVM). The overall precision is about 80%. Simulation results demonstrate that the method can help not only in predicting the complete 3D structure of a protein but also in the machine learning system on general imbalanced datasets.
Shu-xue Zou Yan-xin Huang Yan Wang Chun-guang Zhou
为了增强自组织映射(self-organizing map,SOM)网络的动态竞争和聚类能力,提高解的精度,在无监督的SOM神经网络的基础上,通过拓广获胜节点的数量,改进网络中的邻域函数和连接权函数等方法,提出具有多获胜节点的SOM模型.为了避免多个输入样本映射到同一个输出节点,还提出了禁忌映射的方法.为了验证所提出的方法的有效性,以股票的聚类分析为实例,对该方法进行了检验.通过对每股收益、每股净资产、净资产收益率、每股经营性现金流量及净利润等5项反映上市公司综合盈利能力的财务指标进行了模拟实验,所得的数值结果表明,在标准SOM及所提出的几种多获胜节点SOM网络模型中,具有双获胜节点(SOM with 2 winners,SOM2W)的网络模型获得了最好的聚类效果.结合实验结果对网络模型的进一步分析也表明,SOM2W的聚类能力优于标准SOM及其他网络模型.该模型为股票的分析和选择提供了一种可行的途径,在金融领域具有潜在的应用价值.
