Results 81 to 90 of about 4,125 (289)
Low‐Power Control Of Resistance Switching Transitions in First‐Order Memristors
Joule losses are a serious concern in modern integrated circuit design. In this regard, minimizing the energy necessary for programming memristors should be handled with care. This manuscript presents an optimal control framework, allowing to derive energy‐efficient programming voltage protocols for resistance switching devices. Following this approach,
Valeriy A. Slipko +3 more
wiley +1 more source
Analisis Kemampuan Siswa dalam Pembuktian Kesebangunan Dua Segitiga
: Mathematics learning in junior high is inseparable from proof, including of congruence of two triangles. This study analyzes the ability to prove the similarity of two triangles.
Yayan Eryk Setiawan
doaj +1 more source
Synchronization of Analog Neuron Circuits With Digital Memristive Synapses: An Hybrid Approach
An hybrid circuit mimicking neural units coupled using memristive synapses is introduced. The analog neurons provide flexibility and robustness, and the digital memristive coupling guarantees the full reconfigurability of the interconnection. The onset of a synchronized spiking behavior in two circuits mimicking the Izhikevich neuron is discussed from ...
Lamberto Carnazza +3 more
wiley +1 more source
On equality of certain derivations of Lie algebras
Let L be a Lie algebra. A derivation α of L is a commuting derivation (central derivation), if α (x) ∈ CL (x) (α (x) ∈ Z (L)) for each x ∈ L. We denote the set of all commuting derivations (central derivations) by 𝒟 (L) (Derz (L)). In this paper, first we show 𝒟 (L) is subalgebra from derivation algebra L, also we investigate the conditions on the Lie ...
Amiri Azita +2 more
openaire +2 more sources
Boundary Algebra: A Simpler Approach to Boolean Algebra and the Sentential Connectives [PDF]
Boundary algebra [BA] is a algebra of type , and a simplified notation for Spencer-Brown’s (1969) primary algebra. The syntax of the primary arithmetic [PA] consists of two atoms, () and the blank page, concatenation, and enclosure between ‘(‘ and ...
Philip Meguire
core
Quantified Equality Constraints
An equality template (also equality constraint language) is a relational structure with infinite universe whose relations can be defined by boolean combinations of equalities.
Hubie Chen +3 more
core +1 more source
Fibrational induction rules for initial algebras [PDF]
This paper provides an induction rule that can be used to prove properties of data structures whose types are inductive, i.e., are carriers of initial algebras of functors.
Neil Ghani +5 more
core +1 more source
SPICE‐Compatible Compact Modeling of Cuprate‐Based Memristors Across a Wide Temperature Range
A physics‐guided compact model for YBCO memristors is introduced, incorporating carrier trapping, field‐induced detrapping, and a differential balance equation to describe their switching dynamics. The model is compared with experiments and implemented in LTspice, allowing realistic circuit‐level simulations.
Thomas Günkel +6 more
wiley +1 more source
A fully coupled FEM–HH model shows that ideally capacitive microelectrodes can achieve lower charge‐density thresholds than Faradaic contacts under current‐controlled stimulation. The advantage stems from the dynamics of surface current density on capacitive interfaces, which redirects current beneath adherent neurons.
Aleksandar Opančar +2 more
wiley +1 more source
Constructing Symmetric Equality Algebras
In this paper, we introduce the notion of strong fuzzy filter on hyper equality algebras and investigate some equivalence definitions of it. Then by using this notion we constructed a symmetric equality algebra and define a special form of classes. By using these, we define the concept of a fuzzy hyper congruence relation on hyper equality algebra and we ...
Borzooei, Rajab Ali +3 more
openaire +2 more sources

