The investigation presented in this paper is a novel method in question answering (QA) that enables a QA system to gain performance through reuse of information in the answer to one question to answer another related question. Our analysis shows that a pair of question in a general open domain QA can have embedding relation through their mentions of noun phrase expressions. We present methods f...

given a mapping $f:xto x$ we naturally associate to it a monotonic map $gg_f:exp xto exp x$ from the power set of $x$ into itself, thus inducing a generalized topology on $x$. in this paper we investigate some properties of generalized topologies which are defined by such a procedure.

Kitaev, Liese, Remmel, and Sagan recently defined generalized factor order on words comprised of letters from a partially ordered set (P,≤P) by setting u ≤P w if there is a subword v of w of the same length as u such that the i-th character of v is greater than or equal to the i-th character of u for all i. This subword v is called an embedding of u into w. Generalized factor order is related t...

Energy-constrained computing environments are emerging those years, especially in embedding computing. A game theoretic energy-aware scheduling algorithm for multicore systems is proposed in this paper, namely, GTFTES (Generalized Tit-For-Tat Energy-aware Scheduling). GTFTES is designed to work in a resource-rich environment where resources always compete for tasks. A generalized Tit-for-Tat ba...

In this paper we introduce a class of trees, called generalized compressed trees. Generalized compressed trees can be derived from complete binary trees by performing certain `contraction' operations. A generalized compressed tree CT of height h has approximately 25% fewer nodes than a complete binary tree T of height h. We show that these trees have smaller (up to a 74% reduction) 2-dimensiona...

We propose a fast algorithm for computing approximate GCD of univariate polynomials with coefficients that are given only to a finite accuracy. The algorithm is based on a stabilized version of the generalized Schur algorithm for Sylvester matrix and its embedding. All computations can be done in O(n2) operations, where n is the sum of the degrees of polynomials. The stability of the algorithm ...

The geodesic as well as the geodesic deviation equation for impulsive gravi-tational waves involve highly singular products of distributions (, 2 , 2). A solution concept for these equations based on embedding the distributional metric into the Colombeau algebra of generalized functions is presented. Using a universal regularization procedure we prove existence and uniqueness results and calcul...

In this paper we study a generalized Pólya urn with balls of two colors and a random triangular replacement matrix. We extend some results of Janson (2004), (2005) to the case where the largest eigenvalue of the mean of the replacement matrix is not in the dominant class. Using some useful martingales and the embedding method introduced in Athreya and Karlin (1968), we describe the asymptotic c...

A systematic approach is proposed for the individual or joint design of FIR filters to meet specifications on either a single filter or an embedding system (possibly multirate). System power gains in response to particular input spectra are optimized using a generalized eigenvector method. Numerical integration is avoided through a time-domain formulation. Real or complex filters with linear or...

We construct generalized 11D supergravity solutions of fully localized D2/D6 brane intersections. These solutions are obtained by embedding Taub-NUT and/or self-dual geometries lifted to M-theory. We reduce these solutions to ten dimensions, obtaining new D-brane systems in type IIA supergravity. We discuss the limits in which the dynamics of the D2 brane decouples from the bulk for these solut...