In this paper the chordal graph structures of polynomial sets appearing in triangular decomposition in top-down style are studied when the input polynomial set to decompose has a chordal associated graph. In particular, we prove that the associated graph of one specific triangular set computed in any algorithm for triangular decomposition in top-down style is a subgraph of the chordal graph of ...

In this article, we propose a new reinforcement learning (RL) method based on an actor-critic architecture. The actor and the critic are approximated by Normalized Gaussian Networks (NGnet), which are networks of local linear regression units. The NGnet is trained by the on-line EM algorithm proposed in our previous paper. We apply our RL method to the task of swinging-up and stabilizing a sing...

Since its very beginning, linear algebra is a highly algorithmic subject. Let us just mention the famous Gauß Algorithm which was invented before the theory of algorithms has been developed. The purpose of this paper is to link linear algebra explicitly to computable analysis, that is the theory of computable real number functions. Especially, we will investigate in which sense the dimension of...

Hotelling's (1931) 72 is used widely in multivariate data analysis, encompassing tests for means, the construction of confidence ellipsoids and their projections, the analysis of repeated measurements, and statistical process control using Iiotelling's (1947) 72 charts. These and other applications are valid under strict model specifications which, in practice, may fail. The knowledgeable use o...

We develop an O(n 3) algorithm for deciding if an n-vertex digraph has a subset of vertices with the property that each vertex of the graph has an even number of arcs into the subset. This algorithm allows us to give a combinatorial interpretation of Gauss-Jordan and Gauss elimination on square boolean matrices. In addition to solving this independence-mod-2 (even) set existence problem we also...

We present a new technique for optimizing programs, based on data-ow analysis. The initial goal was to provide a simple way to improve on Leroy and Peyton-Jones' techniques for optimizing boxings (allocations) and unboxings ((eld selection) away in strongly-typed functional programs. Our techniques achieve this goal, while not needing types any more (so it applies to Lisp as well as to ML), and...

Resolution has not been an eeective tool for deciding satissability of propositional CNF formulas, due to explosion of the search space, particularly when the formula is satissable. A new pruning method is described, which is designed to eliminate certain refutation attempts that cannot succeed. The method exploits the concept of \autarky", which was introduced by Monien and Speckenmeyer. New f...

Theorem provers based on model elimination have exhibited extremely high inference rates but have lacked a redundancy control mechanism such as subsumption. In this paper we report on work done to modify a model elimination theorem prover using two techniques, caching and lemmaizing, that have reduced by more than an order of magnitude the time required to find proofs of several problems and th...

Interactions of Mast Cells With the Lymphatic System: Delivery of Peripheral Signals to Lymph Nodes by Mast Cell-Derived Particles by Christian Kunder Department of Pathology Duke University Date:_______________________ Approved: ___________________________ Soman Abraham, Ph.D., Supervisor ___________________________ Michael Dee Gunn, M.D. ___________________________ Laura Hale, M.D., Ph.D. ___...

In this paper we investigate the design of compressive antenna arrays for direction of arrival (DOA) estimation that aim to provide a larger aperture with a reduced hardware complexity by a linear combination of the antenna outputs to a lower number of receiver channels. We present a basic receiver architecture of such a compressive array and introduce a generic system model that includes diffe...