Results 31 to 40 of about 3,225,384 (253)

Algebraic bases of some algebras of polynomials on Banach spaces

open access: yesМатематичні Студії
The work is devoted to the study of algebraic bases of algebras of continuous polynomials on real and complex Banach spaces. A subset of an algebra is called an algebraic basis if every element of the algebra can be uniquely represented as a linear ...
R. V. Ponomarov, T. V. Vasylyshyn
doaj   +1 more source

Low‐Power Control Of Resistance Switching Transitions in First‐Order Memristors

open access: yesAdvanced Electronic Materials, EarlyView.
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

Subsymmetric Polynomials on Banach Spaces and Their Applications

open access: yesMathematics
We investigate algebraic and topological properties of subsymmetric polynomials on finite- and infinite-dimensional spaces. In particular, we focus on the problem of the existence of an algebraic basis in the algebra of subsymmetric polynomials, as well ...
Vitalii Bihun   +3 more
doaj   +1 more source

Complexity of Some Generalized Operations on Networks

open access: yesComplexity, 2021
The number of spanning trees in a network determines the totality of acyclic and connected components present within. This number is termed as complexity of the network.
Muhammad Javaid   +2 more
doaj   +1 more source

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

open access: yesAdvanced 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   +3 more
wiley   +1 more source

A computational study of Ising‐based solvers for discrete landscape exploration in process optimization

open access: yesAIChE Journal, EarlyView.
ABSTRACT Conceptual process design combines discrete configuration choices with continuous operating decisions, often yielding difficult mixed‐integer nonlinear or simulation‐based optimization problems. This work presents an exploratory computational assessment of Ising‐based solvers, simulated annealing, quantum annealing, and entropy computing, as ...
Yirang Park, David E. Bernal Neira
wiley   +1 more source

Block-symmetric and weakly symmetric polynomials on Banach spaces of absolutely summable in a power $p\in [1,+\infty)$ sequences

open access: yesМатематичні Студії
The work is devoted to the study of block-symmetric and weakly symmetric continuous polynomials on the Banach space $\ell_p^{ (\mathbb{K}) }$ of all sequences $x = (x_1, x_2, \ldots)$ with $x_j \in \mathbb{K}$ for $j\in\mathbb{N}$ such that the series $\
A. I. Bandura   +2 more
doaj   +1 more source

Cryptanalysing variants of Stickel's key agreement scheme

open access: yesJournal of Mathematical Cryptology, 2011
Stickel's key agreement scheme was successfully cryptanalysed by V. Shpilrain when GL(n, q) is used as a platform. Shpilrain suggested the algebra of all (not necessarily invertible) n × n matrices defined over some finite ring R would make a more secure
Mullan Ciaran
doaj   +1 more source

The composition algebra of a cyclic quiver [PDF]

open access: yes, 1993
Ringel CM. The composition algebra of a cyclic quiver. Proceedings of the London Mathematical Society : Ser. 3.
Ringel, Claus Michael
core   +1 more source

A Unifying Approach to Self‐Organizing Systems Interacting via Conservation Laws

open access: yesAdvanced 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

Home - About - Disclaimer - Privacy