An Adaptive Spectral Conjugate Gradient Method with Restart Strategy

As a generalization of the two-term conjugate gradient method(CGM),the spectral CGM is one of the effective methods for solving unconstrained optimization.In this paper,we enhance the JJSL conjugate parameter,initially proposed by Jiang et al.(Computational and Applied Mathematics,2021,40:174),through the utilization of a convex combination technique.And this improvement allows for an adaptive search direction by integrating a newly constructed spectral gradient-type restart strategy.Then,we develop a new spectral CGM by employing an inexact line search to determine the step size.With the application of the weak Wolfe line search,we establish the sufficient descent property of the proposed search direction.Moreover,under general assumptions,including the employment of the strong Wolfe line search for step size calculation,we demonstrate the global convergence of our new algorithm.Finally,the given unconstrained optimization test results show that the new algorithm is effective.

基于特征相关的谱特征选择算法

针对传统的谱特征选择算法只考虑单特征的重要性,将特征之间的统计相关性引入到传统谱分析中,构造了基于特征相关的谱特征选择模型。首先利用Laplacian Score找出最核心的一个特征作为已选特征,然后设计了新的特征组区分能力目标函数,采用前向贪心搜索策略依次评价候选特征,并选中使目标函数最小的候选特征加入到已选特征。该算法不仅考虑了特征重要性,而且充分考虑了特征之间的关联性,最后在2个不同分类器和8个UCI数据集上的实验结果表明:该算法不仅提高了特征子集的分类性能,而且获得较高的分类精度下所需特征子集的数量较少。

A method of automatic plane detection without random search

Plane detection is a prerequisite for many computer vision tasks. This paper proposes a new method which can automatically detect planes from two projective images. Firstly, we modify Scott’s feature point matching method by post-processing its result with the concept of similarity, and then get the lines matching according to feature points matching based on the approximate invariance of the features’ distribution between two images. Finally, we group all feature points into subsets in terms of their geometric relations with feature lines as initial sets to estimate homography rather than by a random search strategy (like RANSAC) as in most existing methods. The proposed method is especially suitable to detecting planes in man-made scenes. This method is validated on real images.

Matching spatial relation graphs using a constrained partial permutation strategy

A constrained partial permutation strategy is proposed for matching spatial relation graph (SRG), which is used in our sketch input and recognition system Smart Sketchpad for representing the spatial relationship among the components of a graphic object. Using two kinds of matching constraints dynamically generated in the matching process, the proposed approach can prune most improper mappings between SRGs during the matching process. According to our theoretical analysis in this paper, the time complexity of our approach is O(n 2) in the best case, and O(n!) in the worst case, which occurs infrequently. The spatial complexity is always O(n) for all cases. Implemented in Smart Sketchpad, our proposed strategy is of good performance.

A Fast and Memory-Efficient Approach to NDN Name Lookup

For name-based routing/switching in NDN, the key challenges are to manage large-scale forwarding Tables, to lookup long names of variable lengths, and to deal with frequent updates. Hashing associated with proper length-detecting is a straightforward yet efficient solution. Binary search strategy can reduce the number of required hash detecting in the worst case. However, to assure the searching path correct in such a schema, either backtrack searching or redundantly storing some prefixes is required, leading to performance or memory issues as a result. In this paper, we make a deep study on the binary search, and propose a novel mechanism to ensure correct searching path without neither additional backtrack costs nor redundant memory consumptions. Along any binary search path, a bloom filter is employed at each branching point to verify whether a said prefix is present, instead of storing that prefix here. By this means, we can gain significantly optimization on memory efficiency, at the cost of bloom checking before each detecting. Our evaluation experiments on both real-world and randomly synthesized data sets demonstrate our superiorities clearly

A novel adjustable multiple cross-hexagonal search algorithm for fast block motion estimation

In this paper,we propose a novel adjustable multiple cross-hexagonal search(AMCHS) algorithm for fast block motion estimation. It employs adjustable multiple cross search patterns(AMCSP) in the first step and then uses half-way-skip and half-way-stop technique to determine whether to employ two hexagonal search patterns(HSPs) subsequently. The AMCSP can be used to find small motion vectors efficiently while the HSPs can be used to find large ones accurately to ensure prediction quality. Simulation results showed that our proposed AMCHS achieves faster search speed,and provides better distortion performance than other popular fast search algorithms,such as CDS and CDHS.

Aging effects on QT interval： Implications for cardiac safety of antipsychotic drugs

