Results 1  10
of
9,442
An Easy Way To Minimal Algebras
"... A finite algebra C is called minimal with respect to a pair δ < θ of its congruences if every unary polynomial f of C is either a permutation, or f(θ) ⊆ δ. It is the basic idea of tame congruence theory developed by Ralph McKenzie and David Hobby [7] to describe finite algebras via minimal algeb ..."
Abstract

Cited by 11 (6 self)
 Add to MetaCart
A finite algebra C is called minimal with respect to a pair δ < θ of its congruences if every unary polynomial f of C is either a permutation, or f(θ) ⊆ δ. It is the basic idea of tame congruence theory developed by Ralph McKenzie and David Hobby [7] to describe finite algebras via minimal algebras that sit inside them. As shown in [7], minimal algebras have a very restricted structure. This paper presents a new tool, the Twin Lemma, which makes it possible to give short proofs of some of these structure theorems. This part can be read as an alternative introduction to the theory. Our method yields new information in the type 1 case, and is especially useful in describing Eminimal algebras (that is, algebras that are minimal with respect to every prime congruence quotient). We complete their theory given in [7] by proving a structure theorem for the type 1 case. Finally we show that if an algebra is minimal with respect to two quotients, then the two types are the same, and if this type is 2, 3, or 4, then the bodies are also equal.
Equivalence Testing the Easy Way
"... The purpose of the article is to demonstrate an equivalence testing software application written under SAS1 Institute software designed for use by pharmaceutical and other medical research professionals. Besides making the entire equivalence testing procedure easier and more efficient, the applicat ..."
Abstract
 Add to MetaCart
, the application “EquivEasy ” offers three main advantages over similar software: a testing for 3 3 in addition to 2 2 crossover designs, b familiar SAS user environment, and c export flexibility MS Word, PDF, HTML. Two case studies are presented with report results provided in tabular and graphical form.
Constructing SSA the Easy Way
, 2011
"... Static Single Assignment (SSA) form has become ubiquitous in compilers as an intermediate program representation. The use of SSA simplifies many compiler optimizations and makes the life of compiler writers easier. This tutorial presents a technique to convert Java bytecode programs in and out of SS ..."
Abstract
 Add to MetaCart
of SSA form with relative ease. 1 SSA Form Construction Static Single Assignment (SSA) form [1] has become ubiquitous in compilers as an intermediate program representation. SSA form is a program transformation where every variable is assigned exactly once. Its use greatly simplifies the way we reason
The Easy Way to Reform Education
"... Copyright: © 2015 Rose RV. This is an openaccess article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, ..."
Abstract
 Add to MetaCart
Copyright: © 2015 Rose RV. This is an openaccess article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use,
Easy ways to clear hurdles
"... One of the puzzling aspect of the HannenhalliPevzner theory is the complex, but always colorful, classification of hurdles. In this paper, we show that simple results on trees are at the root of all results on hurdles, either maximal or simple, superhurdles, and fortresses. 1 Pruning trees Let T b ..."
Abstract
 Add to MetaCart
One of the puzzling aspect of the HannenhalliPevzner theory is the complex, but always colorful, classification of hurdles. In this paper, we show that simple results on trees are at the root of all results on hurdles, either maximal or simple, superhurdles, and fortresses. 1 Pruning trees Let T be an unrooted tree with more than two leaves. Define a branch in T to be a segment from a leaf, up to the next fork, but excluding it. An even pruning of a tree T is the simultaneous cutting of two branches that does not create new leaves. Proposition 1 Any tree with at least four leaves can be evenly pruned. Proof: Any four leaves are related as in one of the following diagrams. In each case, pruning the set of branches {A, D}, or the set {B, C}, never creates new leaves.
(Inter)Action Refinement: The Easy Way
, 1993
"... We outline and illustrate a formal concept for the specification and refinement of networks of interactive components. We describe systems by modular, functional specification techniques. We distinguish between black box and glass box views of interactive system components as well as refinements of ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
;Werkzeuge und Methoden für die Nutzung paralleler Architekturen" IARthe easy way  2  4/25/95 1....
Probabilistically Checkable Proofs The Easy Way
"... We present a weaker variant of the PCP Theorem that admits a significantly easier proof. In this variant the prover only has n t time to compute each bit of his answer, for an arbitray but fixed constant t, in contrast to being all powerful. We show that 3SAT is accepted by a polynomialtime probabi ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
technical tools used in the proof are the "easy" part of the PCP Theorem in which the verifier reads a constant number of bits from an exponentially long proof string, and the construction of a pseudorandom generator from a oneway permutation.
Receding Horizon: An easy way to improve
"... email msmaierOfiodo.ee.psu.edu During the past few years the problem of stabilizing a Linear Parameter Varying system, while, at the same time, optimizing some measure of performance has been the object of increasing attention. In contrast to the case of linear systems where several optimal synthesi ..."
Abstract
 Add to MetaCart
synthesis techniques (such as El,, El2 and el) are well established, the counterparts for LPV systems are just starting to emerge. Moreover, at the present time, only sufficient conditions for performance are available, thus leading to potentially conservative designs. In this paper we propose a simple way
Conversational Inferences: The Hard Way and the Easy Way
, 2003
"... This paper proposes a general theory of conversational inferences which distinguishes two kinds of inferences: the hard way and the easy way. The theory accounts for a wider range of nonliteral utterance meanings than Gricean and relevance theories and is motivated by the types of utterances in whi ..."
Abstract
 Add to MetaCart
This paper proposes a general theory of conversational inferences which distinguishes two kinds of inferences: the hard way and the easy way. The theory accounts for a wider range of nonliteral utterance meanings than Gricean and relevance theories and is motivated by the types of utterances
Gnumpy: an easy way to use GPU boards in Python
, 2010
"... This technical report describes Gnumpy, a Python module that uses a GPU for computations, but has numpy’s convenient interface. Gnumpy: an easy way to use GPU boards in Python ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
This technical report describes Gnumpy, a Python module that uses a GPU for computations, but has numpy’s convenient interface. Gnumpy: an easy way to use GPU boards in Python
Results 1  10
of
9,442