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.

ENO adaptive method for solving one-dimensional conservation laws

In this work an efficient third order non-linear finite difference scheme for solving adaptively hyperbolic systems of one-dimensional conservation laws is developed. The method is based oil applying to the solution of the differential equation an interpolating wavelet transform at each time step, generating a multilevel representation for the solution, which is thresholded and a sparse point representation is generated. The numerical fluxes obtained by a Lax-Friedrichs flux splitting are evaluated oil the sparse grid by an essentially non-oscillatory (ENO) approximation, which chooses the locally smoothest stencil among all the possibilities for each point of the sparse grid. The time evolution of the differential operator is done on this sparse representation by a total variation diminishing (TVD) Runge-Kutta method. Four classical examples of initial value problems for the Euler equations of gas dynamics are accurately solved and their sparse solutions are analyzed with respect to the threshold parameters, confirming the efficiency of the wavelet transform as an adaptive grid generation technique. (C) 2008 IMACS. Published by Elsevier B.V. All rights reserved.

A DISCRETIZATION SCHEME FOR AN ONE-DIMENSIONAL REACTION-DIFFUSION EQUATION WITH DELAY AND ITS DYNAMICS

The goal of this paper is to present an approximation scheme for a reaction-diffusion equation with finite delay, which has been used as a model to study the evolution of a population with density distribution u, in such a way that the resulting finite dimensional ordinary differential system contains the same asymptotic dynamics as the reaction-diffusion equation.

On automorphisms of split metacyclic groups

Let D( m, n; k) be the semi-direct product of two finite cyclic groups Z/m = < x > and Z/n = < y >, where the action is given by yxy(-1) = x(k). In particular, this includes the dihedral groups D(2m). We calculate the automorphism group Aut (D(m, n; k)).

The bound quiver of a split extension

In this paper, we give a sufficient (which is also necessary under a compatibility hypothesis) condition on a set of arrows in the quiver of an algebra A so that A is a split extension of A/M, where M is the ideal of A generated by the classes of these arrows. We also compare the notion of split extension with that of semiconvex extension of algebras.

An eigenvalue problem for the biharmonic operator on Z(2)-symmetric regions

