Embeddings of submanifolds and normal bundles

This paper studies the embeddings of a complex submanifold S inside a complex manifold M; in particular, we are interested in comparing the embedding of S in M with the embedding of S as the zero section in the total space of the normal bundle NS of S in M. We explicitly describe some cohomological classes allowing to measure the difference between the two embeddings, in the spirit of the work by Grauert, Griffiths, and Camacho, Movasati and Sad; we are also able to explain the geometrical meaning of the separate vanishing of these classes. Our results hold for any codimension, but even for curves in a surface we generalize previous results due to Laufert and Camacho, Movasati and Sad.     

基于邻域特征匹配的通用噪声滤波器

图像去噪是遥感图像复原的重要步骤。在去除图像噪声的同时希望尽可能多地保留图像的纹理细节信息。受较差的成像环境和图像数据远距离传输的影响,遥感图像中一般都含有较强的高斯-脉冲混合噪声,而在现有的图像去噪算法中,能够同时去除图像中的高斯-脉冲混合噪声的通用噪声滤波器很少。以非局部平均方法的滤波思想为基础,通过引入邻域相似度评价的概念和脉冲噪声探测器,提出了基于邻域特征匹配的通用噪声滤波器。实验结果表明:基于邻域特征匹配的通用噪声滤波器具备有很好地去除图像高斯-脉冲混合噪声的能力,在去除高斯-脉冲混合噪声的同时能够很好地保持图像的复杂纹理和精细细节,并且便于向DSP/FPGA多处理器平台上移植。     

Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints

A large dynasearch neighborhood is introduced for the one-machine scheduling problem with sequence-dependent setup times and costs and earliness-tardiness penalties. Finding the best schedule in this neighborhood is NP-complete in the ordinary sense but can be done in pseudo-polynomial time. We also present experimental results.     

Design of a subsonic airfoil with upstream blowing

The problem is solved of designing a symmetric airfoil with upstream blowing opposite to subsonic irrotational steady flow of an inviscid incompressible fluid. The solution relies on Sedov’s idea of a stagnation region developing in the neighborhood of the stagnation point. An iterative solution process is developed, and examples of airfoils are constructed. The numerical results are analyzed, and conclusions are drawn about the effect of blowing parameters on the airfoil geometry and the resultant force acting on the airfoil.     

长圈的邻域交条件的推广

证明了若G为一个k(k≥2)连通简单图,独立数为α,V(G)=n≥3,X1,X2,…,Xk是顶点集合V的子集,X=X1∪X2∪…∪Xk,且对于Xi(i=1,2,…,k)中任意两个不相邻点u,v,|N(u)∩N(v)|≥α,则X在G中可圈,并给出几个相关推论.     

Subgraphs in vertex neighborhoods of Kr‐free graphs

In a K_r‐free graph, the neighborhood of every vertex induces a K_{r ? 1}‐free subgraph. The K_r‐free graphs with the converse property that every induced K_{r ? 1}‐free subgraph is contained in the neighborhood of a vertex are characterized, based on the characterization in the case r ? 3 due to Pach [ 8 ]. © 2004 Wiley Periodicals, Inc. J Graph Theory 47: 29–38, 2004     

关于树的完美邻域集与无冗余集 (英)

本文首先给出了求树图T的完美邻域的多项式时间复杂度算法(A),并在此基础上证明了当S是T的任一完美邻域且｜S｜=θ(T),则S是T的一极大无冗余集．然后给出了由T的一极大无冗余集生成完美邻域集的多项式时间复杂度算法(B),并依此算法证明了若S为T的任一极大无冗余集,则T存在一独立完美邻域集U且｜U｜≤｜S｜．     

Further Extension of the TSP Assign Neighborhood

We introduce a new extension of Punnen's exponential neighborhood for the traveling salesman problem (TSP). In contrast to an interesting generalization of Punnen's neighborhood by De Franceschi, Fischetti, and Toth (2005), our neighborhood is searchable in polynomial time, a feature that invites exploitation by heuristic and metaheuristic procedures for the TSP and related problems, including those of De Franceschi, Fischetti, and Toth (2005) for the vehicle routing problem. Research of GG was partially supported by Leverhulme Trust and by the IST Programme of the European Community, under the PASCAL Network of Excellence, IST-2002–506778.     

度量空间的序列复盖SS一映射

证明了如下结果：（l）拓扑空间X具有局评可数弱基当且仅当X＃A星空间的1一序列复盖商ss-掩映象；（2）拓升空间X具有局都可数基当且仅当XRk量空间的2一序列复盖商ss一映象．     

The two-echelon capacitated electric vehicle routing problem with battery swapping stations: Formulation and efficient methodology

In this paper, we present a two-echelon capacitated electric vehicle routing problem with battery swapping stations (2E-EVRP-BSS), which aims to determine the delivery strategy under battery driving range limitations for city logistics. The electric vehicles operating in the different echelons have different load capacities, battery driving ranges, power consumption rates, and battery swapping costs. We propose an integer programming formulation and a hybrid algorithm that combines a column generation and an adaptive large neighborhood search (CG-ALNS) to solve the problem. We conducted extensive computational experiments, demonstrate the applicability of the proposed model, and show the efficiency of the CG-ALNS algorithm. In addition, we explore the interplay between battery driving range and the effectiveness of vehicle emission reduction through sensitivity analysis.