A New Color Image Encryption Scheme Using CML and a Fractional-Order Chaotic System

The chaos-based image cryptosystems have been widely investigated in recent years to provide real-time encryption and transmission. In this paper, a novel color image encryption algorithm by using coupled-map lattices (CML) and a fractional-order chaotic system is proposed to enhance the security and robustness of the encryption algorithms with a permutation-diffusion structure. To make the encryption procedure more confusing and complex, an image division-shuffling process is put forward, where the plain-image is first divided into four sub-images, and then the position of the pixels in the whole image is shuffled. In order to generate initial conditions and parameters of two chaotic systems, a 280-bit long external secret key is employed. The key space analysis, various statistical analysis, information entropy analysis, differential analysis and key sensitivity analysis are introduced to test the security of the new image encryption algorithm. The cryptosystem speed is analyzed and tested as well. Experimental results confirm that, in comparison to other image encryption schemes, the new algorithm has higher security and is fast for practical image encryption. Moreover, an extensive tolerance analysis of some common image processing operations such as noise adding, cropping, JPEG compression, rotation, brightening and darkening, has been performed on the proposed image encryption technique. Corresponding results reveal that the proposed image encryption method has good robustness against some image processing operations and geometric attacks.     

Parallel computation of a maximum-likelihood estimator of a physical map

Reconstructing a physical map of a chromosome from a genomic library presents a central computational problem in genetics. Physical map reconstruction in the presence of errors is a problem of high computational complexity that provides the motivation for parallel computing. Parallelization strategies for a maximum-likelihood estimation-based approach to physical map reconstruction are presented. The estimation procedure entails a gradient descent search for determining the optimal spacings between probes for a given probe ordering. The optimal probe ordering is determined using a stochastic optimization algorithm such as simulated annealing or microcanonical annealing. A two-level parallelization strategy is proposed wherein the gradient descent search is parallelized at the lower level and the stochastic optimization algorithm is simultaneously parallelized at the higher level. Implementation and experimental results on a distributed-memory multiprocessor cluster running the parallel virtual machine (PVM) environment are presented using simulated and real hybridization data.     

Incorporating fast and intelligent control technique into ecology: A Chebyshev neural network-based terminal sliding mode approach for fractional chaotic ecological systems

In the present study, a new neural network-based terminal sliding mode technique is proposed to stabilize and synchronize fractional-order chaotic ecological systems in finite-time. The Chebyshev neural network is implemented to estimate unknown functions of the system. Moreover, through the proposed Chebyshev neural network observer, the effects of external disturbances are fully taken into account. The weights of the Chebyshev neural network observer are adjusted based on adaptive laws. The finite-time convergence of the closed-loop system, which is a new concept for ecological systems, is proven. Then, the dependency of the system on the value of the fractional time derivatives is investigated. Lastly, the proposed control scheme is applied to the fractional-order ecological system. Through numerical simulations, the performance of the developed technique for synchronization and stabilization are assessed and compared with a conventional method. The numerical simulations strongly corroborate the effective performance of the proposed control technique in terms of accuracy, robustness, and convergence time for the unknown nonlinear system in the presence of external disturbances.     

An annealed chaotic maximum neural network for bipartite subgraph problem

In this paper, based on maximum neural network, we propose a new parallel algorithm that can help the maximum neural network escape from local minima by including a transient chaotic neurodynamics for bipartite subgraph problem. The goal of the bipartite subgraph problem, which is an NP- complete problem, is to remove the minimum number of edges in a given graph such that the remaining graph is a bipartite graph. Lee et al. presented a parallel algorithm using the maximum neural model (winner-take-all neuron model) for this NP- complete problem. The maximum neural model always guarantees a valid solution and greatly reduces the search space without a burden on the parameter-tuning. However, the model has a tendency to converge to a local minimum easily because it is based on the steepest descent method. By adding a negative self-feedback to the maximum neural network, we proposed a new parallel algorithm that introduces richer and more flexible chaotic dynamics and can prevent the network from getting stuck at local minima. After the chaotic dynamics vanishes, the proposed algorithm is then fundamentally reined by the gradient descent dynamics and usually converges to a stable equilibrium point. The proposed algorithm has the advantages of both the maximum neural network and the chaotic neurodynamics. A large number of instances have been simulated to verify the proposed algorithm. The simulation results show that our algorithm finds the optimum or near-optimum solution for the bipartite subgraph problem superior to that of the best existing parallel algorithms.     

