4
4.0

Jun 29, 2018
06/18

by
John Abbott; Anna Maria Bigatti

texts

#
eye 4

#
favorite 0

#
comment 0

We present a survey on the developments related to Groebner bases, and show explicit examples in CoCoA. The CoCoA project dates back to 1987: its aim was to create a "mathematician"-friendly computational laboratory for studying Commutative Algebra, most especially Groebner bases. Always maintaining this "friendly" tradition, the project has grown and evolved, and the software has been completely rewritten. CoCoA offers Groebner bases for all levels of interest: from the...

Topics: Commutative Algebra, Symbolic Computation, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1611.07306

4
4.0

Nov 22, 2019
11/19

by
Worthley, John Abbott

texts

#
eye 4

#
favorite 0

#
comment 0

viii,332 p. ; 23 cm

Topics: Health services administration -- Moral and ethical aspects, Medical ethics -- United States,...

2
2.0

Jun 28, 2018
06/18

by
John Abbott; Bettina Eick

texts

#
eye 2

#
favorite 0

#
comment 0

Let $n$ be a positive integer and let $f_1, \ldots, f_r$ be polynomials in $n^2$ indeterminates over an algebraically closed field $K$. We describe an algorithm to decide if the invertible matrices contained in the variety of $f_1, \ldots, f_r$ form a subgroup of $GL(n,K)$; that is, we show how to decide if the polynomials $f_1, \ldots, f_r$ define a linear algebraic group.

Topics: Group Theory, Mathematics

Source: http://arxiv.org/abs/1511.07627

3
3.0

Jun 30, 2018
06/18

by
John Abbott; Anna Maria Bigatti; Elisa Palezzato; Lorenzo Robbiano

texts

#
eye 3

#
favorite 0

#
comment 0

Given a zero-dimensional ideal I in a polynomial ring, many computations start by finding univariate polynomials in I. Searching for a univariate polynomial in I is a particular case of considering the minimal polynomial of an element in P/I. It is well known that minimal polynomials may be computed via elimination, therefore this is considered to be a "resolved problem". But being the key of so many computations, it is worth investigating its meaning, its optimization, its...

Topics: Symbolic Computation, Computing Research Repository, Commutative Algebra, Mathematics

Source: http://arxiv.org/abs/1702.07262

3
3.0

Jun 29, 2018
06/18

by
John Abbott; Anna Maria Bigatti; Lorenzo Robbiano

texts

#
eye 3

#
favorite 0

#
comment 0

We present new, practical algorithms for the hypersurface implicitization problem: namely, given a parametric description (in terms of polynomials or rational functions) of the hypersurface, find its implicit equation. Two of them are for polynomial parametrizations: one algorithm, "ElimTH", has as main step the computation of an elimination ideal via a \textit{truncated, homogeneous} Gr\"obner basis. The other algorithm, "Direct", computes the implicitization directly...

Topics: Commutative Algebra, Mathematics

Source: http://arxiv.org/abs/1602.03993

81
81

Dec 7, 2007
12/07

by
A.J. Cordeiro (CSKY John Abbott College Radio)

audio

#
eye 81

#
favorite 0

#
comment 0

Bonus Episode A.J. Cordeiro CSKY John Abbott College Radio Dec 5, 07 Guest Stars: Lord Kentrol (Ken Chi A.) & Shane Cabana, etc.

Topics: CSKY, CSKY JAC, A.J. Cordeiro, AJ Cordeiro, MT40, Rock, Podcast

27
27

Mar 10, 2021
03/21

by
John Abbott College

audio

#
eye 27

#
favorite 0

#
comment 0

John Abbott on The Air compilation of podcast reviews

Topic: podcasts

48
48

Sep 21, 2013
09/13

by
John Abbott; Claudia Fassino; Maria-Laura Torrente

texts

#
eye 48

#
favorite 0

#
comment 0

Let $X$ be a set of points whose coordinates are known with limited accuracy; our aim is to give a characterization of the vanishing ideal $I(X)$ independent of the data uncertainty. We present a method to compute a polynomial basis $B$ of $I(X)$ which exhibits structural stability, that is, if $\widetilde X$ is any set of points differing only slightly from $X$, there exists a polynomial set $\widetilde B$ structurally similar to $B$, which is a basis of the perturbed ideal $ I(\widetilde X)$.

Source: http://arxiv.org/abs/0706.2316v2

3
3.0

Oct 30, 2020
10/20

by
Worthley, John Abbott

texts

#
eye 3

#
favorite 0

#
comment 0

xii, 343 pages : 23 cm

Topics: Medicine -- Data processing, Medical care -- Data processing, Information storage and retrieval...

44
44

Sep 22, 2013
09/13

by
John Abbott; Claudia Fassino; Maria-Laura Torrente

texts

#
eye 44

#
favorite 0

#
comment 0

Given a set $X$ of "empirical" points, whose coordinates are perturbed by errors, we analyze whether it contains redundant information, that is whether some of its elements could be represented by a single equivalent point. If this is the case, the empirical information associated to $X$ could be described by fewer points, chosen in a suitable way. We present two different methods to reduce the cardinality of $X$ which compute a new set of points equivalent to the original one, that...

Source: http://arxiv.org/abs/math/0702327v1

