An adaptive memory algorithm for the k-coloring problem

Let G=(V,E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1,…,k}) to each vertex of G so that no edge has both endpoints with the same color. The adaptive memory algorithm is a hybrid evolutionary heuristic that uses a central memory. At each iteration, the information contained in the central memory is used for producing an offspring solution which is then possibly improved using a local search algorithm. The so obtained solution is finally used to update the central memory. We describe in this paper an adaptive memory algorithm for the k-coloring problem. Computational experiments give evidence that this new algorithm is competitive with, and simpler and more flexible than, the best known graph coloring algorithms.     

Inequalities for formal power series and entire functions

We present several integral and exponential inequalities for formal power series and for both arbitrary entire functions of exponential type and generalized Borel transforms. They are obtained through certain limit procedures which involve the multiparameter binomial inequalities, integral inequalities for continuous functions, and weighted norm inequalities for analytic functions. Some applications to the confluent hypergeometric functions, Bessel functions, Laguerre polynomials, and trigonometric functions are discussed. Also some generalizations are given.     

两端对称负折射率缺陷复合光子晶体:多通道滤波和光开关

采用传输矩阵法对两端对称负折射率缺陷复合光子晶体结构[D(AB)mD]N的透射特性进行了研究.结果表明:当N=2时,该结构透射谱的禁带出现两个完全共振透射峰,当N增加时,每个共振透射峰又分裂为N-1条；当复合光子晶体的层数m逐渐增加时,透射峰的品质因子逐渐提高,且分裂的共振透射峰距离逐渐减少；既为该结构实现高品质的多通...     

Classification of hypersurfaces with constant Laguerre eigenvalues in R~n

Let x:M → Rn be an umbilical free hypersurface with non-zero principal curvatures.Then x is associated with a Laguerre metric g,a Laguerre tensor L,a Laguerre form C,and a Laguerre second fundamental form B,which are invariants of x under Laguerre transformation group.An eigenvalue of Laguerre tensor L of x is called a Laguerre eigenvalue of x.In this paper,we classify all oriented hypersurfaces with constant Laguerre eigenvalues and vanishing Laguerre form.     

陶瓷过滤器高温除尘技术的研究进展

对陶瓷过滤元件及结构、滤饼的作用和架桥、过滤器故障安全（CPP）系统及陶瓷过滤器高温气体净化一体化技术等几个方面进行了评述，总结了陶瓷过滤器存在着过滤管破裂、清灰效率下降、管板和器壁的连接及脉冲阀的长期稳定性等几个问题，指出新型陶瓷材料的研究和陶瓷过滤器高温气体净化一体化技术是陶瓷过滤器今后的研究方向．     

Matching inductive search bias and problem structure in continuous Estimation-of-Distribution Algorithms

Research into the dynamics of Genetic Algorithms (GAs) has led to the field of Estimation-of-Distribution Algorithms (EDAs). For discrete search spaces, EDAs have been developed that have obtained very promising results on a wide variety of problems. In this paper we investigate the conditions under which the adaptation of this technique to continuous search spaces fails to perform optimization efficiently. We show that without careful interpretation and adaptation of lessons learned from discrete EDAs, continuous EDAs will fail to perform efficient optimization on even some of the simplest problems. We reconsider the most important lessons to be learned in the design of EDAs and subsequently show how we can use this knowledge to extend continuous EDAs that were obtained by straightforward adaptation from the discrete domain so as to obtain an improvement in performance. Experimental results are presented to illustrate this improvement and to additionally confirm experimentally that a proper adaptation of discrete EDAs to the continuous case indeed requires careful consideration.     

Building nonredundant adaptive wavelets by update lifting

In this paper, we propose a technique for building adaptive wavelets by means of an extension of the lifting scheme. Our scheme comprises an adaptive update lifting step and a fixed prediction lifting step. The adaptivity consists hereof that the system can choose between two different update filters, and that this choice is triggered by the local gradient of the original signal. If the gradient is large (in some seminorm sense) it chooses one filter, if it is small the other. We derive necessary and sufficient conditions for the invertibility of such an adaptive system for various scenarios. Furthermore, we present some examples to illustrate our theoretical results.     

Adaptive finite element methods for high-speed compressible flows

We describe an adaptive finite element algorithm for solving the unsteady Euler equations. The finite element algorithm is based on a Taylor/Galerkin formulation and uses a very fast and efficient data structure to refine and unrefine the grid in order to optimize the approximation. We give a general version of the method which can be applied to moving grids with sliding interfaces and we present the results for a transient supersonic calculation of rotor-stator interaction.     

Continuously tunable photonic microwave filter based on a spatial light modulator

An optical microwave filter architecture which can be continuously tuned is proposed and demonstrated. The architecture is based on a nematic liquid crystal spatial light modulator in parallel configuration and has the potential to control a large number of taps. Proof-of concept experimental results are provided.     

Efficient interval partitioning for constrained global optimization

A new efficient interval partitioning approach to solve constrained global optimization problems is proposed. This involves a new parallel subdivision direction selection method as well as an adaptive tree search. The latter explores nodes (intervals in variable domains) using a restricted hybrid depth-first and best-first branching strategy. This hybrid approach is also used for activating local search to identify feasible stationary points. The new tree search management technique results in improved performance across standard solution and computational indicators when compared to previously proposed techniques. On the other hand, the new parallel subdivision direction selection rule detects infeasible and suboptimal boxes earlier than existing rules, and this contributes to performance by enabling earlier reliable deletion of such subintervals from the search space.