1,905 research outputs found

    Interaction Grammars

    Get PDF
    Interaction Grammar (IG) is a grammatical formalism based on the notion of polarity. Polarities express the resource sensitivity of natural languages by modelling the distinction between saturated and unsaturated syntactic structures. Syntactic composition is represented as a chemical reaction guided by the saturation of polarities. It is expressed in a model-theoretic framework where grammars are constraint systems using the notion of tree description and parsing appears as a process of building tree description models satisfying criteria of saturation and minimality

    The Apriori Stochastic Dependency Detection (ASDD) algorithm for learning Stochastic logic rules

    Get PDF
    Apriori Stochastic Dependency Detection (ASDD) is an algorithm for fast induction of stochastic logic rules from a database of observations made by an agent situated in an environment. ASDD is based on features of the Apriori algorithm for mining association rules in large databases of sales transactions [1] and the MSDD algorithm for discovering stochastic dependencies in multiple streams of data [15]. Once these rules have been acquired the Precedence algorithm assigns operator precedence when two or more rules matching the input data are applicable to the same output variable. These algorithms currently learn propositional rules, with future extensions aimed towards learning first-order models. We show that stochastic rules produced by this algorithm are capable of reproducing an accurate world model in a simple predator-prey environment

    A comparison of Jiazzi and AspectJ for feature-wise decomposition

    Get PDF
    technical reportFeature-wise decomposition is an important approach to building configurable software systems. Although there has been research on the usefulness of particular tools for featurewise decomposition, there are not many informative comparisons on the relative effectiveness of different tools. In this paper, we compare AspectJ and Jiazzi, which are two different systems for decomposing Java programs. AspectJ is an aspect-oriented extension to Java, whereas Jiazzi is a component system for Java. To compare these systems, we reimplemented an AspectJ implementation of a highly configurable CORBA Event Service using Jiazzi. Our experience is that Jiazzi provides better support for structuring the system and manipulating features, while AspectJ is more suitable for manipulating existing Java code in non-invasive and unanticipated ways

    On Provably Safe and Live Multirobot Coordination With Online Goal Posting

    Get PDF
    A standing challenge in multirobot systems is to realize safe and efficient motion planning and coordination methods that are capable of accounting for uncertainties and contingencies. The challenge is rendered harder by the fact that robots may be heterogeneous and that their plans may be posted asynchronously. Most existing approaches require constraints on the infrastructure or unrealistic assumptions on robot models. In this article, we propose a centralized, loosely-coupled supervisory controller that overcomes these limitations. The approach responds to newly posed constraints and uncertainties during trajectory execution, ensuring at all times that planned robot trajectories remain kinodynamically feasible, that the fleet is in a safe state, and that there are no deadlocks or livelocks. This is achieved without the need for hand-coded rules, fixed robot priorities, or environment modification. We formally state all relevant properties of robot behavior in the most general terms possible, without assuming particular robot models or environments, and provide both formal and empirical proof that the proposed fleet control algorithms guarantee safety and liveness

    A Bayesian Approach for Software Release Planning under Uncertainty

    Get PDF
    Release planning — deciding what features to implement in upcoming releases of a software system— is a critical activity in iterative software development.Many release planning methods exist but most ignore the inevitable uncertainty of future development effort and business value. The thesis investigates how to analyse uncertainty during release planning and whether analysing uncertainty leads to better decisions than if uncertainty is ignored. The thesis’s first contribution is a novel release planning method designed to analyse uncertainty in the context of the Incremental Funding Method, an incremental cost-value based approach to software development. Our method uses triangular distributions, Monte-Carlo simulation and multi-objective optimisation to shortlist release plans that maximise expected net present value and minimise investment cost and risk. The second contribution is a new release planning method, called BEARS, designed to analyse uncertainty in the context of fixed-date release processes.Fixed-date release processes are more common in industry than fixed-scope release processes. BEARS models uncertainty about feature development time and economic value using lognormal distributions. It then uses Monte-Carlo simulation and search-based multi-objective optimisation to shortlist release plans that maximise expected net present value and expected punctuality. The method helps release planners explore possible tradeoffs between these two objectives. The thesis’ third contribution is an experiment to study whether analysing uncertainty using BEARS leads to shortlisting better release plans than if uncertainty is ignored, or if uncertainty is analysed assuming fixed-scope releases. The experiment compares 5 different release planning models on 32 release planning problems.The results show that analysing uncertainty using BEARS leads to shortlisting release plans with higher expected net present value and higher expected punctuality than methods that ignore uncertainty or that assume fixed-scope releases.Our experiment therefore shows that analysing uncertainty can lead to better release planning decisions than if uncertainty is ignored

    Temporal networks

    Get PDF
    Integrace plánování rozvrhování vyžaduje hledání nových přístupů problému rozvrhování. Rozvrhovací systém musí být schopen poskytnout užitečné informace plánovači, aby se zabránilo vytvářní neuskutečnitelných plánů. Pro rozvrhování založené na splňování omezujících podmínek je možné de novat vlastní fi ltrační pravidla a tak zefektivnit řešící algoritmus. Pokud filtrační pravidla využívají informace sdělené plánovačem a rozvrhovacím systémem (např. precedenční a nebo temporální podmínky), výstup těchto pravidel je mozné poskytnout plánovači, který je může s výhodou využít. V této práci je navržena filtrační metoda, která využívá temporální vztahy mezi aktivitami alokovanými na jeden nebo více disjunktivních zdrojů. Práce také popisuje sadu propagačnch pravidel založených na kombinaci ruzných fi ltračních technik.Integration of planning and scheduling requires new approaches to the scheduling problem. The scheduler must be able to provide useful information for the planner in order to avoid generation of unfeasible plans. In constraint-based scheduling it is possible to de ne custom ltering rules that improve the solving procedure. If the ltering rules exploit the information shared by the planner and the scheduler (e.g. precedence or temporal constraints), the outcome of these rules can be used to provide useful hints for the planner. This work presents a ltering technique that exploits temporal relations between a set of activities allocated to one or more disjunctive resources. The work also presents a set of propagation rules for constraint-based scheduling based on various ltering techniqes.Department of Theoretical Computer Science and Mathematical LogicKatedra teoretické informatiky a matematické logikyFaculty of Mathematics and PhysicsMatematicko-fyzikální fakult

    On Dependency Analysis via Contractions and Weighted FSTs

    Get PDF
    Arc contractions in syntactic dependency graphs can be used to decide which graphs are trees. The paper observes that these contractions can be expressed with weighted finite-state transducers (weighted FST) that operate on string-encoded trees. The observation gives rise to a finite-state parsing algorithm that computes the parse forest and extracts the best parses from it. The algorithm is customizable to functional and bilexical dependency parsing, and it can be extended to non-projective parsing via a multi-planar encoding with prior results on high recall. Our experiments support an analysis of projective parsing according to which the worst-case time complexity of the algorithm is quadratic to the sentence length, and linear to the overlapping arcs and the number of functional categories of the arcs. The results suggest several interesting directions towards efficient and highprecision dependency parsing that takes advantage of the flexibility and the demonstrated ambiguity-packing capacity of such a parser.Peer reviewe
    corecore