Search

Arguments in argumentation systems cannot always be considered as standalone entities, requiring the consideration of the pieces of evidence they rely on. This evidence might have to be retrieved from external sources such as databases or the web, and each attempt to retrieve a piece of evidence comes with an associated cost. Moreover, a piece of evidence may be available in a given scenario but not in others, and this is not known beforehand. As a result, the collection of active arguments (whose entire set of evidence is available) that can be used by the argumentation machinery of the system may vary from one scenario to another. In this work, we consider an Abstract Argumentation Framework with Fallible Evidence that accounts for these issues, and propose a heuristic measure used as part of the acceptability calculus (specifically, for building pruned dialectical trees) with the aim of minimizing the evidence retrieval cost of the arguments involved in the reasoning process. We provide an algorithmic solution that is empirically tested against two baselines and formally show the correctness of our approach.

The ability to process environment maps across multiple sessions is critical for robots operating over extended periods of time. Specifically, it is desirable for autonomous agents to detect changes amongst maps of different sessions so as to gain a conflict-free understanding of the current environment. In this paper, we look into the problem of change detection based on a novel map representation, dubbed Plane Signed Distance Fields (PlaneSDF), where dense maps are represented as a collection of planes and their associated geometric components in SDF volumes. Given point clouds of the source and target scenes, we propose a three-step PlaneSDF-based change detection approach: (1) PlaneSDF volumes are instantiated within each scene and registered across scenes using plane poses; 2D height maps and object maps are extracted per volume via height projection and connected component analysis. (2) Height maps are compared and intersected with the object map to produce a 2D change location mask for changed object candidates in the source scene. (3) 3D geometric validation is performed using SDF-derived features per object candidate for change mask refinement. We evaluate our approach on both synthetic and real-world datasets and demonstrate its effectiveness via the task of changed object detection. Supplementary video: https://youtu.be/oh-MQPWTwZI, Comment: 8 pages, 7 figures, and 1 table. To be published in Robotics and Automation Letters and IROS 2022. Link to supplementary video added in the abstract: https://youtu.be/oh-MQPWTwZI

Comment mettre en partition une œuvre radiophonique ? Comment transcrire les événements sonores souvent hétéroclites qui la composent ? Comment les organiser sur une feuille de papier ? Si la notion de partition renvoie à l'idée de fixer la composition musicale par l'écrit, à l’aide de symboles codés, la partition d’une œuvre radiophonique se rapprocherait de celle d’une œuvre musicale sur support, où l’organisation des éléments sonores est rendue par transcriptions graphiques diverses. On peut, en effet, considérer que l’œuvre radiophonique est un cas particulier d’œuvre sur support, caractérisée par la prédominance du langage parlé et par la présence d’une dramaturgie propre, ce qui impose des formes de transcriptions spécifiques.J’aborde cette problématique, avec un double regard d’artiste sonore et auteure de pièces radiophoniques. Je prends comme étude de cas l'œuvre radiophonique de Luc Ferrari, L’escalier des aveugles, à partir de deux expériences de mise en partition : celle que j’ai entreprise moi-même, dans le cadre de mes recherches doctorales en musicologie et celle publiée par la Maison d’édition ONA en 2019. How do you create a score for a radio piece? How to transcribe the often heterogeneous sound events that compose it? How to organize them on a sheet of paper? If the notion of a score refers to the idea of maping the musical composition on paper using coded symbols, the score of a radio art piece would be close to that of an electronic composition, where the organization of the sound elements is rendered by various graphic transcriptions. One can, indeed, consider that the radio piece is a particular case of an electronic composition, with its own characteristics: the predominance of the spoken language and the strong presence of dramaturgy. Such characteristics will necessitate specific forms of transcriptions. I approach this issue with a double glance of a sound artist and an author of radio pieces. I take as a case study two different graphic scores created for Luc Ferrari's radio art piece, L'escalier des aveugles: the one I undertook myself within the framework of my doctoral research in musicology, and the second one published by the ONA publishing house in 2019. ¿Cómo escribir la partitura de una obra radiofónica ? ¿Cómo transcribir los acontecimientos sonoros, a menudo heterogéneos, que la componen ? ¿Y cómo organizarlos en una hoja de papel ? Si la noción de partitura remite a la idea de fijar la composición musical por escrito, con la ayuda de símbolos codificados, la partitura de una obra radiofónica se acerca más a la de una obra en soporte electroacústico : la cual se realiza mediante transcripciones gráficas. De hecho, podemos considerar que la obra radiofónica es un caso particular de obra en soporte electroacústico, caracterizada por el predominio del lenguaje hablado y por la presencia de una dramaturgia propia, lo cual impone formas específicas de transcripción.Abordo esta problemática desde mi doble condición de artista sonora y autora de piezas radiofónicas. Elijo como caso de estudio la obra radiofónica de Luc Ferrari, L'escalier des aveugles, basando el estudio en dos experiencias de verter la partitura en papel : la que emprendí yo misma, en el marco de mi investigación doctoral en musicología, y la publicada por la Maison ONA en 2019.

