Results 221 to 230 of about 30,670 (257)

Refined rules termination analysis through transactions

Information Systems, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Elisa Bertino, Danilo Montesi
exaly   +3 more sources

Rules for α-Helix Termination by Glycine

Science, 1994
A predictive rule for protein folding is presented that involves two recurrent glycine-based motifs that cap the carboxyl termini of α helices. In proteins, helices that terminated in glycine residues were found predominantly in one of these two motifs. These glycine structures had a characteristic pattern of polar and apolar residues.
R, Aurora, R, Srinivasan, G D, Rose
openaire   +2 more sources

Prehospital termination of resuscitation rule

Current Opinion in Critical Care, 2019
Purpose of review The purpose of the review is to briefly describe the derivation, validation and implementation of the Termination of Resuscitation Rules for out-of-hospital adult cardiac arrest and to describe the controversies surrounding implementation that have been recently published ...
openaire   +2 more sources

Simplification and termination of strategies in rule-based languages

Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming, 2003
In rule-based languages, control of rule application can be expressed thanks to strategy constructors. The paper addresses termination of such strategy-guided evaluation. To fix ideas, we use the ELAN strategy language. We first give a sufficient criterion for ELAN-like strategies to terminate, only lying on rewrite rules involved in the strategy.
Fissore, Olivier, Gnaedig, Isabelle, Kirchner, Hélène   +2 more
openaire   +2 more sources

Termination of Rewriting with Right-Flat Rules

2007
Termination and innermost termination are shown to be decidable for term rewrite systems whose right-hand side terms are restricted to be shallow (variables occur at depth at most one) and linear. Innermost termination is also shown to be decidable for shallow rewrite systems.
Guillem Godoy, Eduard Huntingford, Ashish Tiwari 0001   +2 more
openaire   +1 more source

A termination rule for degradation experiments

IEEE Transactions on Reliability, 1997
Analysis of degradation data can provide information about the lifetime of highly reliable products, if there exists a product characteristic whose degradation over time can be related to reliability. To obtain a precise estimator of a product mean time-to-failure, one practical problem arising from designing a degradation experiment is: how long ...
null Sheng-Tsaing Tseng, null Hong-Fwu Yu   +1 more
openaire   +1 more source

Judge rules against terminated employee

Campus Legal Advisor, 2021
Case name: Iapichino v. Hackensack University Medical Center, et al., No. 17‐6521 (D. N.J. 09/15/20).
  +5 more sources

Sound and Complete Proof Rules for Probabilistic Termination

Proceedings of the ACM on Programming Languages
Deciding termination is a fundamental problem in the analysis of probabilistic imperative programs. We consider the qualitative and quantitative probabilistic termination problems for an imperative programming model with discrete probabilistic choice and demonic bounded nondeterminism.
Rupak Majumdar
exaly   +4 more sources

Termination of a Set of Rules Modulo a Set of Equations

1984
The problem of termination of a set R of rules modulo a set E of equations, called E-termination problem, arises when trying to complete the set of rules in order to get a Church-Rosser property for the rules modulo the equations. We first show here that termination of the rewriting relation and E-termination are the same whenever the used rewriting ...
Jean-Pierre Jouannaud, Miguel Munoz
openaire   +1 more source

Decidability of Termination of Grid String Rewriting Rules

SIAM Journal on Computing, 2002
Summary: Termination of string rewriting is known undecidable. Termination of string rewriting with only one rule is neither known decidable nor known undecidable. This paper presents a decision procedure for rules \(u\rightarrow v\) such that some letter b from u occurs as often or less often in v. We call such rules ``grid'' rules.
openaire   +1 more source