Linking in Context

This paper explores the idea of dynamically adding multi-destination links to Web pages, based on the context of the pages and users, as a way of assisting Web users in their information finding and navigation activities. The work does not make any preconceived assumptions about the information needs of its users. Instead it presents a method for generating links by adapting to the information needs of a community of users and for utilizing these in assisting users within this community based on their individual needs. The implementation of this work is carried out within a multi-agent framework where concepts from open hypermedia are extended and exploited. In this paper, the entities involved in the process of generating and using ?context links? as well as the techniques they employ to achieve their tasks, are described. The result of an experiment carried out to investigate the implications of linking in context on information finding, is also provided

Finding Links in the Value Chain

Jeff Ryan and his family run a diversified operation in Winneshiek County in northeast Iowa. In addition to a mix of corn and alfalfa, they also operate a cow-calf herd of just under 100 head of commercial cows. The cowherd originated from their dairy operation in the 1970’s. Jeff has been in charge of the beef portion of the operation since age 14 in 1982. That’s when he initiated an artificial insemination program to improve genetics of the cowherd. A scale was added the following year to measure feedlot performance

On a Conjecture by Kauffman on Alternative and Pseudoalternating Links

It is known that alternative links are pseudoalternating. In 1983 Louis Kauffman conjectured that both classes are identical. In this paper we prove that Kauffman Conjecture holds for those links whose first Betti number is at most 2. However, it is not true in general when this value increases, as we also prove by finding two counterexamples: a link and a knot whose first Betti numbers equal 3 and 4, respectively.Comment: 15 pages, 8 figure

The Semantic Web MIDI Tape: An Interface for Interlinking MIDI and Context Metadata

The Linked Data paradigm has been used to publish a large number of musical datasets and ontologies on the Semantic Web, such as MusicBrainz, AcousticBrainz, and the Music Ontology. Recently, the MIDI Linked Data Cloud has been added to these datasets, representing more than 300,000 pieces in MIDI format as Linked Data, opening up the possibility for linking fine-grained symbolic music representations to existing music metadata databases. Despite the dataset making MIDI resources available in Web data standard formats such as RDF and SPARQL, the important issue of finding meaningful links between these MIDI resources and relevant contextual metadata in other datasets remains. A fundamental barrier for the provision and generation of such links is the difficulty that users have at adding new MIDI performance data and metadata to the platform. In this paper, we propose the Semantic Web MIDI Tape, a set of tools and associated interface for interacting with the MIDI Linked Data Cloud by enabling users to record, enrich, and retrieve MIDI performance data and related metadata in native Web data standards. The goal of such interactions is to find meaningful links between published MIDI resources and their relevant contextual metadata. We evaluate the Semantic Web MIDI Tape in various use cases involving user-contributed content, MIDI similarity querying, and entity recognition methods, and discuss their potential for finding links between MIDI resources and metadata

Degrees of Freedom and Achievable Rate of Wide-Band Multi-cell Multiple Access Channels With No CSIT

This paper considers a $K$-cell multiple access channel with inter-symbol interference. The primary finding of this paper is that, without instantaneous channel state information at the transmitters (CSIT), the sum degrees-of-freedom (DoF) of the considered channel is $\frac{\beta -1}{\beta}K$ with $\beta \geq 2$ when the number of users per cell is sufficiently large, where $\beta$ is the ratio of the maximum channel-impulse-response (CIR) length of desired links to that of interfering links in each cell. Our finding implies that even without instantaneous CSIT, \textit{interference-free DoF per cell} is achievable as $\beta$ approaches infinity with a sufficiently large number of users per cell. This achievability is shown by a blind interference management method that exploits the relativity in delay spreads between desired and interfering links. In this method, all inter-cell-interference signals are aligned to the same direction by using a discrete-Fourier-transform-based precoding with cyclic prefix that only depends on the number of CIR taps. Using this method, we also characterize the achievable sum rate of the considered channel, in a closed-form expression.Comment: Submitted to IEEE Transactions on Communication

Smeared Gauge Fixing

We present a new method of gauge fixing to standard lattice Landau gauge, Max Re Tr $\sum_{\mu,x}U_{\mu,x}$, in which the link configuration is recursively smeared; these smeared links are then gauge fixed by standard extremization. The resulting gauge transformation is simultaneously applied to the original links. Following this preconditioning, the links are gauge fixed again as usual. This method is free of Gribov copies, and we find that for physical parameters ($\beta \geq 2$ in SU(2)), it generally results in the gauge fixed configuration with the globally maximal trace. This method is a general technique for finding a unique minimum to global optimization problems.Comment: 3 pages, 4 PostScript figures; Poster presented at LAT9