LIVIVO - Search results -

Search results

Result 1 - 10 of total 15

Search options

Article ; Online: Feasibility and Acceptability of Smart Augmented Reality Assisting Patients with Medication Pillbox Self-Management.

Blusi, Madeleine / Nieves, Juan Carlos

Studies in health technology and informatics

2019 Volume 264, Page(s) 521–525

Abstract: Complex prescribed medicine regimens require extensive self-management. Handling multiple pills can be confusing; using a pillbox organiser is a common strategy. A smart Medication Coach Intelligent Agent (MCIA) can support patients in handling medicine. ...

Abstract	Complex prescribed medicine regimens require extensive self-management. Handling multiple pills can be confusing; using a pillbox organiser is a common strategy. A smart Medication Coach Intelligent Agent (MCIA) can support patients in handling medicine. The aim of this research was to evaluate the feasibility and acceptability of the MCIA. A prototype was tested with 15 participants, age 17-76, filled a pillbox according to prescription assisted by the MCIA implemented in a Microsoft HoloLens. A quantitative method using questionnaires was applied. Results showed that using the MCIA implemented in an AR-headset, to assist people with prescribed polypharmacy regimen in filling a pillbox, was feasible and acceptable. There was a difference related to age regarding people's willingness to use an AR-headset for medication self-management. People older than 65 felt less comfortable using the technology and were also more hesitant to use the technology than those under 65.
MeSH term(s)	Feasibility Studies ; Humans ; Polypharmacy ; Self-Management ; Surveys and Questionnaires
Language	English
Publishing date	2019-08-22
Publishing country	Netherlands
Document type	Journal Article
ISSN	1879-8365
ISSN (online)	1879-8365
DOI	10.3233/SHTI190277
Database	MEDical Literature Analysis and Retrieval System OnLINE

Order via subito

This service is chargeable due to the Delivery terms set by subito. Orders including an article and supplementary material will be classified as separate orders. In these cases, fees will be demanded for each order.

Inter-library loan at ZB MED

Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

Article ; Online: A Semantic and Knowledge-Based Approach for Handover Management.

Vivas, Fulvio Yesid / Caicedo, Oscar Mauricio / Nieves, Juan Carlos

Sensors (Basel, Switzerland)

2021 Volume 21, Issue 12

Abstract: Handover Management (HM) is pivotal for providing service continuity, enormous reliability and extreme-low latency, and meeting sky-high data rates, in wireless communications. Current HM approaches based on a single criterion may lead to unnecessary and ...

Abstract	Handover Management (HM) is pivotal for providing service continuity, enormous reliability and extreme-low latency, and meeting sky-high data rates, in wireless communications. Current HM approaches based on a single criterion may lead to unnecessary and frequent handovers due to a partial network view that is constrained to information about link quality. In turn, HM approaches based on multicriteria may present a failure of handovers and wrong network selection, decreasing the throughput and increasing the packet loss in the network. This paper proposes SIM-Know, an approach for improving HM. SIM-Know improves HM by including a Semantic Information Model (SIM) that enables context-aware and multicriteria handover decisions. SIM-Know also introduces a SIM-based distributed Knowledge Base Profile (KBP) that provides local and global intelligence to make contextual and proactive handover decisions. We evaluated SIM-Know in an emulated wireless network. When the end-user device moves at low and moderate speeds, the results show that our approach outperforms the Signal Strong First (SSF, single criterion approach) and behaves similarly to the Analytic Hierarchy Process combined with the Technique for Order Preferences by Similarity to the Ideal Solution (AHP-TOPSIS, multicriteria approach) regarding the number of handovers and the number of throughput drops. SSF outperforms SIM-Know and AHP-TOPSIS regarding the handover latency metric because SSF runs a straightforward process for making handover decisions. At high speeds, SIM-Know outperforms SSF and AHP-TOPSIS regarding the number of handovers and the number of throughput drops and, further, improves the throughput, delay, jitter, and packet loss in the network. Considering the obtained results, we conclude that SIM-Know is a practical and attractive solution for cognitive HM.
MeSH term(s)	Communication ; Computer Communication Networks ; Knowledge Bases ; Reproducibility of Results ; Semantics
Language	English
Publishing date	2021-06-21
Publishing country	Switzerland
Document type	Journal Article
ZDB-ID	2052857-7
ISSN	1424-8220 ; 1424-8220
ISSN (online)	1424-8220
ISSN	1424-8220
DOI	10.3390/s21124234
Database	MEDical Literature Analysis and Retrieval System OnLINE

Order via subito

Book ; Online: Map Equation Centrality

Blöcker, Christopher / Nieves, Juan Carlos / Rosvall, Martin

Community-aware Centrality based on the Map Equation

2022

