模拟退火算法在渔船船型论证中的应用

从系统的角度出发，采用“模拟退火算法”对我国北太平洋远洋拖网渔船船型进行了全局优化，同时对模拟退火算法的全局最优机理进行了阐述。

快速素数生成方法综述

很多非对称密码算法都使用素数,有些算法的安全性完全基于素数的质量和保密性.而生成大素数是非常耗时的,因此研究素数的快速生成是必要的.本文总结对比近年来提出的快速素数生成算法,将素数生成划分为生成与小素数乘积互素的数、素数生成主体和素数检测三个阶段,分别研究各阶段的算法.生成与小素数乘积互素的数中介绍了查表法、模搜索法和改进的模搜索法;素数生成主体部分包括原生算法、增量生成算法及其改进和M-J生成算法及其改进;然后研究了概率素数检测算法并给出提高其性能的一些技巧.并给出软件实现上述算法的性能对比结果,给算法的选取提供依据.最后给出了一个素数生成的应用场景.

Vehicle routing optimization algorithm based on time windows and dynamic demand

To provide the supplier with the minimizum vehicle travel distance in the distribution process of goods in three situations of new customer demand,customer cancellation service,and change of customer delivery address,based on the ideas of pre-optimization and real-time optimization,a two-stage planning model of dynamic demand based vehicle routing problem with time windows was established.At the pre-optimization stage,an improved genetic algorithm was used to obtain the pre-optimized distribution route,a large-scale neighborhood search method was integrated into the mutation operation to improve the local optimization performance of the genetic algorithm,and a variety of operators were introduced to expand the search space of neighborhood solutions;At the real-time optimization stage,a periodic optimization strategy was adopted to transform a complex dynamic problem into several static problems,and four neighborhood search operators were used to quickly adjust the route.Two different scale examples were designed for experiments.It is proved that the algorithm can plan the better route,and adjust the distribution route in time under the real-time constraints.Therefore,the proposed algorithm can provide theoretical guidance for suppliers to solve the dynamic demand based vehicle routing problem.

Multiple vehicle routing problem integrated reverse logistics with fuzzy reverse demands

A new type of vehicle routing problem （VRP）, multiple vehicle routing problem integrated reverse logistics （MVRPRL）, is studied. In this problem, there is delivery or pickup （or both） and uncertain features in the demands of the clients. The deliveries of every client as uncertain parameters are expressed as triangular fuzzy numbers. In order to describe MVRPRL, a multi-objective fuzzy programming model with credibility measure theory is constructed. Then the simulationbased tabu search algorithm combining inter-route and intra-route neighborhoods and embedded restarts are designed to solve it. Computational results show that the tabu search algorithm developed is superior to sweep algorithms and that compared with handling each on separate routes, the transportation costs can be reduced by 43% through combining pickups with deliveries.

Simulation of clinker grinding circuits of cement plant based on process models calibrated using GA search method

Particle size distributions of obtained samples from several sampling campaigns were determined and raw data were mass balanced before being used in simulation studies.After determination of breakage function,selection function,Bond work index,residence time distribution parameters,and Whiten's model parameters for air separators and diaphragms between the two compartments of tube ball mills,performance of the circuits was simulated for given throughputs and feed particle size distribution.Whiten's model parameters were determined by GA(genetic algorithm) toolbox of MATLAB software.Based on implemented models for modeling and simulation,optimization of circuits was carried out.It increased nearly 10.5% and 15.8% in fresh feed capacity input to each tube ball mill.In addition,circulating load ratios of circuits are modified to 118% and 127% from low level of 57% and 22%,respectively,and also cut points of air separators are adjusted at 30 and 40 μm from high range of 53 and 97 μm,respectively.All applications helped in well-operation and energy consumption reduction of equipments.

A DERIVATIVE-FREE ALGORITHM FOR UNCONSTRAINED OPTIMIZATION

In this paper a hybrid algorithm which combines the pattern search method and the genetic algorithm for unconstrained optimization is presented. The algorithm is a deterministic pattern search algorithm,but in the search step of pattern search algorithm,the trial points are produced by a way like the genetic algorithm. At each iterate, by reduplication,crossover and mutation, a finite set of points can be used. In theory,the algorithm is globally convergent. The most stir is the numerical results showing that it can find the global minimizer for some problems ,which other pattern search algorithms don＇t bear.

Automatic Search of Impossible Differentials and Zero-Correlation Linear Hulls for ARX Ciphers

