Magnetothermoelectric DC conductivities from holography models with hyperscaling factor in Lifshitz spacetime

We investigate an Einstein-Maxwell-Dilaton-Axion holographic model and obtain two branches of a charged black hole solution with a dynamic exponent and a hyperscaling violation factor when a magnetic field presents. The magnetothermoelectric DC conductivities are then calculated in terms of horizon data by means of holographic principle. We find that linear temperature dependence resistivity and quadratic temperature dependence inverse Hall angle can be achieved in our model. The well-known anomalous temperature scaling of the Nernst signal and the Seebeck coefficient of cuprate strange metals are also discussed.Comment: 1+23 pages, 4 figures, references adde

3,3′-(2,2′-Bi-1H-imidazole-1,1′-diyl)dipropanol

In the title compound, C12H18N4O2, unlike other unconjugated disubstituted biimidazole derivatives reported so far, the two imidazole rings in a trans conformation exhibit a large planar rotation angle of 51.27 (4)°, and consist of half-mol­ecule asymmetric units related by a twofold rotation. The mol­ecules are linked into a three-dimensional framework with a parallel laminated construction via O—H⋯N and C—H⋯O inter­actions

DUAL RECTANGULAR RING WITH OPEN-ENDED CPW-FED MONOPOLE ANTENNA FOR WIMAX/WLAN APPLICATIONS

Abstract—A coplanar waveguide (CPW)-fed planar monopole antenna with triple-band operation for worldwide interoperability for microwave access (WiMAX) and wireless local area network (WLAN) applications is presented. The antenna comprises dual rectangular ring with open-end. The triple operating bands with 10-dB return-loss bandwidths of about 30.8 % ranging from 2.2 to 2.97GHz, 23.4% ranging from 3.17 to 3.99GHz, and 25.4 % ranging from 4.91 to 6.31GHz, covering the required bandwidths of 2.4/5.2/5.8GHz WLAN and 3.5/5.5GHz WiMAX standards, are obtained. 1

Dependency Stochastic Boolean Satisfiability: A Logical Formalism for NEXPTIME Decision Problems with Uncertainty

Stochastic Boolean Satisfiability (SSAT) is a logical formalism to model decision problems with uncertainty, such as Partially Observable Markov Decision Process (POMDP) for verification of probabilistic systems. SSAT, however, is limited by its descriptive power within the PSPACE complexity class. More complex problems, such as the NEXPTIME-complete Decentralized POMDP (Dec-POMDP), cannot be succinctly encoded with SSAT. To provide a logical formalism of such problems, we extend the Dependency Quantified Boolean Formula (DQBF), a representative problem in the NEXPTIME-complete class, to its stochastic variant, named Dependency SSAT (DSSAT), and show that DSSAT is also NEXPTIME-complete. We demonstrate the potential applications of DSSAT to circuit synthesis of probabilistic and approximate design. Furthermore, to study the descriptive power of DSSAT, we establish a polynomial-time reduction from Dec-POMDP to DSSAT. With the theoretical foundations paved in this work, we hope to encourage the development of DSSAT solvers for potential broad applications.Comment: 10 pages, 5 figures. A condensed version of this work is published in the AAAI Conference on Artificial Intelligence (AAAI) 202