JSTOR Daily

Local Polynomial Kernel Regression for Generalized Linear Models and Quasi-Likelihood Functions

We investigate the extension of the nonparametric regression technique of local polynomial fitting with a kernel weight to generalized linear models and quasi-likelihood contexts. In the ordinary ...
IEEE

Graph Structure of Chebyshev Permutation Polynomials Over Ring ℤ p k

Abstract: Understanding the underlying graph structure of a nonlinear map over a particular domain is essential in evaluating its potential for real applications. In this paper, we investigate the ...
IEEE

Co-Clustering by Directly Solving Bipartite Spectral Graph Partitioning

Abstract: Bipartite spectral graph partitioning (BSGP) method as a co-clustering method, has been widely used in document clustering, which simultaneously clusters documents and words by making full ...
GitHub

In this assignment, you'll work on a simplified version of Shamir's Secret Sharing algorithm.

Consider an unknown polynomial of degree m. You would require m+1 roots of the polynomial to solve for the coefficients, represented as k = m + 1. f(x) is the polynomial function m is the degree of ...
GitHub

PhyGNNet: Solving spatiotemporal PDEs with Physics-informed Graph Neural Network

This repo is the official implementation of "PhyGNNet: Solving spatiotemporal PDEs with Physics-informed Graph Neural Network" by Longxiang Jiang, Liyuan Wang, Xinkun Chu, Yonghao Xiao, and Hao Zhang ...