Search results for "reasoning"
showing 10 items of 371 documents
An Ambient Intelligence System for Assisted Living
2017
Nowadays, the population's average age is constantly increasing, and thus the need for specialized home assistance is on the rise. Smart homes especially tailored to meet elderly and disabled people's needs can help them maintaining their autonomy, whilst ensuring their safety and well-being. This paper proposes a complete context-aware system for Ambient Assisted Living (AAL), which infers user's actions and context, analyzing its past and current behavior to detect anomalies and prevent possible emergencies. The proposed system exploits Dynamic Bayesian Networks to merge raw data coming from heterogeneous sensors and infer user's behavior and health conditions. A rule-based reasoner is ab…
An unsupervised quantitative method to analyse students' answering strategies to a questionnaire
2018
Questionnaires are perhaps the most widely used instruments to assess conceptual learning in physics as well as in mathematics. In the field of physics and mathematics education research it is surely interesting to be able to use a questionnaire as a “diagnostic instrument,” i.e., to know details about relationships among student answers to the different questions. In recent years several research works focused on this goal by using different quantitative methodologies, like Factor, Model and Cluster Analyses. However, very few research works deepened the theoretical aspects of the Cluster Analysis. In this contribution, we discuss two Cluster Analysis methods with respect to this issue. By…
Diagrammatic approach to quantum search
2014
We introduce a simple diagrammatic approach for estimating how a randomly walking quantum particle searches on a graph in continuous-time, which involves sketching small weighted graphs with self-loops and considering degenerate perturbation theory's effects on them. Using this method, we give the first example of degenerate perturbation theory solving search on a graph whose evolution occurs in a subspace whose dimension grows with $N$.
Scalar diagrammatic rules for Born amplitudes in QCD
2005
We show that all Born amplitudes in QCD can be calculated from scalar propagators and a set of three- and four-valent vertices. In particular, our approach includes amplitudes with any number of quark pairs. The quarks may be massless or massive. The proof of the formalism is given entirely within quantum field theory.
Enterprise Knowledge Modeling, UML vs Ontology: Formal Evaluation
2019
International audience; Everyday activities in enterprises rely heavily on the experts' know-how. Due to experts departure, the loss of expertise and knowledge is a reoccurring problem in these enterprises. Recently, in order to capture experts knowledge into intelligent systems, formal knowledge representation methods, such as ontologies, are being studied and have caught up with non-formal or semi-formal representation, such as UML. The similarities and differences between UML class diagram and computational ontology have for long raised questions about the possibility of synthesizing them in a common representation (usually an ontology). Indeed, the problem of migrating knowledge encoded…
Missing Curious Fraction Problems
2018
In this paper we present a study of one of the best-known types of descriptive word fraction problems. These problems have disappeared from today’s textbooks but are hugely important for developing arithmetic thinking. The aim of this paper is to examine the historical solution methods for these problems and discuss the analytical readings suggested by the authors. On the basis of this analysis we have conducted a preliminary study of the performance of 35 Spanish students who are highly trained in mathematics. Our results show that these students have a preference for algebraic reasoning, are reluctant to use arithmetic methods, and have reading comprehension difficulties that are reflecte…
A Dynamic Reasoning Architecture for Computer Network Management
2005
This paper focuses on improving network management and monitoring by the adoption of Artificial Intelli- gence techniques. In order to allow automated reasoning on networking concepts, we defined an accurate ontologi- cal model capable of describing as better as possible the networking domain. The thorough representation of the do- main knowledge is used by a Logical Reasoner, which is an expert system capable of performing high-level manage- ment tasks.
The Development of Conditional Reasoning: A Mental Model Account
2002
Abstract Conditional (if-then) reasoning is one of the key components of logical reasoning. Studies examining the way that children and adults make conditional inferences have shown that while there are some clear developmental patterns, there is also a great deal of variation in performance due to factors such as problem content. Such variation is difficult to model without an explicit process model. In the following we propose a variant of mental model theory (Johnson-Laird, 1983) that can explain much of the empirical data. This model suggests that the development of conditional reasoning can be explained, at least partly, by such factors as the capacity of working memory, the range of k…
An Integrated Architecture for Surveillance and Monitoring in an Archaeological Site
2005
This paper describes an on-going work aimed at designing and deploying a system for the surveillance and monitoring of an archaeological site, namely the "Valley of the Temples" in Agrigento, Italy. Given the relevance of the site from an artistical and historical point of view, it is important to protect the monuments from malicious or simply incautious behavior; however, the vastity of the area to be monitored and the vague definition of its boundaries make it unpractical to provide extensive coverage through traditional sensors or similar devices. We describe the design of an architecture for the surveillance of the site and for the monitoring of the visitors' behavior consisting in an i…
Co-learning of recursive languages from positive data
1996
The present paper deals with the co-learnability of enumerable families L of uniformly recursive languages from positive data. This refers to the following scenario. A family L of target languages as well as hypothesis space for it are specified. The co-learner is fed eventually all positive examples of an unknown target language L chosen from L. The target language L is successfully co-learned iff the co-learner can definitely delete all but one possible hypotheses, and the remaining one has to correctly describe L.