skip to main content

Title: Kepler Data Analysis: Non-Gaussian Noise and Fourier Gaussian Process Analysis of Stellar Variability
Award ID(s):
Publication Date:
Journal Name:
The Astronomical Journal
Page Range or eLocation-ID:
Sponsoring Org:
National Science Foundation
More Like this
  1. This research concerns the uncertainty analysis and quantification of the vibration system utilizing the frequency response function (FRF) representation with statistical metamodeling. Different from previous statistical metamodels that are built for individual frequency points, in this research we take advantage of the inherent correlation of FRF values at different frequency points and resort to the multiple response Gaussian process (MRGP) approach. To enable the analysis, vector fitting method is adopted to represent an FRF using a reduced set of parameters with high accuracy. Owing to the efficiency and accuracy of the statistical metamodel with a small set of parameters, Bayesian inference can then be incorporated to realize model updating and uncertainty identification as new measurement/evidence is acquired. The MRGP metamodel developed under this new framework can be used effectively for two-way uncertainty propagation analysis, i.e., FRF prediction and uncertainty identification. Case studies are conducted for illustration and verification.
  2. This article analyzes the effect of imperfections in physically realizable memory. Motivated by the realization of a bit as a Brownian particle within a double well potential, we investigate the energetics of an erasure protocol under a Gaussian mixture model. We obtain sharp quantitative entropy bounds that not only give rigorous justification for heuristics utilized in prior works, but also provide a guide toward the minimal scale at which an erasure protocol can be performed. We also compare the results obtained with the mean escape times from double wells to ensure reliability of the memory. The article quantifies the effect of overlap of two Gaussians on the the loss of interpretability of the state of a one bit memory, the required heat dissipated in partially successful erasures and reliability of information stored in a memory bit.
  3. Attribute-based encryption (ABE) is an advanced cryptographic tool and useful to build various types of access control systems. Toward the goal of making ABE more practical, we propose key-policy (KP) and ciphertext-policy (CP) ABE schemes, which first support unbounded sizes of attribute sets and policies with negation and multi-use of attributes, allow fast decryption, and are adaptively secure under a standard assumption, simultaneously. Our schemes are more expressive than previous schemes and efficient enough. To achieve the adaptive security along with the other properties, we refine the technique introduced by Kowalczyk and Wee (Eurocrypt’19) so that we can apply the technique more expressive ABE schemes. Furthermore, we also present a new proof technique that allows us to remove redundant elements used in their ABE schemes. We implement our schemes in 128-bit security level and present their benchmarks for an ordinary personal computer and smartphones. They show that all algorithms run in one second with the personal computer when they handle any policy or attribute set with one hundred attributes. [Note: this paper is not by the PI, but by Genise who was supported by the grant; support was acknowledged in this publication.]