1,720,996 research outputs found
Using Planning Domain Features to Facilitate Knowledge Engineering
No full textThis paper defines a number of features that can be used to characterize planning domains, namely domain types, relation fluency, inconsistent effects and reversible actions. These features can be used to provide additional information about the operators defined in a STRIPS-like planning domain. Furthermore, the values of these features may be extracted automatically; efficient algorithms for this are described in this paper. Alternatively, where these values are specified explicitly by the domain author, the extracted values can be used to validate the consistency of the domain, thus supporting the knowledge engineering process. This approach has been evaluated using a number of planning domains, mostly drawn from the international planning competition. The results show that the features provide useful information, and can highlight problems with the manual formalization of planning domains
Going Beyond Counting First Authors in Author Co-citation Analysis
Get PDFThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Using Planning Domain Features to Facilitate Knowledge Engineering
Get PDFThis paper defines a number of features that can be used to characterize planning domains, namely domain types, relation fluency, inconsistent effects and reversible actions. These features can be used to provide additional information about the operators defined in a STRIPS-like planning domain. Furthermore, the values of these features may be extracted automatically; efficient algorithms for this are described in this paper. Alternatively, where these values are specified explicitly by the domain author, the extracted values can be used to validate the consistency of the domain, thus supporting the knowledge engineering process. This approach has been evaluated using a number of planning domains, mostly drawn from the international planning competition. The results show that the features provide useful information, and can highlight problems with the manual formalization of planning domains
Automated planning for cloud service configurations
Get PDFThe declarative approach has been widely accepted as an appropriate way to manage configurations of large scale systems – the administrators describe the specification
of the “desired” configuration state of the system, and the tool computes and executes
the necessary actions to bring the system from its current state into this desired state. However, none of state-of-the-art declarative configuration tools make any guarantees
about the order of the changes across the system involved in implementing configuration changes.
This thesis presents a technique that addresses this issue – it uses the SFP language to allow administrators to specify the desired configuration state and the global
constraints of the system, compiles the specified reconfiguration task into a classical
planning problem, and then uses an automated planning technique to automatically
generate the workflow. The execution of the workflow can bring the system into the desired state, while preserving the global constraints during configuration changes.
This thesis also presents an alternative approach to deploy the configurations – the
workflow is used to automatically choreograph a set of reactive agents which are capable to autonomously reconfigure a computing system into a specified desired state.
The agent interactions are guaranteed to be deadlock/livelock free, can preserve pre-specified global constraints during their execution, and automatically maintain the desired state once it has been achieved (self-healing).
We present the formal semantics of SFP language, the technique that compiles SFP
reconfiguration tasks to classical planning problems, and the algorithms for automatic
generation and execution of the reactive agent models. In addition, we also present
the formal semantics of core subset of SmartFrog language which is the foundation
of SFP. Moreover, we present a domain-independent technique to compile a planning problem with extended goals into a classical planning problem.
As a proof of concept, the techniques have been implemented in a prototype configuration tool called Nuri, which has been used to configure typical use-cases in cloud
environment. The experiment results demonstrate that the Nuri is capable of planning and deploying the configurations in a reasonable time, with guaranteed constraints on
the system throughout reconfiguration process
Using Static Graphs in Planning Domains to Understand Domain Dynamics
Get PDFThis paper describes a method for analyzing STRIPS-like planning domains by identifying static graphs that are implicit in the set of operators defining a planning domain. A graph consisting of nodes and possibly directed edges is acommon way to construct representations for many problems, including computational problems and problems of reasoning about action. Furthermore, there may be objects or properties related to the nodes of such a graph that may be modified by the operators in ways restricted by the graph. The formaldefinition of shift operators over static graphs as a domain feature is the main contribution of this paper. Such an analysis could be used for verification and validation of the planning domain when it is presented to the domain author who may or may not agree with the result of the analysis. The method described relies on domain features that can also be extracted automatically, and it works on domains rather than problems, which means the result is problem-independent. However, if problems are given further analysis may be perfomed. The method has been evaluated using a small number of planning domains drawn from the international planning competition
Using Static Graphs in Planning Domains to Understand Domain Dynamics
Get PDFThis paper describes a method for analyzing STRIPS-like planning domains by identifying static graphs that are implicit in the set of operators defining a planning domain. A graph consisting of nodes and possibly directed edges is acommon way to construct representations for many problems, including computational problems and problems of reasoning about action. Furthermore, there may be objects or properties related to the nodes of such a graph that may be modified by the operators in ways restricted by the graph. The formaldefinition of shift operators over static graphs as a domain feature is the main contribution of this paper. Such an analysis could be used for verification and validation of the planning domain when it is presented to the domain author who may or may not agree with the result of the analysis. The method described relies on domain features that can also be extracted automatically, and it works on domains rather than problems, which means the result is problem-independent. However, if problems are given further analysis may be perfomed. The method has been evaluated using a small number of planning domains drawn from the international planning competition
Variations on the Author
Get PDF“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
Appropriate Similarity Measures for Author Cocitation Analysis
Get PDFWe provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
Dispelling the Myths Behind First-author Citation Counts
Get PDFWe conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued
use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation
counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more
sophisticated methods
- …
