Analysis and simulations of multifrequency induction hardening

We study a model for induction hardening of steel. The related differential system consists of a time domain vector potential formulation of the Maxwell's equations coupled with an internal energy balance and an ODE for the volume fraction of {\sl austenite}, the high temperature phase in steel. We first solve the initial boundary value problem associated by means of a Schauder fixed point argument coupled with suitable a-priori estimates and regularity results. Moreover, we prove a stability estimate entailing, in particular, uniqueness of solutions for our Cauchy problem. We conclude with some finite element simulations for the coupled system

Canonical quantization of non-local field equations

We consistently quantize a class of relativistic non-local field equations characterized by a non-local kinetic term in the lagrangian. We solve the classical non-local equations of motion for a scalar field and evaluate the on-shell hamiltonian. The quantization is realized by imposing Heisenberg's equation which leads to the commutator algebra obeyed by the Fourier components of the field. We show that the field operator carries, in general, a reducible representation of the Poincare group. We also consider the Gupta-Bleuler quantization of a non-local gauge field and analyze the propagators and the physical states of the theory.Comment: 18 p., LaTe

Gravitational Lensing Bound On The Average Redshift Of Gamma Ray Bursts In Models With Evolving Lenses

Identification of gravitationally lensed Gamma Ray Bursts (GRBs) in the BATSE 4B catalog can be used to constrain the average redshift $$ of the GRBs. In this paper we investigate the effect of evolving lenses on the of GRBs in different cosmological models of universe. The cosmological parameters $\Omega$ and $\Lambda$ have an effect on the of GRBs. The other factor which can change the $$is the evolution of galaxies. We consider three evolutionary model of galaxies. In particular, we find that the upper limit on$$ of GRBs is higher in evolving model of galaxies as compared to non-evolving models of galaxies.Comment: 23 pages,one plain LaTeX file with three postscript figures This is modified version with recent BATSE efficiency parameter and with the latest F paramete

On a non-isothermal model for nematic liquid crystals

A model describing the evolution of a liquid crystal substance in the nematic phase is investigated in terms of three basic state variables: the {\it absolute temperature} \teta, the {\it velocity field} \ub, and the {\it director field} \bd, representing preferred orientation of molecules in a neighborhood of any point of a reference domain. The time evolution of the velocity field is governed by the incompressible Navier-Stokes system, with a non-isotropic stress tensor depending on the gradients of the velocity and of the director field \bd, where the transport (viscosity) coefficients vary with temperature. The dynamics of \bd is described by means of a parabolic equation of Ginzburg-Landau type, with a suitable penalization term to relax the constraint |\bd | = 1. The system is supplemented by a heat equation, where the heat flux is given by a variant of Fourier's law, depending also on the director field \bd. The proposed model is shown compatible with \emph{First and Second laws} of thermodynamics, and the existence of global-in-time weak solutions for the resulting PDE system is established, without any essential restriction on the size of the data

Synchronization in Scale Free networks: The role of finite size effects

Synchronization problems in complex networks are very often studied by researchers due to its many applications to various fields such as neurobiology, e-commerce and completion of tasks. In particular, Scale Free networks with degree distribution $P(k)\sim k^{-\lambda}$, are widely used in research since they are ubiquitous in nature and other real systems. In this paper we focus on the surface relaxation growth model in Scale Free networks with $2.5< \lambda <3$, and study the scaling behavior of the fluctuations, in the steady state, with the system size $N$. We find a novel behavior of the fluctuations characterized by a crossover between two regimes at a value of $N=N^*$ that depends on $\lambda$: a logarithmic regime, found in previous research, and a constant regime. We propose a function that describes this crossover, which is in very good agreement with the simulations. We also find that, for a system size above $N^{*}$, the fluctuations decrease with $\lambda$, which means that the synchronization of the system improves as $\lambda$ increases. We explain this crossover analyzing the role of the network's heterogeneity produced by the system size $N$ and the exponent of the degree distribution.Comment: 9 pages and 5 figures. Accepted in Europhysics Letter

Slow group velocity and Cherenkov radiation

We theoretically study the effect of ultraslow group velocities on the emission of Vavilov-Cherenkov radiation in a coherently driven medium. We show that in this case the aperture of the group cone on which the intensity of the radiation peaks is much smaller than that of the usual wave cone associated with the Cherenkov coherence condition. We show that such a singular behaviour may be observed in a coherently driven ultracold atomic gas.Comment: 4 pages, 4 figure

ASMs and Operational Algorithmic Completeness of Lambda Calculus

We show that lambda calculus is a computation model which can step by step simulate any sequential deterministic algorithm for any computable function over integers or words or any datatype. More formally, given an algorithm above a family of computable functions (taken as primitive tools, i.e., kind of oracle functions for the algorithm), for every constant K big enough, each computation step of the algorithm can be simulated by exactly K successive reductions in a natural extension of lambda calculus with constants for functions in the above considered family. The proof is based on a fixed point technique in lambda calculus and on Gurevich sequential Thesis which allows to identify sequential deterministic algorithms with Abstract State Machines. This extends to algorithms for partial computable functions in such a way that finite computations ending with exceptions are associated to finite reductions leading to terms with a particular very simple feature.Comment: 37 page