Search

Biomarkers plays an important role in the prediction and diagnosis of cancers. Therefore, it is urgent to design effective methods to extract biomarkers. The corresponding pathway information of the microarray gene expression data can be obtained from public database, which makes possible to identify biomarkers based on pathway information and has been attracted extensive attention. In the most existing methods, all the member genes in the same pathway are regarded as equally important for inferring pathway activity. However, the contribution of each gene should be different in the process of inferring pathway activity. In this research, an improved multi-objective particle swarm optimization algorithm with penalty boundary intersection decomposition mechanism (IMOPSO-PBI) has been proposed to quantify the relevance of each gene in pathway activity inference. In the proposed algorithm, two optimization objectives namely t-score and z-score respectively has been introduced. In addition, in order to solve the problem that optimal set with poor diversity in the most multi-objective optimization algorithms, an adaptive mechanism for adjusting penalty parameters based on PBI decomposition has been introduced. The performance of the proposed IMOPSO-PBI approach compared with some existing methods on six gene expression datasets has been given. To verify the effectiveness of the proposed IMOPSO-PBI algorithm, experiments were carried out on six gene datasets and the results has been compared with the existing methods. The comparative experiment results show that the proposed IMOPSO-PBI method has a higher classification accuracy and the extracted feature genes are verified possess biological significance.

Document scanning often suffers from skewing, which may seriously influence the efficiency of Optical Character Recognition (OCR). Therefore, it is necessary to correct the skewed document before document image information analysis. In this article, we propose a novel adaptive deskewing algorithm for document images, which mainly includes Skeleton Line Detection (SKLD), Piecewise Projection Profile (PPP), Morphological Clustering (MC), and the image classification method. The image type is determined firstly based on the image's layout feature. Thus, adaptive correcting is applied to deskew the image according to its type. Our method maintains high accuracy on the Document Image Skew Estimation Contest (DISEC'2013) and PubLayNet datasets, which achieved 97.6% and 80.1% accuracy, respectively. Meanwhile, extensive experiments show the superiority of the proposed algorithm.

As a significant branch of production scheduling problem, the Flexibility Job Shop Scheduling Problem (FJSP) is a typical NP-hard problem. Most conventional flexible workshop scheduling primarily focuses on performance aspects involving production efficiency such as time and quality. In recent years, due to increased energy costs and environmental pollution, 'low-carbon scheduling' has garnered attention as a new scheduling paradigm among scholars and engineers. This paper investigates a low-carbon flexible Job shop scheduling problem, proposing a Grey Wolf Optimization algorithm (SC-GWO), aiming to minimize the sum of carbon emission costs and makespan costs. This algorithm employs the Grey Wolf Algorithm (GWO) as the fundamental optimization method, adaptively choosing between global and local searches based on the dispersion degree of individuals. Firstly, integrating the Sine Cosine Algorithm (SCA), the sinusoidal cosine search mechanism is applied to GWO to enhance its local search capability. Secondly, a new leader selection mechanism is introduced to prevent leaders from falling into local optima, thus improving the algorithm's global exploration capability. Utilizing a nonlinear convergence factor strategy controls the global exploration and local exploitation capabilities in different algorithm stages, enhancing optimization accuracy and accelerating convergence, achieving a dynamic balance between the two. Finally, validation of the SC-GWO algorithm's ability to solve low-carbon scheduling problems in flexible job shop scheduling instances is conducted. Experimental results demonstrate the superior performance of SC-GWO in solving low-carbon flexible workshop scheduling instances. Comparative experiments against four other advanced algorithms on 22 classic benchmark test functions confirm SC-GWO's better convergence. Through standard test functions like Bandimarte instances applied to solve FJSP, experimental results showcase the excellent optimization performance of SC-GWO. Compared to HGWO and GWO, the makespan time is reduced by 22.25% and 39.27%, respectively. The proposed SC-GWO algorithm demonstrates favorable solving effects on flexible job shop scheduling instances, meeting actual production scheduling needs. [ABSTRACT FROM AUTHOR]

