Synthesis, structure and solution chemistry of a family of dinuclear hydrazonato-vanadium(V) complexes with [OV(mu-O)VO](4+) core

Dinuclear trioxidic [{VOL}(2)mu-O] (1-4) complexes were synthesized from the reaction of [(VO)-O-IV(acac)(2)] with an equimolar amount of H2L [H2L is the general abbreviation of hydrazone ligands (H2L1-4) derived from the condensation of benzoyl hydrazine with either 2-hydroxyacetophenone or its para substituted derivatives] in acetone or CH2Cl2 or acetonitrile. These V2O3L2 complexes were also obtained from the reaction of VOSO4 with H2L in the presence of two equivalents sodium acetate in aqueous-methanolic (50% V/V) medium and also from the decomposition of [(VO)-O-IV(L)(bipy/phen)] complexes in CH2Cl2 Solution. Black monoclinic crystals of 2 and 4 with C2/c space group were obtained from the reaction of [(VO)-O-IV(acac)(2)], respectively, with H2L2 and H2L4 in acetone in which the respective ligands are bonded meridionally to vanadium in their fully deprotonated enol forms. The V-O bond lengths follow the order: V-O(oxo) < V-O(oxo-bridged) < V-O(phenolate) < V-O(enolate). Complexes (1-4) are diamagnetic exhibiting LMCT transition band near 380 nm in CH2Cl2 solution and they are electroactive displaying a quasi-reversible reduction peak in the 0.14-0.30 V versus SCE region. The and the reduction peak potential (E-p(c)) values show linear relationships with the Hammett constant (sigma) of the substituents in the hydrazone ligands. These dinuclear complexes are converted to the corresponding mononuclear cis dioxo complexes K(H2O)(+)[(VO2)-O-V(L)](-) (5-8) and mixed-ligand [(VO)-O-V(L)(hq)] complexes on reaction, respectively, with two equivalents KOH in methanol and two equivalents 8-hydroxyquinoline (Hhq) in CHCl3. Ascorbic acid reduces the dioxovanadium(V) complexes reversibly under aerobic condition. (C) 2008 Elsevier Ltd. All rights reserved.

Using a water-soluble melamine-formaldehyde resin to improve the hardness of Norway spruce wood

Samples of Norway spruce wood were impregnated with a water-soluble melamine formaldehyde resin by using short-term vacuum treatment and long-term immersion, respectively. By means of Fourier transform infrared (FTIR) spectroscopy and UV microspectrophotometry, it was shown that only diffusion during long-term immersion leads to sufficient penetration of melamine resin into the wood structure, the flow of liquids in Norway spruce wood during vacuum treatment being greatly hindered by aspirated pits. After an immersion in aqueous melamine resin solution for 3 days, the resin had penetrated to a depth > 4 mm, which, after polymerization of the resin, resulted in an improvement of hardness comparable to the hardwood beech. A finite element model describing the effect of increasing depth of modification on hardness demonstrated that under the test conditions chosen for this study, a minimum impregnation depth of 2 mm is necessary to achieve an optimum increase in hardness. (C) 2004 Wiley Periodicals, Inc.

Description of a "Phoenix" phenomenon in the growth of Campylobacter jejuni at temperatures close to the minimum for growth

When Campylobacter jejuni cultures that had been grown in broth at 39degreesC were subcultured into fresh medium at 30degreesC, there was a transient period of growth followed by a decline in viable-cell numbers before growth resumed once more. We propose that this complex behavior is the net effect of the growth of inoculum cells followed by a loss of viability due to oxidative stress and the subsequent emergence of a spontaneously arising mutant population that takes over the culture.

Modelling oil absorption during post-frying cooling - II: solution of the mathematical model, model testing and simulations