Abstract: To measure node importance, network scientists employ centrality scores that typically take a microscopic or macroscopic perspective, relying on node features or global network structure. However, traditional centrality measures such as degree centrality, ...

Abstract	To measure node importance, network scientists employ centrality scores that typically take a microscopic or macroscopic perspective, relying on node features or global network structure. However, traditional centrality measures such as degree centrality, betweenness centrality, or PageRank neglect the community structure found in real-world networks. To study node importance based on network flows from a mesoscopic perspective, we analytically derive a community-aware information-theoretic centrality score based on network flow and the coding principles behind the map equation: map equation centrality. Map equation centrality measures how much further we can compress the network's modular description by not coding for random walker transitions to the respective node, using an adapted coding scheme and determining node importance from a network flow-based point of view. The information-theoretic centrality measure can be determined from a node's local network context alone because changes to the coding scheme only affect other nodes in the same module. Map equation centrality is agnostic to the chosen network flow model and allows researchers to select the model that best reflects the dynamics of the process under study. Applied to synthetic networks, we highlight how our approach enables a more fine-grained differentiation between nodes than node-local or network-global measures. Predicting influential nodes for two different dynamical processes on real-world networks with traditional and other community-aware centrality measures, we find that activating nodes based on map equation centrality scores tends to create the largest cascades in a linear threshold model.
Keywords	Computer Science - Social and Information Networks ; Physics - Physics and Society
Subject code	006
Publishing date	2022-01-29
Publishing country	us
Document type	Book ; Online
Database	BASE - Bielefeld Academic Search Engine (life sciences selection)

Full text online

Full text

Inter-library loan at ZB MED

Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

Book ; Online: JS-son -- A Lean, Extensible JavaScript Agent Programming Library

Kampik, Timotheus / Nieves, Juan Carlos

2020

Abstract: A multitude of agent-oriented software engineering frameworks exist, most of which are developed by the academic multi-agent systems community. However, these frameworks often impose programming paradigms on their users that are challenging to learn for ... ...

Abstract	A multitude of agent-oriented software engineering frameworks exist, most of which are developed by the academic multi-agent systems community. However, these frameworks often impose programming paradigms on their users that are challenging to learn for engineers who are used to modern high-level programming languages such as JavaScript and Python. To show how the adoption of agent-oriented programming by the software engineering mainstream can be facilitated, we provide a lean JavaScript library prototype for implementing reasoning-loop agents. The library focuses on core agent programming concepts and refrains from imposing further restrictions on the programming approach. To illustrate its usefulness, we show how the library can be applied to multi-agent systems simulations on the web, deployed to cloud-hosted function-as-a-service environments, and embedded in Python-based data science tools. Comment: Accepted for the post-proceedings of EMAS 2019
Keywords	Computer Science - Multiagent Systems ; Computer Science - Artificial Intelligence ; Computer Science - Software Engineering
Subject code	006
Publishing date	2020-03-10
Publishing country	us
Document type	Book ; Online
Database	BASE - Bielefeld Academic Search Engine (life sciences selection)

Full text online

Full text

Inter-library loan at ZB MED

Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

Book ; Online: Interrogating the Black Box

Tubella, Andrea Aler / Theodorou, Andreas / Nieves, Juan Carlos

Transparency through Information-Seeking Dialogues

2021

Abstract: This paper is preoccupied with the following question: given a (possibly opaque) learning system, how can we understand whether its behaviour adheres to governance constraints? The answer can be quite simple: we just need to "ask" the system about it. We ...

Abstract	This paper is preoccupied with the following question: given a (possibly opaque) learning system, how can we understand whether its behaviour adheres to governance constraints? The answer can be quite simple: we just need to "ask" the system about it. We propose to construct an investigator agent to query a learning agent -- the suspect agent -- to investigate its adherence to a given ethical policy in the context of an information-seeking dialogue, modeled in formal argumentation settings. This formal dialogue framework is the main contribution of this paper. Through it, we break down compliance checking mechanisms into three modular components, each of which can be tailored to various needs in a vast amount of ways: an investigator agent, a suspect agent, and an acceptance protocol determining whether the responses of the suspect agent comply with the policy. This acceptance protocol presents a fundamentally different approach to aggregation: rather than using quantitative methods to deal with the non-determinism of a learning system, we leverage the use of argumentation semantics to investigate the notion of properties holding consistently. Overall, we argue that the introduced formal dialogue framework opens many avenues both in the area of compliance checking and in the analysis of properties of opaque systems. Comment: Accepted at AAMAS 2021
Keywords	Computer Science - Artificial Intelligence ; Computer Science - Computers and Society
Subject code	006
Publishing date	2021-02-09
Publishing country	us
Document type	Book ; Online
Database	BASE - Bielefeld Academic Search Engine (life sciences selection)

Full text online

Full text

Inter-library loan at ZB MED

Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

