Manufacturing cell formation using similarity coefficients and a parallel genetic TSP algorithm: Formulation and comparison

Many algorithms have been proposed to form manufacturing cells from component routings. However, many of these do not have the capability of solving large problems. We propose a procedure using similarity coefficients and a parallel genetic implementation of a TSP algorithm that is capable of solving large problems of up to 1000 parts and 1000 machines. In addition, we also compare our procedure with many existing procedures using nine well-known problems from the literature.

The results show that the proposed procedure compares well with the existing procedures and should be useful to practitioners and researchers.     

Time-dependent Green's functions for an anisotropic bimaterial with viscous interface

By virtue of the Stroh formalism, we derive the exact closed-form solutions for the time-dependent two-dimensional Green's functions due to a line force and line dislocation in an anisotropic bimaterial with a viscous interface. We first reduce the boundary value problem to two coupled homogeneous first-order partial differential equations, which can be solved using a decoupling technique. The full-field expressions of the time-dependent displacements and stresses due to the line force and line dislocation interacting with the viscous interface are obtained.     

A simplified proof of the representation of functionals of diffusions

A simple proof is given for the stochastic integral representation of a Fréchet differentiable functional of the paths of a given diffusion process. The proof begins when the functional depends on one coordinate, then passes to (by appropriate conditioning) a perhaps more difficult case—when the functional depends on a finite number of coordinates—and finally, by approximation, to the general case.     

Solutions in Sobolev spaces of vector refinement equations with a general dilation matrix

In this paper, we present a necessary and sufficient condition for the existence of solutions in a Sobolev space W_p^k(ℝ^s) (1≤p≤∞) to a vector refinement equation with a general dilation matrix. The criterion is constructive and can be implemented. Rate of convergence of vector cascade algorithms in a Sobolev space W_p^k(ℝ^s) will be investigated. When the dilation matrix is isotropic, a characterization will be given for the L_p (1≤p≤∞) critical smoothness exponent of a refinable function vector without the assumption of stability on the refinable function vector. As a consequence, we show that if a compactly supported function vector φ∈L_p(ℝ^s) (φ∈C(ℝ^s) when p=∞) satisfies a refinement equation with a finitely supported matrix mask, then all the components of φ must belong to a Lipschitz space Lip(ν,L_p(ℝ^s)) for some ν>0. This paper generalizes the results in R.Q. Jia, K.S. Lau and D.X. Zhou (J. Fourier Anal. Appl. 7 (2001) 143–167) in the univariate setting to the multivariate setting. Dedicated to Professor Charles A. Micchelli on the occasion of his 60th birthday Mathematics subject classifications (2000) 42C20, 41A25, 39B12. Research was supported in part by the Natural Sciences and Engineering Research Council of Canada (NSERC Canada) under Grant G121210654.     

On the index of composition of integers from various sets

Given an integer n ≥ 2, let λ(n) := (log n)/(log γ(n)), where γ(n) = Π _p|n p, stand for the index of composition of n, with λ(1) = 1. We study the distribution function of (λ(n) – 1) log n as n runs through particular sets of integers, such as the shifted primes, the values of a given irreducible cubic polynomial and the shifted powerful numbers. Research supported in part by a grant from NSERC. Research supported by the Applied Number Theory Research Group of the Hungarian Academy of Science and by a grant from OTKA. Professor M.V. Subbarao passed away on February 15, 2006. Received: 3 March 2006 Revised: 28 October 2006     

Optimal Algorithms for Probabilistic Solitude Detection on Anonymous Rings

Probabilistic algorithms are developed for a basic problem in distributed computation, assuming anonymous, asynchronous, unidirectional rings of processors. The problem, known as Solitude Detection, requires that a nonempty subset of the processors, calledcontenders, determine whether or not there is exactly one contender. Monte Carlo algorithms are developed that err with probability bounded by a specified parameter and exhibit either message or processor termination. The algorithms transmit an optimal expected number of bits, to within a constant factor. Their bit complexities display a surprisingly rich dependence on the kind of termination exhibited and on the processors' knowledge of the size of the ring. Two probabilistic tools are isolated and then combined in various ways to achieve all our algorithms.     

Frequency-specific maturation of the eighth nerve and brain-stem auditory pathway: evidence from derived auditory brain-stem responses (ABRs).

Previous studies of human auditory development using frequency-specific auditory brain-stem responses (ABRs) have reported that maturation for both peak and interpeak latencies occurs earlier for responses generated by low-frequency stimuli. In two of these studies, low-frequency ABRs presumed to originate from apical locations in the cochlea were likely dominated by activity from higher frequency regions closer to the base. In the present study, the high-pass noise-masking technique was used to generate derived ABRs that represent activity from isolated place specific regions along the basilar membrane. Analysis of auditory brain-stem maturation based on I-V interpeak latency differences with adult means revealed a frequency-specific pattern of development. Developmental changes occurred faster and mature function was attained earlier for ABRs from the mid-center-frequency (CF) derived conditions than from either the highest or lowest CF derived conditions. The differential maturation of mid-CF derived ABRs may reflect the delayed effects of the pattern of development that occurs in the cochlea.     

A family of centered forms for a polynomial

The general centered form for multi-variate polynomials is investigated and a computing procedure is proposed that results in a certain superset. Based on this procedure the optimal centered forms for monomials and for some special cases of polynomials are investigated.     

Non-elliptic deformation field near the tip of a mixed-mode crack in a compressible hyperelastic material

This paper gives an asymptotic analysis of the deformation field near the tip of an arbitrary mixed-mode crack in a compressible hyperelastic harmonic material which loses ellipticity at sufficiently large deformations. It is found that the near-tip deformation field is characterized by a localized non-elliptic deformation band issuing from the crack-tip and bounded by two curves of discontinuous deformation gradient. Explicit expression for the near-tip deformation field is obtained both inside and outside the localized deformation band. In particular, a simple relation is derived that determines the orientation of the deformation band in terms of two complex governing parameters of the near-tip fields inside and outside the deformation band, respectively.