NMR in Crystals and Powders of Topazes with Different Colours

The present work is a part of the large project with purpose to investigate microstructure and electronic structure of natural topazes using NMR method. To reach this task we determined the relative contents of fluorine and hydrogen in crystals blue, colorless, wine and wine irradiated topazes. Then we determined the electric field gradients in site of aluminium atoms by NMR method, calculated EFG using ab initio method, and measured relaxation time dependence on heating temperature for blue, colorless, Swiss blue and sky blue topazes. Nuclear magnetic resonance (NMR) is an effective method to investigate the local structure in the crystal. The NMR study of the single crystal gives detailed information especially about the local crystal structure. As a result of this work we have received practical data, which is possible to use in future for making personal dosimetry and for preparation of mullite, which is widely used in traditional and advanced ceramic materials.

Mapping strain exerted on blood vessel walls using deuterium double-quantum-filtered MRI

A technique is described for displaying distinct tissue layers of large blood vessel walls as well as measuring their mechanical strain. The technique is based on deuterium double-quantum-filtered (DQF) spectroscopic imaging. The effectiveness of the double-quantum filtration in suppressing the signal of bulk water is demonstrated on a phantom consisting of rat tail tendon fibers. Only intrafibrillar water is displayed, excluding all other signals of water molecules that reorient isotropically. One- and two-dimensional spectroscopic imaging of bovine aorta and coronary arteries show the characteristic DQF spectrum of each of the tissue layers. This property is used to obtain separate images of the outer layer, the tunica adventitia, or the intermediate layer, the tunica media, or both. To visualize the effect of elongation, the average residual quadrupole splitting <Δνq> is calculated for each pixel. Two-dimensional deuterium quadrupolar splitting images are obtained for a fully relaxed and a 55% elongated sample of bovine coronary artery. These images indicate that the strong effect of strain is associated with water molecules in the tunica adventitia whereas the DQF NMR signal of water in the tunica media is apparently strain-insensitive. After appropriate calibration, these average quadrupolar splitting images can be interpreted as strain maps.

Measurement of the Neutrino Mass Splitting and Flavor Mixing by MINOS

