Antisymmetric magnetoresistance of the SrTiO3/LaAlO3 interface

The longitudinal resistance $R_{xx}$ of the SrTiO3/LaAlO3 interface with magnetic fields applied perpendicular to the interface has an antisymmetric term (namely, $R_{xx}(H)\neq R_{xx}(-H)$) which increases with decreasing temperature and increasing field. We argue that the origin of this phenomenon is a non-homogeneous Hall effect with clear contribution of an extraordinary Hall effect, suggesting the presence of non-uniform field-induced magnetization

Costly Bidding in Online Markets for IT Services

Internet-enabled markets are becoming viable venues for procurement of professional services. We investigate bidding behavior within the most active area of these early knowledge markets—the market for software development. These markets are important both because they provide an early view of the effectiveness of online service markets and because they have a potentially large impact on how software development services are procured and provided. Using auction theory, we develop a theoretical model that relates market characteristics to bidding and transaction behavior, taking into account costly bidding. We then test our model using data from an active online market for software development services, which yields contracts for 30%–40% of posted projects. In its current format, however, the studied market may induce excessive bidding by vendors. Consistent with our theoretical predictions and those of Carr (2003), higher-value projects attract significantly more bids, with lower average quality. Greater numbers of bids raise the cost to all participants, due to costly bidding and bid evaluation. Perhaps as a consequence, higher-value projects are also much less likely to be awarded

Depth-Independent Lower bounds on the Communication Complexity of Read-Once Boolean Formulas

We show lower bounds of $\Omega(\sqrt{n})$ and $\Omega(n^{1/4})$ on the randomized and quantum communication complexity, respectively, of all $n$-variable read-once Boolean formulas. Our results complement the recent lower bound of $\Omega(n/8^d)$ by Leonardos and Saks and $\Omega(n/2^{\Omega(d\log d)})$ by Jayram, Kopparty and Raghavendra for randomized communication complexity of read-once Boolean formulas with depth $d$. We obtain our result by "embedding" either the Disjointness problem or its complement in any given read-once Boolean formula.Comment: 5 page

Online Fault Classification in HPC Systems through Machine Learning

As High-Performance Computing (HPC) systems strive towards the exascale goal, studies suggest that they will experience excessive failure rates. For this reason, detecting and classifying faults in HPC systems as they occur and initiating corrective actions before they can transform into failures will be essential for continued operation. In this paper, we propose a fault classification method for HPC systems based on machine learning that has been designed specifically to operate with live streamed data. We cast the problem and its solution within realistic operating constraints of online use. Our results show that almost perfect classification accuracy can be reached for different fault types with low computational overhead and minimal delay. We have based our study on a local dataset, which we make publicly available, that was acquired by injecting faults to an in-house experimental HPC system.Comment: Accepted for publication at the Euro-Par 2019 conferenc

An Unstructured Parallel Least-Squares Spectral Element Solver for Incompressible Flow Problems

The parallelization of the least-squares spectral element formulation of the Stokes problem has recently been discussed for incompressible flow problems on structured grids. In the present work, the extension to unstructured grids is discussed. It will be shown that, to obtain an efficient and scalable method, two different kinds of distribution of data are required involving a rather complicated parallel conversion between the data. Once the data conversion has been performed, a large symmetric positive definite algebraic system has to be solved iteratively. It is well known that the Conjugate Gradient method is a good choice to solve such systems. To improve the convergence rate of the Conjugate Gradient process, both Jacobi and Additive Schwarz preconditioners are applied. The Additive Schwarz preconditioner is based on domain decomposition and can be implemented such that a preconditioning step corresponds to a parallel matrix-by-vector product. The new results reveal that the Additive Schwarz preconditioner is very suitable for the p-refinement version of the least-squares spectral element method. To obtain good portable programs which may run on distributed-memory multiprocessors, networks of workstations as well as shared-memory machines we use MPI (Message Passing Interface). Numerical simulations have been performed to validate the scalability of the different parts of the proposed method. The experiments entailed simulating several large scale incompressible flows on a Cray T3E and on an SGI Origin 3800 with the number of processors varying from one to more than one hundred. The results indicate that the present method has very good parallel scaling properties making it a powerful method for numerical simulations of incompressible flows

The thalamic low-threshold Ca2+ potential: a key determinant of the local and global dynamics of the slow (<1 Hz) sleep oscillation in thalamocortical networks

During non-rapid eye movement sleep and certain types of anaesthesia, neurons in the neocortex and thalamus exhibit a distinctive slow (<1 Hz) oscillation that consists of alternating UP and DOWN membrane potential states and which correlates with a pronounced slow (<1 Hz) rhythm in the electroencephalogram. While several studies have claimed that the slow oscillation is generated exclusively in neocortical networks and then transmitted to other brain areas, substantial evidence exists to suggest that the full expression of the slow oscillation in an intact thalamocortical (TC) network requires the balanced interaction of oscillator systems in both the neocortex and thalamus. Within such a scenario, we have previously argued that the powerful low-threshold Ca2+ potential (LTCP)-mediated burst of action potentials that initiates the UP states in individual TC neurons may be a vital signal for instigating UP states in related cortical areas. To investigate these issues we constructed a computational model of the TC network which encompasses the important known aspects of the slow oscillation that have been garnered from earlier in vivo and in vitro experiments. Using this model we confirm that the overall expression of the slow oscillation is intricately reliant on intact connections between the thalamus and the cortex. In particular, we demonstrate that UP state-related LTCP-mediated bursts in TC neurons are proficient in triggering synchronous UP states in cortical networks, thereby bringing about a synchronous slow oscillation in the whole network. The importance of LTCP-mediated action potential bursts in the slow oscillation is also underlined by the observation that their associated dendritic Ca2+ signals are the only ones that inform corticothalamic synapses of the TC neuron output, since they, but not those elicited by tonic action potential firing, reach the distal dendritic sites where these synapses are located

RELEASE: A High-level Paradigm for Reliable Large-scale Server Software

Erlang is a functional language with a much-emulated model for building reliable distributed systems. This paper outlines the RELEASE project, and describes the progress in the first six months. The project aim is to scale the Erlang’s radical concurrency-oriented programming paradigm to build reliable general-purpose software, such as server-based systems, on massively parallel machines. Currently Erlang has inherently scalable computation and reliability models, but in practice scalability is constrained by aspects of the language and virtual machine. We are working at three levels to address these challenges: evolving the Erlang virtual machine so that it can work effectively on large scale multicore systems; evolving the language to Scalable Distributed (SD) Erlang; developing a scalable Erlang infrastructure to integrate multiple, heterogeneous clusters. We are also developing state of the art tools that allow programmers to understand the behaviour of massively parallel SD Erlang programs. We will demonstrate the effectiveness of the RELEASE approach using demonstrators and two large case studies on a Blue Gene