Algorithm for spline-based elastic registration in application to confocal images of gene expression

We perform elastic registration by an algorithm based on a pixelwise and regularized optimization criterion. We express the deformation field thanks to B-splines, which allows us to deal with a rich variety of deformations. The algorithm is able to handle soft landmark constraints, which is particularly useful when parts of the images contain very little information, or when it is unevenly distributed. We solve the problem by minimizing the distance between the target image and the warped source. We regularize this minimization problem by divergence and curl. We apply the proposed algorithm to the registration of the confocal scanning microscopy images of Drosophila embryos. The text was submitted by the authors in English.     

Belief extrapolation (or how to reason about observations and unpredicted change)

We give a logical framework for reasoning with observations at different time points. We call belief extrapolation the process of completing initial belief sets stemming from observations by assuming minimal change. We give a general semantics and we propose several extrapolation operators. We study some key properties verified by these operators and we address computational issues. We study in detail the position of belief extrapolation with respect to revision and update: in particular, belief extrapolation is shown to be a specific form of time-stamped belief revision. Several related lines of work are positioned with respect to belief extrapolation.     

An object-oriented database system Jasmine: implementation,application, and extension

We have devised an object oriented DBMS called Jasmine for advanced applications. The paper describes the implementation, application and extension of Jasmine in detail. We focus on the impact of the design of its object oriented model and language on database implementation technology. We describe what part of traditional relational database technology we extend to handle object oriented features such as object identifiers, complex objects, class hierarchies, and methods. We introduce nested relations to efficiently store and access clustered complex objects. We use hash based methods to efficiently access nonclustered complex objects. We provide user defined functions directly evaluated on page buffers to efficiently process method invocation. We devise object oriented optimization of queries including class hierarchies, complex objects, and method invocation. We incorporate dedicated object buffering to allow efficient access to objects through object identifiers. We also describe nontrivial applications of Jasmine and discuss the validity of object oriented databases. We focus on a constraint management facility, which can be implemented by taking advantage of the extensibility of Jasmine. The facility includes constraint rules, called design goals, for automatic database population required by engineering applications. Finally, we describe a view facility for schema integration also needed by engineering applications in distributed environments. We focus on how we extend Jasmine to implement the facility     

Edge image quality assessment: a new formulation for degraded edge imaging

We discuss a formalism to characterize degraded edge images formed in a diffraction limited system (with circular pupil of unit radius) under conditions of incoherent illumination. We introduce a novel definition of degraded edges and consider this approach to model a basic optical mechanism involved in the perception of visual depth and edge detection. We introduce a degradation parameter to quantize the degree of edge blur. We present a generalization of such a procedure by assuming the Heaviside function to be a systematic generator of degraded edges. We reproduce experimentally the predictions made by the formalism proposed herein.     

PADUA: a protocol for argumentation dialogue using association rules

We describe PADUA, a protocol designed to support two agents debating a classification by offering arguments based on association rules mined from individual datasets. We motivate the style of argumentation supported by PADUA, and describe the protocol. We discuss the strategies and tactics that can be employed by agents participating in a PADUA dialogue. PADUA is applied to a typical problem in the classification of routine claims for a hypothetical welfare benefit. We particularly address the problems that arise from the extensive number of misclassified examples typically found in such domains, where the high error rate is a widely recognised problem. We give examples of the use of PADUA in this domain, and explore in particular the effect of intermediate predicates. We have also done a large scale evaluation designed to test the effectiveness of using PADUA to detect misclassified examples, and to provide a comparison with other classification systems.     

Tracking the effectiveness of usability evaluation methods

. We present a case study that tracks usability problems predicted with six usability evaluation methods (claims analysis, cognitive walkthrough, GOMS, heuristic evaluation, user action notation, and simply reading the specification) through a development process. We assess the method's predictive power by comparing the predictions to the results of user tests. We assess the method's persuasive power by seeing how many problems led to changes in the implemented code. We assess design-change effectiveness by user testing the resulting new versions of the system. We concludethatpredictivemethodsarenot as effective as the HCI field would like and discuss directions for future research.     

Jordan triple disystems

We take an algorithmic and computational approach to a basic problem in abstract algebra: determining the correct generalization to dialgebras of a given variety of nonassociative algebras. We give a simplified statement of the KP algorithm introduced by Kolesnikov and Pozhidaev for extending polynomial identities for algebras to corresponding identities for dialgebras. We apply the KP algorithm to the defining identities for Jordan triple systems to obtain a new variety of nonassociative triple systems, called Jordan triple disystems. We give a generalized statement of the BSO algorithm introduced by Bremner and Sánchez-Ortega for extending multilinear operations in an associative algebra to corresponding operations in an associative dialgebra. We apply the BSO algorithm to the Jordan triple product and use computer algebra to verify that the polynomial identities satisfied by the resulting operations coincide with the results of the KP algorithm; this provides a large class of examples of Jordan triple disystems. We formulate a general conjecture expressed by a commutative diagram relating the output of the KP and BSO algorithms. We conclude by generalizing the Jordan triple product in a Jordan algebra to operations in a Jordan dialgebra; we use computer algebra to verify that resulting structures provide further examples of Jordan triple disystems. For this last result, we also provide an independent theoretical proof using Jordan structure theory.     

Rewritings for Polarized Multiplicative and Exponential Proof Structures

We study conditions for a concurrent construction of proof-nets in the framework of linear logic following Andreoli's works. We define specific correctness criteria for that purpose. We first study the multiplicative case and show how the correctness criterion given by Danos and decidable in linear time, may be extended to closed modules (i.e. validity of polarized proof structures). We then study the exponential case and give a correctness criterion by means of a contraction relation that helps to discover frontiers of exponential boxes.