A unified theory for brittle and ductile shear mode fracture

A unified theory captures both brittle and ductile fracture. The fracture toughness is proportional to the applied stress squared and the length of the crack. For purely brittle solids, this criterion is equivalent to Griffith's theory. In other cases, it provides a theoretical basis for the Irwin-Orowan formula. For purely ductile solids, the theory makes direct contact with the Bilby-Cottrell-Swinden model. The toughness is highest in ductile materials because the shielding dislocations in the plastic zone provide additional resistance to crack growth. This resistance is the force opposing dislocation motion, and the Peach-Koehler force overcomes it. A dislocation-free zone separates the plastic zone from and the tip of the crack. The dislocation-free zone is finite because molecular forces responsible for the cohesion of the surfaces near the crack tip are not negligible. At the point of crack growth, the length of the dislocation-free zone is constant and the shielding dislocations advance in concert. As in Griffith's theory, the crack is in unstable equilibrium. The theory shows that a dimensionless variable controls the elastoplastic behaviour. A relationship for the size of the dislocation-free zone is derived in terms of the macroscopic and microscopic parameters that govern the fracture.     

The deformation and fracture of balloons

Inflation of balloons provides a straightforward way of achieving large biaxial deformations. Previous studies have shown that when a balloon bursts, crack propagation occurs at very high speed – much higher than would be expected from the low strain modulus and elastic wave velocity of the rubber. The present paper is concerned with studies of the deformation and fracture of cylindrical balloons. On inflation, the deformations of such a balloon pass through an unstable region but subsequently increase monotonically with pressure. In this relatively high pressure region, the ratio of the longitudinal and circumferential extension ratios is broadly in accord with expectations from high-strain elasticity theory when the ratio of the corresponding stresses is taken into account. On bursting, crack speeds up to around 300 m/s in this region. It is shown that these speeds are in accord with large increase in incremental moduli for the highly-strained rubber. Marked changes in crack tip profile observed at very high crack speeds are consistent with control of the rate of growth by inertia rather than by the viscoelastic properties of the rubber (as is believed to be the case at lower speeds). Consistent with this, various elastomers having different glass transition temperatures show similar crack growth behaviour in the very high speed region.     

Global and uniform convergence of subspace correction methods for some convex optimization problems

This paper gives some global and uniform convergence estimates for a class of subspace correction (based on space decomposition) iterative methods applied to some unconstrained convex optimization problems. Some multigrid and domain decomposition methods are also discussed as special examples for solving some nonlinear elliptic boundary value problems.

     

A modular integer GCD algorithm

