3146872
Towards Automatic Generation of Natural Language Generation Systems
Systems that interact with the user via natural language are in their infancy. As these systems mature and become more complex, it would be desirable for a system developer if there were an automatic method for creating natural language generation components that can produce quality output efficiently. We conduct experiments that show that this goal appears to be realizable. In particular we discuss a natural language generation system that is composed of SPoT, a trainable sentence planner, and FER-GUS, a stochastic surface, realizer. We show how these stochastic NLG components can be made to work together, that they can be ported to new domains with apparent ease, and that such NLG components can be integrated in a real-time dialog system.
15909369
New Models for Improving Supertag Disambiguation
In previous work, supertag disambiguation has been presented as a robust partial parsing technique. In this paper we present two approaches: contextual models, which exploit a variety of features in order to improve supertag performance, and class-based models, which assign sets of supertags to words in order to substantially improve accuracy with only a slight increase in ambiguity.
5871408
Leakage-Aware Energy-Efficient Scheduling of Real-Time Tasks in Multiprocessor Systems
This work targets energy-efficient scheduling of periodic real-time tasks over multiple DVS processors with the considerations of power consumption due to leakage current. A polynomial-time algorithm with a 1.283 approximation bound is proposed when the overheads in turning on/off a processor are negligible. When the overheads are non-negligible, we develop polynomial-time algorithms with a 2 approximation bound. A series of simulation experiments was done for the performance evaluation of the proposed algorithms. The simulation results show that the proposed algorithms could derive schedules very close to optimal solutions.
27587317
An executable specification language for specification understanding in object-oriented specification reuse
System analysis time can be reduced through specification reuse which, however, requires specification understanding. This paper presents an object-oriented executable specification language which reduces understanding time through executing specifications. In addition to being executable, the specification language hides as many classes as possible within subsystems, and explicitly specifies relationships between specification components. This facilitates specification modification. Moreover, the language explicitly specifies interface parameters of specification components. This facilitates specification composition.
9144862
Rules and fuzzy rules in text: concept, extraction and usage
Several concepts and techniques have been imported from other disciplines such as Machine Learning and Artificial Intelligence to the field of textual data. In this paper, we focus on the concept of rule and the management of uncertainty in text applications. The different structures considered for the construction of the rules, the extraction of the knowledge base and the applications and usage of these rules are detailed. We include a review of the most relevant works of the different types of rules based on their representation and their application to most of the common tasks of Information Retrieval such as categorization, indexing and classification.
1963845
Testbed evaluation of navigation and text display techniques in an information-rich virtual environment
The fundamental question for an information-rich virtual environment is how to access and display abstract information. We investigated two existing navigation techniques: hand-centered object manipulation extending ray-casting (HOMER) and go-go navigation, and two text layout techniques: within-the-world display (WWD) and heads-up display (HUD). Four search tasks were performed to measure participants' performance in a densely packed environment. HUD enabled significantly better performance than WWD and the go-go technique enabled better performance than the HOMER technique for most of the tasks. We found that using HOMER navigation combined with the WWD technique was significantly worse than other combinations for difficult naive search tasks. Users also preferred the combination of go-go and HUD for all tasks.
32729841
An Ada-like software process language
Abstract This article presents a new software process language called concurrent software process language (CSPL). CSPL demonstrates a unique approach in combining the Ada-like syntax with UNIX shell semantics within a software process language. The rich Ada constructs allow CSPL to model the complexity in software processes. Meanwhile, the UNIX shell provides process enaction and, more importantly, easy access to powerful UNIX tools. A CSPL prototype has been built on the Sun workstation. Examples illustrate how CSPL can be used to model objects, activities, events, generics, exceptions, etc., in software processes. Moreover, a meta-process is given to depict a process of developing CSPL process programs. Related work and a preliminary evaluation of CSPL are also depicted.