Parallel path consistency

Filtering algorithms are well accepted as a means of speeding up the solution of the consistent labeling problem (CLP). Despite the fact that path consistency does a better job of filtering than arc consistency, AC is still the preferred technique because it has a much lower time complexity. We are implementing parallel path consistency algorithms on multiprocessors and comparing their performance to the best sequential and parallel arc consistency algorithms.^(1,2) (See also work by Kerethoet al. ⁽³⁾ and Kasif⁽⁴⁾) Preliminary work has shown linear performance increases for parallelized path consistency and also shown that in many cases performance is significantly better than the theoretical worst case. These two results lead us to believe that parallel path consistency may be a superior filtering technique. Finally, we have implemented path consistency as an outer product computation and have obtained good results (e.g., linear speedup on a 64K-node Connection Machine 2).     

Built-in test factors in a life cycle cost model

A method is given for incorporating the effects of built-in test (BIT) into the life cycle cost of a given electronic system. A cost model is derived that captures the savings achieved by BIT through reducing the maintenance times, complexity of external test equipment, personnel skill levels, amount of spare parts, and the need for preventive maintenance. The model also includes such design considerations as false alarms, diagnostic errors, undetected faults, BIT hardware failures, and diagnostic ambiguity.     

Theoretical Modeling of Frequency-Chirped Optical Pulses in Birefringent Single-Mode Fibers

We analyze nonlinear coupling of polarized solitons in the presence of initial frequency chirp on the basis of a theoretical model described by a coupled nonlinear Schrödinger equations. We also obtain a threshold condition for the bound state of two polarizations and show analytically that the threshold amplitude for soliton trapping can be controlled by varying the chirp parameter.     

Adding Support for Persistence to CLOS via Its Metaobject Protocol

Language-level support for object persistence frees programmers from having to confront a broad class of database issues from within their applications. By virtue of its metaobject protocol, CLOS is a language whose semantics can be tailored by individual programmers. We used the metaobject protocol to extend CLOS with support for object persistence. Our goal was to obtain a version of CLOS with persistence to which we could easily port a commercial geometric CAD modeling system. We describe the design and implementation of our persistence extension and highlight the strengths and weaknesses exhibited by the CLOS metaobject protocol during our experiment. For many aspects of the implementation we found that the metaobject protocol was ideal. In other cases we had to choose among paying a large performance penalty, extending the protocol, and bypassing the protocol by modifying the language implementation directly.     

Calibrated,Registered Images of an Extended Urban Area

We describe a dataset of several thousand calibrated, time-stamped, geo-referenced, high dynamic range color images, acquired under uncontrolled, variable illumination conditions in an outdoor region spanning several hundred meters. The image data is grouped into several regions which have little mutual inter-visibility. For each group, the calibration data is globally consistent on average to roughly five centimeters and 0 1°, or about four pixels of epipolar registration. All image, feature and calibration data is available for interactive inspection and downloading at http://city.lcs.mit.edu/data.Calibrated imagery is of fundamental interest in a variety of applications. We have made this data available in the belief that researchers in computer graphics, computer vision, photogrammetry and digital cartography will find it of value as a test set for their own image registration algorithms, as a calibrated image set for applications such as image-based rendering, metric 3D reconstruction, and appearance recovery, and as input for existing GIS applications.     

Cognitive engineering of a new telephone operator workstation using COGNET

Many cognitive engineering methodologies for user-centered design involve modeling procedural knowledge; others deal with domain semantics or conceptual models. COGnitive NEwork of Tasks (COGNET) is a framework for modeling human cognition and decision-making which provides an integrated representation of the knowledge, behavioral actions, strategies and problem solving skills used in a domain or task situation, yielding a powerful cognitive engineering tool. A case study of the design of the user interface for a new telephone operator workstation is presented to illustrate the derivation of the design from the components of the COGNET model. The model does not directly convey any specific feature of the interface design, but rather a formal representation of what the user must do with the resulting interface. This information is then evolved through a set of transformations which systematically move toward design features, in a fully traceable manner.

Relevance to industry

With the increasing prevalence of technical systems in complex work domains, cognitive engineering is necessary in designing the user interface for those systems to promote efficient integration of person and machine. The cognitive engineering methodology presented here addresses that need.     

Piazza: mediation and integration infrastructure for Semantic Web data

