Results 51 to 60 of about 17,250 (168)
Vector AutoRegressive Moving Average Models: A Review
WIREs Computational Statistics, Volume 17, Issue 1, March 2025.Wordcloud of key themes generated from abstracts of cited papers in this review paper. ABSTRACT Vector AutoRegressive Moving Average (VARMA) models form a powerful and general model class for analyzing dynamics among multiple time series. While VARMA models encompass the Vector AutoRegressive (VAR) models, their popularity in empirical applications is ...
Marie‐Christine Düker +3 more
wiley +1 more source
Positive Neural Networks in Discrete Time Implement Monotone-Regular Behaviors
, 2015 We study the expressive power of positive neural networks. The model uses positive connection weights and multiple input neurons. Different behaviors can be expressed by varying the connection weights.
Ameloot, Tom J., Bussche, Jan Van den
core +1 more source
Fairly Decentralizing a Hybrid Concurrency Control Protocol for Real‐Time Database Systems
Concurrency and Computation: Practice and Experience, Volume 37, Issue 4-5, 28 February 2025.ABSTRACT Concurrency control protocols play a vital role in ensuring the correctness of databases when transactions are processed in parallel. Plor is a non‐real‐time concurrency control protocol based on the 2‐phase locking protocol. Plor utilizes the Wound‐Wait scheme, a timestamp‐based scheme for deadlock prevention, as it provides lower tail ...
Tung Nguyen, Hideyuki Kawashima
wiley +1 more source
Deterministic Autopoietic Automata
, 2009 This paper studies two issues related to the paper on Computing by Self-reproduction: Autopoietic Automata by Jiri Wiedermann. It is shown that all results presented there extend to deterministic computations.
Fürer, Martin
core +2 more sources
IET Intelligent Transport Systems, Volume 19, Issue 1, January/December 2025.This paper presents a safety refinement pattern for complex computer‐based systems (CBSs) using a layered architecture, integrating STAMP models with Event‐B to derive and verify safety requirements (SRs) and system‐level safety constraints (SLSCs).
Meng Mei +7 more
wiley +1 more source
, 2015 We propose a novel approach for coping with alternating quantification as the main source of nonelementary complexity of deciding WS1S formulae. Our approach is applicable within the state-of-the-art automata-based WS1S decision procedure implemented, e ...
Fiedor, Tomas +3 more
core +1 more source
Impedance‐Based Adaptive Droop Control for Islanded AC Microgrids and Overview
International Transactions on Electrical Energy Systems, Volume 2025, Issue 1, 2025.Recent improvements in the application of distributed energy resources (DERs) and microgrids (MGs) have made controlling these resources very important. However, there are still many challenges in this field. One of the anticipated challenges in islanded MGs (IMGs) is the mismatched output impedance of DERs, which affects the volt‐var regulation ...
Forough Qashqaie +4 more
wiley +1 more source
International Journal of Intelligent Systems, Volume 2025, Issue 1, 2025.Introduction To reduce costs, make efficient decisions, grow the market sustainably, and profit, private insurance companies must increase their computing power for big data analysis by using artificial intelligence (AI) algorithms. In this review, we build upon the existing literature on AI applications in insurance and provide a comprehensive review ...
Rasha Atlasi +5 more
wiley +1 more source
Resilience‐Inclusive Capacity Assessment for Railway Networks Under Virtual Coupling via Simulation
Journal of Applied Mathematics, Volume 2025, Issue 1, 2025.One of the fundamental problems in virtual coupling (VC) is improving the capacity by reducing the safe distance without compromising safety. From the resilience‐inclusive perspective, the capacity can be controlled by the range of safe distance, which ensures that the gap between trains within the virtually coupled convoy is within the range of safe ...
Jiamin Zhang, Arpan Hazra
wiley +1 more source
How unprovable is Rabin's decidability theorem?
, 2015 We study the strength of set-theoretic axioms needed to prove Rabin's theorem on the decidability of the MSO theory of the infinite binary tree. We first show that the complementation theorem for tree automata, which forms the technical core of typical ...
Beckmann A. +6 more
core +1 more source