Cloud Based Software Computing as a Service in Hybrid Evolution Algorithm with Feedback Assistance

This paper develops cloud based software computing as a service (SCaaS) in the hybrid evolution algorithm with feedback assistance to solve the data optimal NP-complete problems such as travel salesman problems and job shop scheduling problems. Suitable steps, methods, or procedures of the genetic algorithm can be adopted from various evolution procedures or methods of the genetic algorithms based on the fitness evaluation results and survival ratio of different crossover methods in the current generation. The proposed system can dynamically emphasize the corresponding methods or procedures for the better performance in optimal solution searching. In addition, according to the proposed XML format, system users can upload only the coding of chromosomes without implementing the genetic algorithm program. Furthermore, by using the feedback assistance, the convergence time of the optimal solution can be enhanced.     

An incremental intrusion detection system using a new semi‐supervised stream classification method

In recent years, the utilization of machine learning and data mining techniques for intrusion detection has received great attention by both security research communities and intrusion detection system (IDS) developers. In intrusion detection, the most important constraints are the imbalanced class distribution, the scarcity of the labeled data, and the massive amounts of network flows. Moreover, because of the dynamic nature of the network flows, applying static learned models degrades the detection performance significantly over time. In this article, we propose a new semi‐supervised stream classification method for intrusion detection, which is capable of incremental updating using limited labeled data. The proposed method, called the incremental semi‐supervised flow network‐based IDS (ISF‐NIDS), relies on an incremental mixed‐data clustering, a new supervised cluster adjustment method, and an instance‐based learning. The ISF‐NIDS operates in real time and learns new intrusions quickly using limited storage and processing power. The experimental results on the KDD99, Moore, and Sperotto benchmark datasets indicate the superiority of the proposed method compared with the existing state‐of‐the‐art incremental IDSs.     

The use of Sinc‐collocation method for solving Falkner–Skan boundary‐layer equation

The MHD Falkner–Skan equation arises in the study of laminar boundary layers exhibiting similarity on the semi‐infinite domain. The proposed approach is equipped by the orthogonal Sinc functions that have perfect properties. This method solves the problem on the semi‐infinite domain without truncating it to a finite domain and transforming domain of the problem to a finite domain. In addition, the governing partial differential equations are transformed into a system of ordinary differential equations using similarity variables, and then they are solved numerically by the Sinc‐collocation method. It is shown that the Sinc‐collocation method converges to the solution at an exponential rate. Copyright © 2010 John Wiley & Sons, Ltd.     

A novel synthetic strategy for preparing semi‐aromatic components modified polyamide 6 polymer

In this work, a novel synthetic path for preparing semi‐armotic components modified polyamide 6 was developed by caprolactam as solvent of purified terephthalic acid and 1,6‐hexanediamine. First, the ring opening reaction and poly‐addition of caprolactam were initiated by 1,6‐hexanediamine to generate a prepolymer containing amino groups in both ends, then followed by the poly‐condensation reaction with purified terephthalic acid, a long chain copolymer was produced, which the reaction time was reduced by 4 h compared with conventional hydrolytic ring‐opening polymerization of pure caprolactam. By varying the ratio of terephthalic acid and 1,6‐hexanediamine, a series of copolymers with different number average molecular weight and physical properties were prepared. Analytical results showed that the conversion percentage of caprolactam is significantly increased by the proposed method. Furthermore, this new copolymers exhibited excellent transparence and high decomposition temperature. Besides, the copolymers with average molecular weight ≥15,000 present good mechanical properties, making it a potentially useful application in plastics, textile yarn, and membranes. © 2018 Wiley Periodicals, Inc. J. Polym. Sci., Part A: Polym. Chem. 2018 , 56, 959–967     

Operation and preventive maintenance scheduling for containerships: Mathematical model and solution algorithm

