Curved focal plane detector array for wide field cameras

Miniaturization is the main goal for system design in future cameras. This paper offers a novel method to scale down the optical system and to improve the image quality. As with the human retina, the detector array is spherically bent to fit the curved image surface; so the field curvature aberration is directly suppressed, leading to a better resolution and a simplified optical design. By thinning the substrate, the device is monolithically curved without modifying the fabrication process of the active pixels. Optical characterizations have been performed on planar and curved focal plane based cameras to illustrate the optical advantages of detector array curvature.     

The connection between an event structure semantics and an operational semantics forTCSP

The relation between an operational interleaving semantics forTSCP based on a transition system and a compositional true concurrency semantics based on event structures is studied. In particular we extend the consistency result of Goltz and Loogan [15] forTCSP processes without recursion to the general case. Thus we obtain for everyTCSP processP that its operational meaningO(P) and the interleaving behaviourO( M3P3) which is derived from the event structureM3P3 associated withP are bisimilar.     

Model checking for a probabilistic branching time logic with fairness

We consider concurrent probabilistic systems, based on probabilistic automata of Segala & Lynch [55], which allow non-deterministic choice between probability distributions. These systems can be decomposed into a collection of “computation trees” which arise by resolving the non-deterministic, but not probabilistic, choices. The presence of non-determinism means that certain liveness properties cannot be established unless fairness is assumed. We introduce a probabilistic branching time logic PBTL, based on the logic TPCTL of Hansson [30] and the logic PCTL of [55], resp. pCTL [14]. The formulas of the logic express properties such as “every request is eventually granted with probability at least p”. We give three interpretations for PBTL on concurrent probabilistic processes: the first is standard, while in the remaining two interpretations the branching time quantifiers are taken to range over a certain kind of fair computation trees. We then present a model checking algorithm for verifying whether a concurrent probabilistic process satisfies a PBTL formula assuming fairness constraints. We also propose adaptations of existing model checking algorithms for pCTL [4, 14] to obtain procedures for PBTL under fairness constraints. The techniques developed in this paper have applications in automatic verification of randomized distributed systems. Received: June 1997 / Accepted: May 1998     

Symbolic Model Checking for Channel-based Component Connectors

The paper reports on the foundations and experimental results with a model checker for component connectors modelled by networks of channels in the calculus Reo. The specification formalisms is a branching time logic that allows to reason about the coordination principles of and the data flow in the network. The underlying model checking algorithm relies on variants of standard automata-based approaches and model checking for CTL-like logics. The implementation uses a symbolic representation of the network and the enabled I/O-operations by means of binary decision diagrams. It has been applied to a couple examples that illustrate the efficiency of our model checker.     

Universal gelling agent for the control of hazardous liquid spills

Under contract to the U.S. Environmental Protection Agency, Calspan Corporation developed methods to treat, control and monitor spilled hazardous materials. One of the most successful spill countermeasures applied was a dry, finely-granulated blend which would, within seconds after contact with spilled liquids, begin their transformation into tough, immobile gels which could be easily controlled and removed. This blend is a “universal gelling agent” in the sense that it can immobilize essentially all hazardous liquid spills without foreknowledge of the liquid composition. The blend contains powdered polymeric components optimized separately for interaction with aqueous liquids, chlorinated organics, alcohols, and nonpolar hydrocarbons. It also contains a fumed silica fluidizer, which provides ease of field application and imparts longer term stiffening of all gels formed. The “universal gelling agent” has been demonstrated to be effective on a variety of medium scale (55-gallon drum) spills on both land and water. For special uses, such as organophosphorus pesticide spill control, the blend can be reformulated to include de-toxifying (oxidizing, hydrolytic) ingredients as well.     

Non-Coherent Pulse Detection with a Large Predetection Bandwidth

For a non-coherent detection circuit with a broad-band pre-detection filter and narrow-band post-detection-filter, equations are obtained for the probability of detection of a pulsed sinusoidal signal embedded in white noise. The equations can be used to calculate the detection probability directly from envelope form, noise power at the input of the circuit and the impulse response of the postdetection filter. The application of the equations is illustrated with reference to a sliding correlator acquisition circuit for PN-code generators.     

The k-Splittable Flow Problem

In traditional multi-commodity flow theory, the task is to send a certain amount of each commodity from its start to its target node, subject to capacity constraints on the edges. However, no restriction is imposed on the number of paths used for delivering each commodity; it is thus feasible to spread the flow over a large number of different paths. Motivated by routing problems arising in real-life applications, e.g., telecommunication, unsplittable flows have moved into the focus of research. Here, the demand of each commodity may not be split but has to be sent along a single path. In this paper a generalization of this problem is studied. In the considered flow model, a commodity can be split into a bounded number of chunks which can then be routed on different paths. In contrast to classical (splittable) flows and unsplittable flows, the single-commodity case of this problem is already NP-hard and even hard to approximate. We present approximation algorithms for the single- and multi-commodity case and point out strong connections to unsplittable flows. Moreover, results on the hardness of approximation are presented. In particular, we show that some of our approximation results are in fact best possible, unless P = NP.     

Symbolic model checking for channel-based component connectors

This paper introduces a temporal logic framework to reason about the coordination mechanisms and data flow of exogenous coordination models. We take a CTL-like branching time logic, augmented with regular expressions that specify the observable I/O-operations, as a starting point. The paper provides the syntax and semantics of our logic and introduces the corresponding model checking algorithm. The second part of the paper reports an implementation that relies on a symbolic representation of the coordination network and the connected components by means of binary decision diagrams. A couple of examples are given to illustrate the efficiency of the model checking techniques and their implementation.