Tensor stability in Born-Infeld determinantal gravity

We consider the transverse-traceless tensor perturbation of a spatial flat homogeneous and isotropic spacetime in Born-Infeld determinantal gravity, and investigate the evolution of the tensor mode for two solutions in the early universe. For the first solution where the initial singularity is replaced by a regular geometric de Sitter inflation of infinite duration, the evolution of the tensor mode is stable for the parameter spaces $\alpha<-1$, $\omega\geq-1/3$ and $\alpha=-1$, $\omega>0$. For the second solution where the initial singularity is replaced by a primordial brusque bounce, which suffers a sudden singularity at the bouncing point, the evolution of the tensor mode is stable for all regions of the parameter space. Our calculation suggests that the tensor evolution can hold stability in large parameter spaces, which is a remarkable property of Born-Infeld determinantal gravity. We also constrain the theoretical parameter $|\lambda|\geq 10^{-38} \text{m}^{-2}$ by resorting to the current bound on the speed of the gravitational waves.Comment: 14 pages, added a general discussion on the tensor stability in Sec. 3, and added Sec. 5 on the parameter constraint, published versio

AutoAccel: Automated Accelerator Generation and Optimization with Composable, Parallel and Pipeline Architecture

CPU-FPGA heterogeneous architectures are attracting ever-increasing attention in an attempt to advance computational capabilities and energy efficiency in today's datacenters. These architectures provide programmers with the ability to reprogram the FPGAs for flexible acceleration of many workloads. Nonetheless, this advantage is often overshadowed by the poor programmability of FPGAs whose programming is conventionally a RTL design practice. Although recent advances in high-level synthesis (HLS) significantly improve the FPGA programmability, it still leaves programmers facing the challenge of identifying the optimal design configuration in a tremendous design space. This paper aims to address this challenge and pave the path from software programs towards high-quality FPGA accelerators. Specifically, we first propose the composable, parallel and pipeline (CPP) microarchitecture as a template of accelerator designs. Such a well-defined template is able to support efficient accelerator designs for a broad class of computation kernels, and more importantly, drastically reduce the design space. Also, we introduce an analytical model to capture the performance and resource trade-offs among different design configurations of the CPP microarchitecture, which lays the foundation for fast design space exploration. On top of the CPP microarchitecture and its analytical model, we develop the AutoAccel framework to make the entire accelerator generation automated. AutoAccel accepts a software program as an input and performs a series of code transformations based on the result of the analytical-model-based design space exploration to construct the desired CPP microarchitecture. Our experiments show that the AutoAccel-generated accelerators outperform their corresponding software implementations by an average of 72x for a broad class of computation kernels

Full linear perturbations and localization of gravity on f(R,T)f(R,T) brane

We study the thick brane world system constructed in the recently proposed $f(R,T)$ theories of gravity, with $R$ the Ricci scalar and $T$ the trace of the energy-momentum tensor. We try to get the analytic background solutions and discuss the full linear perturbations, especially the scalar perturbations. We compare how the brane world model is modified with that of general relativity coupled to a canonical scalar field. It is found that some more interesting background solutions are allowed, and only the scalar perturbation mode is modified. There is no tachyon state exists in this model and only the massless tensor mode can be localized on the brane, which recovers the effective four-dimensional gravity. These conclusions hold provided that two constraints on the original formalism of the action are satisfied.Comment: v3: 8 pages, 2 figures, improved version with minor corrections, accepted by EPJ

IRGAN: A Minimax Game for Unifying Generative and Discriminative Information Retrieval Models

This paper provides a unified account of two schools of thinking in information retrieval modelling: the generative retrieval focusing on predicting relevant documents given a query, and the discriminative retrieval focusing on predicting relevancy given a query-document pair. We propose a game theoretical minimax game to iteratively optimise both models. On one hand, the discriminative model, aiming to mine signals from labelled and unlabelled data, provides guidance to train the generative model towards fitting the underlying relevance distribution over documents given the query. On the other hand, the generative model, acting as an attacker to the current discriminative model, generates difficult examples for the discriminative model in an adversarial way by minimising its discrimination objective. With the competition between these two models, we show that the unified framework takes advantage of both schools of thinking: (i) the generative model learns to fit the relevance distribution over documents via the signals from the discriminative model, and (ii) the discriminative model is able to exploit the unlabelled data selected by the generative model to achieve a better estimation for document ranking. Our experimental results have demonstrated significant performance gains as much as 23.96% on Precision@5 and 15.50% on MAP over strong baselines in a variety of applications including web search, item recommendation, and question answering.Comment: 12 pages; appendix adde