Methods for assessing physical activity: a systematic review focused on older adults

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

A common Tabu search algorithm for the global optimization of engineering problems

A novel common Tabu algorithm for global optimizations of engineering problems is presented. The robustness and efficiency of the presented method are evaluated by using standard mathematical functions and hy solving a practical engineering problem. The numerical results show that the proposed method is (i) superior to the conventional Tabu search algorithm in robustness, and (ii) superior to the simulated annealing algorithm in efficiency. (C) 2001 Elsevier B.V. B.V. All rights reserved.

Search for techniparticles in e plus jets events at D0

We search for the technicolor process p(p) over bar ->rho(T)/omega(T)-> W pi(T) in events containing one electron and two jets, in data corresponding to an integrated luminosity of 390 pb(-1), recorded by the D0 experiment at the Fermilab Tevatron. Technicolor predicts that technipions pi(T) decay dominantly into b(b) over bar, b(c) over bar, or (b) over barc, depending on their charge. In these events b and c quarks are identified by their secondary decay vertices within jets. Two analysis methods based on topological variables are presented. Since no excess above the standard model prediction was found, the result is presented as an exclusion in the pi(T) vs rho(T) mass plane for a given set of model parameters.

Search for charged Higgs bosons in top quark decays

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Search for anomalous t(t)over-bar production in the highly-boosted all-hadronic final state

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Comparative studies on non-convex optimization methods for transmission network expansion planning

We have investigated and extensively tested three families of non-convex optimization approaches for solving the transmission network expansion planning problem: simulated annealing (SA), genetic algorithms (GA), and tabu search algorithms (TS). The paper compares the main features of the three approaches and presents an integrated view of these methodologies. A hybrid approach is then proposed which presents performances which are far better than the ones obtained with any of these approaches individually. Results obtained in tests performed with large scale real-life networks are summarized.

Comparative studies on non-convex optimization methods for transmission network expansion planning

We have investigated and extensively tested three families of non-convex optimization approaches for solving the transmission network expansion planning problem: simulated annealing (SA), genetic algorithms (GA), and tabu search algorithms (TS). The paper compares the main features of the three approaches and presents an integrated view of these methodologies. A hybrid approach is then proposed which presents performances which are far better than the ones obtained with any of these approaches individually. Results obtained in tests performed with large scale real-life networks are summarized.

Search for the flavor-changing neutral current decay Bs 0 → μ+ μ- pp̄ Collisions at √s = 1.96 TeV with the DO Detector

We present the results of a search for the flavor-changing neutral current decay Bs 0 → μ+ μ-. using a data set with integrated luminosity of 240 pb-1 of pp̄ collisions at √s = 1.96 TeV collected with the D0 detector in run II of the Fermilab Tevatron collider. We find the upper limit on the branching fraction to be B(Bs 0 → μ+ π-) ≤ 5.0 × 10-7 at the 95% C.L. assuming no contributions from the decay Bd 0 → μ+ μ- in the signal region. This limit is the most stringent upper bound on the branching fraction Bs 0 → μ+ μ- to date. © 2005 The American Physical Society.

Distributed generation impact evaluation using a multi-objective tabu search

Distribution networks paradigm is changing currently requiring improved methodologies and tools for network analysis and planning. A relevant issue is analyzing the impact of the Distributed Generation penetration in passive networks considering different operation scenarios. Studying DG optimal siting and sizing the planner can identify the network behavior in presence of DG. Many approaches for the optimal DG allocation problem successfully used multi-objective optimization techniques. So this paper contributes to the fundamental stage of multi-objective optimization of finding the Pareto optimal solutions set. It is proposed the application of a Multi-objective Tabu Search and it was verified a better performance comparing to the NSGA-II method. © 2009 IEEE.

Problem of assignment cells to switches in a cellular mobile network via beam search method

