关于Banach空间中凸泛函的广义次梯度不等式

本文在前人^[1,2]的基础之上，以凸泛函的次梯度不等式为工具，将Jensen不等式推广到Banach空间中的凸泛函，导出了Banach空间中的Bochner积分型的广义Jensen不等式，给出其在Banach空间概率论中某些应用，从而推广了文献[3—6]的工作．     

Minimum Distance Between the Faces of Two Convex Polyhedra: A Sufficient Condition

The problem of finding the Euclidean distance between two convex polyhedra can be reduced to the combinatorial optimization problem of finding the minimum distance between their faces. This paper presents a global optimality criterion for this problem. An algorithm (QLDPA) for the fast computation of the distance between convex and bounded polyhedra is proposed as an application of it. Computer experiments show its fast performance, especially when the total number of vertices is large.     

Robust handling of non‐linear constraints for GA optimization of aerodynamic shapes

A new approach to the robust handling of non‐linear constraints for GAs (genetic algorithms) optimization is proposed. A specific feature of the approach consists of the change in the conventional search strategy by employing search paths which pass through both feasible and infeasible points (contrary to the traditional approach where only feasible points may be included in a path). The method (driven by full Navier–Stokes computations) was applied to the problem of multiobjective optimization of aerodynamic shapes subject to various geometrical and aerodynamic constraints. The results demonstrated that the method retains high robustness of conventional GAs while keeping CFD computational volume to an acceptable level, which allowed the algorithm to be used in a demanding engineering environment. Copyright © 2004 John Wiley & Sons, Ltd.     

Desorption behavior of a surfactant in a linear low‐density polyethylene blend at elevated temperatures

The desorption behavior of a surfactant in a linear low‐density polyethylene (LLDPE) blend at elevated temperatures of 50, 70, and 80 °C was studied with Fourier transform infrared spectroscopy. The composition of the LLDPE blend was 70:30 LLDPE/low‐density polyethylene. Three different specimens (II, III, and IV) were prepared with various compositions of a small molecular penetrant, sorbitan palmitate (SPAN‐40), and a migration controller, poly(ethylene acrylic acid) (EAA), in the LLDPE blend. The calculated diffusion coefficient (D) of SPAN‐40 in specimens II, III, and IV, between 50 and 80 °C, varied from 1.74 × 10^?11 to 6.79 × 10^?11 cm²/s, from 1.10 × 10^?11 to 5.75 × 10^?11 cm²/s, and from 0.58 × 10^?11 to 4.75 × 10^?11 cm²/s, respectively. In addition, the calculated activation energies (E_D) of specimens II, III, and IV, from the plotting of ln D versus 1/T between 50 and 80 °C, were 42.9, 52.7, and 65.6 kJ/mol, respectively. These values were different from those obtained between 25 and 50 °C and were believed to have been influenced by the interference of Tinuvin (a UV stabilizer) at elevated temperatures higher than 50 °C. Although the desorption rate of SPAN‐40 increased with the temperature and decreased with the EAA content, the observed spectral behavior did not depend on the temperature and time. For all specimens stored over 50 °C, the peak at 1739 cm^?1 decreased in a few days and subsequently increased with a peak shift toward 1730 cm^?1. This arose from the carbonyl stretching vibration of Tinuvin, possibly because of oxidation or degradation at elevated temperatures. In addition, the incorporation of EAA into the LLDPE blend suppressed the desorption rate of SPAN‐40 and retarded the appearance of the 1730 cm^?1 peak. © 2004 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 42: 1114–1126, 2004     

Gray code for derangements

We give a Gray code and constant average time generating algorithm for derangements, i.e., permutations with no fixed points. In our Gray code, each derangement is transformed into its successor either via one or two transpositions or a rotation of three elements. We generalize these results to permutations with number of fixed points bounded between two constants.     

Local approximations for maximum partial subgraph problem

We deal with MAXH₀-FREE PARTIAL SUBGRAPH. We mainly prove that 3-locally optimum solutions achieve approximation ratio (δ₀+1)/(B+2+ν₀), where B=max_v∈Vd_G(v), δ₀=min_v∈V(H0)d_H0(v) and ν₀=(|V(H₀)|+1)/δ₀. Next, we show that this ratio rises up to 3/(B+1) when H₀=K₃. Finally, we provide hardness results for MAXK₃-FREE PARTIAL SUBGRAPH.     

Equivalence of two linear programming relaxations for broadcast scheduling

A server needs to compute a broadcast schedule for n pages whose request times are known in advance. Outputting a page satisfies all outstanding requests for the page. The goal is to minimize the average waiting time of a client. In this paper, we show the equivalence of two apparently different relaxations that have been considered for this problem.     

Strongly polynomial-time approximation for a class of bicriteria problems

Consider the following problem: given a ground set and two minimization objectives of the same type find a subset from a given subset-class that minimizes the first objective subject to a budget constraint on the second objective. Using Megiddo's parametric method we improve an earlier weakly polynomial time algorithm.     

A Characterisation of Posets that Are nearly Antichains

We present a characterisation of posets of size n with linear discrepancy n − 2. These are the posets that are “furthest” from a linear order without being an antichain. This revised version was published online in September 2006 with corrections to the Cover Date.     

Deciding confluence of certain term rewriting systems in polynomial time

We present a characterization of confluence for term rewriting systems, which is then refined for special classes of rewriting systems. The refined characterization is used to obtain a polynomial time algorithm for deciding the confluence of ground term rewrite systems. The same approach also shows the decidability of confluence for shallow and linear term rewriting systems. The decision procedure has a polynomial time complexity under the assumption that the maximum arity of a function symbol in the signature is a constant.