نتایج جستجو برای: substitution property

تعداد نتایج: 213937  

1998
Leonid Mikhajlov Emil Sekerinski

In this paper we study the fragile base class problem. This problem occurs in open object-oriented systems employing code inheritance as an implementation reuse mechanism. System developers unaware of extensions to the system developed by its users may produce a seemingly acceptable revision of a base class which may damage its extensions. The fragile base class problem becomes apparent during ...

Journal: :The Southeast Asian journal of tropical medicine and public health 2007
Saranya Auparakkitanon Kritchai Poonchareon Kittipat Sopitthummakhun Prapon Wilairat

Antiplasmodial 9-anilinoacridine derivatives exert their effects either by inhibiting DNA topoisomerase (topo) II or by interfering with heme crystallization within the parasite acidic food vacuole. Previous studies have shown that analogs of 9-anilinoacridine containing 3,6-diamino substitutions (in the acridine ring) inhibit Plasmodium falciparum DNA topo II in situ, whereas those with a 3,6-...

Journal: :Fundam. Inform. 1996
Steffen van Bakel

A notion of type assignment on Curryfied Term Rewriting Systems is introduced that uses Intersection Types of Rank 2, and in which all function symbols are assumed to have a type. Type assignment will consist of specifying derivation rules that describe how types can be assigned to terms, using the types of function symbols. Using a modified unification procedure, for each term the principal pa...

1998
PETER MÜLLER

Let f, g ∈ Z[X] be non-constant polynomials with integral coefficients. In 1968 H. Davenport raised the question as to when the value sets f(Z) and g(Z) are the same modulo all but finitely many primes. The main progress until now is M. Fried’s result that f and g then differ by a linear substitution, provided that f is functionally indecomposable. We extend this result to polynomials f of comp...

Journal: :CoRR 2014
Eric Rowland Reem Yassawi

Many sequences of p-adic integers project modulo p to p-automatic sequences for every α ≥ 0. Examples include algebraic sequences of integers, which satisfy this property for every prime p, and some cocycle sequences, which we show satisfy this property for a fixed p. For such a sequence, we construct a profinite automaton that projects modulo p to the automaton generating the projected sequenc...

2012
Jia-Ying Xin Yan Wang Tie Liu Kai Lin Le Chang Chun-Gu Xia

Esterification of starch was carried out to expand the usefulness of starch for a myriad of industrial applications. Lipase B from Candida antarctica, immobilized on macroporous acrylic resin (Novozym 435), was used for starch esterification in two reaction systems: micro-solvent system and solvent-free system. The esterification of corn starch with palmitic acid in the solvent-free system and ...

Journal: :IEEE Trans. Information Theory 2003
Stavros Konstantinidis Steven Perron L. Amber Wilcox-O'Hearn

We investigate the problem of designing pairs ( ) of words with the property that, if each word of a coded message is prefixed by and suffixed by , the resulting set of coded messages is error detecting with finite delay. We consider (combinatorial) channels permitting any combination of the substitution, insertion, and deletion (SID) error types, and address the cases of both scattered and bur...

Journal: :Int. J. Software and Informatics 2008
Jean-Pierre Jouannaud Yoshihito Toyama

In [19], Toyama proved that the union of two confluent term-rewriting systems that share absolutely no function symbols or constants is likewise confluent, a property called modularity. The proof of this beautiful modularity result, technically based on slicing terms into an homogeneous cap and a so called alien, possibly heterogeneous substitution, was later substantially simplified in [8, 12]...

1999
Jean-Pierre Jouannaud Albert Rubio

This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by adapting the recursive path ordering definition to terms of a typed lambda-calculus generated by a signature of polymorphic higher-order function symbols. The obtained ordering is well-founded, compatible with -reductions and with polymorphic typing, monotonic with respect to the funct...

2006
Jean-Pierre Jouannaud Yoshihito Toyama

In [17], Toyama proved that the union of two confluent term-rewriting systems that share absolutely no function symbols or constants is likewise confluent, a property called modularity. The proof of this beautiful modularity result, technically based on slicing terms into an homogeneous cap and a so called alien, possibly heterogeneous substitution, was later substantially simplified in [7, 9]....

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید