Results 41 to 50 of about 92,710 (270)

Hopfield Neural Networks for Online Constrained Parameter Estimation With Time‐Varying Dynamics and Disturbances

open access: yesInternational Journal of Adaptive Control and Signal Processing, EarlyView.
This paper proposes two projector‐based Hopfield neural network (HNN) estimators for online, constrained parameter estimation under time‐varying data, additive disturbances, and slowly drifting physical parameters. The first is a constraint‐aware HNN that enforces linear equalities and inequalities (via slack neurons) and continuously tracks the ...
Miguel Pedro Silva
wiley   +1 more source

Learning to Execute Timed-Temporal-Logic Navigation Tasks under Input Constraints in Obstacle-Cluttered Environments

open access: yesRobotics
This study focuses on addressing the problem of motion planning within workspaces cluttered with obstacles while considering temporal and input constraints.
Fotios C. Tolis   +4 more
doaj   +1 more source

Reasoning about transfinite sequences

open access: yes, 2006
We introduce a family of temporal logics to specify the behavior of systems with Zeno behaviors. We extend linear-time temporal logic LTL to authorize models admitting Zeno sequences of actions and quantitative temporal operators indexed by ordinals ...
Büchi J.   +7 more
core   +4 more sources

NFDI MatWerk Ontology (MWO): A BFO‐Compliant Ontology for Research Data Management in Materials Science and Engineering

open access: yesAdvanced Engineering Materials, EarlyView.
This article presents the NFDI‐MatWerk Ontology (MWO), a Basic Formal Ontology‐based framework for interoperable research data management in materials science and engineering (MSE). Covering consortium structures, research data management resources, services, and instruments, MWO enables semantic integration, Findable, Accessible, Interoperable, and ...
Hossein Beygi Nasrabadi   +4 more
wiley   +1 more source

Cut, invariant rule, and loop-check free sequent calculus for PLTL

open access: yesLietuvos Matematikos Rinkinys, 2011
In this paper, some loop-check free saturation-like decision procedure is proposed for propositional linear temporal logic (PLTL) with temporal operators “next” and “always”.
Romas Alonderis   +1 more
doaj   +1 more source

Weak Alternating Timed Automata [PDF]

open access: yes, 2012
Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for these automata is decidable.
Igor Walukiewicz   +2 more
core   +3 more sources

Synchrotron Radiation for Quantum Technology

open access: yesAdvanced Functional Materials, EarlyView.
Materials and interfaces underpin quantum technologies, with synchrotron and FEL methods key to understanding and optimizing them. Advances span superconducting and semiconducting qubits, 2D materials, and topological systems, where strain, defects, and interfaces govern performance.
Oliver Rader   +10 more
wiley   +1 more source

Method of marks for propositional linear temporal logic

open access: yesLietuvos Matematikos Rinkinys, 2014
It is known that traditional techniques used to ensure termination of a decision procedure in non-classical logics are based on loop-checking, in general.
Regimantas Pliuškevičius
doaj   +1 more source

All‐in‐One Analog AI Hardware: On‐Chip Training and Inference with Conductive‐Metal‐Oxide/HfOx ReRAM Devices

open access: yesAdvanced Functional Materials, EarlyView.
An all‐in‐one analog AI accelerator is presented, enabling on‐chip training, weight retention, and long‐term inference acceleration. It leverages a BEOL‐integrated CMO/HfOx ReRAM array with low‐voltage operation (<1.5 V), multi‐bit capability over 32 states, low programming noise (10 nS), and near‐ideal weight transfer.
Donato Francesco Falcone   +11 more
wiley   +1 more source

Completeness of Flat Coalgebraic Fixpoint Logics

open access: yes, 2010
Modal fixpoint logics traditionally play a central role in computer science, in particular in artificial intelligence and concurrency. The mu-calculus and its relatives are among the most expressive logics of this type.
Gastin, P.   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy