Searcharxiv⌕ Search

arXiv subjects

Martin Schmidt

Publications and source records attributed to Martin Schmidt.

50 records · Page 3Linked to original sources
arXiv2018

Magnetic measurements on micron-size samples under high pressure using designed NV centers

Pressure is a unique tool to tune the interplay between structural, electronic and magnetic interactions. It leads to remarkable properties of materials such as recent temperature records in superconductivity. Advanced magnetic measurements under very high pressure in the Diamond Anvil Cell (DAC) use synchrotron approaches but these are lacking a formal link to the macroscopic magnetic properties. We report an alternative method consisting in optical magnetometry based on nitrogen-vacancy (NV) centers created at the surface of a diamond anvil. We illustrate the method by two measurements realized at room and low temperature respectively: the pressure evolution of the magnetization of an iron bead up to 30 GPa showing the iron ferromagnetic collapse and the detection of the superconducting transition of MgB2 at 7 GPa.

cond-mat.mes-hall↗
arXiv2018

Injectives Hulls and Projective Covers in Categories of Generalized Uniform Hypergraphs

We construct injective hulls and projective covers in categories of generalized uniform hypergraphs which generalizes the constructions in the category of quivers and the category of undirected graphs. While the constructions are not functorial, they are "sub-functorial", meaning they are subobjects of functorial injective and projective refinements.

math.CO↗
arXiv2018

The KPP boundary layer scheme: revisiting its formulation and benchmarking one-dimensional ocean simulations relative to LES

We evaluate the Community ocean Vertical Mixing (CVMix) project version of the K-profile parameterization (KPP). For this purpose, one-dimensional KPP simulations are compared across a suite of oceanographically relevant regimes against large eddy simulations (LES). The LES is forced with horizontally uniform boundary fluxes and has horizontally uniform initial conditions, allowing its horizontal average to be compared to one-dimensional KPP tests. We find the standard configuration of KPP consistent with LES across many forcing regimes, supporting the physical basis of KPP. Our evaluation motivates recommendations for "best practices" for using KPP within ocean circulation models, and identifies areas where further research is warranted. Further, our test suite can be used as a baseline for evaluation of a broad suite of boundary layer models. The original treatment of KPP recommends the matching of interior diffusivities and their gradients to the KPP predicted values computed in the ocean surface boundary layer (OSBL). However, we find that difficulties in representing derivatives of rapidly changing diffusivities near the base of the OSBL can lead to loss of simulation fidelity. We propose two alternative approaches. We find the KPP entrainment buoyancy flux to be sensitive to vertical grid resolution and details of how to diagnose the KPP boundary layer depth. We modify the KPP turbulent shear velocity parameterization to reduce resolution dependence. Additionally, our results show that the KPP parameterized non-local tracer flux is incomplete due to the assumption that it solely redistributes the surface tracer flux. However, examination of the LES vertical turbulent scalar flux budgets show that non-local fluxes can exist in the absence of surface tracer fluxes. This result motivates further studies of the non-local flux parameterization.

physics.ao-ph↗
arXiv2017

Model and Discretization Error Adaptivity within Stationary Gas Transport Optimization

The minimization of operation costs for natural gas transport networks is studied. Based on a recently developed model hierarchy ranging from detailed models of instationary partial differential equations with temperature dependence to highly simplified algebraic equations, modeling and discretization error estimates are presented to control the overall error in an optimization method for stationary and isothermal gas flows. The error control is realized by switching to more detailed models or finer discretizations if necessary to guarantee that a prescribed model and discretization error tolerance is satisfied in the end. We prove convergence of the adaptively controlled optimization method and illustrate the new approach with numerical examples.

math.OC↗
arXiv2017

Oriented Hypergraphic Matrix-tree Type Theorems and Bidirected Minors via Boolean Order Ideals

Restrictions of incidence-preserving path maps produce an oriented hypergraphic All Minors Matrix-tree Theorems for Laplacian and adjacency matrices. The images of these maps produce a locally signed graphic, incidence generalization, of cycle covers and basic figures that correspond to incidence-k-forests. When restricted to bidirected graphs the natural partial ordering of maps results in disjoint signed boolean lattices whose minor calculations correspond to principal order ideals. As an application, (1) the determinant formula of a signed graphic Laplacian is reclaimed and shown to be determined by the maximal positive-circle-free elements, and (2) spanning trees are equivalent to single-element order ideals.

math.CO↗
arXiv2017

Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps

Feasibility pumps are highly effective primal heuristics for mixed-integer linear and nonlinear optimization. However, despite their success in practice there are only few works considering their theoretical properties. We show that feasibility pumps can be seen as alternating direction methods applied to special reformulations of the original problem, inheriting the convergence theory of these methods. Moreover, we propose a novel penalty framework that encompasses this alternating direction method, which allows us to refrain from random perturbations that are applied in standard versions of feasibility pumps in case of failure. We present a convergence theory for the new penalty based alternating direction method and compare the new variant of the feasibility pump with existing versions in an extensive numerical study for mixed-integer linear and nonlinear problems.

math.OC↗
arXiv2017

Structural Resolution: a Framework for Coinductive Proof Search and Proof Construction in Horn Clause Logic

