Topological Repairing of 3D Digital Images

We present here a new randomized algorithm for repairing the topology of objects represented by 3D binary digital images. By “repairing the topology”, we mean a systematic way of modifying a given binary image in order to produce a similar binary image which is guaranteed to be well-composed. A 3D binary digital image is said to be well-composed if, and only if, the square faces shared by background and foreground voxels form a 2D manifold. Well-composed images enjoy some special properties which can make such images very desirable in practical applications. For instance, well-known algorithms for extracting surfaces from and thinning binary images can be simplified and optimized for speed if the input image is assumed to be well-composed. Furthermore, some algorithms for computing surface curvature and extracting adaptive triangulated surfaces, directly from the binary data, can only be applied to well-composed images. Finally, we introduce an extension of the aforementioned algorithm to repairing 3D digital multivalued images. Such an algorithm finds application in repairing segmented images resulting from multi-object segmentations of other 3D digital multivalued images.

The Structure of Visual Spaces

The “visual space” of an optical observer situated at a single, fixed viewpoint is necessarily very ambiguous. Although the structure of the “visual field” (the lateral dimensions, i.e., the “image”) is well defined, the “depth” dimension has to be inferred from the image on the basis of “monocular depth cues” such as occlusion, shading, etc. Such cues are in no way “given”, but are guesses on the basis of prior knowledge about the generic structure of the world and the laws of optics. Thus such a guess is like a hallucination that is used to tentatively interpret image structures as depth cues. The guesses are successful if they lead to a coherent interpretation. Such “controlled hallucination” (in psychological terminology) is similar to the “analysis by synthesis” of computer vision. Although highly ambiguous, visual spaces do have geometrical structure. The group of ambiguities left open by the cues (e.g., the well known bas-relief ambiguity in the case of shape from shading) may be interpreted as the group of congruences (proper motions) of the space. The general structure of visual spaces for different visual fields is explored in the paper. Applications include improved viewing systems for optical man-machine interfaces.     

Decentralised control of chromatographic simulated moving bed processes based on wave front reconstruction

The behaviour of chromatographic simulated moving bed processes is described by the movement of concentration profiles through a circle of separation columns. A closed-loop control manipulates the profiles in order to meet demands concerning specified product purity and disturbance attenuation. If steep wave fronts of the concentration profiles occur, the controlled variables undergo fast changes in case of a transient of the process. In this case, a reconstruction of the wave fronts is necessary for a successful control.A simple and effective decentralised controller structure is proposed based on cascaded discrete-time PI controllers. On-line product purity measurements and the reconstructed wave fronts are used for control purposes. Two kinds of process models are used: a rigorous model for dynamic simulations, and strongly simplified plant models for the design of the wave front reconstruction and the controller. The latter models are identified based on experimental step tests with the reference plant and numerical simulations. The performance of the control system is evaluated by numerical simulations.     

Disjunctive databases for representing repairs

This paper addresses the problem of representing the set of repairs of a possibly inconsistent database by means of a disjunctive database. Specifically, the class of denial constraints is considered. We show that, given a database and a set of denial constraints, there exists a (unique) disjunctive database, called canonical, which represents the repairs of the database w.r.t. the constraints and is contained in any other disjunctive database with the same set of minimal models. We propose an algorithm for computing the canonical disjunctive database. Finally, we study the size of the canonical disjunctive database in the presence of functional dependencies for both subset-based repairs and cardinality-based repairs.     

An investigation of the option space in conceptual building design for advanced building simulation

This article describes research conducted to gather empirical evidence on size, character and content of the option space in building design projects. This option space is the key starting point for the work of any climate engineer using building performance simulation who is supporting the design process. The underlying goal is to strengthen the role of advanced computing in building design, especially in the early conceptual stage, through a better integration of building performance simulation tools augmented with uncertainty analysis and sensitivity analysis. Better integration will need to assist design rather than automate design, allowing a spontaneous, creative and flexible process that acknowledges the expertise of the design team members. This research investigates and contrasts emergent option spaces and their inherent uncertainties in an artificial setting (student design studios) and in real-life scenarios (commercial design project case studies). The findings provide empirical evidence of the high variability of the option space that can be subjected to uncertainty analysis and sensitivity analysis.     

Knowledge assessment-practical example in testing

Knowledge assessment is inseparable part of current e-learning technologies. It can be used for self-assessment of students to give them feedback about their progress in a study or for an intermediate or final grading for tutors. However, knowledge tests are not developed with the adequate care. Author＇s experience in the area of knowledge assessment led to a confidence the ＂unstructured＂ testing is usually used in this process. It means that many of knowledge tests are not designed to reveal the reached level of knowledge. Moreover, testing suites are reviewed very seldom regarding their validity and items correlation. This paper presents experiences gained during the design and implementation of specific software focused on teaching several principles of the Unix-like operating systems. The structure of the specific assignment follows the Bloom＇s taxonomy of educational objectives.     

A cost-effective lexical acquisition process for large-scale thesaurus translation

Thesauri and controlled vocabularies facilitate access to digital collections by explicitly representing the underlying principles of organization. Translation of such resources into multiple languages is an important component for providing multilingual access. However, the specificity of vocabulary terms in most thesauri precludes fully-automatic translation using general-domain lexical resources. In this paper, we present an efficient process for leveraging human translations to construct domain-specific lexical resources. This process is illustrated on a thesaurus of 56,000 concepts used to catalog a large archive of oral histories. We elicited human translations on a small subset of concepts, induced a probabilistic phrase dictionary from these translations, and used the resulting resource to automatically translate the rest of the thesaurus. Two separate evaluations demonstrate the acceptability of the automatic translations and the cost-effectiveness of our approach.

DuD Recht

DuD Recht

DuD Recht     

Tracing pathway activities with kinase inhibitors and reverse phase protein arrays

Controlling aberrant protein kinase activity is a promising strategy for a variety of diseases, particularly cancer. Hence, the development of kinase inhibitors is currently a focal point for pharmaceutical research. In this study we utilize a chip-based reverse phase protein array (RPA) platform for profiling of kinase inhibitors in cell-based assays. In combination with the planar wave-guide technology the assay system has an absolute LOD down to the low zeptomole range. A431 cell lysates were analyzed for the activation state of key effectors in the epidermal growth factor (EGF) and insulin signaling pathways to validate this model for compound screening. A microtiter-plate format for growing, treating, and lysing cells was shown to be suitable for this approach, establishing the value of the technology as a screening tool for characterization of large numbers of kinase inhibitors against a wide variety of cellular signaling pathways. Moreover, the reverse array format allows rapid development of site-specific phosphorylation assays, since in contrast to ELISA type systems only a single antigen-specific antibody is required.