A Randomized Clinical Evaluation of a One- and Two-step Self-etch Adhesive Over 24 Months

Objective: To evaluate the performance of All Bond SE used in a one- or two-step protocol in a 24-month randomized clinical study. Methods: Thirty-three patients with two similarly sized non-carious cervical lesions participated in this study. A total of 66 restorations were placed, half using the one-step All Bond SE protocol (SE-1) and the other half using the two-step All Bond SE protocol (SE-2). The restorations were evaluated at baseline and after 6, 12 and 24 months following the modified USPHS criteria and analyzed by the McNemar`s test and Fisher`s exact test (alpha=0.05). Results: After 24 months, six SE-1 and four SE-2 restorations were rated as Bravo in marginal discoloration The retention rates for SE-1 and SE-2 were 84.8% and 90.9%, respectively, after 24 months. Compared to baseline, the retention rate for SE-1 was statistically lower. Conclusions: All Bond SE used in the one- or two-step protocol resulted in high retention rates after 24 months.

A 24-month randomized clinical trial of a two- and three-step etch-and-rinse technique

Purpose This 24-month randomized paired tooth clinical study evaluated the performance of All Bond 3 used in the simplified (2-step) and full (3-step) versions Methods 33 patients, with at least two similar sized non-carious cervical lesions participated in this study A total of 66 restorations were placed, half using the 2-step All Bond 3 (AB3-2) and the other half using 3-step All Bond 3 (AB3-3) The restorations were placed incrementally using the composite resin Aelite The restorations were evaluated at baseline and after 6, 12 and 24 months following the modified USPHS criteria Statistical differences between the adhesive were tested using with McNemar`s test and clinical performance over time for each material with the Fisher`s exact test (alpha= 0 05) Results After 24 months, six AB3-2 and four AB3-3 were rated as bravo for marginal discoloration but did not differ from each other significantly (P> 0 05) The retention rates at 24 months of AB3-2 and AB3-3 were 90 9% and 97 0%, respectively (P> 0 05) (Am J Dent 2010,23 231-236)

Low Level Laser Effects On Pain to Palpation and Electromyographic Activity in TMD Patients: A Double-Blind, Randomized, Placebo-Controlled Study

The purpose of this study was to evaluate the effect of diode laser (GaAlAs - 780 nm) on pain to palpation and electromyographic (EMG) activity of the masseter and anterior temporalis muscles. The laser was applied on the temporalis and masseter muscles twice a week (four weeks). Forty-eight (48) patients with myofascial pain were randomly assigned between actual and placebo treatments and between the energetic doses of 25 J/cm(2) and 60 J/cm(2), and were evaluated using VAS before, immediately after the final application, and 30 days after the laser treatment. Surface electromyography was performed with maximum dental clenching before and after laser therapy. The results show there were no significant statistical differences in the EMG activity between the groups before and after laser treatment. With regard to the pain at palpation, although both groups presented a significant difference in the symptoms before and after the treatment, only the active doses showed statistically significant reductions in pain level in all the regions of the palpated muscles. However, there was no significant statistical difference between groups (experimental and placebo). In conclusion, low level laser did not promote any changes in EMG activity. The treatment did, however, lessen the pain symptoms in the experimental groups.

The effects of lipoic acid and alpha-tocopherol supplementation on the lipid profile and insulin sensitivity of patients with type 2 diabetes mellitus: A randomized, double-blind, placebo-controlled trial