The mathematical models that describe the immersion-frying period and the post-frying cooling period of an infinite slab or an infinite cylinder were solved and tested. Results were successfully compared with those found in the literature or obtained experimentally, and were discussed in terms of the hypotheses and simplifications made. The models were used as the basis of a sensitivity analysis. Simulations showed that a decrease in slab thickness and core heat capacity resulted in faster crust development. On the other hand, an increase in oil temperature and boiling heat transfer coefficient between the oil and the surface of the food accelerated crust formation. The model for oil absorption during cooling was analysed using the tested post-frying cooling equation to determine the moment in which a positive pressure driving force, allowing oil suction within the pore, originated. It was found that as crust layer thickness, pore radius and ambient temperature decreased so did the time needed to start the absorption. On the other hand, as the effective convective heat transfer coefficient between the air and the surface of the slab increased the required cooling time decreased. In addition, it was found that the time needed to allow oil absorption during cooling was extremely sensitive to pore radius, indicating the importance of an accurate pore size determination in future studies.

Recovery of norbixin from a raw extraction solution of annatto pigments using colloidal gas aphrons (CGAs)

Annatto dyes are widely used in food and are finding increasing interest also for their application in the pharmaceutical and cosmetics industry. Bixin is the main pigment extracted from annatto seeds and accounts for 80% of the carotenoids in the outer coat of the seeds; norbixin being the water-soluble form of the bixin. Typically annatto dyes are extracted from the seeds by mechanical means or solutions of alkali, edible oil or organic solvents, or a combination of the two depending on the desired final product. In this work CGAs are investigated as an alternative separation method for the recovery of norbixin from a raw extraction solution of annatto pigments in KOH. A volume of CGAs generated from a cationic surfactant (CTAB) solution is mixed with a volume of annatto solution and when the mixture is allowed to settle it separates into the top aphron phase and the bottom liquid phase. Potassium norbixinate presented in the annatto solution will interact with the surfactant in the aphron phase, which results in the effective separation of norbixin. Recovery= 94% was achieved at a CTAB to norbixin molar ratio of 3.3. In addition a mechanism of separation is proposed here based on the separation results with the cationic surfactant and an anionic surfactant (bis-2-ethyl hexyl sulfosuccinate, AOT) and measurements of surfactant to norbixin ratio in the aphron phase; electrostatic interactions between the surfactant and norbixin molecules result in the fort-nation of a coloured complex and effective separation of norbixin. (c) 2005 Elsevier B.V. All rights reserved.

A new algorithm for OFDM joint data detection and phase noise cancellation

This paper proposes a new iterative algorithm for OFDM joint data detection and phase noise (PHN) cancellation based on minimum mean square prediction error. We particularly highlight the problem of "overfitting" such that the iterative approach may converge to a trivial solution. Although it is essential for this joint approach, the overfitting problem was relatively less studied in existing algorithms. In this paper, specifically, we apply a hard decision procedure at every iterative step to overcome the overfitting. Moreover, compared with existing algorithms, a more accurate Pade approximation is used to represent the phase noise, and finally a more robust and compact fast process based on Givens rotation is proposed to reduce the complexity to a practical level. Numerical simulations are also given to verify the proposed algorithm.

A knowledge-based evolution strategy for the multi-objective minimum spanning tree problem

A fast Knowledge-based Evolution Strategy, KES, for the multi-objective minimum spanning tree, is presented. The proposed algorithm is validated, for the bi-objective case, with an exhaustive search for small problems (4-10 nodes), and compared with a deterministic algorithm, EPDA and NSGA-II for larger problems (up to 100 nodes) using benchmark hard instances. Experimental results show that KES finds the true Pareto fronts for small instances of the problem and calculates good approximation Pareto sets for larger instances tested. It is shown that the fronts calculated by YES are superior to NSGA-II fronts and almost as good as those established by EPDA. KES is designed to be scalable to multi-objective problems and fast due to its small complexity.

A hybridised evolutionary algorithm for multi-criterion minimum spanning tree problems

A hybridised and Knowledge-based Evolutionary Algorithm (KEA) is applied to the multi-criterion minimum spanning tree problems. Hybridisation is used across its three phases. In the first phase a deterministic single objective optimization algorithm finds the extreme points of the Pareto front. In the second phase a K-best approach finds the first neighbours of the extreme points, which serve as an elitist parent population to an evolutionary algorithm in the third phase. A knowledge-based mutation operator is applied in each generation to reproduce individuals that are at least as good as the unique parent. The advantages of KEA over previous algorithms include its speed (making it applicable to large real-world problems), its scalability to more than two criteria, and its ability to find both the supported and unsupported optimal solutions.

