Results 41 to 50 of about 17,415 (264)
Accelerated preprocessing in task of searching substrings in a string
Advanced Engineering Research, 2019 Introduction. A rapid development of the systems such as Yandex, Google, etc., has predetermined the relevance of the task of searching substrings in a string, and approaches to its solution are actively investigated. This task is used to create database
A. V. Mazurenko, N. V. Boldyrikhin
doaj +1 more source
Advanced Engineering Materials, EarlyView.We develop a data‐driven method to derive the mathematical expressions of the Flory–Huggins interaction parameter χ for the swelling behavior of temperature–responsive hydrogels. Starting from initial assumptions of χ, our workflow combines Bayesian optimization, Flory–Rehner theory, and symbolic regression to generate candidate χ expressions.
Yawen Wang +2 more
wiley +1 more source
Noisy Tree Data Structures and Quantum Applications
Mathematics, 2023 We suggest a new technique for developing noisy tree data structures. We call it a “walking tree”. As applications of the technique we present a noisy Self-Balanced Binary Search Tree (we use a Red–Black tree as an implementation) and a noisy segment ...
Kamil Khadiev +3 more
doaj +1 more source
Sublinear Algorithms for Approximating String Compressibility [PDF]
Algorithmica, 2007 To appear in the proceedings of RANDOM ...
Sofya Raskhodnikova +3 more
openaire +6 more sources
Advanced Engineering Materials, EarlyView.A combined experimental–computational framework identifies energy‐dependent laser absorptivity for NiTi in laser powder‐bed fusion, applicable to conduction and transition modes. Single‐track experiments and thermofluid smoothed particle hydrodynamics simulations are coupled through inverse analysis of melt pool geometry.
Mohamadreza Afrasiabi +3 more
wiley +1 more source
Input–output maps are strongly biased towards simple outputs
Nature Communications, 2018 Algorithmic information theory measures the complexity of strings. Here the authors provide a practical bound on the probability that a randomly generated computer program produces a given output of a given complexity and apply this upper bound to RNA ...
Kamaludin Dingle +2 more
doaj +1 more source
An approximate string-matching algorithm
Theoretical Computer Science, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jong Yong Kim, John Shawe-Taylor
openaire +1 more source
Advanced Engineering Materials, EarlyView.Digitalizing electroplating requires both domain knowledge and interoperability. This work introduces PlatOn, a domain ontology for trivalent chromium plating and coating characterization, and a hybrid pipeline that aligns it to a mid‐level reference ontology by combining eight similarity metrics with language model reasoning. Expert‐validated mappings
Janik Harter +10 more
wiley +1 more source
Software Library for Authorship Identification
Digital Presentation and Preservation of Cultural and Scientific Heritage, 2015 The aim of this paper is to review some methods for text authorship attribution and to discuss the development of a software library with tools for automatic authorship attribution.
Ivan Ivanov +4 more
doaj +1 more source
Adaptive Foam 3D Printing of Ultralight and Multifunctional Materials
Advanced Engineering Materials, EarlyView.Adaptive foam 3D printing, enabled by expandable microspheres, imparts cellular structures to thermoplastic and thermosetting polymers, manufactured through a variety of processes including fused filament fabrication, direct ink writing, digital light processing, and inkjet printing.
Nariman Rajabifar, Amir Ameli
wiley +1 more source