We develop a novel autonomous control synthesis strategy called Phase Space Navigator for the automatic synthesis of nonlinear control systems. The Phase Space Navigator generates global control laws by synthesizing flow shapes of dynamical systems and planning and navigating system…

Stephane Bressan ... [et al.], "October, 1999.", Includes bibliographical references (p. 13-14).

Most knowledge representation languages are based on classes and taxonomic relationships between classes. Taxonomic hierarchies without defaults or exceptions are semantically equivalent to a collection of formulas in first order predicate calculus. Although designers of knowledge representation languages often express…

Mark Klein., "October 1999.", Includes bibliographical references (p. 15-16).

This paper reports work in progress on an experimental text editor called CREF, the Cross Referenced Editing Facility. CREF deals with chunks of text, called segments, which may have associated features such as keywords or various kinds of links to…

by Fadi S. Chehayeb., Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Civil Engineering, 1987., M.I.T. copy lacks leaf 4., Bibliography: v. 2, leaves 238-240.

With the rapid increase in low-cost and sophisticated digital technology the need for techniques to authenticate digital material will become more urgent. In this paper we address the problem of authenticating digital signals assuming no explicit prior knowledge of the…

Strategic management as an academic field of study has spanned over four decades. As an interdisciplinary subject that enjoys concurrent contributions by allied disciplines such as economics and social science, numerous industries have benefited from applying tools and concepts developed…

(cont.) In this blurred area, a project/group-based curriculum can be developed to involve casual work areas that can fluctuate in size, based on the specifications of the project. Through the cultivation of this type of environment, the social energies of…

We consider the scheduling problem of minimizing the average weighted completion time of n jobs with release dates on a single machine. We first study two linear programming relaxations of the problem, one based on a time-indexed formulation, the other…