In this work we show that the eigenvalues of the Dirichlet problem for the biharmonic operator are generically simple in the set Of Z(2)-symmetric regions of R-n, n >= 2, with a suitable topology. To accomplish this, we combine Baire`s lemma, a generalised version of the transversality theorem, due to Henry [Perturbation of the boundary in boundary value problems of PDEs, London Mathematical Society Lecture Note Series 318 (Cambridge University Press, 2005)], and the method of rapidly oscillating functions developed in [A. L. Pereira and M. C. Pereira, Mat. Contemp. 27 (2004) 225-241].

Timelike Christoffel pairs in the split-quaternions

We characterize the Christoffel pairs of timelike isothermic surfaces in the four-dimensional split-quaternions. When restricting the receiving space to the three-dimensional imaginary split-quaternions, we establish an equivalent condition for a timelike surface in R(2)(3) to be real or complex isothermic in terms of the existence of integrating factors.

Fast batch injection analysis of H(2)O(2) using an array of Pt-modified gold microelectrodes obtained from split electronic chips

A fast and robust analytical method for amperometric determination of hydrogen peroxide (H(2)O(2)) based on batch injection analysis (BIA) on an array of gold microelectrodes modified with platinum is proposed. The gold microelectrode array (n = 14) was obtained from electronic chips developed for surface mounted device technology (SMD), whose size offers advantages to adapt them in batch cells. The effect of the dispensing rate, volume injected, distance between the platinum microelectrodes and the pipette tip, as well as the volume of solution in the cell on the analytical response were evaluated. The method allows the H(2)O(2) amperometric determination in the concentration range from 0.8 mu mol L(-1) to 100 mu mol L(-1). The analytical frequency can attain 300 determinations per hour and the detection limit was estimated in 0.34 mu mol L(-1) (3 sigma). The anodic current peaks obtained after a series of 23 successive injections of 50 mu L of 25 mu mol L(-1) H(2)O(2) showed an RSD < 0.9%. To ensure the good selectivity to detect H(2)O(2), its determination was performed in a differential mode, with selective destruction of the H(2)O(2) with catalase in 10 mmol L(-1) phosphate buffer solution. Practical application of the analytical procedure involved H(2)O(2) determination in rainwater of Sao Paulo City. A comparison of the results obtained by the proposed ampermetric method with another one which combines flow injection analysis (FIA) with spectrophotometric detection showed good agreement. (C) 2011 Elsevier B.V. All rights reserved.

Use Multilevel Graph Partitioning Scheme to solve traveling salesman problem

The traveling salesman problem is although looking very simple problem but it is an important combinatorial problem. In this thesis I have tried to find the shortest distance tour in which each city is visited exactly one time and return to the starting city. I have tried to solve traveling salesman problem using multilevel graph partitioning approach.Although traveling salesman problem itself very difficult as this problem is belong to the NP-Complete problems but I have tried my best to solve this problem using multilevel graph partitioning it also belong to the NP-Complete problems. I have solved this thesis by using the k-mean partitioning algorithm which divides the problem into multiple partitions and solving each partition separately and its solution is used to improve the overall tour by applying Lin Kernighan algorithm on it. Through all this I got optimal solution which proofs that solving traveling salesman problem through graph partition scheme is good for this NP-Problem and through this we can solved this intractable problem within few minutes.Keywords: Graph Partitioning Scheme, Traveling Salesman Problem.

What aspects of rehabilitation provision contribute to self-reported met needs for rehabilitation one year after stroke - amount, place, operator or timing?

BACKGROUND AND OBJECTIVE: To a large extent, people who have suffered a stroke report unmet needs for rehabilitation. The purpose of this study was to explore aspects of rehabilitation provision that potentially contribute to self-reported met needs for rehabilitation 12 months after stroke with consideration also to severity of stroke. METHODS: The participants (n = 173) received care at the stroke units at the Karolinska University Hospital, Sweden. Using a questionnaire, the dependent variable, self-reported met needs for rehabilitation, was collected at 12 months after stroke. The independent variables were four aspects of rehabilitation provision based on data retrieved from registers and structured according to four aspects: amount of rehabilitation, service level (day care rehabilitation, primary care rehabilitation and home-based rehabilitation), operator level (physiotherapist, occupational therapist, speech therapist) and time after stroke onset. Multivariate logistic regression analyses regarding the aspects of rehabilitation were performed for the participants who were divided into three groups based on stroke severity at onset. RESULTS: Participants with moderate/severe stroke who had seen a physiotherapist at least once during each of the 1st, 2nd and 3rd-4th quarters of the first year (OR 8.36, CI 1.40-49.88 P = 0.020) were more likely to report met rehabilitation needs. CONCLUSION: For people with moderate/severe stroke, continuity in rehabilitation (preferably physiotherapy) during the first year after stroke seems to be associated with self-reported met needs for rehabilitation.

Teste de comportamento do "split" em seis ações negociadas na Bolsa de Valores de São Paulo

Trata do estudo de caso de seis ações que sofreram Slpit no período de Janeiro de 1980 a dezembro de 1987, utilizando como modelo o teste realizado nos Estados Unidos por Fama, Fisher, Jensen e Roll.

Financial distress as a collapse of incentive scheme

This paper explaina why workers lack motivation near bankruptcy, why they tend to leave companies in financiai distreas, and why thoae who remam require higher compensation. Theae indirect costa of financiai diatresa adie becauae the optimal combination of debt and incentive achem.ea, deaigned to minimize agency costa, ends up underpaying managers when there ia a bankruptcy threat. The paper a1so providea new empirica1 implications on the intera.ction between financiai reatructuring and changea in managerial compensation. Theae predictions are supported by the findings of Gilson and Vetsuypens (1992).