Modal cities /

Includes bibliographical references.

Analysis of intercity modal split models. Final report.

Transportation Department, Office of the Assistant Secretary for Policy and International Affairs, Washington, D.C.

Trends in federal transportation financial activity, fiscal years 1970-1979 : report number 2, modal distribution of federal transportation obligations and outlays /

"April 1980."

How many meanings for ‘may’? The case for modal polysemy

The standard Kratzerian analysis of modal auxiliaries, such as ‘may’ and ‘can’, takes them to be univocal and context-sensitive. Our first aim is to argue for an alternative view, on which such expressions are polysemous. Our second aim is to thereby shed light on the distinction between semantic context-sensitivity and polysemy. To achieve these aims, we examine the mechanisms of polysemy and context-sensitivity and provide criteria with which they can be held apart. We apply the criteria to modal auxiliaries and show that the default hypothesis should be that they are polysemous, and not merely context-sensitive. We then respond to arguments against modal ambiguity (and thus against polysemy). Finally, we show why modal polysemy has significant philosophical implications.

Experimental modal analysis and dynamic component synthesis

Mode of access: Internet.

Comics Explosion: Representations of Persecution in Graphic Narrative, 1995-2015

Thesis (Ph.D.)--University of Washington, 2016-06

Modal characteristics of a flexible beam with multiple distributed actuators

A flexible structure with surface-bonded piezoceramic patches is modelled using Timoshenko beam theory. Exact mode shapes and natural frequencies associated with the flexural motion are computed for various piezoceramic distributed actuator arrangements. The effects of patch placement and of shear on the modal characteristics are demonstrated using a cantilevered beam as an example. Perfect bonding of the piezoceramic to the beam substructure is assumed, and for the purposes of this paper only passive piezoceramic properties are considered. The modelling technique and results obtained in a closed form are intended to assist investigations into the modelling and control of active structures with surface-bonded piezoceramic actuators. (C) 2003 Elsevier Science Ltd. All rights reserved.

On the relative complexity of labelled modal tableaux

We investigate the relative complexity of two free-variable labelled modal tableaux(KEM and Single Step Tableaux, SST). We discuss the reasons why p-simulation is not a proper measure of the relative complexity of tableaux-like proof systems, and we propose an improved comparison scale (p-search-simulation). Finally we show that KEM p-search-simulates SST while SST cannot p-search-simulate KEM.

Minimum description length, regularisation and multi-modal data

Relationships between clustering, description length, and regularisation are pointed out, motivating the introduction of a cost function with a description length interpretation and the unusual and useful property of having its minimum approximated by the densest mode of a distribution. A simple inverse kinematics example is used to demonstrate that this property can be used to select and learn one branch of a multi-valued mapping. This property is also used to develop a method for setting regularisation parameters according to the scale on which structure is exhibited in the training data. The regularisation technique is demonstrated on two real data sets, a classification problem and a regression problem.

Minimum description length, regularisation and multi-modal data

Conventional feed forward Neural Networks have used the sum-of-squares cost function for training. A new cost function is presented here with a description length interpretation based on Rissanen's Minimum Description Length principle. It is a heuristic that has a rough interpretation as the number of data points fit by the model. Not concerned with finding optimal descriptions, the cost function prefers to form minimum descriptions in a naive way for computational convenience. The cost function is called the Naive Description Length cost function. Finding minimum description models will be shown to be closely related to the identification of clusters in the data. As a consequence the minimum of this cost function approximates the most probable mode of the data rather than the sum-of-squares cost function that approximates the mean. The new cost function is shown to provide information about the structure of the data. This is done by inspecting the dependence of the error to the amount of regularisation. This structure provides a method of selecting regularisation parameters as an alternative or supplement to Bayesian methods. The new cost function is tested on a number of multi-valued problems such as a simple inverse kinematics problem. It is also tested on a number of classification and regression problems. The mode-seeking property of this cost function is shown to improve prediction in time series problems. Description length principles are used in a similar fashion to derive a regulariser to control network complexity.