Receiver set partitioning and sequencing for multicasting traffic in a WDM lightwave single-hop network

This paper considers a receiver set partitioning and sequencing problem in a wavelength division multiplexing single-hop lightwave network for multicasting traffic. The problem is analysed in the approach of uncapacitated single batch-processing machine scheduling. In the analysis, several solution properties are characterized with respect to a mean flow time measure, based upon which two heuristic algorithms are developed, along with a dynamic programming algorithm. Several numerical experiments show that the heuristic algorithms generate good schedules. The problem is extended to consider two measures simultaneously including the mean flow time and the number of transmissions, for which the proposed algorithms also perform well.     

Loading aircraft for military operations

In this paper, we describe an aircraft loading problem submitted by the French military agency (DGA) as part of a more general military airlift planning problem. It can be viewed as a kind of bi-dimensional bin-packing problem, with heterogeneous bins and several additional constraints. We introduce two-phase methods for solving this NP-hard problem. The first phase consists in building good initial solutions, thanks to two fast algorithms: a list-based heuristic and a loading pattern generation method. Both algorithms call a constraint-based subroutine, able to determine quickly if the items already loaded can be reshuffled to accommodate a new object. The second phase improves these preliminary solutions using local search techniques. Results obtained on real data sets are presented.     

ON THE RATE OF WEIGHTED Lp CONVERGENCE BY THE GRUENWALD INTERPOLATORY OPERATORS

This paper gives the weighted Lp convergence rate estimations of the Gruenwald interpolatory polynomials based on the zeros of Chebyshev polymomials of the first kind,and proves that the order of the estimations is optimal for p≥1.     

Reply to Nathan: How to reconstruct the causal argument

Nicholas Nathan tries to resist the current version of the causal argument for sense-data in two ways. First he suggests that, on what he considers to be the correct re-construction of the argument, it equivocates on the sense of proximate cause. Second he defends a form of disjunctivism, by claiming that there might be an extra mechanism involved in producing veridical hallucination, that is not present in perception. I argue that Nathan’s reconstruction of the argument is not the appropriate one, and that, properly interpreted, the argument does not equivocate on proximate cause. Furthermore, I claim that his postulation of a modified mechanism for hallucinations is implausibly ad hoc.     

The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study

The sample average approximation (SAA) method is an approach for solving stochastic optimization problems by using Monte Carlo simulation. In this technique the expected objective function of the stochastic problem is approximated by a sample average estimate derived from a random sample. The resulting sample average approximating problem is then solved by deterministic optimization techniques. The process is repeated with different samples to obtain candidate solutions along with statistical estimates of their optimality gaps.We present a detailed computational study of the application of the SAA method to solve three classes of stochastic routing problems. These stochastic problems involve an extremely large number of scenarios and first-stage integer variables. For each of the three problem classes, we use decomposition and branch-and-cut to solve the approximating problem within the SAA scheme. Our computational results indicate that the proposed method is successful in solving problems with up to 2¹⁶⁹⁴ scenarios to within an estimated 1.0% of optimality. Furthermore, a surprising observation is that the number of optimality cuts required to solve the approximating problem to optimality does not significantly increase with the size of the sample. Therefore, the observed computation times needed to find optimal solutions to the approximating problems grow only linearly with the sample size. As a result, we are able to find provably near-optimal solutions to these difficult stochastic programs using only a moderate amount of computation time.     

On a compromise social choice correspondence

This paper analyzes the compromise social choice correspondence derived from the τ-value of digraph games. Monotonicity of this correspondence is shown. A connection between several properties of social choice correspondences based on game theoretical solutions and game theoretical properties of the underlying solutions is given. Applications to several game theoretic solutions are provided.     

Stability and slightly supercritical oscillatory regimes of natural convection in a 8:1 cavity: solution of the benchmark problem by a global Galerkin method

The global Galerkin method is applied to the benchmark problem that considers an oscillatory regime of convection of air in a tall two‐dimensional rectangular cavity. The three most unstable modes of the linearized system of the Boussinesq equations are studied. The converged values of the critical Rayleigh numbers together with the corresponding oscillation frequencies are calculated for each mode. The oscillatory flow regimes corresponding to each of the three modes are approximated asymptotically. No direct time integration is applied. Good agreement with the previously published results obtained by solution of the time‐dependent Boussinesq equations is reported. Copyright © 2004 John Wiley & Sons, Ltd.     

A laser Doppler anemometry technique for Reynolds stresses measurement

A technique is described for the measurement of all components of mean velocity and Reynolds stresses, in a complex turbulent flow where achieving coincidence data acquisition is difficult. The method is based on data recorded using four orientations of the laser probe. It is shown that the measurement errors are not the same for all the components of the Reynolds tensor, but they are sufficiently small to give a good accuracy. An application to a turbomachinery flow is given to illustrate the method.     

Nano-tribological study on a super-hydrophobic film formed on rough aluminium substrates

A novel super-hydrophobic stearic acid (STA) film with a water contact angle of 166^o was prepared by chemical adsorption on aluminum wafer coated with polyethyleneimine (PEI) film. The micro-tribological behavior of the super-hydrophobic STA monolayer was compared with that of the polished and PEI-coated Al surfaces. The effect of relative humidity on the adhesion and friction was investigated as well. It was found that the STA monolayer showed decreased friction, while the adhesive force was greatly decreased by increasing the surface roughness of the Al wafer to reduce the contact area between the atomic force microscope (AFM) tip and the sample surface to be tested. Thus the friction and adhesion of the Al wafer was effectively decreased by generating the STA monolayer, which indicated that it could be feasible and rational to prepare a surface with good adhesion resistance and lubricity by properly controlling the surface morphology and the chemical composition. Both the adhesion and friction decreased as the relative humidity was lowered from 65% to 10%, though the decrease extent became insignificant for the STA monolayer. The project supported by the National Natural Science Foundation of China (50375151, 50323007, 10225209) and the Chinese Academy of Sciences (KJCX-SW-L2)