A short-beam shear fracture approach to measure the mode II fracture toughness of materials with preferred interfaces

A short-beam shear fracture approach is developed to characterize the mode II fracture toughness, (K _IIC) of materials with preferred interfaces such as wood, fiber composite materials and bonded materials. This approach is easy to implement using the Iosipescu shear fixture and is free of friction between the cracked faces thereby offering a more reasonable value of K _IIC than previous methods. Another feature of our new approach is the measurement of accurate crack initiation load due to a clear load drop. Additionally, calibration charts for bonded polymers and composite materials are generated. Finite element analysis along with cohesive elements is used to validate experimental load-displacement curves which are obtained by testing bonded polymers. This new approach is compared with the four-point bending fracture experiment, and the measured fracture toughnessess of the same bonded materials of two kinds of approaches are shown to be close (15–25% difference).     

High-strength medium Mn quenching and partitioning steel with low yield ratio

ABSTRACT

A new microstructural design is proposed to develop a strong and ductile quenching and partitioning (Q&P) steel with low yield ratio. This steel has a heterogeneous dual phase microstructure which is developed by varying austenite thermal stability through Mn segregation. The heterogeneous microstructure contains large austenite grains which contribute to the low yield strength. The ultra-high tensile strength and good ductility are ascribed to the enhanced strain hardening behaviour resulted from the continuous transformation-induced plasticity (TRIP) effect. The present microstructural design enables a conventional medium Mn steel with high tensile strength, good ductility and low yield ratio, which promises easy forming and potential applications in automotive industries.

This paper is part of a Thematic Issue on Medium Manganese Steels.     

Finite element methodology for path integrals in fracture mechanics

Based on the energy foundation of the path-independent integral in non-linear fracture mechanics, I* integral as the dual form of Rice's J is presented, it is also path-independent and is equivalent to J in value but it relates to the complementary energy. It is proved that, in numerical implementation, the path independence of J and I* can be ensured by using the assumed displacement finite elements and the assumed stress finite elements, respectively. Regarding the bounds of crack parameters, it is demonstrated that the lower bound of J can be estimated by the displacement compatible elements, and the upper bound of I* can be estimated by the stress equilibrium elements. In view of the difficulties in formulating stress equilibrium model, instead of it, a quasi-equilibrium model is proposed, which makes hybrid stress elements be able to estimate the bound of I*, and do not lose the characteristics of stiffness formulation. Two four-node plane elements are suggested; of them, the incompatible one can be used in incompressible/fully plastic fracture analysis, and the penalty-equilibrium one can be implemented to estimate the bound of I*. Furthermore, an incremental formulation is developed for I*, and can be extended into the calculations of ductile fracture under monotonic loading. For attestation, quite a number of numerical experiments is carried out, and some significant results are offered. © 1998 John Wiley & Sons, Ltd.     

An extended Galerkin weak form and a point interpolation method with continuous strain field and superconvergence using triangular mesh

A point interpolation method (PIM) with continuous strain field (PIM-CS) is developed for mechanics problems using triangular background mesh, in which PIM shape functions are used to construct both displacement and strain fields. The strain field constructed is continuous in the entire problem domain, which is achieved by simple linear interpolations using locally smoothed strains around the nodes and points required for the interpolation. A general parameterized functional with a real adjustable parameter α are then proposed for establishing PIM-CS models of special property. We prove theoretically that the PIM-CS has an excellent bound property: strain energy obtained using PIM-CS lies in between those of the compatible FEM and NS-PIM models of the same mesh. Techniques and procedures are then presented to compute the upper and lower bound solutions using the PIM-CS. It is discovered that an extended Galerkin (x-Galerkin) model, as special case resulted from the extended parameterized functional with α = 1, is outstanding in terms of both performance and efficiency. Intensive numerical studies show that upper and lower bound solutions can always be obtained, there exist α values at which the solutions of PIM-CS are of superconvergence, and the x-Galerkin model is capable of producing superconvergent solutions of ultra accuracy that is about 10 times that of the FEM using the same mesh.     

