Search results for "Mathematica"
showing 10 items of 7971 documents
Spin-1/2 sub-dynamics nested in the quantum dynamics of two coupled qutrits
2017
In this paper we investigate the quantum dynamics of two spin-1 systems, $\vec{\textbf{S}}_1$ and $\vec{\textbf{S}}_2$, adopting a generalized $(\vec{\textbf{S}}_1+\vec{\textbf{S}}_2)^2$-nonconserving Heisenberg model. We show that, due to its symmetry property, the nine-dimensional dynamics of the two qutrits exactly decouples into the direct sum of two sub-dynamics living in two orthogonal four- and five-dimensional subspaces. Such a reduction is further strengthened by our central result consisting in the fact that in the four-dimensional dynamically invariant subspace, the two qutrits quantum dynamics, with no approximations, is equivalent to that of two non interacting spin 1/2's. The …
An Operator-Based Exact Treatment of Open Quantum Systems
2005
"Quantum mechanics must be regarded as open systems. On one hand, this is due to the fact that, like in classical physics, any realistic system is subjected to a coupling to an uncontrollable environment which influences it in a non-negligible way. The theory of open quantum systems thus plays a major role in many applications of quantum physics since perfect isolation of quantum system is not possible and since a complete microscopic description or control of the environment degrees of freedom is not feasible or only partially so" [1]. Practical considerations therefore force one to seek for a simpler, effectively probabilistic description in terms of an open system. There is a close physi…
Bayesian hierarchical models in manufacturing bulk service queues
2006
In this paper, Queueing Theory and Bayesian statistical tools are used to analyze the congestion of various manufacturing bulk service queues with the same characteristics that are working independently of one another and in equilibrium. Hierarchical models are discussed in order to develop the whole inferential process for the parameters governing the system. Markov Chain Monte Carlo methods and numerical inversion of transforms are addressed to compute the posterior predictive distributions of the usual measures of performance in practice.
Bayesian design in queues: An application to aeronautic maintenance
2007
We exploit Bayesian criteria for designing M/M/c//r queueing systems with spares. For illustration of our approach we use a real problem from aeronautic maintenance, where the numbers of repair crews and spare planes must be sufficiently large to meet the necessary operational capacity. Bayesian guarantees for this to happen can be given using predictive or posterior distributions.
On a rough perturbation of the Navier-Stokes system and its vorticity formulation
2019
We introduce a rough perturbation of the Navier-Stokes system and justify its physical relevance from balance of momentum and conservation of circulation in the inviscid limit. We present a framework for a well-posedness analysis of the system. In particular, we define an intrinsic notion of solution based on ideas from the rough path theory and study the system in an equivalent vorticity formulation. In two space dimensions, we prove that well-posedness and enstrophy balance holds. Moreover, we derive rough path continuity of the equation, which yields a Wong-Zakai result for Brownian driving paths, and show that for a large class of driving signals, the system generates a continuous rando…
An Adaptive Parallel Tempering Algorithm
2013
Parallel tempering is a generic Markov chainMonteCarlo samplingmethod which allows good mixing with multimodal target distributions, where conventionalMetropolis- Hastings algorithms often fail. The mixing properties of the sampler depend strongly on the choice of tuning parameters, such as the temperature schedule and the proposal distribution used for local exploration. We propose an adaptive algorithm with fixed number of temperatures which tunes both the temperature schedule and the parameters of the random-walk Metropolis kernel automatically. We prove the convergence of the adaptation and a strong law of large numbers for the algorithm under general conditions. We also prove as a side…
On surrogating 0–1 knapsack constraints
1999
In this note, we present a scheme for tightening 0–1 knapsack constraints based on other knapsack constraints surrogating.
Standard forms and entanglement engineering of multimode Gaussian states under local operations
2007
We investigate the action of local unitary operations on multimode (pure or mixed) Gaussian states and single out the minimal number of locally invariant parametres which completely characterise the covariance matrix of such states. For pure Gaussian states, central resources for continuous-variable quantum information, we investigate separately the parametre reduction due to the additional constraint of global purity, and the one following by the local-unitary freedom. Counting arguments and insights from the phase-space Schmidt decomposition and in general from the framework of symplectic analysis, accompany our description of the standard form of pure n-mode Gaussian states. In particula…
Investigation of Simulated Trading — A multi agent based trading system for optimization purposes
2010
Abstract Some years ago, Bachem, Hochstattler, and Malich proposed a heuristic algorithm called Simulated Trading for the optimization of vehicle routing problems. Computational agents place buy-orders and sell-orders for customers to be handled at a virtual financial market, the prices of the orders depending on the costs of inserting the customer in the tour or for his removal. According to a proposed rule set, the financial market creates a buy-and-sell graph for the various orders in the order book, intending to optimize the overall system. Here I present a thorough investigation for the application of this algorithm to the traveling salesman problem.
A tabu search algorithm for assigning teachers to courses
2002
In this paper we deal with the problem of assigning teachers to courses in a secondary school. The problem appears when a timetable is to be built and the teaching assignments are not fixed. We have developed a tabu search algorithm to solve the problem. The parameters involved in the algorithm have been estimated by using multiple regression techniques. The computational results, obtained on a set of Spanish secondary schools, show that the solutions obtained by this automatic procedure can be favourably compared with the solutions proposed by the experts.