The problem of assigning cells to switches in a cellular mobile network is an NP-hard optimization problem. So, real size mobile networks could not be solved by using exact methods. The alternative is the use of the heuristic methods, because they allow us to find a good quality solution in a quite satisfactory computational time. This paper proposes a Beam Search method to solve the problem of assignment cell in cellular mobile networks. Some modifications in this algorithm are also presented, which allows its parallel application. Computational results obtained from several tests confirm the effectiveness of this approach to provide good solutions for medium- and large-sized cellular mobile network.

Labeling methods for association rule clustering

Although association mining has been highlighted in the last years, the huge number of rules that are generated hamper its use. To overcome this problem, many post-processing approaches were suggested, such as clustering, which organizes the rules in groups that contain, somehow, similar knowledge. Nevertheless, clustering can aid the user only if good descriptors be associated with each group. This is a relevant issue, since the labels will provide to the user a view of the topics to be explored, helping to guide its search. This is interesting, for example, when the user doesn't have, a priori, an idea where to start. Thus, the analysis of different labeling methods for association rule clustering is important. Considering the exposed arguments, this paper analyzes some labeling methods through two measures that are proposed. One of them, Precision, measures how much the methods can find labels that represent as accurately as possible the rules contained in its group and Repetition Frequency determines how the labels are distributed along the clusters. As a result, it was possible to identify the methods and the domain organizations with the best performances that can be applied in clusters of association rules.

Search for supersymmetry in pp collisions at √s = 7 TeV in events with a single lepton, jets, and missing transverse momentum

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Methods for obtaining reliable and reproducible results in studies of Candida biofilms formed in vitro

Biofilm formation is one of the most important attributes for virulence in Candida species and contributes to increased resistance to antifungal drugs and host immune mechanisms. These features have led to the development of several methodologies to reproduce a sessile community in vitro that can be used to study the development of a biofilm, its interaction with other microorganisms and the environment, and its susceptibility to available antifungal agents and also to search for new therapy strategies. The purpose of this review is to describe the most commonly used methods to study Candida biofilms in vitro, to discuss the benefits and limitations of the different methods to induce biofilm formation, and to analyse the architecture, viability and growth kinetics of Candida biofilms. © 2013 Blackwell Verlag GmbH.

Recent mouse and rat methods for the study of experimental oral candidiasis

The Candida genus expresses virulence factors that, when combined with immunosuppression and other risk factors, can cause different manifestations of oral candidiasis. The treatment of mucosal infections caused by Candida and the elucidation of the disease process have proven challenging. Therefore, the study of experimentally induced oral candidiasis in rats and mice is useful to clarify the etiopathology of this condition, improve diagnosis, and search for new therapeutic options because the disease process in these animals is similar to that of human candidiasis lesions. Here, we describe and discuss new studies involving rat and mouse models of oral candidiasis with respect to methods for inducing experimental infection, methods for evaluating the development of experimental candidiasis, and new treatment strategies for oral candidiasis. © 2013 Landes Bioscience.

Basic ingredients for mathematical modeling of tumor growth in vitro: Cooperative effects and search for space

Based on the literature data from HT-29 cell monolayers, we develop a model for its growth, analogous to an epidemic model, mixing local and global interactions. First, we propose and solve a deterministic equation for the progress of these colonies. Thus, we add a stochastic (local) interaction and simulate the evolution of an Eden-like aggregate by using dynamical Monte Carlo methods. The growth curves of both deterministic and stochastic models are in excellent agreement with the experimental observations. The waiting times distributions, generated via our stochastic model, allowed us to analyze the role of mesoscopic events. We obtain log-normal distributions in the initial stages of the growth and Gaussians at long times. We interpret these outcomes in the light of cellular division events: in the early stages, the phenomena are dependent each other in a multiplicative geometric-based process, and they are independent at long times. We conclude that the main ingredients for a good minimalist model of tumor growth, at mesoscopic level, are intrinsic cooperative mechanisms and competitive search for space. © 2013 Elsevier Ltd.