In lightweight cryptographic primitives, round functions with only simple operations XOR, modular addition and rotation are widely used nowadays. This kind of ciphers is called ARX ciphers. For ARX ciphers, impossible differential cryptanalysis and zero-correlation linear cryptanalysis are among the most powerful attacks, and the key problems for these two attacks are discovering more and longer impossible differentials(IDs) and zero-correlation linear hulls(ZCLHs). However, finding new IDs and ZCLHs for ARX ciphers has been a manual work for a long time, which has been an obstacle in improving these two attacks. This paper proposes an automatic search method to improve the efficiency of finding new IDs and ZCLHs for ARX ciphers. In order to prove the efficiency of this new tool, we take HIGHT, LEA, SPECK three typical ARX algorithms as examples to explore their longer and new impossible differentials and zero-correlation linear hulls. To the best of our knowledge, this is the first application of automatic search method for ARX ciphers on finding new IDs and ZCLHs. For HIGHT, we find more 17 round IDs and multiple 17 round ZCLHs. This is the first discovery of 17 round ZCLHs for HIGHT. For LEA, we find extra four 10 round IDs and several 9 round ZCLHs. In the specification of LEA, the designers just identified three 10 round IDs and one 7round ZCLH. For SPECK, we find thousands of 6 round IDs and forty-four 6 round ZCLHs. Neither IDs nor ZCLHs of SPECK has been proposed before. The successful application of our new tool shows great potential in improving the impossible differential cryptanalysis and zero-correlation linear cryptanalysis on ARX ciphers..

Response of fuzzy clustering on different threshold determination algorithms in spectral change vector analysis over Western Himalaya, India

Abstract： Change detection is a standard tool to extract and analyze the earth＇s surface features from remotely sensed data. Among the different change detection techniques, change vector analysis （CVA） have an exceptional advantage of discriminating change in terms of change magnitude and vector direction from multispectral bands. The estimation of precise threshold is one of the most crucial task in CVA to separate the change pixels from unchanged pixels because overall assessment of change detection method is highly dependent on selected threshold value. In recent years, integration of fuzzy clustering and remotely sensed data have become appropriate and realistic choice for change detection applications. The novelty of the proposed model lies within use of fuzzy maximum likelihood classification （FMLC） as fuzzy clustering in CVA. The FMLC based CVA is implemented using diverse threshold determination algorithms such as double-window flexible pace search （DFPS）, interactive trial and error （T＆E）, and 3x3-pixel kernel window （PKW）. Unlike existing CVA techniques, addition of fuzzy clustering in CVA permits each pixel to have multiple class categories and offers ease in threshold determination process. In present work, the comparative analysis has highlighted the performance of FMLC based CVA overimproved SCVA both in terms of accuracy assessment and operational complexity. Among all the examined threshold searching algorithms, FMLC based CVA using DFPS algorithm is found to be the most efficient method.

DESIGN OF MAXIMALLY FLAT FIR FILTERS BASED ON EXPLICIT FORMULAS COMBINED WITH OPTIMIZATION

A maximally flat FIR filter design method based on explicit formulas combined with simulated annealing and random search was presented. Utilizing the explicit formulas to calculate the ini- tial values, the firate-word-length FIR filter design problem was converted into optimization of the filter coefficients, An optimization method combined with local discrete random search and simulated annealing was proposed, with the result of optimum solution in the sense of Chebyshev approximation. The proposed method can simplify the design process of FIR filter and reduce the calculation burden. The simulation result indicates that the proposed method is superior to the traditional round off method and can reduce the value of the objective function to 41%～74%.

Global Convergence of a New Restarting Conjugate Gradient Method for Nonlinear Optimizations

Conjugate gradient optimization algorithms depend on the search directions with different choices for the parameters in the search directions. In this note, by combining the nice numerical performance of PR and HS methods with the global convergence property of the class of conjugate gradient methods presented by HU and STOREY(1991), a class of new restarting conjugate gradient methods is presented. Global convergences of the new method with two kinds of common line searches, are proved. Firstly, it is shown that, using reverse modulus of continuity function and forcing function, the new method for solving unconstrained optimization can work for a continously dif ferentiable function with Curry-Altman's step size rule and a bounded level set. Secondly, by using comparing technique, some general convergence properties of the new method with other kind of step size rule are established. Numerical experiments show that the new method is efficient by comparing with FR conjugate gradient method.

Power loss reduction of distribution systems using BFO based optimal reconfiguration along with DG and shunt capacitor placement simultaneously in fuzzy framework