A new solution of the rendering equation with stratified Monte Carlo approach

This paper is turned to the advanced Monte Carlo methods for realistic image creation. It offers a new stratified approach for solving the rendering equation. We consider the numerical solution of the rendering equation by separation of integration domain. The hemispherical integration domain is symmetrically separated into 16 parts. First 9 sub-domains are equal size of orthogonal spherical triangles. They are symmetric each to other and grouped with a common vertex around the normal vector to the surface. The hemispherical integration domain is completed with more 8 sub-domains of equal size spherical quadrangles, also symmetric each to other. All sub-domains have fixed vertices and computable parameters. The bijections of unit square into an orthogonal spherical triangle and into a spherical quadrangle are derived and used to generate sampling points. Then, the symmetric sampling scheme is applied to generate the sampling points distributed over the hemispherical integration domain. The necessary transformations are made and the stratified Monte Carlo estimator is presented. The rate of convergence is obtained and one can see that the algorithm is of super-convergent type.

Distributed space-time block coding for 3 and 4 relay nodes: Imperfect synchronisation and a solution

Most research on distributed space time block coding (STBC) has so far focused on the case of 2 relay nodes and assumed that the relay nodes are perfectly synchronised at the symbol level. By applying STBC to 3-or 4-relay node systems, this paper shows that imperfect synchronisation causes significant performance degradation to the conventional detector. To this end, we propose a new STBC detection solution based on the principle of parallel interference cancellation (PIC). The PIC detector is moderate in computational complexity but is very effective in suppressing the impact of imperfect synchronisation.

Parallel Hybrid Monte Carlo Algorithms for Matrix Computations

In this paper we consider hybrid (fast stochastic approximation and deterministic refinement) algorithms for Matrix Inversion (MI) and Solving Systems of Linear Equations (SLAE). Monte Carlo methods are used for the stochastic approximation, since it is known that they are very efficient in finding a quick rough approximation of the element or a row of the inverse matrix or finding a component of the solution vector. We show how the stochastic approximation of the MI can be combined with a deterministic refinement procedure to obtain MI with the required precision and further solve the SLAE using MI. We employ a splitting A = D – C of a given non-singular matrix A, where D is a diagonal dominant matrix and matrix C is a diagonal matrix. In our algorithm for solving SLAE and MI different choices of D can be considered in order to control the norm of matrix T = D –1C, of the resulting SLAE and to minimize the number of the Markov Chains required to reach given precision. Further we run the algorithms on a mini-Grid and investigate their efficiency depending on the granularity. Corresponding experimental results are presented.

Design of a minimum variance multiple input-multiple output neuro self-tuning proportional-integral-derivative controller for non-linear dynamic systems

In this study a minimum variance neuro self-tuning proportional-integral-derivative (PID) controller is designed for complex multiple input-multiple output (MIMO) dynamic systems. An approximation model is constructed, which consists of two functional blocks. The first block uses a linear submodel to approximate dominant system dynamics around a selected number of operating points. The second block is used as an error agent, implemented by a neural network, to accommodate the inaccuracy possibly introduced by the linear submodel approximation, various complexities/uncertainties, and complicated coupling effects frequently exhibited in non-linear MIMO dynamic systems. With the proposed model structure, controller design of an MIMO plant with n inputs and n outputs could be, for example, decomposed into n independent single input-single output (SISO) subsystem designs. The effectiveness of the controller design procedure is initially verified through simulations of industrial examples.

Minimum stable convergence criteria for stochastic diffusion search

An analysis of Stochastic Diffusion Search (SDS), a novel and efficient optimisation and search algorithm, is presented, resulting in a derivation of the minimum acceptable match resulting in a stable convergence within a noisy search space. The applicability of SDS can therefore be assessed for a given problem.