Search Results (14)

The effective resolution of non-deterministic polynomial time hard (NP-hard) combinatorial optimization problems requires a delicate balance between global exploration and local exploitation. While Quantum-Inspired Algorithms (QIAs) leverage principles of superposition to explore vast search spaces, they often lack the fine-grained exploitation capabilities of classical heuristics. To address this limitation, we propose the Quantum-Memetic Hybrid Algorithm (QMHA), a component-based framework that synergistically integrates qubit-based global search with adaptive classical refinement. The QMHA architecture explicitly coordinates five distinct algorithmic components: (1) quantum rotation gates for exploration, (2) a problem-aware memetic operator for immediate solution refinement, (3) an adaptive learning rate schedule, (4) periodic local search, and (5) a stagnation-based population reset for diversity management. We rigorously evaluate the framework against nine established metaheuristics, including Genetic Algorithms (GA), Differential Evolution (DE), Particle Swarm Optimization (PSO), Simulated Annealing (SA), Ant Colony Optimization (ACO), MAX-MIN Ant System (MMAS), Memetic Algorithms (MA), Quantum Evolutionary Algorithm (QEA), and Harmony Search (HS), across a comprehensive benchmark suite comprising six NP-hard problem families: constrained combinatorial (Knapsack), graph-based (Max-Cut), permutation-based (TSP), constraint satisfaction (Graph Coloring), bin optimization (Bin Packing), and scheduling (Flow Shop Scheduling), as well as real-world machine learning (Feature Selection) problems and the continuous Congress on Evolutionary Computation (CEC) 2022 benchmark. Statistical analysis using Friedman tests and Nemenyi post hoc comparisons confirms that QMHA achieves a statistically significant performance advantage ($p<0.004$) and superior average rank (1.5) compared to component baselines and state-of-the-art competitors. Comprehensive analyses include computational complexity profiling, parameter sensitivity mapping, scalability testing up to $D=2000$, noise robustness evaluation, variable correlation degradation analysis, a six-component ablation study, exploration–exploitation dynamics tracking, integration mechanism comparison across five architectures, and a multi-objective extension feasibility study. The proposed framework offers a robust, verified approach to hybrid optimization without relying on biological metaphors. Full article

Repurposing existing refined oil pipelines for green methanol batch transportation is a cost-effective pathway for large-scale low-carbon fuel delivery, yet severe mixing between methanol and gasoline impairs transport economy and safety. Conventional mixing control schemes rely on isolating agents or fixed-flow adjustment with limited active regulation capacity, so this work aims to develop a material-free pulsed pumping technology to suppress interfacial mixed oil. A validated SPS transient flow–mixing coupled model is built based on a real South China long-distance pipeline, and minute-scale trapezoidal-wave pumping is proposed inspired by cardiac pulsation; three key parameters, including rest period duration, acceleration–deceleration ratio and flow amplitude ratio, are systematically scanned via numerical simulation. The results reveal a non-monotonic correlation between rest period and mixed oil volume, with the optimal 40 min interval cutting mixed oil by 18.37%. Waveforms with acceleration time no shorter than deceleration time achieve stable 18–20% mixing reduction, and the optimal max–min flow ratio of 10:7 delivers a 19.38% reduction. The integrated optimal parameter set reduces mixed oil by 19.4–19.8%. This study provides operable field parameters and a low-cost active mixing suppression strategy for methanol–gasoline sequential pipelines, offering theoretical support for the reuse of existing oil pipelines for green fuel transportation. Full article

