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.     

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.     

Mössbauer Studies and Magnetic Properties of Y3−x Ce x Fe5O12

It is shown that in-situ ^166mHo (I = 7) in a spherical single crystal of HoF₃ can be used as sensitive internal thermometer to thermally detect NMR (NMR-TDNO) from the 100% abundant stable ¹⁶⁵Ho (I = 7/2) nuclei. In addition, new ^166mHo NMRON results are reported. Both the ^166mHo NMRON and ¹⁶⁵Ho NMR-TDNO spectra show three distinct quadrupolar split sub-resonances, in zero applied field. The data is used to make estimates of the Ho magnetic moments and quadrupole parameters for the ^166mHo and ^166mHo sites.     

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.     

Strong visible PL from the nc-Si thin film by Ni silicide mediated crystallization

We studied the growth of nanocrystalline silicon (nc-Si) thin film exhibiting a strong room temperature photoluminescence (PL) at 1.81–2.003 eV. The amorphous silicon was crystallized by Ni silicide mediated crystallization (Ni SMC) and then Secco-etched to exhibit the PL. The PL peak energy and intensity increase with increasing the metal density on the a-Si because of the reduction in the grain size down to 2 nm. The photoluminescence energy and peak intensity depend strongly on the Secco etch time because the grain size is reduced by etching the grain boundaries.     

Discreteness Criterions of Isometric Subgroups for Quaternionic Hyperbolic Space

In this paper, we give analogue of Jörgensen's inequality for nonelementary groups of isometries of complex hyperbolic 2-space generated by two elements, one of which is either loxodromic or boundary elliptic for the same group of isometries of quaternionic hyperbolic 2-space. And we give a sufficient condition for a nonelementary subgroup of isometries of quaternionic hyperbolic 2-space generated by two elements one of which is parabolic not to be discrete.     

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.     

Crossover Critical Behavior in the Three-Dimensional Ising Model

The character of critical behavior in physical systems depends on the range of interactions. In the limit of infinite range of the interactions, systems will exhibit mean-field critical behavior, i.e., critical behavior not affected by fluctuations of the order parameter. If the interaction range is finite, the critical behavior asymptotically close to the critical point is determined by fluctuations and the actual critical behavior depends on the particular universality class. A variety of systems, including fluids and anisotropic ferromagnets, belongs to the three-dimensional Ising universality class. Recent numerical studies of Ising models with different interaction ranges have revealed a spectacular crossover between the asymptotic fluctuation-induced critical behavior and mean-field-type critical behavior. In this work, we compare these numerical results with a crossover Landau model based on renormalization-group matching. For this purpose we consider an application of the crossover Landau model to the three-dimensional Ising model without fitting to any adjustable parameters. The crossover behavior of the critical susceptibility and of the order parameter is analyzed over a broad range (ten orders) of the scaled distance to the critical temperature. The dependence of the coupling constant on the interaction range, governing the crossover critical behavior, is discussed.