Antioxidants probably play an important role in the etiology of type 2 diabetes (DM2). This study evaluated the effects of supplementation with lipoic acid (LA) and alpha-tocopherol on the lipid profile and insulin sensitivity of DM2 patients. A randomized, double-blind, placebo-controlled trial involving 102 DM2 patients divided into four groups to receive daily supplementation for 4 months with: 600 mg LA (n = 26); 800 mg alpha-tocopherol (n = 25); 800 mg alpha-tocopherol + 600 mg LA (n = 25); placebo (n = 26). Plasma alpha-tocopherol, lipid profile, glucose, insulin, and the HOMA index were determined before and after supplementation. Differences within and between groups were compared by ANOVA using Bonferroni correction. Student`s t-test was used to compare means of two independent variables. The vitamin E/total cholesterol ratio improved significantly in patients supplemented with vitamin E + LA and vitamin E alone (p <= 0.001). There were improvements of the lipid fractions in the groups receiving LA and vitamin E alone or in combination, and on the HOMA index in the LA group, but not significant. The results suggest that LA and vitamin E supplementation alone or in combination did not affect the lipid profile or insulin sensitivity of DM2 patients. (C) 2011 Elsevier Ireland Ltd. All rights reserved.

Serum oxytocin concentrations in elective caesarean delivery: a randomized comparison of three infusion regimens

Background: The aim of this study was to determine serum oxytocin concentrations following different regimens of prophylactic oxytocin administration in women undergoing elective caesarean delivery. Methods: Thirty healthy pregnant patients were randomized, after clamping of the umbilical cord, to receive intravenous oxytocin in one of the following groups: G1 (n = 9), 10 IU of oxytocin infused over 30 min (0.33 IU/min); G2 (n = 11), 10 IU of oxytocin infused over 3 min and 45 s (2.67 IU/min); and G3 (n = 10), 80 IU of oxytocin infused over 30 min (2.67 IU/min). Both patient and surgeon were blinded to allocation. Uterine tone was assessed by surgical palpation. Serum oxytocin concentration was determined by enzyme immunoassay before anaesthesia (T0) and at 5 (T5), 30 (T30) and 60 (T60) min after the start of oxytocin infusion. Results: Serum oxytocin concentrations (mean standard error, ng/mL) were not significantly different in the groups at T0 (0.06 +/- 0.02, 0.04 +/- 0.02 and 0.07 +/- 0.04, respectively, P = 0.76), and T60 (0.65 +/- 0.26, 0.36 +/- 0.26 and 0.69 +/- 0.26, respectively, P = 0.58). G3 showed higher concentrations than G1 at 15 (3.65 +/- 0.74 versus 0.71 +/- 0.27, P = 0.01) and at T30 (6.19 +/- 1.19 versus 1.17 +/- 0.37, P < 0.01), and were higher than G2 at T30 (6.19 +/- 1.19 versus 0.41 +/- 0.2, P < 0.01). Haemodynamic data and uterine tone were considered satisfactory and similar in all groups. No additional uterotonic agents were needed. Conclusion: Serum oxytocin measurements made using enzyme immunoassay in healthy pregnant women undergoing elective caesarean delivery showed that administration of 80 IU oxytocin over 30 min resulted in higher serum oxytocin levels after 5 and 30 min than the two other regimens. The concentrations did not differ between groups at 60 min. (C) 2011 Elsevier Ltd. All rights reserved.

Efficacy of high intensity diode laser as an adjunct to non-surgical periodontal treatment: a randomized controlled trial

The high intensity diode laser has been studied in periodontics for the reduction of subgingival bacteria in non-surgical treatment. Our study evaluated the bacterial effect as well as changes in periodontal clinical parameters promoted by root scaling and planing associated with this wavelength. Twenty-seven patients randomly assigned in two groups underwent root scaling and planing on the tested sites, and only the experimental group received the diode laser irradiation. Among the clinical parameters studied, the clinical probing depth (CPD) and the clinical attachment level (CAL) resulted in significant enhancement in the control group when compared with the experimental group (P = 0.014 and P = 0.039, respectively). The results were similar for both groups regarding the plaque index (PI) and bleeding on probing (BP). No significant difference in the microbiological parameters was observed between the control and experimental groups. It was possible to conclude that the high power diode laser adjunct to the non-surgical periodontal treatment did not promote additional effects to the conventional periodontal treatment.

Investigation of a new GRASP-based clustering algorithm applied to biological data

A large amount of biological data has been produced in the last years. Important knowledge can be extracted from these data by the use of data analysis techniques. Clustering plays an important role in data analysis, by organizing similar objects from a dataset into meaningful groups. Several clustering algorithms have been proposed in the literature. However, each algorithm has its bias, being more adequate for particular datasets. This paper presents a mathematical formulation to support the creation of consistent clusters for biological data. Moreover. it shows a clustering algorithm to solve this formulation that uses GRASP (Greedy Randomized Adaptive Search Procedure). We compared the proposed algorithm with three known other algorithms. The proposed algorithm presented the best clustering results confirmed statistically. (C) 2009 Elsevier Ltd. All rights reserved.

A hybrid approach to learn with imbalanced classes using evolutionary algorithms

There is an increasing interest in the application of Evolutionary Algorithms (EAs) to induce classification rules. This hybrid approach can benefit areas where classical methods for rule induction have not been very successful. One example is the induction of classification rules in imbalanced domains. Imbalanced data occur when one or more classes heavily outnumber other classes. Frequently, classical machine learning (ML) classifiers are not able to learn in the presence of imbalanced data sets, inducing classification models that always predict the most numerous classes. In this work, we propose a novel hybrid approach to deal with this problem. We create several balanced data sets with all minority class cases and a random sample of majority class cases. These balanced data sets are fed to classical ML systems that produce rule sets. The rule sets are combined creating a pool of rules and an EA is used to build a classifier from this pool of rules. This hybrid approach has some advantages over undersampling, since it reduces the amount of discarded information, and some advantages over oversampling, since it avoids overfitting. The proposed approach was experimentally analysed and the experimental results show an improvement in the classification performance measured as the area under the receiver operating characteristics (ROC) curve.

GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem

This paper addresses the independent multi-plant, multi-period, and multi-item capacitated lot sizing problem where transfers between the plants are allowed. This is an NP-hard combinatorial optimization problem and few solution methods have been proposed to solve it. We develop a GRASP (Greedy Randomized Adaptive Search Procedure) heuristic as well as a path-relinking intensification procedure to find cost-effective solutions for this problem. In addition, the proposed heuristics is used to solve some instances of the capacitated lot sizing problem with parallel machines. The results of the computational tests show that the proposed heuristics outperform other heuristics previously described in the literature. The results are confirmed by statistical tests. (C) 2009 Elsevier B.V. All rights reserved.

Optimal subdivision of land in agrarian reform projects: an analysis using genetic algorithms

J.A. Ferreira Neto, E.C. Santos Junior, U. Fra Paleo, D. Miranda Barros, and M.C.O. Moreira. 2011. Optimal subdivision of land in agrarian reform projects: an analysis using genetic algorithms. Cien. Inv. Agr. 38(2): 169-178. The objective of this manuscript is to develop a new procedure to achieve optimal land subdivision using genetic algorithms (GA). The genetic algorithm was tested in the rural settlement of Veredas, located in Minas Gerais, Brazil. This implementation was based on the land aptitude and its productivity index. The sequence of tests in the study was carried out in two areas with eight different agricultural aptitude classes, including one area of 391.88 ha subdivided into 12 lots and another of 404.1763 ha subdivided into 14 lots. The effectiveness of the method was measured using the shunting line standard value of a parceled area lot`s productivity index. To evaluate each parameter, a sequence of 15 calculations was performed to record the best individual fitness average (MMI) found for each parameter variation. The best parameter combination found in testing and used to generate the new parceling with the GA was the following: 320 as the generation number, a population of 40 individuals, 0.8 mutation tax, and a 0.3 renewal tax. The solution generated rather homogeneous lots in terms of productive capacity.

