9264341
Discourse Relations: A Structural and Presuppositional Account Using Lexicalised TAG
We show that discourse structure need not bear the full burden of conveying discourse relations by showing that many of them can be explained nonstructurally in terms of the grounding of anaphoric presuppositions (Van der Sandt, 1992). This simplifies discourse structure, while still allowing the realisation of a full range of discourse relations. This is achieved using the same semantic machinery used in deriving clause-level semantics.
34341997
Local Transformations
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.
16163757
Local constraints in the syntax and semantics of programming languages
The method of local constraints attempts to describe context-free languages in an apparently context-sensitive form which helps to retain the intuitive insights about the grammatical structure. This form of description, while apparently context-sensitive is, in fact, context-free and allows a program derivation structure to be represented as a tree with additional constraints, thus allowing for the possibility of a correctness proof in the form of Knuthian semantics. A part of ALGOL 60 syntax has been restated as a grammar with local constraints. It is also shown that parsing of grammars with local constraints can be carried out by a suitable extension of Early's algorithm. Finally, the relationship of local constraints to the semantics of programs is discussed in Section 4 by considering some program transformations.
1552091
Phrase Structure Trees Bear More Fruit than You Would Have Thought
In this paper we will present several results concerning phrase structure trees. These results show that phrase structure trees, when viewed in certain ways, have much more descriptive power than one would have thought. We have given a brief account of local constraints on structural descriptions and an intuitive proof of a theorem about local constraints. We have compared the local constraints approach to some aspects of Gazdar's framework and that of Peters and Ritchie and of Karttunen. We have also presented some results on skeletons (phrase structure trees without labels) which show that phrase structure trees, even when deprived of the labels, retain in a certain sense all the structural information. This result has implications for grammatical inference procedures.
3265918
Anchoring a Lexicalized Tree-Adjoining Grammar for Discourse
We here explore a ``fully'' lexicalized Tree-Adjoining Grammar for discourse that takes the basic elements of a (monologic) discourse to be not simply clauses, but larger structures that are anchored on variously realized discourse cues. This link with intra-sentential grammar suggests an account for different patterns of discourse cues, while the different structures and operations suggest three separate sources for elements of discourse meaning: (1) a compositional semantics tied to the basic trees and operations; (2) a presuppositional semantics carried by cue phrases that freely adjoin to trees; and (3) general inference, that draws additional, defeasible conclusions that flesh out what is conveyed compositionally.
14891604
Content and Context Aware Networking Using Semantic Tagging
Today’s model of networking primarily concentrates intelligence at the end hosts with the network itself offering a simple"best-effor","data agnostic" communication medium. However, this paradigm has proven to be insufficient to meet todays needs considering the diversity of applications and devices that are networked. To offer value added services to these end users and applications, more and more intelligence needs to be migrated away from the edges and into the network in a controlled and tractable manner. In this paper, we present our approach of utilizing semantic data tagging to provide content level information for data streams flowing through a network. A policy based management mechanism is utilized within the network fabric allowing routers to reason over the content and make intelligent decisions regarding the handling of data packets. Service differentiation, in-network content adaptation, traffic monitoring and control etc. are some of the new services that can now be offered by the network in a generic and flexible manner. By deploying our proposed architecture, a network need no longer be viewed as a simple data transport medium but rather as a policy-controlled intelligent packet/stream processor that can offer specialized handling based on application needs.
14431382
A Reactive Service Composition Architecture for Pervasive Computing Environments
Development of customized services by integrating and executing existing ones (refered to as service composition) has received a lot of attention in the last few years with respect to wired, infrastrutcure based web-services. With the advancement in the wireless technology and pervasive computing, we envison that in the near future, we will have such information or services embedded in various wireless devices in our vicinity. However, wired infrastructure-based service discovery and composition architectures do not take into consideration factors arising from the possible mobility of the service providers. In this paper, we present Anamika: a distributed, de-centralized and fault-tolerant design architecture for reactive service composition in pervasive environments.
11638124
Measuring benchmark similarity using inherent program characteristics
This paper proposes a methodology for measuring the similarity between programs based on their inherent microarchitecture-independent characteristics, and demonstrates two applications for it: 1) finding a representative subset of programs from benchmark suites and 2) studying the evolution of four generations of SPEC CPU benchmark suites. Using the proposed methodology, we find a representative subset of programs from three popular benchmark suites - SPEC CPU2000, MediaBench, and MiBench. We show that this subset of representative programs can be effectively used to estimate the average benchmark suite IPC, L1 data cache miss-rates, and speedup on 11 machines with different ISAs and microarchitectures - this enables one to save simulation time with little loss in accuracy. From our study of the similarity between the four generations of SPEC CPU benchmark suites, we find that, other than a dramatic increase in the dynamic instruction count and increasingly poor temporal data locality, the inherent program characteristics have more or less remained unchanged
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.
8926252
Enhanced Service Discovery in Bluetooth
The rapid evolution and expansion of wireless-enabled environments have increased the need for sophisticated service discovery protocols (SDPs). Typically, service discovery involves a client, service provider, and lookup or directory server. The paper discusses Bluetooth (http://www.bluetooth.com) short-range wireless technology. The Bluetooth protocol stack includes specifications that define the SDP, RFCOMM (for cable replacement), the logical link control and adaptation protocol (L2CAP), a host controller interface (HCI), the link manager protocol (LMP), the base-band protocol, and a radio frequency (RF) protocol. The paper considers Bluetooth service discovery improvements with semantic matching.