Background Male androgenic alopecia is a common cause of hair loss in both men and women. Although genetic and hormonal factors likely play a role, the etiology is mostly unknown. PCOS is a highly heritable disease with elevated prevalence of reproductive abnormalities in first-degree relatives (FDRs) of patients with PCOS, which may be due to an underlying genetic defect in steroidogenesis. A recent meta-analysis revealed that male FDRs of patients with PCOS had significantly increased levels of DHEAS compared with controls. We present a young adult male who developed acute hair loss with biochemical evidence of hyperandrogenism. Clinical Case A 21-year-old man presented for evaluation of hyperandrogenism after experiencing progressive loss of posterior patch of hair over 3 weeks. He also endorsed acne, intermittent headaches, striae, and difficulty losing weight for the past 2 years. He denied facial rounding, vision changes, and use of glucocorticoids or supplements. Physical examination was notable for height of 67 inches, BMI 30.5 mg/m 2, BP 120/78, recession of the frontotemporal and occipital hairline, sparse posterior scalp hair, bulbous nose, long philtrum, mild facial acne, 2, 3 toe syndactyly, and thin purple striae on bilateral flanks and axillae. Labs revealed elevated DHEAS 1065.7 mcg/dL (ref. 238.4-539.3) and normal 8 AM total testosterone of 382 ng/dL (240-871). Cosyntropin stimulation test revealed baseline cortisol level of 10.6 mcg/dL with ACTH of 22.2 pg/mL (5-46) and 60-minute cortisol level of 24.8 mcg/dL, 17-OH progesterone level 81 ng/dL (18-164), and 17-OH pregnenolone 1040 ng/dL (55-455). Workup for Cushing's revealed multiple normal midnight salivary cortisol levels and mild intermittent elevation of 24-hour urinary free cortisol levels. CT scan of the adrenals was negative for a mass. Exome sequencing revealed a heterozygous de novo pathogenic variant (c.1614_1615delTCinsAT: p. C538X) in the TRPS1 gene (NM_0141112.2). Family history was significant for a 20-year-old sister with PCOS and elevated DHEAS of 443 ug/dL (51-321). Mid-parental height was 69.6 inches. Conclusion Trichorhinophalangeal syndrome Type 1 (TRPS1) is a rare genetic disorder characterized by hair, craniofacial, and skeletal abnormalities such as androgenetic alopecia, bulbous nasal tip, and cone-shaped epiphyses. To our knowledge, the hair findings in TRPS are not associated with hyperandrogenism which prompted further investigation. Evaluation for endocrine causes of hyperandrogenism such as Cushing's disease, congenital adrenal hyperplasia, and adrenal tumor were negative. However, our patient's elevated DHEAS is likely due to male PCOS, as previously described in male FDRs of patients with PCOS. Thus, genetic susceptibility to PCOS and rare genetic syndromes should be considered in the differential diagnosis of young men with clinical and biochemical evidence of hyperandrogenism. Reference: Shan D et al. Reproductive Health in First-degree relatives of Patients with Polycystic Ovarian Syndrome: a Review and Meta-analysis. JCEM. 2022 Jan;107(1); 273-295. Presentation: No date and time listed

