Synthesis and structures of dialkyl zirconium complexes with an [OSSO]-type bis(phenolate) ligand bearing a trans-1,2-cyclooctanediylbis(thio) unit

Dimethyl and bis[(trimethylsilyl)methyl] zirconium complexes ([OSSO]ZrR₂) [4, R = Me; 5, R = CH₂SiMe₃] having [OSSO]-type bis(phenolato) ligand 1 based on the trans-1,2-cyclooctanediylbis(thio) core have been synthesized by the reactions of the corresponding dichloro zirconium complex 3 with 2 equiv. of MeMgBr and Me₃SiCH₂MgCl, respectively, in Et₂O/toluene at −78 °C. The molecular structures of these complexes 3-5 were characterized by NMR spectroscopy, elemental analyses, and X-ray crystallography. ¹H and ¹³C NMR data of complexes 3-5 exhibited that they took the C₂-symmetry in solution in the NMR time scale. In the crystal structures of 3-5, each zirconium center lies at the center of a distorted octahedral coordination sphere with cis sulfur atoms and trans oxygen atoms, which adopts a cis-α [(Λ^∗,S^∗,S^∗)] configuration.     

Syntheses of prodelphinidin B1, B2, and B4 and their antitumor activities against human PC-3 prostate cancer cell lines

Total synthesis of prodelphinidin B1, B2, and B4 has been accomplished. The key step is Lewis acid-mediated equimolar condensations between an epigallocatechin and/or a gallocatechin nucleophile and an epigallocatechin and/or a gallocatechin electrophile. The antitumor effects of synthetic prodelphinidin B1–B4 against human PC-3 prostate cancer cell lines have been investigated. These compounds showed significant antitumor effects. Their activity seemed to be little bit stronger than EGCG and prodelphinidin B3, known antitumor agent.     

Bacterial memetic algorithm for offline path planning of mobile robots

The goal of the path planning problem is to determine an optimal collision-free path between a start and a target point for a mobile robot in an environment surrounded by obstacles. This problem belongs to the group of combinatorial optimization problems which are approached by modern optimization techniques such as evolutionary algorithms. In this paper the bacterial memetic algorithm is proposed for path planning of a mobile robot. The objective is to minimize the path length and the number of turns without colliding with an obstacle. The representation used in the paper fits well to the algorithm. Memetic algorithms combine evolutionary algorithms with local search heuristics in order to speed up the evolutionary process. The bacterial memetic algorithm applies the bacterial operators instead of the genetic algorithm??s crossover and mutation operator. One advantage of these operators is that they easily can handle individuals with different length. The method is able to generate a collision-free path for the robot even in complicated search spaces. The proposed algorithm is tested in real environment.     

A quest for the integrable equation in 3+1 dimensions

The L and T operators of the Korteweg-de Vries equation are modified to seek a (3+1)-dimensional integrable equation. However, the Lax equation in this case is eventually reduced to a (2+1)-dimensional equation. We also propose other modified equations and their Lax pairs. A similar attempt is made to derive a higher-dimensional Harry Dym (HD) equation. As a result, a new (2+1)-dimensional HD equation is presented. Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 122, No. 2, pp. 305–309, February, 2000.