Controlling Magnetic and Optical Properties of the van der Waals Crystal CrCl3−xBrx via Mixed Halide Chemistry

Magnetic van der Waals (vdW) materials are the centerpiece of atomically thin devices with spintronic and optoelectronic functions. Exploring new chemistry paths to tune their magnetic and optical properties enables significant progress in fabricating heterostructures and ultracompact devices by mechanical exfoliation. The key parameter to sustain ferromagnetism in 2D is magnetic anisotropy—a tendency of spins to align in a certain crystallographic direction known as easy‐axis. In layered materials, two limits of easy‐axis are in‐plane (XY) and out‐of‐plane (Ising). Light polarization and the helicity of topological states can couple to magnetic anisotropy with promising photoluminescence or spin‐orbitronic functions. Here, a unique experiment is designed to control the easy‐axis, the magnetic transition temperature, and the optical gap simultaneously in a series of CrCl_3?xBr_x crystals between CrCl₃ with XY and CrBr₃ with Ising anisotropy. The easy‐axis is controlled between the two limits by varying spin–orbit coupling with the Br content in CrCl_3?x Br_x. The optical gap, magnetic transition temperature, and interlayer spacing are all tuned linearly with x. This is the first report of controlling exchange anisotropy in a layered crystal and the first unveiling of mixed halide chemistry as a powerful technique to produce functional materials for spintronic devices.     

Minimizing L max for large-scale,job-shop scheduling problems

The academic literature in 2000 presented a procedure for solving the job-shop-scheduling problem of minimizing L _max. The iterative-adaptive simulation-based procedure is shown here to perform well on large-scale problems. However, there is potential for improvement in closing the gap between best-known solutions and the lower bound. In the present paper, a simulated annealing post-processing procedure is presented and evaluated on large-scale problems. A new neighbourhood structure for local searches in the job-shop scheduling problem is developed. The procedure is also evaluated using benchmark problems and new upper bounds are established.     

Aperiodic correlation of Kasami sequences in the small set

In this paper, an upper bound for a hybrid exponential sum over a finite field GF(p ^m ) is derived. This bound is then used to obtain an upper bound on the aperiodic correlation of nonbinary Kasami sequences in the small set. Similar method is also applied to get a new upper bound on the aperiodic correlation of binary Kasami sequences in the small set.     

Error estimation based on Superconvergent Patch Recovery using statically admissible stress fields

In this paper we investigate an approach for a posteriori error estimation based on recovery of an improved stress field. The qualitative properties of the recovered stress field necessary to obtain a conservative error estimator, i.e. an upper bound on the true error, are given. A specific procedure for recovery of an improved stress field is then developed. The procedure can be classified as Superconvergent Patch Recovery (SPR) enhanced with approximate satisfaction of the interior equilibrium and the natural boundary conditions. Herein the interior equilibrium is satisfied a priori within each nodal patch. Compared to the original SPR-method, which usually underestimates the true error, the present approach gives a more conservative estimate. The performance of the developed error estimator is illustrated by investigating two plane strain problems with known closed-form solutions. © 1998 John Wiley & Sons, Ltd.     

An improved mathematical program to solve the simple assembly line balancing problem

The simple assembly line balancing problem (SALBP) has been extensively examined in the literature. Various mathematical programs have been developed to solve SALBP type-1 (minimising the number of workstations, m, for a given cycle time, ct) and SALBP type-2 (minimising ct given m). Usually, an initial pre-process is carried out to calculate the range of workstations to which a task i may be assigned, in order to reduce the number of variables of task–workstation assignment. This paper presents a more effective mathematical program than those released to date to solve SALBP-1 and SALBP-2. The key idea is to introduce additional constraints in the mathematical program, based on the fact that the range of workstations to which a task i may be assigned depends either on the upper bound on the number of workstations or on the upper bound on the cycle time (for SALBP-1 and SALBP-2, respectively). A computational experiment was carried out and the results reveal the superiority of the mathematical program proposed.     