Measurements of neutrino oscillations using the disappearance of muon neutrinos from the Fermilab NuMI neutrino beam as observed by the two MINOS detectors are reported. New analysis methods have been applied to an enlarged data sample from an exposure of 7.25 x 10(20) protons on target. A fit to neutrino oscillations yields values of vertical bar Delta m(2)vertical bar = (2.32(-0.08)(+0.12) x 10(-3) eV(2) for the atmospheric mass splitting and sin(2)(2 theta) > 0.90 (90% C.L.) for the mixing angle. Pure neutrino decay and quantum decoherence hypotheses are excluded at 7 and 9 standard deviations, respectively.

Splitting of the zero-energy edge states in bilayer graphene

Bilayer graphene nanoribbons with zigzag termination are studied within the tight-binding model. We also include single-site electron-electron interactions via the Hubbard model within the unrestricted Hartree-Fock approach. We show that either the interactions between the outermost edge atoms or the presence of a magnetic order can cause a splitting of the zero-energy edge states. Two kinds of edge alignments are considered. For one kind of edge alignment (?) the system is nonmagnetic unless the Hubbard parameter U becomes greater than a critical value Uc. For the other kind of edge alignment (?) the system is magnetic for any U>0. Our results agree very well with ab initio density functional theory calculations.

Contrasting LH-HH subband splitting of strained quantum wells grown along [001] and [113] directions

Contrasting responses for the temperature tuning of the electronic structure in semiconductor quantum wells are discussed for heterolayered structures grown along (001) and (113) directions. The temperature affects the strain modulation of the deformation potentials and the effective optical gap is tuned along with the intersub-band splitting in the valence band. A multiband theoretical model accounts for the characterization of the electronic structure, highlighting the main qualitative and quantitative differences between the two systems under study. The microscopic source of strain fields and the detailed mapping of their distribution are provided by a simulation using classical molecular-dynamics technics.

Nonclassical correlation in NMR quadrupolar systems

The existence of quantum correlation (as revealed by quantum discord), other than entanglement and its role in quantum-information processing (QIP), is a current subject for discussion. In particular, it has been suggested that this nonclassical correlation may provide computational speedup for some quantum algorithms. In this regard, bulk nuclear magnetic resonance (NMR) has been successfully used as a test bench for many QIP implementations, although it has also been continuously criticized for not presenting entanglement in most of the systems used so far. In this paper, we report a theoretical and experimental study on the dynamics of quantum and classical correlations in an NMR quadrupolar system. We present a method for computing the correlations from experimental NMR deviation-density matrices and show that, given the action of the nuclear-spin environment, the relaxation produces a monotonic time decay in the correlations. Although the experimental realizations were performed in a specific quadrupolar system, the main results presented here can be applied to whichever system uses a deviation-density matrix formalism.

NMR quadrupolar system described as Bose-Einstein-condensate-like system

This paper presents a description of nuclear magnetic resonance (NMR) of quadrupolar systems using the Holstein-Primakoff (HP) formalism and its analogy with a Bose-Einstein condensate (BEC) system. Two nuclear spin systems constituted of quadrupolar nuclei I=3/2 ((23)Na) and I=7/2 ((133)Cs) in lyotropic liquid crystals were used for experimental demonstrations. Specifically, we derived the conditions necessary for accomplishing the analogy, executed the proper experiments, and compared with quantum mechanical prediction for a Bose system. The NMR description in the HP representation could be applied in the future as a workbench for BEC-like systems, where the statistical properties may be obtained using the intermediate statistic, first established by Gentile. The description can be applied for any quadrupolar systems, including new developed solid-state NMR GaAS nanodevices.

Skewness, splitting number and vertex deletion of some toroidal meshes

The skewness sk(G) of a graph G = (V, E) is the smallest integer sk(G) >= 0 such that a planar graph can be obtained from G by the removal of sk(C) edges. The splitting number sp(G) of C is the smallest integer sp(G) >= 0 such that a planar graph can be obtained from G by sp(G) vertex splitting operations. The vertex deletion vd(G) of G is the smallest integer vd(G) >= 0 such that a planar graph can be obtained from G by the removal of vd(G) vertices. Regular toroidal meshes are popular topologies for the connection networks of SIMD parallel machines. The best known of these meshes is the rectangular toroidal mesh C(m) x C(n) for which is known the skewness, the splitting number and the vertex deletion. In this work we consider two related families: a triangulation Tc(m) x c(n) of C(m) x C(n) in the torus, and an hexagonal mesh Hc(m) x c(n), the dual of Tc(m) x c(n) in the torus. It is established that sp(Tc(m) x c(n)) = vd(Tc(m) x c(n) = sk(Hc(m) x c(n)) = sp(Hc(m) x c(n)) = vd(Hc(m) x c(n)) = min{m, n} and that sk(Tc(m) x c(n)) = 2 min {m, n}.

On the importance function in splitting simulation

The splitting method is a simulation technique for the estimation of very small probabilities. In this technique, the sample paths are split into multiple copies, at various stages in the simulation. Of vital importance to the efficiency of the method is the Importance Function (IF). This function governs the placement of the thresholds or surfaces at which the paths are split. We derive a characterisation of the optimal IF and show that for multi-dimensional models the natural choice for the IF is usually not optimal. We also show how nearly optimal splitting surfaces can be derived or simulated using reverse time analysis. Our numerical experiments illustrate that by using the optimal IF, one can obtain a significant improvement in simulation efficiency.

On the implementation of real-time slotbased task-splitting scheduling algorithms for multiprocessor systems

In this paper we discuss challenges and design principles of an implementation of slot-based tasksplitting algorithms into the Linux 2.6.34 version. We show that this kernel version is provided with the required features for implementing such scheduling algorithms. We show that the real behavior of the scheduling algorithm is very close to the theoretical. We run and discuss experiments on 4-core and 24-core machines.

Implementing slot-based task-splitting multiprocessor scheduling

Consider the problem of scheduling a set of sporadic tasks on a multiprocessor system to meet deadlines using a task-splitting scheduling algorithm. Task-splitting (also called semi-partitioning) scheduling algorithms assign most tasks to just one processor but a few tasks are assigned to two or more processors, and they are dispatched in a way that ensures that a task never executes on two or more processors simultaneously. A particular type of task-splitting algorithms, called slot-based task-splitting dispatching, is of particular interest because of its ability to schedule tasks with high processor utilizations. Unfortunately, no slot-based task-splitting algorithm has been implemented in a real operating system so far. In this paper we discuss and propose some modifications to the slot-based task-splitting algorithm driven by implementation concerns, and we report the first implementation of this family of algorithms in a real operating system running Linux kernel version 2.6.34. We have also conducted an extensive range of experiments on a 4-core multicore desktop PC running task-sets with utilizations of up to 88%. The results show that the behavior of our implementation is in line with the theoretical framework behind it.

Practical aspects of slot-based task- splitting dispatching in its schedulability analysis

Consider the problem of scheduling a set of sporadic tasks on a multiprocessor system to meet deadlines using a tasksplitting scheduling algorithm. Task-splitting (also called semipartitioning) scheduling algorithms assign most tasks to just one processor but a few tasks are assigned to two or more processors, and they are dispatched in a way that ensures that a task never executes on two or more processors simultaneously. A certain type of task-splitting algorithms, called slot-based task-splitting, is of particular interest because of its ability to schedule tasks at high processor utilizations. We present a new schedulability analysis for slot-based task-splitting scheduling algorithms that takes the overhead into account and also a new task assignment algorithm.

Implementing multicore real-time scheduling algorithms based on task splitting using ada 2012

Multiprocessors, particularly in the form of multicores, are becoming standard building blocks for executing reliable software. But their use for applications with hard real-time requirements is non-trivial. Well-known realtime scheduling algorithms in the uniprocessor context (Rate-Monotonic [1] or Earliest-Deadline-First [1]) do not perform well on multiprocessors. For this reason the scientific community in the area of real-time systems has produced new algorithms specifically for multiprocessors. In the meanwhile, a proposal [2] exists for extending the Ada language with new basic constructs which can be used for implementing new algorithms for real-time scheduling; the family of task splitting algorithms is one of them which was emphasized in the proposal [2]. Consequently, assessing whether existing task splitting multiprocessor scheduling algorithms can be implemented with these constructs is paramount. In this paper we present a list of state-of-art task-splitting multiprocessor scheduling algorithms and, for each of them, we present detailed Ada code that uses the new constructs.

Unified overhead-aware schedulability analysis for slot-based task-splitting

Hard real- time multiprocessor scheduling has seen, in recent years, the flourishing of semi-partitioned scheduling algorithms. This category of scheduling schemes combines elements of partitioned and global scheduling for the purposes of achieving efficient utilization of the system’s processing resources with strong schedulability guarantees and with low dispatching overheads. The sub-class of slot-based “task-splitting” scheduling algorithms, in particular, offers very good trade-offs between schedulability guarantees (in the form of high utilization bounds) and the number of preemptions/migrations involved. However, so far there did not exist unified scheduling theory for such algorithms; each one was formulated in its own accompanying analysis. This article changes this fragmented landscape by formulating a more unified schedulability theory covering the two state-of-the-art slot-based semi-partitioned algorithms, S-EKG and NPS-F (both fixed job-priority based). This new theory is based on exact schedulability tests, thus also overcoming many sources of pessimism in existing analysis. In turn, since schedulability testing guides the task assignment under the schemes in consideration, we also formulate an improved task assignment procedure. As the other main contribution of this article, and as a response to the fact that many unrealistic assumptions, present in the original theory, tend to undermine the theoretical potential of such scheduling schemes, we identified and modelled into the new analysis all overheads incurred by the algorithms in consideration. The outcome is a new overhead-aware schedulability analysis that permits increased efficiency and reliability. The merits of this new theory are evaluated by an extensive set of experiments.