Deterministic global optimization algorithm based on outer approximation for the parameter estima- tion of nonlinear dynamic biological systems

ABSTRACT: BACKGROUND: The estimation of parameter values for mathematical models of biological systems is an optimization problem that is particularly challenging due to the nonlinearities involved. One major difficulty is the existence of multiple minima in which standard optimization methods may fall during the search. Deterministic global optimization methods overcome this limitation, ensuring convergence to the global optimum within a desired tolerance. Global optimization techniques are typically classified into stochastic and deterministic. The former typically lead to lower CPU times but offer no guarantee of convergence to the global minimum in a finite number of iterations. In contrast, deterministic methods provide solutions of a given quality (i.e., optimality gap), but tend to lead to large computational burdens. RESULTS: This work presents a deterministic outer approximation-based algorithm for the global optimization of dynamic problems arising in the parameter estimation of models of biological systems. Our approach, which offers a theoretical guarantee of convergence to the global minimum, reformulating the set of ordinary differential equations into an equivalent set of algebraic equations through the use of orthogonal collocation methods, giving rise to a nonconvex nonlinear programming (NLP) problem. This nonconvex NLP is decomposed into two hierarchical levels: a master mixed-integer linear programming problem (MILP) that provides a rigorous lower bound on the optimal solution, and a reduced-space slave NLP that yields an upper bound. The algorithm iterates between these two levels until a termination criterion is satisfied. CONCLUSION: The capabilities of our approach were tested in two benchmark problems, in which the performance of our algorithm was compared with that of the commercial global optimization package BARON. The proposed strategy produced near optimal solutions (i.e., within a desired tolerance) in a fraction of the CPU time required by BARON.     

Centers and angles of rotation of body joints: A study of errors and optimization

Large variations are generally reported in the locations of centers of rotation (CR) for each of various joints in the human body. Some of these reports present conflicting results. This paper shows that this may be due in part to suboptimal experimental design as well as the phenomenon of error magnification. An algorithm is presented for computing the coordinates of the CR and the angle of rotation from the x, y coordinate measurements of two point markers on a moving body in two different positions. Error analysis is performed using a mathematical model that introduces systematically a positive or a negative error into each of the 8 x, y coordinates in all possible combinations, resulting in 256 CR locations. CR error zones are computed and graphed. Parametric analysis of the experimental set-up leads to optimization of the set-up. A typical case is analyzed and its errors computed. It is shown that small errors present in the measurements of the x, y coordinates of the markers are magnified to relatively large errors in the CR coordinates. In a suboptimal case, this magnification may be 30–50 times or more. The results show that, besides the magnitude of x, y coordinate errors, other factors responsible for determining the magnitude of errors in the location of the CR are: the magnitude of angle of rotation, the orientation of the markers with respect to the CR and their distances from the CR. In conjunction with the CR, the angle of rotation is also analyzed. Guidelines for optimal experimental set-up for minimizing the output errors are presented.     

Dynamic behavior analysis of fractional-order Hindmarsh–Rose neuronal model

Previous experimental work has shown that the firing rate of multiple time-scales of adaptation for single rat neocortical pyramidal neurons is consistent with fractional-order differentiation, and the fractional-order neuronal models depict the firing rate of neurons more verifiably than other models do. For this reason, the dynamic characteristics of the fractional-order Hindmarsh–Rose (HR) neuronal model were here investigated. The results showed several obvious differences in dynamic characteristic between the fractional-order HR neuronal model and an integer-ordered model. First, the fractional-order HR neuronal model displayed different firing modes (chaotic firing and periodic firing) as the fractional order changed when other parameters remained the same as in the integer-order model. However, only one firing mode is displayed in integer-order models with the same parameters. The fractional order is the key to determining the firing mode. Second, the Hopf bifurcation point of this fractional-order model, from the resting state to periodic firing, was found to be larger than that of the integer-order model. Third, for the state of periodically firing of fractional-order and integer-order HR neuron model, the firing frequency of the fractional-order neuronal model was greater than that of the integer-order model, and when the fractional order of the model decreased, the firing frequency increased.     