Interval algorithm for global numerical optimization

The interval optimization algorithm shows great advantages in bound constrained global optimization. An interval algorithm is presented in this article based on a new selection criterion. The selection criterion is proposed based on numerical experiments and the parameter pf* designed by Casado, Garcia and Csendes in 2000. The proposed criterion at each iteration selects some intervals of which the number is not greater than a constant so that the possible memory problem during the implementation of the algorithm is avoided and the running time of the algorithm is decreased, when the dimension of the problem is increasing. Based on the selection criterion, the proposed algorithm is implemented for a wide set of tested functions which includes easy and hard problems. Numerical experiments show that the proposed algorithm is efficient.     

Sequential and parallel schemes for adaptive 2-D parameter estimation with application to image estimation

In this paper, the non-causal quarter plane 2-D Recursive Least Squares (2D-RLS) algorithm for adaptive processing is developed. The complexity of this algorithm turns out to beO(L ⁶) per iteration, for anL ×L window. With the aim of reducing this complexity, the matrix gains appearing in the algorithm are replaced by scalar gains. This approach yields the Approximate 2-D Recursive Least Squares (A2D-RLS) algorithm, which is shown to have a complexity ofO(L ²). With the objective of reducing the computation time even further, a parallel scheme is developed for the A2D-RLS algorithm. Since the algorithm is inherently sequential, its parallelization involves some more approximations. The desired accuracy of the estimated parameters is shown to place an upper bound on the number of processors. The parallel scheme is suitable for implementation on shared memory as well as distributed memory machines. The algorithm is applied to the problem of image estimation. Simulation results giving speed-up, efficiency, and the accuracy of the estimated image are presented.     

New splitting algorithms for geometric transformations of digital images and their error analysis

For digital images and patterns under the nonlinear geometric transformation, T: (ξ, η) → (x, y), this study develops the splitting algorithms (i.e., the pixel‐division algorithms) that divide a 2D pixel into N × N subpixels, where N is a positive integer chosen as N = 2 ^k(k ≥ 0) in practical computations. When the true intensity values of pixels are known, this method makes it easy to compute the true intensity errors. As true intensity values are often unknown, the proposed approaches can compute the sequential intensity errors based on the differences between the two approximate intensity values at N and N/2. This article proposes the new splitting–shooting method, new splitting integrating method, and their combination. These methods approximate results show that the true errors of pixel intensity are O(H), where H is the pixel size. Note that the algorithms in this article do not produce any sequential errors as N ≥ N₀, where N₀ (≥2) is an integer independent of N and H. This is a distinctive feature compared to our previous papers on this subject. The other distinct feature of this article is that the true error bound O(H) is well suited to images with all kinds of discontinuous intensity, including scattered pixels. © 2011 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 21, 323–335, 2011     

General topology optimization method with continuous and discrete orientation design using isoparametric projection

A general topology optimization method, which is capable of simultaneous design of density and orientation of anisotropic material, is proposed by introducing orientation design variables in addition to the density design variable. In this work, the Cartesian components of the orientation vector are utilized as the orientation design variables. The proposed method supports continuous orientation design, which is out of the scope of discrete material optimization approaches, as well as design using discrete angle sets. The advantage of this approach is that vector element representation is less likely to fail into local optima because it depends less on designs of former steps, especially compared with using the angle as a design variable (Continuous Fiber Angle Optimization) by providing a flexible path from one angle to another with relaxation of orientation design space. An additional advantage is that it is compatible with various projection or filtering methods such as sensitivity filters and density filters because it is free from unphysical bound or discontinuity such as the one at θ = 2π and θ = 0 seen with direct angle representation. One complication of Cartesian component representation is the point‐wise quadratic bound of the design variables; that is, each pair of element values has to reside in a given circular bound. To overcome this issue, we propose an isoparametric projection method, which transforms box bounds into circular bounds by a coordinate transformation with isoparametric shape functions without having the singular point that is seen at the origin with polar coordinate representation. A new topology optimization method is built by taking advantage of the aforementioned features and modern topology optimization techniques. Several numerical examples are provided to demonstrate its capability. Copyright © 2014 John Wiley & Sons, Ltd.     

