Results 41 to 50 of about 114 (95)

Sequences With Subword Complexity 2n

Journal of Number Theory, 1994
The complexity of an infinite sequence taking finitely many values is the function \(n \to P(n)\), where \(P(n)\) is the number of blocks of length \(n\) occurring in the sequence (the usual term for ``blocks'' is ``factors'' in the European terminology and ``subwords'' in the American terminology). One can be interested in the asymptotic behaviour of \
openaire   +2 more sources

Schubert Patches Degenerate to Subword Complexes [PDF]

Transformation Groups, 2008
11 ...
openaire   +3 more sources

LEAD: Literature Enhanced Ab Initio Discovery of Nitride Dusting Layers for Enhanced Tunnel Magnetoresistance and Lower Resistance Magnetic Tunnel Junctions

Advanced Materials, EarlyView.
Magnetic tunnel junctions (MTJs) using MgO tunnel barriers face challenges of high resistance‐area product and low tunnel magnetoresistance (TMR). To discover alternative materials, Literature Enhanced Ab initio Discovery (LEAD) is developed. The LEAD‐predicted materials are theoretically evaluated, showing that MTJs with dusting of ScN or TiN on ...
Sabiq Islam, William S. Rogers, Chen‐Yu Hu, Ming‐Yuan Song, Xinyu Bao, Shehrin Sayed, Jean Anne C. Incorvia   +6 more
wiley   +1 more source

Enhancing Sindhi Word Segmentation Using Subword Representation Learning and Position-Aware Self-Attention

IEEE Access
Sindhi word segmentation is a challenging task due to space omission and insertion issues. The Sindhi language itself adds to this complexity. It’s cursive and consists of characters with inherent joining and non-joining properties, independent of
Wazir Ali, Jay Kumar, Saifullah Tumrani, Redhwan Nour, Adeeb Noor, Zenglin Xu   +5 more
doaj   +1 more source

An Autonomous Large Language Model‐Agent Framework for Transparent and Local Time Series Forecasting

Advanced Intelligent Discovery, EarlyView.
Architecture of the proposed large language model (LLM)‐based agent framework for autonomous time series forecasting in thermal power generation systems. The framework operates through a vertical pipeline initiated by natural language queries from users, which are processed by the LLM Agent Core powered by Llama.cpp and a ReAct loop with persistent ...
William Gouvêa Buratto, Gabriel Villarrubia Gonzalez, Ademir Nied, Laio Oriel Seman, Anne Carolina Rodrigues Klaar, Stefano Frizzo Stefenon   +5 more
wiley   +1 more source

Multitype Game Optimisation: A Two‐Stage Fine‐Tuning Framework for Multi‑Game Optimisation With Large Language Models

CAAI Transactions on Intelligence Technology, EarlyView.
ABSTRACT Large language models (LLMs) have made remarkable advances in natural language processing, demonstrating great potential in modelling structured sequences. However, adapting these capabilities to machine gaming tasks such as Go remains challenging due to limitations in strategy generalisation and optimisation efficiency.
Xiali Li, Jingshi Gu, Feifan He, Yang Xiao, Yuanli Jia, Ping Lan   +5 more
wiley   +1 more source

LLM‐based prior elicitation for Bayesian graphical modeling

British Journal of Mathematical and Statistical Psychology, EarlyView.
ABSTRACT In the Bayesian graphical modeling framework, priors on network structure encode theoretical assumptions and uncertainty about the topology of psychological constructs under study. For instance, the Bernoulli prior specifies the probability of each pairwise interaction, the Beta–Bernoulli prior governs expected network density, and the ...
Nikola Sekulovski, Meike Waaijers, Giuseppe Arena   +2 more
wiley   +1 more source

Properties of the complexity function for finite words

Journal of Numerical Analysis and Approximation Theory, 2004
The subword complexity function \(p_{w}\) of a finite word \(w\) over a finite alphabet \(A\) with \(\operatorname*{card}A=q\geq1\) is defined by \(p_{w}(n)=\operatorname*{card}(F(w)\cap A^{n})\) for \(n\in\mathbb{N},\) where \(F(w)\) represents the set ...
Mira-Cristiana Anisiu, Julien Cassaigne
doaj   +2 more sources

MS4 - Multi-Scale Selector of Sequence Signatures: An alignment-free method for classification of biological sequences

BMC Bioinformatics, 2010
Background While multiple alignment is the first step of usual classification schemes for biological sequences, alignment-free methods are being increasingly used as alternatives when multiple alignments fail.
Grasseau Gilles, Laprevotte Ivan, Pitschi Florian, Corel Eduardo, Didier Gilles, Devauchelle Claudine   +5 more
doaj   +1 more source

Genome–phenome association prediction using weighted deep matrix factorization with a multisource graph attention network

Quantitative Biology, Volume 14, Issue 3, September 2026.
Abstract Genome–phenome association (GPA) prediction can broaden the understanding of biological mechanisms underlying complex phenotypic traits (e.g., diseases and agronomic traits). Traditional deep matrix factorization (DMF)‐based GPA methods can integrate multiple data types and uncover nonlinear associations but often rely on low‐dimensional ...
Ran Duan, Wei Cao, Maozu Guo, Le Tian, Lingling Zhao   +4 more
wiley   +1 more source