Multilayer Cognitive Maps in the Resolution of Problems using the FCM Designer Tool

Cognitive maps are a tool to represent knowledge from a qualitative perspective, allowing to create models of complex systems where an exact mathematical model cannot be used because of the complexity of the system. In the literature, several tools have been proposed to develop cognitive maps and fuzzy cognitive maps (FCMs); one of them is FCM Designer. This paper designs and implements an extension to the FCM Designer tool that allows creating multilayer FCM. With this extension, it is possible to have several FCMs for the same problem, where each one expresses a different level of knowledge of the system under study, but interlinked. Thus, one can have a first level of detailed abstraction of the system with specific information and then more general levels. In addition, we can have different levels where the variables of one level depend on those of another level. That is, the multilayer approach enriches the modeled systems with flow of information between layers, to derive information about the concepts involved in layers from the concepts in other layers. In our multilayer approach, the relationship between the cognitive maps in different layers can be carried out in various ways: with fuzzy rules, connections with weights and with mathematical equations. This work presents the design and the implementation of the extension of the FCM Designer tool, and several test cases in different domains: a FCM to analyze emergent properties of Wikipedia a FCM for medical analysis for diagnosis, and another like recommender system.     

Adaptive Robot Biped Locomotion with Dynamic Motion Primitives and Coupled Phase Oscillators

In order to properly function in real-world environments, the gait of a humanoid robot must be able to adapt to new situations as well as to deal with unexpected perturbations. A promising research direction is the modular generation of movements that results from the combination of a set of basic primitives. In this paper, we present a robot control framework that provides adaptive biped locomotion by combining the modulation of dynamic movement primitives (DMPs) with rhythm and phase coordination. The first objective is to explore the use of rhythmic movement primitives for generating biped locomotion from human demonstrations. The second objective is to evaluate how the proposed framework can be used to generalize and adapt the human demonstrations by adjusting a few open control parameters of the learned model. This paper contributes with a particular view into the problem of adaptive locomotion by addressing three aspects that, in the specific context of biped robots, have not received much attention. First, the demonstrations examples are extracted from human gaits in which the human stance foot will be constrained to remain in flat contact with the ground, forcing the “bent-knee” at all times in contrast with the typical straight-legged style. Second, this paper addresses the important concept of generalization from a single demonstration. Third, a clear departure is assumed from the classical control that forces the robot’s motion to follow a predefined fixed timing into a more event-based controller. The applicability of the proposed control architecture is demonstrated by numerical simulations, focusing on the adaptation of the robot’s gait pattern to irregularities on the ground surface, stepping over obstacles and, at the same time, on the tolerance to external disturbances.     

Online classifier adaptation for cost-sensitive learning

In this paper, we propose the problem of online cost-sensitive classifier adaptation and the first algorithm to solve it. We assume that we have a base classifier for a cost-sensitive classification problem, but it is trained with respect to a cost setting different to the desired one. Moreover, we also have some training data samples streaming to the algorithm one by one. The problem is to adapt the given base classifier to the desired cost setting using the steaming training samples online. To solve this problem, we propose to learn a new classifier by adding an adaptation function to the base classifier, and update the adaptation function parameter according to the streaming data samples. Given an input data sample and the cost of misclassifying it, we update the adaptation function parameter by minimizing cost-weighted hinge loss and respecting previous learned parameter simultaneously. The proposed algorithm is compared to both online and off-line cost-sensitive algorithms on two cost-sensitive classification problems, and the experiments show that it not only outperforms them on classification performances, but also requires significantly less running time.

     

Bayesian networks for enhancement of requirements engineering: a literature review

Requirements analysis is the software engineering stage that is closest to the users’ world. It also involves tasks that are knowledge intensive. Thus, the use of Bayesian networks (BNs) to model this knowledge would be a valuable aid. These probabilistic models could manage the imprecision and ambiguities usually present in requirements engineering (RE). In this work, we conduct a literature review focusing on where and how BNs are applied on subareas of RE in order to identify which gaps remain uncovered and which methods might engineers employ to incorporate this intelligent technique into their own requirements processes. The scarcity of identified studies (there are only 20) suggests that not all RE areas have been properly investigated in the literature. The evidence available for adopting BNs into RE is sufficiently mature yet the methods applied are not easily translatable to other topics. Nonetheless, there are enough studies supporting the applicability of synergistic cooperation between RE and BNs. This work provides a background for understanding the current state of research encompassing RE and BNs. Functional, non-functional and -ilities requirements artifacts are enhanced by the use of BNs. These models were obtained by interacting with experts or by learning from databases. The most common criticism from the point of view of BN experts is that the models lack validation, whereas requirements engineers point to the lack of a clear application method for BNs and the lack of tools for incorporating them as built-in help functions.     

