Covariant Gauge on the Lattice: A New Implementation

We derive a new implementation of linear covariant gauges on the lattice, based on a minimizing functional that can be interpreted as the Hamiltonian of a spin-glass model in a random external magnetic field. We show that our method solves most problems encountered in earlier implementations, mostly related to the no-go condition formulated by Giusti [Nucl. Phys. B498, 331 (1997)]. We carry out tests in the SU(2) case in four space-time dimensions. We also present preliminary results for the transverse gluon propagator at different values of the gauge parameter xi.

Low-energy electron scattering from methanol and ethanol

Measured and calculated differential cross sections for elastic (rotationally unresolved) electron scattering from two primary alcohols, methanol (CH(3)OH) and ethanol (C(2)H(5)OH), are reported. The measurements are obtained using the relative flow method with helium as the standard gas and a thin aperture as the collimating target gas source. The relative flow method is applied without the restriction imposed by the relative flow pressure conditions on helium and the unknown gas. The experimental data were taken at incident electron energies of 1, 2, 5, 10, 15, 20, 30, 50, and 100 eV and for scattering angles of 5 degrees-130 degrees. There are no previous reports of experimental electron scattering differential cross sections for CH(3)OH and C(2)H(5)OH in the literature. The calculated differential cross sections are obtained using two different implementations of the Schwinger multichannel method, one that takes all electrons into account and is adapted for parallel computers, and another that uses pseudopotentials and considers only the valence electrons. Comparison between theory and experiment shows that theory is able to describe low-energy electron scattering from these polyatomic targets quite well.

The development of social tourism in Brazil

This article reflects on the origins and development of social tourism in Brazil, with particular reference to the socio-economic conditions in the country. It discusses the theoretical conceptualisation of social tourism and its implementations in the non-European context. The case study presented here is based on a secondary bibliographical research of existing definitions and an in-depth analysis of the political conditions that have framed its development. More particularly, this article will discuss public initiatives since the Labour Party gained power in Brazil in 2003. Apart from public sector involvement in social tourism, this article also examines the role of the third sector in provision. The example of Social Service of Commerce will be presented. This article will conclude by evaluating the phenomenon of social tourism in Brazil, highlighting where progress has been made and which are the key challenges that need to be overcome.

Experimental investigation on adaptive robust controller designs applied to a free-floating space manipulator

This paper aims to formulate and investigate the application of various nonlinear H(infinity) control methods to a fiee-floating space manipulator subject to parametric uncertainties and external disturbances. From a tutorial perspective, a model-based approach and adaptive procedures based on linear parametrization, neural networks and fuzzy systems are covered by this work. A comparative study is conducted based on experimental implementations performed with an actual underactuated fixed-base planar manipulator which is, following the DEM concept, dynamically equivalent to a free-floating space manipulator. (C) 2011 Elsevier Ltd. All rights reserved.

Computational evaluation of flexural toughness of FRC and fracture properties of plain concrete

In this paper, a computational tool concerning the computation of flexural and fracture toughness of cement based composites is presented. Firstly, RILEM`s (Reunion Internationale des Laboratoires d`Essais de Materiaux) recommendations related to the analysis of FRC in three-point bend tests are discussed in their relevant aspects regarding the computational implementations. The determination of other mechanical properties such as the Young modulus has been added to the program. Taking this into account, a new formulation based on displacements is used. In the second part of the paper, the determination of fracture properties of concrete, such as the fracture energy, G(F) , and the fracture toughness, K-IC(S), is discussed regarding the computational strategies used in the implementations. Several features whereby anterior data can be reanalyzed, obtained from other standards and recommendations, have been incorporated into the program, therefore allowing comparative studies and back analysis activities.

A simple and effective inverse projection scheme for void distribution control in topology optimization

