Related papers: Unification of Fusion Theories
The combination of theory and simulation is necessary in the investigation of properties of complex systems where each method alone cannot do the task properly. Theory needs simulation to test ideas and to check approximations. Simulation…
Model merging has emerged as a promising technique for combining multiple fine-tuned models into a single multitask model without retraining. However, the factors that determine whether merging will succeed or fail remain poorly understood.…
As two fundamental problems, graph cuts and graph matching have been investigated over decades, resulting in vast literature in these two topics respectively. However the way of jointly applying and solving graph cuts and matching receives…
The unity of mathematics has its power to compactify experiences in a form capable of being transferred and modified or adapted to new mathematical situations. Yet, we believe that the phrase "Unity of Mathematics" expresses a dream, an…
We present an algorithm for solving the unification problem in the description logic $\mathcal{FL}_\bot$. This logic extends $\mathcal{FL}_0$ with the bottom constructor, and thus supports conjunction, value restrictions, top and bottom…
Recent theoretical results confirm that quantum theory provides the possibility of new ways of performing efficient calculations. The most striking example is the factoring problem. It has recently been shown that computers that exploit…
We present modeling for conceptual combinations which uses the mathematical formalism of quantum theory. Our model faithfully describes a large amount of experimental data collected by different scholars on concept conjunctions and…
This paper presents two new promising rules of combination for the fusion of uncertain and potentially highly conflicting sources of evidences in the framework of the theory of belief functions in order to palliate the well-know limitations…
One well studied way to construct quasicrystalline tilings is via inflate-and-subdivide (a.k.a. substitution) rules. These produce self-similar tilings--the Penrose, octagonal, and pinwheel tilings are famous examples. We present a…
Higher-order unification has been shown to be undecidable. Miller discovered the pattern fragment and subsequently showed that higher-order pattern unification is decidable and has most general unifiers. We extend the algorithm to…
Mathematical models are an important tool for neuroscientists. During the last thirty years many papers have appeared on single neuron description and specifically on stochastic Integrate and Fire models. Analytical results have been proved…
We propose a novel methodology to define assistance systems that rely on information fusion to combine different sources of information while providing an assessment. The main contribution of this paper is providing a general framework for…
While its applications have made quantum theory arguably the most successful theory in physics, its interpretation continues to be the subject of lively debate within the community of physicists and philosophers concerned with conceptual…
We define a `tree of fusion systems' and give a sufficient condition for its completion to be saturated. We apply this result to enlarge an arbitrary fusion system by extending the automorphism groups of certain of its subgroups.
We formulate a general prescription for spurion analysis in particle-physics models whose selection rules are described by commutative non-invertible fusion algebras. The construction applies to fusion algebras containing non-invertible…
Machine learning is poised as a very powerful tool that can drastically improve our ability to carry out scientific research. However, many issues need to be addressed before this becomes a reality. This article focuses on one particular…
This short paper introduces two new fusion rules for combining quantitative basic belief assignments. These rules although very simple have not been proposed in literature so far and could serve as useful alternatives because of their low…
Excellent computer simulations are done for a purpose. The most valid purposes are to explore uncharted territory, to resolve a well-posed scientific or technical question, or to make a design choice. Stand-alone modeling can serve the…
Algorithms for continuous optimization problems have a rich history of design and innovation over the past several decades, in which mathematical analysis of their convergence and complexity properties plays a central role. Besides their…
This paper addresses the problem of merging uncertain information in the framework of possibilistic logic. It presents several syntactic combination rules to merge possibilistic knowledge bases, provided by different sources, into a new…