Search Results (49)

Many challenges in solving large graph coloring through parallel strategies remain unresolved. Previous algorithms based on Pregel-like frameworks, such as Apache Giraph, encounter parallelism bottlenecks due to sequential execution and the need for a full graph traversal in certain stages. Additionally, GPU-based algorithms face the dilemma of costly and time-consuming processing when moving complex graph applications to GPU architectures. In this study, we propose Spardex, a novel parallel and distributed graph coloring optimization algorithm designed to overcome and avoid these challenges. We design a symmetry-driven optimization approach wherein the EdgePartition1D strategy in GraphX induces partitioning asymmetry, leading to overlapping locally symmetric regions. This structure is leveraged through asymmetric partitioning and symmetric reassembly to reduce the search space. A two-stage pipeline consisting of partitioned repaint and core conflict detection is developed, enabling the precise correction of conflicts without traversing the entire graph as in previous algorithms. We also integrate symmetry principles from combinatorial optimization into a distributed computing framework, demonstrating that leveraging locally symmetric subproblems can significantly enhance the efficiency of large-scale graph coloring. Combined with Spark-specific optimizations such as AQE skew join optimization, all these techniques contribute to an efficient parallel graph coloring optimization in Spardex. We conducted experiments using the Aliyun Cloud platform. The results demonstrate that Spardex achieves a reduction of 8–72% in the number of colors and a speedup of 1.13–10.27 times over concurrent algorithms. Full article

We introduce a quantum integrated-information measure $\Phi$ for multipartite states within the Relational Quantum Dynamics (RQD) framework. $\Phi \left(\rho \right)$ is defined as the minimum quantum Jensen–Shannon distance between an n-partite density operator $\rho$ and any product state over a bipartition of its subsystems. We prove that its square root induces a genuine metric on state space and that $\Phi$ is monotonic under all completely positive trace-preserving maps. Restricting the search to bipartitions yields a unique optimal split and a unique closest product state. From this geometric picture, we derive a canonical entanglement witness directly tied to $\Phi$ and construct an integration dendrogram that reveals the full hierarchical correlation structure of $\rho$. We further show that there always exists an “optimal observer”—a channel or basis—that preserves $\Phi$ better than any alternative. Finally, we propose a quantum Markov blanket theorem: the boundary of the optimal bipartition isolates subsystems most effectively. Our framework unites categorical enrichment, convex-geometric methods, and operational tools, forging a concrete bridge between integrated information theory and quantum information science. Full article

The spatial navigation of filamentous fungi was compared for three species, namely Pycnoporus cinnabarinus, Neurospora crassa wild type and ro-1 mutant, and Armillaria mellea, in microfluidic structures. The analysis of the navigation of these filamentous fungi in open and especially confining environments suggests that they perform space exploration using a hierarchical, three-layered system of information processing. The output of the space navigation of a single hypha is the result of coordination and competition between three programs with their corresponding subroutines: (i) the sensing of narrow passages (remote- or contact-based); (ii) directional memory; and (iii) branching (collision-induced or stochastic). One information-processing level up, the spatial distribution of multiple, closely collocated hyphae is the result of a combination of (i) negative autotropism and (ii) cytoplasm reallocation between closely related branches (with anastomosis as an alternative subroutine to increase robustness). Finally, the mycelium is the result of the sum of quasi-autonomous sub-populations of hyphae performing distribution in space in parallel based on the different spatial conditions and constraints found locally. The efficiency of space exploration by filamentous fungi appears to be the result of the synergy of various biological algorithms integrated into a hierarchical architecture of information processing, balancing complexity with specialization. Full article

