Helium blistering of niobium: Large swelling measurements supporting the gas pressure model

Crystal potentials are usually obtained through a combination of theoretical calculation and the fitting of crystal properties. Because of thermal expansion of the crystal, the equilibrium condition is not satisfied at all temperatures unless the crystal potential is made temperature-dependent. A quasiharmonic potential that satisfies the equilibrium condition at all temperatures is derived from KC1 and used to calculate temperature-dependent defect energies (at constant volume). Other thermodynamic defect parameters are then derived by combining these results with the experimental Gibbs energies. The temperature-dependence of these parameters is displayed.     

Resistivity control of sputtered amorphous-silicon by ion-implantation

The resistivity of a hydrogenated sputtered amorphous-silicon is controlled by using room temperature implantation of P⁺. It is found that the defects produced by implantation can be minimized by annealing at 300°C in an H₂ atmosphere, and also found that there is a threshold implanted dose, beyond which the resistivity begins to be controlled by changing the dose.     

A hybrid level set method for modelling detonation and combustion problems in complex geometries

We present an accurate and fast wave tracking method that uses parametric representations of tracked fronts, combined with modifications of level set methods that use narrow bands. Our strategy generates accurate computations of the front curvature and other geometric properties of the front. We introduce data structures that can store discrete representations of the location of the moving fronts and boundaries, as well as the corresponding level set fields, that are designed to reduce computational overhead and memory storage. We present an algorithm we call stack sweeping to efficiently sort and store data that is used to represent orientable fronts. Our implementation features two reciprocal procedures, a forward ‘front parameterization’ that constructs a parameterization of a front given a level set field and a backward ‘field construction’ that constructs an approximation of the signed normal distance to the front, given a parameterized representation of the front. These reciprocal procedures are used to achieve and maintain high spatial accuracy. Close to the front, precise computation of the normal distance is carried out by requiring that displacement vectors from grid points to the front be along a normal direction. For front curves in two dimensions, a cubic interpolation scheme is used, and G ¹ surface parameterization based on triangular patches is used for the three-dimensional implementation to compute the distances from grid points near the front. To demonstrate this new, high accuracy method we present validations and show examples of combustion-like applications that include detonation shock dynamics, material interface motions in a compressible multi-material simulation and the Stephan problem associated with dendrite solidification.     

环状硅酸盐图的友好指数集

Let G be a graph with vertex set V(G) and edge set E(G). A labeling f : V(G) →Z2 induces an edge labeling f*: E(G) → Z2 defined by f*(xy) = f(x) + f(y), for each edge xy ∈ E(G). For i ∈ Z2, let vf(i) = |{v ∈ V(G) : f(v) = i}| and ef(i) = |{e ∈ E(G) : f*(e) =i}|. A labeling f of a graph G is said to be friendly if |vf(0)- vf(1)| ≤ 1. The friendly index set of the graph G, denoted FI(G), is defined as {|ef(0)- ef(1)|: the vertex labeling f is friendly}. This is a generalization of graph cordiality. We investigate the friendly index sets of cyclic silicates CS(n, m).     

A least‐square weighted residual method for level set formulation

In this paper, a least‐square weighted residual method (LSWRM) for level set (LS) formulation is introduced to achieve interface capturing in two‐dimensional (2D) and three‐dimensional (3D) problems. An LSWRM was adopted for two semi‐discretized advection and reinitialization equations of the LS formulation. The present LSWRM provided good mathematical properties such as natural numerical diffusion and the symmetry of the resulting algebraic systems for the advection and reinitialization equations. The proposed method was validated by solving some 2D and 3D benchmark problems such as those involving a rotating slotted disk, the rotation of a slotted sphere, and a time‐reversed single‐vortex flow and a deformation problem of a spherical fluid. The numerical results were compared with those obtained from essentially non‐oscillatory type formulations and particle LS methods. Further, the proposed LSWRM for the LS formulation was coupled with a splitting finite element method code to solve the incompressible Navier–Stokes equations, and then, the collapse of a 3D broken dam flow was well simulated; in the simulation, the entrapping of air and the splashing of the surge front of water were reproduced. The mass conservation of the present method was found to be satisfactory during the entire simulation. Copyright © 2011 John Wiley & Sons, Ltd.     

The isometric extension problem between unit spheres of two separable Banach spaces

In this article, we use some analytic and geometric characters of the smooth points in a sphere to study the isometric extension problem in the separable or reflexive real Banach spaces. We obtain that under some condition the answer to this problem is affirmative.     

Topologically Mixing and Hypercyclicity of Tuples

In this paper,we characterize conditions under which a tuple of bounded linear operators is topologically mixing.Also,we give conditions for a tuple to be hereditarily hypercyclic with respect to a tuple of syndetic sequences.     

Clique-cutsets beyond chordal graphs

Truemper configurations (thetas, pyramids, prisms, and wheels) have played an important role in the study of complex hereditary graph classes (eg, the class of perfect graphs and the class of even-hole-free graphs), appearing both as excluded configurations, and as configurations around which graphs can be decomposed. In this paper, we study the structure of graphs that contain (as induced subgraphs) no Truemper configurations other than (possibly) universal wheels and twin wheels. We also study several subclasses of this class. We use our structural results to analyze the complexity of the recognition, maximum weight clique, maximum weight stable set, and optimal vertex coloring problems for these classes. Furthermore, we obtain polynomial -bounding functions for these classes.     

Group divisible 3‐designs with block size four and group type 1ns1

In this article, we mainly consider the existence problem of a group divisible design GDD $\left(3,4,n+s\right)$ of type $1^n{s}^1$. We present two recursive constructions for this configuration using candelabra systems and construct explicitly a few small examples admitting given automorphism groups. As an application, several new infinite classes of GDD $\left(3,4,n+s\right)$s of type $1^n{s}^1$ are produced. Meanwhile a few new infinite families on candelabra quadruple systems with group sizes being odd and stem size greater than one are also obtained.