On the catalytic C-H activation of some silicon dioxide overlayers on thin metal film systems — An observation on the isokinetic effect

Kinetic data on the exchange reaction betwee hexane and deuterium have recently been reported by Maier and coworkers [1]. The reaction was catalysed by a series of platinum or rhodium systems, some of which had the property that the upper surface was shielded by a silica overlayer. The data are reinterpreted to indicate an isokinetic temperature of 580 K. This observation indicates that all the catalysts behave in a similar manner, which means that the exchange reaction does not require a free metal surface.     

Design methods for space-variant optical interconnections to achieve optimum power throughput

Optoelectronic systems based on space-variant optics give great freedom to the system designer in terms of interconnect topologies. One feature of space-variant systems is that they can achieve a high interconnect density. However, this density is achieved by having large arrays of diffractive elements with very small apertures relative to the propagation distances involved. Thus diffraction losses from the finite apertures can significantly affect power throughput for these types of systems, regardless of the diffractive efficiencies of the optical elements involved. Therefore it is desirable that this loss be minimized. We present several space-variant optical interconnect design methods (for both one-to-one and fan-out interconnects) and compare them in terms of power throughput for diffraction-limited interconnect distances. Both numerical simulations and experimental results are presented.     

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.