Book ; Online: Abstract Argumentation and the Rational Man

Kampik, Timotheus / Nieves, Juan Carlos

2019

Abstract: Abstract argumentation has emerged as a method for non-monotonic reasoning that has gained popularity in the symbolic artificial intelligence community. In the literature, the different approaches to abstract argumentation that were refined over the ... ...

Abstract	Abstract argumentation has emerged as a method for non-monotonic reasoning that has gained popularity in the symbolic artificial intelligence community. In the literature, the different approaches to abstract argumentation that were refined over the years are typically evaluated from a formal logics perspective; an analysis that is based on models of economically rational decision-making does not exist. In this paper, we work towards addressing this issue by analyzing abstract argumentation from the perspective of the rational man paradigm in microeconomic theory. To assess under which conditions abstract argumentation-based decision-making can be considered economically rational, we derive reference independence as a non-monotonic inference property from a formal model of economic rationality and create a new argumentation principle that ensures compliance with this property. We then compare the reference independence principle with other reasoning principles, in particular with cautious monotony and rational monotony. We show that the argumentation semantics as proposed in Dung's seminal paper, as well as other semantics we evaluate -- with the exception of naive semantics and the SCC-recursive CF2 semantics -- violate the reference independence principle. Consequently, we investigate how structural properties of argumentation frameworks impact the reference independence principle, and identify cyclic expansions (both even and odd cycles) as the root of the problem. Finally, we put reference independence into the context of preference-based argumentation and show that for this argumentation variant, which explicitly models preferences, reference independence cannot be ensured in a straight-forward manner. Comment: To appear in the Journal of Logic and Computation
Keywords	Computer Science - Artificial Intelligence ; Computer Science - Logic in Computer Science
Subject code	100
Publishing date	2019-11-29
Publishing country	us
Document type	Book ; Online
Database	BASE - Bielefeld Academic Search Engine (life sciences selection)

Full text online

Full text

Inter-library loan at ZB MED

Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

Book ; Online: An Imprecise Probability Approach for Abstract Argumentation based on Credal Sets

Morveli-Espinoza, Mariela / Nieves, Juan Carlos / Tacla, Cesar Augusto

2020

Abstract: Some abstract argumentation approaches consider that arguments have a degree of uncertainty, which impacts on the degree of uncertainty of the extensions obtained from a abstract argumentation framework (AAF) under a semantics. In these approaches, both ... ...

Abstract	Some abstract argumentation approaches consider that arguments have a degree of uncertainty, which impacts on the degree of uncertainty of the extensions obtained from a abstract argumentation framework (AAF) under a semantics. In these approaches, both the uncertainty of the arguments and of the extensions are modeled by means of precise probability values. However, in many real life situations the exact probabilities values are unknown and sometimes there is a need for aggregating the probability values of different sources. In this paper, we tackle the problem of calculating the degree of uncertainty of the extensions considering that the probability values of the arguments are imprecise. We use credal sets to model the uncertainty values of arguments and from these credal sets, we calculate the lower and upper bounds of the extensions. We study some properties of the suggested approach and illustrate it with an scenario of decision making. Comment: 8 pages, 2 figures, Accepted in The 15th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2019)
Keywords	Computer Science - Artificial Intelligence
Subject code	310
Publishing date	2020-09-15
Publishing country	us
Document type	Book ; Online
Database	BASE - Bielefeld Academic Search Engine (life sciences selection)

Full text online

Full text

Inter-library loan at ZB MED

Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

Book ; Online: An Argumentation-based Approach for Identifying and Dealing with Incompatibilities among Procedural Goals

Morveli-Espinoza, Mariela / Nieves, Juan Carlos / Possebom, Ayslan / Puyol-Gruart, Josep / Tacla, Cesar Augusto

2020

Abstract: During the first step of practical reasoning, i.e. deliberation, an intelligent agent generates a set of pursuable goals and then selects which of them he commits to achieve. An intelligent agent may in general generate multiple pursuable goals, which ... ...

Abstract	During the first step of practical reasoning, i.e. deliberation, an intelligent agent generates a set of pursuable goals and then selects which of them he commits to achieve. An intelligent agent may in general generate multiple pursuable goals, which may be incompatible among them. In this paper, we focus on the definition, identification and resolution of these incompatibilities. The suggested approach considers the three forms of incompatibility introduced by Castelfranchi and Paglieri, namely the terminal incompatibility, the instrumental or resources incompatibility and the superfluity. We characterise computationally these forms of incompatibility by means of arguments that represent the plans that allow an agent to achieve his goals. Thus, the incompatibility among goals is defined based on the conflicts among their plans, which are represented by means of attacks in an argumentation framework. We also work on the problem of goals selection; we propose to use abstract argumentation theory to deal with this problem, i.e. by applying argumentation semantics. We use a modified version of the "cleaner world" scenario in order to illustrate the performance of our proposal. Comment: 31 pages, 9 figures, Accepted in the International Journal of Approximate Reasoning (2019)
Keywords	Computer Science - Artificial Intelligence
Subject code	004
Publishing date	2020-09-10
Publishing country	us
Document type	Book ; Online
Database	BASE - Bielefeld Academic Search Engine (life sciences selection)

