The computational complexity of inverse mimimum capacity path problem with lower bound on capacity of maximum capacity path is examined, and it is proved that solution of this problem is NP-complete. A strong polynomi...The computational complexity of inverse mimimum capacity path problem with lower bound on capacity of maximum capacity path is examined, and it is proved that solution of this problem is NP-complete. A strong polynomial algorithm for a local optimal solution is provided.展开更多
Maximum Flow Problem (MFP) discusses the maximum amount of flow that can be sent from the source to sink. Edmonds-Karp algorithm is the modified version of Ford-Fulkerson algorithm to solve the MFP. This paper present...Maximum Flow Problem (MFP) discusses the maximum amount of flow that can be sent from the source to sink. Edmonds-Karp algorithm is the modified version of Ford-Fulkerson algorithm to solve the MFP. This paper presents some modifications of Edmonds-Karp algorithm for solving MFP. Solution of MFP has also been illustrated by using the proposed algorithm to justify the usefulness of proposed method.展开更多
genetic algorithm is proposed for maximum independent set problems. A specially designed mutation operato is adopted to search the solution space more efficienily, where adjacen relation of a graph is inte-grated. The...genetic algorithm is proposed for maximum independent set problems. A specially designed mutation operato is adopted to search the solution space more efficienily, where adjacen relation of a graph is inte-grated. The DIMACS benchmark graphs are used to test our algorithm, and the results show that the algorithm outper-forms our previous version. Moreover two new low bounds are found for graphs in DIMACS.展开更多
The maximum satisfiability problem (MAX-SAT) refers to the task of finding a variable assignment that satisfies the maximum number of clauses (or the sum of weight of satisfied clauses) in a Boolean Formula. Most loca...The maximum satisfiability problem (MAX-SAT) refers to the task of finding a variable assignment that satisfies the maximum number of clauses (or the sum of weight of satisfied clauses) in a Boolean Formula. Most local search algorithms including tabu search rely on the 1-flip neighbourhood structure. In this work, we introduce a tabu search algorithm that makes use of the multilevel paradigm for solving MAX-SAT problems. The multilevel paradigm refers to the process of dividing large and difficult problems into smaller ones, which are hopefully much easier to solve, and then work backward towards the solution of the original problem, using a solution from a previous level as a starting solution at the next level. This process aims at looking at the search as a multilevel process operating in a coarse-to-fine strategy evolving from k-flip neighbourhood to 1-flip neighbourhood-based structure. Experimental results comparing the multilevel tabu search against its single level variant are presented.展开更多
Given a complete graph with edge-weights satisfying parameterized triangle inequality, we consider the maximum Hamilton path problem and design some approximation algorithms.
We devise an approach to Bayesian statistics and their applications in the analysis of the Monty Hall problem. We combine knowledge gained through applications of the Maximum Entropy Principle and Nash equilibrium str...We devise an approach to Bayesian statistics and their applications in the analysis of the Monty Hall problem. We combine knowledge gained through applications of the Maximum Entropy Principle and Nash equilibrium strategies to provide results concerning the use of Bayesian approaches unique to the Monty Hall problem. We use a model to describe Monty’s decision process and clarify that Bayesian inference results in an “irrelevant, therefore invariant” hypothesis. We discuss the advantages of Bayesian inference over the frequentist inference in tackling the uneven prior probability Monty Hall variant. We demonstrate that the use of Bayesian statistics conforms to the Maximum Entropy Principle in information theory and Bayesian approach successfully resolves dilemmas in the uneven probability Monty Hall variant. Our findings have applications in the decision making, information theory, bioinformatics, quantum game theory and beyond.展开更多
The present paper aims at showing the possible adoption in Psychiatry of a general methodology finalized to prescribe the most appropriate Therapy based on the knowledge of its correlative effects in advance, instead ...The present paper aims at showing the possible adoption in Psychiatry of a general methodology finalized to prescribe the most appropriate Therapy based on the knowledge of its correlative effects in advance, instead of recognizing them ex post. The specific case here considered is the “bipolar disorder”, in which the adoption of three different drugs is the most common practice, although with a possible differentiation between the prescription in the morning and in the evening, respectively. Thus, the proposed methodology will consider the Ordinal Interactions between the various drugs by evaluating their combined effects, which will result as being not a simple additive “sum”, because they are evaluated on the basis of the Maximum Ordinality Principle (MOP) and, in addition, in Adherence to the Explicit Solution to the “Three-Body Problem”. In this way the Methodology here proposed is able to suggest how to account for the synergistic effects of the various drugs, especially when the latter are characterized by different concentrations and, at the same time, by generally different half-lives respectively.展开更多
This paper presents the Solution to the “Three-body Problem” in the Light of the Maximum Ordinality Principle. In the first part, however, it starts with the Solution to the Solar System, made up of “11 Bodies”. T...This paper presents the Solution to the “Three-body Problem” in the Light of the Maximum Ordinality Principle. In the first part, however, it starts with the Solution to the Solar System, made up of “11 Bodies”. This is because, in such a context, the “Three-body Problem” can be analyzed in its all descriptive possibilities. Nonetheless, the paper also presents the Solution to the “Three-body Problem” with reference to Systems totally independent from the Solar System, such as, for example, the “Triple Stars” and the “Triple Galaxies”. In this way, the paper offers a sufficiently complete framework concerning the Solution to the “Three-body Problem”, always in the Light of the Maximum Ordinality Principle, described in detail in Appendix A.展开更多
The main objective of this paper is to demonstrate that the internal processes of Self-Organizing Systems represent a unique and singular process, characterized by their specific generativity. This process can be mode...The main objective of this paper is to demonstrate that the internal processes of Self-Organizing Systems represent a unique and singular process, characterized by their specific generativity. This process can be modeled using the Maximum Ordinality Principle and its associated formal language, known as the “Incipient” Differential Calculus (IDC).展开更多
The quantum alternating operator ansatz algorithm(QAOA+)is widely used for constrained combinatorial optimization problems(CCOPs)due to its ability to construct feasible solution spaces.In this paper,we propose a prog...The quantum alternating operator ansatz algorithm(QAOA+)is widely used for constrained combinatorial optimization problems(CCOPs)due to its ability to construct feasible solution spaces.In this paper,we propose a progressive quantum algorithm(PQA)to reduce qubit requirements for QAOA+in solving the maximum independent set(MIS)problem.PQA iteratively constructs a subgraph likely to include the MIS solution of the original graph and solves the problem on it to approximate the global solution.Specifically,PQA starts with a small-scale subgraph and progressively expands its graph size utilizing heuristic expansion strategies.After each expansion,PQA solves the MIS problem on the newly generated subgraph using QAOA+.In each run,PQA repeats the expansion and solving process until a predefined stopping condition is reached.Simulation results show that PQA achieves an approximation ratio of 0.95 using only 5.57%(2.17%)of the qubits and 17.59%(6.43%)of the runtime compared with directly solving the original problem with QAOA+on Erd?s-Rényi(3-regular)graphs,highlighting the efficiency and scalability of PQA.展开更多
We incorporate a non-Markovian feedback mechanism into the simulated bifurcation method for dynamical solvers addressing combinatorial optimization problems.By reinjecting a portion of dissipated kinetic energy into e...We incorporate a non-Markovian feedback mechanism into the simulated bifurcation method for dynamical solvers addressing combinatorial optimization problems.By reinjecting a portion of dissipated kinetic energy into each spin in a history-dependent and trajectory-informed manner,the method effectively suppresses early freezing induced by inelastic boundaries and enhances the system's ability to explore complex energy landscapes.Numerical results on the maximum cut(MAX-CUT)instances of fully connected Sherrington–Kirkpatrick(SK)spin glass models,including the 2000-spin K_(2000)benchmark,demonstrate that the non-Markovian algorithm significantly improves both solution quality and convergence speed.Tests on randomly generated SK instances with 100 to 1000 spins further indicate favorable scalability and substantial gains in computational efficiency.Moreover,the proposed scheme is well suited for massively parallel hardware implementations,such as field-programmable gate arrays,providing a practical and scalable approach for solving large-scale combinatorial optimization problems.展开更多
This article studies the Dirichlet eigenvalue problem for the Laplacian equations △u = -λu, x ∈Ω , u = 0, x ∈δΩ, where Ω belong to R^n is a smooth bounded convex domain. By using the method of appropriate barr...This article studies the Dirichlet eigenvalue problem for the Laplacian equations △u = -λu, x ∈Ω , u = 0, x ∈δΩ, where Ω belong to R^n is a smooth bounded convex domain. By using the method of appropriate barrier function combined with the maximum principle, authors obtain a sharp lower bound of the difference of the first two eigenvalues for the Dirichlet eigenvalue problem. This study improves the result of S.T. Yau et al.展开更多
This article presents the Parametric Iteration Method (PIM) for finding optimal control and its corresponding trajectory of linear systems. Without any discretization or transformation, PIM provides a sequence of func...This article presents the Parametric Iteration Method (PIM) for finding optimal control and its corresponding trajectory of linear systems. Without any discretization or transformation, PIM provides a sequence of functions which converges to the exact solution of problem. Our emphasis will be on an auxiliary parameter which directly affects on the rate of convergence. Comparison of PIM and the Variational Iteration Method (VIM) is given to show the preference of PIM over VIM. Numerical results are given for several test examples to demonstrate the applicability and efficiency of the method.展开更多
Two-phase, immiscible, incompressible flow in porous media is governed by a system of nonlinear partial differential equations. In most practical applications convection physically dominates diffusion, and the object ...Two-phase, immiscible, incompressible flow in porous media is governed by a system of nonlinear partial differential equations. In most practical applications convection physically dominates diffusion, and the object of this paper is to develop a finite difference method combined with the method of characteristics and the lumped mass method to treat the parabolic equation of the differential system. This method is shown satisfy the maximum principle and its error analysis is presented.展开更多
This paper deals with the optimal control problems of systems governed by a parabolic variational inequality coupled with a semilinear parabolic differential equations. The maximum principle and some kind of approxima...This paper deals with the optimal control problems of systems governed by a parabolic variational inequality coupled with a semilinear parabolic differential equations. The maximum principle and some kind of approximate controllability are studied.展开更多
In the theory of computational complexity, the travelling salesman problem is a typical one in the NP class. With the aid of a brand-new approach named “maximum-deleting method”, a fast algorithm is constructed for ...In the theory of computational complexity, the travelling salesman problem is a typical one in the NP class. With the aid of a brand-new approach named “maximum-deleting method”, a fast algorithm is constructed for it with a polynomial time of biquadrate, which greatly reduces the computational complexity. Since this problem is also NP-complete, as a corollary, P = NP is proved to be true. It indicates the crack of the well-known open problem named “P versus NP”.展开更多
In this paper, we first reformulate the max-min dispersion problem as a saddle-point problem. Specifically, we introduce an auxiliary problem whose optimum value gives an upper bound on that of the original problem. T...In this paper, we first reformulate the max-min dispersion problem as a saddle-point problem. Specifically, we introduce an auxiliary problem whose optimum value gives an upper bound on that of the original problem. Then we propose the saddle-point problem to be solved by an adaptive custom proximal point algorithm. Numerical results show that the proposed algorithm is efficient.展开更多
基金The authors gratefully acknowledge the partial support of national natural Founda-tion (Grant 70071011)
文摘The computational complexity of inverse mimimum capacity path problem with lower bound on capacity of maximum capacity path is examined, and it is proved that solution of this problem is NP-complete. A strong polynomial algorithm for a local optimal solution is provided.
文摘Maximum Flow Problem (MFP) discusses the maximum amount of flow that can be sent from the source to sink. Edmonds-Karp algorithm is the modified version of Ford-Fulkerson algorithm to solve the MFP. This paper presents some modifications of Edmonds-Karp algorithm for solving MFP. Solution of MFP has also been illustrated by using the proposed algorithm to justify the usefulness of proposed method.
文摘genetic algorithm is proposed for maximum independent set problems. A specially designed mutation operato is adopted to search the solution space more efficienily, where adjacen relation of a graph is inte-grated. The DIMACS benchmark graphs are used to test our algorithm, and the results show that the algorithm outper-forms our previous version. Moreover two new low bounds are found for graphs in DIMACS.
文摘The maximum satisfiability problem (MAX-SAT) refers to the task of finding a variable assignment that satisfies the maximum number of clauses (or the sum of weight of satisfied clauses) in a Boolean Formula. Most local search algorithms including tabu search rely on the 1-flip neighbourhood structure. In this work, we introduce a tabu search algorithm that makes use of the multilevel paradigm for solving MAX-SAT problems. The multilevel paradigm refers to the process of dividing large and difficult problems into smaller ones, which are hopefully much easier to solve, and then work backward towards the solution of the original problem, using a solution from a previous level as a starting solution at the next level. This process aims at looking at the search as a multilevel process operating in a coarse-to-fine strategy evolving from k-flip neighbourhood to 1-flip neighbourhood-based structure. Experimental results comparing the multilevel tabu search against its single level variant are presented.
文摘Given a complete graph with edge-weights satisfying parameterized triangle inequality, we consider the maximum Hamilton path problem and design some approximation algorithms.
文摘We devise an approach to Bayesian statistics and their applications in the analysis of the Monty Hall problem. We combine knowledge gained through applications of the Maximum Entropy Principle and Nash equilibrium strategies to provide results concerning the use of Bayesian approaches unique to the Monty Hall problem. We use a model to describe Monty’s decision process and clarify that Bayesian inference results in an “irrelevant, therefore invariant” hypothesis. We discuss the advantages of Bayesian inference over the frequentist inference in tackling the uneven prior probability Monty Hall variant. We demonstrate that the use of Bayesian statistics conforms to the Maximum Entropy Principle in information theory and Bayesian approach successfully resolves dilemmas in the uneven probability Monty Hall variant. Our findings have applications in the decision making, information theory, bioinformatics, quantum game theory and beyond.
文摘The present paper aims at showing the possible adoption in Psychiatry of a general methodology finalized to prescribe the most appropriate Therapy based on the knowledge of its correlative effects in advance, instead of recognizing them ex post. The specific case here considered is the “bipolar disorder”, in which the adoption of three different drugs is the most common practice, although with a possible differentiation between the prescription in the morning and in the evening, respectively. Thus, the proposed methodology will consider the Ordinal Interactions between the various drugs by evaluating their combined effects, which will result as being not a simple additive “sum”, because they are evaluated on the basis of the Maximum Ordinality Principle (MOP) and, in addition, in Adherence to the Explicit Solution to the “Three-Body Problem”. In this way the Methodology here proposed is able to suggest how to account for the synergistic effects of the various drugs, especially when the latter are characterized by different concentrations and, at the same time, by generally different half-lives respectively.
文摘This paper presents the Solution to the “Three-body Problem” in the Light of the Maximum Ordinality Principle. In the first part, however, it starts with the Solution to the Solar System, made up of “11 Bodies”. This is because, in such a context, the “Three-body Problem” can be analyzed in its all descriptive possibilities. Nonetheless, the paper also presents the Solution to the “Three-body Problem” with reference to Systems totally independent from the Solar System, such as, for example, the “Triple Stars” and the “Triple Galaxies”. In this way, the paper offers a sufficiently complete framework concerning the Solution to the “Three-body Problem”, always in the Light of the Maximum Ordinality Principle, described in detail in Appendix A.
文摘The main objective of this paper is to demonstrate that the internal processes of Self-Organizing Systems represent a unique and singular process, characterized by their specific generativity. This process can be modeled using the Maximum Ordinality Principle and its associated formal language, known as the “Incipient” Differential Calculus (IDC).
基金supported by the National Natural Science Foundation of China(Grant Nos.62371069,62372048,and 62272056)BUPT Excellent Ph.D.Students Foundation(Grant No.CX2023123)。
文摘The quantum alternating operator ansatz algorithm(QAOA+)is widely used for constrained combinatorial optimization problems(CCOPs)due to its ability to construct feasible solution spaces.In this paper,we propose a progressive quantum algorithm(PQA)to reduce qubit requirements for QAOA+in solving the maximum independent set(MIS)problem.PQA iteratively constructs a subgraph likely to include the MIS solution of the original graph and solves the problem on it to approximate the global solution.Specifically,PQA starts with a small-scale subgraph and progressively expands its graph size utilizing heuristic expansion strategies.After each expansion,PQA solves the MIS problem on the newly generated subgraph using QAOA+.In each run,PQA repeats the expansion and solving process until a predefined stopping condition is reached.Simulation results show that PQA achieves an approximation ratio of 0.95 using only 5.57%(2.17%)of the qubits and 17.59%(6.43%)of the runtime compared with directly solving the original problem with QAOA+on Erd?s-Rényi(3-regular)graphs,highlighting the efficiency and scalability of PQA.
基金supported by the National Key Research and Development Program of China(Grant No.2024YFA1408500)the National Natural Science Foundation of China(Grant Nos.12174028 and 12574115)the Open Fund of the State Key Laboratory of Spintronics Devices and Technologies(Grant No.SPL-2408)。
文摘We incorporate a non-Markovian feedback mechanism into the simulated bifurcation method for dynamical solvers addressing combinatorial optimization problems.By reinjecting a portion of dissipated kinetic energy into each spin in a history-dependent and trajectory-informed manner,the method effectively suppresses early freezing induced by inelastic boundaries and enhances the system's ability to explore complex energy landscapes.Numerical results on the maximum cut(MAX-CUT)instances of fully connected Sherrington–Kirkpatrick(SK)spin glass models,including the 2000-spin K_(2000)benchmark,demonstrate that the non-Markovian algorithm significantly improves both solution quality and convergence speed.Tests on randomly generated SK instances with 100 to 1000 spins further indicate favorable scalability and substantial gains in computational efficiency.Moreover,the proposed scheme is well suited for massively parallel hardware implementations,such as field-programmable gate arrays,providing a practical and scalable approach for solving large-scale combinatorial optimization problems.
基金This research was supported by the National Natural Science Foundation of Chinathe Scientific Research Foundation of the Ministry of Education of China (02JA790014)+1 种基金the Natural Science Foundation of Fujian Province Education Department(JB00078)the Developmental Foundation of Science and Technology of Fuzhou University (2004-XQ-16)
文摘This article studies the Dirichlet eigenvalue problem for the Laplacian equations △u = -λu, x ∈Ω , u = 0, x ∈δΩ, where Ω belong to R^n is a smooth bounded convex domain. By using the method of appropriate barrier function combined with the maximum principle, authors obtain a sharp lower bound of the difference of the first two eigenvalues for the Dirichlet eigenvalue problem. This study improves the result of S.T. Yau et al.
文摘This article presents the Parametric Iteration Method (PIM) for finding optimal control and its corresponding trajectory of linear systems. Without any discretization or transformation, PIM provides a sequence of functions which converges to the exact solution of problem. Our emphasis will be on an auxiliary parameter which directly affects on the rate of convergence. Comparison of PIM and the Variational Iteration Method (VIM) is given to show the preference of PIM over VIM. Numerical results are given for several test examples to demonstrate the applicability and efficiency of the method.
基金This work is supported by National Educational Committce Doctoral Point foundation.
文摘Two-phase, immiscible, incompressible flow in porous media is governed by a system of nonlinear partial differential equations. In most practical applications convection physically dominates diffusion, and the object of this paper is to develop a finite difference method combined with the method of characteristics and the lumped mass method to treat the parabolic equation of the differential system. This method is shown satisfy the maximum principle and its error analysis is presented.
基金This work was partially supported by the NutionalNatural Science Foundation of China
文摘This paper deals with the optimal control problems of systems governed by a parabolic variational inequality coupled with a semilinear parabolic differential equations. The maximum principle and some kind of approximate controllability are studied.
文摘In the theory of computational complexity, the travelling salesman problem is a typical one in the NP class. With the aid of a brand-new approach named “maximum-deleting method”, a fast algorithm is constructed for it with a polynomial time of biquadrate, which greatly reduces the computational complexity. Since this problem is also NP-complete, as a corollary, P = NP is proved to be true. It indicates the crack of the well-known open problem named “P versus NP”.
文摘In this paper, we first reformulate the max-min dispersion problem as a saddle-point problem. Specifically, we introduce an auxiliary problem whose optimum value gives an upper bound on that of the original problem. Then we propose the saddle-point problem to be solved by an adaptive custom proximal point algorithm. Numerical results show that the proposed algorithm is efficient.
