Results 71 to 80 of about 31,214,580 (203)
ArGemma: A Multi‐Task Fine‐Tuning Framework for Adapting Gemma to Arabic
Expert Systems, Volume 43, Issue 11, November 2026.ABSTRACT Open‐source large language models (LLMs) have significantly advanced natural language processing (NLP), particularly for English. However, their performance in Arabic has remained limited due to the scarcity of high‐quality datasets and the high computational cost of full fine‐tuning.
Taha Alselwi +2 more
wiley +1 more source
Texto Livre: Linguagem e Tecnologia, 2018 RESUMO: Sabe-se que o processo de ensino-aprendizagem de língua na atualidade requer a inserção do aluno em práticas pedagógicas diversificadas, uma vez que a chamada era digital desencadeia uma série de mudanças na maneira de se construir o conhecimento.
Sheila de Carvalho Pereira Gonçalves
doaj +1 more source
Two Self‐Stabilizing Algorithms for the Maximal Pentagon Partitioning Problem
Concurrency and Computation: Practice and Experience, Volume 38, Issue 19, October 2026.ABSTRACT Given an undirected graph G=(V,E)$$ G=\left(V,E\right) $$, a collection of disjoint subsets of nodes π={V1,…,Vk}(V=V1∪⋯∪Vk)$$ \pi =\left\{{V}_1,\dots, {V}_k\right\}\kern0.3em \left(V={V}_1\cup \cdots \cup {V}_k\right) $$ is called a pentagon partition if each subset Vi(1≤i≤k)$$ {V}_i\kern0.3em \left(1\le i\le k\right) $$ satisfies one of the ...
Tota Yamada +2 more
wiley +1 more source
Lower Bounds for Maximum Weight Bisections of Weighted Triangle‐Free Subcubic Graphs
Journal of Graph Theory, Volume 113, Issue 2, Page 252-273, October 2026.ABSTRACT A bisection of a graph is a cut in which the number of vertices in the two parts of the cut differ by at most 1. In this paper, we consider maximum weight bisections of edge‐weighted triangle‐free subcubic graphs and show that every weighted triangle‐free subcubic graph G = ( V , E , w )
wiley +1 more source
A Coarse Geometric Approach to Graph Layout Problems
Journal of Graph Theory, Volume 113, Issue 2, Page 169-194, October 2026.ABSTRACT We define a range of new coarse geometric invariants based on various graph–theoretic measures of complexity for finite graphs, including treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely, they are ...
Wanying Huang +3 more
wiley +1 more source
Analysis of Eigenvalue Clustering Leads to Optimal Scaling in Numerical Radiative Transfer
Numerical Linear Algebra with Applications, Volume 33, Issue 5, October 2026.ABSTRACT We consider a multidimensional polychromatic radiative transfer (RT) problem, accounting for scattering processes in a general form, that is, anisotropic (dipole) scattering with partial frequency redistribution. Given a discrete ordinates (SN$$ {S}_N $$) discretization, we report the corresponding matrix structures, depending on the model and
Pietro Benedusi +3 more
wiley +1 more source
Circulant Matrix‐Based Box–Behnken Designs With Economic Run Sizes
Quality and Reliability Engineering International, Volume 42, Issue 6, Page 3326-3334, October 2026.ABSTRACT We introduce Circulant Matrix‐Based Box–Behnken Designs (CBBDs), a new class of three‐level, second‐order response surface designs constructed using circulant matrix structures. These designs satisfy an enhanced orthogonal minimally aliased (OMA∗${\rm OMA}^*$) property: they retain the classical OMA property—where main effects are orthogonal ...
Tung‐Dinh Pham, Nam‐Ky Nguyen
wiley +1 more source
, 2017 Lexicography is concerned with dictionaries, both with the processes of compilation and with the study of the finished products. The latter is sometimes called “metalexicography” or “dictionary research.” The distinction is also drawn by referring to the
core +1 more source
Caligrama: Revista de Estudos Românicos, 2015 As teorias lexicológicas tradicionais costumam classificar as palavras em “expressões com significado” e “expressões sem significado” com base na distinção entre “significado lexical” e “significado categorial”.
Virginia Sita Farias
doaj +1 more source
“We Can No Longer Live by the Domostroi”: The Riddles of Anna Nikanorovna Paskhalova‐Mordovtseva
The Russian Review, Volume 85, Issue 4, Page 417-437, October 2026.Abstract This article analyzes the rebuses (picture riddles) of Anna Nikanorovna Paskhalova‐Mordovtseva. It argues that despite their seemingly modest nature as artefacts of everyday leisure, Mordovtseva used these puzzles to make radical claims and assert herself as a public intellectual.
Ksenia Butuzova, Julia Mannherz
wiley +1 more source