In distribution systems,network reconfiguration and capacitor placement are commonly used to diminish power losses and keep voltage profiles within acceptable limits.Moreover,the problem of DG allocation and sizing is great important.In this work,a combination of a fuzzy multi-objective approach and bacterial foraging optimization(BFO) as a meta-heuristic algorithm is used to solve the simultaneous reconfiguration and optimal sizing of DGs and shunt capacitors in a distribution system.Each objective is transferred into fuzzy domain using its membership function.Then,the overall fuzzy satisfaction function is formed and considered a fitness function inasmuch as the value of this function has to be maximized to gain the optimal solution.The numerical results show that the presented algorithm improves the performance much more than other meta-heuristic algorithms.Simulation results found that simultaneous reconfiguration with DG and shunt capacitors allocation(case 5) has 77.41%,42.15%,and 56.14%improvements in power loss reduction,load balancing,and voltage profile indices,respectively in 33-bus test system.This result found 87.27%,35.82%,and 54.34%improvements of mentioned indices respectively for 69-bus system.

Global optimization by small-world optimization algorithm based on social relationship network

A fast global convergence algorithm, small-world optimization (SWO), was designed to solve the global optimization problems, which was inspired from small-world theory and six degrees of separation principle in sociology. Firstly, the solution space was organized into a small-world network model based on social relationship network. Secondly, a simple search strategy was adopted to navigate into this network in order to realize the optimization. In SWO, the two operators for searching the short-range contacts and long-range contacts in small-world network were corresponding to the exploitation and exploration, which have been revealed as the common features in many intelligent algorithms. The proposed algorithm was validated via popular benchmark functions and engineering problems. And also the impacts of parameters were studied. The simulation results indicate that because of the small-world theory, it is suitable for heuristic methods to search targets efficiently in this constructed small-world network model. It is not easy for each test mail to fall into a local trap by shifting into two mapping spaces in order to accelerate the convergence speed. Compared with some classical algorithms, SWO is inherited with optimal features and outstanding in convergence speed. Thus, the algorithm can be considered as a good alternative to solve global optimization problems.

Fortified Financial Forecasting Models Based on Non-Linear Searching Approaches

The paper＇s aim is how to forecast data with variations involving at times series data to get the best forecasting model. When researchers are going to forecast data with variations involving at times series data （i.e., secular trends, cyclical variations, seasonal effects, and stochastic variations）, they believe the best forecasting model is the one which realistically considers the underlying causal factors in a situational relationship and therefore has the best ＂track records＂ in generating data. Paper＇s models can be adjusted for variations in related a time series which processes a great deal of randomness, to improve the accuracy of the financial forecasts. Because of Na＇fve forecasting models are based on an extrapolation of past values for future. These models may be adjusted for seasonal, secular, and cyclical trends in related data. When a data series processes a great deal of randomness, smoothing techniques, such as moving averages and exponential smoothing, may improve the accuracy of the financial forecasts. But neither Na＇fve models nor smoothing techniques are capable of identifying major future changes in the direction of a situational data series. Hereby, nonlinear techniques, like direct and sequential search approaches, overcome those shortcomings can be used. The methodology which we have used is based on inferential analysis. To build the models to identify the major future changes in the direction of a situational data series, a comparative model building is applied. Hereby, the paper suggests using some of the nonlinear techniques, like direct and sequential search approaches, to reduce the technical shortcomings. The final result of the paper is to manipulate, to prepare, and to integrate heuristic non-linear searching methods to serve calculating adjusted factors to produce the best forecast data.

A new damping ratio identification method based on pattern search

In order to improve the effectiveness of traditional time domain identification methods in identifying damping ratios, a new damping ratio identification method based on pattern search is proposed by fluctuating the reliable natural frequency obtained through traditional time domain identification methods by about 10% to build the boundary conditions, using all the initial identification results to establish the free decay response of the system, and using the pattern search method to correct the initial identification results with the residual sum of squares between the free decay response and the actually measured free-decay signal as the objective function. The proposed method deals with the actually measured free-decay signal with curve fitting and avoids enlarging the identified error caused by intermediate conversion, so it can effectively improve the identified accuracy of damping ratios. Simulations for a room-sized vibration isolation foundation show that the relative errors of analyzed three damping ratios are down to 1.05%, 1.51% and 3.7% by the proposed method from 8.42%, 5.85% and 8.5% by STD method when the noise level is 10%.

A Single Pattern Matching Algorithm Based on Character Frequency

