Solution to the “Three-Body Problem” in the Light of the Maximum Ordinality Principle, as a “Suggestion” for a Ri-Orientation of the Present Scientific Perspective in “Favor” of the “Irreducible Quality”

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.

Three-Drug Therapies in Psychiatry in the Light of the Maximum Ordinality Principle and the Explicit Solution to the “Three-Body Problem”—D.D. 23 Luglio 2023, Tempo Ordinario (3.00 e 10.20)

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.

Generativity of Self-Organizing Processes and Their Correlative Description in Terms of a Formal Language of Meta-Ordinal Generative Nature, in the Light of the Maximum Ordinality Principle and the Explicit Solution to the “Three-Body Problem”

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).

A Modified Genetic Algorithm for Maximum Independent Set Problems

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.

AN INVERSE MAXIMUM CAPACITY PATH PROBLEM WITH LOWER BOUND CONSTRAINTS

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.

A Multilevel Tabu Search for the Maximum Satisfiability Problem

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.

Modified EDMONDS-KARP Algorithm to Solve Maximum Flow Problems

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.

The Maximum Hamilton Path Problem with Parameterized Triangle Inequality

Given a complete graph with edge-weights satisfying parameterized triangle inequality, we consider the maximum Hamilton path problem and design some approximation algorithms.

降阶单元的新进展:内置了最大模误差估计器的自适应有限元法初探

该文基于初值问题中降阶单元的成功实践,进一步对一般边值问题提出无需超收敛计算、无需结构化网格、无需结点位移修正的降阶单元;进而提出以降阶单元作为最终解,且内置了最大模误差估计器的自适应有限元算法。该文对这一研究进展做简要介绍,并给出一维和二维边值问题的初步算例,以展示本法的可行性、有效性和可靠性。

内置了最大模误差估计器的自适应有限元法——研究进展与展望

新近提出的降阶单元,将常规单元解答的最高次项视为误差项,当作内置的最大模误差估计器;将降低一次的解作为有限元最终解,从而一举实现了按最大模控制误差的自适应有限元算法。降阶单元最初针对结构时程分析的自适应步长算法提出,同时将其推广到一般的一维初值问题和边值问题。其后,将其推广到二维边值问题,构造了任意四边形和三角形降阶单元,已成功求解弹性薄膜挠度、弹性力学平面问题、平面和反平面裂纹问题、中厚板弯曲问题等各类二维问题。近期,又进一步将其推广到诸如非线性初值问题、薄膜结构找形问题、最小曲面问题、薄膜与地基接触、弹塑性扭转问题等非线性问题。该文对这一系列研究进展做了综述性介绍和展望,并给出各类问题的代表性数值算例以展示本法的有效性、灵活性、通用性和可靠性。

Maximum Entropy and Bayesian Inference for the Monty Hall Problem

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.

基于有效限制邻域结构的禁忌搜索求解预算最大覆盖问题

针对预算最大覆盖问题,设计出一种基于有效限制邻域结构的禁忌搜索算法(Effectively Restricted Neighborhood Structure Based Tabu Search,ERNSBTS)对其求解。该算法主要由动态初始化、基于策略限制邻域结构和动态随机扰动重新初始化三部分组成。首先,提出构建剩余利润和剩余价值密度来生成好的初始解。然后,引入计数器G来记录当前解下元素覆盖次数,设计相对置空率和相对增益率两种策略来得到最有期望子集来限制邻域结构。最后,设计扰动程序,将贪婪与启发式思想相结合,考虑全局和局部的凸组合,以增加初始解的多样性。在数值实验中,分析了ERNSBTS算法参数设置,同时将其与近似算法、PLTS和VDLS算法的结果进行比较分析,证实了ERNSBTS算法在求解质量、计算效率和鲁棒性方面的高竞争力。

求解Max-Re-SAT的离散混沌量子蝙蝠算法

针对最大正则可满足性问题求解算法的研究空缺,以及提升求解最大可满足性问题的智能优化算法的精度,基于蝙蝠算法(bat algorithm,BA),提出了一种基于离散混沌量子的蝙蝠算法。在该算法中,将连续数值转化为离散的二进制编码,对算法进行了离散化处理。该研究运用量子理论、引入量子比特编码和启发式量子变异,通过量子旋转门改变非最优个体的概率振幅来实现变异,解决了早熟和收敛速度慢的问题。在位置更新中,使用混沌映射替代固定参数,增强了灵活性和多样性,提高了全局寻优能力和求解效率。实验结果表明:在随机正则可满足性问题实例产生模型产生的不同规模算例上,所提算法的求解精度远远高于传统启发式算法;同时,与获奖的求解器相比,也具有一定的竞争力,验证了该算法的有效性。

优化算法中均值信息利用研究

研究了启发式优化算法中种群向均值点迁移的策略,并发现该策略对于提升算法性能具有重要影响,同时具备物理和数学含义.通过极大似然估计方法对基态波函数进行参数估计,建立了量子系统达到基态时最优解概率密度函数与种群均值点之间的联系,并从动力学的角度解释了种群均值点的物理意义.通过在几种经典优化算法上添加利用均值点位置信息的操作,在CEC2013测试集与摄像机布局优化的工程应用上进行对照实验,实验结果表明合理利用均值点位置信息可以有效提升算法的性能.

分段批发价下损失厌恶的报童最优订货问题

考虑损失厌恶报童的最优订货量问题.基于量大从优的经济现象,假设商品的批发价根据订购数量分为两段,订购量高于某一数量时价格降低.假设报童是损失厌恶的,其参照点为最大利润和最小利润的凸组合.证明了在最大化期望效用下存在唯一的最优订货量,发现厌恶损失的报童的订货量小于损失中性的报童的订货量.研究参数对最优订货量的一些影响,发现零售商的最优订货量随着批发价和损失厌恶程度的增大而减少,而当参考水平较小时损失厌恶型零售商的最优订货量比经典零售商大,参考水平较大时,损失厌恶型零售商的最优订货量比经典零售商小.通过数值验算给予说明.

THE EIGENVALUE PROBLEM FOR THE LAPLACIAN EQUATIONS

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.

Parametric Iteration Method for Solving Linear Optimal Control Problems

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.

A NEW NUMERICAL METHOD FOR TWO-PHASE IMMISCIBLE INCOMPRESSIBLE PROBLEM

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.

OPTIMAL CONTROL PROBLEM FOR PARABOLIC VARIATIONAL INEQUALITIES

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.

An Efficient Proximal Point Algorithm for Unweighted Max-Min Dispersion Problem

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.