Objectives To explore the effect of aging on cardiac toxicity specifically the interaction of age and antipsychotic drugs to alter the QT interval. Methods The Medline databases were searched using the OvidSP platforms with the search strategy： ＂QT interval＂ or ＂QT＂ and ＂age＂ or ＂aging＂. The entry criteria were： over 10,000 apparently healthy individuals with data on both sexes; QT interval corrected for heart rate （QTc） and an expression of its variance for multiple age decades extending into the older ages. Results QTc increased in duration with increasing age. Considering a modest one SD increment in QTc in the normal population, the addition of Chlorpromazine produced a QTc on average greater than 450 ms for ages 70 years and older. Risperidone, that did not on average alter QTc, would be expected to produce a QTc of 450 ms in persons in their mid 70 years under some circumstances. QTc prolongation 〉 500 ms with antipsychotic drugs is more likely for persons with QTc initially at the 99th percentile. It may occur with Haloperidol which does not on average alter QTc. Conclusions The range of values for the QT interval in apparently normal older men or women, when combined with the range of expected QT interval changes induced by antipsychotic drugs, can readily be associated with prolonged QTc. Individuals with QTc at the 99th percentile may have serious QTc prolongation with antipsychotic drugs even those that are not usually associated with QTc prolongation.

An efficient algorithm for mining closed itemsets

This paper presents a new efficient algorithm for mining frequent closed itemsets. It enumerates the closed set of frequent itemsets by using a novel compound frequent itemset tree that facilitates fast growth and efficient pruning of search space. It also employs a hybrid approach that adapts search strategies, representations of projected transaction subsets, and projecting methods to the characteristics of the dataset. Efficient local pruning, global subsumption checking, and fast hashing methods are detailed in this paper. The principle that balances the overheads of search space growth and pruning is also discussed. Extensive experimental evaluations on real world and artificial datasets showed that our algorithm outperforms CHARM by a factor of five and is one to three orders of magnitude more efficient than CLOSET and MAFIA.

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.

A ＂cluster＂ based search scheme in peer-to-peer network

This paper presents a "cluster" based search scheme in peer-to-peer network. The idea is based on the fact that data distribution in an information society has structured feature. We designed an algorithm to cluster peers that have similar interests. When receiving a query request, a peer will preferentially forward it to another peer which belongs to the same cluster and shares more similar interests. By this way search efficiency will be remarkably improved and at the same time good resilience against peer failure (the ability to withstand peer failure) is reserved.

A composite particle swarm algorithm for global optimization of multimodal functions

During the last decade, many variants of the original particle swarm optimization （PSO） algorithm have been proposed for global numerical optimization, hut they usually face many challenges such as low solution quality and slow convergence speed on multimodal function optimization. A composite particle swarm optimization （CPSO） for solving these difficulties is presented, in which a novel learning strategy plus an assisted search mechanism framework is used. Instead of simple learning strategy of the original PSO, the proposed CPSO combines one particle＇s historical best information and the global best information into one learning exemplar to guide the particle movement. The proposed learning strategy can reserve the original search information and lead to faster convergence speed. The proposed assisted search mechanism is designed to look for the global optimum. Search direction of particles can be greatly changed by this mechanism so that the algorithm has a large chance to escape from local optima. In order to make the assisted search mechanism more efficient and the algorithm more reliable, the executive probability of the assisted search mechanism is adjusted by the feedback of the improvement degree of optimal value after each iteration. According to the result of numerical experiments on multimodal benchmark functions such as Schwefel, Rastrigin, Ackley and Griewank both with and without coordinate rotation, the proposed CPSO offers faster convergence speed, higher quality solution and stronger robustness than other variants of PSO.

Mapping three-dimensional co-seismic surface deformations associated with the 2015 MW7.2 Murghab earthquake based on InSAR and characteristics of crustal strain

Three-dimensional(3 D) co-seismic surface deformations are of great importance to interpret the characteristics of coseismic deformations and to understand the geometries and dynamics of seismogenic faults. In this paper, we propose a method for mapping 3 D co-seismic deformations based on InSAR observations and crustal strain characteristics. In addition, the search strategy of correlation points is optimized by adaptive correlation distance, which greatly improves the applicability of the proposed method in restoring deformations in decorrelation areas. Results of the simulation experiment reveal that the proposed method is superior to conventional methods in both the accuracy and completeness. The proposed method is then applied to map the 3 D co-seismic surface deformations associated with the 2015 MW7.2 Murghab earthquake using ascending and descending ALOS-2 PALSAR-2 images. The results show that the seismogenic fault is the Sarez-Karakul fault(SKF), which is dominated by NE-SW strike slips with an almost vertical dip angle. The north section and the south segment near the epicentre have obvious subsidence along with a southwestward motion in the northwest wall, and the southeast wall has northeast movement and surface uplift trend along the fault zone. The strain field of the earthquake is also obtained by the proposed method. It is found that the crustal block of the seismic area is obviously affected by dilatation and shear forces, which is in good agreement with the movement character of the sinistral slip.