In this work, we proposed a new trust region method for solving large-scale unconstrained optimization problems. The trust region subproblem with a simple form was constructed based on new weak secant equations, which utilized both gradient and function values and available information from the three most recent points. A modified Metropolis criterion was used to determine whether to accept the trial step, and an adaptive strategy was used to update the trust region radius. The global convergence and locally superlinearly convergence of the new algorithm were established under appropriate conditions. Numerical experiments showed that the proposed algorithm was effective. [ABSTRACT FROM AUTHOR]

This paper proposes the Lock-Position-Based RFID Adaptive Parallel Collision Tree (LAPCT) algorithm to address the issues of excessive time slots required in the identification process of collision tree algorithms for multiple tags and the high communication complexity between the reader and multiple tags. The LAPCT algorithm adopts a single-query multiple-response mechanism and dynamically divides the response sub-cycle numbers in the identification cycle based on an adaptive strategy. It uses Manchester encoding to lock collision positions and generate a common query prefix, effectively reducing the number of reader queries. This reduction in queries decreases the total number of required time slots and transmitted bits during the reader–tag communication process, thereby improving the efficiency of multiple tag recognition. Theoretical and simulation experiments demonstrate that compared to similar algorithms, the LAPCT algorithm achieves a maximum reduction of 37% in total time slots required, a maximum improvement of 30% in recognition efficiency, and a maximum reduction of 90% in communication complexity. Furthermore, with an increase in the number of tags, the performance advantages of the LAPCT algorithm become more pronounced, making it suitable for large-scale tag scenarios. [ABSTRACT FROM AUTHOR]

Aiming at the shortcomings of the basic Gravity search algorithm（GSA）, such as prone to premature maturity, easy to fall into local optimum, and lack an effective acceleration mechanism, this paper proposed a GSA（IABHGSA） based on the improved adaptive black hole mechanism. The algorithm used the improved Tent mapping to initialize the population, which makes the distribution of the initial population more random, uniform and traversal, and it enhanced the global exploration capability of the algorithm; The algorithm introduced an improved adaptive black hole mechanism and selected the position update strategy, according to the evolution of the particles, which makes the position update more reasonable, Effectively reduce the possibility of particles falling into local optima; Through the optimal and worst particle update strategy based on learning ideas, enhanced the algorithm’s ability to escape from local optima and improved the algorithm’s optimization speed; The algorithm introduced group migration to provide effective accelerated convergence mechanism for the algorithm. Finally, this paper selected 8 benchmark functions to test IABHGSA and compared with the experimental results of related algorithms, the results show that IABHGSA has better optimization performance. [ABSTRACT FROM AUTHOR]

Aiming at the problem that the original monarch butterfly optimization algorithm is easy to fall into the local optimal solution and has poor convergence, an adaptive monarch butterfly optimization algorithm based on mutation reverse learning is proposed. Firstly, the mutation idea of genetic algorithm is combined with the reverse learning strategy to replace the original transfer operator to improve the global convergence. Then, an adaptive strategy is integrated into the adjustment operator of the original monarch butterfly optimization algorithm to make the population more diverse. Finally, Cauchy mutation will be carried out among the last five monarch butterflies in the updated population, which will generate greater disturbance near the mutated individuals and make the whole population search for optimization in a larger range. In order to verify the improved monarch butterfly optimization algorithm, benchmark function and Wilcoxon rank sum test are used to test it. The experimental results show that the convergence speed and optimization accuracy of the improved algorithm are greatly improved. [ABSTRACT FROM AUTHOR]

Multi-objective particle swarm optimization algorithms encounter significant challenges when tackling many-objective optimization problems. This is mainly because of the imbalance between convergence and diversity that occurs when increasing the selection pressure. In this paper, a novel adaptive MOPSO (ANMPSO) algorithm based on R2 contribution and adaptive method is developed to improve the performance of MOPSO. First, a new global best solutions selection mechanism with R2 contribution is introduced to select leaders with better diversity and convergence. Second, to obtain a uniform distribution of particles, an adaptive method is used to guide the flight of particles. Third, a re-initialization strategy is proposed to prevent particles from trapping into local optima. Empirical studies on a large number (64 in total) of problem instances have demonstrated that ANMPSO performs well in terms of inverted generational distance and hyper-volume metrics. Experimental studies on the practical application have also revealed that ANMPSO could effectively solve problems in the real world. [ABSTRACT FROM AUTHOR]

