Graph meta learning aims to learn historical knowledge from training graph neural networks (GNNs) models and adapt it downstream tasks in a target graph, which has drawn increasing attention due its ability of transfer fast adaptation. While existing approaches assume the are same domain but lack solution for multi-domain In this paper, we address generalized problem, is challenging non-Euclide...

Cross-domain classi cation for speech understanding is an interesting research problem because of the need for portable solutions in the design for spoken dialogue systems. In this paper, a twotier classi er is proposed for speech understanding. The rst tier consists of domain independent dialogue acts while the second tier consists of application actions that are domain speci c. A maximum like...

Let S = {x1, x2, . . . , xn} be a set of distinct positive integers such that gcd(xi, xj) ∈ S for 1 ≤ i, j ≤ n. Such a set is called GCD-closed. In 1875/1876, H.J.S. Smith showed that, if the set S is “factor-closed”, then the determinant of the matrix eij = gcd(xi, xj) is det(E) = ∏n m=1 φ(xm), where φ denotes Euler’s Phi-function. Since the early 1990’s there has been a rebirth of interest in...

Purpose. The purpose of this study was to elucidate the pathophysiological process in primary cultured corneal fibroblasts (PCFs) from normal subjects and granular corneal dystrophy (GCD) II patients, by using cDNA microarrays. Methods. PCFs were isolated from the corneas of normal subjects and GCD II patients who were heterozygous and homozygous for the TGFBI R124H mutation. RNA was isolated f...

As a consequence of Algorithm 1 below, there always exist integers x, y ∈ Z such that ax+by = gcd(a, b). We say that a and b are co-prime (or relatively prime) if gcd(a, b) = 1, i.e., ax = 1 mod b. From this, x is the multiplicative inverse of a modulo b, and likewise y is the multiplicative inverse of b modulo a. The following deterministic algorithm shows that gcd(a, b) (and additionally, the...

In this study, a new and efficient approach is presented for numerical solution of Fredholm integro-differential equations (FIDEs) of the second kind on unbounded domain with degenerate kernel based on operational matrices with respect to generalized Laguerre polynomials(GLPs). Properties of these polynomials and operational matrices of integration, differentiation are introduced and are ultili...