Parameter Estimation Methods for Chaotic Intercellular Networks

We have investigated simulation-based techniques for parameter estimation in chaotic intercellular networks. The proposed methodology combines a synchronization–based framework for parameter estimation in coupled chaotic systems with some state–of–the–art computational inference methods borrowed from the field of computational statistics. The first method is a stochastic optimization algorithm, known as accelerated random search method, and the other two techniques are based on approximate Bayesian computation. The latter is a general methodology for non–parametric inference that can be applied to practically any system of interest. The first method based on approximate Bayesian computation is a Markov Chain Monte Carlo scheme that generates a series of random parameter realizations for which a low synchronization error is guaranteed. We show that accurate parameter estimates can be obtained by averaging over these realizations. The second ABC–based technique is a Sequential Monte Carlo scheme. The algorithm generates a sequence of “populations”, i.e., sets of randomly generated parameter values, where the members of a certain population attain a synchronization error that is lesser than the error attained by members of the previous population. Again, we show that accurate estimates can be obtained by averaging over the parameter values in the last population of the sequence. We have analysed how effective these methods are from a computational perspective. For the numerical simulations we have considered a network that consists of two modified repressilators with identical parameters, coupled by the fast diffusion of the autoinducer across the cell membranes.     

Belief Propagation Algorithm for Portfolio Optimization Problems

The typical behavior of optimal solutions to portfolio optimization problems with absolute deviation and expected shortfall models using replica analysis was pioneeringly estimated by S. Ciliberti et al. [Eur. Phys. B. 57, 175 (2007)]; however, they have not yet developed an approximate derivation method for finding the optimal portfolio with respect to a given return set. In this study, an approximation algorithm based on belief propagation for the portfolio optimization problem is presented using the Bethe free energy formalism, and the consistency of the numerical experimental results of the proposed algorithm with those of replica analysis is confirmed. Furthermore, the conjecture of H. Konno and H. Yamazaki, that the optimal solutions with the absolute deviation model and with the mean-variance model have the same typical behavior, is verified using replica analysis and the belief propagation algorithm.     

Simulated parallel annealing within a neighborhood for optimization of biomechanical systems

Optimization problems for biomechanical systems have become extremely complex. Simulated annealing (SA) algorithms have performed well in a variety of test problems and biomechanical applications; however, despite advances in computer speed, convergence to optimal solutions for systems of even moderate complexity has remained prohibitive. The objective of this study was to develop a portable parallel version of a SA algorithm for solving optimization problems in biomechanics. The algorithm for simulated parallel annealing within a neighborhood (SPAN) was designed to minimize interprocessor communication time and closely retain the heuristics of the serial SA algorithm. The computational speed of the SPAN algorithm scaled linearly with the number of processors on different computer platforms for a simple quadratic test problem and for a more complex forward dynamic simulation of human pedaling.     

Computer programme for processing data from ecological sucrose-inversion measurements of temperature

A computer programme is proposed for evaluating sucrose-inversion temperature measurements. The exponential and arithmetic mean temperatures as well as sums of temperatures are computed by two alternative procedures. A calculation of the final rotation angle of the inverted sucrose solution is proposed instead of direct estimation.     

一种获得非线性生长函数参数初始值的新方法:杂种遗传算法

本研究旨在杂种遗传算法应用于非线性生长函数的参数估计.提出了杂种遗传算法估计非线性生长函数参数的数学模型.5种非线性生长函数Gompertz、Logistic、von Bertalanffy、Richards、Brody分别拟合一个较大型的、群体类型差异大的番鸭体重生长资料,利用杂种遗传算法获得了有效初始值,在lsqcurvefit与proc nlin中获得了一致最优解的结果.表明杂种遗传算法估计非线性函数参数的实际可行性.     

Composing Problem Solvers for Simulation Experimentation: A Case Study on Steady State Estimation

Simulation experiments involve various sub-tasks, e.g., parameter optimization, simulation execution, or output data analysis. Many algorithms can be applied to such tasks, but their performance depends on the given problem. Steady state estimation in systems biology is a typical example for this: several estimators have been proposed, each with its own (dis-)advantages. Experimenters, therefore, must choose from the available options, even though they may not be aware of the consequences. To support those users, we propose a general scheme to aggregate such algorithms to so-called synthetic problem solvers, which exploit algorithm differences to improve overall performance. Our approach subsumes various aggregation mechanisms, supports automatic configuration from training data (e.g., via ensemble learning or portfolio selection), and extends the plugin system of the open source modeling and simulation framework James II. We show the benefits of our approach by applying it to steady state estimation for cell-biological models.     

