Ultrahigh‐molecular‐weight‐polyethylene‐fiber surface treatment by electron‐beam‐irradiation‐induced graft polymerization and its effect on adhesion in a styrene–butadiene rubber matrix

Aiming to develop a high‐performance fiber‐reinforced rubber from styrene–butadiene rubber (SBR), we applied a special technique using electron‐beam (EB)‐irradiation‐induced graft polymerization to ultrahigh‐molecular‐weight‐polyethylene (UHMWPE) fibers. The molecular interaction between the grafted UHMWPE fibers and an SBR matrix was studied through the evaluation of the adhesive behavior of the fibers in the SBR matrix. Although UHMWPE was chemically inert, two monomers, styrene and N‐vinyl formamide (NVF), were examined for graft polymerization onto the UHMWPE fiber surface. Styrene was not effective, but NVF was graft‐polymerized onto the UHMWPE fibers with this special method. A methanol/water mixture and dioxane were used as solvents for NVF, and the effects of the solvents on the grafting percentage of NVF were also examined. The methanol/water mixture was more effective. A grafting percentage of 16.4% was the highest obtained. This improved the adhesive force threefold with respect to that of untreated UHMWPE fibers. These results demonstrated that EB irradiation enabled graft polymerization to occur even on the inert surface of UHMWPE fibers. However, the mechanical properties of the fibers could be compromised according to the dose of EB irradiation. © 2004 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 42: 2595–2603, 2004     

Optimality Conditions and Geometric Properties of a Linear Multilevel Programming Problem with Dominated Objective Functions

In this paper, a model of a linear multilevel programming problem with dominated objective functions (LMPPD(l)) is proposed, where multiple reactions of the lower levels do not lead to any uncertainty in the upper-level decision making. Under the assumption that the constrained set is nonempty and bounded, a necessary optimality condition is obtained. Two types of geometric properties of the solution sets are studied. It is demonstrated that the feasible set of LMPPD(l) is neither necessarily composed of faces of the constrained set nor necessarily connected. These properties are different from the existing theoretical results for linear multilevel programming problems.     

New heuristics for over-constrained flight to gate assignments

We consider the over-constrained Airport Gate Assignment Problem where the number of flights exceed the number of gates available, and where the objectives are to minimize the number of ungated flights and the total walking distances. The problem is formulated as a binary quadratic programming problem. We design a greedy algorithm and use a Tabu Search meta-heuristic to solve the problem. The greedy algorithm minimizes ungated flights while we devise a new neighbourhood search technique, the Interval Exchange Move, which allows us flexibility in seeking good solutions, especially when flight schedules are dense in time. Experiments conducted give good results.     

A flexible and generic approach to dynamic modelling of supply chains

In this paper, we present a new modelling approach for realistic supply chain simulation. The model provides an experimental environment for informed comparison between different supply chain policies. A basic simulation model for a generic node, from which a supply chain network can be built, has been developed using an object-oriented approach. This generic model allows the incorporation of the information and physical systems and decision-making policies used by each node. The object-oriented approach gives the flexibility in specifying the supply chain configuration and operation decisions, and policies. Stochastic simulations are achieved by applying Latin Supercube Sampling to the uncertain variables in descending order of importance, which reduces the number of simulations required. We also present a case study to show that the model is applicable to a real-life situation for dynamic stochastic studies.     

Crossdocking—JIT scheduling with time windows

In this paper, we study a problem central to crossdocking that aims to eliminate or minimize storage and order picking activity using JIT scheduling. The problem is modelled naturally as a machine scheduling problem. As the problem is NP-hard, and for real-time applications, we designed and implemented two heuristics. The first uses Squeaky Wheel Optimization embedded in a Genetic Algorithm and the second uses Linear Programming within a Genetic Algorithm. Both heuristics offer good solutions in experiments where comparisons are made with the CPLEX solver.     

On a class of preconditioners for solving the Helmholtz equation

In 1983, a preconditioner was proposed [J. Comput. Phys. 49 (1983) 443] based on the Laplace operator for solving the discrete Helmholtz equation efficiently with CGNR. The preconditioner is especially effective for low wavenumber cases where the linear system is slightly indefinite. Laird [Preconditioned iterative solution of the 2D Helmholtz equation, First Year's Report, St. Hugh's College, Oxford, 2001] proposed a preconditioner where an extra term is added to the Laplace operator. This term is similar to the zeroth order term in the Helmholtz equation but with reversed sign. In this paper, both approaches are further generalized to a new class of preconditioners, the so-called “shifted Laplace” preconditioners of the form Δφ−k²φ with . Numerical experiments for various wavenumbers indicate the effectiveness of the preconditioner. The preconditioner is evaluated in combination with GMRES, Bi-CGSTAB, and CGNR.     

Heavy Majorana neutrinos in e + e − → W + W−

In this paper we investigate the effects of heavy Majorana neutrinos in the reaction e ⁺ e ^? → W ⁺ W ^?. We consider neutrino masses in the 1–10 TeV region. We show that at LEP II and NLC energies it is possible to use this processes to verify indirect evidence of heavy neutral particles with mixing angles of the order sin² α = 0.01. We discuss the unitarity restrictions that can be obtained for vector singlet and fermion-mirror-fermion models.