On the Entangled Fractional Fourier Transform in Tripartite Entangled State Representation

Based on the newly constructed two mutually conjugate 3-mode entangled states of continuum variablesin three-mode Fock space we introduce entangled fractional Fourier transform (EFFT) for the tripartite entangled staterepresentations, which are not a direct product of three 1-dimensional FFTs. The eigenmodes of EFFT are obtained,which is different from the usual Hermite polynomials. The EFFT of the three-mode squeezed state is derived.     

分数阶傅立叶变换的多种定义形式及其光学实现系统分析

分数阶傅立叶变换是经典傅立叶变换的广义形式,它同时从时间域和频率域(或空间域)揭示信号特征。本文系统地分析了分数阶傅立叶变换三种定义形式及其所对应的光学实现系统的组成和原理,说明了光学信息处理系统实现分数阶傅立叶变换的有效性.     

A solution procedure for the discrete time, cost and quality tradeoff problem using electromagnetic scatter search

Decisions concerning a project’s expedition, traditionally involved considerations regarding time and cost tradeoff. It was recently suggested that the quality of a project should also be taken into considerations. In this paper, we propose a meta-heuristic solution procedure for the discrete time, cost and quality tradeoff problem. This problem involves the scheduling of project activities in order to minimize the total cost of the project while maximizing the quality of the project and also meeting a given deadline. We apply a so called electromagnetic scatter search to solve this problem. In this process, we initially generate a population of feasible solutions. In so doing, we use frequency memory to well sample the feasible region. A number of these solutions are then selected and improved locally. The improved solutions are then combined to generate new set of solutions. The combination process utilizes attraction–repulsion mechanisms borrowed from the electromagnetism theory. The whole process is stopped when no significant improvement in the set of solutions are observed. The validity of the proposed solution procedure is demonstrated, and its applicability is tested on a randomly generated large and complex problem having 19,900 activities.     

Pattern Search Method for Discrete <Emphasis Type="Italic">L</Emphasis><Subscript>1</Subscript>–Approximation

We propose a pattern search method to solve a classical nonsmooth optimization problem. In a deep analogy with pattern search methods for linear constrained optimization, the set of search directions at each iteration is defined in such a way that it conforms to the local geometry of the set of points of nondifferentiability near the current iterate. This is crucial to ensure convergence. The approach presented here can be extended to wider classes of nonsmooth optimization problems. Numerical experiments seem to be encouraging. This work was supported by M.U.R.S.T., Rome, Italy.     

Protein Conformation of a Lattice Model Using Tabu Search

We apply tabu search techniques to the problem of determining the optimal configuration of a chain of protein sequences on a cubic lattice. The problem under study is difficult to solve because of the large number of possible conformations and enormous amount of computations required. Tabu search is an iterative heuristic procedure which has been shown to be a remarkably effective method for solving combinatorial optimization problems. In this paper, an algorithm is designed for the cubic lattice model using tabu search. The algorithm has been tested on a chain of 27 monomers. Computational results show that our method outperforms previously reported approaches for the same model.     

分形方法用于有噪图像边缘检测的研究

本文研究了加性高斯白噪声对于基于离散分数布朗随机场模型图像分形维数估计的影响，并将分形方法用于图像边缘检测，指出在加性高斯白噪声的情况下，分形方法用于图像边缘检测较之经典的基于梯度运算的边缘检测方法有好的抗噪性能，同时又能检测比较丰富的图像边缘细节。     

On operators and search space topology in multi-objective flow shop scheduling

Multi-objective optimization using evolutionary algorithms identifies Pareto-optimal alternatives or their close approximation by means of a sequence of successive local improvement moves. While several successful applications to combinatorial optimization problems are known, studies of underlying problem structures are still scarce.     

Monotonic solutions of a quadratic integral equation of fractional order

In the paper we indicate an error made in the proof of the main result of the paper [M.A. Darwish, On quadratic integral equation of fractional orders, J. Math. Anal. Appl. 311 (2005) 112-119]. Moreover, we provide correct proof of a slightly modified version of the mentioned result. The main tool used in our proof is the technique associated with the Hausdorff measure of noncompactness.     

Optimality and duality in multiobjective fractional programming involving ρ-semilocally type I-preinvex and related functions

Optimality conditions are obtained for a nonlinear fractional multiobjective programming problem involving η-semidifferentiable functions. Also, a general dual is formulated and a duality result is proved using concepts of generalized ρ-semilocally type I-preinvex functions.