Results 61 to 70 of about 553 (162)
Incremental refinement of relevance rankings: Balancing relevance depth and scope
Journal of the Association for Information Science and Technology, Volume 77, Issue 10, Page 1247-1270, October 2026.Abstract Delivering both relevant and topically diverse results is a key challenge in information retrieval (IR). This study introduces a hybrid method that incrementally refines rankings by combining probabilistic topic modeling (latent dirichlet allocation [LDA]) with citation‐based pennant retrieval grounded in Relevance Theory (RT), optimizing for ...
Müge Akbulut, Yaşar Tonta
wiley +1 more source
Clinical and Experimental Dental Research, Volume 12, Issue 5, October 2026.ABSTRACT Background Robotic computer‐assisted implant surgery (r‐CAIS) aims to improve implant placement trueness, but existing reviews include heterogeneous designs, and no review has exclusively synthesized RCTs to date. This review aimed to evaluate the positional trueness and clinical outcomes of r‐CAIS compared with free‐hand implant surgery (FHIS)
Sultan Ainoosah +5 more
wiley +1 more source
Abelian number fields with frobenian conditions
Mathematika, Volume 72, Issue 4, October 2026.Abstract We study the distribution of abelian number fields with frobenian conditions imposed on the conductor. In particular, we find an asymptotic for the number of abelian field extensions of a number field k$k$ whose conductor is the sum of two squares. We also discuss an application of the Brauer group of stacks to quadratic number fields.
Julie Tavernier
wiley +1 more source
International Journal for Numerical Methods in Engineering, Volume 127, Issue 17, 15 September 2026.ABSTRACT In this contribution, we focus on the Reynolds‐averaged Navier‐Stokes (RANS) models and their exploitation to build reliable reduced‐order models to further accelerate predictions for real‐time applications and many‐query scenarios. Specifically, we investigate how machine learning can be employed to enhance the predictive capabilities of the ...
Davide Oberto +2 more
wiley +1 more source
Do Androids Dream of Electric Sheep? A Psychoanalytic Inquiry Into Large Language Models
International Journal of Applied Psychoanalytic Studies, Volume 23, Issue 3, September 2026.ABSTRACT Large language models produce fluent, contextually appropriate language that invites the inference that something behind the output is thinking. The psychoanalytic theory of thinking, specifically the work of Wilfred Bion and Donald Winnicott read together, allows us to specify what thinking requires, what the LLM lacks, and what occurs when a
Mustafa Selek
wiley +1 more source
Three variations of observation equivalence preserving synthesis abstraction [PDF]
, 2011 In a previous paper we introduced the notion of synthesis abstraction, which allows efficient compositional synthesis of maximally permissive supervisors for large-scale systems of composed finite-state automata.
Mohajerani, Sahar +3 more
core
Petri Nets for Automatic Wave Digital Code Generation
International Journal of Numerical Modelling: Electronic Networks, Devices and Fields, Volume 39, Issue 5, September/October 2026.ABSTRACT Wave Digital (WD) models are a well‐established framework for the emulation of linear and nonlinear circuits. In practice, however, WD models are still implemented largely manually or through limited automated toolchains. Manual programming of WD models is time‐consuming and error‐prone for larger systems with pronounced algebraic dependencies,
Jonas Röhrig, Karlheinz Ochs
wiley +1 more source
Towards sharing in lazy computation systems [PDF]
, 2004 Work on proving congruence of bisimulation in functional programming languages often refers to [How89,How96], where Howe gave a highly general account on this topic in terms of so-called lazy computation systems .
Mann, Matthias, Matthias Mann
core
On the Existential Theory of the Completions of a Global Field
Mathematische Nachrichten, Volume 299, Issue 9, Page 2680-2692, September 2026.ABSTRACT We discuss the common existential theory of all or almost all completions of a global function field.
Philip Dittmann, Arno Fehm
wiley +1 more source
Bridges between algebraic automata theory and complexity theory
, 2008 The algebraic theory of finite automata has been one of the most successful tools to study and classify regular languages. These very same tools can in fact be used to understand more powerful models of computation and we discuss here the impact that ...
Pascal Tesson, Denis Thérien
core