Adaptive remeshing for ductile fracture prediction in metal formingRemaillage adaptatif pour la prévision de la rupture ductile en mise en forme

The analysis of mechanical structures using the Finite Element Method in the framework of large elastoplastic strain, needs frequent remeshing of the deformed domain during computation. Indeed, the remeshing is due to the large geometrical distortion of finite elements and the adaptation to the physical behavior of the solution. This paper gives the necessary steps to remesh a mechanical structure during large elastoplastic deformations with damage. An important part of this process is constituted by geometrical and physical error estimates. The proposed method is integrated in a computational environment using the ABAQUS/Explicit solver and the BL2D-V2 adaptive mesher. To cite this article: H. Borouchaki et al., C. R. Mecanique 330 (2002) 709–716.     

MO analysis of macroscopic supercurrent flow in MgB 2

We present results from an extended magneto-optical (MO) analysis of two samples cut from high-density pellets of MgB₂. The first sample was studied in order to show that no matter how large the sample is and despite the bulk granularity, the material enters into a critical state in a crystal-like fashion. The second sample was chosen for the quantitative analysis. A numerical approach based on an inverted 2D Biot-Savart model was used to calculate the current paths across the homogeneous polycrystalline bulk, as well as in the vicinity and across some morphological defects. Local current densities in the homogeneous part were estimated as a function of the applied magnetic field at different temperatures, in three regimes: below full penetration, at full penetration and above full penetration, respectively. A hypothesis of interpretation of the apparent absence of magnetic granularity inside the polycrystalline microstructure is presented. It is related to a critical state likely reached by a network of strongly coupled Josephson junctions. Received 31 May 2001 and Received in final form 5 December 2001     

Classification of Extremal Double Circulant Self-Dual Codes of Lengths 64 to 72

Recently extremal double circulant self-dual codes have been classified for lengths n ≤ 62. In this paper, a complete classification of extremal double circulant self-dual codes of lengths 64 to 72 is presented. Almost all of the extremal double circulant singly-even codes given have weight enumerators for which extremal codes were not previously known to exist.     

Shape transition from InAs quantum dash to quantum dot on InP(3 1 1)A

We report on the shape transition from InAs quantum dashes to quantum dots (QDs) on lattice-matched GaInAsP on InP(3 1 1)A substrates. InAs quantum dashes develop during chemical-beam epitaxy of 3.2 monolayers InAs, which transform into round InAs QDs by introducing a growth interruption without arsenic flux after InAs deposition. The shape transition is solely attributed to surface properties, i.e., increase of the surface energy and symmetry under arsenic deficient conditions. The round QD shape is maintained during subsequent GaInAsP overgrowth because the reversed shape transition from dot to dash is kinetically hindered by the decreased ad-atom diffusion under arsenic flux.     

Nuclear Resonant Scattering into the New Millennium

Hyperfine Interactions - The technique of nuclear resonant scattering has spread out in various fields during the previous years. Those fields, which have rapidly developed and attracted the...     

A new method for constructing infinite families of k-tight optimal double loop networks

The double loop network (DLN) is a circulant digraph with n nodes and outdegree 2. DLN has been widely used in the designing of local area networks and distributed systems. In this paper, a new method for constructing infinite families of k-tight optimal DLN is presented. For k = 0,1,…,40, the infinite families of k-tight optimal DLN can be constructed by the new method, where the number nk(t,a) of their nodes is a polynomial of degree 2 in t and contains a parameter a. And a conjecture is proposed.     

Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem

We consider the problem of maintaining a dynamic ordered set of n integers in a universe U under the operations of insertion, deletion and predecessor queries. The computation model used is a unit-cost RAM, with a word length of w bits, and the universe size is |U|=2^w. We present a data structure that uses O(|U|/log|U|+n) space, performs all the operations in O(loglog|U|) time and needs O(loglog|U|/logloglog|U|) structural changes per update operation. The data structure is a simplified version of the van Emde Boas' tree introducing, in its construction and functioning, new concepts, which help to keep the important information for searching along the path of the tree, in a more compact and organized way.     

A Multi-component Matrix Loop Algebra and Its Application

A set of multi-component matrix Lie algebra is constructed. It follows that a type of new loop algebra A^- M-1 is presented. An isospectral problem is established. Integrable multi-component hierarchy is obtained by Tu pattern, which possesses tri-Hamiltonian structures. Furthermore, it can be reduced to the well-known AKNS hierarchy and BPT hierarchy. Therefore, the major result of this paper can be regarded as a unified expression integrable model of the AKNS hierarchy and the BPT hierarchy.     

Design and Fabrication of Composite Smart Structures with High Electric and Mechanical Performances for Future Mobile Communication

In this paper, we have developed a load-bearing outer skin for antennas, which is termed a composite smart structure (CSS). The CSS is a multilayer composite sandwich structure in which antenna layers are inserted. A direct-feed stacked patch antenna is considered. A design procedure including the structure design, material selection, and design of antenna elements in order to obtain high electric and mechanical performances is presented. An optimized honeycomb thickness is selected for efficient radiation and impedance characteristics. High gain conditions can be obtained by placing the outer facesheet in the resonance position, which is at about a half wavelength distance from the ground plane. The measured electrical performances show that the CSS has a great bandwidth (over 10%) and a higher gain than an antenna without a facesheet and has excellent mechanical performances, owing to the composite laminates and honeycomb cores. The CSS concept can be extended to give a useful guide for manufacturers of structural body panels and for antenna designers.     

Indexing text using the Ziv–Lempel trie

Let a text of u characters over an alphabet of size σ be compressible to n phrases by the LZ78 algorithm. We show how to build a data structure based on the Ziv–Lempel trie, called the LZ-index, that takes 4nlog₂n(1+o(1)) bits of space (that is, 4 times the entropy of the text for ergodic sources) and reports the R occurrences of a pattern of length m in worst case time O(m³logσ+(m+R)logn). We present a practical implementation of the LZ-index, which is faster than current alternatives when we take into consideration the time to report the positions or text contexts of the occurrences found.