On the Complexity of Case-Based Planning

We analyze the computational complexity of problems related to case-based planning: planning when a plan for a similar instance is known, and planning from a library of plans. We prove that planning from a single case has the same complexity than generative planning (i.e., planning "from scratch"); using an extended definition of cases, complexity is reduced if the domain stored in the case is similar to the one to search plans for. Planning from a library of cases is shown to have the same complexity. In both cases, the complexity of planning remains, in the worst case, PSPACE-complete

Space Charge Limited 2-d Electron Flow between Two Flat Electrodes in a Strong Magnetic Field

An approximate analytic solution is constructed for the 2-d space charge limited emission by a cathode surrounded by non emitting conducting ledges of width Lambda. An essentially exact solution (via conformal mapping) of the electrostatic problem in vacuum is matched to the solution of a linearized problem in the space charge region whose boundaries are sharp due to the presence of a strong magnetic field. The current density growth in a narrow interval near the edges of the cathode depends strongly on Lambda. We obtain an empirical formula for the total current as a function of Lambda which extends to more general cathode geometries.Comment: 4 pages, LaTex, e-mail addresses: [email protected], [email protected]

High Efficiency Plastic Scintillator Detector with Wave-Length Shifting Fiber Readout for the GLAST Large Area Telescope

This paper describes the design and performance studies of the scintillator tile detectors for the Anti-Coincidence Detector (ACD) of the Large Area Telescope (LAT) on the Gamma ray Large Area Space Telescope (GLAST), scheduled for launch in early 2008. The scintillator tile detectors utilize wavelength shifting fibers and have dual photomultiplier tube (PMT) readout. The design requires highly efficient and uniform detection of singly charged relativistic particles over the tile area and must meet all requirements for a launch, as well as operation in a space environment. We present here the design of three basic types of tiles used in the ACD, ranging in size from approx.450 sq cm to approx.2500 sq cm, all 1 cm thick, with different shapes, and with photoelectron yield of approx. 20 photoelectrons per minimum ionizing particle (mip) at normal tile incidence, uniform over the tile area. Some tiles require flexible clear fiber cables up to 1.5 m long to deliver scintillator light to remotely located PMT

Measurement of the CMS Magnetic Field

The measurement of the magnetic field in the tracking volume inside the superconducting coil of the Compact Muon Solenoid (CMS) detector under construction at CERN is done with a fieldmapper designed and produced at Fermilab. The fieldmapper uses 10 3-D B-sensors (Hall probes) developed at NIKHEF and calibrated at CERN to precision 0.05% for a nominal 4 T field. The precise fieldmapper measurements are done in 33840 points inside a cylinder of 1.724 m radius and 7 m long at central fields of 2, 3, 3.5, 3.8, and 4 T. Three components of the magnetic flux density at the CMS coil maximum excitation and the remanent fields on the steel-air interface after discharge of the coil are measured in check-points with 95 3-D B-sensors located near the magnetic flux return yoke elements. Voltages induced in 22 flux-loops made of 405-turn installed on selected segments of the yoke are sampled online during the entire fast discharge (190 s time-constant) of the CMS coil and integrated offline to provide a measurement of the initial magnetic flux density in steel at the maximum field to an accuracy of a few percent. The results of the measurements made at 4 T are reported and compared with a three-dimensional model of the CMS magnet system calculated with TOSCA.Comment: 4 pages, 5 figures, 15 reference

Algebraic Properties of Qualitative Spatio-Temporal Calculi

Qualitative spatial and temporal reasoning is based on so-called qualitative calculi. Algebraic properties of these calculi have several implications on reasoning algorithms. But what exactly is a qualitative calculus? And to which extent do the qualitative calculi proposed meet these demands? The literature provides various answers to the first question but only few facts about the second. In this paper we identify the minimal requirements to binary spatio-temporal calculi and we discuss the relevance of the according axioms for representation and reasoning. We also analyze existing qualitative calculi and provide a classification involving different notions of a relation algebra.Comment: COSIT 2013 paper including supplementary materia

Allen's Interval Algebra Makes the Difference

Allen's Interval Algebra constitutes a framework for reasoning about temporal information in a qualitative manner. In particular, it uses intervals, i.e., pairs of endpoints, on the timeline to represent entities corresponding to actions, events, or tasks, and binary relations such as precedes and overlaps to encode the possible configurations between those entities. Allen's calculus has found its way in many academic and industrial applications that involve, most commonly, planning and scheduling, temporal databases, and healthcare. In this paper, we present a novel encoding of Interval Algebra using answer-set programming (ASP) extended by difference constraints, i.e., the fragment abbreviated as ASP(DL), and demonstrate its performance via a preliminary experimental evaluation. Although our ASP encoding is presented in the case of Allen's calculus for the sake of clarity, we suggest that analogous encodings can be devised for other point-based calculi, too.Comment: Part of DECLARE 19 proceeding

Modeling sediment mobilization using a distributed hydrological model coupled with a bank stability model

In addition to surface erosion, stream bank erosion and failure contributes significant sediment and sediment-bound nutrients to receiving waters during high flow events. However, distributed and mechanistic simulation of stream bank sediment contribution to sediment loads in a watershed has not been achieved. Here we present a full coupling of existing distributed watershed and bank stability models and apply the resulting model to the Mad River in central Vermont. We fully coupled the Bank Stability and Toe Erosion Model (BSTEM) with the Distributed Hydrology Soil Vegetation Model (DHSVM) to allow the simulation of stream bank erosion and potential failure in a spatially explicit environment. We demonstrate the model\u27s ability to simulate the impacts of unstable streams on sediment mobilization and transport within a watershed and discuss the model\u27s capability to simulate watershed sediment loading under climate change. The calibrated model simulates total suspended sediment loads and reproduces variability in suspended sediment concentrations at watershed and subbasin outlets. In addition, characteristics such as land use and road-to-stream ratio of subbasins are shown to impact the relative proportions of sediment mobilized by overland erosion, erosion of roads, and stream bank erosion and failure in the subbasins and watershed. This coupled model will advance mechanistic simulation of suspended sediment mobilization and transport from watersheds, which will be particularly valuable for investigating the potential impacts of climate and land use changes, as well as extreme events

Modal Logics of Topological Relations

Logical formalisms for reasoning about relations between spatial regions play a fundamental role in geographical information systems, spatial and constraint databases, and spatial reasoning in AI. In analogy with Halpern and Shoham's modal logic of time intervals based on the Allen relations, we introduce a family of modal logics equipped with eight modal operators that are interpreted by the Egenhofer-Franzosa (or RCC8) relations between regions in topological spaces such as the real plane. We investigate the expressive power and computational complexity of logics obtained in this way. It turns out that our modal logics have the same expressive power as the two-variable fragment of first-order logic, but are exponentially less succinct. The complexity ranges from (undecidable and) recursively enumerable to highly undecidable, where the recursively enumerable logics are obtained by considering substructures of structures induced by topological spaces. As our undecidability results also capture logics based on the real line, they improve upon undecidability results for interval temporal logics by Halpern and Shoham. We also analyze modal logics based on the five RCC5 relations, with similar results regarding the expressive power, but weaker results regarding the complexity