Taxonomic evidence applying intelligent information algorithm and the principle of maximum entropy: the case of asteroids families

The Numeric Taxonomy aims to group operational taxonomic units in clusters (OTUs or taxons or taxa), using the denominated structure analysis by means of numeric methods. These clusters that constitute families are the purpose of this series of projects and they emerge of the structural analysis, of their phenotypical characteristic, exhibiting the relationships in terms of grades of similarity of the OTUs, employing tools such as i) the Euclidean distance and ii) nearest neighbor techniques. Thus taxonomic evidence is gathered so as to quantify the similarity for each pair of OTUs (pair-group method) obtained from the basic data matrix and in this way the significant concept of spectrum of the OTUs is introduced, being based the same one on the state of their characters. A new taxonomic criterion is thereby formulated and a new approach to Computational Taxonomy is presented, that has been already employed with reference to Data Mining, when apply of Machine Learning techniques, in particular to the C4.5 algorithms, created by Quinlan, the degree of efficiency achieved by the TDIDT family´s algorithms when are generating valid models of the data in classification problems with the Gain of Entropy through Maximum Entropy Principle.Fil: Perichinsky, Gregorio. Universidad de Buenos Aires. Facultad de Ingeniería; ArgentinaFil: Jiménez Rey, Elizabeth Miriam. Universidad de Buenos Aires. Facultad de Ingeniería; ArgentinaFil: Grossi, María Delia. Universidad de Buenos Aires. Facultad de Ingeniería; ArgentinaFil: Vallejos, Félix Anibal. Universidad de Buenos Aires. Facultad de Ingeniería; Argentina. Universidad Nacional de La Plata. Facultad de Ciencias Astronómicas y Geofísicas; ArgentinaFil: Servetto, Arturo Carlos. Universidad de Buenos Aires. Facultad de Ingeniería; ArgentinaFil: Orellana, Rosa Beatriz. Universidad Nacional de La Plata. Facultad de Ciencias Astronómicas y Geofísicas; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Plastino, Ángel Luis. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Departamento de Física; Argentin

Decoding the "Free/Open Source(F/OSS) Software Puzzle" a survey of theoretical and empirical contributions

F/OSS software has been described by many as a puzzle. In the past five years, it has stimulated the curiosity of scholars in a variety of fields, including economics, law, psychology, anthropology and computer science, so that the number of contributions on the subject has increased exponentially. The purpose of this paper is to provide a sufficiently comprehensive account of these contributions in order to draw some general conclusions on the state of our understanding of the phenomenon and identify directions for future research. The exercise suggests that what is puzzling about F/OSS is not so much the fact that people freely contribute to a good they make available to all, but rather the complexity of its institutional structure and its ability to organizationally evolve over time.F/OSS software, Innovation, Incentives, Governance, Intellectual Property Rights

Model Checking Quantum Continuous-Time Markov Chains

Verifying quantum systems has attracted a lot of interests in the last decades. In this paper, we initialise the model checking of quantum continuous-time Markov chain (QCTMC). As a real-time system, we specify the temporal properties on QCTMC by signal temporal logic (STL). To effectively check the atomic propositions in STL, we develop a state-of-the-art real root isolation algorithm under Schanuel's conjecture; further, we check the general STL formula by interval operations with a bottom-up fashion, whose query complexity turns out to be linear in the size of the input formula by calling the real root isolation algorithm. A running example of an open quantum walk is provided to demonstrate our method

Graduate Catalog, 2002-2003

https://scholar.valpo.edu/gradcatalogs/1029/thumbnail.jp

Taxonomic evidence applying intelligent information algorithm and the principle of maximum entropy: the case of asteroids families

The Numeric Taxonomy aims to group operational taxonomic units in clusters (OTUs or taxons or taxa), using the denominated structure analysis by means of numeric methods. These clusters that constitute families are the purpose of this series of projects and they emerge of the structural analysis, of their phenotypical characteristic, exhibiting the relationships in terms of grades of similarity of the OTUs, employing tools such as i) the Euclidean distance and ii) nearest neighbor techniques. Thus taxonomic evidence is gathered so as to quantify the similarity for each pair of OTUs (pair-group method) obtained from the basic data matrix and in this way the significant concept of spectrum of the OTUs is introduced, being based the same one on the state of their characters. A new taxonomic criterion is thereby formulated and a new approach to Computational Taxonomy is presented, that has been already employed with reference to Data Mining, when apply of Machine Learning techniques, in particular to the C4.5 algorithms, created by Quinlan, the degree of efficiency achieved by the TDIDT family´s algorithms when are generating valid models of the data in classification problems with the Gain of Entropy through Maximum Entropy Principle.Facultad de Ciencias Astronómicas y GeofísicasFacultad de Ciencias Exacta

