Results 71 to 80 of about 73,865 (284)
Thermodynamic resource theories, non-commutativity and maximum entropy principles [PDF]
, 2015 We discuss some features of thermodynamics in the presence of multiple conserved quantities. We prove a generalisation of Landauer principle illustrating tradeoffs between the erasure costs paid in different ‘currencies’.
Matteo Lostaglio +2 more
semanticscholar +1 more source
Advanced Science, EarlyView.This work reports on epitaxially grown Hf0.52Zr0.48O2 ferroelectric memristors with high stability (high durability exceeding 108 cycles and a retention time exceeding 104 s for 16 states) and ultra‐low operating energy consumption (∼121 fJ). A memristor array‐based reservoir computing system is constructed and applied for the first time in the field ...
Ying Liu +6 more
wiley +1 more source
, 2015 We describe a general framework for notions of commutativity based on enriched category theory. We extend Eilenberg and Kelly's tensor product for categories enriched over a symmetric monoidal base to a tensor product for categories enriched over a ...
R. Garner, Ignacio L'opez Franco
semanticscholar +1 more source
Symmetry‐Imposed Selection Rules for Excitations of Nontrivial Plasmonic Topologies
Advanced Science, EarlyView.A unified group‐theory selection rule governs the excitation of vectorial nearfield topologies across three plasmonic spin states. Derived from first principles, it predicts spin–orbit vortex splitting and multidimensional nested vortices, confirmed by phase‐resolved in situ measurements.
Jie Yang +14 more
wiley +1 more source
On (?,?)-Derivations and Commutativity of Prime and Semi prime ?-rings
مجلة بغداد للعلوم, 2016 Let R be a ?-ring, and ?, ? be two automorphisms of R. An additive mapping d from a ?-ring R into itself is called a (?,?)-derivation on R if d(a?b) = d(a)? ?(b) + ?(a)?d(b), holds for all a,b ?R and ???. d is called strong commutativity preserving (SCP)
Baghdad Science Journal
doaj +1 more source
On commutativity and approximation
Theoretical Computer Science, 1983 The paper deals with lower and upper bounds on the algebraic complexity of bilinear forms based on the rank of the corresponding tensors. It defines the ''commutative border rank'' (cbrk) of a tensor, which is a modification of the definition of ''rank'' so that it can be applied to algorithms that a) only need to approximate the solution and b) make ...
openaire +2 more sources
Updatable Closed‐Form Evaluation of Arbitrarily Complex Multiport Network Connections
Advanced Electronic Materials, EarlyView.The inverse design of electrically large wave devices often uses reduced‐order multiport models with discrete optimization, requiring many evaluations of complex interconnections between subsystems that differ only in a few blocks. This paper introduces a closed‐form framework enabling efficient Woodbury low‐rank updates of related, previous ...
Hugo Prod'homme, Philipp del Hougne
wiley +1 more source
Commutativity of rings through a Streb’s result [PDF]
, 1976 summary:In this paper we investigate commutativity of rings with unity satisfying any one of the properties: \[ \begin{aligned} &\lbrace 1- g(yx^{m}) \rbrace \ [yx^{m} - x^{r} f (yx^{m}) \ x^s, x] \lbrace 1- h (yx^{m}) \rbrace = 0, \\&\lbrace 1- g(yx^{m})
Khan, Moharram A., M. Chacron
core +1 more source
Certain near-rings are rings, II
International Journal of Mathematics and Mathematical Sciences, 1986 We investigate distributively-generated near-rings R which satisfy one of the following conditions: (i) for each x,y∈R, there exist positive integers m, n for which xy=ymxn; (ii) for each x,y∈R, there exists a positive integer n such that xy=(yx)n. Under
Howard E. Bell
doaj +1 more source
A Unifying Approach to Self‐Organizing Systems Interacting via Conservation Laws
Advanced Intelligent Discovery, EarlyView.The article develops a unified way to model and analyze self‐organizing systems whose interactions are constrained by conservation laws. It represents physical/biological/engineered networks as graphs and builds projection operators (from incidence/cycle structure) that enforce those constraints and decompose network variables into constrained versus ...
F. Barrows +7 more
wiley +1 more source