Local magnetic probes of superconductors

Investigations of the magnetic properties of high temperature superconductors (HTSs) have revealed the existence of striking new vortex phenomena due, in part, to their strong crystalline anisotropy, very short coherence lengths and the much larger thermal energies available at high temperatures. Some of these phenomena, for example vortex lattice 'melting', pose serious problems for technological applications of the most anisotropic HTS materials and a fuller understanding of them is of considerable importance. The most direct information regarding vortex structures and dynamics is obtained through local measurement of the magnetic field within or at the surface of a superconducting sample. A detailed review of such local magnetic probes is presented here including Lorentz microscopy, magnetic force microscopy, Bitter decoration, scanning Hall probe microscopy, magneto-optical imaging, and scanning superconducting quantum interference device microscopy. In each case the principles underpinning the technique are described together with the factors that limit the magnetic field and the spatial and temporal resolution. A range of examples will be given, emphasizing applications in the area of HTSs. In addition the ways in which the existing techniques can be expected to develop over the next few years will be discussed and new approaches that seem likely to be successful described.     

A note on the sunouchi operator with respect to the walsh—kaczmarz system

An analogue of the so—called Sunouchi operator with respect to the Walsh—Kaczmarz system will be investigated. We show the boundedness of this operator if we take it as a map from the dyadic Hardy space H ^p to L ^p for all 0<p≤1.. For the proof we consider a multiplier operator and prove its (H ^p H ^p)—boundedness for 0<p≤1. Since the multiplier is obviously bounded from L ² to L ², a theorem on interpolation of operators can be applied to show that our multiplier is of weak type (1,1) and of type (q q) for all 1<q<∞. The same statements follow also for the Sunouchi operator.     

An improved time domain linear sampling method for Robin and Neumann obstacles

We consider inverse obstacle scattering problems for the wave equation with Robin or Neumann boundary conditions. The problem of reconstructing the geometry of such obstacles from measurements of scattered waves in the time domain is tackled using a time domain linear sampling method. This imaging technique yields a picture of the scatterer by solving a linear operator equation involving the measured data for many right-hand sides given by singular solutions to the wave equation. We analyse this algorithm for causal and smooth impulse shapes, we discuss the effect of different choices of the singular solutions used in the algorithm, and finally we propose a fast FFT-based implementation.     

Stationary points of O’Hara’s knot energies

In this article we study the regularity of stationary points of the knot energies E ^(α) introduced by O’Hara (Topology 30(2):241–247, 1991; Topol Appl 48(2):147–161, 1992; Topol Appl 56(1):45–61, 1994) in the range ${\alpha\in(2,3)}$ . In a first step we prove that E ^(α) is C ¹ on the set of all regular embedded curves belonging to ${{H^{(\alpha+1)/2,2}(\mathbb {R}{/}\mathbb {Z}, \mathbb {R}^n)}}$ and calculate its derivative. After that we use the structure of the Euler-Lagrange equation to study the regularity of stationary points of E ^(α) plus a positive multiple of the length. We show that stationary points of finite energy are of class C ^∞—so especially all local minimizers of E ^(α) among curves with fixed length are smooth.     

Constant mean curvature surfaces in warped product manifolds

We consider surfaces with constant mean curvature in certain warped product manifolds. We show that any such surface is umbilic, provided that the warping factor satisfies certain structure conditions. This theorem can be viewed as a generalization of the classical Alexandrov theorem in Euclidean space. In particular, our results apply to the deSitter-Schwarzschild and Reissner-Nordstrom manifolds.     

Root Systems In Finite Symplectic Vector Spaces

We study realizations of root systems in possibly degenerate symplectic vector spaces over finite fields, up to symplectic isomorphisms. The main result of this article is the classification of such realizations for the field 𝔽₂. Thereby, each root system requires a specific degree of degeneracy of the symplectic vector space. Our main motivation for this article is that for each such realization of a root system we can construct a Nichols algebra over a nonabelian group.     

An independent set approach for the communication network of the GPS III system

In this article, we describe an algorithm to find the optimal communication network for the new GPS III satellite system. Finding a possible network will be translated to a maximum clique problem and an efficient algorithm for finding all maximum cliques under these special circumstances is described.     

Test-Based Variable Selection via Cross-Validation

Abstract

Test-based variable selection algorithms in regression often are based on sequential comparison of test statistics to cutoff values. A predetermined a level typically is used to determine the cutoffs based on an assumed probability distribution for the test statistic. For example, backward elimination or forward stepwise involve comparisons of test statistics to prespecified t or F cutoffs in Gaussian linear regression, while a likelihood ratio. Wald, or score statistic, is typically used with standard normal or chi square cutoffs in nonlinear settings. Although such algorithms enjoy widespread use, their statistical properties are not well understood, either theoretically or empirically. Two inherent problems with these methods are that (1) as in classical hypothesis testing, the value of α is arbitrary, while (2) unlike hypothesis testing, there is no simple analog of type I error rate corresponding to application of the entire algorithm to a data set. In this article we propose a new method, backward elimination via cross-validation (BECV), for test-based variable selection in regression. It is implemented by first finding the empirical p value α*, which minimizes a cross-validation estimate of squared prediction error, then selecting the model by running backward elimination on the entire data set using α* as the nominal p value for each test. We present results of an extensive computer simulation to evaluate BECV and compare its performance to standard backward elimination and forward stepwise selection.     

The bit‐economy: An artificial model of open‐ended technology discovery

We describe and demonstrate an artificial model of technology discovery called the Bit‐Economy. The model is built from a minimal set of fundamental hallmarks of technology and develops under an open‐ended evolutionary operator which rewards new technology which is able to coordinate both spatially and temporally with the existing technology set. The Bit‐Economy, is able to replicate several features of real technology development including nonmonotonic growth, bunching of creation and destruction events, qualitative topologies of patent networks, and efficiency and waste‐management gains. In contrast to related works, we do not apply an exogenous fitness landscape and so are able to study the process of technology discovery as a self‐guided search toward more complex outcomes. © 2013 Wiley Periodicals, Inc. Complexity 18: 57–67, 2013