This paper addresses the problem of infill drill hole placement for mineral resource estimation and classification. The placement is considered optimal when it maximizes an objective function that accounts for ore grades, mineral resource classes, extraction priorities, and block volumes, where the grade and resource classes are defined on the basis of a set of geostatistical simulations. To expedite the identification of the optimal solution within a condensed timeframe, modifications to the random search (RS) algorithm are introduced, including a partition of the region targeted for drilling and the definition of a maximum distance to existing drill holes. The modified RS divides the study area into smaller areas and examines all these areas to find the optimal solution, in order to reduce the search time and to reach the best possible solution. This approach, furthermore, eliminates the impact of different random starting points and the risk of getting trapped in certain areas of the solution space. Also, the incorporation of a geometallurgical parameter (recovered metal) instead of the ore grade represents an innovation that signifies the consideration of mineral processing perspectives to optimize the drill hole placement. The proposed modified RS algorithm is applied to a dataset from an Iranian iron deposit consisting of 240 exploration drill holes, and resulted in 11% to 21% of the indicated resources being converted into measured resources after locating nine infill drill holes accounting for the iron grade and the recovered metal, respectively. The modified RS also compares favorably to other traditional optimization techniques. Full article

The presence of multiplex edges and sparse links often hampers the efficacy of link prediction (LP) tasks. By harnessing the expressive power of Markov logic network (MLN) formulations, multiplex edges can be unified to enhance LP effectiveness. However, scaling up inferences for effective LP remains challenging due to the inefficiency of traditional MLN inference methods. To tackle this issue, we redefine LP tasks within heterogeneous networks using MLN inferences and introduce a tailored inference framework to handle unobserved nodes and complex MLN structures. We propose a method to partition the MLN structure into discrete substructures and compute node label distributions using the variational expectation maximization (VEM) algorithm. Additionally, we establish a termination condition to streamline inference search space and present the MLN-based LP algorithm. Experimental findings demonstrate the efficacy of our VEM-driven MLN inference framework for LP tasks in heterogeneous networks, showcasing superior accuracy compared to existing approaches. Full article

Solving satisfiability problems is central to many areas of computer science, including artificial intelligence and optimization. Efficiently solving satisfiability problems requires exploring vast search spaces, where search space partitioning plays a key role in improving solving efficiency. This paper defines search spaces and their partitioning, focusing on the relationship between partitioning strategies and satisfiability problem solving. By introducing an abstraction method for partitioning the search space—distinct from traditional assignment-based approaches—the paper proposes sequential, parallel, and hybrid solving algorithms. Experimental results show that the hybrid approach, combining abstraction and assignment, significantly accelerates solving in most cases. Furthermore, a unified method for search space partitioning is presented, defining independent and complete partitions. This method offers a new direction for enhancing the efficiency of SAT problem solving and provides a foundation for future research in the field. Full article

In this paper, a circuit-partitioning method is proposed based on partition connectivity clustering and tabu search. It includes four phases: coarsening, initial partitioning, uncoarsening, and refinement. In the initial partitioning phase, the concept of partition connectivity is introduced to optimize the vertex-clustering process, which clusters vertices with high connectivity in advance to provide an optimal initial solution. In the refinement phase, an improved tabu search algorithm is proposed, which combines two flexible neighborhood search rules and a candidate solution-selection strategy based on vertex-exchange frequency to further optimize load balancing. Additionally, a random perturbation method is suggested to increase the diversity of the search space and improve both the depth and breadth of global search. The experimental results based on the ISCAS-89 and ISCAS-85 benchmark circuits show that the average cut size of the proposed circuit-partitioning method is 0.91 times that of METIS and 0.86 times that of the KL algorithm, with better performance for medium- and small-scale circuits. Full article

With the increasing number of space debris, the demand for telescopes to observe space debris is also constantly increasing. The telescope observation scheduling problem requires algorithms to schedule telescopes to maximize observation value within the visible time constraints of space debris, especially when dealing with large-scale problems. This paper proposes a practical heuristic algorithm to solve the telescope observation of space debris scheduling problem. In order to accelerate the solving speed of algorithms on large-scale problems, this paper combines the characteristics of the problem and partitions the large-scale problem into multiple sub-problems according to the observation time. In each sub-problem, a coding method based on the priority of the target going into the queue is proposed in combination with the actual observation data, and a decoding method matching the coding method is designed. In the solution process for each sub-problem, an adaptive variable neighborhood search is used to solve the space debris observation plan. When solving all sub-problems is completed, the observation plans obtained on all sub-problems are combined to obtain the observation plan of the original problem. Full article

