On the formation of current sheets in response to the compression or expansion of a potential magnetic field

The compression or expansion of a magnetic field that is initially potential is considered. It was recently suggested by Janse & Low [2009, ApJ, 690, 1089] that, following the volumetric deformation, the relevant lowest energy state for the magnetic field is another potential magnetic field that in general contains tangential discontinuities (current sheets). Here we examine this scenario directly using a numerical relaxation method that exactly preserves the topology of the magnetic field. It is found that of the magnetic fields discussed by Janse & Low, only those containing magnetic null points develop current singularities during an ideal relaxation, while the magnetic fields without null points relax toward smooth force-free equilibria with finite non-zero current.Comment: Accepted for publication in Ap

Integrating heterogeneous distributed COTS discrete-event simulation packages: An emerging standards-based approach

This paper reports on the progress made toward the emergence of standards to support the integration of heterogeneous discrete-event simulations (DESs) created in specialist support tools called commercial-off-the-shelf (COTS) discrete-event simulation packages (CSPs). The general standard for heterogeneous integration in this area has been developed from research in distributed simulation and is the IEEE 1516 standard The High Level Architecture (HLA). However, the specific needs of heterogeneous CSP integration require that the HLA is augmented by additional complementary standards. These are the suite of CSP interoperability (CSPI) standards being developed under the Simulation Interoperability Standards Organization (SISO-http://www.sisostds.org) by the CSPI Product Development Group (CSPI-PDG). The suite consists of several interoperability reference models (IRMs) that outline different integration needs of CSPI, interoperability frameworks (IFs) that define the HLA-based solution to each IRM, appropriate data exchange representations to specify the data exchanged in an IF, and benchmarks termed CSP emulators (CSPEs). This paper contributes to the development of the Type I IF that is intended to represent the HLA-based solution to the problem outlined by the Type I IRM (asynchronous entity passing) by developing the entity transfer specification (ETS) data exchange representation. The use of the ETS in an illustrative case study implemented using a prototype CSPE is shown. This case study also allows us to highlight the importance of event granularity and lookahead in the performance and development of the Type I IF, and to discuss possible methods to automate the capture of appropriate values of lookahead

Hypothalamic‐specific proopiomelanocortin deficiency reduces alcohol drinking in male and female mice

Peer Reviewedhttps://deepblue.lib.umich.edu/bitstream/2027.42/136536/1/gbb12362_am.pdfhttps://deepblue.lib.umich.edu/bitstream/2027.42/136536/2/gbb12362.pd

Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable

There has been significant recent interest in parallel graph processing due to the need to quickly analyze the large graphs available today. Many graph codes have been designed for distributed memory or external memory. However, today even the largest publicly-available real-world graph (the Hyperlink Web graph with over 3.5 billion vertices and 128 billion edges) can fit in the memory of a single commodity multicore server. Nevertheless, most experimental work in the literature report results on much smaller graphs, and the ones for the Hyperlink graph use distributed or external memory. Therefore, it is natural to ask whether we can efficiently solve a broad class of graph problems on this graph in memory. This paper shows that theoretically-efficient parallel graph algorithms can scale to the largest publicly-available graphs using a single machine with a terabyte of RAM, processing them in minutes. We give implementations of theoretically-efficient parallel algorithms for 20 important graph problems. We also present the optimizations and techniques that we used in our implementations, which were crucial in enabling us to process these large graphs quickly. We show that the running times of our implementations outperform existing state-of-the-art implementations on the largest real-world graphs. For many of the problems that we consider, this is the first time they have been solved on graphs at this scale. We have made the implementations developed in this work publicly-available as the Graph-Based Benchmark Suite (GBBS).Comment: This is the full version of the paper appearing in the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 201

Legendrian links, causality, and the Low conjecture

Let $(X^{m+1}, g)$ be a globally hyperbolic spacetime with Cauchy surface diffeomorphic to an open subset of $\mathbb R^m$. The Legendrian Low conjecture formulated by Nat\'ario and Tod says that two events x,y\in\ss are causally related if and only if the Legendrian link of spheres $\mathfrak S_x, \mathfrak S_y$ whose points are light geodesics passing through $x$ and $y$ is non-trivial in the contact manifold of all light geodesics in $X$. The Low conjecture says that for $m=2$ the events $x,y$ are causally related if and only if $\mathfrak S_x, \mathfrak S_y$ is non-trivial as a topological link. We prove the Low and the Legendrian Low conjectures. We also show that similar statements hold for any globally hyperbolic $(X^{m+1}, g)$ such that a cover of its Cauchy surface is diffeomorphic to an open domain in $\mathbb R^m.$Comment: Version 3 - minor improvements, references added 11 pages, 1 figur

Effect of multiple transverse modes in self-mixing sensors based on vertical-cavity surface-emitting lasers

We investigate the effect of coexisting transverse modes on the operation of self-mixing sensors based on vertical-cavity surface-emitting lasers (VCSELs). The effect of multiple transverse modes on the measurement of displacement and distance were examined by simulation and in laboratory experiment. The simulation model shows that the periodic change in the shape and magnitude of the self-mixing signal with modulation current can be properly explained by the different frequency-modulation coefficients of the respective transverse modes in VCSELs. The simulation results are in excellent agreement with measurements performed on single-mode and multimode VCSELs and on self-mixing sensors based on these VCSELs

Performance analysis of the Malaysian elite youth squash players

This study analysed the frequencies and court locations of squash strokes performed by elite Malaysian youth players before and during a national tournament. One hundred and seventy nine matches participated by six players (three men and three women) were analysed. Data collected via video recordings and coded post match using Studiocode® analysis software. The straight and cross court drives were the most frequent strokes used by both genders, with more on the backhand side. The drop shot and straight drives contributed to most winners for the men and women respectively. Most winners were produced by the players when they occupied the middle areas of the court. The areas that resulted most errors were the four corners of the court for the men whilst the women was on their backhand side areas. Objective feedback on the performance prior to a major competition provided some positive results.Keywords: performance analysis, squash, youth

Application of dispersion relations to low-energy meson-nucleon scattering

Relativistic dispersion relations are used to derive equations for low-energy S-, P-, and D-wave meson-nucleon scattering under the assumption that the (3,3) resonance dominates the dispersion integrals. The P-wave equations so obtained differ only slightly from those of the static fixed-source theory. The conclusions of the static theory are re-examined in the light of their new derivation