What determines the bulge to disk ratio of galaxies

Galaxies having the same luminosity may have very different bulge to disk ratios, while the mean bulge to disk ratio slowly increases with total luminosity (Schecter and Dressler, 1987, Sandage et al., 1985). Such a behavior is expected if ellipticals and the spheroidal components of disk galaxies are produced by secondary accretion of galaxies by larger galaxies. This is illustrated using a simple toy model of the evolution of the mass function of galaxies due to galaxy mergers

On resolving conflicts between arguments

Argument systems are based on the idea that one can construct arguments for propositions; i.e., structured reasons justifying the belief in a proposition. Using defeasible rules, arguments need not be valid in all circumstances, therefore, it might be possible to construct an argument for a proposition as well as its negation. When arguments support conflicting propositions, one of the arguments must be defeated, which raises the question of \emph{which (sub-)arguments can be subject to defeat}? In legal argumentation, meta-rules determine the valid arguments by considering the last defeasible rule of each argument involved in a conflict. Since it is easier to evaluate arguments using their last rules, \emph{can a conflict be resolved by considering only the last defeasible rules of the arguments involved}? We propose a new argument system where, instead of deriving a defeat relation between arguments, \emph{undercutting-arguments} for the defeat of defeasible rules are constructed. This system allows us, (\textit{i}) to resolve conflicts (a generalization of rebutting arguments) using only the last rules of the arguments for inconsistencies, (\textit{ii}) to determine a set of valid (undefeated) arguments in linear time using an algorithm based on a JTMS, (\textit{iii}) to establish a relation with Default Logic, and (\textit{iv}) to prove closure properties such as \emph{cumulativity}. We also propose an extension of the argument system that enables \emph{reasoning by cases}

Efficient Model Based Diagnosis

In this paper an efficient model based diagnostic process is described for systems whose components possess a causal relation between their inputs and their outputs. In this diagnostic process, firstly, a set of focuses on likely broken components is determined. Secondly, for each focus the most informative probing point within the focus can be determined. Both these steps of the diagnostic process have a worst case time complexity of ${\cal O}(n^2)$ where $n$ is the number of components. If the connectivity of the components is low, however, the diagnostic process shows a linear time complexity. It is also shown how the diagnostic process described can be applied in dynamic systems and systems containing loops. When diagnosing dynamic systems it is possible to choose between detecting intermitting faults or to improve the diagnostic precision by assuming non-intermittency

Models and Methods for Plan Diagnosis

Abstract. We consider a model-based diagnosis approach to the diagnosis of plans. Here, a plan executed by some agent(s) is considered as a system to be diagnosed. We introduce a simple formal model of plans and plan execution where it is assumed that the execution of a plan can be monitored by making partial observations of plan states. These observations of plan states are used to compare them with predicted states based on (normal) plan execution. Deviations between observed and predicted states can be explained by qualifying some plan steps in the plan as behaving abnormally. A diagnosis is a subset of plan steps qualified as abnormal that can be used to restore the compatibility between the predicted and the observed partial state. In contrast to model-based diagnosis, where minimum and minimal diagnoses are preferred, we argue that in plan-based diagnosis maximum informative diagnoses should be preferred. These are diagnoses that make the strongest predictions with respect to partial states to be observed in the future. We show that in contrast to minimum diagnoses, finding a (minimal) maximum informative diagnosis can be achieved in polynomial time. Finally, we show how we can deal with diagnosis of a plan if an arbitrary sequence of partial observations is given.

Explainable robotics applied to bipedal walking gait development

Explainability is becoming an important topic in artificial intelligence (AI). A well explainable system can increase the trust in the application of that system. The same holds for robotics where the walking gait controller can be some AI system. We will show that a simple and explainable controller that enables an energy efficient walking gait and can handle uneven terrains, can be developed by a well structured design method. The main part of the controller consist of three simple neural networks with 4, 6 and 8 neurons. So, although creating a stable and energy efficient walking gait is a complex problem, it can be generated without some deep neural network or some complex mathematical model

Multi Agent Diagnosis: an analysis

The paper analyzes the use of a Multi Agent System for Model Based Diagnosis. In a large dynamical system, it is often infeasible or even impossible to maintain a model of the whole system. Instead, several incomplete models of the system have to be used to detect possible faults. These models may also be physically be distributed. A Multi Agent System of diagnostic agents may offer solutions for establishing a global diagnosis. If we use a separate agent for each incomplete model of the system, establishing a global diagnosis becomes a problem cooperation and negotiation between the diagnostic agents. This raises the question whether `a set of diagnostic agents, each having an incomplete model of the system, can (efficiently) determine the same global diagnosis as an ideal single diagnostic agent having the combined knowledge of the diagnostic agents?''economics of technology ;