In the global transition toward low-carbon power systems with high renewable energy penetration, pumped storage has emerged as a strategic cornerstone for modern power grids. However, the collaborative planning of pumped storage and backbone-grids faces critical challenges, including the lack of explicit quantification of the resilience value of pumped storage and the coarse treatment of N-1 connectivity constraints. This paper proposes a bi-objective resilient backbone-grid planning approach that integrates the pumped-storage hub effect, aiming to minimize total life-cycle costs and the system resilience mismatch index. The proposed framework incorporates network connectivity, N-1 connectivity (edge connectivity ≥ 2), and dual-scenario power flow security as rigid constraints. Furthermore, a three-stage constrained evolutionary algorithm TER-NSGA-II is developed. During the N-1 connectivity reinforcement phase, the max-flow min-cut theorem is employed to achieve precise validation and guidance for edge-connectivity enhancement. Case studies on the IEEE 118-bus system, together with extended validation on the IEEE 300-bus system, show that the proposed method can explicitly quantify the resilience value of pumped storage, obtain Pareto solutions that balance economy and resilience under strict edge-connectivity constraints, and demonstrate competitive overall performance in terms of solution-set quality, feasible-domain search stability, and scalability compared with NSGA-II and the more recent NSGA-III/NG benchmark. Full article

In graph theory and network design, the minimum cut is a fundamental measure of system connectivity and communication capacity. While prior research has largely focused on computing the minimum cut for a fixed source–sink pair, practical scenarios such as data center communication often demand a different objective: identifying the source node whose minimum cut to a designated sink is maximized. This task, which we term the Global Maximum Minimum Cut with Fixed Sink (GMMC-FS) problem, captures the goal of locating a high-capacity source relative to a shared sink node that aggregates multiple servers. The problem is of significant engineering importance, yet it is computationally challenging as it involves a nested max–min optimization. In this paper, we present a recursive reduction (RR) algorithm for solving the GMMC-FS problem. The key idea is to iteratively select pivot nodes, compute their minimum cuts with respect to the sink, and prune dominated candidates whose cut values cannot exceed that of the pivot. By recursively applying this elimination process, RR dramatically reduces the number of max-flow computations required while preserving exact correctness. Compared with classical contraction-based and Gomory–Hu tree approaches that rely on global cut enumeration, the proposed RR framework offers a more direct and scalable mechanism for identifying the source that maximizes the minimum cut to a fixed sink. Its novelty lies in exploiting the structural properties of the sink side of suboptimal cuts, which leads to both theoretical efficiency and empirical robustness across large-scale networks. We provide a rigorous theoretical analysis establishing both correctness and complexity bounds, and we validate the approach through extensive experiments. Results demonstrate that RR consistently achieves optimal solutions while significantly outperforming baseline methods in runtime, particularly on large and dense networks. Full article

Monitoring critical transmission sections is essential for ensuring the operational security of power grids. This paper proposes a systematic method to identify critical transmission sections using the maximum flow–minimum cut theorem. The approach begins by representing the power grid as an undirected graph and identifying its hanging nodes. The network is then partitioned into several undirected subgraphs based on identified cut points. Each subgraph is transformed into a flow network according to actual power flow data. An efficient minimum cut set search algorithm is developed to locate potential transmission sections. To assess the risk under extreme conditions, a mixed-integer optimization model is formulated to select sections that are vulnerable to overload-induced tripping during N-K line outages caused by natural disasters. Simulation results on the IEEE RTS 24-bus and IEEE 39-bus systems validate the effectiveness and applicability of the proposed method. Full article

The entanglement entropy of a random tensor network (RTN) is studied using tools from free probability theory. Random tensor networks are simple toy models that help in understanding the entanglement behavior of a boundary region in the anti-de Sitter/conformal field theory (AdS/CFT) context. These can be regarded as specific probabilistic models for tensors with particular geometry dictated by a graph (or network) structure. First, we introduce a model of RTN obtained by contracting maximally entangled states (corresponding to the edges of the graph) on the tensor product of Gaussian tensors (corresponding to the vertices of the graph). The entanglement spectrum of the resulting random state is analyzed along a given bipartition of the local Hilbert spaces. The limiting eigenvalue distribution of the reduced density operator of the RTN state is provided in the limit of large local dimension. This limiting value is described through a maximum flow optimization problem in a new graph corresponding to the geometry of the RTN and the given bipartition. In the case of series-parallel graphs, an explicit formula for the limiting eigenvalue distribution is provided using classical and free multiplicative convolutions. The physical implications of these results are discussed, allowing the analysis to move beyond the semiclassical regime without any cut assumption, specifically in terms of finite corrections to the average entanglement entropy of the RTN. Full article