Logic programming (LP) is a programming language based on first-order Horn clause logic that uses SLD-resolution as a semi-decision procedure. Finite SLD-computations are inductively sound and complete with respect to least Herbrand models of logic programs. Dually, the corecursive approach to SLD-resolution views infinite SLD-computations as successively approximating infinite terms contained in programs' greatest complete Herbrand models. State-of-the-art algorithms implementing corecursion in LP are based on loop detection. However, such algorithms support inference of logical entailment only for rational terms, and they do not account for the important property of productivity in infinite SLD-computations. Loop detection thus lags behind coinductive methods in interactive theorem proving (ITP) and term-rewriting systems (TRS). Structural resolution is a newly proposed alternative to SLD-resolution that makes it possible to define and semi-decide a notion of productivity appropriate to LP. In this paper, we prove soundness of structural resolution relative to Herbrand model semantics for productive inductive, coinductive, and mixed inductive-coinductive logic programs. We introduce two algorithms that support coinductive proof search for infinite productive terms. One algorithm combines the method of loop detection with productive structural resolution, thus guaranteeing productivity of coinductive proofs for infinite rational terms. The other allows to make lazy sound observations of fragments of infinite irrational productive terms. This puts coinductive methods in LP on par with productivity-based observational approaches to coinduction in ITP and TRS.

cs.LO↗
arXiv2015

Potential Errors and Test Assessment in Software Product Line Engineering

Software product lines (SPL) are a method for the development of variant-rich software systems. Compared to non-variable systems, testing SPLs is extensive due to an increasingly amount of possible products. Different approaches exist for testing SPLs, but there is less research for assessing the quality of these tests by means of error detection capability. Such test assessment is based on error injection into correct version of the system under test. However to our knowledge, potential errors in SPL engineering have never been systematically identified before. This article presents an overview over existing paradigms for specifying software product lines and the errors that can occur during the respective specification processes. For assessment of test quality, we leverage mutation testing techniques to SPL engineering and implement the identified errors as mutation operators. This allows us to run existing tests against defective products for the purpose of test assessment. From the results, we draw conclusions about the error-proneness of the surveyed SPL design paradigms and how quality of SPL tests can be improved.

cs.SE↗
arXiv2014

(Co)recursion in Logic Programming: Lazy vs Eager

CoAlgebraic Logic Programming (CoALP) is a dialect of Logic Programming designed to bring a more precise compile-time and run-time analysis of termination and productivity for recursive and corecursive functions in Logic Programming. Its second goal is to introduce guarded lazy (co)recursion akin to functional theorem provers into logic programming. In this paper, we explain lazy features of CoALP, and compare them with the loop-analysis and eager execution in Coinductive Logic Programming (CoLP). We conclude by outlining the future directions in developing the guarded (co)recursion in logic programming.

cs.PL↗
arXiv2013

Coalgebraic Logic Programming: from Semantics to Implementation

Coinductive definitions, such as that of an infinite stream, may often be described by elegant logic programs, but ones for which SLD-refutation is of no value as SLD-derivations fall into infinite loops. Such definitions give rise to questions of lazy corecursive derivations and parallelism, as execution of such logic programs can have both recursive and corecursive features at once. Observational and coalgebraic semantics have been used to study them abstractly. The programming developments have often occurred separately and have usually been implementation-led. Here, we give a coherent semantics-led account of the issues, starting with abstract category theoretic semantics, developing coalgebra to characterise naturally arising trees, and proceeding towards implementation of a new dialect, CoALP, of logic programming, characterised by guarded lazy corecursion and parallelism.

cs.PL↗
arXiv2013

Exploiting Parallelism in Coalgebraic Logic Programming

We present a parallel implementation of Coalgebraic Logic Programming (CoALP) in the programming language Go. CoALP was initially introduced to reflect coalgebraic semantics of logic programming, with coalgebraic derivation algorithm featuring both corecursion and parallelism. Here, we discuss how the coalgebraic semantics influenced our parallel implementation of logic programming.

cs.PL↗
arXiv2013

Random Matrix Theory approach to Mesoscopic Fluctuations of Heat Current

We consider an ensemble of fully connected networks of N oscillators coupled harmonically with random springs and show, using Random Matrix Theory considerations, that both the average phonon heat current and its variance are scale-invariant and take universal values in the large N-limit. These anomalous mesoscopic uctuations is the hallmark of strong correlations between normal modes.

cond-mat.stat-mech↗
arXiv2010

The roundtable: an abstract model of conversation dynamics

Is it possible to abstract a formal mechanism originating schisms and governing the size evolution of social conversations? In this work a constructive solution to such problem is proposed: an abstract model of a generic N-party turn-taking conversation. The model develops from simple yet realistic assumptions derived from experimental evidence, abstracts from conversation content and semantics while including topological information, and is driven by stochastic dynamics. We find that a single mechanism - namely the dynamics of conversational party's individual fitness, as related to conversation size - controls the development of the self-organized schisming phenomenon. Potential generalizations of the model - including individual traits and preferences, memory effects and more elaborated conversational topologies - may find important applications also in other fields of research, where dynamically-interacting and networked agents play a fundamental role.

physics.soc-ph↗