1245230
A policy language for a pervasive computing environment
We describe a policy language designed for pervasive computing applications that is based on deontic concepts and grounded in a semantic language. The pervasive computing environments under consideration are those in which people and devices are mobile and use various wireless networking technologies to discover and access services and devices in their vicinity. Such pervasive environments lend themselves to policy-based security due to their extremely dynamic nature. Using policies allows the security functionality to be modified without changing the implementation of the entities involved. However, along with being extremely dynamic, these environments also tend to span several domains and be made up of entities of varied capabilities. A policy language for environments of this sort needs to be very expressive but lightweight and easily extensible. We demonstrate the feasibility of our policy language in pervasive environments through a prototype used as part of a secure pervasive system.
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.
42398377
A Policy Based Approach to Security for the Semantic Web
Along with developing specifications for the description of meta-data and the extraction of information for the Semantic Web, it is important to maximize security in this environment, which is fundamentally dynamic, open and devoid of many of the clues human societies have relied on for security assessment. Our research investigates the marking up of web entities with a semantic policy language and the use of distributed policy management as an alternative to traditional authentication and access control schemes. The policy language allows policies to be described in terms of deontic concepts and models speech acts, which allows the dynamic modification of existing policies, decentralized security control and less exhaustive policies. We present a security framework, based on this policy language, which addresses security issues for web resources, agents and services in the Semantic Web.
16963632
Agents Making Sense of the Semantic Web
Effective use of the vast quantity of available information and services on the Internet will require multi-agent systems to be tightly integrated with existing web infrastructure. This however will be impossible unless the information on the web is presented in a semantic language, such as the DARPA Agent Markup Language (DAML), which is one aim of the “Semantic Web”. As part of our exploration of Semantic Web technology, and DAML in particular, we have constructed ITTALKS, a web-based system for automatic and intelligent notification of information technology talks. In this paper, we describe the ITTALKS system, and discuss the numerous ways in which the use of Semantic Web concepts and DAML extend its ability to provide an intelligent online service to both the human community and, more interestingly, the agents assisting them.
2898024
Using OWL in a Pervasive Computing Broker
Computing is moving toward a pervasive context-aware environment in which agents with limited resources will require external support to help them become context-aware. In this paper, we describe an agent based architecture called Context Broker Architecture (CoBrA) to help these agents to acquire, reason about and share context knowledge. A key component in our architecture is an explicit context ontology defined using the Web Ontology Language (OWL). This ontology models the basic concepts of people, agents, places, and presentation events. We also describe a use case scenario and prototype design of CoBrA in an intelligent meeting room environment.
9322495
SOUPA: standard ontology for ubiquitous and pervasive applications
We describe a shared ontology called SOUPA - standard ontology for ubiquitous and pervasive applications. SOUPA is designed to model and support pervasive computing applications. This ontology is expressed using the Web ontology language OWL and includes modular component vocabularies to represent intelligent agents with associated beliefs, desires, and intentions, time, space, events, user profiles, actions, and policies for security and privacy. We discuss how SOUPA can be extended and used to support the applications of CoBrA, a broker-centric agent architecture for building smart meeting rooms, and MoGATU, a peer-to-peer data management for pervasive environments.
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.
21264133
Wave-pipelined multiplexed (WPM) routing for gigascale integration (GSI)
In modern-day VLSI systems, performance and manufacturing costs are being driven by the on-chip wiring needs due to the continuous increase in the number of transistors. This paper proposes a low overhead wave-pipelined multiplexed (WPM) routing technique that harnesses the inherent intraclock period interconnect idleness to implement wire sharing throughout the various hierarchical levels of design. It is illustrated in this paper that the WPM network 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. Both, a system level analysis and circuit level verification of this WPM routing are presented in this paper. A multilevel interconnect network design simulator (MINDS) that uses system level interconnect prediction (SLIP) techniques and HSPICE circuit simulations for optimizing the interconnect dimensions has been used to assess the opportunities for application of WPM wire circuits in high performance digital designs. A custom routing example highlights the ease with which the WPM routing technique can be easily incorporated into the existing VLSI systems. In addition, for a 40 million transistor system case study, this system level analysis reveals that the use of a WPM network could result in an almost 20% decrease in the number of metal layers for less than 4% increase in dynamic power with no loss of communication throughput performance. The key virtues of WPM routing are its flexibility, robustness, implementation simplicity and its low overhead requirements.
2902172
On correspondence, line tokens and missing tokens
In this article, the authors expand on some of their previous work on correspondence and propose a system that can correspond in the presence of both point and line tokens, or a mix of them. It can also work if some tokens present in one frame are not present in the other. The proposed algorithm is an amalgamation of reductionist and holist paradigms. We establish that properties which remain invariant for whole image sequences and sequences consisting of corresponding parts from each image frame can be used to establish correspondence. Extensive computer simulation results on synthesised data as well as real image sequences are presented to validate our claims.
39703480
Skeletal Structural Descriptions
In this paper we explore the idea of characterizing sentences by the shapes of their structural descriptions only; for example, in the case of context free grammars, by the shapes of the derivation trees only. Such structural descriptions will be called skeletons . A skeleton exhibits all of the grouping structure (phrase structure) of the sentence without naming the syntactic categories used in the description. The inclusion of syntactic categories as variables is primarily a question of economy of description. Every context free grammar is strongly equivalent to a skeletal grammar, in a sense made precise in the paper. Besides clarifying the role of skeletons in mathematical linguistics, we show that skeletal automata provide a characterization of local sets, remedying a “defect” in the usual tree automata theory. We extend the method of skeletal structural descriptions to other forms of tree describing systems. We also suggest a theoretical basis for grammatical inference based on grouping structure only.
2954113
Tree Adjunct Grammars
In this paper, a tree generating system called a tree adjunct grammar is described and its formal properties are studied relating them to the tree generating systems of Brainerd (Information and Control14 (1969), 217-231) and Rounds (Mathematical Systems Theory 4 (1970), 257-287) and to the recognizable sets and local sets discussed by Thatcher (Journal of Computer and System Sciences1 (1967), 317-322; 4 (1970), 339-367) and Rounds. Linguistic relevance of these systems has been briefly discussed also.