Depending on the obturation technique, the tooth and surrounding tissues may heat up during root canal filling, particularly with warm methods. This study aimed to analyze the temperature increase in the periradicular and -apical region during various warm obturation techniques with a present simulated periodontal blood flow. Seventy-five extracted human teeth were shortened to 11 mm (cut-grinder Primus diamond cutting device; Walter Messner GmbH, Oststeinbek, Germany) and prepared using the ProTaper Gold system (Dentsply Sirona Inc., Charlotte, NC, USA) ISO size 40/.06. Specimens were prepared to ensure stable fluid circulation in an artificially created periodontal space, and the procedure was recorded with a thermal infrared camera (VarioCAM HD; InfraTec GmbH Infrarotsensorik und Messtechnik, Dresden, Germany). The following obturation methods were applied: I, cold single-cone obturation (control group); II, gutta-percha-coated rigid carrier technique (GuttaFusion); III, squirting technique (injection technique); IV, continuous wave technique; and V, Schilder technique. Statistical analysis was performed using the Kruskal–Wallis test, followed by the Mann–Whitney pairwise test using the sequential Bonferroni procedure for significant differences (p < 0.05). The Schilder technique with 0 mL/min showed the lowest temperature change, with a median of 0.00 °C (max. 0.00 °C, min. 0.00 °C, IQR 0.00 °C). In contrast, the continuous wave technique at a circulation rate of 2.6 mL/min exhibited the highest temperature change, with a median of 3.76 °C (max. 5.33 °C, min. 2.42 °C, IQR 1.46 °C). Although warm obturation techniques can increase surface temperature, none of the methods produced changes that were potentially damaging to the periodontium or surrounding bone. Full article

We address the challenge of identifying meaningful communities by proposing a model based on convex game theory and a measure of community strength. Many existing community detection methods fail to provide unique solutions, and it remains unclear how the solutions depend on initial conditions. Our approach identifies strong communities with a hierarchical structure, visualizable as a dendrogram, and computable in polynomial time using submodular function minimization. This framework extends beyond graphs to hypergraphs or even polymatroids. In the case when the model is graphical, a more efficient algorithm based on the max-flow min-cut algorithm can be devised. Though not achieving near-linear time complexity, the pursuit of practical algorithms is an intriguing avenue for future research. Our work serves as the foundation, offering an analytical framework that yields unique solutions with clear operational meaning for the communities identified. Full article

In the fingertip blood automatic sampling process, when the blood sampling point in the fingertip venous area, it will greatly increase the amount of bleeding without being squeezed. In order to accurately locate the blood sampling point in the venous area, we propose a new finger vein image segmentation approach basing on Gabor transform and Gaussian mixed model (GMM). Firstly, Gabor filter parameter can be set adaptively according to the differential excitation of image and we use the local binary pattern (LBP) to fuse the same-scale and multi-orientation Gabor features of the image. Then, finger vein image segmentation is achieved by Gabor-GMM system and optimized by the max flow min cut method which is based on the relative entropy of the foreground and the background. Finally, the blood sampling point can be localized with corner detection. The experimental results show that the proposed approach has significant performance in segmenting finger vein images which the average accuracy of segmentation images reach 91.6%. Full article

