pKa values of aqua ligands of platinum (II) anticancer complexes: [1H, 15N] and 195Pt NMR Studies of cis- and trans- [PtCl2 (NH3) (Cyclohexylamine)]

Syntheses and NMR studies are reported of two 15N-labelled Pt(II) complexes of anticancer interest: cis-PtCl2(15NH3)(c-C6H1115NH2), a metabolite of the orally-active Pt(IV) complex cis,trans,cis-[PtCl2(acetate)2(c-C6H11NH2)(NH3), and trans-[PtCl2(15NH3)(c-C6H1115NH2), a reduction product of the active Pt(IV) complex trans,trans,trans-[PtCl2(OH)2(c-C6H11NH2). For cis-[PtCl2(15NH3)(c-C6H1115NH2), hydrolysis was faster for the chloride ligand trans to cyclohexylamine, and the pKa values determined by [1H, 15N NMR spectroscopy for the two cis monoaqua isomers were the same (6.73). The trans monoaqua complex was a stronger acid with pKa of 5.4 (determined by 195Pt NMR). For the cis diaqua complex, pKa values of 5.68 and 7.68 were determined.

Convenient synthetic routes to bidentate and monodentate 2-, 3- and 4-pyridyl phosphines: potentially useful ligands for water-soluble complex catalysts

The monodentate and bidentate pyridyl phosphines, PR3 and R2P(CH2)2PR2, where R=3- or 4-pyridyl can be prepared in high yields by treatment of butyllithium/TMEDA/3- or 4-bromopyridine with PCl3 or Cl2P(CH2)2PCl2 at low temperature. 1,2-Bis(di-2-pyridylphosphino)ethane is conveniently synthesised by an alternative route involving reaction of 1,2-dibromoethane with lithium di-2-pyridylphosphide.

[1H,15N] N.M.R. Kinetic Studies of Reactions of cis- and trans-[PtCl2(15NH3)(c-C6H1115NH2)] with Guanosine 5'-Monophosphate

cis-[PtCl2(15NH3)(c-C6H11NH2)] is an active metabolite of the oral platinum(IV) anticancer drug cis,trans,cis-[PtCl2(CH3CO2)2(NH2)(c-C6H11NH2)]. Since it is likely that guanine bases on DNA are targets for this drug, we have analysed the kinetics of reaction of this platinum(II) metabolite with guanosine 5′-monophosphate (5′-GMP) at 310 K, pH 7, using [1H, 15N] n.m.r. methods. Reactions of the trans isomer are reported for comparison. The reactions proceed via aquated intermediates, and, for the cis isomer, the rates of aquation and substitution of H2O by 5′-GMP are 2-5 times faster trans to the amine ligand (c-C6H11NH2) compared to trans to NH3 for both the first and second steps. For the trans complex, the first aquation step is c. 3 times faster than for the cis complex, as expected from the higher trans influence of Cl¯, whereas the rate of the second aquation step (trans to N7 of 5′-GMP) is comparable to that trans to NH3. These findings have implications for the courses of reactions with DNA.

The thermal desulfination of allylic sulfonyl halides

Allylic sulfonyl halides can be generated by halogenolysis of the corresponding triorganotin sulfinates. Allylic sulfonyl bromides and iodides undergo a first order, thermal desulfination with allylic rearrangement to yield the corresponding allylic halides. The desulfination of a cyclic allylic sulfonyl bromide is stereospecific, proceeding with T-syn bromine migration.

Multilevel refinement for the vehicle routing problem

Multilevel approaches to computational problems are pervasive across many areas of applied mathematics and scientific computing. The multilevel paradigm uses recursive coarsening to create a hierarchy of approximations to the original problem, then an initial solution is found for the coarsest problem and iteratively refined and improved at each level, coarsest to finest. The solution process is aided by the global perspective (or `global view') imparted to the optimisation by the coarsening. This paper looks at their application to the Vehicle Routing Problem.

Multilevel refinement strategies for the capacity vehicle routing problem

We discuss the application of the multilevel (ML) refinement technique to the Vehicle Routing Problem (VRP), and compare it to its single-level (SL) counterpart. Multilevel refinement recursively coarsens to create a hierarchy of approximations to the problem and refines at each level. A SL algorithm, which uses a combination of standard VRP heuristics, is developed first to solve instances of the VRP. A ML version, which extends the global view of these heuristics, is then created, using variants of the construction and improvement heuristics at each level. Finally some multilevel enhancements are developed. Experimentation is used to find suitable parameter settings and the final version is tested on two well-known VRP benchmark suites. Results comparing both SL and ML algorithms are presented.

The application of multilevel refinement to the vehicle routing problem

We discuss the application of the multilevel (ML) refinement technique to the Vehicle Routing Problem (VRP), and compare it to its single-level (SL) counterpart. Multilevel refinement recursively coarsens to create a hierarchy of approximations to the problem and refines at each level. A SL heuristic, termed the combined node-exchange composite heuristic (CNCH), is developed first to solve instances of the VRP. A ML version (the ML-CNCH) is then created, using the construction and improvement heuristics of the CNCH at each level. Experimentation is used to find a suitable combination, which extends the global view of these heuristics. Results comparing both SL and ML are presented.

Multilevel approaches applied to the capacitated clustering problem

This paper presents two multilevel refinement algorithms for the capacitated clustering problem. Multilevel refinement is a collaborative technique capable of significantly aiding the solution process for optimisation problems. The central methodologies of the technique are filtering solutions from the search space and reducing the level of problem detail to be considered at each level of the solution process. The first multilevel algorithm uses a simple tabu search while the other executes a standard local search procedure. Both algorithms demonstrate that the multilevel technique is capable of aiding the solution process for this combinatorial optimisation problem.

Model-based pilot and data power adaptation in psam with periodic delayed feedback

We consider the optimum design of pilot-symbol-assisted modulation (PSAM) schemes with feedback. The received signal is periodically fed back to the transmitter through a noiseless delayed link and the time-varying channel is modeled as a Gauss-Markov process. We optimize a lower bound on the channel capacity which incorporates the PSAM parameters and Kalman-based channel estimation and prediction. The parameters available for the capacity optimization are the data power adaptation strategy, pilot spacing and pilot power ratio, subject to an average power constraint. Compared to the optimized open-loop PSAM (i.e., the case where no feedback is provided from the receiver), our results show that even in the presence of feedback delay, the optimized power adaptation provides higher information rates at low signal-to-noise ratios (SNR) in medium-rate fading channels. However, in fast fading channels, even the presence of modest feedback delay dissipates the advantages of power adaptation.

Mutual information performance of differential MPSK detection over time-varying channels

This paper provides mutual information performance analysis of multiple-symbol differential WSK (M-phase shift keying) over time-correlated, time-varying flat-fading communication channels. A state space approach is used to model time correlation of time varying channel phase. This approach captures the dynamics of time correlated, time-varying channels and enables exploitation of the forward-backward algorithm for mutual information performance analysis. It is shown that the differential decoding implicitly uses a sequence of innovations of the channel process time correlation and this sequence is essentially uncorrelated. It enables utilization of multiple-symbol differential detection, as a form of block-by-block maximum likelihood sequence detection for capacity achieving mutual information performance. It is shown that multiple-symbol differential ML detection of BPSK and QPSK practically achieves the channel information capacity with observation times only on the order of a few symbol intervals

Adaptive ordering for imperfect successive decision feedback multiuser detection

A method for selecting the order in which the users are detected in communication systems employing adaptive successive decision feedback multiuser detection is proposed. Systems employing channel coding without the assumption of perfect decision feedback are analyzed. The method is based on the mean squared error (MSE) measurements during a training period for each user. The analysis' shows that the method delivers BER performance improvement relative to other previously proposed ordering methods