In the arc welding process, a reasonable welding path can improve welding efficiency and quality, especially when a large number of welding seams exist. Hence, this article introduces an intelligent path optimization strategy to optimize the sequence of welding seams. The shortest path length, power consumption, and welding deformation are considered optimization objectives, and welding deformation is studied based on the proxy model to improve optimization efficiency. Then, the improved discrete multiobjective decomposition algorithm based on event-triggering strategy (DMOEA/D-ET) is proposed. Here, the grid method and decomposition multiobjective algorithm (MOEA/D) are used to improve search performance. The adaptive neighborhood strategy is used to improve the quality and distribution of noninferior solutions. After the comparison with NSGA-II, NSGA-III, and CGMOPSO algorithms, the DMOEA/D-ET algorithm shows better performance on both convergence and diversity. Finally, the proposed strategy is used for welding robot path planning, and the simulation results show its effectiveness. [ABSTRACT FROM AUTHOR]

The beetle antennae search (BAS) algorithm is a new meta-heuristic algorithm which has been shown to be very useful in many applications. However, the algorithm itself still has some problems, such as low precision and easy to fall into local optimum when solving complex problems, and excessive dependence on parameter settings. In this paper, an algorithm called beetle antennae search algorithm based on Lévy flights and adaptive strategy (LABAS) is proposed to solve these problems. The algorithm turns the beetle into a population and updates the population with elite individuals' information to improve the convergence rate and stability. At the same time, Lévy flights and scaling factor are introduced to enhance the algorithm's exploration ability. After that, the adaptive step size strategy is used to solve the problem of difficult parameter setting. Finally, the generalized opposition-based learning is applied to the initial population and elite individuals, which makes the algorithm achieve a certain balance between global exploration and local exploitation. The LABAS algorithm is compared with 6 other heuristic algorithms on 10 benchmark functions. And the simulation results show that the LABAS algorithm is superior to the other six algorithms in terms of solution accuracy, convergence rate and robustness. [ABSTRACT FROM AUTHOR]

Satellite range scheduling always plays a crucial role in tracking, telemetry, and control of the spacecraft. With the significant increase in the number and type of satellites in orbit, the demands of users for satellite range scheduling are becoming more and more diverse. However, existing studies for the satellite range scheduling problem (SRSP) rarely consider multiple optimization objectives, which is quite significant in practice. Hence, this paper investigates a multi-objective satellite range scheduling problem (MO-SRSP) that optimizes three objectives simultaneously: the overall profits of tasks, load-balance of antennas, and completion timeliness of tasks. To address MO-SRSP, this paper establishes a mathematical model on the basis of analysis of MO-SRSP and proposes a multi-objective evolutionary algorithm, which is called multi-objective differential evolution algorithm based on space division and adaptive selection strategy (MODE-SDAS). The space division strategy will uniformly divide the objective space into a set of subspaces and preserve a set of non-dominated solutions in each subspace during the environmental selection even if some of these solutions are dominated by other solutions in other subspaces, so as to maintain the diversity of the algorithm. The adaptive selection strategy will adaptively allocate computational resources to different subspaces to improve the convergence of the population. Besides, problem-specific designs such as coding and encoding methods, the discrete differential evolution operator, as well as objective-specific individual variation operators are incorporated into the algorithm to enhance the search capability. Finally, extensive experiments based on simulation test cases are carried out to verify the effectiveness and efficiency of MODE-SDAS. The comparison results show that MODE-SDAS significantly outperforms its competitors in terms of three metrics. Meanwhile, knee point analysis, sensitivity analysis, and application insights are presented. • A tri-objective satellite range scheduling problem. • A multi-objective differential evolution algorithm is proposed. • Space division and adaptive selection strategies are combined. • Problem-specific and objective-specific designs are applied. [ABSTRACT FROM AUTHOR]