Extending the use of canonical and microcanonical Monte Carlo algorithms to spin models

We describe the canonical and microcanonical Monte Carlo algorithms for different systems that can be described by spin models. Sites of the lattice, chosen at random, interchange their spin values, provided they are different. The canonical ensemble is generated by performing exchanges according to the Metropolis prescription whereas in the microcanonical ensemble, exchanges are performed as long as the total energy remains constant. A systematic finite size analysis of intensive quantities and a comparison with results obtained from distinct ensembles are performed and the quality of results reveal that the present approach may be an useful tool for the study of phase transitions, specially first-order transitions. (C) 2009 Elsevier B.V. All rights reserved.

A novel MAP-MRF approach for multispectral image contextual classification using combination of suboptimal iterative algorithms

In this paper we present a novel approach for multispectral image contextual classification by combining iterative combinatorial optimization algorithms. The pixel-wise decision rule is defined using a Bayesian approach to combine two MRF models: a Gaussian Markov Random Field (GMRF) for the observations (likelihood) and a Potts model for the a priori knowledge, to regularize the solution in the presence of noisy data. Hence, the classification problem is stated according to a Maximum a Posteriori (MAP) framework. In order to approximate the MAP solution we apply several combinatorial optimization methods using multiple simultaneous initializations, making the solution less sensitive to the initial conditions and reducing both computational cost and time in comparison to Simulated Annealing, often unfeasible in many real image processing applications. Markov Random Field model parameters are estimated by Maximum Pseudo-Likelihood (MPL) approach, avoiding manual adjustments in the choice of the regularization parameters. Asymptotic evaluations assess the accuracy of the proposed parameter estimation procedure. To test and evaluate the proposed classification method, we adopt metrics for quantitative performance assessment (Cohen`s Kappa coefficient), allowing a robust and accurate statistical analysis. The obtained results clearly show that combining sub-optimal contextual algorithms significantly improves the classification performance, indicating the effectiveness of the proposed methodology. (C) 2010 Elsevier B.V. All rights reserved.

PARALLEL ALGORITHMS FOR MAXIMAL CLIQUES IN CIRCLE GRAPHS AND UNRESTRICTED DEPTH SEARCH

We present parallel algorithms on the BSP/CGM model, with p processors, to count and generate all the maximal cliques of a circle graph with n vertices and m edges. To count the number of all the maximal cliques, without actually generating them, our algorithm requires O(log p) communication rounds with O(nm/p) local computation time. We also present an algorithm to generate the first maximal clique in O(log p) communication rounds with O(nm/p) local computation, and to generate each one of the subsequent maximal cliques this algorithm requires O(log p) communication rounds with O(m/p) local computation. The maximal cliques generation algorithm is based on generating all maximal paths in a directed acyclic graph, and we present an algorithm for this problem that uses O(log p) communication rounds with O(m/p) local computation for each maximal path. We also show that the presented algorithms can be extended to the CREW PRAM model.

Approximation algorithms and hardness results for the clique packing problem

For a fixed family F of graphs, an F-packing in a graph G is a set of pairwise vertex-disjoint subgraphs of G, each isomorphic to an element of F. Finding an F-packing that maximizes the number of covered edges is a natural generalization of the maximum matching problem, which is just F = {K(2)}. In this paper we provide new approximation algorithms and hardness results for the K(r)-packing problem where K(r) = {K(2), K(3,) . . . , K(r)}. We show that already for r = 3 the K(r)-packing problem is APX-complete, and, in fact, we show that it remains so even for graphs with maximum degree 4. On the positive side, we give an approximation algorithm with approximation ratio at most 2 for every fixed r. For r = 3, 4, 5 we obtain better approximations. For r = 3 we obtain a simple 3/2-approximation, achieving a known ratio that follows from a more involved algorithm of Halldorsson. For r = 4, we obtain a (3/2 + epsilon)-approximation, and for r = 5 we obtain a (25/14 + epsilon)-approximation. (C) 2008 Elsevier B.V. All rights reserved.

Algorithms for Maximum Independent Set in Convex Bipartite Graphs

A bipartite graph G = (V, W, E) is convex if there exists an ordering of the vertices of W such that, for each v. V, the neighbors of v are consecutive in W. We describe both a sequential and a BSP/CGM algorithm to find a maximum independent set in a convex bipartite graph. The sequential algorithm improves over the running time of the previously known algorithm and the BSP/CGM algorithm is a parallel version of the sequential one. The complexity of the algorithms does not depend on |W|.