Taxonomic evidence applying intelligent information algorithm and the principle of maximum entropy: the case of asteroids families

The Numeric Taxonomy aims to group operational taxonomic units in clusters (OTUs or taxons or taxa), using the denominated structure analysis by means of numeric methods. These clusters that constitute families are the purpose of this series of projects and they emerge of the structural analysis, of their phenotypical characteristic, exhibiting the relationships in terms of grades of similarity of the OTUs, employing tools such as i) the Euclidean distance and ii) nearest neighbor techniques. Thus taxonomic evidence is gathered so as to quantify the similarity for each pair of OTUs (pair-group method) obtained from the basic data matrix and in this way the significant concept of spectrum of the OTUs is introduced, being based the same one on the state of their characters. A new taxonomic criterion is thereby formulated and a new approach to Computational Taxonomy is presented, that has been already employed with reference to Data Mining, when apply of Machine Learning techniques, in particular to the C4.5 algorithms, created by Quinlan, the degree of efficiency achieved by the TDIDT family´s algorithms when are generating valid models of the data in classification problems with the Gain of Entropy through Maximum Entropy Principle.Facultad de Ciencias Astronómicas y GeofísicasFacultad de Ciencias Exacta

Psychological factors associated with response to treatment in rheumatoid arthritis

This paper presents a comprehensive review of research relating psychological domains with response to therapy in patients with rheumatoid arthritis. A holistic approach to the disease was adopted by incorporating not only disease activity but also dimensions of the impact of disease on patients' lives. Psychological distress, including depression and anxiety, is common among patients with rheumatoid arthritis and has a significant negative impact on response to therapy and on patients' abilities to cope with chronic illness. Evidence regarding the influence of positive psychological dimensions such as acceptance, optimism, and adaptive coping strategies is scarce. The mechanisms involved in these interactions are incompletely understood, although changes in neuro-endocrine-immune pathways, which are common to depression and rheumatoid arthritis, seem to play a central role. Indirect psychological influences on therapeutic efficacy and long-term effectiveness include a myriad of factors such as adherence, placebo effects, cognition, coping strategies, and family and social support. Data suggest that recognition and appropriate management of psychological distress may improve response to treatment and significantly reduce disease burden

An examination of ice hockey players\u27 imagery use and perspective

Mental imagery is an effective performance enhancing technique for athletes (Driskell, Copper, & Moran, 1994), and therefore has been the topic of extensive investigation in the sport psychology domain. To date, the few studies that have examined imagery across position of play have neglected to examine goaltenders as a distinct position from defense. As such, comparisons can only be made between forwards and defense. The purpose the present study was to examine differences in imagery use and perspective in male ice hockey players across playing position. Participants included 258 competitive male ice hockey players (\u27n\u27 = 122 forwards, \u27n\u27 = 68 defense, \u27n\u27 = 68 goaltenders), between the ages of 16 and 29(19.12+-1.96). Two separate MANOVAs revealed significant overall effects for both imagery frequency and perspective across playing position. Univariate follow-up ANOVAs found that goaltenders use significantly more MG-M and CS imagery than forwards and defense. Furthermore, it was found that goaltenders have significantly more clear and vivid images from an internal perspective and an external perspective than forwards, but not defense. Findings from the present study provide sport psychologists with research that can guide the development of more individually tailored imagery interventions for ice hockey athletes

Evaluation of Dataflow Programming Models for Electronic Structure Theory

International audienceDataflow programming models have been growing in popularity as a means to deliver a good balance between performance and portability in the post-petascale era. In this paper we evaluate different dataflow programming models for electronic structure methods and compare them in terms of programmability, resource utilization, and scalability. In particular, we evaluate two programming paradigms for expressing scientific applications in a dataflow form: (1) explicit dataflow, where the dataflow is specified explicitly by the developer, and (2) implicit dataflow, where a task scheduling runtime derives the dataflow using per-task data-access information embedded in a serial program. We discuss our findings and present a thorough experimental analysis using methods from the NWCHEM quantum chemistry application as our case study, and OPENMP, STARPU and PARSEC as the task-based runtimes that enable the different forms of dataflow execution. Furthermore, we derive an abstract model to explore the limits of the different dataflow programming paradigms