Comparative studies of femtosecond to microsecond laser pulses on selective pigmented cell injury in skin

Threshold radiant exposures for grossly apparent immediate whitening and ultrastructural alterations of melanosomes in black guinea pig skin were determined for a series of red visible laser pulses ranging from 4 x 10(-4) to 6.5 x 10(-14) s. Threshold exposures for melanosomal injury were found to be independent of pulsewidth when the pulsewidths were below the estimated thermal relaxation time of melanosomes. Threshold radiant exposures for melanosomal injury were found to increase when the pulsewidths were approximately equal to or above the thermal relaxation time of melanosomes. At longer pulse durations, fracturing of melanosomes was not observed despite the longer exposures necessary for injury. Instead, perimelanosomal vacuoles were noted. These findings are consistent with the theory of selective photothermolysis and provide evidence for the thermal initiation of melanosomal disruption.     

Cold compaction of ceramic powder: Computational analysis of the effect of pressing method and die shape

This paper deals with a computational analysis of the influence of the pressing method and part geometry on the final density distribution in the cold compaction process of ceramic alumina powders. The analysis is based on the explicit finite-element model proposed and validated in a previous study. The mechanical behavior of the processing material is described using a multisurface elastoplastic model, the modified Drucker-Prager/Cap model Published in Prikladnaya Mekhanika, Vol. 43, No. 10, pp. 129–134, October 2007.     

Analysis of finite capacity discrete-time <Emphasis Type="Italic">GI</Emphasis>/<Emphasis Type="Italic">Geo</Emphasis>/1 queueing system with multiple vacations

This paper investigates a discrete-time single-server finite-buffer queueing system with multiple vacations in which arrivals occur according to a discrete-time renewal process. Service and vacation times are mutually independent and geometrically distributed. We obtain steady-state system length distributions at prearrival, arbitrary and outside observer's observation epochs under the late arrival system with delayed access and early arrival system. The analysis of actual waiting-time for both the systems has also been carried out. The model has potential application in high-speed computer network, digital communication systems and other related areas.     

Symmetric <Emphasis Type="Italic">X</Emphasis><Subscript>9</Subscript> singularities and complex affine reflection groups

We establish a natural correspondence between the finite order automorphisms of the function singularities X ₉ and the complex crystallographic groups. A complete list of the related objects is obtained. To Vladimir Igorevich on the occasion of his 70th birthday     

New Branch-and-Cut Algorithm for Bilevel Linear Programming

Linear mixed 0–1 integer programming problems may be reformulated as equivalent continuous bilevel linear programming (BLP) problems. We exploit these equivalences to transpose the concept of mixed 0–1 Gomory cuts to BLP. The first phase of our new algorithm generates Gomory-like cuts. The second phase consists of a branch-and-bound procedure to ensure finite termination with a global optimal solution. Different features of the algorithm, in particular, the cut selection and branching criteria are studied in details. We propose also a set of algorithmic tests and procedures to improve the method. Finally, we illustrate the performance through numerical experiments. Our algorithm outperforms pure branch-and-bound when tested on a series of randomly generated problems. Work of the authors was partially supported by FCAR, MITACS and NSERC grants.     

Fifty years of the Siberian Division of the Russian Academy of Sciences

This is a write-up on the foundation of the Sobolev Institute of Mathematics in 1957.     

Approximate Toeplitz Matrix Problem Using Semidefinite Programming

Given a data matrix, we find its nearest symmetric positive-semidefinite Toeplitz matrix. In this paper, we formulate the problem as an optimization problem with a quadratic objective function and semidefinite constraints. In particular, instead of solving the so-called normal equations, our algorithm eliminates the linear feasibility equations from the start to maintain exact primal and dual feasibility during the course of the algorithm. Subsequently, the search direction is found using an inexact Gauss-Newton method rather than a Newton method on a symmetrized system and is computed using a diagonal preconditioned conjugate-gradient-type method. Computational results illustrate the robustness of the algorithm.