In this paper, an explicit analytical method called the variational iteration method is presented for solving the second-order singular initial value problems of the Lane–Emden type. In addition, the local convergence of the method is discussed. It is often useful to have an approximate analytical solution to describe the Lane–Emden type equations, especially in the case that the closed-form solutions do not exist at all. This convince us that an effective improvement of the method will be useful to obtain a better approximate analytical solution. The improved method is then treated as a local algorithm in a sequence of intervals. Besides, an adaptive version is suggested for finding accurate approximate solutions of the nonlinear Lane–Emden type equations. Some examples are given to demonstrate the efficiency and accuracy of the proposed method. [ABSTRACT FROM AUTHOR]

The failure probability function (FPF) expresses the probability of failure as a function of the distribution parameters associated with the random variables of a reliability problem. Knowledge on this FPF is of much relevance for reliability sensitivity analysis and reliability-based design optimisation. However, its calculation is usually a challenging task. Therefore, this paper presents an efficient approach for estimating the FPF based on an adaptive strategy and a combination algorithm. The proposed approach involves three basic elements: (1) a Weighted Importance Sampling approach, which allows determining local FPF estimates; (2) an adaptive strategy for determining at which realisations of the distribution parameters it is necessary to perform local FPF estimation; and (3) an optimal combination algorithm, which allows to aggregate local FPF estimations together to form a global estimate of the FPF. Test and practical examples are presented to demonstrate the efficiency and feasibility of the proposed approach. • A global approach for failure probability function estimation is proposed. • It utilises weighted importance sampling to efficiently obtain local estimators. • It includes an adaptive active strategy to guide the local estimations. • It adopts an optimal combination algorithm to combine the local FPF estimators. [ABSTRACT FROM AUTHOR]

This paper studies the distributed average computation problem for multiple time-varying signals with bounded inputs. Based only on relative output measurements, a pair of continuous algorithms with, respectively, static and adaptive coupling strengths are designed and utilized. From the concept of boundary layer approach, the proposed continuous algorithm with static coupling strengths can asymptotically obtain the average value of the multiple reference signals without chattering phenomenon. Furthermore, for the case of algorithms with adaptive coupling strengths, the calculation errors are uniformly ultimately bounded and exponentially converge to a small adjustable bounded set. Finally, a simulation example is presented to show the validity of the theoretical results. Copyright © 2015 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

State transition algorithm (STA) is an efficient and powerful metaheuristic method for solving global optimization problems, and it has been successfully applied in many engineering fields in the past few years. However, the basic STA has weak local search capability and shows slow convergence rate and low convergence accuracy in the later search stage. In view of the above shortcomings, an adaptive state transition algorithm (ASTA) with local enhancement is proposed in this paper. Firstly, the order of using state transformation operators and the optimal parameters of the operators are considered in each iteration of ASTA, and a statistical method is employed to adaptively select the optimal transformation operator and the parameter values of the optimal operator to speed up the search process. Then, an adaptive call strategy is adopted to determine its convergence to the neighborhood of the optimal solution and to decide whether to perform the quasi-Newton operator for local enhancement. Finally, the degree to which the current solution is close to the optimal solution is judged by the information of historical solutions, and an analytical solution is quickly obtained by calling the quadratic interpolation operator. The effectiveness of the proposed ASTA is checked, through a comparison with other metaheuristic methods, on 15 benchmark functions and several real-world optimization problems. Experimental results show that ASTA has a stronger search capability than the basic STA, STA variants, and some state-of-the-art metaheuristic methods. • An adaptive state transition algorithm is proposed. • Local enhancement techniques are employed to speed up the search efficiency. • The proposed algorithm is verified on some practical engineering problems. [ABSTRACT FROM AUTHOR]

