357 research outputs found
ICARUS: Intelligent content-based retrieval of 3D scene
No full textWe present a tool for the analysis, classification and content-based retrieval of 3D scene. The system ICARUS analyzes files in VRML format, searching for the presence of complex 3D-objects and relative geometrical relationships between them. Descriptions of the virtual scenes are classified in a Terminological System, and reasoning mechanisms are used for querying
Accuracy of Author Names in Bibliographic Data Sources: An Italian Case Study
No full textWe investigate the accuracy of how author names are reported in bibliographic records excerpted from four prominent sources: WoS, Scopus, PubMed, and CrossRef. We take as a case study 44,549 publications stored in the internal database of Sapienza University of Rome, one of the largest universities in Europe. While our results indicate generally good accuracy for all bibliographic data sources considered, we highlight a number of issues that undermine the accuracy for certain classes of author names, including compound names and names with diacritics, which are common features to Italian and other Western languages
Multi-Neighborhood Simulated Annealing for the Capacitated Dispersion Problem
No full textWe propose a novel Multi-Neighborhood Simulated Annealing approach to address the Capacitated Dispersion Problem. It makes use of three neighborhoods, adapted from similar proposals from the literature. Our search method, properly engineered and tuned, is able to consistently improve the state-of-the-art methods on almost all instances from public benchmarks. In addition, we highlight the limitations of the current datasets and we propose a new, more challenging one, obtained by sampling data from real maps and population density. Finally, we propose two compact mathematical models that obtain good bounds on small/medium size instances as well as, with long runs, on large ones
Negation And Minimality In Disjunctive Databases
No full textthis paper we restrict our attention to propositional languages. To this end we assume that programs are built using letters from an alphabet L. The extension of our analysis to first-order programs is straightforward. A disjunctive database (DDB) is a set of rules r of the for
Photodisintegration of Light Nuclei with the Ladon Photon Beam
No full textIn this paper we present a short review of experimental data on the photodisintegration of deuteron and 4He obtained with the monochromatic LADON photon beam
Organizzazione del 13th International Conference on Principles of Knowledge Representation and Reasoning (KR 2012)
No full textKnowledge Representation and Reasoning (KR&R) is a well-established and vibrant field of research. KR&R techniques are key drivers of innovation in computer science, and they have led to significant advances in practical applications in a wide range of areas from Artificial Intelligence to Software Engineering. The underlying approach of explicitly representing knowledge in a tangible form, suitable for processing by dedicated reasoning engines, is a fundamental component of many modern intelligent systems. Foundational and applied research in KR&R contributes to the principles of artificial intelligence. It also contributes to the foundations of longstanding fields including automated planning, databases, and software engineering. In recent years KR&R has also derived challenges from new and emerging fields including the semantic web, computational biology, and the development of software agents.
The KR conference series is a leading forum for timely in-depth presentation of progress in the theory and principles underlying the representation and computational management of knowledge. KR 2012 will be a forum for the exchange and discussion of new ideas, issues, and results on the principles and practice of KR&R
A Compact Model for the Home Healthcare Routing and Scheduling Problem
No full textHome healthcare has become more and more central in the last decades, due to the advantages it can bring to both healthcare institutions and patients. Planning activities in this context, however, presents significant challenges related to route planning and mutual synchronization of caregivers. In this paper we propose a new compact model for the combined optimization of scheduling (of the activities) and routing (of the caregivers) characterized by fewer variables and constraints when compared with the models previously available in the literature. The new model is solved by a constraint programming solver and compared experimentally with the exact and metaheuristic approaches available in the literature on the common datasets adopted by the community. The results show that the new model provides improved lower bounds for the vast majority of the instances, while producing at the same time high quality heuristic solutions, comparable to those of tailored metaheuristics, for small/medium size instances
The Ladon facility at Frascati
No full textThe new developments of the ladon photon beam and of the experimental apparatus for photonuclear experiments are presented, together with some preliminary results of the measurements of the deuteron photodisintegration asymmetry at E_gamma = 19.8, 29.0 and 38.6 MeV
Integrating Constraints into an Imperative Programming Language
No full textWe investigate here how to integrate constraints directly into the imperative programming paradigm, as "first class citizens" and not by means of an external library. To this end we provide a systematic account of the issues that arise. In particular, we discuss the role of the logical and customary variables, the interaction between the constraint store and the program, and the need for lists. These considerations lead to an extension of an imperative programming language that supports declarative programming, called Alma-0, introduced in Apt, Brunekreef, Partington & Schaerf (1998). Constraint programs written in this style are simple to understand and analyze
On bibliometrics in academic promotions: a case study in computer science and engineering in Italy
No full textDue to its quantitative nature, bibliometrics is becoming increasingly popular among policy makers for academic hiring and career promotions. In this article, we quantitatively assess the impact that the granularity level in the classification of scientific areas would entail on research evaluation based on bibliometric indicators. We use as a case study the Italian national habilitation system (ASN), which classifies faculty members according to their academic discipline and relies on journal counts, citations, and h-indices as a basis for promoting tenure track researchers to associate professors and associate to full professors. The assessment checks whether the individual indicators of a researcher are above a certain threshold, e.g., the median over the population of researchers working in the same discipline.
Our investigation focuses on two related, rather broad disciplines: computer science and computer engineering. We show that the ASN practice of using the same thresholds for all members of a scientific discipline can favor certain sub-communities that are characterized by higher bibliometric indicators, and disfavor others. We report evidence that up to 30% of Italian faculty members of certain sub-communities would see their indicators drop below the threshold, thus becoming not eligible for promotion, if the ASN were conducted on a more accurate, fine-grained classification. Conversely, in the same scenario, up to 11% of faculty members, in different sub-communities, would see their indicators rise above the threshold, granting them eligibility. Our data set includes 1,685 authors, 89,185 distinct publications, and 262,286 author- publication pairs
- …
