Electroneutrality coupling of electron transfer at an electrode surface and ion transfer across the interface between thin-layer of 1-octyl-3-methylimidazolium bis(perfluoroalkylsulfonyl)imide covering the electrode surface and an outer electrolyte solution.

The electrode reaction of decamethylferrocene (DMFc) dissolved in a thin layer of a room-temperature molten salt (RTMS), 1-octyl-3-methylimidazolium bis(trifluoromethylsulfonyl)imide (C8mimC1C1N) or 1-octyl-3-methylimidazolium bis(pentafluoroethylsulfonyl)imide (C8mimC2C2N), on a self-assembled monolayer-modified gold electrode is coupled with the ion transfer across the interface between the RTMS and the outer aqueous solution (W) to give a voltammogram whose shape resembles a voltammogram of a simple one-electron transfer process. The electroneutrality of the RTMS layer during the oxidation of DMFc to decamethylferricenium ion is maintained by the concomitant dissolution of C8mim+ ion from the RTMS phase to the W phase, and the reduction of decamethylferricenium ion to DMFc is accompanied by the transfer of either C1C1N- or C2C2N- from RTMS to W. The midpoint potential of the voltammogram varies with the concentration of the salt in the aqueous phase, C8mimCl or LiCnCnN (n = 1 or 2), in a Nernstian manner, showing that the phase-boundary potential between the RTMS and the W is controlled by the partition of these ions. Although the phase-boundary potential across the RTMS / W interface is Nernstian with respect to the ions common to both phases at the equilibrium, the polarization at the RTMS / W interface under current flow distorts the shape of the voltammograms, resulting in a wider peak separation in the voltammogram.     

Improved detectability with a polymer-based trapping device in rapid HPLC analysis for ultra-low levels of bisphenol A (BPA) in environmental samples.

A new high-performance liquid chromatography (HPLC) method has been developed to detect ultra-low concentrations of bisphenol-A (BPA) (below 1 ng/L (ppt)) using column switching electrochemical detection (ECD). The results were superior to those obtained from manual pretreatment procedure with membrane stationary phase. BPA is inherently ubiquitous in the environment, including tools and solvents used for its analysis; to obtain meaningful results, therefore, the concentration of the overall BPA contamination must be below the detection limit for BPA using the analytical system. Therefore, purified water for preparing the standard BPA solution must be filtered with a hydrophobic membrane to suppress BPA background levels of contamination. In addition, we investigated methods for effectively preserving environmental water containing BPA. The addition of a small amount of ethylenediaminetetraacetic acid (EDTA) provided good recovery even after overnight storage. By employing these precautionary measures and procedures to reduce BPA contamination from the analytical procedure, we could accurately determine l(-10) ppt of BPA in environmental water samples using a column switching HPLC system.     

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.