This paper describes a dynamic group-based differential evolution (GDE) algorithm for global optimization problems. The GDE algorithm provides a generalized evolution process based on two mutation operations to enhance search capability. Initially, all individuals in the population are grouped into a superior group and an inferior group based on their fitness values. The two groups perform different mutation operations. The local mutation model is applied to individuals with better fitness values, i.e., in the superior group, to search for better solutions near the current best position. The global mutation model is applied to the inferior group, which is composed of individuals with lower fitness values, to search for potential solutions. Subsequently, the GDE algorithm employs crossover and selection operations to produce offspring for the next generation. In this paper, an adaptive tuning strategy based on the well-known 1/5th rule is used to dynamically reassign the group size. It is thus helpful to trade off between the exploration ability and the exploitation ability. To validate the performance of the GDE algorithm, 13 numerical benchmark functions are tested. The simulation results indicate that the approach is effective and efficient. [ABSTRACT FROM AUTHOR]

Abstract: DNA microarray technology has emerged as a boon to the scientific community in understanding the growth and development of life as well as in widening their knowledge in exploring the genetic causes of anomalies occurring in the working of the human body. Microarray technology makes biologists be capable of monitoring expression of thousands of genes in a single experiment on a small chip. Extracting useful knowledge and information from these microarrays has attracted the attention of many biologists and computer scientists. Outlier is defined as an observation that deviates too much from other observations. The identification of outliers can lead to the discovery of useful and meaningful knowledge. In this paper we propose hybrid approach for outlier detection by studying the behavior of projections from the data set. We first identify patterns with abnormally low presence. Once such patterns have been identified, then the outliers are defined as those records which have such patterns present in them. We have compared time and quality aspects of our results and it is found to be better than both brute force and evolutionary algorithms. For the same data set, brute force algorithm takes more time with good quality results as compared to evolutionary algorithm, where as Evolutionary Algorithm takes less time with less quality compared to brute force algorithm. [Copyright &y& Elsevier]

Abstract: In this paper, an adaptive trust region filter algorithm for unconstrained optimization is presented. The global convergence results of the algorithm are established and the numerical results show that the new algorithm is efficient in practical computation. [Copyright &y& Elsevier]

Abstract: In this paper, optimal control theory is used to minimize the total mean drag for a circular cylinder wake flow in the laminar regime (). The control parameters are the amplitude and the frequency of the time-harmonic cylinder rotation. In order to reduce the size of the discretized optimality system, a proper orthogonal decomposition (POD) reduced-order model (ROM) is derived to be used as state equation. We then propose to employ the trust-region proper orthogonal decomposition (TRPOD) approach, originally introduced by Fahl [M. Fahl, Trust-region methods for flow control based on reduced order modeling, Ph.D. Thesis, Trier University, 2000], to update the reduced-order models during the optimization process. A lot of computational work is saved because the optimization process is now based only on low-fidelity models. A particular care was taken to derive a POD ROM for the pressure and velocity fields with an appropriate balance between model accuracy and robustness. The key enablers are the extension of the POD basis functions to the pressure data, the use of calibration methods for the POD ROM and the addition in the POD expansion of several non-equilibrium modes to describe various operating conditions. When the TRPOD algorithm is applied to the wake flow configuration, this approach converges to the minimum predicted by an open-loop control approach and leads to a relative mean drag reduction of 30% at reduced cost. [Copyright &y& Elsevier]

We consider liar games in which player Paul must ask one full batch of questions, receive all answers, and then ask a second and final batch of questions. We show that the effect of this restriction is asymptotically negligible. The strategy for Paul is given explicitly. [ABSTRACT FROM AUTHOR]

