We propose a new strategy for the parallelization of mesh processing algorithms. Our main contribution is the definition of distributed combinatorial maps (called n-dmaps), which allow us to represent the topology of big meshes by splitting them into...
The use of optimal control theory for motion planning is a challenging task. Cell mapping offers a way to formulate combinatorial optimization problems, allowing the inclusion of complex cost functions as well as multi-objective optimization problems...
High-throughput methods are extremely important in today’s materials science, especially in the case of thin film characterization. The micro-combinatorial method enables the deposition and characterization of entire multicomponent thin film sy...
We present a self-organizing map (SOM) approach to predicting macromolecular targets for combinatorial compound libraries. The aim was to study the usefulness of the SOM in combination with a topological pharmacophore representation (CATS) for select...
This research presents a novel hybrid approach, which combines the White Shark Optimizer (WSO) metaheuristic algorithm with chaotic maps integrated into the binarization process. Inspired by the predatory behavior of white sharks, WSO has shown great...
Quality–Diversity (QD) optimization has emerged as a distinctive paradigm in evolutionary computation, shifting the focus from identifying a single global optimum to illuminating a high-dimensional repertoire of elite solutions that jointly max...
This paper presents a systematic review on reinforcement learning approaches for combinatorial optimization problems based on real-world industrial applications. While this topic is increasing in popularity, explicit implementation details are not al...
The Unicost Set Covering Problem (USCP), an NP-hard combinatorial optimization challenge, demands efficient methods to minimize the number of sets covering a universe. This study introduces a binary White Shark Optimizer (WSO) enhanced with V3 transf...
3D city models are being extensively used in applications such as evacuation scenarios and energy consumption estimation. The main standard for 3D city models is the CityGML data model which can be encoded through the CityJSON data format. CityGML an...
The capacitated vehicle routing problem (CVRP) is a representative NP-hard combinatorial optimization problem with broad applications in logistics and transportation. This paper proposes a hybrid metaheuristic, termed SPSOM-CVRP, which integrates an...
To address the limitations of traditional Voltage-Current (VI) trajectory features in appliance load identification—such as the difficulty in distinguishing similar appliances, weakened amplitude information, and the absence of dynamic characte...
Adding time delay to nonlinear systems can significantly improve their performance, making it possible to construct image-encryption algorithms with higher security. In this paper, we propose a time-delayed nonlinear combinatorial hyperchaotic map (T...
This Special Issue of Algorithms is focused on the design, formal analysis, implementation, and experimental evaluation of efficient data structures for various computational problems.
Let Y be a smooth compact n-manifold. We studied smooth embeddings and immersions
Building displacement is a common operation to resolve the spatial conflicts between map features, and it has important theoretical value and practical application significance for multi-scale mapping. The prerequisite for a successful displacement o...
The Optimal Reactive Power Dispatch (ORPD) problem consists of finding the optimal settings of reactive power resources within a network, usually with the aim of minimizing active power losses. The ORPD is a nonlinear and nonconvex optimization probl...
Many scientific and engineering domains, including machine learning, software engineering, operations research, and logistics optimization, are characterized by a fragmented landscape of problem variants, methodological approaches, and application-sp...
The Equality-Generalized Travelling Salesman Problem (E-GTSP), which is an extension of the Travelling Salesman Problem (TSP), is stated as follows: given groups of points within a city, like banks, supermarkets, etc., find a minimum cost Hamiltonian...
The purpose of this paper is to determine the local dimension of the critical locus of a generic singularity. We use combinatorial methods to calculate this dimension in terms of a convex object associated with the singularity, called the Newton poly...
Chaotic maps are sources of randomness formed by a set of rules and chaotic variables. They have been incorporated into metaheuristics because they improve the balance of exploration and exploitation, and with this, they allow one to obtain better re...
We study shuffle product structures on words in three letters, extending the classical framework of multiple zeta values. Using an evaluation map that relates admissible words to iterated integrals, we translate shuffle identities into combinatorial...
Unaffected by cloud cover and solar illumination, synthetic aperture radar (SAR) images coupled with quad-polarimetric techniques have significant potential for mapping forest aboveground biomass (AGB) in the mountains of southern China. To improve t...
A recent effort used two rational maps on the Riemann sphere to produce polyhedral structures with properties exemplified by a soccer ball. A key feature of these maps is their respect for the rotational symmetries of the icosahedron. The present art...
This study aims to obtain sufficient corneal endothelial cells for regenerative application. We examined the combinatory effects of Rho-associated kinase (ROCK) inhibitor Y-27632 and mesenchymal stem cell-derived conditioned medium (MSC-CM) on the pr...
Many key pre-distribution (KPD) schemes based on combinatorial design were proposed for secure communication of wireless sensor networks (WSNs). Due to complexity of constructing the combinatorial design, it is infeasible to generate key rings using...
We present a combinatorial analysis of any maximal set of gate compositions parameterized over a finite alphabet which revealed an underlying fractal structure. Results are presented as global maps in the form of large 2D arrays where each row stands...
Using the Laplace transform and the Gamma function, we obtain the Laplace-type transform, with the property of mapping a function to a functional sequence, which cannot be realized by the Laplace transform. In addition, we construct a backward differ...
A novel artificial intelligence-assisted evaluation of the X-ray diffraction (XRD) peak profiles was elaborated for the characterization of the nanocrystallite microstructure in a combinatorial Co-Cr-Fe-Ni compositionally complex alloy (CCA) film. Th...
Combinatorially regular polyhedra are polyhedral realizations (embeddings) in Euclidean 3-space E3 of regular maps on (orientable) closed compact surfaces. They are close analogues of the Platonic solids. A surface of genus g ≥ 2 admits only finitely...
We performed an electrochromic investigation to optimize the composition of reactive magnetron-sputtered mixed layers of zinc oxide and tin oxide (ZnO-SnO2). Deposition experiments were conducted as a combinatorial material synthesis approach. The bi...
The combinational use of one-dimensional (1D) NMR-based screening techniques with 1H and 19F detections were applied to a human serum albumin–diflunisal complex. Since most NMR screening methods observe 1H spectra, the overlapped 1H signals were unav...
A regular map is an abstract generalization of a Platonic solid. It describes a group, a topological cell decomposition of a 2-manifold of type
Bacterial Pth1 is essential for viability. Pth1 cleaves the ester bond between the peptide and nucleotide of peptidyl-tRNA generated from aborted translation, expression of mini-genes, and short ORFs. We have determined the shape of the Pth1:peptidyl...
We present the first linkable ring signature scheme with both unconditional anonymity and forward-secure key update: a powerful tool which has direct applications in elegantly addressing a number of simultaneous constraints in remote electronic votin...
In many plant–pathogen interactions, the host resistance is governed by a combinatorial action of multiple genes termed as quantitative disease resistance (QDR). Three decades of genetic research on economically important interaction of chickpea (Cic...
Single nucleotide polymorphisms (SNPs) play a fundamental role in human genetic variation and are used in medical diagnostics, phylogeny construction, and drug design. They provide the highest-resolution genetic fingerprint for identifying disease as...
Let
Combinatorial optimization problems include many NP-hard problems such as assignment, scheduling, and routing, for which conventional approaches to solving become computationally infeasible for large instances, thereby necessitating the use of metahe...
Increased use of laser scanning in forest inventories is leading to the adoption and development of automated stand delineation methods. The most common categories of these methods are region merging and region growing. However, recent literature pro...
This study addresses the growing need to convert unstructured legal and policy documents into formal computational models that support transparent decision-making. The purpose of the work is to develop an applied framework that connects Legal NLP and...
A weak homomorphism from graph G to graph H is a mapping
The transition from continuous swarm intelligence algorithms to discrete combinatorial domains remains a critical challenge in bio-inspired computing. Traditional binarization techniques frequently induce premature convergence in highly constrained l...
A vertex in a graph is referred to as fixed if it is mapped to itself under every automorphism of the vertices. The fixing number of a graph is the minimum number of vertices, when fixed, that fixes all of the vertices in the graph. Fixing numbers we...
Toric posets are in some sense a natural “cyclic” version of finite posets in that they capture the fundamental features of a partial order but without the notion of minimal or maximal elements. They can be thought of combinatorially as equivalence c...
Map labeling is a classical problem of cartography that has frequently been approached by combinatorial optimization. Given a set of features in a map and for each feature a set of label candidates, a common problem is to select an independent set of...
Over the last few decades, many countries, especially islands in the Caribbean, have been challenged by the devastating consequences of natural disasters, which pose a significant threat to human health and safety. Timely information related to the d...
The standard-of-care (SOC) for genomic testing of myeloid cancers primarily relies on karyotyping/fluorescent in situ hybridization (FISH) (cytogenetic analysis) and targeted gene panels (usually ≤54 genes) that harbor hotspot pathogenic variants...
Multi-principal element alloys (MPEAs) are at the forefront of materials science due to their large variety of compositions, which can yield unexplored properties. Mapping the structure and properties of a compositional MPEA library in a reasonable t...
This paper proposes a hybrid quantum–classical framework for distribution network reconfiguration (DNR) under high distributed generation (DG) penetration, integrating nonlinear AC power-flow validation with the Quantum Approximate Optimization...
A graphoid is a mixed multigraph with multiple directed and/or undirected edges, loops, and semiedges. A covering projection of graphoids is an onto mapping between two graphoids such that at each vertex, the mapping restricts to a local bijection on...
of 4