The ability to control both the minimum size of holes and the minimum size of structural members are essential requirements in the topology optimization design process for manufacturing. This paper addresses both requirements by means of a unified approach involving mesh-independent projection techniques. An inverse projection is developed to control the minimum hole size while a standard direct projection scheme is used to control the minimum length of structural members. In addition, a heuristic scheme combining both contrasting requirements simultaneously is discussed. Two topology optimization implementations are contributed: one in which the projection (either inverse or direct) is used at each iteration; and the other in which a two-phase scheme is explored. In the first phase, the compliance minimization is carried out without any projection until convergence. In the second phase, the chosen projection scheme is applied iteratively until a solution is obtained while satisfying either the minimum member size or minimum hole size. Examples demonstrate the various features of the projection-based techniques presented.

Fault-tolerant quantum computation with cluster states

The one-way quantum computing model introduced by Raussendorf and Briegel [Phys. Rev. Lett. 86, 5188 (2001)] shows that it is possible to quantum compute using only a fixed entangled resource known as a cluster state, and adaptive single-qubit measurements. This model is the basis for several practical proposals for quantum computation, including a promising proposal for optical quantum computation based on cluster states [M. A. Nielsen, Phys. Rev. Lett. (to be published), quant-ph/0402005]. A significant open question is whether such proposals are scalable in the presence of physically realistic noise. In this paper we prove two threshold theorems which show that scalable fault-tolerant quantum computation may be achieved in implementations based on cluster states, provided the noise in the implementations is below some constant threshold value. Our first threshold theorem applies to a class of implementations in which entangling gates are applied deterministically, but with a small amount of noise. We expect this threshold to be applicable in a wide variety of physical systems. Our second threshold theorem is specifically adapted to proposals such as the optical cluster-state proposal, in which nondeterministic entangling gates are used. A critical technical component of our proofs is two powerful theorems which relate the properties of noisy unitary operations restricted to act on a subspace of state space to extensions of those operations acting on the entire state space. We expect these theorems to have a variety of applications in other areas of quantum-information science.

A systematic approach to error isolation in computerized wastewater simulation models

Activated sludge models are used extensively in the study of wastewater treatment processes. While various commercial implementations of these models are available, there are many people who need to code models themselves using the simulation packages available to them, Quality assurance of such models is difficult. While benchmarking problems have been developed and are available, the comparison of simulation data with that of commercial models leads only to the detection, not the isolation of errors. To identify the errors in the code is time-consuming. In this paper, we address the problem by developing a systematic and largely automated approach to the isolation of coding errors. There are three steps: firstly, possible errors are classified according to their place in the model structure and a feature matrix is established for each class of errors. Secondly, an observer is designed to generate residuals, such that each class of errors imposes a subspace, spanned by its feature matrix, on the residuals. Finally. localising the residuals in a subspace isolates coding errors. The algorithm proved capable of rapidly and reliably isolating a variety of single and simultaneous errors in a case study using the ASM 1 activated sludge model. In this paper a newly coded model was verified against a known implementation. The method is also applicable to simultaneous verification of any two independent implementations, hence is useful in commercial model development.

Predictor-corrector methods of Runge-Kutta type for stochastic differential equations

In this paper we construct predictor-corrector (PC) methods based on the trivial predictor and stochastic implicit Runge-Kutta (RK) correctors for solving stochastic differential equations. Using the colored rooted tree theory and stochastic B-series, the order condition theorem is derived for constructing stochastic RK methods based on PC implementations. We also present detailed order conditions of the PC methods using stochastic implicit RK correctors with strong global order 1.0 and 1.5. A two-stage implicit RK method with strong global order 1.0 and a four-stage implicit RK method with strong global order 1.5 used as the correctors are constructed in this paper. The mean-square stability properties and numerical results of the PC methods based on these two implicit RK correctors are reported.

A variable stepsize implementation for stochastic differential equations

