Results 1 - 10 of 1,026

Control Flow Analysis in Scheme

by Olin Shivers , 1988
"... Traditional flow analysis techniques, such as the ones typically employed by optimising Fortran compilers, do not work for Scheme-like languages. This paper presents a flow analysis technique- control flow analysis- which is applicable to Scheme-like languages. As a demonstration application, the in ..."
Abstract - Cited by 231 (7 self) - Add to MetaCart
, the information gathered by control flow analysis is used to per-form a traditional flow analysis problem, induction variable elimination. Extensions and limitations are discussed. The techniques presented in this paper are backed up by working code. They are applicable not only to Scheme, but also to related

Semi-supervised support vector machines

by Kristin P. Bennett, Ayhan Demiriz - In Proc. NIPS , 1998
"... We introduce a semi-supervised support vector machine (S3yM) method. Given a training set of labeled data and a working set of unlabeled data, S3YM constructs a support vector machine us-ing both the training and working sets. We use S3YM to solve the transduction problem using overall risk minimiza ..."
Abstract - Cited by 223 (6 self) - Add to MetaCart
minimization (ORM) posed by Yapnik. The transduction problem is to estimate the value of a classification function at the given points in the working set. This contrasts with the standard inductive learning problem of estimating the classification function at all possible values and then using the fixed

Integers

by Michał J. Trybulec
"... Summary. In the article the following concepts were introduced: the set of integers (Z) and its elements (integers), congruences (i1 ≡ i2(modi3)), the ceiling and floor functors (⌈x ⌉ and ⌊x⌋), also the fraction part of a real number (frac), the integer division (÷) and remainder of integer division ..."
Abstract - Add to MetaCart
division (mod). The following schemes were also included: the separation scheme (SepInt), the schemes of integer induction (Int Ind Down, Int Ind Up, Int Ind Full), the minimum (Int Min) and maximum (Int Max) schemes (the existence of minimum and maximum integers enjoying a given property).

Integers

by De Louvain, Micha̷l J. Trybulec, Micha̷l J. Trybulec
"... Summary. In the article the following concepts were introduced: the set of integers (   ) and its elements (integers), congruences (i1 ≡ i2(mod i3)), the ceiling and floor functors (⌈x ⌉ and ⌊x⌋), also the fraction part of a real number (frac), the integer division (÷) and remainder of integer divis ..."
Abstract - Add to MetaCart
division (mod). The following schemes were also included: the separation scheme (SepInt), the schemes of integer induction (Int Ind Down, Int Ind Up, Int Ind Full), the minimum (Int Min) and maximum (Int Max) schemes (the existence of minimum and maximum integers enjoying a given property). MML Identifier

Saturation

by unknown authors
"... Abstract – This paper presents a motor characteristics analysis method using an equivalent circuit. Motor characteristics analysis via equivalent circuit is very important for designing a high efficiency single phase induction motor. The accuracy of the motor characteristics depends on the accuracy ..."
Abstract - Add to MetaCart
Abstract – This paper presents a motor characteristics analysis method using an equivalent circuit. Motor characteristics analysis via equivalent circuit is very important for designing a high efficiency single phase induction motor. The accuracy of the motor characteristics depends on the accuracy

Integer sets containing no arithmetic progressions

by D. R. Heath-brown - J. London Math. Soc , 1987
"... lfh and k are positive integers there exists N(h, k) such that whenever N ^ N(h, k), and the integers 1,2,...,N are divided into h subsets, at least one must contain an arithmetic progression of length k. This is the famous theorem of van der Waerden [10], dating from 1927. The proof of this uses mu ..."
Abstract - Cited by 76 (0 self) - Add to MetaCart
lfh and k are positive integers there exists N(h, k) such that whenever N ^ N(h, k), and the integers 1,2,...,N are divided into h subsets, at least one must contain an arithmetic progression of length k. This is the famous theorem of van der Waerden [10], dating from 1927. The proof of this uses

Integer Construction by Induction

by Anthony R. Fressola, Dr. Joan Krone
"... In 1889, Giuseppe Peano inductively defined the natural numbers by using the empty set along with a successor function. The natural numbers can be defined inductively primarily because they are well-ordered, a property which is equivalent to that of induction [1]. Inductive systems are especially us ..."
Abstract - Add to MetaCart
, and transfinite induction [2, 3]. Although it would seem reasonable to describe sets containing the natural numbers inductively, such as the integers and rational numbers, traditional approaches have not done so. These systems have traditionally been defined as equivalence classes of natural numbers [4]. One

Beyond Induction Variables

by Michael Wolfe , 1992
"... Induction variable detection is usually closely tied to the strength reduction optimization. This paper studies induction variable analysis from a different perspective, that of finding induction variables for data dependence analysis. While classical induction variable analysis techniques have been ..."
Abstract - Cited by 95 (6 self) - Add to MetaCart
induction variables, and to classify other integer scalar assignments in loops, such as monotonic, periodic and wraparound variables. Some of these other variables are now classified using ad hoc pattern recognition, while others are not analyzed by current compilers. Giving a unified approach improves

Saturation: an efficient iteration strategy for symbolic state space generation

by Gianfranco Ciardo, Gerald Lüttgen, Radu Siminiceanu - PROC. TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS (TACAS), LNCS 2031 , 2001
"... We present a novel algorithm for generating state spaces of asynchronous systems using Multi–valued Decision Diagrams. In contrast to related work, we encode the next–state function of a system not as a single Boolean function, but as cross–products of integer functions. This permits the applicati ..."
Abstract - Cited by 64 (32 self) - Add to MetaCart
We present a novel algorithm for generating state spaces of asynchronous systems using Multi–valued Decision Diagrams. In contrast to related work, we encode the next–state function of a system not as a single Boolean function, but as cross–products of integer functions. This permits

2003): MATLAB Simulation of Induction Machines with Saturable Leakage

by Dr.-Ing O I Okoro - Magnetizing Inductance, The Pacific Journal of Science & Technology
"... ABSTRACT Several methods have been developed for the modeling of saturation effects in induction machines [8,9,10,11, At high stator phase currents, the effect of saturation of the stator and rotor leakage inductances becomes noticeable to the extent that the conventional machine model fails to rep ..."
Abstract - Cited by 8 (0 self) - Add to MetaCart
ABSTRACT Several methods have been developed for the modeling of saturation effects in induction machines [8,9,10,11, At high stator phase currents, the effect of saturation of the stator and rotor leakage inductances becomes noticeable to the extent that the conventional machine model fails
Results 1 - 10 of 1,026