This paper considers the problem of determining operation and maintenance schedules for a containership equipped with various subsystems during its sailing according to a pre-determined navigation schedule. The operation schedule, which specifies working time of each subsystem, determines the due-date of each maintenance activity and the maintenance schedule specifies the actual start time of each maintenance activity. The main constraints are subsystem requirements, workforce availability, working time limitation, and inter-maintenance time. To represent the problem mathematically, a mixed integer programming model is developed. Then, due to the complexity of the problem, we suggest a heuristic algorithm that minimizes the sum of earliness and tardiness between the due-date and the actual start time for each maintenance activity. Computational experiments were done on various test instances and the results are reported. In particular, a case study was done on a real instance and a significant amount of improvement is reported over the experience based conventional method.     

Some results about zero‐cycles on abelian and semi‐abelian varieties

In this short note we extend some results obtained in [7]. First, we prove that for an abelian variety A with good ordinary reduction over a finite extension of with p an odd prime, the Albanese kernel of A is the direct sum of its maximal divisible subgroup and a torsion group. Second, for a semi‐abelian variety G over a perfect field k, we construct a decreasing integral filtration of Suslin's singular homology group, , such that the successive quotients are isomorphic to a certain Somekawa K‐group.     

不确定环境下基于时间、费用及鲁棒性权衡的多目标项目调度优化

项目调度中的时间和费用是两个重要的指标,而在不确定环境下进度计划的鲁棒性则是保证项目平稳实施的关键。本文研究不确定环境下的多目标项目调度优化问题,以优化项目的工期、鲁棒值和成本为目标安排各活动的开始时间。基于此,作者构建多目标项目调度优化模型,将模型分解为三个子模型分析目标间的权衡关系,然后设计非劣排序遗传算法进行求解,应用精英保留策略和基于子模型权衡关系的优化策略优化算法,进行算法测试和算例参数敏感性分析。最后,应用上述方法研究一个项目实例,计算得到非劣解集,实例的敏感性分析结果进一步验证了三个目标间的权衡关系,据此提出资源的有效利用策略。本文的研究可以为多目标项目调度制定进度计划提供定量化决策支持。     

基于实际路网情境的配送车辆调度优化

在实际路网情境下结合车道数、车道宽度、路口信号灯设置等路网物理特性,构建了考虑综合交通阻抗的多车型车辆调度模型,提出了两阶段求解策略:第1阶段设计了改进A-star精确解算法用于计算客户时间距离矩阵;第2阶段针对实际路网的特征设计了混合模拟退火算法求解调度方案。以大连市某配送中心运营实例进行路网情境仿真试验,结果表明:改进A-star算法较改进Dijkstra算法具有更短的路径搜索时间;混合模拟退火算法求解结果较实际调度方案优化了13.1% 的综合成本;路网增流、区域拥堵和路段禁行三类路网情境均能对配送方案的车辆配置、路径选择、客户服务次序、作业时间和违约费用等5方面内容产生干扰,调度计划的制定需要详细考虑这些因素的变化。     

具有学习和退化效应的单机干扰管理问题

针对工件同时具有学习和退化效应、机器具有可用性限制这一问题,建立可预见性单机干扰管理模型。在这一模型中,工件的加工时间是既与工件所排的加工位置又与工件开始加工的时间有关的函数。同时,在生产过程中由于机器发生故障或定期维修等扰动事件导致机器在某段时间内不能加工工件。目标是在同时考虑原目标函数和由扰动造成的偏离函数的情况下,构建一个新的最优时间表序列。根据干扰度量函数的不同研究了两个问题,第一个问题的目标函数是极小化总完工时间与总误工时间的加权和;第二个问题的目标函数是极小化总完工时间与总提前时间的加权和。对于所研究的问题,首先证明了最优排序具有的性质,然后建立了相应的拟多项式时间动态规划算法。     

云制造平台加工能力分享调度优化研究

云制造平台加工能力分享的调度优化是云制造模式的核心运营问题。为提高云制造平台对参与能力分享企业资源的利用率,解决实际云制造需求环境下企业级制造资源调度问题,达到云制造平台动态实时的要求,以最小化工期和成本为目标函数,构建了基于平台并面向分享的云加工能力调度模型。为快速求解多个云任务订单的最优调度序列,引入任务简易编码和随机权重,设计了改进的二阶粒子群算法,并提出可分享加工能力时间窗的更新策略。最后,通过算例验证云制造平台加工能力调度机制的可行性和有效性。