we find recursive formulae for the number of perfect matchings in a graph g by splitting g into subgraphs h and q. we use these formulas to count perfect matching of p hypercube qn. we also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in g, is the graph constructed from by deleting edges with an en...

As no plan can cover all possible contingencies, the ability to detect failures during plan execution is crucial to the robustness of any autonomous system operating in a dynamic and uncertain environment. In this paper we present a general planning and execution monitoring system where formulas in an expressive temporal logic specify the desired behavior of a system and its environment. A unif...

The delta function gauge of the electromagnetic potential allows semiclassical formulas to be obtained for the probability of exciting a single electron out of the ground state in an ultrarelativistic heavy ion reaction. Exact formulas have been obtained in the limits of zero impact parameter and large, perturbative, impact parameter. The perturbative impact parameter result can be exploited to...

A rule quality measure is important to a rule induction system for determining when to stop generalization or specialization. Such measures are also important to a rule-based classification procedure for resolving conflicts among rules. We describe a number of statistical and empirical rule quality formulas and present an experimental comparison of these formulas on a number of standard machine...

Superscalar microprocessor efficiency is generally not as high as anticipated. In fact, sustained utilization below thirty percent of peak is not uncommon, even for fully optimized, cache-friendly codes. Where cycles are lost is the topic of much research. In this paper we attempt to model architectural effect on processor utilization with and without memory influence. By presenting analytical ...

We address the problem of prediction in the classical spatial autoregressive LAG model for areal data. In contrast with the spatial econometrics literature, the geostatistical literature has devoted much attention to prediction using the Best Linear Unbiased Prediction approach. From the methodological point of view, we explore the limits of the extension of BLUP formulas in the context of the ...

We investigate a hybrid between temporal partial-order and forward-chaining planning where each action in a partially ordered plan is associated with a partially defined state. The focus is on centralized planning for multi-agent domains and on loose commitment to the precedence between actions belonging to distinct agents, leading to execution schedules that are flexible where it matters the m...

In this paper we examine the structure of American option valuation problems and derive the analytic valuation formulas under general underlying security price processes by an alternative but intuitive method. For alternative diffusion processes, we derive closed-form analytic valuation formulas and analyze the implications of asset price dynamics on the early exercise premiums of American opti...

This paper proves, in very general settings, that convex risk minimization is a procedure to select a unique conditional probability model determined by the classification problem. Unlike most previous work, we give results that are general enough to include cases in which no minimum exists, as occurs typically, for instance, with standard boosting algorithms. Concretely, we first show that any...