The concept of mass-density in classical thermodynamics and the Boltzmann kinetic equation for dilute gases

In this paper we discuss the mass-density of gas media as represented in kinetic theory. It is argued that conventional representations of this variable in gas kinetic theory contradict a macroscopic field variable and thermodynamic property in classical thermodynamics. We show that in cases where mass-density variations exist throughout the medium, introducing the mass-density as a macroscopic field variable leads to a restructuring of the diffusive/convective fluxes and implies some modifications to the hydrodynamic equations describing gas flows and heat transfer. As an illustration, we consider the prediction of mass-density profiles in a simple heat conduction problem between parallel plates maintained at different temperatures

Moving Difference (MDIFF) Non-adiabatic Rapid Sweep (NARS) EPR of Copper(II)

Non-adiabatic rapid sweep (NARS) EPR spectroscopy has been introduced for application to nitroxide-labeled biological samples (Kittell et al., 2011). Displays are pure absorption, and are built up by acquiring data in spectral segments that are concatenated. In this paper we extend the method to frozen solutions of copper-imidazole, a square planar copper complex with four in-plane nitrogen ligands. Pure absorption spectra are created from concatenation of 170 5-gauss segments spanning 850 G at 1.9 GHz. These spectra, however, are not directly useful since nitrogen superhyperfine couplings are barely visible. Application of the moving difference (MDIFF) algorithm to the digitized NARS pure absorption spectrum is used to produce spectra that are analogous to the first harmonic EPR. The signal intensity is about four times higher than when using conventional 100 kHz field modulation, depending on line shape. MDIFF not only filters the spectrum, but also the noise, resulting in further improvement of the SNR for the same signal acquisition time. The MDIFF amplitude can be optimized retrospectively, different spectral regions can be examined at different amplitudes, and an amplitude can be used that is substantially greater than the upper limit of the field modulation amplitude of a conventional EPR spectrometer, which improves the signal-to-noise ratio of broad lines

Graphene integer quantum Hall effect in the ferromagnetic and paramagnetic regimes

Starting from the graphene lattice tight-binding Hamiltonian with an on-site U and long-range Coulomb repulsion, we derive an interacting continuum Dirac theory governing the low-energy behavior of graphene in an applied magnetic field. Initially, we consider a clean graphene system within this effective theory and explore integer quantum Hall ferromagnetism stabilized by exchange from the long-range Coulomb repulsion. We study in detail the ground state and excitations at nu = 0 and nu = \pm 1, taking into account small symmetry-breaking terms that arise from the lattice-scale interactions, and also explore the ground states selected at nu = \pm 3, \pm 4, and \pm 5. We argue that the ferromagnetic regime may not yet be realized in current experimental samples, which at the above filling factors perhaps remain paramagnetic due to strong disorder. In an attempt to access the latter regime where the role of exchange is strongly suppressed by disorder, we apply Hartree theory to study the effects of interactions. Here, we find that Zeeman splitting together with symmetry-breaking interactions can in principle produce integer quantum Hall states in a paramagnetic system at nu = 0, \pm 1 and \pm 4, but not at nu = \pm 3 or \pm 5, consistent with recent experiments in high magnetic fields. We make predictions for the activation energies in these quantum Hall states which will be useful for determining their true origin.Comment: 13 pages, 2 figure

Local Out-Tournaments with Upset Tournament Strong Components I: Full and Equal {0,1}-Matrix Ranks

A digraph D is a local out-tournament if the outset of every vertex is a tournament. Here, we use local out-tournaments, whose strong components are upset tournaments, to explore the corresponding ranks of the adjacency matrices. Of specific interest is the out-tournament whose adjacency matrix has boolean, nonnegative integer, term, and real rank all equal to the number of vertices, n. Corresponding results for biclique covers and partitions of the digraph are provided

Dupilumab for bullous pemphigoid with intractable pruritus

Bullous pemphigoid (BP) is an autoimmune blistering disorder that predominantly affects the elderly. Treatment regimens typically include topical and systemic immunosuppressive medications. Although effective, systemic corticosteroids are sometimes poorly tolerated in the elderly patient, contributing to the overall morbidity and mortality of BP. Dupilumab is a monoclonal antibody targeting interleukin 4 receptor alpha (IL4R?), approved for the treatment of atopic dermatitis, as well as moderate to severe asthma and chronic rhinosinusitis with nasal polyposis. In recent reports, dupilumab has been successfully used off-label to treat a variety of pruritic disorders, including chronic spontaneous urticaria [1], anal and genital itch [2], allergic contact dermatitis [3], and prurigo nodularis [4, 5]. We report here a case of an elderly patient with refractory BP whose symptoms of pruritus and blistering became well-controlled with the addition of dupilumab to the treatment regimen

Lagrangian Relaxation for MAP Estimation in Graphical Models

We develop a general framework for MAP estimation in discrete and Gaussian graphical models using Lagrangian relaxation techniques. The key idea is to reformulate an intractable estimation problem as one defined on a more tractable graph, but subject to additional constraints. Relaxing these constraints gives a tractable dual problem, one defined by a thin graph, which is then optimized by an iterative procedure. When this iterative optimization leads to a consistent estimate, one which also satisfies the constraints, then it corresponds to an optimal MAP estimate of the original model. Otherwise there is a ``duality gap'', and we obtain a bound on the optimal solution. Thus, our approach combines convex optimization with dynamic programming techniques applicable for thin graphs. The popular tree-reweighted max-product (TRMP) method may be seen as solving a particular class of such relaxations, where the intractable graph is relaxed to a set of spanning trees. We also consider relaxations to a set of small induced subgraphs, thin subgraphs (e.g. loops), and a connected tree obtained by ``unwinding'' cycles. In addition, we propose a new class of multiscale relaxations that introduce ``summary'' variables. The potential benefits of such generalizations include: reducing or eliminating the ``duality gap'' in hard problems, reducing the number or Lagrange multipliers in the dual problem, and accelerating convergence of the iterative optimization procedure.Comment: 10 pages, presented at 45th Allerton conference on communication, control and computing, to appear in proceeding