This work formalizes an informant-based structured argumentation approach in a multi-agent setting, where the knowledge base of an agent may include information provided by other agents, and each piece of knowledge comes attached with its informant. In that way, arguments are associated with the set of informants corresponding to the information they are built upon. Our approach proposes an informant-based notion of argument strength, where the strength of an argument is determined by the credibility of its informant agents. Moreover, we consider that the strength of an argument is not absolute, but it is relative to the resolution of the conflicts the argument is involved in. In other words, the strength of an argument may vary from one context to another, as it will be determined by comparison to its attacking arguments (respectively, the arguments it attacks). Finally, we equip agents with the means to express reasons for or against the consideration of any piece of information provided by a given informant agent. Consequently, we allow agents to argue about the arguments’ strength through the construction of arguments that challenge (respectively, defeat) or are in favour of their informant agents. Fil: Cohen, Andrea. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Ciencias e Ingeniería de la Computación. Universidad Nacional del Sur. Departamento de Ciencias e Ingeniería de la Computación. Instituto de Ciencias e Ingeniería de la Computación; Argentina Fil: Gottifredi, Sebastián. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Ciencias e Ingeniería de la Computación. Universidad Nacional del Sur. Departamento de Ciencias e Ingeniería de la Computación. Instituto de Ciencias e Ingeniería de la Computación; Argentina Fil: Tamargo, Luciano Héctor. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Ciencias e Ingeniería de la Computación. Universidad Nacional del Sur. Departamento de Ciencias e Ingeniería de la Computación. Instituto de Ciencias e Ingeniería de la Computación; Argentina Fil: García, Alejandro Javier. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Ciencias e Ingeniería de la Computación. Universidad Nacional del Sur. Departamento de Ciencias e Ingeniería de la Computación. Instituto de Ciencias e Ingeniería de la Computación; Argentina Fil: Simari, Guillermo Ricardo. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Ciencias e Ingeniería de la Computación. Universidad Nacional del Sur. Departamento de Ciencias e Ingeniería de la Computación. Instituto de Ciencias e Ingeniería de la Computación; Argentina

Over the last decade, several extensions of Dung's Abstract Argumentation Frameworks (AFs) have been introduced in the literature. Some of these extensions concern the nature of the attack relation, such as the consideration of recursive attacks, whereas others incorporate additional interactions, such as a support relation. Recently, the Attack–Support Argumentation Framework (ASAF) was proposed, which accounts for recursive attacks and supports, attacks to supports and supports to attacks, at any level, where the support relation is interpreted as necessity. Currently, to determine the accepted elements of an ASAF (which may be arguments, attacks, and supports) it is required to translate such an ASAF into a Dung's AF. In this work, we provide a formal characterization of acceptability semantics directly on the ASAF, without requiring such a translation. We prove that our characterization is sound since it satisfies different results from Dung's argumentation theory; moreover, we formally show that the approach proposed here for addressing acceptability is equivalent to the preexisting one, in which the ASAF was translated into an AF. Also, we formalize the relationship between the ASAF and other frameworks on which it is inspired: the Argumentation Framework with Recursive Attacks (AFRA) and the Argumentation Framework with Necessities (AFN). Fil: Gottifredi, Sebastián. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Ciencias e Ingeniería de la Computación. Universidad Nacional del Sur. Departamento de Ciencias e Ingeniería de la Computación. Instituto de Ciencias e Ingeniería de la Computación; Argentina Fil: Cohen, Andrea. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Ciencias e Ingeniería de la Computación. Universidad Nacional del Sur. Departamento de Ciencias e Ingeniería de la Computación. Instituto de Ciencias e Ingeniería de la Computación; Argentina Fil: García, Alejandro Javier. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Ciencias e Ingeniería de la Computación. Universidad Nacional del Sur. Departamento de Ciencias e Ingeniería de la Computación. Instituto de Ciencias e Ingeniería de la Computación; Argentina Fil: Simari, Guillermo Ricardo. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Ciencias e Ingeniería de la Computación. Universidad Nacional del Sur. Departamento de Ciencias e Ingeniería de la Computación. Instituto de Ciencias e Ingeniería de la Computación; Argentina

Argumentation is an important approach in artificial intelligence and multiagent systems, providing a basis for single agents to make rational decisions, and for groups of agents to reach agreements, as well as a mechanism to underpin a wide range of agent interactions. In such work, a crucial role is played by the notion of \emph{attack} between arguments, and the notion of attack is well-studied. There is, for example, a range of different approaches to identifying which of a set of arguments should be accepted given the attacks between them. Less well studied is the notion of support between arguments, yet the idea that one argument may support another is very intuitive and seems particularly relevant in the area of decision-making where decision options may have multiple arguments for and against them. In the last decade, the study of support in argumentation has regained attention among researchers, but most approaches address support in the context of abstract argumentation where the elements from which arguments are composed are ignored. In contrast, this paper studies the notion of support between arguments in the context of structured argumentation systems where the elements from which arguments are composed play a crucial role. Different forms of support are presented, each of which takes into account the structure of arguments; and the relationships between these forms of support are studied. Then, the paper investigates whether there is a correspondence between the structured and abstract forms of support, and determines whether the abstract formalisms may be instantiated using concrete forms of support in terms of structured arguments. The conclusion is that support in structured argumentation does not mesh well with support in abstract argumentation, and this suggests that more work is required to develop forms of support in abstract argumentation that model what happens in structured argumentation.

