1,721,115 research outputs found
The Pathetic Fallacy of RDF
No full textThe most popular visualization of RDF - the underlying language to represent the Semantic Web – is a Great Big Graph (GBG) or Big Fat Graph (BFG) if one prefers. By graph, we mean representations with nodes and edges to model the relationships within the space represented. Why are they the default representation? The answer that is usually proffered is that the Semantic Web is a Graph, ipso facto we use graphs to represent it. This notion that data should be presented to the user as it is represented in the computer is what we propose as the pathetic fallacy of RDF. In the following discussion, we consider examples of the pathetic fallacy in terms of the interaction challenge of * what knowledge these graphs communicate, * what tasks they support, and * whether these are the optimal paradigms for these representations/tasks. From this context, we investigate the question, are graphs the main default representation for the Semantic Web and if not, how might we think about formalized representations for the Semantic Web in order to make accessible the promised benefits of the Semantic Web for knowledge building
Simplifying knowledge acquisition from end-users on the semantic web
No full textIn this position paper, we argue that improved mechanisms for knowledge acquisition on the semantic web (SW) will be necessary before it will be adopted widely by end-users. In particular, we propose an investigation surrounding improved languages for knowledge exchange, better UI mechanisms for interaction, and potential help from user modeling to enable accurate, efficient, SW knowledge modeling for everyone. Copyright is held by the author/owner(s).</p
GUI— Phooey! : The Case for Text Input
No full textInformation cannot be found if it is not entered. Research shows that existing rich graphical application approaches interfere with user input in many ways, forcing complex interactions to enter simple information, requiring complex cognition to decide where the data should be stored, and limiting the kind of information that can be entered to what can fit into specific applications' data models. Freeform text entry suffers from none of these limitations but produces data that is hard to retrieve or visualize. We describe the design and implementation of a system that aims to bridge these two modalities, supporting lightweight text entry, and weightless context capture, that produces enough structure to support rich interactive presentation and retrieval of the arbitrary information entered
Personalized Experiences for End-User Programming on the Web
No full textIn this position paper we explore current work in AtomsMasher, an end-user reactive programming environment for the Web, highlight ongoing work in user interface design, privacy, and sharing, and look towards a future of extending end-user programming from simple tasks to complete experiences
Bringing the Semantic Web home: a research agenda for local, personalized SWUI
No full textWe suggest that by taking the Semantic Web local and personal, and deploying it as a shared "data sea" for all applications to trawl, new types of interaction are possible (even necessitated) with this heterogeneous source integration. We present a motivating scenario to foreground the kind of interaction we envision as possible, and outline a series of associated questions about data integration issues, and in particular about the interaction challenges fostered by these new possibilities. We sketch out some early approaches to these questions, but our goal is to identify a wider field of questions for the SWUI community in considering the implications of a local/social semantic web, not just a public one, for interaction
Wicked Problems and Gnarly Results: Reflecting on Design and Evaluation Methods for Idiosyncratic Personal Information Management Tasks
No full textThis paper is a case study of an artifact design and evaluation process; it is a reflection on how right thinking about design methods may at times result in sub-optimal results. Our goal has been to assess our decision making process throughout the design and evaluation stages for a software prototype in order to consider where design methodology may need to be tuned to be more sensitive to the domain of practice, in this case software evaluation in personal information management. In particular, we reflect on design methods around (1) scale of prototype, (2) prototyping and design process, (3) study design, and (4) study population
Standards opportunities around data-bearing Web pages
Full text linkThe evolving Web has seen ever-growing use of structured data, thanks to the way it enhances information authoring, querying, visualization and sharing. To date, however, most structured data authoring and management tools have been oriented towards programmers and Web developers. End users have been left behind, unable to leverage structured data for information management and communication as well as professionals. In this paper, I will argue that many of the benefits of structured data management can be provided to end users as well. I will describe an approach and tools that allow end users to define their own schemas (without knowing what a schema is), manage data and author (not program) interactive Web visualizations of that data using the Web tools with which they are already familiar, such as plain Web pages, blogs, wikis and WYSIWYG document editors. I will describe our experience deploying these tools and some lessons relevant to their future evolution
A near-linear time algorithm for constructing a cactus representation of minimum cuts
No full textWe present an Õ(m) (near-linear) time Monte Carlo algorithm for constructing the cactus data structure, a useful representation of all the global minimum edge cuts of an undirected graph. Our algorithm represents a fundamental improvement over the best previous (quadratic time) algorithms: because there can be quadratically many min-cuts, our algorithm must avoid looking at all min-cuts during the construction, but nonetheless builds a data structure representing them all. Our result closes the gap between the (near-linear) time required to find a single min-cut and that for (implicitly) finding all the min-cuts
A Nearly Optimal Oracle for Avoiding Failed Vertices and Edges
Full text linkWe present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V,E) with non-negative edge weights to answer queries of the form: what is the length of the shortest path from x to y that does not go through some failed vertex or edge f. The previous best algorithm produces an oracle of size ~O(n[superscript 2]) that has an O(1) query time, and an ~O(nn[superscript 2]√m) construction time. It was a randomized Monte Carlo algorithm that worked with high probability. Our oracle also has a constant query time and an ~O(n[superscript 2]) space requirement, but it has an improved construction time of ~O(mn), and it is deterministic. Note that O(1) query, O(n[superscript 2]) space, and O(mn) construction time is also the best known bound (up to logarithmic factors) for the simpler problem of finding all pairs shortest paths in a weighted, directed graph. Thus, barring improved solutions to the all pairs shortest path problem, our oracle is optimal up to logarithmic factors
- …