This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit integers using a modular representation for intermediate values U, V and also for the result. It is based on a reduction step, similar to one used in the accelerated algorithm [T. Jebelean, A generalization of the binary GCD algorithm, in: ISSAC '93: International Symposium on Symbolic and Algebraic Computation, Kiev, Ukraine, 1993, pp. 111–116; K. Weber, The accelerated integer GCD algorithm, ACM Trans. Math. Softw. 21 (1995) 111–122] when U and V are close to the same size, that replaces U by (U−bV)/p, where p is one of the prime moduli and b is the unique integer in the interval (−p/2,p/2) such that . When the algorithm is executed on a bit common CRCW PRAM with O(nlognlogloglogn) processors, it takes O(n) time in the worst case. A heuristic model of the average case yields O(n/logn) time on the same number of processors.     

A numerical experimental study of inverse preconditioning for the parallel iterative solution to 3D finite element flow equations

Integration of the subsurface flow equation by finite elements (FE) in space and finite differences (FD) in time requires the repeated solution to sparse symmetric positive definite systems of linear equations. Iterative techniques based on preconditioned conjugate gradients (PCG) are one of the most attractive tool to solve the problem on sequential computers. A present challenge is to make PCG attractive in a parallel computing environment as well. To this aim a key factor is the development of an efficient parallel preconditioner. FSAI (factorized sparse approximate inverse) and enlarged FSAI relying on the approximate inverse of the coefficient matrix appears to be a most promising parallel preconditioner. In the present paper PCG using FSAI, diagonal and pARMS (parallel algebraic recursive multilevel solvers) preconditioners is implemented on the IBM SP4/512 and CLX/768 supercomputers with up to 32 processors to solve underground flow problems of a large size. The results show that FSAI may allow for a parallel relative efficiency larger than 50% on the largest problems with p=32 processors. Moreover, FSAI turns out to be significantly less expensive and more robust than pARMS. Finally, it is shown that for p in the upper range may be much improved if PCG–FSAI is implemented on CLX.     

一种带时间窗和车辆数目限制的车辆路线问题及其算法

本文提出了带时间窗和车辆数目限制的车辆路线问题的数学模型,针对该问题的特征构造了一种路线生成算法和禁忌搜索算法,并对Solomon提出的C1、R1、RC1类数据集给出了数值运算的结果,实验结果表明算法是有效的.     

Approximating schedules for dynamic process graphs efficiently

A model for parallel and distributed programs, the dynamic process graph (DPG), is investigated under graph-theoretic and complexity aspects. Such graphs embed constructors for parallel programs, synchronization mechanisms as well as conditional branches. They are capable of representing all possible executions of a parallel or distributed program in a very compact way. The size of this representation can be as small as logarithmic with respect to the size of any execution of the program.

In a preceding paper [A. Jakoby, et al., Scheduling dynamic graphs, in: Proc. 16th Symposium on Theoretical Aspects in Computer Science STACS'99, LNCS, vol. 1563, Springer, 1999, pp. 383–392] we have analysed the expressive power of the general model and various variants of it. We have considered the scheduling problem for DPGs given enough parallelism taking into account communication delays between processors when exchanging data. Given a DPG the question arises whether it can be executed (that means whether the corresponding parallel program has been specified correctly), and what is its minimum schedule length.

In this paper we study a subclass of dynamic process graphs called -output DPGs, which are appropriate in many situations, and investigate their expressive power. In a previous paper we have shown that the problem to determine the minimum schedule length is still intractable for this subclass, namely this problem is -complete as is the general case. Here we will investigate structural properties of the executions of such graphs. A natural graph-theoretic conjecture that executions must always split into components that are isomorphic to subgraphs turns out to be wrong. We are able to prove a weaker property. This implies a quadratic upper bound on the schedule length that may be necessary in the worst case, in contrast to the general case, where the optimal schedule length may be exponential with respect to the size of the representing DPG. Making this bound constructive, we obtain an approximation to a -complete problem. Computing such a schedule and then executing the program can be done on a parallel machine in polynomial time in a highly distributive fashion.     

Investigation of multiwavelength clock recovery based on heterodyne beats of sideband-filtered signal

We investigate a new parallel all-optical clock recovery scheme based on heterodyne beats of an optical sideband-filtered signal. The oscillating clock signal is recovered when the filtered sideband is combined with a stable local oscillator. The filtering is performed with an optical resonator, which by nature provides possibility for multiwavelength operation. The local oscillator could be realized by a multiwavelength laser, whose emission wavelengths are injection seeded with carrier wavelengths of the input data. The output signal of such a configuration benefits from a reduced bit-pattern effect and a stable offset level. The sideband filtering is demonstrated for 23 simultaneous channels at 100 GHz DWDM grid, each hosting a data stream of 10 Gbit/s.     

A parallel version of the preconditioned conjugate gradient method for boundary element equations

The parallel version of precondition techniques is developed for matrices arising from the Galerkin boundary element method for two-dimensional domains with Dirichlet boundary conditions. Results were obtained for implementations on a transputer network as well as on an nCUBE-2 parallel computer showing that iterative solution methods are very well suited for a MIMD computer. A comparison of numerical results for iterative and direct solution methods is presented and underlines the superiority of iterative methods for large systems.     

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.