Regioselective construction of polysubstituted benzene ring from Baylis-Hillman adduct via [4+2] annulation strategy

A new and regioselective [4+2] benzannulation protocol toward polysubstituted benzenes was developed. Nitroalkane derivative, which was prepared from Baylis-Hillman adduct, served as the four-carbon unit and Michael acceptor as a two-carbon unit.     

Wilcoxon signed rank test using ranked-set sample

Ranked-set sampling is useful when measurements are destructive or costly to obtain but ranking of the observations is relatively easy. The Wilcoxon signed rank test statistic based on the ranked-set sample is considered. We compared the asymptotic relative efficiencies of the RSS Wilcoxon signed rank test statistic with respect to the SRS Wilcoxon signed rank test statistic and the RSS sign test statistic. Throughout the ARE’s, the proposed test statistic is superior to the SRS Wilcoxon signed rank test statistic and the RSS sign test statistic.     

A simulated annealing algorithm for resource constrained project scheduling problems

This paper presents a simulated annealing algorithm for resource constrained project scheduling problems with the objective of minimising makespan. In the search algorithm, a solution is represented with a priority list, a vector of numbers each of which denotes the priority of each activity. In the algorithm, a priority scheduling method is used for making a complete schedule from a given priority list (and hence a project schedule is defined by a priority list). The search algorithm is applied to find a priority list which corresponds to a good project schedule. Unlike most of priority scheduling methods, in the suggested algorithm some activities are delayed on purpose so as to extend search space. Solutions can be further improved by delaying certain activities, since non-delay schedules are not dominant in the problem (the set of non-delay schedules does not always include an optimal solution). The suggested algorithm is flexible in that it can be easily applied to problems with an objective function of a general form and/or complex constraints. The performance of the simulated annealing algorithm is compared with existing heuristics on problems prepared by Patterson and randomly generated test problems. Computational results showed that the suggested algorithm outperformed existing ones.     

pH-inducible beta-glucosidase and beta-glucuronidase of intestinal bacteria.

beta-Glucosidase and beta-glucuronidase of human and rat fecal bacteria were induced by cultivation in alkaline media although their growths were not affected. When a bacterium isolated from human feces producing each enzyme was cultured in a medium at pH 5 for 12-15 h and then adjusted to pH 8, beta-glucosidase and beta-glucuronidase were induced 9.2-fold and 11.5-fold, respectively.     

Fixed Point Theorems on Product Topological Spaces and Applications

A new collectively fixed point theorem for a family of set-valued mappings defined on product spaces of non-compact topological spaces without linear structure is proved and some special cases are also discussed. As applications, some non-empty intersection theorems of sets with convex sections and equilibrium existence theorem of abstract economies are obtained under much weaker assumptions. Our results includes a number of known results as many special cases.     

A Comparative Study on Dynamic and Static Sparsity Patterns in Parallel Sparse Approximate Inverse Preconditioning

Sparse approximate inverse (SAI) techniques have recently emerged as a new class of parallel preconditioning techniques for solving large sparse linear systems on high performance computers. The choice of the sparsity pattern of the SAI matrix is probably the most important step in constructing an SAI preconditioner. Both dynamic and static sparsity pattern selection approaches have been proposed by researchers. Through a few numerical experiments, we conduct a comparable study on the properties and performance of the SAI preconditioners using the different sparsity patterns for solving some sparse linear systems. This revised version was published online in July 2006 with corrections to the Cover Date.