Effectiveness of the CAGE questionnaire, gamma-glutamyltransferase and mean corpuscular volume of red blood cells as markers for alcohol-related problems in the workplace

Objective: To evaluate the usefulness of gamma-glutamyltransferase (GGT) and mean corpuscular volume (MCV), as well as that of the CAGE questionnaire, in workplace screening for alcohol abuse/dependence. Methods: A total of 183 male employees were submitted to structured interviews (Structured Clinical Interview for DSM-IV 2.0 and CAGE questionnaire). Blood samples were collected. Diagnostic accuracy and odds ratio were determined for the CAGE, GGT and MCV. Results: The CAGE questionnaire presented the best sensitivity for alcohol dependence (91%; specificity, 87.8%) and for alcohol abuse (87.5%, specificity, 80.9%), which increased when the questionnaire was used in combination with GGT (sensitivity, 100% and 87.5%, respectively; specificity, 68% and 61.5, respectively). CAGE positive results and/or alterations in GGT were less likely to occur among employees not presenting alcohol abuse/ dependence than among those presenting such abuse (OR for CAGE = 13, p < 0.05; OR for CAGE-GGT = 11, p < 0.05) or dependence (OR for CAGE = 76, p < 0.0 1; OR for GGT = 5, p < 0.0 1). Employees not presenting alcohol abuse/dependence were also several times more likely to present negative CAGE or GGT results. Conclusions: The use short, simple questionnaires, combined with that of low-cost biochemical markers, such as GGT, can serve as an initial screening for alcohol-related problems, especially for employees in hazardous occupations. The data provided can serve to corroborate clinical findings. (C) 2008 Elsevier Ltd. All rights reserved.

The impact of perinatal and socioeconomic factors on mental health problems of children from a poor Brazilian city: a longitudinal study

Low birth weight and preterm birth, and social disadvantage may negatively affect mental health of children, but findings have been inconsistent. To assess the influence of perinatal and social factors on mental health problems in children aged 7-9 years. A random sample of 805 births in So Luis, Brazil was studied in 1997/1998 and again in 2005/2006. Perinatal, socioeconomic and demographic variables were assessed within 24 h after delivery. The Strengths and Difficulties Questionnaire (SDQ) was used to assess mental health problems in the children. Simple and multiple Poisson regressions were used for statistical analysis. The overall prevalence of mental health problems in the total sample was 47.7%. The prevalences of emotional and conduct problems were 58.2 and 48.8%, respectively. Only paternal age (< 20 years) was associated with mental health problems as measured by the full SDQ scale (prevalence ratio PR = 1.27). Children born to single mothers (PR = 1.31) and those with birth weight from 1,500 to 2,499 g (PR = 1.18) and from 2,500 to 2,999 g (PR = 1.17) had a higher risk of emotional problems, but those from low income families had a lower risk (PR = 0.80). Children with a father of less than 20 years had a higher risk of having problems with their peers (PR = 1.75). A maternal education of 9 years or over was inversely associated with peer (PR = 0.70) and conduct problems (PR = 0.73). Girls had a lower risk of conduct (PR = 0.77) and hyperactivity problems (PR = 0.68). A maternal education of 4 years or less increased the risk of hyperactivity (PR = 1.48). Socioeconomic and demographic conditions were better predictors of mental health problems in children than birth weight or preterm birth. However, since most effect sizes were small most mental health problems were, unexplained by the variables in the study.

Problems with accessibility to health services by persons with disabilities in Sao Paulo, Brazil

Purpose. To describe the occurrence of self-reported problems of accessibility to health services used by persons with disabilities in terms of social and health services variables. Methods. We performed a cross-sectional household survey designed to assess problems with accessibility to health services faced by persons with disabilities. We interviewed 333 persons in Sao Paulo city, in 2007. Variables related to the presence of accessibility problems, disabilities, gender, age, family head income, ethnicity, use of health services and others were analysed using frequencies, percentages, chi(2)-test, ANOVA and Poisson regression models. Results. 15.92% of the interviewed persons reported problems with accessibility to health services. Persons having multiple (prevalence ratios; PR = 2.91) or mobility disability (PR = 6.46) had more problems with accessibility than persons with hearing disability. Persons younger than 78 years old had more problems with accessibility; those who needed help to go to the health service (PR = 3.01) also. Conclusions. Persons with multiple or mobility disability, younger than 78 years, and those who needed help of others to go to the health service were more likely to have problems with accessibility to health services. This information could be one of the first steps to the management and/or planning of appropriate health services for persons with disabilities.

