Browsing School of Electronic Engineering and Computer Science by Issue Date
Now showing items 1-20 of 4400
-
Categorical Proof-Theoretic Semantics
(Springer, 03-05-2024)In proof-theoretic semantics, model-theoretic validity is replaced by proof-theoretic validity. Validity of formulae is defined inductively from a base giving the validity of atoms using inductive clauses derived from ... -
CloudAIBus: a testbed for AI based cloud computing environments
(Springer Science and Business Media LLC, 06-06-2024)Smart resource allocation is essential for optimising cloud computing efficiency and utilisation, but it is also very challenging as traditional approaches often overprovision CPU resources, leading to financial inefficiencies. ... -
Correlation and Spectral Density Functions in Mode-Stirred Reverberation - I. Theory
(Institute of Electrical and Electronics Engineers, 10-04-2024)Auto- and cross-spectral density functions (SDFs) for dynamic random fields and power are derived. These are based on first- and second-order Padé approximants of correlation functions expanded in terms of spectral moments. ... -
Explainable Modeling of Gender-Targeting Practices in Toy Advertising Sound and Music
(IEEE, 10-09-2024)This study examines gender coding in sound and music, in a context where music plays a supportive role to other modalities, such as in toy advertising. We trained a series of binary XGBoost classifiers on handcrafted ... -
The Weisfeiler-Leman Dimension of Conjunctive Queries
(14-05-2024)A graph parameter is a function f on graphs with the property that, for any pair of isomorphic graphs G1 and G2, f(G1)=f(G2). The Weisfeiler--Leman (WL) dimension of f is the minimum k such that, if G1 and G2 are ... -
Correlation and Spectral Density Functions in Mode-Stirred Reverberation - III. Measurements
(Institute of Electrical and Electronics Engineers, 17-04-2024)Experimental auto- and cross-correlation functions and their corresponding spectral density functions (SDFs) are extracted from measured sweep data of mode-stirred fields. These are compared with theoretical models derived ... -
Distribution Matching for Multi-Task Learning of Classification Tasks: a Large-Scale Study on Faces & Beyond
(Association for the Advancement of Artificial Intelligence (AAAI), 24-03-2024)Multi-Task Learning (MTL) is a framework, where multiple related tasks are learned jointly and benefit from a shared representation space, or parameter transfer. To provide sufficient learning support, modern MTL uses ... -
Motifs, Phrases, and Beyond: The Modelling of Structure in Symbolic Music Generation
(A Springer Nature Computer Science book series (CCIS, LNAI, LNBI, LNBIP or LNCS), 29-03-2024)Modelling musical structure is vital yet challenging for artificial intelligence systems that generate symbolic music compositions. This literature review dissects the evolution of techniques for incorporating coherent ... -
Full abstraction for PCF
(2000-12-15) -
Internet packet traffic congestion
(2003) -
Count three for wear able computers
(2004-02-01)A description of 'ubiquitous computer' is presented. Ubiquitous computers imply portable computers embedded into everyday objects, which would replace personal computers. Ubiquitous computers can be mapped into a three-tier ... -
Structural constraints in complex networks
(2007-06) -
Theorems on positive data: on the uniqueness of NMF.
(2008)We investigate the conditions for which nonnegative matrix factorization (NMF) is unique and introduce several theorems which can determine whether the decomposition is in fact unique or not. The theorems are illustrated ... -
Classification of the asymptotic Proof Complexity of Polynomial Calculus
(Springer, 2008)We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well as for Polynomial Calculus, (PC) has four ...
