基于小波与齐次Besov空间的图像分割算法

从具有全局最优解的几何活动轮廓方法出发,分别提出了两种基于齐次Besov窄间与小波变换的图像分割算法,并给出了解的存在性证明.数值求解利用小波软阈值以及分裂Bregman方法,能够有效提高计算效率.由于小波变换具有多分辨特性,对于包含较多细节信息的图像,采用新算法能够得到更好的分割效果.数值实验表明采用新算法能够获得较...     

An experimental study of fuel injection strategies in CAI gasoline engine

Combustion of gasoline in a direct injection controlled auto-ignition (CAI) single-cylinder research engine was studied. CAI operation was achieved with the use of the negative valve overlap (NVO) technique and internal exhaust gas re-circulation (EGR). Experiments were performed at single injection and split injection, where some amount of fuel was injected close to top dead centre (TDC) during NVO interval, and the second injection was applied with variable timing. Additionally, combustion at variable fuel-rail pressure was examined.Investigation showed that at fuel injection into recompressed exhaust fuel reforming took place. This process was identified via an analysis of the exhaust-fuel mixture composition after NVO interval. It was found that at single fuel injection in NVO phase, its advance determined the heat release rate and auto-ignition timing, and had a strong influence on NO_X emission. However, a delay of single injection to intake stroke resulted in deterioration of cycle-to-cycle variability. Application of split injection showed benefits of this strategy versus single injection. Examinations of different fuel mass split ratios and variable second injection timing resulted in further optimisation of mixture formation. At equal share of the fuel mass injected in the first injection during NVO and in the second injection at the beginning of compression, the lowest emission level and cyclic variability improvement were observed.     

On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube

Split cuts are prominent general-purpose cutting planes in integer programming. The split closure of a rational polyhedron is what is obtained after intersecting the half-spaces defined by all the split cuts for the polyhedron. In this paper, we prove that deciding whether the split closure of a rational polytope is empty is NP-hard, even when the polytope is contained in the unit hypercube. As a direct corollary, we prove that optimization and separation over the split closure of a rational polytope in the unit hypercube are NP-hard, extending an earlier result of Caprara and Letchford.     

Avoidance of split overlaps

We generalize Axel Thue’s familiar definition of overlaps in words, and observe that there are no infinite words avoiding split occurrences of these generalized overlaps. We give estimates for the length of the longest finite word that avoids split overlaps. Along the way we prove a useful theorem about repeated disjoint occurrences in words — an interesting natural variation on the classical de Bruijn sequences.     

Revisiting parametric multi-terminal problems: Maximum flows, minimum cuts and cut-tree computations

Given an undirected network, the multi-terminal network flows analysis consists in determining the all pairs maximum flow values. In this paper, we consider an undirected network in which some edge capacities are allowed to vary and we analyze the impact of such variations on the all pairs maximum flow values. We first provide an efficient algorithm for the single parametric capacity case, and then propose a generalization to the case of multiple parametric capacities. Moreover, we provide a study on Gomory–Hu cut-tree relationships.     

0–1 equivalent model representations for air traffic management

We present two equivalent representations of a 0–1 model for the Air Traffic Flow Management Problem. We show that the LP relaxation of the second representation is tighter than the LP relaxation of the first one. As a direct implication, the Branch-and-Cut effort can be reduced. Computational results are reported on a set of large-scale instances. The preparation of this paper is partially supported by DGICYT through grant PB95-0407     

An O(K·n4) algorithm for finding the k best cuts in a network

An algorithm for finding the K best cuts in a network is presented. Using a branch technique introduced by Lawler [4] we reduce the problem to K computations of 2nd best cuts. The latter problem can be solved by an O(n⁴) algorithm yielding an overall complexity of O(K·n⁴) for the presented algorithm.     

Cutting planes for integer programs with general integer variables

We investigate the use of cutting planes for integer programs with general integer variables. We show how cutting planes arising from knapsack inequalities can be generated and lifted as in the case of 0–1 variables. We also explore the use of Gomory's mixed-integer cuts. We address both theoretical and computational issues and show how to embed these cutting planes in a branch-and-bound framework. We compare results obtained by using our cut generation routines in two existing systems with a commercially available branch-and-bound code on a range of test problems arising from practical applications. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.Corresponding author.This research was partly performed when the author was affiliated with CORE, Université Catholique de Louvain.     

The strength of multi-row aggregation cuts for sign-pattern integer programs

Sign-pattern IPs are a generalization of packing IPs, where for a given column all coefficients are either non-negative or non-positive. We show that the aggregation closure for such sign-pattern IPs can be 2-approximated by the original 1-row closure. This generalizes a result for packing IPs. On the other hand, unlike in the case of packing IPs, we show that the multi-row aggregation closure cannot be well approximated by the original multi-row closure.