Other Computer Sciences Commons^™

Warcraft Iii - Maps & Benchmark Problems, Nathan R. Sturtevant, Blizzard Corp.

Moving AI Lab: 2D Maps and Benchmark Problems

Maps extracted from Warcraft III from Blizzard Corp. for use and distribution as benchmark problems.

Contains 36 maps and benchmark problem sets, scaled to 512x512 and converted to a simple grid-based format.

Cxquery: A Novel Xml Query Language, Peter Revesz, Yi Chen

School of Computing: Conference and Workshop Papers

XML is becoming the data exchange standard on the Internet. Previously proposed XML query languages, such as XQuery, Quilt, YALT, Lorel, and XML-QL, lack schema definition of the query result; therefore, they are limited for defining views, integrating data, updating, and further querying, all of which are often needed in e-Business applications. We propose a novel XML query language called CXQuery, which defines the schema of the query results explicitly and can easily define views, and integrate, update, and query XML data. In addition, CXQuery can express spatial and spatio-temporal queries using a constraint-based querying approach.

Preface, Alexander Kurz

Engineering Faculty Articles and Research

No abstract provided.

Modal Predicates And Coequations, Alexander Kurz, Jiří Rosický

Engineering Faculty Articles and Research

We show how coalgebras can be presented by operations and equations. This is a special case of Linton’s approach to algebras over a general base category X, namely where X is taken as the dual of sets. Since the resulting equations generalise coalgebraic coequations to situations without cofree coalgebras, we call them coequations. We prove a general co-Birkhoff theorem describing covarieties of coalgebras by means of coequations. We argue that the resulting coequational logic generalises modal logic.

Definability, Canonical Models, And Compactness For Finitary Coalgebraic Modal Logic, Alexander Kurz, Dirk Pattinson

Engineering Faculty Articles and Research

This paper studies coalgebras from the perspective of the finitary observations that can be made of their behaviours. Based on the terminal sequence, notions of finitary behaviours and finitary predicates are introduced. A category Behω(T) of coalgebras with morphisms preserving finitary behaviours is defined. We then investigate definability and compactness for finitary coalgebraic modal logic, show that the final object in Behω(T) generalises the notion of a canonical model in modal logic, and study the topology induced on a coalgebra by the finitary part of the terminal sequence.

Pricing And Product Mix Optimization In Freight Transportation, Michael F. Gorman

MIS/OM/DS Faculty Publications

We propose improved pricing and market mix can improve the profitability of the freight transportation provider through the reduction of equipment repositioning costs. We hypothesize that because of complexities surrounding pricing and equipment repositioning costing, existing pricing strategies in freight transportation fail to fully consider these costs. We test this hypothesis in an applied setting in which Monte Carlo simulation captures the stochasticity of market conditions inherent in the problem. We use a heuristic to improve the nondifferentiable, discontinuous objective function.

Our results from test cases show with high confidence that current prices are not optimal, as indicated by a …