Multi-baseline (MB) phase unwrapping (PU) is a key step of MB synthetic aperture radar (SAR) interferometry (InSAR). Compared with the traditional single-baseline (SB) PU, MB PU is applicable to the area where topography varies violently without obeying the phase continuity assumption. A two-stage programming MB PU approach (TSPA) proposed by H. Yu. builds the link between SB and MB PUs, so many existing classical SB PU methods can be transplanted into the MB domain. In this paper, an extended PU max-flow/min-cut (PUMA) algorithm for MB InSAR using the TSPA, referred to as TSPA-PUMA, is proposed, consisting of a two-stage programming procedure. In stage 1, phase gradients are estimated based on Chinese remainder theorem (CRT). In stage 2, a Markov random field (MRF) model of PUMA is designed for modeling local contextual dependence based on the phase gradients obtained by stage 1. Subsequently, the energy of the MRF model is minimized by graph cuts techniques. The experiment results illustrate that the TSPA-PUMA method can drastically enhance the accuracy of the original PUMA method in the rugged area, and is more efficient than the original TSPA method. In addition, the noise robustness of TSPA-PUMA can be improved through adding more interferograms with different baseline lengths. Full article

In this paper, we propose a methodology to solve the stereo matching problem through quantum annealing optimization. Our proposal takes advantage of the existing Min-Cut/Max-Flow network formulation of computer vision problems. Based on this network formulation, we construct a quadratic pseudo-Boolean function and then optimize it through the use of the D-Wave quantum annealing technology. Experimental validation using two kinds of stereo pair of images, random dot stereograms and gray-scale, shows that our methodology is effective. Full article

One of the remarkable challenges about Wireless Sensor Networks (WSN) is how to transfer the collected data efficiently due to energy limitation of sensor nodes. Network coding will increase network throughput of WSN dramatically due to the broadcast nature of WSN. However, the network coding usually propagates a single original error over the whole network. Due to the special property of error propagation in network coding, most of error correction methods cannot correct more than C/2 corrupted errors where C is the max flow min cut of the network. To maximize the effectiveness of network coding applied in WSN, a new error-correcting mechanism to confront the propagated error is urgently needed. Based on the social network characteristic inherent in WSN and L1 optimization, we propose a novel scheme which successfully corrects more than C/2 corrupted errors. What is more, even if the error occurs on all the links of the network, our scheme also can correct errors successfully. With introducing a secret channel and a specially designed matrix which can trap some errors, we improve John and Yi’s model so that it can correct the propagated errors in network coding which usually pollute exactly 100% of the received messages. Taking advantage of the social characteristic inherent in WSN, we propose a new distributed approach that establishes reputation-based trust among sensor nodes in order to identify the informative upstream sensor nodes. With referred theory of social networks, the informative relay nodes are selected and marked with high trust value. The two methods of L1 optimization and utilizing social characteristic coordinate with each other, and can correct the propagated error whose fraction is even exactly 100% in WSN where network coding is performed. The effectiveness of the error correction scheme is validated through simulation experiments. Full article

In order to improve the recognition rate of hand gestures a new interactive image segmentation method for hand gesture recognition is presented, and popular methods, e.g., Graph cut, Random walker, Interactive image segmentation using geodesic star convexity, are studied in this article. The Gaussian Mixture Model was employed for image modelling and the iteration of Expectation Maximum algorithm learns the parameters of Gaussian Mixture Model. We apply a Gibbs random field to the image segmentation and minimize the Gibbs Energy using Min-cut theorem to find the optimal segmentation. The segmentation result of our method is tested on an image dataset and compared with other methods by estimating the region accuracy and boundary accuracy. Finally five kinds of hand gestures in different backgrounds are tested on our experimental platform, and the sparse representation algorithm is used, proving that the segmentation of hand gesture images helps to improve the recognition accuracy. Full article

A swarming mobile sensor network is comprised of a swarm of wirelessly connected mobile robots equipped with various sensors. Such a network can be applied in an uncertain environment for services such as cooperative navigation and exploration, object identification and information gathering. One of the most advantageous properties of the swarming wireless sensor network is that mobile nodes can work cooperatively to organize an ad-hoc network and optimize the network link capacity to maximize the transmission of gathered data from a source to a target. This paper describes a new method of link optimization of swarming mobile sensor networks. The new method is based on combination of the artificial potential force guaranteeing connectivities of the mobile sensor nodes and the max-flow min-cut theorem of graph theory ensuring optimization of the network link capacity. The developed algorithm is demonstrated and evaluated in simulation. Full article