The Semantic Web envisions a World Wide Web in which data is described with rich semantics and applications can pose complex queries. To this point, researchers have defined new languages for specifying meanings for concepts and developed techniques for reasoning about them, using RDF as the data model. To flourish, the Semantic Web needs to provide interoperability—both between sites with different terminologies and with existing data and the applications operating on them. To achieve this, we are faced with two problems. First, most of the world’s data is available not in RDF but in XML; XML and the applications consuming it rely not only on the domain structure of the data, but also on its document structure. Hence, to provide interoperability between such sources, we must map between both their domain structures and their document structures. Second, data management practitioners often prefer to exchange data through local point-to-point data translations, rather than mapping to common mediated schemas or ontologies.This paper describes the Piazza system, which addresses these challenges. Piazza offers a language for mediating between data sources on the Semantic Web, and it maps both the domain structure and document structure. Piazza also enables interoperation of XML data with RDF data that is accompanied by rich OWL ontologies. Mappings in Piazza are provided at a local scale between small sets of nodes, and our query answering algorithm is able to chain sets mappings together to obtain relevant data from across the Piazza network. We also describe an implemented scenario in Piazza and the lessons we learned from it.     

Testing a Self-Determination Theory Process Model for Promoting Glycemic Control Through Diabetes Self-Management.

A longitudinal study tested the self-determination theory (SDT) process model of health behavior change for glycemic control within a randomized trial of patient activation versus passive education. Glycosylated hemoglobin for patients with Type 2 diabetes (n=159) was assessed at baseline, 6 months, and 12 months. Autonomous motivation and perceived competence were assessed at baseline and 6 months, and the autonomy supportiveness of clinical practitioners was assessed at 3 months. Perceptions of autonomy and competence were promoted by perceived autonomy support, and changes in perceptions of autonomy and competence, in turn, predicted change in glycemic control. Self-management behaviors mediated the relation between change in perceived competence and change in glycemic control. The self-determination process model fit the data well. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Implicit and Implicit–Explicit Strong Stability Preserving Runge–Kutta Methods with High Linear Order

Strong stability preserving (SSP) time discretizations preserve the monotonicity properties satisfied by the spatial discretization when coupled with the first order forward Euler, under a certain time-step restriction. The search for high order strong stability preserving time-stepping methods with high order and large allowable time-step has been an active area of research. It is known that implicit SSP Runge–Kutta methods exist only up to sixth order; however, if we restrict ourselves to solving only linear autonomous problems, the order conditions simplify and we can find implicit SSP Runge–Kutta methods of any linear order. In the current work we find implicit SSP Runge–Kutta methods with high linear order \(p_{lin} \le 9\) and nonlinear orders \(p=2,3,4\), that are optimal in terms of allowable SSP time-step. Next, we formulate a novel optimization problem for implicit–explicit (IMEX) SSP Runge–Kutta methods and find optimized IMEX SSP Runge–Kutta pairs that have high linear order \(p_{lin} \le 7\) and nonlinear orders up to \(p=4\). We also find implicit methods with large linear stability regions that pair with known explicit SSP Runge–Kutta methods. These methods are then tested on sample problems to demonstrate the sharpness of the SSP coefficient and the typical behavior of these methods on test problems.     

Antivirulence Isoquinolone Mannosides: Optimization of the Biaryl Aglycone for FimH Lectin Binding Affinity and Efficacy in the Treatment of Chronic UTI

Uropathogenic E. coli (UPEC) employ the mannose‐binding adhesin FimH to colonize the bladder epithelium during urinary tract infection (UTI). Previously reported FimH antagonists exhibit good potency and efficacy, but low bioavailability and a short half‐life in vivo. In a rational design strategy, we obtained an X‐ray structure of lead mannosides and then designed mannosides with improved drug‐like properties. We show that cyclizing the carboxamide onto the biphenyl B‐ring aglycone of biphenyl mannosides into a fused heterocyclic ring, generates new biaryl mannosides such as isoquinolone 22 (2‐methyl‐4‐(1‐oxo‐1,2‐dihydroisoquinolin‐7‐yl)phenyl α‐d ‐mannopyranoside) with enhanced potency and in vivo efficacy resulting from increased oral bioavailability. N‐Substitution of the isoquinolone aglycone with various functionalities produced a new potent subseries of FimH antagonists. All analogues of the subseries have higher FimH binding affinity than unsubstituted lead 22 , as determined by thermal shift differential scanning fluorimetry assay. Mannosides with pyridyl substitution on the isoquinolone group inhibit bacteria‐mediated hemagglutination and prevent biofilm formation by UPEC with single‐digit nanomolar potency, which is unprecedented for any FimH antagonists or any other antivirulence compounds reported to date.