Abstract: Model reduction methods are usually based on preliminary computations to build the shape function of the reduced order model (ROM) before the computation of the reduced state variables. They are a posteriori approaches. Most of the time these preliminary computations are as complex as the simulation which we want to simplify by the ROM. The reduction method we propose avoids such preliminary computations. It is an a priori approach based on the analysis of some state evolutions, such that all the state evolutions needed to perform the model reduction are described by an approximate ROM. The ROM and the state evolution are simultaneously improved by the method, thanks to an adaptive strategy. Obviously, an initial set of known shape functions can be used to define the ROM to adapt. But it is not necessary. The adaptive procedure includes extensions of the subspace spanned by the shape functions of the ROM and selections of the most relevant shape functions in order to represent the state evolution. The hyperreduction is achieved by selecting a part of the integration points of the finite element model to forecast the evolution of the reduced state variables. Hence both the number of degrees of freedom and the number of integration points are reduced. To perform the adaptive procedure, different computational strategies can be developed. In this paper, we propose an incremental algorithm involving adaptive periods. During these adaptive periods the incremental computation is restarted until a quality criterion is satisfied. This approach is compatible with classical formulations of the equations. [Copyright &y& Elsevier]

This work focuses on the implementation of innovative adaptive strategies and a closed-loop chain in a piston-damage-based combustion controller. In the previous paper (Part 1), implemented models and the open loop algorithm are described and validated by reproducing some vehicle maneuvers at the engine test cell. Such controller is further improved by implementing self-learning algorithms based on the analytical formulations of knock and the combustion model, to update the fuel Research Octane Number (RON) and the relationship between the combustion phase and the spark timing in real-time. These strategies are based on the availability of an on-board indicating system for the estimation of both the knock intensity and the combustion phase index. The equations used to develop the adaptive strategies are described in detail. A closed-loop chain is then added, and the complete controller is finally implemented in a Rapid Control Prototyping (RCP) device. The controller is validated with specific tests defined to verify the robustness and the accuracy of the adaptive strategies. Results of the online validation process are presented in the last part of the paper and the accuracy of the complete controller is finally demonstrated. Indeed, error between the cyclic and the target combustion phase index is within the range ±0.5 Crank Angle degrees (°CA), while the error between the measured and the calculated maximum in-cylinder pressure is included in the range ±5 bar, even when fuel RON or spark advance map is changing. [ABSTRACT FROM AUTHOR]

A lower bound (LB) axisymmetric limit analysis formulation is presented for Mohr-Coulomb materials using finite elements and semidefinite programming (SDP). The details of the application of SDP to the axisymmetric LB finite element method for Mohr-Coulomb materials are described in this paper. Through the use of the SDP, the axisymmetric Mohr-Coulomb yield criterion can be directly applied in its native form in terms of principal stresses without any smoothing of the parent yield surface, and no assumption needs to be made about σ θ. A node-stress-based adaptive mesh algorithm is also introduced into the proposed method to obtain an accurate high-accuracy LB solution. The proposed method is then applied to estimate the collapse load of circular footings and the stability of an unlined vertical circular excavation. The results are also compared with those reported in the literature; the results obtained from the proposed method are accurate and can provide failure patterns with greater clarity. [ABSTRACT FROM AUTHOR]

Artificial bee colony (ABC) algorithm is an efficient bio-inspired optimizer proposed recently. Though it has gained great popularity, ABC suffers from its slow convergence and poor generalization on various problem landscapes. To address the issues, an augmented ABC with adaptive heterogeneous competition (ABC-AHC) is proposed in this study. In ABC-AHC, two bee swarms with each conducting heterogeneous but complementary capabilities are implemented to improve the search capabilities on various problem spaces. To dynamically adjust the search behaviors, an adaptive mechanism is developed to trigger the competition and migration between the bee swarms. Comparative studies are conducted for parameter tuning and the heterogeneous searching (HST). Existing algorithms including ABC variants and non-ABC variants are adopted to validate the performance of ABC-AHC. Numerical comparisons are conducted on 30D and 100D benchmark functions, CEC 2014 test function, random function and the real-world problems. Numerical results demonstrate that the proposed strategies significantly enhance ABC's search capability and convergence speed on the various benchmark functions. • We proposed an efficient ABC optimizer that performs well on a diverse set of global optimization problems. • Two swarms with each conducting heterogeneous but complementary behaviors are implemented. • An adaptive mechanism is developed to dynamically balance the exploration and exploitation. • Adaptive mechanism is triggered by individuals' competition and migration between the swarms. [ABSTRACT FROM AUTHOR]