We introduce BANpipe - a logic-based scripting language designed to model complex compositions of time consuming analyses. Its declarative semantics is described together with alternative operational semantics facilit...
详细信息
We investigate the properties of Inclusion logic, that is, First Order logic with Team Semantics extended with inclusion dependencies. We prove that Inclusion logic is equivalent to Greatest Fixed Point logic, and we ...
详细信息
In this paper, we study what is a semantic code clone pair in a logic program. Unlike our earlier work, that focused on simple syntactic equivalence for defining clones, we propose a more general approximation based o...
详细信息
Virtual networks are considered today as a critical IT resource that connects distributed and virtualised Cloud services and components like servers, applications and storage. Network virtualisation allows traffic iso...
详细信息
ISBN:
(纸本)9780769550022
Virtual networks are considered today as a critical IT resource that connects distributed and virtualised Cloud services and components like servers, applications and storage. Network virtualisation allows traffic isolation between different tenants, security, efficient migration of virtual machines and reduced cloud service management complexity. Adaptive allocation and provisioning is required to maintain virtual networks in cloud environments to deal with user mobility, resource re-optimisation and to respond to anomalies, faults and evolving demands. This paper proposes an exact adaptive fault-tolerant embedding algorithm to cope with node and link failures in cloud networks while reducing the cost for cloud providers. The embedding problem is formulated and solved as a mixed integer program. Performance of the proposed algorithm is reported.
The effect of workers' learning curve on production rate in manual assembly lines is significant when producing relatively small batches of different products. This research analyzes this effect and suggests apply...
详细信息
The effect of workers' learning curve on production rate in manual assembly lines is significant when producing relatively small batches of different products. This research analyzes this effect and suggests applying work-sharing among the workers in such an environment to improve the time to complete the batch, namely, the makespan. Work-sharing refers to a situation where adjacent workers help each other in order to reduce idle times caused by blockage and starvation. We present mixed-integer linear-programing (MILP) formulations, which provide optimal work-sharing mechanism for minimizing the makespan. The effect of work-sharing and existence of buffers on the makespan is examined and compared to a baseline situation, with no work-sharing and buffers. A numerical study is conducted and the results along with some operational insights are presented.
The proceedings contain 23 papers. The topics discussed include: on the semantics of scenario-based specification based on timed computational tree logic;rule-based behaviour engineering: integrated, intuitive formal ...
ISBN:
(纸本)9780769549958
The proceedings contain 23 papers. The topics discussed include: on the semantics of scenario-based specification based on timed computational tree logic;rule-based behaviour engineering: integrated, intuitive formal rule modelling;decomposing distributed software architectures for the determination and incorporation of security and other non-functional requirements;evaluating the application and understanding of elementary programming patterns;a change impact size estimation approach during the software development;integrating issue tracking systems with community-based question and answering websites;on the application of inequality indices in comparative software analysis;significant requirements engineering practices for software development outsourcing;development of robust traceability benchmarks;from toy to tool: extending tag clouds for software and information visualisation;and an empirical experiment on analogy-based software cost estimation with CUDA framework.
This paper discusses the advantages of using the ACT-R cognitive architecture over the Prolog programming language for the research and development of a large-scale, functional, cognitively motivated model of natural ...
详细信息
ISBN:
(纸本)9781627484701
This paper discusses the advantages of using the ACT-R cognitive architecture over the Prolog programming language for the research and development of a large-scale, functional, cognitively motivated model of natural language analysis. Although Prolog was developed for Natural Language Processing (NLP), it lacks any probabilistic mechanisms for dealing with ambiguity and relies on failure detection and algorithmic backtracking to explore alternative analyses. These mechanisms are problematic for handling ill-formed or unexpected inputs, often resulting in an exploration of the entire search space, which becomes intractable as the complexity and variability of the allowed inputs and corresponding grammar grow. By comparison, ACT-R provides context dependent and probabilistic mechanisms which allow the model to incrementally pursue the best analysis. When combined with a nonmonotonic context accommodation mechanism that supports modest adjustment of the evolving analysis to handle cases where the locally best analysis is not globally preferred, the result is an efficient pseudo-deterministic mechanism that obviates the need for failure detection and backtracking, aligns with our basic understanding of Human Language Processing (HLP) and is scalable to broad coverage. The successful transition of the natural language analysis model from Prolog to ACT-R suggests that a cognitively motivated approach to natural language analysis may also be suitable for achieving afunctional capability.
In this paper, we present a rewriting based monitoring algorithm for time propositional temporal logic (TPTL), which is a classic time extension of linear temporal logic (LTL). TPTL has been shown to be more expressiv...
详细信息
In this paper, we present a rewriting based monitoring algorithm for time propositional temporal logic (TPTL), which is a classic time extension of linear temporal logic (LTL). TPTL has been shown to be more expressive than other real-time extensions of LTL, e.g., metric temporal logic (MTL). We first describe the syntax and semantics of TPTL on finite time-traces. Using Maude, which is an executable environment for various logics, we give rewriting clauses to check whether a finite time-trace satisfies a TPTL formula. We use our algorithm to test a concrete example from the European Train Control System (ETCS), and evaluate it on several benchmarks. The results show the feasibility of our approach.
Scaling high-quality, cost-efficient query evaluation is critical to search system performance. Although partial indexes reduce query processing times, result quality may be jeopardized due to exclusion of relevant no...
详细信息
ISBN:
(纸本)9781450322638
Scaling high-quality, cost-efficient query evaluation is critical to search system performance. Although partial indexes reduce query processing times, result quality may be jeopardized due to exclusion of relevant non-local documents. Selectively forwarding queries between geographically distributed search sites may help. The basic idea of query forwarding is that after a local site receives a query, it determines non-local sites to forward the query to and returns an aggregation of the local and non-local results. Nevertheless, electricity costs remain substantial sources of operating expenses. We present a hybrid rank-energy query forwarding model termed "RESQ." The novel contribution is to simultaneously consider both ranking quality and spatially-temporally varying energy prices when making forwarding decisions. Experiments with a large-scale query log, publicly-available electricity price data, and real search site locations demonstrate that query forwarding under RESQ achieves the result scalability of partial indexes with the cost savings of energy-aware approaches (e.g., an 87% ranking guarantee with a 46% savings in energy costs).
This paper describes the implementation of a tableau-based decision procedure for the Alternating-time Temporal logic proposed by Goranko and Shkatov in 2009, as well as a set of representative formulas used for testing.
ISBN:
(数字)9783642405372
ISBN:
(纸本)9783642405365
This paper describes the implementation of a tableau-based decision procedure for the Alternating-time Temporal logic proposed by Goranko and Shkatov in 2009, as well as a set of representative formulas used for testing.
暂无评论