Evolutionary state-based novel multi-objective periodic bacterial foraging optimization algorithm for data clustering

Clustering divides objects into groups based on similarity. However, traditional clustering approaches are plagued by their difficulty in dealing with data with complex structure and high dimensionality, as well as their inability in solving multi-objective data clustering problems. To address these issues, an evolutionary state-based novel multi-objective periodic bacterial foraging optimization algorithm (ES-NMPBFO) is proposed in this article. The algorithm is designed to alleviate the high-computing complexity of the standard bacterial foraging optimization (BFO) algorithm by introducing periodic BFO. Moreover, two learning strategies, global best individual (gbest) and personal historical best individual (pbest), are used in the chemotaxis operation to enhance the convergence speed and guide the bacteria to the optimum position. Two elimination-dispersal operations are also proposed to prevent falling into local optima and improve the diversity of solutions. The proposed algorithm is compared with five other algorithms on six validity indexes in two data clustering cases comprising nine general benchmark datasets and four credit risk assessment datasets. The experimental results suggest that the proposed algorithm significantly outperforms the competing approaches. To further examine the effectiveness of the proposed strategies, two variants of ES-NMPBFO were designed, and all three forms of ES-NMPBFO were tested. The experimental results show that all of the proposed strategies are conducive to the improvement of solution quality, diversity and convergence.     

Optimal imperfect preventive maintenance policy for equipment leased during successive periods

In this paper, we consider randomly failing equipment leased several times during their life cycle with a given warranty period. A mathematical model is developed to determine the optimal efficiency levels of preventive maintenance (PM) to be performed on the equipment between successive lease periods, maximising the expected total profit of the lessor over the equipment life cycle. The model considers the expected leasing revenue as well as the equipment acquisition cost and the average PM and repair costs. PM actions allow reducing the age of the equipment to a certain extent with a corresponding cost depending on the PM level adopted. The efficiency of the PM is determinant of the expected revenue during the next lease period. Given a set of K possible PM levels and the number of lease periods n over the equipment life cycle, K^{n?1 PM} strategies are possible. A genetic algorithm is proposed in order to obtain nearly optimal policies in situations where the number of possibilities K^n?1 is very high. Obtained numerical results are discussed. Small- and big-size instances of the problem are considered in the case of a service company in the oil and gas industry specialised in leasing specific equipment such as separators, to oil companies for production activities with a limited duration of several months like well testing or short production tests.     

Modulating the Surface State of SiC to Control Carrier Transport in Graphene/SiC

Silicon carbide (SiC) with epitaxial graphene (EG/SiC) shows a great potential in the applications of electronic and photoelectric devices. The performance of devices is primarily dependent on the interfacial heterojunction between graphene and SiC. Here, the band structure of the EG/SiC heterojunction is experimentally investigated by Kelvin probe force microscopy. The dependence of the barrier height at the EG/SiC heterojunction to the initial surface state of SiC is revealed. Both the barrier height and band bending tendency of the heterojunction can be modulated by controlling the surface state of SiC, leading to the tuned carrier transport behavior at the EG/SiC interface. The barrier height at the EG/SiC(000‐1) interface is almost ten times that of the EG/SiC(0001) interface. As a result, the amount of carrier transport at the EG/SiC(000‐1) interface is about ten times that of the EG/SiC(0001) interface. These results offer insights into the carrier transport behavior at the EG/SiC heterojunction by controlling the initial surface state of SiC, and this strategy can be extended in all devices with graphene as the top layer.     

Fractional Order Nonlinear Bone Remodeling Dynamics Using the Supervised Neural Network

This study aims to solve the nonlinear fractional-order mathematical model (FOMM) by using the normal and dysregulated bone remodeling of the myeloma bone disease (MBD). For the more precise performance of the model, fractional-order derivatives have been used to solve the disease model numerically. The FOMM is preliminarily designed to focus on the critical interactions between bone resorption or osteoclasts (OC) and bone formation or osteoblasts (OB). The connections of OC and OB are represented by a nonlinear differential system based on the cellular components, which depict stable fluctuation in the usual bone case and unstable fluctuation through the MBD. Untreated myeloma causes by increasing the OC and reducing the osteoblasts, resulting in net bone waste the tumor growth. The solutions of the FOMM will be provided by using the stochastic framework based on the Levenberg-Marquardt backpropagation (LVMBP) neural networks (NN), i.e., LVMBPNN. The mathematical performances of three variations of the fractional-order derivative based on the nonlinear disease model using the LVMPNN. The static structural performances are 82% for investigation and 9% for both learning and certification. The performances of the LVMBPNN are authenticated by using the results of the Adams-Bashforth-Moulton mechanism. To accomplish the capability, steadiness, accuracy, and ability of the LVMBPNN, the performances of the error histograms (EHs), mean square error (MSE), recurrence, and state transitions (STs) will be provided.     