This paper proposes two new methods of key space partitioning for the cryptanalysis of block ciphers. The first one is called combined methodology of key space partition (CoMeKSPar), which allows us to simultaneously set some of the first and last consecutive bits of the key. In this way, the search is performed using the remaining middle bits. CoMeKSPar is a combination of two methods already proposed in the scientific literature, the Borges, Borges, Monier (BBM) and the Tito, Borges, Borges (TBB). The second method is called the general algorithm of key space reduction (GAKSRed), which makes it possible to perform a genetic algorithm search in the space formed by the unknown bits of the key, regardless of their distribution in the binary block. Furthermore, a method of attacking block ciphers is presented for the case where some key bits are known; the basic idea is to deduce some of the remaining bits of the block. An advantage of these methods is that they allow parallel computing, which allows simultaneous searches in different sub-blocks of key bits, thereby increasing the probability of success. The experiments are performed with the KLEIN (Small) lightweight block cipher using the genetic algorithm. Full article

Drone technology has undoubtedly become an integral part of our everyday life in recent years. The business and industrial use of unmanned aerial vehicles (UAVs) can provide advantageous solutions in many areas of life, and they are also optimal for emergency situations and for accessing hard-to-reach places. However, their application poses numerous technological and regulatory challenges to be overcome. One of the weak links in the operation of UAVs is the limited availability of energy. In order to address this issue, the authors developed a novel trajectory planning method for UAVs to optimize energy consumption during flight. First, an “energy map” was created, which was the basis for trajectory planning, i.e., determining the energy consumption of the individual components. This was followed by configuring the 3D environment including partitioning of the work space (WS), i.e., defining the free spaces, occupied spaces (obstacles), and semi-occupied/free spaces. Then, the corresponding graph-like path(s) were generated on the basis of the partitioned space, where a graph search-based heuristic trajectory planning was initiated, taking into account the most important wind conditions including velocity and direction. Finally, in order to test the theoretical results, some sample environments were created to test and analyze the proposed path generations. The method eventually proposed was able to determine the optimal path in terms of energy consumption. Full article

To ensure unmanned vehicles can perform a sortie mission quickly, efficiently, safely and reliably after receiving the command, it is necessary to calculate the sortie mission reliability of the shipborne unmanned vehicle group before loading. Aimed at the layout and sortie characteristics of an unmanned vehicle group, a sortie mission network model and a calculation method for sortie mission reliability are designed in this paper. Firstly, this paper uses space partition to parallel search for equal-length minimal paths based on the two-terminal network reliability. Secondly, this paper adopts the sum of disjoint products to process the equal-length minimal path set, innovatively proposing a calculation method for the sortie mission reliability of the shipborne unmanned vehicle group. Finally, the sortie mission reliability for three typical cases was calculated and compared with the Monte Carlo method. The comparative analysis indicates that the proposed method is both accurate and efficient, thereby corroborating its scientific validity and practical effectiveness. This study fills the gap in the field of sortie mission reliability and lays a theoretical foundation for subsequent research. Meanwhile, the method proposed in this paper can also be extended to the reliability calculation of a multiple-vehicle sortie mission in similar enclosed spaces. Full article

As the variety of space targets expands, two-dimensional (2D) ISAR images prove insufficient for target recognition, necessitating the extraction of three-dimensional (3D) information. The 3D geometry reconstruction method utilizing energy accumulation of ISAR image sequence (ISEA) facilitates superior reconstruction while circumventing the laborious steps associated with factorization methods. Nevertheless, ISEA’s neglect of valid information necessitates a high quantity of images and elongated operation times. This paper introduces a partitioned parallel 3D reconstruction method utilizing sorted-energy semi-accumulation with ISAR image sequences (PP-ISEA) to address these limitations. The PP-ISEA innovatively incorporates a two-step search pattern—coarse and fine—that enhances search efficiency and conserves computational resources. It introduces a novel objective function ‘sorted-energy semi-accumulation’ to discern genuine scatterers from spurious ones and establishes a redundant point exclusion module. Experiments on the scatterer model and simulated electromagnetic model demonstrate that the PP-ISEA reduces the minimum image requirement from ten to four for high-quality scatterer model reconstruction, thereby offering superior reconstruction quality in less time. Full article