An Efficacious Multi-Objective Fuzzy Linear Programming Approach for Optimal Power Flow Considering Distributed Generation

This paper proposes a new formulation for the multi-objective optimal power flow (MOOPF) problem for meshed power networks considering distributed generation. An efficacious multi-objective fuzzy linear programming optimization (MFLP) algorithm is proposed to solve the aforementioned problem with and without considering the distributed generation (DG) effect. A variant combination of objectives is considered for simultaneous optimization, including power loss, voltage stability, and shunt capacitors MVAR reserve. Fuzzy membership functions for these objectives are designed with extreme targets, whereas the inequality constraints are treated as hard constraints. The multi-objective fuzzy optimal power flow (OPF) formulation was converted into a crisp OPF in a successive linear programming (SLP) framework and solved using an efficient interior point method (IPM). To test the efficacy of the proposed approach, simulations are performed on the IEEE 30-busand IEEE 118-bus test systems. The MFLP optimization is solved for several optimization cases. The obtained results are compared with those presented in the literature. A unique solution with a high satisfaction for the assigned targets is gained. Results demonstrate the effectiveness of the proposed MFLP technique in terms of solution optimality and rapid convergence. Moreover, the results indicate that using the optimal DG location with the MFLP algorithm provides the solution with the highest quality.     

Robust and reliable estimation via recursive nonlinear dynamic data reconciliation based on cubature Kalman filter

Since measurements of process variables are subject to measurements errors as well as process variability, data reconciliation is the procedure of optimally adjusting measured date so that the adjusted values obey the conservation laws and constraints. Thus, data reconciliation for dynamic systems is fundamental and important for control, fault detection, and system optimization. Attempts to successfully implement estimators are often hindered by serve process nonlinearities, complicated state constraints, and un-measurable perturbations. As a constrained minimization problem, the dynamic data reconciliation is dynamically carried out to product smoothed estimates with variances from the original data. Many algorithms are proposed to solve such state estimation such as the extended Kalman filter (EKF), the unscented Kalman filter, and the cubature Kalman filter (CKF). In this paper, we investigate the use of CKF algorithm in comparative with the EKF to solve the nonlinear dynamic data reconciliation problem. First we give a broad overview of the recursive nonlinear data dynamic reconciliation (RNDDR) scheme, then present an extension to the CKF algorithm, and finally address the issue of how to solve the constraints in the CKF approach. The CCRNDDR method is proposed by applying the RNDDR in the CKF algorithm to handle nonlinearity and algebraic constraints and bounds. As the sampling idea is incorporated into the RNDDR framework, more accurate estimates can obtained via the recursive nature of the estimation procedure. The performance of the CKF approach is compared with EKF and RNDDR on nonlinear process systems with constraints. The conclusion is that with an error optimization solution of the correction step, the reformulated CKF shows high performance on the selection of nonlinear constrained process systems. Simulation results show the CCRNDDR is an efficient, accurate and stable method for real-time state estimation for nonlinear dynamic processes.     

A New Asynchronous Parallel Algorithm for Inferring Large-Scale Gene Regulatory Networks

The reconstruction of gene regulatory networks (GRNs) from high-throughput experimental data has been considered one of the most important issues in systems biology research. With the development of high-throughput technology and the complexity of biological problems, we need to reconstruct GRNs that contain thousands of genes. However, when many existing algorithms are used to handle these large-scale problems, they will encounter two important issues: low accuracy and high computational cost. To overcome these difficulties, the main goal of this study is to design an effective parallel algorithm to infer large-scale GRNs based on high-performance parallel computing environments. In this study, we proposed a novel asynchronous parallel framework to improve the accuracy and lower the time complexity of large-scale GRN inference by combining splitting technology and ordinary differential equation (ODE)-based optimization. The presented algorithm uses the sparsity and modularity of GRNs to split whole large-scale GRNs into many small-scale modular subnetworks. Through the ODE-based optimization of all subnetworks in parallel and their asynchronous communications, we can easily obtain the parameters of the whole network. To test the performance of the proposed approach, we used well-known benchmark datasets from Dialogue for Reverse Engineering Assessments and Methods challenge (DREAM), experimentally determined GRN of Escherichia coli and one published dataset that contains more than 10 thousand genes to compare the proposed approach with several popular algorithms on the same high-performance computing environments in terms of both accuracy and time complexity. The numerical results demonstrate that our parallel algorithm exhibits obvious superiority in inferring large-scale GRNs.     

