A Theorem for Numerical Verification on Local Uniqueness of Solutions to Fixed-Point Equations

We give a theoretical result with respect to numerical verification of existence and local uniqueness of solutions to fixed-point equations which are supposed to have Fréchet differentiable operators. The theorem is based on Banach's fixed-point theorem and gives sufficient conditions in order that a given set of functions includes a unique solution to the fixed-point equation. The conditions are formulated to apply readily to numerical verification methods.

We already derived such a theorem in [11 N. Yamamoto ( 1998 ). A numerical verification method for solutions of boundary value problems with local uniqueness by Banach's fixed-point theorem . SIAM J. Numer. Anal. 35 : 2004 – 2013 .[Crossref] , [Google Scholar]], which is suitable to Nakao's methods on numerical verification for PDEs. The present theorem has a more general form and one may apply it to many kinds of differential equations and integral equations which can be transformed into fixed-point equations.     

Parallel MRI at microtesla fields

Parallel imaging techniques have been widely used in high-field magnetic resonance imaging (MRI). Multiple receiver coils have been shown to improve image quality and allow accelerated image acquisition. Magnetic resonance imaging at ultra-low fields (ULF MRI) is a new imaging approach that uses SQUID (superconducting quantum interference device) sensors to measure the spatially encoded precession of pre-polarized nuclear spin populations at microtesla-range measurement fields. In this work, parallel imaging at microtesla fields is systematically studied for the first time. A seven-channel SQUID system, designed for both ULF MRI and magnetoencephalography (MEG), is used to acquire 3D images of a human hand, as well as 2D images of a large water phantom. The imaging is performed at 46 mu T measurement field with pre-polarization at 40 mT. It is shown how the use of seven channels increases imaging field of view and improves signal-to-noise ratio for the hand images. A simple procedure for approximate correction of concomitant gradient artifacts is described. Noise propagation is analyzed experimentally, and the main source of correlated noise is identified. Accelerated imaging based on one-dimensional undersampling and 1D SENSE (sensitivity encoding) image reconstruction is studied in the case of the 2D phantom. Actual threefold imaging acceleration in comparison to single-average fully encoded Fourier imaging is demonstrated. These results show that parallel imaging methods are efficient in ULF MRI, and that imaging performance of SQUID-based instruments improves substantially as the number of channels is increased.     

Implementation of controlled phase shift gates and Collins version of Deutsch-Jozsa algorithm on a quadrupolar spin-7/2 nucleus using non-adiabatic geometric phases

In this work controlled phase shift gates are implemented on a qaudrupolar system, by using non-adiabatic geometric phases. A general procedure is given, for implementing controlled phase shift gates in an ‘N’ level system. The utility of such controlled phase shift gates, is demonstrated here by implementing 3-qubit Deutsch–Jozsa algorithm on a spin-7/2 quadrupolar nucleus oriented in a liquid crystal matrix.     

Simulating the Monty Hall problem in a DNA sequencing machine

The Monty Hall problem is a decision problem with an answer that is surprisingly counter-intuitive yet provably correct. Here we simulate and prove this decision in a high-throughput DNA sequencing machine, using a simple encoding. All possible scenarios are represented by DNA oligonucleotides, and gameplay decisions are implemented by sequencing these oligonucleotides from specific positions, with a single run simulating more than 12,000,000 independent games. This work highlights high-throughput DNA sequencing as a new tool that could extend existing capabilities and enable new encoding schemes for problems in DNA computing.     

Constructing Four-Photon States for Quantum Communication and Information Processing

We provide a method for constructing a set of four-photon states suitable for quantum communication applications. Among these states is a set of concatenated quantum code states that span a decoherence-free subspace that is robust under collective-local as well as global dephasing noise. This method requires only the use of spontaneous parametric down-conversion, quantum state post-selection, and linear optics. In particular, we show how this method can be used to produce all sixteen elements of the second-order Bell gem , which includes these codes states and is an orthonormal basis for the Hilbert space of four qubits composed entirely of states that are fully entangled under the four-tangle measure.     

Study on Interaction Between Two Parallel Plates with Iteration Method in Functional Theory

利用泛函分析理论中的迭代法,分别计算了平行平板双电层在高、中、低电位下的相互作用能,并以数值法所得结果为参照,在各电位下分别与Debye-Hückel线性近似法、Langmuir近似法所得的结果进行比较．结果表明,DH线性近似法和Langmuir近似法均只能分别局限于极低或极高电位,而泛函迭代法不但有简单的解析表达式,而且在各种电位下都能得到较满意的结果.     

The Application of Fractal Transform and Entropy for Improving Fault Tolerance and Load Balancing in Grid Computing Environments

This paper applies the entropy-based fractal indexing scheme that enables the grid environment for fast indexing and querying. It addresses the issue of fault tolerance and load balancing-based fractal management to make computational grids more effective and reliable. A fractal dimension of a cloud of points gives an estimate of the intrinsic dimensionality of the data in that space. The main drawback of this technique is the long computing time. The main contribution of the suggested work is to investigate the effect of fractal transform by adding R-tree index structure-based entropy to existing grid computing models to obtain a balanced infrastructure with minimal fault. In this regard, the presented work is going to extend the commonly scheduling algorithms that are built based on the physical grid structure to a reduced logical network. The objective of this logical network is to reduce the searching in the grid paths according to arrival time rate and path’s bandwidth with respect to load balance and fault tolerance, respectively. Furthermore, an optimization searching technique is utilized to enhance the grid performance by investigating the optimum number of nodes extracted from the logical grid. The experimental results indicated that the proposed model has better execution time, throughput, makespan, latency, load balancing, and success rate.     

A matrix-free high-order discontinuous Galerkin compressible Navier-Stokes solver: A performance comparison of compressible and incompressible formulations for turbulent incompressible flows

Both compressible and incompressible Navier-Stokes solvers can be used and are used to solve incompressible turbulent flow problems. In the compressible case, the Mach number is then considered as a solver parameter that is set to a small value, M ≈0.1, in order to mimic incompressible flows. This strategy is widely used for high-order discontinuous Galerkin (DG) discretizations of the compressible Navier-Stokes equations. The present work raises the question regarding the computational efficiency of compressible DG solvers as compared to an incompressible formulation. Our contributions to the state of the art are twofold: Firstly, we present a high-performance DG solver for the compressible Navier-Stokes equations based on a highly efficient matrix-free implementation that targets modern cache-based multicore architectures with Flop/Byte ratios significantly larger than 1. The performance results presented in this work focus on the node-level performance, and our results suggest that there is great potential for further performance improvements for current state-of-the-art DG implementations of the compressible Navier-Stokes equations. Secondly, this compressible Navier-Stokes solver is put into perspective by comparing it to an incompressible DG solver that uses the same matrix-free implementation. We discuss algorithmic differences between both solution strategies and present an in-depth numerical investigation of the performance. The considered benchmark test cases are the three-dimensional Taylor-Green vortex problem as a representative of transitional flows and the turbulent channel flow problem as a representative of wall-bounded turbulent flows. The results indicate a clear performance advantage of the incompressible formulation over the compressible one.     

Impact of tetrahedralization on parallel conforming octree mesh generation

This work discusses the performance impact from the tetrahedralization of non‐conforming meshes generated by a parallel octree method capable of handling arbitrary immersed geometries. First, we review conforming techniques for meshes created from octrees. Then we implement a tetrahedralization scheme based on templates in a parallel meshing algorithm that uses a linear octree with 2:1 balancing constraint. Besides, we also propose a change on the partitioning strategy for the same meshing algorithm to improve the octree refinement load balancing. Scalability analyses show that the chosen tetrahedralization technique preserves algorithm performance. Copyright © 2014 John Wiley & Sons, Ltd.