On computational homogenization of microscale crack propagation

The effective response of microstructures undergoing crack propagation is studied by homogenizing the response of statistical volume elements (SVEs). Because conventional boundary conditions (Dirichlet, Neumann and strong periodic) all are inaccurate when cracks intersect the SVE boundary, we herein use first order homogenization to compare the performance of these boundary conditions during the initial stage of crack propagation in the microstructure, prior to macroscopic localization. Using weakly periodic boundary conditions that lead to a mixed formulation with displacements and boundary tractions as unknowns, we can adapt the traction approximation to the problem at hand to obtain better convergence with increasing SVE size. In particular, we show that a piecewise constant traction approximation, which has previously been shown to be efficient for stationary cracks, is more efficient than the conventional boundary conditions in terms of convergence also when crack propagation occurs on the microscale. The performance of the method is demonstrated by examples involving grain boundary crack propagation modelled by conventional cohesive interface elements as well as crack propagation modelled by means of the extended finite element method in combination with the concept of material forces. © 2016 The Authors. International Journal for Numerical Methods in Engineering Published by John Wiley & Sons Ltd.     

Mutation analysis of the MEN1 gene in multiple endocrine neoplasia type 1, familial acromegaly and familial isolated hyperparathyroidism

Multiple endocrine neoplasia type 1 (MEN 1) is an autosomal dominant disease characterized by neoplasia of the parathyroid glands, the endocrine pancreas, and the anterior pituitary gland. In addition, families with isolated endocrine neoplasia, notably familial isolated hyperparathyroidism (FIHP) and familial acromegaly, have also been reported. However, whether these families constitute MEN 1 variants or separate entities remains speculative as the genetic bases for these diseases are unclear. The gene for MEN 1 has recently been cloned and characterized. Using single strand conformation analysis (SSCA) and sequencing, we performed mutation analysis in: a) a total of 55 MEN 1 families from 7 countries, b) 13 isolated MEN 1 cases without family history of the disease, c) 8 acromegaly families, and d) 4 FIHP families. Mutations were identified in 27 MEN 1 families and 9 isolated cases. The 22 different mutations spread across most of the 9 translated exons and included frameshift (11), nonsense (6), splice (2), missense mutations (2), and in-frame deletions (1). Among the 19 Finnish MEN 1 probands, a 1466del12 mutation was identified in 6 families with identical 11q13 haplotypes and in 2 isolated cases indicating a common founder. One frameshift mutation caused by 359del4 (GTCT) was found in 1 isolated case and 4 kindreds of different origin and haplotypes; this mutation therefore represents a common "warm" spot in the MEN1 gene. By analyzing the DNA of the parents of an isolated case one mutation was confirmed to be de novo. No mutation was found in any of the acromegaly and small FIHP families, suggesting that genetic defects other than the MEN1 gene might be involved and that additional such families need to be analyzed.     

Home visiting the newborn baby as a basis for developmental surveillance at child welfare centres

Home visiting is a part of the Swedish child health surveillance programme. In the present study, part of a longitudinal prospective project, the predictive power of observations at home visits to 338 newborn babies was evaluated. The regular home visit was made by the nurse at a Child Welfare Centre also using a check-list developed for this project. Her check-list assessments seemed valid in identifying families with stressful psychosocial conditions. When the general home situation was judged as "poor" or "dubious", the boys showed signs of a delayed mental development at 4-5 years of age. Assessments of "feeding problems" among boys were associated with behavioural problems at 4-5 years of age. The results underline the importance of an early home visit as a base for the developmental surveillance at Child Welfare Centres. However, the results of the home visit observations were not followed by any extra interventions at CWC. It seems the nurse should feel confident in her check-list judgement and initiate interventions where appropriate.     

A flux-free a posteriori error estimator for the incompressible Stokes problem using a mixed FE formulation

In this contribution, we present an a posteriori error estimator for the incompressible Stokes problem valid for a conventional mixed FE formulation. Due to the saddle-point property of the problem, conventional error estimators developed for pure minimization problems cannot be utilized straight-forwardly. The new estimator is built up by two key ingredients. At first, a computed error approximation, exactly fulfilling the continuity equation for the error, is obtained via local Dirichlet problems. Secondly, we adopt the approach of solving local equilibrated flux-free problems in order to bound the remaining, incompressible, error. In this manner, guaranteed upper and lower bounds, of the velocity “energy norm” of the error as well as goal-oriented (linear) output functionals, with respect to a reference (overkill) mesh are obtained. In particular, it should be noted that this approach requires no computation of hybrid fluxes. Furthermore, the estimator is applicable to mixed FE formulations using continuous pressure approximations, such as the Mini and Taylor–Hood class of elements. In conclusion, a few simple numerical examples are presented, illustrating the accuracy of the error bounds.     

Efficient classical simulation of the Deutsch–Jozsa and Simon’s algorithms

