Semantic web technology to support learning about the semantic web

This paper describes ASPL, an Advanced Semantic Platform for Learning, designed using the Magpie framework with an aim to support students learning about the Semantic Web research area. We describe the evolution of ASPL and illustrate how we used the results from a formal evaluation of the initial system to re-design the user functionalities. The second version of ASPL semantically interprets the results provided by a non-semantic web mining tool and uses them to support various forms of semantics-assisted exploration, based on pedagogical strategies such as performing later reasoning steps and problem space filtering

Opening up Magpie via semantic services

Magpie is a suite of tools supporting a ‘zero-cost’ approach to semantic web browsing: it avoids the need for manual annotation by automatically associating an ontology-based semantic layer to web resources. An important aspect of Magpie, which differentiates it from superficially similar hypermedia systems, is that the association between items on a web page and semantic concepts is not merely a mechanism for dynamic linking, but it is the enabling condition for locating services and making them available to a user. These services can be manually activated by a user (pull services), or opportunistically triggered when the appropriate web entities are encountered during a browsing session (push services). In this paper we analyze Magpie from the perspective of building semantic web applications and we note that earlier implementations did not fulfill the criterion of “open as to services”, which is a key aspect of the emerging semantic web. For this reason, in the past twelve months we have carried out a radical redesign of Magpie, resulting in a novel architecture, which is open both with respect to ontologies and semantic web services. This new architecture goes beyond the idea of merely providing support for semantic web browsing and can be seen as a software framework for designing and implementing semantic web applications

Context as foundation for a semantic desktop

Adoption of semantic web technologies and principles presents an opportunity to change the conceptual model of desktop computing. Moving from a traditional position where the desktop is largely tied to a specific computational device, a semantic desktop could exist as a broad, networked space defined relative to the user. In this position paper we argue that personal, computing, and knowledge contexts are the appropriate means by which to define and shape the desktop space, and that collectively they provide the foundation for novel functionality in a semantic desktop

Minimal Asymmetric Dark Matter

In the early Universe, any particle carrying a conserved quantum number and in chemical equilibrium with the thermal bath will unavoidably inherit a particle-antiparticle asymmetry. A new particle of this type, if stable, would represent a candidate for asymmetric dark matter (DM) with an asymmetry directly related to the baryon asymmetry. We study this possibility for a minimal DM sector constituted by just one (generic) $SU(2)_L$ multiplet $\chi$ carrying hypercharge, assuming that at temperatures above the electroweak phase transition an effective operator enforces chemical equilibrium between $\chi$ and the Higgs boson. We argue that limits from DM direct detection searches severely constrain this scenario, leaving as the only possibilities scalar or fermion multiplets with hypercharge $y = 1$, preferentially quintuplets or larger $SU(2)$ representations, and with a mass in the few TeV range.Comment: 9 pages, 2 figures, included t-channel scattering, added details on charged-neutral mass splitting and indirect detection, accepted in PL

A reclaimer scheduling problem arising in coal stockyard management

We study a number of variants of an abstract scheduling problem inspired by the scheduling of reclaimers in the stockyard of a coal export terminal. We analyze the complexity of each of the variants, providing complexity proofs for some and polynomial algorithms for others. For one, especially interesting variant, we also develop a constant factor approximation algorithm.Comment: 26 page

Developing ontologies in OWL: An observational study

No abstract