Results 201 to 210 of about 13,015 (267)

Synchronization of Analog Neuron Circuits With Digital Memristive Synapses: An Hybrid Approach

Advanced Electronic Materials, EarlyView.
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, Francesco Maria Esposito, Carlo Famoso, Arturo Buscarino   +3 more
wiley   +1 more source

Compute-in-memory implementation of state space models for event sequence processing. [PDF]

Nat Commun
Zhang X, Hu M, Lu S, Kim S, Lee EY, Liu Y, Lu WD.   +6 more
europepmc   +1 more source

From constraints to innovations: a student agency typology and its implications for pedagogical change. [PDF]

Front Psychol
Su W, Li H.
europepmc   +1 more source

An integrated neutrosophic Z-numbers based CRITIC-EDAS decision model for smart solar panel evaluation in sustainable energy planning. [PDF]

Sci Rep
Abbas MZ, Anjum R, Hussain A, Ahmad M, Haleemzai I.   +4 more
europepmc   +1 more source

A spatial decision making framework using neutrosophic VIKOR for wind energy investment in Turkey. [PDF]

Sci Rep
Eroğlu H.
europepmc   +1 more source

Persona pedagogica in crisis: are educators becoming data custodians in the age of AI? [PDF]

Front Artif Intell
Ambady A, K V T.
europepmc   +1 more source

An MADM approach for the assessment of eye lenses with fuzziness of using prioritized weighted operators. [PDF]

Sci Rep
Hu C, Pervaiz F, Zhang J, Ullah K, Khan MR, Raza A, Ali Z, Yin S, Karamti H.   +8 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Calculi for Many-Valued Logics

Logica Universalis, 2021
We present a number of equivalent calculi for many-valued logics and prove soundness and strong completeness theorems. The calculi are obtained from the truth tables of the logic under consideration in a straightforward manner and there is a natural duality among these calculi. We also prove the cut elimination theorems for the sequent-like systems.
Kaminski, Michael, Francez, Nissim
openaire   +1 more source

Many-Valued Modal Logics

Fundamenta Informaticae, 1991
Two families of many-valued modal logics are investigated. Semantically, one family is characterized using Kripke models that allow formulas to take values in a finite many-valued logic, at each possible world. The second family generalizes this to allow the accessibility relation between worlds also to be many-valued. Gentzen sequent calculi are given
openaire   +2 more sources