The northeastern margin of the Tibetan Plateau (NE Tibetan Plateau) exhibits active geological structures and has experienced multiple strong earthquakes, with M ≥ 7, throughout history. Particularly noteworthy is the 1920 M8¹/₂ earthquake in the Haiyuan region that occurred a century ago and is documented as one of the deadliest earthquakes. Consequently, analyzing seismic risks in the northeastern margin of the Tibetan Plateau holds significant importance. The b value, a crucial parameter for seismic activity, plays a pivotal role in seismic hazard analyses. This study calculates the spatial b values in this region based on earthquake catalogs since 1970. The study area encompasses several major active faults, and due to variations in b values across different fault types, traditional grid-search methods may introduce significant errors in calculating the spatial b value within complex fault systems. To address this, we employed the hierarchical space–time point–process (HIST-PPM) method proposed by Ogata. This method avoids partitioning earthquake samples, optimizes parameters using Akaike’s Bayesian Information Criterion (ABIC) with entropy maximization, and theoretically allows for a higher spatial resolution and more accurate b value calculations. The results indicate a high spatial heterogeneity in b values within the study area. The northwestern and southeastern regions exhibit higher b values. Along the Haiyuan fault zone, the central rupture zone of the Haiyuan earthquake has relatively higher b values than other regions of this fault zone, which is possibly related to the sufficient release of stress during the main rupture of the Haiyuan earthquake. The b values vary from high in the west to low in the east along the Zhongwei fault. On the West Qinling fault zone, the epicenter of the recent Minxian–Zhangxian earthquake is associated with a low b value. In general, regions with low b values correspond well to areas with moderate–strong seismic events in the past 50 years. The spatial differences in b values may reflect variances in seismic hazards among fault zones and regions within the same fault zone. Full article

Efficiently searching for multiple targets in complex environments with limited perception and computational capabilities is challenging for multiple robots, which can coordinate their actions indirectly through their environment. In this context, swarm intelligence has been a source of inspiration for addressing multi-target search problems in the literature. So far, several algorithms have been proposed for solving such a problem, and in this study, we propose two novel multi-target search algorithms inspired by the Firefly algorithm. Unlike the conventional Firefly algorithm, where light is an attractor, light represents a negative effect in our proposed algorithms. Upon discovering targets, robots emit light to repel other robots from that region. This repulsive behavior is intended to achieve several objectives: (1) partitioning the search space among different robots, (2) expanding the search region by avoiding areas already explored, and (3) preventing congestion among robots. The proposed algorithms, named Global Lawnmower Firefly Algorithm (GLFA) and Random Bounce Firefly Algorithm (RBFA), integrate inverse light-based behavior with two random walks: random bounce and global lawnmower. These algorithms were implemented and evaluated using the ArGOS simulator, demonstrating promising performance compared to existing approaches. Full article

This paper studies the problem of linkage-bar synthesis by means of multiple deep neural networks (DNNs), which requires the inverse solution of linkage parameters based on a desired trajectory curve. This problem is highly complex due to the fact that the solution space is nonlinear and may contain multiple solutions, while a good quality of learning cannot be obtained by a single neural network approach. Therefore, this paper proposes employing Fourier descriptors to represent trajectory curves in a systematic and normalized form, developing a multi-solution distribution evaluation by random restart local searches (MDE-RRLS) to examine a better solution-space partitioning scheme, utilizing multiple DNNs to learn subspace regions separately, and creating a multi-facet query (MFQuery) to cooperatively predict multiple solutions. The experiments demonstrate that the proposed approach can obtain better or at least competitive outcomes compared to previous work in the literature. Furthermore, to verify the effectiveness and applicability, this paper investigates the design problem of an industrial six-linkage-bar ladle mechanism used in a die-casting system, and the proposed method can obtain several superior design solutions and offer alternatives in a short period of time when faced with redesign requirements. Full article