A New Class of Supersaturated Designs

Supersaturated designs are useful in situations in which the number of active factors is very small compared to the total number of factors being considered. In this article, a new class of supersaturated designs is constructed using half fractions of Hadamard matrices. When a Hadamard matrix of order N is used, such a design can investigate up to N – 2 factors in N/2 runs. Results are given for N ≤ 60. Extension to larger N is straightforward. These designs are superior to other existing supersaturated designs and are easy to construct. An example with real data is used to illustrate the ideas.     

On the optimal scheduling of periodic tests and maintenance for reliable redundant components

Periodically, some m of the n redundant components of a dependable system may have to be taken out of service for inspection, testing or preventive maintenance. The system is then constrained to operate with lower (n−m) redundancy and thus with less reliability during these periods. However, more frequent periodic inspections decrease the probability that a component fail undetected in the time interval between successive inspections. An optimal time schedule of periodic preventive operations arises from these two conflicting factors, balancing the loss of redundancy during inspections against the reliability benefits of more frequent inspections.Considering no other factor than this decreased redundancy at inspection time, this paper demonstrates the existence of an optimal interval between inspections, which maximizes the mean time between system failures. By suitable transformations and variable identifications, an analytic closed form expression of the optimum is obtained for the general (m, n) case. The optimum is shown to be unique within the ranges of parameter values valid in practice; its expression is easy to evaluate and shown to be useful to analyze and understand the influence of these parameters.Inspections are assumed to be perfect, i.e. they cause no component failure by themselves and leave no failure undetected. In this sense, the optimum determines a lowest bound for the system failure rate that can be achieved by a system of n-redundant components, m of which require for inspection or maintenance recurrent periods of unavailability of length t.The model and its general closed form solution are believed to be new [2] and [5]. Previous work [1], [4] and [10] had computed optimal values for an estimation of a time average of system unavailability, but by numerical procedures only and with different numerical approximations, other objectives and model assumptions (one component only inspected at a time), and taking into account failures caused by testing itself, repair and demands (see in particular [6], [7] and [9]).System properties and practical implications are derived from the closed form analytical expression. Possible extensions of the model are discussed. The model has been applied to the scheduling of the periodic tests of nuclear reactor protection systems.     

A MODEL FOR THE EFFECT OF A GASEOUS ENVIRONMENT ON THE LEFM FATIGUE THRESHOLD CONDITION OF STEELS

Using a different approach to those methods involving hydrogen-embrittlement and crack-closure mechanisms a previously developed model is extended to predict the commonly observed effects of yield strength and a gaseous environment on the long-crack fatigue crack growth threshold. The model assumes the existence of two intrinsic thresholds namely an upper bound value and a lower bound value related to, respectively, K_max-controlled cleavage and δK-controlled reversed shear mechanisms of crack growth in a critically stressed volume at the crack tip. This new development assumes that nascent hydrogen atoms, liberated from moisture in the environment, assist in reducing dislocation mobility thereby rationalizing experimental observations on low strength materials in moist laboratory air when compared to a dry inert environment. Quantitative predictions of fatigue thresholds in laboratory air and inert environments show good agreement with experimental data for several low and high strength steels. This alternative procedure may be found to be useful in practical design applications when reasonably fast and accurate estimates are required.     

Prediction of Permeability Coefficients of Compounds Through Caco-2 Cell Monolayer Using Artificial Neural Network Analysis

