Synthesis of polynitrogenated analogues of glucopyranoses from levoglucosan

Polynitrogenated analogues of glucopyranoses were synthesised from levoglucosan. These compounds are useful intermediates for the synthesis of new aminoglycoside mimetics.     

Signal classification through multifractal analysis and complex domain neural networks

This paper describes a system capable of classifying stochastic self-affine nonstationary signals produced by nonlinear systems. The classification and the analysis of these signals are important because these are generated by many real-world processes. The first stage of the signal classification process entails the transformation of the signal into the multifractal dimension domain, through the computation of the variance fractal dimension trajectory (VFDT). Features can then be extracted from the VFDT using a Kohonen self-organizing feature map. The second stage involves the use of a complex domain neural network and a probabilistic neural network to determine the class of a signal based on these extracted features. The results of this paper show that these techniques can be successful in creating a classification system which can obtain correct classification rates of about 87% when performing classification of such signals without knowing the number of classes.     

First synthesis of arylpyrrolo- and pyrazolopyrrolizinones as useful agents with potential biological interest

Novel arylpyrrolo- and pyrazolopyrrolizinones were prepared in three or four steps starting from aminoarylpyrrole and pyrazole carboxylates through the cyclisation of a Vilsmeier-Haack intermediate. This synthesis was enhanced by diverse N-protections of the aza-heterocycle and furnish new series with potential biological interest.     

COSEARCH: A Parallel Cooperative Metaheuristic

In order to design a well-balanced metaheuristic for robustness, we propose the COSEARCH approach which manages the cooperation of complementary heuristic methods via an adaptive memory which contains a history of the search already done. In this paper, we present the idiosyncrasies of the COSEARCH approach and its application for solving large scale instances of the quadratic assignment problem (QAP). We propose an original design of the adaptive memory in order to focus on high quality regions of the search and avoid attractive but deceptive areas. For the QAP, we have hybridized three heuristic agents of complementary behaviours: a Tabu Search is used as the main search algorithm, a Genetic Algorithm is in charge of the diversification and a Kick Operator is applied to intensify the search. The evaluations have been executed on large scale network of workstations via a parallel environment which supports fault tolerance and adaptive dynamic scheduling of tasks.