A long-standing aim of quantum information research is to understand what gives quantum computers their advantage. This requires separating problems that need genuinely quantum resources from those for which classical resources are enough. Two examples of quantum speed-up are the Deutsch–Jozsa and Simon’s problem, both efficiently solvable on a quantum Turing machine, and both believed to lack efficient classical solutions. Here we present a framework that can simulate both quantum algorithms efficiently, solving the Deutsch–Jozsa problem with probability 1 using only one oracle query, and Simon’s problem using linearly many oracle queries, just as expected of an ideal quantum computer. The presented simulation framework is in turn efficiently simulatable in a classical probabilistic Turing machine. This shows that the Deutsch–Jozsa and Simon’s problem do not require any genuinely quantum resources, and that the quantum algorithms show no speed-up when compared with their corresponding classical simulation. Finally, this gives insight into what properties are needed in the two algorithms and calls for further study of oracle separation between quantum and classical computation.     

A numerical framework for load identification and regularization with application to rolling disc problem

Indirect identification methods are applied when direct measurement is unfeasible. One example is the measurement of the contact force between wheel and rail in railway traffic. This paper focuses on optimization-based methods for the identification of contact forces with the aim of developing a reliable and robust load identification scheme. A particular issue discussed here is the choice of discretization in space–time, enabling the sampling instances of the measurements, the parameterization of the sought input and the discretization of the pertinent state equations to be decoupled, in contrast to traditional methods such as, e.g. dynamic programming.In the present preliminary study where a 2-D disc is considered as a representative of a train wheel, a radial concentrated force rotates around the disc’s perimeter, representing the contact force acting on the rim of the wheel, while radial strains are measured on a set of points corresponding to the strain gauges position. The strain history data is then used in the identification procedure where the applied force is sought to minimize the discrepancy between the predicted and measured strain history. In particular the convergence of the results with respect to the temporal discretization of the model and the time parameterization of the sought loading history are investigated under the influence of noise. It is seen that choosing a discretization of the sought load that is coarser than that of the state variable gives a more robust scheme. The traditional Tikhonov regularization can also be added within the current framework. Furthermore, with the aid of a sensitivity analysis, the influence of measurement noise can be quantified.     

Secure and self-stabilizing clock synchronization in sensor networks

In sensor networks, correct clocks have arbitrary starting offsets and nondeterministic fluctuating skews. We consider an adversary that aims at tampering with the clock synchronization by intercepting messages, replaying intercepted messages (after the adversary’s choice of delay), and capturing nodes (i.e., revealing their secret keys and impersonating them). We present an efficient clock sampling algorithm which tolerates attacks by this adversary, collisions, a bounded amount of losses due to ambient noise, and a bounded number of captured nodes that can jam, intercept, and send fake messages. The algorithm is self-stabilizing, so if these bounds are temporarily violated, the system can efficiently stabilize back to a correct state. Using this clock sampling algorithm, we construct the first self-stabilizing algorithm for secure clock synchronization in sensor networks that is resilient to the aforementioned adversarial attacks.     

Invariant and dual subtraction games resolving the Duchêne–Rigo conjecture

We prove a recent conjecture of Duchêne and Rigo, stating that every complementary pair of homogeneous Beatty sequences represents the solution to an invariant impartial game. Here invariance means that each available move in a game can be played anywhere inside the game board. In fact, we establish such a result for a wider class of pairs of complementary sequences, and in the process generalize the notion of a subtraction game. Given a pair of complementary sequences $\left(a_n\right)$ and $\left(b_n\right)$ of positive integers, we define a game $G$ by setting $\left\{\{a_n,b_n\}\right\}$ as invariant moves. We then introduce the invariant game $G^{?}$, whose moves are all non-zero $P$-positions of $G$. Provided the set of non-zero $P$-positions of $G^{?}$ equals $\left\{\{a_n,b_n\}\right\}$, this is the desired invariant game. We give sufficient conditions on the initial pair of sequences for this ‘duality’ to hold.     

Optimization strategy in the development process with application to cast components

At the development of commercial vehicles, it is necessary to develop cost-optimized components with respect to their entire lifetime. This requires a product development process that utilizes the possibility to simulate the product performance using modeling of different degrees of sophistication at any predefined level-of-detail (LOD). For example, the mechanical properties of a cast component depend strongly on the casting process, the simulation of which requires complex modeling at a high LOD. In this article, we propose an optimization strategy that is based on the LOD concept to develop cost-effective components. A sizing optimization of a cast model component is carried out with respect to both the mechanical and thermal response to exemplify the process. In particular, a (novel) global measure of the temperature in energy norm is introduced as an indicator of the “production fitness” to ensure high quality of the material properties. This measure is the thermal counterpart of the well-accepted mechanical strain energy.     

Industry evaluation of the Requirements Abstraction Model

Software requirements are often formulated on different levels and hence they are difficult to compare to each other. To address this issue, a model that allows for placing requirements on different levels has been developed. The model supports both abstraction and refinement of requirements, and hence requirements can both be compared with each other and to product strategies. Comparison between requirements will allow for prioritization of requirements, which in many cases is impossible if the requirements are described on different abstraction levels. Comparison to product strategies will enable early and systematic acceptance or dismissal of requirements, minimizing the risk for overloading. This paper presents an industrial evaluation of the model. It has been evaluated in two different companies, and the experiences and findings are presented. It is concluded that the requirements abstraction model provides helpful improvements to the industrial requirements engineering process.