A new MP3 sermon from Still Waters Revival Books is now available on SermonAudio with the following details: Title: The Christian Mother, A Mother's Difficulties Can Be Overcome Subtitle: Contemporary Issues Series Speaker: John Abbott Broadcaster: Still Waters Revival Books Event: Audio Book Date: 9/14/2010 Bible: Ephesians 6:1-4; Galatians 5:22-25 Length: 29 min.

51
51

Sep 23, 2013
09/13

by
John Abbott

texts

#
eye 51

#
favorite 0

#
comment 0

We gather together several bounds on the sizes of coefficients which can appear in factors of polynomials in Z[x]; we include a new bound which was latent in a paper by Mignotte, and a few minor improvements to some existing bounds. We compare these bounds and show that none is universally better than the others. In the second part of the paper we give several concrete examples of factorizations where the factors have "unexpectedly" large coefficients. These examples help us...

Source: http://arxiv.org/abs/0904.3057v1

232
232

Sep 21, 2008
09/08

by
John Abbott

texts

#
eye 232

#
favorite 0

#
comment 0

Book digitized by Google from the library of the University of Michigan and uploaded to the Internet Archive by user tpb.

Source: http://books.google.com/books?id=Bi01AAAAMAAJ&oe=UTF-8

60
60

Sep 23, 2013
09/13

by
John Abbott

texts

#
eye 60

#
favorite 0

#
comment 0

In this paper we present two efficient methods for reconstructing a rational number from several residue-modulus pairs, some of which may be incorrect. One method is a natural generalization of that presented by Wang, Guy and Davenport in \cite{WGD1982} (for reconstructing a rational number from \textit{correct} modular images), and also of an algorithm presented in \cite{Abb1991} for reconstructing an \textit{integer} value from several residue-modulus pairs, some of which may be incorrect.

Source: http://arxiv.org/abs/1303.2965v1

This volume was digitized and made accessible online due to deterioration of the original print copy.

2
2.0

Apr 21, 2021
04/21

by
Worthley, John Abbott

texts

#
eye 2

#
favorite 0

#
comment 0

x, 400 p. : 23 cm

Topics: Medical informatics, Management Information Systems, Health Services -- organization &...

72
72

Jul 20, 2013
07/13

by
John Abbott

texts

#
eye 72

#
favorite 0

#
comment 0

We present a new algorithm for refining a real interval containing a single real root: the new method combines characteristics of the classical Bisection algorithm and Newton's Iteration. Our method exhibits quadratic convergence when refining isolating intervals of simple roots of polynomials (and other well-behaved functions). We assume the use of arbitrary precision rational arithmetic. Unlike Newton's Iteration our method does not need to evaluate the derivative.

Source: http://arxiv.org/abs/1203.1227v1

2
2.0

Jul 19, 2020
07/20

by
Worthley, John Abbott

texts

#
eye 2

#
favorite 0

#
comment 0

x, 315 pages : 23 cm

Topics: Medical informatics, Medical Informatics, Information Management -- methods, Organizational Case...

1
1.0

Apr 29, 2020
04/20

by
Worthley, John Abbott

texts

#
eye 1

#
favorite 0

#
comment 0

x, 315 pages : 23 cm

Topics: Medical Informatics, Medical informatics, Organizational Case Studies, Information Management --...

11
11

Mar 3, 2020
03/20

by
John Abbott; Ralph Thompson; R A Gelis

texts

#
eye 11

#
favorite 0

#
comment 0

26
26

Mar 19, 2020
03/20

by
Various Artists; Betty Wand; Chorus; Hermione Gingold; Isabel Jeans; John Abbott; Leslie Caron; Louis Jourdan; Maurice Chavalier; Maurice Chevalier; Orchestra

audio

#
eye 26

#
favorite 0

#
comment 0

Tracklist: 1. Gigi - Overture - Orchestra 2. Honore's Soliloquy - Maurice Chevalier 3. Thank Heaven for Little Girls - Maurice Chevalier 4. It's a Bore - Maurice Chavalier; Louis Jourdan 5. Parisians, The - Betty Wand 6. Waltz at the Ice Rink, The - Leslie Caron; Louis Jourdan 7. Gossips, The - Maurice Chavalier; Chorus 8. She Is Not Thinking of Me - Louis Jourdan 9. It's a Bore (Reprise) - Maurice Chavalier; Louis Jourdan; John Abbott 10. Gaston Celebrates - Orchestra 11. Night They Invented...

Topic: Original Film/TV Music

Source: CD

156
156

Feb 21, 2014
02/14

by
Redmond, John Abbott

texts

#
eye 156

#
favorite 0

#
comment 0

Typewritten sheets in cover

78
78

Dec 6, 2007
12/07

by
AJ Cordeiro (CSKY John Abbott College Radio)

audio

#
eye 78

#
favorite 0

#
comment 0

MT40 - AJ Cordeiro - Season Finale for Season One - Dec 05, 07 CSKY John Abbott College Radio Guest stars Carl Summers, Ken Chi A., Holden Roy and more...)

Topics: MT40, AJ, Cordeiro, AJ Cordeiro, CSKY, CSKY JAC, Dec 05 07

55
55

Sep 29, 2020
09/20

by
John Abbott College ALC students

audio

#
eye 55

#
favorite 0

#
comment 0

A collection of radio news stories produced by John Abbott College students in September of 2020.

Topic: COVID CKUT