Based on the study of single pattern matching, MBF algorithm is proposed by imitating the string searching procedure of human. The algorithm preprocesses the pattern by using the idea of Quick Search algorithm and the already-matched pattern psefix and suffix information. In searching phase, the algorithm makes use of the!character using frequency and the continue-skip idea. The experiment shows that MBF algorithm is more efficient than other algorithms.

An efficient human detection method for multi-pedestrian tracking

Traditional human detection using pre-trained detectors tends to be computationally intensive for time-critical tracking tasks, and the detection rate is prone to be unsatisfying when occlusion, motion blur and body deformation occur frequently. A spatial-confidential proposal filtering method(SCPF) is proposed for efficient and accurate human detection. It consists of two filtering phases: spatial proposal filtering and confidential proposal filtering. A compact spatial proposal is generated in the first phase to minimize the search space to reduce the computation cost. The human detector only estimates the confidence scores of the candidate search regions accepted by the spatial proposal instead of global scanning. At the second phase, each candidate search region is assigned with a supplementary confidence score according to their reliability estimated by the confidential proposal to reduce missing detections. The performance of the SCPF method is verified by extensive tests on several video sequences from available public datasets. Both quantitatively and qualitatively experimental results indicate that the proposed method can highly improve the efficiency and the accuracy of human detection.

Multi-objectives and Simulation Models for Develop Production Line in Automobiles Manufacturing System

Automotive manufacturing is complex and includes the coordination of design in the manufacturing system. The manufacturing approaches over the past few years, disassembly have been a key issue, and it seems that simulation models are usually tailored to address a narrow set of industrial issues. This paper describes the development of the production line in the automobile manufacturing system through design, operation, and maintenance, based on multi-objectives of Algorithm and Simulation Model called MOA-SM. The both models are being developed at three different levels： the production line in the body and assembly shop, supply chain, and the production plan. The optimization tries to involve more objectives to solve the issues in manufacturing system. A solution that may optimize one performance measure may deteriorate since other performance solutions are difficult. The resulting algorithms are comparable to the simulation and multi-object in terms of success rate, assembly times, peak forces, moments, and have assembly times superior to those of a benchmark blind search algorithm.

干旱期供水水库运行策略优化分析

比较分析了标准运行策略及限制供水规则运用于干旱期水库供水系统运行策略模拟分析方面的特征;针对建立的基于供水限制规则的干旱期水库运行策略分析数学规划模型,为了克服多面体搜索法和线性逐步迭代法在模型求解过程中的不足,提出了将混合规划模型看作为供水限制控制参数的隐性非线性函数,而其非线性函数关系则由线性混合整数规划模型表达的新概念,并阐述了可解决该类问题的混合线性规划分枝定界法与模矢搜索法相结合的求解技术,最后以实例计算验证了该方法的有效性。

Path planning for taxi of carrier aircraft launching

Launching efficiency is an important index to measure the fighting capacity of an aircraft carrier. The study on path planning for taxi of carrier aircraft is of great significance for enhancing the launching efficiency. Considering the launching efficiency and the safety in operation of carrier aircraft launching and taking into account the carrier aircraft maneuver performance, deck environment and feature of mission, we proposed a conceptual model which contains the key elements of path planning for taxi of carrier aircraft. Subsequently, the objective function for the path planning problem and its mathematical model containing various constraints were established. With the A * search algorithm, a dynamic weight heuristic function was designed. According to the characteristic of path planning model for taxi of carrier aircraft, a simple and effective detection method was introduced. Finally, a feasible path for taxi of carrier aircraft, which meets the constraints, was presented. Taking the Nimitz-class aircraft carrier as an example, the paths for taxi of carrier aircraft launching from elevators to catapults were planned. Simulation results demonstrated the rationality of the model and the effectiveness of the algorithm.

Influences of misprediction costs on solar flare prediction

The mispredictive costs of flaring and non-flaring samples are different for different applications of solar flare prediction.Hence,solar flare prediction is considered a cost sensitive problem.A cost sensitive solar flare prediction model is built by modifying the basic decision tree algorithm.Inconsistency rate with the exhaustive search strategy is used to determine the optimal combination of magnetic field parameters in an active region.These selected parameters are applied as the inputs of the solar flare prediction model.The performance of the cost sensitive solar flare prediction model is evaluated for the different thresholds of solar flares.It is found that more flaring samples are correctly predicted and more non-flaring samples are wrongly predicted with the increase of the cost for wrongly predicting flaring samples as non-flaring samples,and the larger cost of wrongly predicting flaring samples as non-flaring samples is required for the higher threshold of solar flares.This can be considered as the guide line for choosing proper cost to meet the requirements in different applications.