931401
Information retrieval on the semantic web
We describe an approach to retrieval of documents that contain of both free text and semantically enriched markup. In particular, we present the design and implementation prototype of a framework in which both documents and queries can be marked up with statements in the DAML+OIL semantic web language. These statements provide both structured and semi-structured information about the documents and their content. We claim that indexing text and semantic markup together will significantly improve retrieval performance. Our approach allows inferencing to be done over this information at several points: when a document is indexed, when a query is processed and when query results are evaluated.
468262
Collaborative joins in a pervasive computing environment
Abstract.We present a collaborative query processing protocol based on the principles of Contract Nets. The protocol is designed for pervasive computing environments where, in addition to operating on limited computing and battery resources, mobile devices cannot always rely on being able to access the wired infrastructure. Devices, therefore, need to collaborate with each other in order to obtain data otherwise inaccessible due to the nature of the environment. Furthermore, by intelligently using answers cached by peers, devices can reduce their computation cost. We show the effectiveness of our approach by evaluating performance of devices querying for data while moving in a citylike environment.
31295380
Intelligent Agents for Mobile and Embedded Devices
The pervasive computing environments of the near future will involve the interactions, coordination and cooperation of numerous, casually accessible, and often invisible computing devices. These devices, whether carried on our person or embedded in our homes, businesses and classrooms, will connect via wireless and wired links to one another and to the global networking infrastructure. The result will be a networking milieu with a new level of openness. The localized and dynamic nature of their interactions raises many new issues that draw on and challenge the disciplines of agents, distributed systems, and security. This paper describes recent work by the UMBC Ebiquity research group which addresses some of these issues.
14330906
Creating Context-Aware Software Agents
Sharing ontologies, sensing context and reasoning are crucial to the realization of context-aware software agents. This document de- scribes our efforts in using the Resource Description Framework (RDF) and Prolog Forward Chaining (Pfc) system to provide support for ontology sharing and reasoning in the CoolAgent Recommendation System (CoolAgent RS), a context-aware multi-agent system. We also describes the implementation of the CoolAgent RS document and cuisine recommendation services that provide tailored services by exploiting user's context.
1962537
Finding and Ranking Knowledge on the Semantic Web
Swoogle helps software agents and knowledge engineers find Semantic Web knowledge encoded in RDF and OWL documents on the Web. Navigating such a Semantic Web on the Web is difficult due to the paucity of explicit hyperlinks beyond the namespaces in URIrefs and the few inter-document links like rdfs:seeAlso and owl:imports. In order to solve this issue, this paper proposes a novel Semantic Web navigation model providing additional navigation paths through Swoogle's search services such as the Ontology Dictionary. Using this model, we have developed algorithms for ranking the importance of Semantic Web objects at three levels of granularity: documents, terms and RDF graphs. Experiments show that Swoogle outperforms conventional web search engine and other ontology libraries in finding more ontologies, ranking their importance, and thus promoting the use and emergence of consensus ontologies.
8623137
Semantic analytics on social networks: experiences in addressing the problem of conflict of interest detection
In this paper, we describe a Semantic Web application that detects Conflict of Interest (COI) relationships among potential reviewers and authors of scientific papers. This application discovers various 'semantic associations' between the reviewers and authors in a populated ontology to determine a degree of Conflict of Interest. This ontology was created by integrating entities and relationships from two social networks, namely "knows," from a FOAF (Friend-of-a-Friend) social network and "co-author," from the underlying co-authorship network of the DBLP bibliography. We describe our experiences developing this application in the context of a class of Semantic Web applications, which have important research and engineering challenges in common. In addition, we present an evaluation of our approach for real-life COI detection.
16208693
Some results in tree automata
In this paper, we will essentially present three results in tree automata. Two of these are concerned with certain open problems posed by Rounds [1] and Martin and Vere [3], and the third one is related to the result of Peters and Ritchie [4].
 First we will briefly state the results and then describe them in some detail in Sections 2, 3, and 4.
5138605
String Adjunct Grammars
In this paper, we have introduced a new style of formal grammars called String Adjunct Grammars (AG). The rules in an AG have a considerably different formal character as compared to the 'rewrite rule' in a Phrase Structure Grammar (PSG). Such a study of formal grammars of different styles (i.e., formal character of rules) is of great interest because each style is well suited for characterizing certain aspects of natural language structure and is awkward for characterizing certain other aspects. Several subclasses of AG's motivated by strong linguistic considerations have been studied, comparing them with PSG's. Linguistic relevance of these grammars (and other gram mars suggested by this study) has been discussed at the end.
6625273
Wave-pipelined 2-slot time division multiplexed (WP/2-TDM) routing
The ever-increasing number of transistors on a chip has resulted in very large scale integration (VLSI) systems whose performance and manufacturing costs are driven by on-chip wiring needs. This paper proposes a low overhead wave-pipelined two-slot time division multiplexed (WP/2-TDM) routing technique that harnesses the inherent intra-clock period wire idleness to implement wire sharing in combination with wave-pipelined circuit techniques. It is illustrated in this paper that WP/2-TDM routing can be readily incorporated into future gigascale integration (GSI) systems to reduce the number of interconnect routing channels in an attempt to contain escalating manufacturing costs. Two case studies, one at the circuit level and one at the system level, are presented to illustrate the advantages of WP/2-TDM routing. The circuit level implementation exhibits more than 40% reduction in wire area, a 30% reduction in silicon area with no increase in dynamic power and no loss of throughput performance.
1644414
A 2-slot time-division multiplexing (TDM) interconnect network for gigascale integration (GSI)
In many wire-limited VLSI digital systems the time delay of the longest global interconnect can be a significant percentage of the clock period. However, because semi-global and global wires with shorter wire lengths can have a much smaller time delay, they can remain idle (i.e. not switching) for a significant portion of the clock period even after their data has been transmitted. To capitalize on this phenomenon, this paper proposes that a low-overhead 2-slot Time Division Multiplexing (TDM) network should be incorporated into the multilevel interconnect architectures of future GSI systems to help reduce the escalating manufacturing costs that are primarily due to the projected increase in the number of metal layers. Using system-level interconnect prediction (SLIP) techniques, it is shown that a 20% reduction in the number of metal levels could be achieved for a 100M transistor VLSI system with only a 5-10% increase in power dissipation.
34341997
Local Transformations