Two-space variability compensation technique for speaker verification in short length and reverberant environments

The performance of state-of-the-art speaker verification in uncontrolled environment is affected by different variabilities. Short duration variability is very common in these scenarios and causes the speaker verification performance to decrease quickly while the duration of verification utterances decreases. Linear discriminant analysis (LDA) is the most common session variability compensation algorithm, nevertheless it presents some shortcomings when trained with insufficient data. In this paper we introduce two methods for session variability compensation to deal with short-length utterances on i-vector space. The first method proposes to incorporate the short duration variability information in the within-class variance estimation process. The second proposes to compensate the session and short duration variabilities in two different spaces with LDA algorithms (2S-LDA). First, we analyzed the behavior of the within and between class scatters in the first proposed method. Then, both proposed methods are evaluated on telephone session from NIST SRE-08 for different duration of the evaluation utterances: full (average 2.5 min), 20, 15, 10 and 5 s. The 2S-LDA method obtains good results on different short-length utterances conditions in the evaluations, with a EER relative average improvement of 1.58%, compared to the best baseline (WCCN[LDA]). Finally, we applied the 2S-LDA method in speaker verification under reverberant environment, using different reverberant conditions from Reverb challenge 2013, obtaining an improvement of 8.96 and 23% under matched and mismatched reverberant conditions, respectively.     

Mobile crowdsensing with mobile agents

We introduce mobile agents for mobile crowdsensing. Crowdsensing campaigns are designed through different roles that are implemented as mobile agents. The role-based tasks of mobile agents include collecting data, analyzing data and sharing data in the campaign. Mobile agents execute and control the campaign autonomously as a multi-agent system and migrate in the opportunistic network of participants’ devices. Mobile agents take into account the available resources in the devices and match participants’ privacy requirements to the campaign requirements. Sharing of task results in real-time facilitates cooperation towards the campaign goal while maintaining a selected global measure, such as energy efficiency. We discuss current challenges in crowdsensing and propose mobile agent based solutions for campaign execution and monitoring, addressing data collection and participant-related issues. We present a software framework for mobile agents-based crowdsensing that is seamlessly integrated into the Web. A set of simulations are conducted to compare mobile agent-based campaigns with existing crowdsensing approaches. We implemented and evaluated a small-scale real-world mobile agent based campaign for pedestrian flock detection. The simulation and evaluation results show that mobile agent based campaigns produce comparable results with less energy consumption when the number of agents is relatively small and enables in-network data processing with sharing of data and task results with insignificant overhead.     

Local closed world reasoning with description logics under the well-founded semantics

An important question for the upcoming Semantic Web is how to best combine open world ontology languages, such as the OWL-based ones, with closed world rule-based languages. One of the most mature proposals for this combination is known as hybrid MKNF knowledge bases (Motik and Rosati, 2010 [52]), and it is based on an adaptation of the Stable Model Semantics to knowledge bases consisting of ontology axioms and rules. In this paper we propose a well-founded semantics for nondisjunctive hybrid MKNF knowledge bases that promises to provide better efficiency of reasoning, and that is compatible with both the OWL-based semantics and the traditional Well-Founded Semantics for logic programs. Moreover, our proposal allows for the detection of inconsistencies, possibly occurring in tightly integrated ontology axioms and rules, with only little additional effort. We also identify tractable fragments of the resulting language.     

Proof Pearl: a Formal Proof of Higman��s Lemma in ACL2

Higman??s lemma is an important result in infinitary combinatorics, which has been formalized in several theorem provers. In this paper we present a formalization and proof of Higman??s Lemma in the ACL2 theorem prover. Our formalization is based on a proof by Murthy and Russell, where the key termination argument is justified by the multiset relation induced by a well-founded relation. To our knowledge, this is the first mechanization of this proof.