A review on the combination of binary classifiers in multiclass problems

Several real problems involve the classification of data into categories or classes. Given a data set containing data whose classes are known, Machine Learning algorithms can be employed for the induction of a classifier able to predict the class of new data from the same domain, performing the desired discrimination. Some learning techniques are originally conceived for the solution of problems with only two classes, also named binary classification problems. However, many problems require the discrimination of examples into more than two categories or classes. This paper presents a survey on the main strategies for the generalization of binary classifiers to problems with more than two classes, known as multiclass classification problems. The focus is on strategies that decompose the original multiclass problem into multiple binary subtasks, whose outputs are combined to obtain the final prediction.

Evolutionary tuning of SVM parameter values in multiclass problems

Support vector machines (SVMs) were originally formulated for the solution of binary classification problems. In multiclass problems, a decomposition approach is often employed, in which the multiclass problem is divided into multiple binary subproblems, whose results are combined. Generally, the performance of SVM classifiers is affected by the selection of values for their parameters. This paper investigates the use of genetic algorithms (GAs) to tune the parameters of the binary SVMs in common multiclass decompositions. The developed GA may search for a set of parameter values common to all binary classifiers or for differentiated values for each binary classifier. (C) 2008 Elsevier B.V. All rights reserved.

HIERARCHICAL DECOMPOSITION OF MULTICLASS PROBLEMS

Several popular Machine Learning techniques are originally designed for the solution of two-class problems. However, several classification problems have more than two classes. One approach to deal with multiclass problems using binary classifiers is to decompose the multiclass problem into multiple binary sub-problems disposed in a binary tree. This approach requires a binary partition of the classes for each node of the tree, which defines the tree structure. This paper presents two algorithms to determine the tree structure taking into account information collected from the used dataset. This approach allows the tree structure to be determined automatically for any multiclass dataset.

Semilinear parabolic problems in thin domains with a highly oscillatory boundary

In this paper, we study the behavior of the solutions of nonlinear parabolic problems posed in a domain that degenerates into a line segment (thin domain) which has an oscillating boundary. We combine methods from linear homogenization theory for reticulated structures and from the theory on nonlinear dynamics of dissipative systems to obtain the limit problem for the elliptic and parabolic problems and analyze the convergence properties of the solutions and attractors of the evolutionary equations. (C) 2011 Elsevier Ltd. All rights reserved.

Coincidence theorems and its applications to equilibrium problems

Given two maps h : X x K -> R and g : X -> K such that, for all x is an element of X, h(x, g(x)) = 0, we consider the equilibrium problem of finding (x) over tilde is an element of X such that h((x) over tilde, g(x)) >= 0 for every x is an element of X. This question is related to a coincidence problem.

Semilinear elliptic problems near resonance with a nonprincipal eigenvalue

We consider the Dirichlet problem for the equation -Delta u = lambda u +/- (x, u) + h(x) in a bounded domain, where f has a sublinear growth and h is an element of L-2. We find suitable conditions on f and It in order to have at least two solutions for X near to an eigenvalue of -Delta. A typical example to which our results apply is when f (x, u) behaves at infinity like a(x)vertical bar u vertical bar(q-2)u, with M > a(x) > delta > 0, and I < q < 2. (C) 2007 Elsevier Inc. All rights reserved.

Strongly damped wave problems: Bootstrapping and regularity of solutions

The aim of the article is to present a unified approach to the existence, uniqueness and regularity of solutions to problems belonging to a class of second order in time semilinear partial differential equations in Banach spaces. Our results are applied next to a number of examples appearing in literature, which fall into the class of strongly damped semilinear wave equations. The present work essentially extends the results on the existence and regularity of solutions to such problems. Previously, these problems have been considered mostly within the Hilbert space setting and with the main part operators being selfadjoint. In this article we present a more general approach, involving sectorial operators in reflexive Banach spaces. (C) 2008 Elsevier Inc. All rights reserved.

Continuity of attractors for parabolic problems with localized large diffusion

