Modelling Core Inflation for the UK Using a New Dynamic Factor Estimation Method and a Large Disaggregated Price Index Dataset [PDF]
Recent work in the macroeconometric literature considers the problem of summarising efficiently a large set of variables and using this summary for a variety of purposes including forecasting.
George Kapetanios
core
Physical Reservoir Computing using a Cellulose Nanofiber Hydrogel for Intelligent Green Electronics
Cellulose nanofiber (CNF) hydrogel serves as a biodegradable physical reservoir computer capable of electronic input and output. The CNF–water network enables sustainable green electronics that activate upon contact with liquid water, providing a degradable, robust, and field‐deployable computing element suitable for environmentally compatible device ...
Takeshi Kato +3 more
wiley +1 more source
Ambient vibration testing of concrete dams [PDF]
In this thesis, seven techniques namely; rational fractional polynomial, complex exponential, frequency domain decomposition (FDD) based techniques which include; frequency domain decomposition (FDD), enhanced frequency domain decomposition (EFDD), curve
Bukenya, Patrick
core +1 more source
SUBSPACE IDENTIFICATION METHOD FOR STOCHASTIC LINEAR CONTROL SYSTEMS
Subspace identification is studied for stochastic linear control systems in state-space form. PO-MOESP (Past Outputs Multivariable Output-Error State sPace) algorithm is described, implemented and compared with other subspace identification methods and ...
Nikita M. Kharkovskii +1 more
doaj +1 more source
On structural controllability in complex networks with periodic switching topologies
Abstract This paper investigates the structural controllability of complex networks with periodic switching topologies. First, several graph transformations that preserve structural controllability are demonstrated. Based on the n‐walk theory, a criterion is derived that determines structural controllability by analyzing only the joint graph within a ...
Jingrui Hou +3 more
wiley +1 more source
Semi‐supervised domain adaptation via subspace exploration
Recent methods of learning latent representations in Domain Adaptation (DA) often entangle the learning of features and exploration of latent space into a unified process.
Zheng Han +5 more
doaj +1 more source
Subspace Learning for Dual High-Order Graph Learning Based on Boolean Weight
Subspace learning has achieved promising performance as a key technique for unsupervised feature selection. The strength of subspace learning lies in its ability to identify a representative subspace encompassing a cluster of features that are capable of
Yilong Wei +3 more
doaj +1 more source
Subspace‐Based System Identification From Binary Measurements
ABSTRACT This paper is concerned with subspace identification from binary measurements for systems whose dynamical behavior can be splited into a deterministic and a stochastic subsystem. An identification algorithm is detailed. The main contribution of the proposed identification algorithm lies in the identification of both the deterministic subsystem
Alex Ali Mestrah +2 more
wiley +1 more source
Principal Component‐Based Classification of Blazar Candidates of Uncertain Type in the 4FGL/LAT
ABSTRACT We adopted principal component analysis (PCA), linear discriminant analysis (LDA), and support vector machines (SVM), to study classification for a sample of 2708 Fermi blazars: 1142 BL Lac objects (BLLs), 759 flat spectrum radio quasars (FSRQs), and 807 blazar candidates of uncertain type (BCUs).
Wen‐Xin Yang +13 more
wiley +1 more source
A Comparison of Subspace Methods for Sylvester Equations
Sylvester equations AX − XB = C play an important role in numerical linear algebra. For example, they arise in the computation of invariant subspaces, in control problems, as linearizations of algebraic Riccati equations, and in the discretization of partial differential equations. For small systems, direct methods are feasible.
openaire +4 more sources

