The magnetic properties of Be-codoped GaMnN grown via molecular beam epitaxy

GaMnN and Be-codoped GaMnN were grown via molecular beam epitaxy using a single GaN precursor and their structural and magnetic properties were examined. X-ray diffraction and superconducting quantum interference device (SQUID) measurements revealed that the grown layers are homogeneous without precipitates. The saturation magnetization of GaMnN has increased from ∼4 to ∼16 emu/cm³ via codoping of Be. The d–d exchange interaction between Mn atoms was discussed for the ferromagnetism of GaMnN.     

Oil Migration in Chocolate

Oil migration in filled chocolates limits shelf life due to texture changes and loss of visual appeal. Spatial and temporal oil concentration changes of a two-layer chocolate and peanut butter filling system, which models a filled chocolate, were monitored by magnetic resonance imaging. Formulations of chocolate varied with respect to particle size, milk fat content and emulsifier level. Sorption-time experimental data was used to establish the best fit diffusion coefficient for a Fickian diffusion model. On the basis of the comparison of spatial experimental data to the model, Fickian diffusion alone does not account for oil migration. Authors' address: Michael J. McCarthy, Department of Food Science and Technology, University of California, One Shields Avenue, Davis, CA 95616, USA     

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.     

Numerical simulation on an interaction of a vortex street with an elliptical leading edge using an unstructured grid

An algorithm for a time accurate incompressible Navier–Stokes solver on an unstructured grid is presented. The algorithm uses a second order, three‐point, backward difference formula for the physical time marching. For each time step, a divergence free flow field is obtained based on an artificial compressibility method. An implicit method with a local time step is used to accelerate the convergence for the pseudotime iteration. To validate the code, an unsteady laminar flow over a circular cylinder at a Reynolds number of 200 is calculated. The results are compared with available experimental and numerical data and good agreements are achieved. Using the developed unsteady code, an interaction of a Karman vortex street with an elliptical leading edge is simulated. The incident Karman vortex street is generated by a circular cylinder located upstream. A clustering to the path of the vortices is achieved easily due to flexibility of an unstructured grid. Details of the interaction mechanism are analysed by investigating evolutions of vortices. Characteristics of the interactions are compared for large‐ and small‐scale vortex streets. Different patterns of the interaction are observed for those two vortex streets and the observation is in agreement with experiment. Copyright © 2004 John Wiley & Sons, Ltd.     

On the Hyers-Ulam-Rassias stability of functional equations in n-variables

In this paper we investigate a generalization of the Hyers-Ulam-Rassias stability for a functional equation of the form f(φ(X))=?(X)f(X)+ψ(X) and the stability in the sense of Ger for the functional equation of the form f(φ(X))=?(X)f(X), where X lie in n-variables. As a consequence, we obtain a stability result in the sense of Hyers-Ulam-Rassias, Gǎvruta, and Ger for some well-known equations such as the gamma, beta, and G-function type's equations.