In this paper we study the continuity of asymptotics of semilinear parabolic problems of the form u(t) - div(p(x)del u) + lambda u =f(u) in a bounded smooth domain ohm subset of R `` with Dirichlet boundary conditions when the diffusion coefficient p becomes large in a subregion ohm(0) which is interior to the physical domain ohm. We prove, under suitable assumptions, that the family of attractors behave upper and lower semicontinuously as the diffusion blows up in ohm(0). (c) 2006 Elsevier Ltd. All rights reserved.

A Mass-Conserving Algorithm for Dynamical Lubrication Problems With Cavitation

A numerical algorithm for fully dynamical lubrication problems based on the Elrod-Adams formulation of the Reynolds equation with mass-conserving boundary conditions is described. A simple but effective relaxation scheme is used to update the solution maintaining the complementarity conditions on the variables that represent the pressure and fluid fraction. The equations of motion are discretized in time using Newmark`s scheme, and the dynamical variables are updated within the same relaxation process just mentioned. The good behavior of the proposed algorithm is illustrated in two examples: an oscillatory squeeze flow (for which the exact solution is available) and a dynamically loaded journal bearing. This article is accompanied by the ready-to-compile source code with the implementation of the proposed algorithm. [DOI: 10.1115/1.3142903]

Exact penalties for variational inequalities with applications to nonlinear complementarity problems

In this paper, we present a new reformulation of the KKT system associated to a variational inequality as a semismooth equation. The reformulation is derived from the concept of differentiable exact penalties for nonlinear programming. The best theoretical results are presented for nonlinear complementarity problems, where simple, verifiable, conditions ensure that the penalty is exact. We close the paper with some preliminary computational tests on the use of a semismooth Newton method to solve the equation derived from the new reformulation. We also compare its performance with the Newton method applied to classical reformulations based on the Fischer-Burmeister function and on the minimum. The new reformulation combines the best features of the classical ones, being as easy to solve as the reformulation that uses the Fischer-Burmeister function while requiring as few Newton steps as the one that is based on the minimum.

Approximating a class of combinatorial problems with rational objective function

In the late seventies, Megiddo proposed a way to use an algorithm for the problem of minimizing a linear function a(0) + a(1)x(1) + ... + a(n)x(n) subject to certain constraints to solve the problem of minimizing a rational function of the form (a(0) + a(1)x(1) + ... + a(n)x(n))/(b(0) + b(1)x(1) + ... + b(n)x(n)) subject to the same set of constraints, assuming that the denominator is always positive. Using a rather strong assumption, Hashizume et al. extended Megiddo`s result to include approximation algorithms. Their assumption essentially asks for the existence of good approximation algorithms for optimization problems with possibly negative coefficients in the (linear) objective function, which is rather unusual for most combinatorial problems. In this paper, we present an alternative extension of Megiddo`s result for approximations that avoids this issue and applies to a large class of optimization problems. Specifically, we show that, if there is an alpha-approximation for the problem of minimizing a nonnegative linear function subject to constraints satisfying a certain increasing property then there is an alpha-approximation (1 1/alpha-approximation) for the problem of minimizing (maximizing) a nonnegative rational function subject to the same constraints. Our framework applies to covering problems and network design problems, among others.

Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs

The assessment of routing protocols for mobile wireless networks is a difficult task, because of the networks` dynamic behavior and the absence of benchmarks. However, some of these networks, such as intermittent wireless sensors networks, periodic or cyclic networks, and some delay tolerant networks (DTNs), have more predictable dynamics, as the temporal variations in the network topology can be considered as deterministic, which may make them easier to study. Recently, a graph theoretic model-the evolving graphs-was proposed to help capture the dynamic behavior of such networks, in view of the construction of least cost routing and other algorithms. The algorithms and insights obtained through this model are theoretically very efficient and intriguing. However, there is no study about the use of such theoretical results into practical situations. Therefore, the objective of our work is to analyze the applicability of the evolving graph theory in the construction of efficient routing protocols in realistic scenarios. In this paper, we use the NS2 network simulator to first implement an evolving graph based routing protocol, and then to use it as a benchmark when comparing the four major ad hoc routing protocols (AODV, DSR, OLSR and DSDV). Interestingly, our experiments show that evolving graphs have the potential to be an effective and powerful tool in the development and analysis of algorithms for dynamic networks, with predictable dynamics at least. In order to make this model widely applicable, however, some practical issues still have to be addressed and incorporated into the model, like adaptive algorithms. We also discuss such issues in this paper, as a result of our experience.