 IDEALS Home
 →
 Browse by Subject
Browse by Subject "Mathematics"
Now showing items 2140 of 994

(1993)In traditional precedenceconstrained scheduling a task is ready to execute when all its predecessors are completed. We call such a task an AND task. In many applications there are tasks which are ready to execute when ...
application/pdf
PDF (6MB) 
application/pdf
PDF (3MB) 
application/pdf
PDF (1MB) 
application/pdf
PDF (2MB) 
(2004)The Main Theorem shows that every nontrivial tame knot in R3 has an alternating quadrisecant. This result refines the previous work about quadrisecants and gives greater geometric insight into knots. The Main Theorem ...
application/pdf
PDF (3MB) 
(1984)An (omega)language is a set of infinite ((omega)type) strings of symbols. We study the classes of (omega)languages accepted by Turing Acceptors when infinite computations are allowed. There are various possible ...
application/pdf
PDF (2MB) 
(1997)In 1877, R. Dedekind introduced the sum$$s(d, c) = \sum\sbsp{j=1}{c}\left(\left({j\over c}\right)\right)\left(\left({dj\over c}\right)\right),$$which appears in the multiplier system of the Dedekind etafunction as a modular ...
application/pdf
PDF (3MB) 
(1981)Two algorithms of use in sparse matrix computation are studied. The rounding errors of the computational Lanczos algorithm are examined in order to account for the differences between the ideal and the machineoperator ...
application/pdf
PDF (5MB) 
application/pdf
PDF (2MB) 
(2004)We prove error estimates for the case of both elementwise and patchwise causal partitions.
application/pdf
PDF (5MB) 
(1990)In 1983, Bhatia, Davis and McIntosh proved that if A and B are selfadjoint with dist($\sigma(A),\sigma(B)) \geq \delta$ then there is some $c\sb{sa} < 2$ (independent of A and B) such that $c\sb{sa}\vert\vert\vert AQ  ...
application/pdf
PDF (3MB) 
(1987)In this work we develop an approach of Selberg to the analytic continuation of Eisenstein series by means of Fredholm theory. We set up the machinery for very general algebraic groups and arithmetic subgroups, and obtain ...
application/pdf
PDF (5MB) 
application/pdf
PDF (4MB) 
(1982)Forelli has shown that every linear isometry T from H('p) onto H('p),1 (LESSTHEQ) p < (INFIN), p (NOT=) 2, is of the form Tf = (nu)((phi)')('1/p)f(CCIRC)(phi), where (nu) is a unimodular constant and (phi) is in M, the ...
application/pdf
PDF (2MB) 
(1997)A stochastic flow is constructed on a frame bundle adapted to a Riemannian foliation on a compact manifold. The generator A of the resulting transition semigroup is shown to preserve the basic functions and forms, and there ...
application/pdf
PDF (3MB) 
(2006)We consider the KuramotoSivashinsky equation in one dimension with periodic boundary conditions. We apply a Lyapunov function argument similar to the one first introduced by Nicolaenko, Scheurer, and Temam, and later ...
application/pdf
PDF (3MB) 
(2007)Secondly, we use algebraic functions with two poles to obtain efficient secret sharing schemes. We present a method to find the lower bounds for the minimum distance of geometric codes. We apply this to the twopoint codes ...
application/pdf
PDF (2MB) 
application/pdf
PDF (2MB) 
(2009)Here we provide a simple outline of the contents of this dissertation.
application/pdf
PDF (499kB) 
(1988)The algebraic constraints in a system of differentialalgebraic equations (DAEs) impose a consistency requirement on the initial values that can be difficult to satisfy. In this thesis the consistency requirement is ...
application/pdf
PDF (4MB)
Now showing items 2140 of 994