Full text online

Full text

Inter-library loan at ZB MED

Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

Book ; Online: ACROCPoLis

Tubella, Andrea Aler / Mollo, Dimitri Coelho / Lindström, Adam Dahlgren / Devinney, Hannah / Dignum, Virginia / Ericson, Petter / Jonsson, Anna / Kampik, Timotheus / Lenaerts, Tom / Mendez, Julian Alfredo / Nieves, Juan Carlos

A Descriptive Framework for Making Sense of Fairness

2023

Abstract: Fairness is central to the ethical and responsible development and use of AI systems, with a large number of frameworks and formal notions of algorithmic fairness being available. However, many of the fairness solutions proposed revolve around technical ... ...

Abstract	Fairness is central to the ethical and responsible development and use of AI systems, with a large number of frameworks and formal notions of algorithmic fairness being available. However, many of the fairness solutions proposed revolve around technical considerations and not the needs of and consequences for the most impacted communities. We therefore want to take the focus away from definitions and allow for the inclusion of societal and relational aspects to represent how the effects of AI systems impact and are experienced by individuals and social groups. In this paper, we do this by means of proposing the ACROCPoLis framework to represent allocation processes with a modeling emphasis on fairness aspects. The framework provides a shared vocabulary in which the factors relevant to fairness assessments for different situations and procedures are made explicit, as well as their interrelationships. This enables us to compare analogous situations, to highlight the differences in dissimilar situations, and to capture differing interpretations of the same situation by different stakeholders. Comment: To appear in the proceedings of ACM FAccT 2023
Keywords	Computer Science - Computers and Society ; Computer Science - Artificial Intelligence
Publishing date	2023-04-19
Publishing country	us
Document type	Book ; Online
Database	BASE - Bielefeld Academic Search Engine (life sciences selection)

Full text online

Full text

Inter-library loan at ZB MED

Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

Book ; Online: Semantics for Possibilistic Disjunctive Programs

Nieves, Juan Carlos / Osorio, Mauricio / Cortés, Ulises

2011

Abstract: In this paper, a possibilistic disjunctive logic programming approach for modeling uncertain, incomplete and inconsistent information is defined. This approach introduces the use of possibilistic disjunctive clauses which are able to capture incomplete ... ...

Abstract	In this paper, a possibilistic disjunctive logic programming approach for modeling uncertain, incomplete and inconsistent information is defined. This approach introduces the use of possibilistic disjunctive clauses which are able to capture incomplete information and incomplete states of a knowledge base at the same time. By considering a possibilistic logic program as a possibilistic logic theory, a construction of a possibilistic logic programming semantic based on answer sets and the proof theory of possibilistic logic is defined. It shows that this possibilistic semantics for disjunctive logic programs can be characterized by a fixed-point operator. It is also shown that the suggested possibilistic semantics can be computed by a resolution algorithm and the consideration of optimal refutations from a possibilistic logic theory. In order to manage inconsistent possibilistic logic programs, a preference criterion between inconsistent possibilistic models is defined; in addition, the approach of cuts for restoring consistency of an inconsistent possibilistic knowledge base is adopted. The approach is illustrated in a medical scenario. Comment: 37 pages, 5 figures. To appear in Theory and Practice of Logic Programming (TPLP)
Keywords	Computer Science - Artificial Intelligence ; Computer Science - Logic in Computer Science ; Computer Science - Programming Languages ; 68T37 Reasoning under uncertainty
Subject code	160
Publishing date	2011-06-03
Publishing country	us
Document type	Book ; Online
Database	BASE - Bielefeld Academic Search Engine (life sciences selection)

Full text online

Full text

Inter-library loan at ZB MED

Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

To top

More links

Kategorien

Order via subito

Inter-library loan at ZB MED

More links

Kategorien

Order via subito

Full text online

More links

Kategorien

Inter-library loan at ZB MED

Full text online

More links

Kategorien

Inter-library loan at ZB MED

Full text online

More links

Kategorien

Inter-library loan at ZB MED

Full text online

More links

Kategorien

Inter-library loan at ZB MED

Full text online

More links

Kategorien

Inter-library loan at ZB MED

Full text online

More links

Kategorien

Inter-library loan at ZB MED

Full text online

More links

Kategorien

Inter-library loan at ZB MED

Full text online

More links

Kategorien

Inter-library loan at ZB MED