The merits of a parallel genetic algorithm in solving hard optimization problems

A parallel genetic algorithm for optimization is outlined, and its performance on both mathematical and biomechanical optimization problems is compared to a sequential quadratic programming algorithm, a downhill simplex algorithm and a simulated annealing algorithm. When high-dimensional non-smooth or discontinuous problems with numerous local optima are considered, only the simulated annealing and the genetic algorithm, which are both characterized by a weak search heuristic, are successful in finding the optimal region in parameter space. The key advantage of the genetic algorithm is that it can easily be parallelized at negligible overhead.     

A flexible annealing chaotic neural network to maximum clique problem

Based on the analysis and comparison of several annealing strategies, we present a flexible annealing chaotic neural network which has flexible controlling ability and quick convergence rate to optimization problem. The proposed network has rich and adjustable chaotic dynamics at the beginning, and then can converge quickly to stable states. We test the network on the maximum clique problem by some graphs of the DIMACS clique instances, p-random and k random graphs. The simulations show that the flexible annealing chaotic neural network can get satisfactory solutions at very little time and few steps. The comparison between our proposed network and other chaotic neural networks denotes that the proposed network has superior executive efficiency and better ability to get optimal or near-optimal solution.     

Objective function based ranking method for selection of optimal beam angles in IMRT

We propose a novel method for the selection of optimal beam angles in Intensity Modulated Radiation Therapy (IMRT). The proposed approach uses an objective function based metric called “target-to-critical organ objective function ratio” to find out the optimal gantry angles. The beams are ranked based on this metric and are accordingly chosen for IMRT optimization. We have used the Pinnacle TPS (Philips Medical System V 16.2) for performing the IMRT optimization. In order to validate our approach, we have applied it in four clinical cases: Head and Neck, Lung, Abdomen and Prostate. Basically, for all clinical cases, two set of plans were created with same clinical objectives, namely Equal angle plan (EA Plan) and Suitable angle Plan (SA Plan). In the EA plans, the beam angles were placed in an equiangular manner starting from the gantry angle of 0°. In the corresponding SA plans, the beam angles were decided using the guidance provided by the algorithm. The reduction in OAR mean dose and max dose obtained in SA plans is about 3 to 16% and 3 to 15% respectively depending upon the treatment site while obtaining equal target coverage as compared to their EA counterparts. It takes approximately 15–25 min to find the optimal beam angles. The results obtained from the clinical cases indicate that the plan quality is considerably improved when the beam angles are optimized using the proposed method.     

A Two-Stage Algorithm for Origin-Destination Matrices Estimation Considering Dynamic Dispersion Parameter for Route Choice

This paper proposes a two-stage algorithm to simultaneously estimate origin-destination (OD) matrix, link choice proportion, and dispersion parameter using partial traffic counts in a congested network. A non-linear optimization model is developed which incorporates a dynamic dispersion parameter, followed by a two-stage algorithm in which Generalized Least Squares (GLS) estimation and a Stochastic User Equilibrium (SUE) assignment model are iteratively applied until the convergence is reached. To evaluate the performance of the algorithm, the proposed approach is implemented in a hypothetical network using input data with high error, and tested under a range of variation coefficients. The root mean squared error (RMSE) of the estimated OD demand and link flows are used to evaluate the model estimation results. The results indicate that the estimated dispersion parameter theta is insensitive to the choice of variation coefficients. The proposed approach is shown to outperform two established OD estimation methods and produce parameter estimates that are close to the ground truth. In addition, the proposed approach is applied to an empirical network in Seattle, WA to validate the robustness and practicality of this methodology. In summary, this study proposes and evaluates an innovative computational approach to accurately estimate OD matrices using link-level traffic flow data, and provides useful insight for optimal parameter selection in modeling travelers’ route choice behavior.