Parameters identification of chaotic systems based on artificial bee colony algorithm combined with cuckoo search strategy

Artificial bee colony(ABC) algorithm is motivated by the intelligent behavior of honey bees when seeking a high quality food source. It has a relatively simple structure but good global optimization ability. In order to balance its global search and local search abilities further, some improvements for the standard ABC algorithm are made in this study. Firstly, the local search mechanism of cuckoo search optimization(CS) is introduced into the onlooker bee phase to enhance its dedicated search; secondly, the scout bee phase is also modified by the chaotic search mechanism. The improved ABC algorithm is used to identify the parameters of chaotic systems, the identified results from the present algorithm are compared with those from other algorithms. Numerical simulations, including Lorenz system and a hyper chaotic system, illustrate the present algorithm is a powerful tool for parameter estimation with high accuracy and low deviations. It is not sensitive to artificial measurement noise even using limited input data.

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.

Definition and Algorithms for Reliable Steiner Tree Problem

This paper considers a new form of the Steiner tree problem that is more practical and reliable,which we call Reliable Steiner Tree(RST)problem.The authors give a detailed definition for this new problem and design both an exact algorithm and an approximation algorithm for it.The definition is based on the reliability of full components instead of Steiner vertices.The task is thus to find the most reliable full components to make up an optimum reliable Steiner tree.The exact algorithm designed for this problem utilizes a dynamic programming frame.The approximation algorithm designed in this paper exploits a local search strategy that looks for the best full component according to a selection function at a time.

A multi-dimensional tabu search algorithm for the optimization of process planning

Computer-aided process planning （CAPP） is an essential component of computer integrated manufacturing （CIM） system. A good process plan can be obtained by optimizing two elements, namely, operation sequence and the machining parameters of machine, tool and tool access direction （TAD） for each operation. This paper proposes a novel optimization strategy for process planning that considers different dimensions of the problem in parallel. A multi-dimensional tabu search （MDTS） algo-rithm based on this strategy is developed to optimize the four dimensions of a process plan, namely, operation sequence （OperSeq）, machine sequence （MacSeq）, tool sequence （TooISeq） and tool approach direction sequence （TADSeq）, sequentially and iteratively. In order to improve its efficiency and stability, tabu search, which is incorporated into the proposed MDTS al- gorithm, is used to optimize each component of a process plan, and some neighbourhood strategies for different components are presented for this tabu search algorithm. The proposed MDTS algorithm is employed to test four parts with different numbers of operations taken from the literature and compared with the existing algorithms like genetic algorithm （GA）, simulated annealing （SA）, tabu search （TS） and particle swarm optimization （PSO）. Experimental results show that the developed algo-rithm outperforms these algorithms in terms of solution quality and efficiency.

Mate choice decisions by searchers

For more than two decades rudimentary versions of the fixed sample and sequential search strategies have provided the primary theoretical foundation for the study of mate choice decisions by searchers. The theory that surrounds these models has expanded markedly over this time period. In this paper, we review and extend results derived from these models, with a focus on the empirical analysis of searcher behavior. The basic models are impractical for empirical purposes because they rely on the as- sumption that searchers--and, for applied purposes, researchers--assess prospective mates based on their quality, the fitness consequences of mate choice decisions. Here we expound versions of the models that are more empirically useful, reformulated to reflect decisions based on male phenotypic characters. For some organisms, it may be possible to use preference functions to de- rive predictions from the reformulated models and thereby avoid difficulties associated with the measurement of male quality per se. But predictions derived from the two models are difficult to differentiate empirically, regardless of how the models are formu- lated. Here we develop ideas that illustrate how this goal might be accomplished. In addition, we clarify how the variability of male quality should be evaluated and we extend what is known about how this variability influences searcher behavior under each model. More general difficulties associated with the empirical study of mate choice decisions by searchers are also discussed [Current Zoology 59 （2）： 184-199, 2013].