Results 21 to 30 of about 1,588 (116)

Shortest Superstring [PDF]

open access: yes, 2017
In the Shortest Superstring problem (SS) one has to find a shortest string s containing given strings s_1,...,s_n as substrings. The problem is NP-hard, so a natural question is that of its approximability.
Mucha, Marcin
core   +1 more source

A Deep Learning Approach Using Optimized LSTM for Anomaly‐Based Network Intrusion Detection

open access: yesJournal of Engineering, Volume 2026, Issue 1, 2026.
With the exponential rise in cyber threats, anomaly‐based network intrusion detection systems (NIDSs) have become critical for maintaining robust cybersecurity. This article proposes an optimized long short‐term memory (LSTM) deep learning (DL) model specifically designed to detect anomalies in network traffic.
Samia Dardouri, Shikha Binwal
wiley   +1 more source

Topological Stability of Kinetic $k$-Centers [PDF]

open access: yes, 2018
We study the $k$-center problem in a kinetic setting: given a set of continuously moving points $P$ in the plane, determine a set of $k$ (moving) disks that cover $P$ at every time step, such that the disks are as small as possible at any point in time ...
Meulemans, Wouter   +4 more
core   +3 more sources

Fatigue Life Prediction Under Multiaxial Loading Using Machine Learning and Dependency‐Aware Sensitivity Analysis

open access: yesInternational Journal of Mechanical System Dynamics, Volume 5, Issue 4, Page 736-761, December 2025.
ABSTRACT Accurate prediction of fatigue life under multiaxial loading conditions remains challenging due to complex stress–strain interactions. In this study, we integrate machine‐learning (ML) regression with variance‐based sensitivity analysis (SA) to predict multiaxial fatigue life in CuZn37 brass and to identify the dominant mechanical factors ...
Tran C. H. Nguyen   +4 more
wiley   +1 more source

A Match in Time Saves Nine: Deterministic Online Matching With Delays

open access: yes, 2017
We consider the problem of online Min-cost Perfect Matching with Delays (MPMD) introduced by Emek et al. (STOC 2016). In this problem, an even number of requests appear in a metric space at different times and the goal of an online algorithm is to match ...
A Antoniadis   +26 more
core   +1 more source

Evaluating the Performance of Ethanol Electrochemical Nanobiosensor Through Machine for Predictive Analysis of Electric Current in Self‐Powered Biosensors

open access: yesBattery Energy, Volume 4, Issue 5, September 2025.
Developing electrodes for generating electricity using human body sweating. ABSTRACT In this study, the focus is on ethanol nano biosensors based on alcohol oxidase (AOX) enzymatic reactions and the feasibility of generating electric current for biobatteries.
Afshin Farahbakhsh   +3 more
wiley   +1 more source

Exact Covers via Determinants [PDF]

open access: yes, 2010
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-dimensional matching problem asks whether there is a disjoint collection of the hyperedges which covers all ...
Björklund, Andreas
core   +4 more sources

State of India's Birds 2023: A framework to leverage semi‐structured citizen science for bird conservation

open access: yesEcosphere, Volume 16, Issue 7, July 2025.
Abstract Birds and their habitats are threatened with extinction around the world. Regional assessments of the “State of Birds” are a vital means to prioritize data‐driven conservation action by informing national and global policy. Such evaluations have traditionally relied on data derived from extensive, long‐term, standardized surveys that require ...
Ashwin Viswanathan   +15 more
wiley   +1 more source

Concepts for a Semantically Accessible Materials Data Space: Overview over Specific Implementations in Materials Science

open access: yesAdvanced Engineering Materials, Volume 27, Issue 8, April 2025.
This manuscript presents advances in digital transformation within materials science and engineering, emphasizing the role of the MaterialDigital Initiative. By testing and applying concepts such as ontologies, knowledge graphs, and integrated workflows, it promotes semantic interoperability and data‐driven innovation. The article reviews collaborative
Bernd Bayerlein   +44 more
wiley   +1 more source

Optimality program in segment and string graphs

open access: yes, 2018
Planar graphs are known to allow subexponential algorithms running in time $2^{O(\sqrt n)}$ or $2^{O(\sqrt n \log n)}$ for most of the paradigmatic problems, while the brute-force time $2^{\Theta(n)}$ is very likely to be asymptotically best on general ...
BS Baker   +20 more
core   +1 more source

Home - About - Disclaimer - Privacy