Results 81 to 90 of about 1,321,024 (261)
Structural Induction Principles for Functional Programmers
, 2013 User defined recursive types are a fundamental feature of modern functional programming languages like Haskell, Clean, and the ML family of languages. Properties of programs defined by recursion on the structure of recursive types are generally proved by
Caldwell, James
core +2 more sources
Thermal Properties Model for the New Refrigerant HFO-1234yf
Zhileng xuebao, 2012 Based on Peng-Robinson general state equation, combined with group contribution principle and a polynomial method, the thermal state model of the new LGWP refrigerant HFO-1234yf was established and validated with required accuracy.
Jiang Kun, Liu Ying, Jiang Sha
doaj
Quantum Speedup for Multiuser Detection With Optimized Parameters in Grover Adaptive Search
IEEE AccessMaximum-likelihood multiuser detection incurs a large computational complexity, and its low-complexity detection scheme suffers from a performance loss, where this tradeoff is inevitable and inherent in a classical computer.
Masaya Norimoto +2 more
doaj +1 more source
Verifying and Synthesizing Constant-Resource Implementations with Types [PDF]
arXiv, 2018 We propose a novel type system for verifying that programs correctly implement constant-resource behavior. Our type system extends recent work on automatic amortized resource analysis (AARA), a set of techniques that automatically derive provable upper bounds on the resource consumption of programs.
arxiv
FEBS Open Bio, EarlyView.Measuring AMP‐activated protein kinase (AMPK) activity in vitro is crucial for testing AMPK activators or inhibitors with therapeutic potential. Here, we report an enzyme‐linked immunosorbent assay (ELISA)‐based AMPK activity assay with simple steps and high sensitivity, which offers a simple, robust, and cost‐effective alternative to traditional ...
Trezze P. Nguyen, Shangze Lyu, Yang Liu
wiley +1 more source
arXiv, 2017 We propose a novel method for automatic program synthesis. P-Tree Programming represents the program search space through a single probabilistic prototype tree. From this prototype tree we form program instances which we evaluate on a given problem. The error values from the evaluations are propagated through the prototype tree.
arxiv
FEBS Open Bio, EarlyView.Long non‐coding RNAs (lncRNAs) occupy an abundant fraction of the eukaryotic transcriptome and an emerging area in cancer research. Regulation by lncRNAs is based on their subcellular localization in HNSCC. This cartoon shows the various functions of lncRNAs in HNSCC discussed in this review.
Ellen T. Tran +3 more
wiley +1 more source
FEBS Open Bio, EarlyView.In human monocytic cells THP‐1, a limited uptake of native—not oxidized—LDL/VLDL induced expression of scavenger receptor A and cellular adhesion. Induction was inhibited by lysosomotropic (WR‐1065) and lipophilic (BHT) antioxidants and by siRNAs against ferritinophagy.
Martina Čierna +4 more
wiley +1 more source
Query Evaluation in DatalogMTL -- Taming Infinite Query Results [PDF]
arXiv, 2021 In this paper, we investigate finite representations of DatalogMTL models. First, we discuss sufficient conditions for detecting programs that have finite models. Then, we study infinite models that eventually become constant and introduce sufficient criteria for programs that allow for such representation.
arxiv
Span Program for Non-binary Functions [PDF]
arXiv, 2018 Span programs characterize the quantum query complexity of binary functions $f:\{0,\ldots,\ell\}^n \to \{0,1\}$ up to a constant factor. In this paper we generalize the notion of span programs for functions with non-binary input/output alphabets $f: [\ell]^n \to [m]$.
arxiv