A new vanadium(V) complex, [VOL(OMe)(MeOH)]•MeOH (1•MeOH), was prepared by the reaction of VO(acac) 2 with 2-chloro-N'-(5-fluoro-2-hydroxybenzylidene)benzohydrazide (H 2 L) in methanol. By addition of salicylhydroxamic acid (HSHA) to the methanolic solution of 1, a new salicylhydroxamate-coordinated vanadium(V) complex, [VOL(SHA)]•H 2 O (2•H 2 O), was obtained. Both complexes were characterized by elemental analysis, infrared spectroscopy, thermal analysis and single crystal X-ray diffraction. Complex 1 crystallizes with methanol molecule as a solvate, and complex 2 as a monohydrate. The V atoms in the complexes are in octahedral coordination. In the crystal structure of 1•MeOH, the vanadium complexes are linked by methanol solvate molecules through intermolecular O-H•••N and O-H•••O hydrogen bonds to form chains along the c axis. In the crystal structure of 2•H 2 O, the vanadium complexes are linked by water molecules through intermolecular O-H•••O hydrogen bonds, to form 1D chains along the a axis. The chains are further linked through intermolecular O-H•••N and O-H•••O hydrogen bonds in the c direction to form 2D layers. The antimicrobial activities of the complexes against K. pneumoniae, S. aureus, P. aeroginosa, E. coli, and B. subtilis were investigated.
We consider in this paper the problem of slicing floorplan design with boundary-constrained modules. We develop a quadratic-time method that correctly transforms a slicing floorplan into one that satisfies all given boundary constraints. The transformation method is incorporated into our floorplanning algorithm which employs the simulated annealing technique to seek for a possibly best solution. Unlike any other existing algorithm such as the one in [10], our floorplanning algorithm is always able to generate solutions satisfying all given boundary constraints. Furthermore, the experimental results indicate that our floorplanning algorithm can also generate solutions with smaller area and interconnect wirelength than the algorithm in [10].
In a fixed-rate vector quantization system, an image is divided into smaller blocks, and each block is usually independently encoded by an index of the same length that points to the closest codevector in the codebook. Recently, an algorithm, called search-order coding, has been proposed to further reduce the bit rate by encoding the indexes but without introducing any extra encoding distortion. In this paper, we present an improved algorithm that extends the idea of the search-order coding algorithm by encoding the indexes pair by pair (instead of one by one). With this extension, four types of search results are considered. The simulation results indicate that our algorithm is able to achieve the bit rate up to 5.74% lower than the search-order coding algorithm.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.