This is a preliminary version of a Chapter on Algebraic Algorithms in the up-

of con-cepts. This main goal is motivated by the basic fact, constituting also the main problem of KDD, that languages we may choose for knowledge description are incomplete. A fortiori, we have to describe concepts of interest (features, proper-ties, relations etc.) not completely but by means

Algebraic algorithms deal with numbers, vectors, matrices, polynomials, for-mal power series, exponential and differential polynomials, rational functions, algebraic sets, curves and surfaces. In this vast area, manipulation with matri-ces and polynomials is fundamental for modern computations

We define a notion of degree of unsolvability for subsets of R ” (where R is a real closed Archimedean field) and prove that, in contrast to Type 2 computability, the presence of exact equality in the BSS model forces exactly one jump of the unsolvability degree of decidable sets. @ 1999 Elsevier Science B.V. All rights reserved. 1.

Abstract: Online learning initia-tives over the past decade have become increasingly comprehen-sive in their selection of courses and sophisticated in their presen-tation, culminating in the recent announcement of a number of consortium and startup activities that promise to make a university education on the internet, free of charge, a real possibility. At this pivotal moment it is appropriate to explore the potential for obtaining comprehensive bioinformatics training with currently existing free video resources. This article pre-sents such a bioinformatics curric-ulum in the form of a virtual course catalog, together with editorial commentary, and an assessment of strengths, weaknesses, and likely future directions for open online learning in this field. Online Learning Comes of Age Online academic ‘‘courseware’ ’ at the university level has now been available to the public for a decade, the earliest concerted effort having originated in 2002 with the Massachusetts Institute of Technology (MIT) and their OpenCour-seWare initiative

Commutative, idempotent groupoids and the

for automatic semigroups ✩

IOS Press Utilization of intelligent agents for supporting citizens in their access to e-government services 1

Effective support for custom proof automation is essential for large-scale interactive proof develop-ment. However, existing languages for automation via tactics either (a) provide no way to specify the behavior of tactics within the base logic of the accompanying theorem prover, or (b) rely

of sensors, one of the fundamental technologies in the semantic sensor network vision. Twelve sensor ontologies are reviewed and anal-ysed for the range and expressive power of their concepts. The reasoning and search technology developed in conjunction with these ontologies is also reviewed