Artificial neural network (ANN) analysis was used to predict the permeability of selected compounds through Caco-2 cell monolayers. Previously reported models, which were shown to be useful in the prediction of permeability values, use many structural parameters. More complex equations have also been proposed using both linear and non-linear relationships, including ANN analysis and various structural parameters. But proposed models still need to be developed using different neuron patterns for more precise predictions and a better understanding of which factors affect the permeation. To develop a simple and useful model or method for easy prediction is also a general need. Permeability coefficients (log k_p) were obtained from various literature sources. Some structural parameters were calculated using computer programs. Multiple linear regression analysis (MLRA) was used to predict Caco-2 cell permeability for the set of 50 compounds (r² = 0.403). A successful ANN model was developed, and the ANN produced log kp values that correlated well with the experimental ones (r² = 0.952). The permeability of a compound, famotidine, which has not previously been studied, through the Caco-2 cell monolayer was investigated, and its permeability coefficient determined. It was then possible to compare the experimental data with that predicted using the trained ANN with previously determined Caco-2 cell permeability values and structural parameters of compounds. The model was also tested using literature values. The developed and described ANN model in this publication does not require any experimental parameters; it could potentially provide useful and precise prediction of permeability for new drugs or other penetrants.     

Yield‐Related Process Capability Indices for Processes of Multiple Quality Characteristics

Process capability indices (PCIs) have been widely used in industries for assessing the capability of manufacturing processes. Castagliola and Castellanos (Quality Technology and Quantitative Management 2005, 2(2):201–220), viewing that there were no clear links between the definition of the existing multivariate PCIs and theoretical proportion of nonconforming product items, defined a bivariate C_pk and C_p (denoted by BC_pk and BC_p, respectively) based on the proportions of nonconforming product items over four convex polygons for bivariate normal processes with a rectangular specification region. In this paper, we extend their definitions to MC_pk and MC_p for multivariate normal processes with flexible specification regions. To link the index to the yield, we establish a ‘reachable’ lower bound for the process yield as a function of MC_pk. An algorithm suitable for such processes is developed to compute the natural estimate of MC_pk from process data. Furthermore, we construct via the bootstrap approach the lower confidence bound of MC_pk, a measure often used by producers for quality assurance to consumers. As for BC_p, we first modify the original definition with a simple preprocessing step to make BC_p scale‐invariant. A very efficient algorithm is developed for computing a natural estimator of BC_p. This new approach of BC_p can be easily extended to MC_p for multivariate processes. For BC_p, we further derive an approximate normal distribution for , which enables us to construct procedures for making statistical inferences about process capability based on data, including the hypothesis testing, confidence interval, and lower confidence bound. Finally, the proposed procedures are demonstrated with three real data sets. Copyright © 2012 John Wiley & Sons, Ltd.     

A new class of Cn interpolations and its application to the finite element method

A new class of Cⁿ continuous interpolations is presented. These interpolations consist of two or more Lagrangian interpolations blended by pseudo Hermitian interpolation. Using this class of interpolations a new Cⁿ family of displacement type elements is developed. The properties of this new family of elements such as their precision and their superconvergent points are discussed. Some solutions to the corner elements problem and implication of different boundary conditions are proposed. Using this new kind of element, several examples of deflection of elastic beams and plates are treated, the results of which are encouraging. Copyright © 2001 John Wiley & Sons, Ltd.     

Pricing and location decisions in multi-objective facility location problem with M/M/m/k queuing systems

This article presents a new multi-objective model for a facility location problem with congestion and pricing policies. This model considers situations in which immobile service facilities are congested by a stochastic demand following M/M/m/k queues. The presented model belongs to the class of mixed-integer nonlinear programming models and NP-hard problems. To solve such a hard model, a new multi-objective optimization algorithm based on a vibration theory, namely multi-objective vibration damping optimization (MOVDO), is developed. In order to tune the algorithms parameters, the Taguchi approach using a response metric is implemented. The computational results are compared with those of the non-dominated ranking genetic algorithm and non-dominated sorting genetic algorithm. The outputs demonstrate the robustness of the proposed MOVDO in large-sized problems.