Nonequilibrium scaling explorations on a 2D Z(5)-symmetric model

We have investigated the dynamic critical behavior of the two-dimensional Z(5)-symmetric spin model by using short-time Monte Carlo (MC) simulations. We have obtained estimates of some critical points in its rich phase diagram and included, among the usual critical lines the study of first-order (weak) transition by looking into the order-disorder phase transition. Besides, we also investigated the soft-disorder phase transition by considering empiric methods. A study of the behavior of $\beta /\nu z$ along the self-dual critical line has been performed and special attention has been devoted to the critical bifurcation point, or FZ (Fateev-Zamolodchikov) point. Firstly, by using a refinement method and taking into account simulations out-of-equilibrium, we were able to localize parameters of this point. In a second part of our study, we turned our attention to the behavior of the model at the early stage of its time evolution in order to find the dynamic critical exponent z as well as the static critical exponents $\beta$ and $$ of the FZ-point on square lattices. The values of the static critical exponents and parameters are in good agreement with the exact results, and the dynamic critical exponent $z\approx 2.28$ very close of the 4-state Potts model ($z\approx 2.29$).Comment: 11 pages, 7 figure

Quantum adiabatic optimization and combinatorial landscapes

In this paper we analyze the performance of the Quantum Adiabatic Evolution algorithm on a variant of Satisfiability problem for an ensemble of random graphs parametrized by the ratio of clauses to variables, $\gamma=M/N$. We introduce a set of macroscopic parameters (landscapes) and put forward an ansatz of universality for random bit flips. We then formulate the problem of finding the smallest eigenvalue and the excitation gap as a statistical mechanics problem. We use the so-called annealing approximation with a refinement that a finite set of macroscopic variables (versus only energy) is used, and are able to show the existence of a dynamic threshold $\gamma=\gamma_d$ starting with some value of K -- the number of variables in each clause. Beyond dynamic threshold, the algorithm should take exponentially long time to find a solution. We compare the results for extended and simplified sets of landscapes and provide numerical evidence in support of our universality ansatz. We have been able to map the ensemble of random graphs onto another ensemble with fluctuations significantly reduced. This enabled us to obtain tight upper bounds on satisfiability transition and to recompute the dynamical transition using the extended set of landscapes.Comment: 41 pages, 10 figures; added a paragraph on paper's organization to the introduction, fixed reference

Refinement of Kripke Models for Dynamics

We propose a property-preserving refinement/abstraction theory for Kripke Modal Labelled Transition Systems incorporating not only state mapping but also label and proposition lumping, in order to have a compact but informative abstraction. We develop a 3-valued version of Public Announcement Logic (PAL) which has a dynamic operator that changes the model in the spirit of public broadcasting. We prove that the refinement relation on static models assures us to safely reason about any dynamic properties in terms of PAL-formulas on the abstraction of a model. The theory is in particular interesting and applicable for an epistemic setting as the example of the Muddy Children puzzle shows, especially in the view of the growing interest for epistemic modelling and (automatic) verification of communication protocols

Simulation of an Isolated Tiltrotor in Hover with an Unstructured Overset-Grid RANS Solver

An unstructured overset-grid Reynolds Averaged Navier-Stokes (RANS) solver, FUN3D, is used to simulate an isolated tiltrotor in hover. An overview of the computational method is presented as well as the details of the overset-grid systems. Steady-state computations within a noninertial reference frame define the performance trends of the rotor across a range of the experimental collective settings. Results are presented to show the effects of off-body grid refinement and blade grid refinement. The computed performance and blade loading trends show good agreement with experimental results and previously published structured overset-grid computations. Off-body flow features indicate a significant improvement in the resolution of the first perpendicular blade vortex interaction with background grid refinement across the collective range. Considering experimental data uncertainty and effects of transition, the prediction of figure of merit on the baseline and refined grid is reasonable at the higher collective range- within 3 percent of the measured values. At the lower collective settings, the computed figure of merit is approximately 6 percent lower than the experimental data. A comparison of steady and unsteady results show that with temporal refinement, the dynamic results closely match the steady-state noninertial results which gives confidence in the accuracy of the dynamic overset-grid approach

LNCS

State-transition systems communicating by shared variables have been the underlying model of choice for applications of model checking. Such formalisms, however, have difficulty with modeling process creation or death and communication reconfigurability. Here, we introduce “dynamic reactive modules” (DRM), a state-transition modeling formalism that supports dynamic reconfiguration and creation/death of processes. The resulting formalism supports two types of variables, data variables and reference variables. Reference variables enable changing the connectivity between processes and referring to instances of processes. We show how this new formalism supports parallel composition and refinement through trace containment. DRM provide a natural language for modeling (and ultimately reasoning about) biological systems and multiple threads communicating through shared variables

The static, dynamic and metadynamic recrystallisation of a medium carbon steel

Grain refinement during and after hot isothermal deformation of a medium carbon steel has been investigated. The average austenite grain size decreased with an increase in strain for the hot deformed and recrystallised material, with refinement extending beyond the strain for the peak stress. A window of strain that corresponds to transition from classical static to metadynamic recrystallisation was observed in respect to the recrystallised material. Within this post-dynamic transition window the strain at which strain independent softening occurs was different for different volume fractions of the recrystallised material. This led to a new terminology corresponding to initiation of strain independent softening. For the alloy of this study, strain independent softening for the start of post-deformation recrystallisation occurred near the strain to the peak stress. The strain corresponding to complete metadynamic recrystallisation, which was defined as when all levels of recrystallisation were strain independent, was much greater than the strain for the peak stress. <br /

Observation and abstract behaviour in specification and implementation of state-based systems

Classical algebraic specification is an accepted framework for specification. A criticism which applies is the fact that it is functional, not based on a notion of state as most software development and implementation languages are. We formalise the idea of a state-based object or abstract machine using algebraic means. In contrast to similar approaches we consider dynamic logic instead of equational logic as the framework for specification and implementation. The advantage is a more expressive language allowing us to specify safety and liveness conditions. It also allows a clearer distinction of functional and state-based parts which require different treatment in order to achieve behavioural abstraction when necessary. We shall in particular focus on abstract behaviour and observation. A behavioural notion of satisfaction for state-elements is needed in order to abstract from irrelevant details of the state realisation