The aim of this work is to simulate correctly in 3D space the phenomena that govern relaxation semiconductors. To avoid relevant constraints inadequate mesh a new technique for refining irregular meshing has been creating. Each length sample will be considered as partial sum geometric series, calculation argument allow calculate distance between nodes. In paper we proposed use an algorithm comb...

Relaxation phenomena in glasses are a subject of utmost interest, as they are deeply connected with their structure and dynamics. From a theoretical point of view, mechanical relaxation allows one to get insight into the different atomic-scale processes taking place in the glassy state. Focusing on their possible applications, relaxation behavior influences the mechanical properties of metallic...

A Markovian Petri net is a stochastic discrete event system frequently used for analysis and performance evaluation purposes. In the past, the fluidification has been proposed as a relaxation technique for avoiding the ”state explosion problem”. Following the same approach, in this paper a hybrid Petri net model is defined as a partial relaxation of an original Markovian Petri net. It is shown ...

We analyze simple quantum error detection and quantum error correction protocols relevant to current experiments with superconducting qubits. We show that for qubits with energy relaxation the repetitive N -qubit codes cannot be used for quantum error correction, but can be used for quantum error detection. In the latter case it is sufficient to use only two qubits for the encoding. In the anal...

An experimental technique for the indirect manipulation and detection of electron spins entangled in two-dimensional magnetoexcitons has been developed. The kinetics of the spin relaxation has been investigated. Photoexcited spin-magnetoexcitons were found to exhibit extremely slow relaxation in specific quantum Hall systems, fabricated in high mobility GaAs/AlGaAs structures; namely, the relax...

The class of POPs (Polynomial Optimization Problems) over cones covers a wide range of optimization problems such as 0-1 integer linear and quadratic programs, nonconvex quadratic programs and bilinear matrix inequalities. This paper presents a new framework for convex relaxation of POPs over cones in terms of linear optimization problems over cones. It provides a unified treatment of many exis...

In this paper we present a discretization reformulation technique in the context of a facility location problem with modular link costs. We present a ‘traditional’ model and a straightforward discretized model with a general objective function. The linear relaxation bounds provided by both formulations are compared. Furthermore, we state that a restricted version of the discretized model gives ...