Separation of crack extension modes in orthotropic delamination models

In modeling a crack along a distinct interface between dissimilar elastic materials, the ratio of mode I to mode II stress intensity factors or energy release rates is typically not unique, due to oscillatory behavior of near-tip stresses and displacements. Although methods have been developed for comparing mode mixes for isotropic interfacial fracture problems, this behavior currently limits the applicability of interfacial fracture mechanics in predicting delamination in layered materials without isotropic symmetry. The virtual crack closure technique (VCCT) is a method used to extract mode I and mode II energy release rate components from numerical fracture solutions. Energy release rate components extracted from an oscillatory solution using the VCCT are not unique due to their dependence on the virtual crack extension length, . In this work, a method is presented for using the VCCT to extract -independent energy release rate quantities for the case of an interface crack between two in-plane orthotropic materials. The method does not involve altering the analysis to eliminate its oscillatory behavior and it is similar to existing methods for extracting a mode mix from isotropic interfacial fracture models. Knowledge of near-tip fields is used to determine the explicit dependence of energy release rate parameters. Energy release rates are then defined that are separated from the oscillatory dependence on . A modified VCCT using these energy release rate definitions is applied to results from finite element analyses, showing that -independent energy release rate quantities result. The modified technique has potential as a consistent method for extracting a mode mix from numerical solutions. The -independent energy release rate quantities extracted using this technique can also aid numerical modelers, serving as guides for testing the convergence of finite element models. Direct applications of this work include the analysis of planar composite delamination problems, where plies or debonded laminates are modeled as in-plane orthotropic materials.     

The effect of load weight on balance control during lateral box transfers

Few studies have endeavoured to measure balance control during manual material handling. This study examined the effects of load weight during a stationary manual material handling task. In total, 36 healthy participants completed 180° lateral transfer tasks of a loaded (5% of body weight) and an unloaded box. The projection of the centre of mass onto the base of support, as measured via a passive-marker 3-D motion analysis system, was used to quantify balance control. Muscle activities of lower extremity muscles were also measured. When moving the loaded box, individuals ventured ≥ 1 cm closer to the edges of the base of support and increased centre of mass movement up to 14%. In addition, muscle electromyographic activity on both sides of the shank increased. In summary, during loaded configurations, vulnerability to loss of balance was increased and individuals appeared to adapt by increasing co-contraction of the shank muscles suggesting increased ankle stiffness. STATEMENT OF RELEVANCE: Industries requiring manual material handling have a particularly high rate of injuries due to falls. This study suggests that larger load weights during lateral material handling tasks adversely affect balance control and may create a vulnerability to imbalance throughout the entire manoeuvre.     

Recent elevation changes of Svalbard glaciers derived from ICESat laser altimetry

We have tested three methods for estimating 2003-2008 elevation changes of Svalbard glaciers from multi-temporal ICESat laser altimetry: (a) linear interpolation of crossover points between ascending and descending tracks, (b) projection of near repeat-tracks onto common locations using Digital Elevation Models (DEMs), and (c) least-squares fitting of rigid planes to segments of repeat-track data assuming a constant elevation change rate. The two repeat-track methods yield similar results and compare well to the more accurate, but sparsely sampled, crossover points. Most glacier regions in Svalbard have experienced low-elevation thinning combined with high-elevation balance or thickening during 2003-2008. The geodetic mass balance (excluding calving front retreat or advance) of Svalbard's 34,600 km² glaciers is estimated to be −4.3 ± 1.4 Gt y⁻¹, corresponding to an area-averaged water equivalent (w.e.) balance of −0.12 ± 0.04 m w.e. y⁻¹. The largest ice losses have occurred in the west and south, while northeastern Spitsbergen and the Austfonna ice cap have gained mass. Winter and summer elevation changes derived from the same methods indicate that the spatial gradient in mass balance is mainly due to a larger summer season thinning in the west and the south than in the northeast. Our findings are consistent with in-situ mass balance measurements from the same period, confirming that repeat-track satellite altimetry can be a valuable tool for monitoring short term elevation changes of Arctic glaciers.     

AC powder electroluminescent displays

Abstract— The current status of AC powder electroluminescent (ACPEL) displays is reviewed with particular emphasis given to color and lifetime. The printing of the displays in forward and reverse architectures is also discussed, in addition to the fabrication of ACPEL displays with interdigitated electrodes, and different types of ACPEL phosphors and materials for back electrodes, transparent conducting electrodes, binders, and dielectrics are considered. Furthermore, shape conformable and highly flexible ACPEL displays are surveyed.     

Theory of one-tape linear-time Turing machines

