Results 91 to 100 of about 149,618 (314)
Linear and ellipsoidal pattern separation: theoretical aspects and experimental analysis [PDF]
This thesis deals with a pattern classification problem, which geometrically implies data separation in some Euclidean feature space. The task is to infer a classifier (a separating surface) from a set or sequence of observations.
Kharechko, Andriy
core
Dealing with non-metric dissimilarities in fuzzy central clustering algorithms [PDF]
Clustering is the problem of grouping objects on the basis of a similarity measure among them. Relational clustering methods can be employed when a feature-based representation of the objects is not available, and their description is given in terms of ...
Filippone, Maurizio +2 more
core +1 more source
Optimal Ordering of Conflicting Objects and the Traveling Salesman Problem
The paper presents the setting of the problem of optimal ordering of conflicting objects related to the Travelling Salesman Problem (TSP). The problem of optimal ordering of conflicting objects appears in sociology, in graph analysis and finding in them ...
Alexey Voevodin, Semen Kosyachenko
doaj
LC-DFSA: Low Complexity Dynamic Frame Slotted Aloha Anti-Collision Algorithm for RFID System
With the rapid development of the Internet of Things (IoT), the radio frequency identification (RFID) system becomes increasingly important. Tag identification is a basic problem of the RFID system, whose purpose is to inventory tags.
Zhaozhe Jiang +3 more
doaj +1 more source
Fostering Innovation: Streamlining Magnetocaloric Materials Research by Digitalization
Magnetocaloric cooling (MCE) is an environmentally friendly refrigeration method with great potential. Optimizing MCE materials involves the preparation and screening of large quantities of samples, which in turn generates a large amount of data. A digitalization approach is presented that uses ontologies, knowledge graphs, and digital workflows to ...
Simon Bekemeier +17 more
wiley +1 more source
Phase transitions in project scheduling. [PDF]
The analysis of the complexity of combinatorial optimization problems has led to the distinction between problems which are solvable in a polynomially bounded amount of time (classified in P) and problems which are not (classified in NP).
De Reyck, B, Herroelen, Willy
core
We are concerned with designing feedback-based adaptive network coding schemes with the aim of minimizing decoding delay in each transmission in packet-based erasure networks.
Parastoo Sadeghi +2 more
doaj +2 more sources
Multimodal Data‐Driven Microstructure Characterization
A self‐consistent autonomous workflow for EBSP‐based microstructure segmentation by integrating PCA, GMM clustering, and cNMF with information‐theoretic parameter selection, requiring no user input. An optimal ROI size related to characteristic grain size is identified.
Qi Zhang +4 more
wiley +1 more source
Minimal Cut Vectors (MCVs) and Minimal Path Vectors (MPVs) are one of the key concepts of reliability analysis. They allow us to estimate system availability or to analyze influence of individual system components on the entire system.
Miroslav Kvassay, Jozef Kostolny
doaj +1 more source
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