Stochastic differential equations (SDEs) arise from physical systems where the parameters describing the system can only be estimated or are subject to noise. Much work has been done recently on developing higher order Runge-Kutta methods for solving SDEs numerically. Fixed stepsize implementations of numerical methods have limitations when, for example, the SDE being solved is stiff as this forces the stepsize to be very small. This paper presents a completely general variable stepsize implementation of an embedded Runge Kutta pair for solving SDEs numerically; in this implementation, there is no restriction on the value used for the stepsize, and it is demonstrated that the integration remains on the correct Brownian path.

A four-stage index 2 Diagonally Implicit Runge-Kutta method

High index Differential Algebraic Equations (DAEs) force standard numerical methods to lower order. Implicit Runge-Kutta methods such as RADAU5 handle high index problems but their fully implicit structure creates significant overhead costs for large problems. Singly Diagonally Implicit Runge-Kutta (SDIRK) methods offer lower costs for integration. This paper derives a four-stage, index 2 Explicit Singly Diagonally Implicit Runge-Kutta (ESDIRK) method. By introducing an explicit first stage, the method achieves second order stage calculations. After deriving and solving appropriate order conditions., numerical examples are used to test the proposed method using fixed and variable step size implementations. (C) 2001 IMACS. Published by Elsevier Science B.V. All rights reserved.

Learning the dynamics of embedded clauses

Recent work by Siegelmann has shown that the computational power of recurrent neural networks matches that of Turing Machines. One important implication is that complex language classes (infinite languages with embedded clauses) can be represented in neural networks. Proofs are based on a fractal encoding of states to simulate the memory and operations of stacks. In the present work, it is shown that similar stack-like dynamics can be learned in recurrent neural networks from simple sequence prediction tasks. Two main types of network solutions are found and described qualitatively as dynamical systems: damped oscillation and entangled spiraling around fixed points. The potential and limitations of each solution type are established in terms of generalization on two different context-free languages. Both solution types constitute novel stack implementations - generally in line with Siegelmann's theoretical work - which supply insights into how embedded structures of languages can be handled in analog hardware.

An approach to verifying and debugging simulation models governed by ordinary differential equations: Part 1. Methodology for residual generation

For dynamic simulations to be credible, verification of the computer code must be an integral part of the modelling process. This two-part paper describes a novel approach to verification through program testing and debugging. In Part 1, a methodology is presented for detecting and isolating coding errors using back-to-back testing. Residuals are generated by comparing the output of two independent implementations, in response to identical inputs. The key feature of the methodology is that a specially modified observer is created using one of the implementations, so as to impose an error-dependent structure on these residuals. Each error can be associated with a fixed and known subspace, permitting errors to be isolated to specific equations in the code. It is shown that the geometric properties extend to multiple errors in either one of the two implementations. Copyright (C) 2003 John Wiley Sons, Ltd.

Digitally-implemented naturally sampled PWM suitable for multilevel converter control

For dynamic closed loop control of a multilevel converter with a low pulse number (ratio of switching frequency to synthesized fundamental), natural sampled pulse-width modulation (PWM) is the best form of modulation. Natural sampling does not introduce distortion or a delayed response to the modulating signal. However previous natural sampled PWM implementations have generally been analog. For a modular multilevel converter, a digital implementation has advantages of accuracy and flexibility. Re-sampled uniform PWM is a novel digital modulation technique which approaches the performance of natural PWM. Both hardware and software implementations for a five level multilevel converter phase are presented, demonstrating the improvement over uniform PWM.

Fads and fashions in management: the case of ERP

This article discusses the Enterprise Resource Planning (ERP) rage. ERP represents immense investments for companies around the globe and has been promoted as a management panacea. Not surprisingly, many implementations fail to match expectations. In this study, we propose a broader perspective to comprehend the substantive, institutional, and political factors involved in the ERP phenomenon, as an alternative to the "techno-reductionism" that has characterized the prevailing approach on the subject, and present an exploratory survey of 28 implementation experiences, concentrating on the process of adoption, chosen implementation approaches and outcome assessment.