66,062 research outputs found

    Homological mirror symmetry for toric orbifolds of toric del Pezzo surfaces

    Full text link
    We formulate a conjecture which describes the Fukaya category of an exact Lefschetz fibration defined by a Laurent polynomial in two variables in terms of a pair consisting of a consistent dimer model and a perfect matching on it. We prove this conjecture in some cases, and obtain homological mirror symmetry for quotient stacks of toric del Pezzo surfaces by finite subgroups of the torus as a corollary.Comment: 23 pages, 40 figures; v2:completely rewritten; v3:Incorporated suggestions by the refere

    Data Multi-Pushdown Automata

    Get PDF
    We extend the classical model of multi-pushdown systems by considering systems that operate on a finite set of variables ranging over natural numbers. The conditions on variables are defined via gap-order constraints that allow to compare variables for equality, or to check that the gap between the values of two variables exceeds a given natural number. Furthermore, each message inside a stack is equipped with a data item representing its value. When a message is pushed to the stack, its value may be defined by a variable. When a message is popped, its value may be copied to a variable. Thus, we obtain a system that is infinite in multiple dimensions, namely we have a number of stacks that may contain an unbounded number of messages each of which is equipped with a natural number. It is well-known that the verification of any non-trivial property of multi-pushdown systems is undecidable, even for two stacks and for a finite data-domain. In this paper, we show the decidability of the reachability problem for the classes of data multi-pushdown system that admit a bounded split-width (or equivalently a bounded tree-width). As an immediate consequence, we obtain decidability for several subclasses of data multi-pushdown systems. These include systems with single stacks, restricted ordering policies on stack operations, bounded scope, bounded phase, and bounded context switches

    Threads and Or-Parallelism Unified

    Full text link
    One of the main advantages of Logic Programming (LP) is that it provides an excellent framework for the parallel execution of programs. In this work we investigate novel techniques to efficiently exploit parallelism from real-world applications in low cost multi-core architectures. To achieve these goals, we revive and redesign the YapOr system to exploit or-parallelism based on a multi-threaded implementation. Our new approach takes full advantage of the state-of-the-art fast and optimized YAP Prolog engine and shares the underlying execution environment, scheduler and most of the data structures used to support YapOr's model. Initial experiments with our new approach consistently achieve almost linear speedups for most of the applications, proving itself as a good alternative for exploiting implicit parallelism in the currently available low cost multi-core architectures.Comment: 17 pages, 21 figures, International Conference on Logic Programming (ICLP 2010

    Simulation Modeling of Alternative Staffing and Task Prioritization in Manual Post-Distribution Cross Docking Facilities

    Get PDF
    Many supply chains have grown increasingly complex, which has led to the development of different facility types. One such facility is known as a post-distribution cross docking system (Post-C). In these facilities, bulk sorted product is received from various suppliers. Each product has its own destination, so the bulk package is broken, sorted by destination, and staged by destination. Typical processing includes: sort received goods by product type; break bulk and sort out goods by destination; move palletized goods to the staging areas of their respective destinations. This paper compares a global staffing policy (in which all workers may perform any task) to a dedicated staffing policy (in which groups of workers are assigned specific tasks). Through comparisons of the two models, it was found the dedicated worker model’s benefits from reduced change-over outweigh the lower worker utilization it experiences

    Archiving multi-epoch data and the discovery of variables in the near infrared

    Full text link
    We present a description of the design and usage of a new synoptic pipeline and database model for time series photometry in the VISTA Data Flow System (VDFS). All UKIRT-WFCAM data and most of the VISTA main survey data will be processed and archived by the VDFS. Much of these data are multi-epoch, useful for finding moving and variable objects. Our new database design allows the users to easily find rare objects of these types amongst the huge volume of data being produced by modern survey telescopes. Its effectiveness is demonstrated through examples using Data Release 5 of the UKIDSS Deep Extragalactic Survey (DXS) and the WFCAM standard star data. The synoptic pipeline provides additional quality control and calibration to these data in the process of generating accurate light-curves. We find that 0.6+-0.1% of stars and 2.3+-0.6% of galaxies in the UKIDSS-DXS with K<15 mag are variable with amplitudes \Delta K>0.015 magComment: 30 pages, 31 figures, MNRAS, in press Minor changes from previous version due to refereeing and proof-readin
    • …
    corecore