A theory of one-tape two-way one-head off-line linear-time Turing machines is essentially different from its polynomial-time counterpart since these machines are closely related to finite state automata. This paper discusses structural-complexity issues of one-tape Turing machines of various types (deterministic, nondeterministic, reversible, alternating, probabilistic, counting, and quantum Turing machines) that halt in linear time, where the running time of a machine is defined as the length of any longest computation path. We explore structural properties of one-tape linear-time Turing machines and clarify how the machines’ resources affect their computational patterns and power.     

Do Accelerating Turing Machines Compute the Uncomputable?

Accelerating Turing machines have attracted much attention in the last decade or so. They have been described as “the work-horse of hypercomputation” (Potgieter and Rosinger 2010: 853). But do they really compute beyond the “Turing limit”—e.g., compute the halting function? We argue that the answer depends on what you mean by an accelerating Turing machine, on what you mean by computation, and even on what you mean by a Turing machine. We show first that in the current literature the term “accelerating Turing machine” is used to refer to two very different species of accelerating machine, which we call end-stage-in and end-stage-out machines, respectively. We argue that end-stage-in accelerating machines are not Turing machines at all. We then present two differing conceptions of computation, the internal and the external, and introduce the notion of an epistemic embedding of a computation. We argue that no accelerating Turing machine computes the halting function in the internal sense. Finally, we distinguish between two very different conceptions of the Turing machine, the purist conception and the realist conception; and we argue that Turing himself was no subscriber to the purist conception. We conclude that under the realist conception, but not under the purist conception, an accelerating Turing machine is able to compute the halting function in the external sense. We adopt a relatively informal approach throughout, since we take the key issues to be philosophical rather than mathematical.     

Accelerating scientific computations with mixed precision algorithms

On modern architectures, the performance of 32-bit operations is often at least twice as fast as the performance of 64-bit operations. By using a combination of 32-bit and 64-bit floating point arithmetic, the performance of many dense and sparse linear algebra algorithms can be significantly enhanced while maintaining the 64-bit accuracy of the resulting solution. The approach presented here can apply not only to conventional processors but also to other technologies such as Field Programmable Gate Arrays (FPGA), Graphical Processing Units (GPU), and the STI Cell BE processor. Results on modern processor architectures and the STI Cell BE are presented.

Program summary

Program title: ITER-REFCatalogue identifier: AECO_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AECO_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 7211No. of bytes in distributed program, including test data, etc.: 41 862Distribution format: tar.gzProgramming language: FORTRAN 77Computer: desktop, serverOperating system: Unix/LinuxRAM: 512 MbytesClassification: 4.8External routines: BLAS (optional)Nature of problem: On modern architectures, the performance of 32-bit operations is often at least twice as fast as the performance of 64-bit operations. By using a combination of 32-bit and 64-bit floating point arithmetic, the performance of many dense and sparse linear algebra algorithms can be significantly enhanced while maintaining the 64-bit accuracy of the resulting solution.Solution method: Mixed precision algorithms stem from the observation that, in many cases, a single precision solution of a problem can be refined to the point where double precision accuracy is achieved. A common approach to the solution of linear systems, either dense or sparse, is to perform the LU factorization of the coefficient matrix using Gaussian elimination. First, the coefficient matrix A is factored into the product of a lower triangular matrix L and an upper triangular matrix U. Partial row pivoting is in general used to improve numerical stability resulting in a factorization PA=LU, where P is a permutation matrix. The solution for the system is achieved by first solving Ly=Pb (forward substitution) and then solving Ux=y (backward substitution). Due to round-off errors, the computed solution, x, carries a numerical error magnified by the condition number of the coefficient matrix A. In order to improve the computed solution, an iterative process can be applied, which produces a correction to the computed solution at each iteration, which then yields the method that is commonly known as the iterative refinement algorithm. Provided that the system is not too ill-conditioned, the algorithm produces a solution correct to the working precision.Running time: seconds/minutes     

The interaction between skill, postures, forces and back pain in wool handling

Wool handling is an important rural occupation where workers process 200 or more fleeces daily, separating them into various quality components. Loads and postures they experience carry substantial risk of low back pain (LBP). Although a formal skill training structure exists, interaction with loads and LBP is unknown. We examined whether skill and LBP influenced trunk postures and loads of 60 wool handlers representing 3 skill levels. LBP prevalence ranged from 20% for junior (lowest skill) to 45% for open class (highest skill) wool handlers. Open class wool handlers demonstrated increased lateral bend and more axially twisted postures, generating greater medio-lateral shear forces and lateral bend and axial twist moments. LBP was associated with open class wool handlers spending more time in severe axially twisted postures. These findings suggest that skill-based training needs to be reviewed to reduce the quantity of axially twisted posture which may help reduce the prevalence of LBP in this workforce.