Results 131 to 140 of about 149 (149)
Explainable Deep Multilevel Attention Learning for Predicting Protein Carbonylation Sites
Advanced Science, EarlyView.Selective carbonylation sites (SCANS) are conceptualized, designed, evaluated, and released. SCANS captures segment‐level, protein‐level, and residue embeddings features. It utilizes elaborate loss function to penalize cross‐predictions at the residue level.
Jian Zhang +6 more
wiley +1 more source
Facilitating crRNA Design by Integrating DNA Interaction Features of CRISPR‐Cas12a System
Advanced Science, EarlyView.This study introduces a novel approach combining molecular dynamics simulations and neural network modeling to predict the Cas12a trans‐cleavage activity. By integrating sequence and molecular interaction features, prediction accuracy is enhanced, and identify key features affecting Cas12a trans‐cleavage activity.
Zhihao Yao +7 more
wiley +1 more source
A splitting algorithm for network reliability estimation [PDF]
IIE Transactions, 2013 Splitting is a variance reduction technique widely used to make efficient estimations of the probability of rare events in the simulation of Markovian models. In this article, splitting is applied to improve a well-known method called the Creation Process (CP), used in network reliability estimation. The resulting proposal, called here Splitting/CP, is
Murray, Leslie +2 more
openaire +4 more sources
Parametrically splitting algorithms [PDF]
Vestnik St. Petersburg University: Mathematics, 2010 The notion of parametrically splitting algorithms is introduced, which are characterized by their capability of solving a given problem on a large number of processors with few data transfers. These algorithms include many numerical integration algorithms, Monte Carlo and quasi-Monte Carlo methods, and so on.
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
IEEE Transactions on Acoustics, Speech, and Signal Processing, 1986
The classical Levinson algorithm for computing the predictor polynomial relative to a real positive definite Toeplitz matrix is shown to be redundant in complexity. It can be broken down into two simpler algorithms, either of which needs only to be processed. This result can be interpreted in the framework of the theory of orthogonal polynomials on the
P. Delsarte, Y. Genin
openaire +2 more sources
The classical Levinson algorithm for computing the predictor polynomial relative to a real positive definite Toeplitz matrix is shown to be redundant in complexity. It can be broken down into two simpler algorithms, either of which needs only to be processed. This result can be interpreted in the framework of the theory of orthogonal polynomials on the
P. Delsarte, Y. Genin
openaire +2 more sources
Research of Optimal Splitting Level of Splitting Algorithm
2018 IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData), 2018Splitting algorithm as an important method for rare-event simulation, choosing of the intermediate levels for splitting has always been the focus of attention in the research field. Different from the study of important function (IF), this paper aimed to discuss the allocation of two-level splitting and select the optimal splitting level based on ...
Liping Wang, Wenhui Fan
openaire +2 more sources
An FPT Algorithm for Set Splitting [PDF]
, 2003 An FPT algorithm with a running time of O(n 4 + 2 O(k) n 2.5) is described for the Set Splitting problem, parameterized by the number k of sets to be split. It is also shown that there can be no FPT algorithm for this problem with a running time of the form 2 o(k) n c unless the satisfiability of n-variable 3SAT instances can be decided in time 2 o(n).
Michael R. Fellows +2 more
openaire +1 more source
ACM SIGARCH Computer Architecture News, 1983
The translation of expressions into machine instructions often involves an implicit (or explicit) intermediate postfix (RPN) stage. Code generation and optimization of register-use are then based on the postfix form, in which segments of operands and operators alternate.
openaire +2 more sources
The translation of expressions into machine instructions often involves an implicit (or explicit) intermediate postfix (RPN) stage. Code generation and optimization of register-use are then based on the postfix form, in which segments of operands and operators alternate.
openaire +2 more sources
An efficient split-radix FHT algorithm
2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512), 2003In this paper, an efficient split-radix FFT algorithm is proposed for computing the length-2/sup r/ DFT that reduces significantly the number of data transfers, index generations, and twiddle factor evaluations or accesses to the lookup table. It is shown that the arithmetic complexity of the proposed algorithm is no more than that of the existing ...
M.O. Ahmad +2 more
openaire +2 more sources
A generalized state-splitting algorithm
IEEE Transactions on Information Theory, 1997We describe a generalization of the state-splitting algorithm (also known as the Adler-Coppersmith-Hassner (1983) algorithm) for constructing encoders which encode arbitrary data into constrained systems of sequences. In the generalized algorithm, we replace approximate eigenvectors with approximate eigenmatrices to yield a framework for designing ...
Jonathan Ashley, Brian Marcus
openaire +2 more sources