An Information Theory framework for two-stage binary image operator design

The design of translation invariant and locally defined binary image operators over large windows is made difficult by decreased statistical precision and increased training time. We present a complete framework for the application of stacked design, a recently proposed technique to create two-stage operators that circumvents that difficulty. We propose a novel algorithm, based on Information Theory, to find groups of pixels that should be used together to predict the Output Value. We employ this algorithm to automate the process of creating a set of first-level operators that are later combined in a global operator. We also propose a principled way to guide this combination, by using feature selection and model comparison. Experimental results Show that the proposed framework leads to better results than single stage design. (C) 2009 Elsevier B.V. All rights reserved.

COMMUNICATION AND INFORMATION BARRIERS TO HEALTH ASSISTANCE FOR DEAF PATIENTS

IN BRAZIL, recent regulations require changes in private and public health systems to make special services available to deaf patients. in the present article, the researchers analyze the perceptions of 25 sign language using patients regarding this assistance. The researchers found communication difficulties between these patients and health services staff, as well as a culture clash and a harmful inability among the service providers to distinguish among the roles of companions, caretakers, and professional translator/interpreters. Thus, it became common for the patients to experience prejudice in the course of treatment and information exchange, damage to their autonomy, limits on their access to services, and reduced efficacy of therapy. The researchers conclude that many issues must be dealt with if such barriers to health access are to be overcome, in particular the worrying degree of exclusion of deaf patients from health care systems.

Efficient bulk-loading on dynamic metric access methods

This paper presents a new technique and two algorithms to bulk-load data into multi-way dynamic metric access methods, based on the covering radius of representative elements employed to organize data in hierarchical data structures. The proposed algorithms are sample-based, and they always build a valid and height-balanced tree. We compare the proposed algorithm with existing ones, showing the behavior to bulk-load data into the Slim-tree metric access method. After having identified the worst case of our first algorithm, we describe adequate counteractions in an elegant way creating the second algorithm. Experiments performed to evaluate their performance show that our bulk-loading methods build trees faster than the sequential insertion method regarding construction time, and that it also significantly improves search performance. (C) 2009 Elsevier B.V. All rights reserved.

A bivariate regression model for matched paired survival data: local influence and residual analysis

The use of bivariate distributions plays a fundamental role in survival and reliability studies. In this paper, we consider a location scale model for bivariate survival times based on the proposal of a copula to model the dependence of bivariate survival data. For the proposed model, we consider inferential procedures based on maximum likelihood. Gains in efficiency from bivariate models are also examined in the censored data setting. For different parameter settings, sample sizes and censoring percentages, various simulation studies are performed and compared to the performance of the bivariate regression model for matched paired survival data. Sensitivity analysis methods such as local and total influence are presented and derived under three perturbation schemes. The martingale marginal and the deviance marginal residual measures are used to check the adequacy of the model. Furthermore, we propose a new measure which we call modified deviance component residual. The methodology in the paper is illustrated on a lifetime data set for kidney patients.

ALGEBRAIC AND GEOMETRIC THEORY OF THE TOPOLOGICAL RING OF COLOMBEAU GENERALIZED FUNCTIONS

We continue the investigation of the algebraic and topological structure of the algebra of Colombeau generalized functions with the aim of building up the algebraic basis for the theory of these functions. This was started in a previous work of Aragona and Juriaans, where the algebraic and topological structure of the Colombeau generalized numbers were studied. Here, among other important things, we determine completely the minimal primes of (K) over bar and introduce several invariants of the ideals of 9(Q). The main tools we use are the algebraic results obtained by Aragona and Juriaans and the theory of differential calculus on generalized manifolds developed by Aragona and co-workers. The main achievement of the differential calculus is that all classical objects, such as distributions, become Cl-functions. Our purpose is to build an independent and intrinsic theory for Colombeau generalized functions and place them in a wider context.