Arguments in argumentation-based query-answering systems can be associated with a set of evidence required for their construction. This evidence might have to be retrieved from external sources such as databases or the web, and each attempt of retrieving a piece of evidence comes with an associated cost. Moreover, a piece of evidence may be available at one moment but not at others, and this is not known beforehand. As a result, the set of active arguments (whose entire set of evidence is available) that can be used by the argumentation machinery of the system may vary from one scenario to another. In this work we propose a heuristic pruning technique for building dialectical trees in argumentation-based query-answering systems, with the aim of minimizing the cost of retrieving the pieces of evidence associated with the arguments that need to be accounted for in the reasoning process.

Background Improving care for high-cost patients requires a better understanding of their characteristics and the ability to effectively target interventions. We developed an actionable taxonomy with clinically meaningful patient categories for high-cost Medicare patients—those in the top 10% of total costs. Methods A cross-sectional study of a Medicare fee-for-service (FFS) patient cohort in the New York metropolitan area. We merged claims and neighborhood social determinants of health data to map patients into actionable categories. Results Among 428,024 Medicare FFS patients, we mapped the 42,802 high-cost patients into ten overlapping categories, including: multiple chronic conditions, seriously ill, frail, serious mental illness, single condition with high pharmacy cost, chronic pain, end-stage renal disease (ESRD), single high-cost chronic condition, opioid use disorder, and socially vulnerable. Most high-cost patients had multiple chronic conditions (97.4%), followed by serious illness (53.7%) and frailty (48.9%). Patients with ESRD, who were seriously ill, and who were frail were more likely to be high-cost compared to patients in other categories. 72.7% of high-cost patients fell into multiple categories. Conclusions High-cost patients are highly heterogeneous. A patient taxonomy incorporating medical, behavioral, and social characteristics may help providers better understand their characteristics and health needs. Implications Mapping high-cost patients into clinically meaningful and actionable categories that incorporate medical, behavioral, and social factors could help health systems target interventions. Integrated approaches, including medical care, behavioral health, and social services may be needed to effectively and efficiently care for high-cost patients.

In this paper, we aim to solve the pose estimation problem of calibrated pinhole and generalized cameras w.r.t. a Structure-from-Motion (SfM) model by leveraging both 2D-3D correspondences as well as 2D-2D correspondences. Traditional approaches either focus on the use of 2D-3D matches, known as structure-based pose estimation or solely on 2D-2D matches (structure-less pose estimation). Absolute pose approaches are limited in their performance by the quality of the 3D point triangulations as well as the completeness of the 3D model. Relative pose approaches, on the other hand, while being more accurate, also tend to be far more computationally costly and often return dozens of possible solutions. This work aims to bridge the gap between these two paradigms. We propose a new RANSAC-based approach that automatically chooses the best type of solver to use at each iteration in a data-driven way. The solvers chosen by our RANSAC can range from pure structure-based or structure-less solvers, to any possible combination of hybrid solvers (i.e. using both types of matches) in between. A number of these new hybrid minimal solvers are also presented in this paper. Both synthetic and real data experiments show our approach to be as accurate as structure-less approaches, while staying close to the efficiency of structure-based methods.

Many systems of structured argumentation explicitly require that the facts and rules that make up the argument for a conclusion be the minimal set required to derive the conclusion. \(\textsc {aspic}^{\mathsf {+}}\) does not place such a requirement on arguments, instead requiring that every rule and fact that are part of an argument be used in its construction. Thus \(\textsc {aspic}^{\mathsf {+}}\) arguments are minimal in the sense that removing any element of the argument would lead to a structure that is not an argument. In this paper we discuss these two types of minimality and show how the first kind of minimality can, if desired, be recovered in \(\textsc {aspic}^{\mathsf {+}}\).