Discrimination between accelerated life models via Approximate Bayesian Computation

Accelerated life testing (ALT) is widely used in high-reliability product estimation to get relevant information about an item's performance and its failure mechanisms. To analyse the observed ALT data, reliability practitioners need to select a suitable accelerated life model based on the nature of the stress and the physics involved. A statistical model consists of (i) a lifetime distribution that represents the scatter in product life and (ii) a relationship between life and stress. In practice, several accelerated life models could be used for the same failure mode and the choice of the best model is far from trivial. For this reason, an efficient selection procedure to discriminate between a set of competing accelerated life models is of great importance for practitioners. In this paper, accelerated life model selection is approached by using the Approximate Bayesian Computation (ABC) method and a likelihood-based approach for comparison purposes. To demonstrate the efficiency of the ABC method in calibrating and selecting accelerated life model, an extensive Monte Carlo simulation study is carried out using different distances to measure the discrepancy between the empirical and simulated times of failure data. Then, the ABC algorithm is applied to real accelerated fatigue life data in order to select the most likely model among five plausible models. It has been demonstrated that the ABC method outperforms the likelihood-based approach in terms of reliability predictions mainly at lower percentiles particularly useful in reliability engineering and risk assessment applications. Moreover, it has shown that ABC could mitigate the effects of model misspecification through an appropriate choice of the distance function.     

小卫星测试系统设计与实现

针对某小卫星研制过程中的电测需求,设计并开发了一种小卫星测试系统;系统模仿通用仪器结构设计了分布式的功能板卡作为独立测试功能单元,并在机箱中采用开放式总线底板,最大限度地提高系统适应性,发挥系统效率;为保证系统控制与数据传输的实时性,使用装载VxWorks操作系统的嵌入式计算机作为主控制器,使用LVDS高速接口作为系统内部数据传输通道,传输速率为10 Mbit/s,本系统可以完成小卫星电信号的并行测试,满足测试要求.     

A dynamic video watermarking algorithm in fast motion areas in the wavelet domain

In this paper, we propose a video watermarking algorithm which embeds different parts of a single watermark into different shots of a video under the wavelet domain. Based on a Motion Activity Analysis, different regions of the original video are separated into perceptually distinct categories according to motion information and region complexity. Thus, the localizations of the watermark are adjusted adaptively in accordance with the human visual system and signal characteristics, which makes them perceptually invisible and less vulnerable to automated removal. In addition, contrary to traditional methods where the watermark remains at a fixed position on the screen, the watermark moves along with moving objects and thus motion artefacts can be avoid. The multi-frame based extraction strategy ensures that the watermark can be correctly recovered from a very short segment of video. Individual frames extracted from the video also contain watermark information. Experimental results show that the inserted watermark is not only less perceptible but also robust against common video processing attacks.     

Absolute Stability of Nonlinear Systems with Two Additive Time-varying Delay Components

In this paper, we present a new sufficient condition for absolute stability of Lure system with two additive time-varying delay components. This criterion is expressed as a set of linear matrix inequalities (LMIs), which can be readily tested by using standard numerical software. We use this new criterion to stabilize a class of nonlinear time-delay systems. Some numerical examples are given to illustrate the applicability of the results using standard numerical software.     

统一潮流控制器逆系统方法控制策略

统一潮流控制器在同步旋转dq坐标系下的数学模型, 反映出统一潮流控制器是一个强耦合的、非线性的系统. 为解决对这个强耦合、非线性系统直接设计控制器的困难, 采用逆系统方法, 将原系统线性化且解耦, 构造出一个伪线性系统. 然后, 运用变结构控制, 针对构造出的这个伪线性系统, 设计该系统的控制策略以实现对统一潮流控制器综合控制. 最后, 通过建立仿真试验模型进行仿真, 仿真的结果验证了文中提出的这种控制策略的可行性和有效性.     

Discrepancy search for the flexible job shop scheduling problem

The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop problem in which each operation must be processed on a given machine chosen among a finite subset of candidate machines. The aim is to find an allocation for each operation and to define the sequence of operations on each machine, so that the resulting schedule has a minimal completion time. We propose a variant of the climbing discrepancy search approach for solving this problem. We also present various neighborhood structures related to assignment and sequencing problems. We report the results of extensive computational experiments carried out on well-known benchmarks for flexible job shop scheduling. The results demonstrate that the proposed approach outperforms the best-known algorithms for the FJSP on some types of benchmarks and remains comparable with them on other ones.