Scaling predictions for radii of weakly bound triatomic molecules

The mean-square radii of the triatomic molecules 4He 3, 4He 2- 6Li, 4He 2- 7Li, and 4He 2- 23Na were calculated using a renormalized three-body model with a pairwise Dirac-δ interaction, having as physical inputs only the values of the binding energies of the diatomic and triatomic molecules. Molecular three-body systems with bound subsystems were considered. The resultant data were analyzed in detail.

Scaling properties of the fermi-ulam accelerator model

The chaotic low energy region (chaotic sea) of the Fermi-Ulam accelerator model is discussed within a scaling framework near the integrable to non-integrable transition. Scaling results for the average quantities (velocity, roughness, energy etc.) of the simplified version of the model are reviewed and it is shown that, for small oscillation amplitude of the moving wall, they can be described by scaling functions with the same characteristic exponents. New numerical results for the complete model are presented. The chaotic sea is also characterized by its Lyapunov exponents.

Efficacy of Carisolv™ as an adjunctive therapy to scaling and root planing on subgingival calculus removal

The purpose of this study was to evaluate the effectiveness of subgingival application of Carisolv™ gel as an adjunctive therapy to scaling and root planing (SRP) on calculus removal compared to conventional instrumentation. Forty-five teeth requiring extraction due to severe periodontal disease were randomized to the following treatments: 1) SRP alone; 2) placebo gel + SRP; 3) Carisolv™ gel + SRP. Either test or placebo gel was applied subgingivally for 1 min and then the root were instrumented until a smooth and calculus-free surface was achieved. Instrumentation time and the number of strokes required were recorded. After extraction, the efficacy of root surface instrumentation was measured by percentage of remaining calculus. There was no statistically significant difference (p>0.05) between the treatment groups regarding either time required for instrumentation or the percentage of residual calculus. The subgingival application of Carisolv™ gel prior to SRP did not provide any additional benefit to root instrumentation compared to scaling and root planing alone.

Risk prediction for weed infestation using classification rules

This paper proposes a fuzzy classification system for the risk of infestation by weeds in agricultural zones considering the variability of weeds. The inputs of the system are features of the infestation extracted from estimated maps by kriging for the weed seed production and weed coverage, and from the competitiveness, inferred from narrow and broad-leaved weeds. Furthermore, a Bayesian network classifier is used to extract rules from data which are compared to the fuzzy rule set obtained on the base of specialist knowledge. Results for the risk inference in a maize crop field are presented and evaluated by the estimated yield loss. © 2009 IEEE.

Optimal clone identifier based on dynamic rules and process algebra

The rule creation to clone selection in different projects is a hard task to perform by using traditional implementations to control all the processes of the system. The use of an algebraic language is an alternative approach to manage all of system flow in a flexible way. In order to increase the power of versatility and consistency in defining the rules for optimal clone selection, this paper presents the software OCI 2 in which uses process algebra in the flow behavior of the system. OCI 2, controlled by an algebraic approach was applied in the rules elaboration for clone selection containing unique genes in the partial genome of the bacterium Bradyrhizobium elkanii Semia 587 and in the whole genome of the bacterium Xanthomonas axonopodis pv. citri. Copyright© (2009) by the International Society for Research in Science and Technology.

Treatment of experimental periodontal disease by a selective inhibitor of cyclooxygenase-2 with scaling and root planing (SRP)

Lumiracoxib is a selective inhibitor of cyclooxygenase-2 (COX-2) approved for the relief of symptoms of chronic inflammatory conditions. The aim of this study was to evaluate the effects of this specific inhibitor of COX-2 as adjunctive treatment on induced periodontitis in rats. Periodontal disease was induced at the first mandibular molar of 60 rats. After 7 days, the ligature was removed and all animals were submitted to scaling and root planing (SRP) along with local irrigation with saline solution and were divided into 2 groups: SRP (n = 30)-received subcutaneous injections of 1 mg/kg of body weight/day of saline solution for 3 days and; SRP + L (n = 30)-received subcutaneous injections of 1 mg/kg of body weight/day of Lumiracoxib for 3 days. Ten animals in each group were killed at 7, 15, and 30 days. The histological description was performed and the histometric values were statistically analyzed. In Group SRP + L, the histometric analysis (0.58 ± 0.08, 0.64 ± 0.06, and 0.56 ± 0.10 mm 2) showed less bone loss (p < 0.05) than Group SRP (1.52 ± 0.08, 1.55 ± 0.09, and 1.49 ± 0.24 mm 2) at 7, 15, and 30 days, respectively. Within the limits of this study it can be concluded that subcutaneous application of specific inhibitor of COX-2 was a beneficial adjunctive treatment for periodontal diseases induced in rats. © 2010 Springer Basel AG.

Selecting candidate labels for hierarchical document clusters using association rules

One way to organize knowledge and make its search and retrieval easier is to create a structural representation divided by hierarchically related topics. Once this structure is built, it is necessary to find labels for each of the obtained clusters. In many cases the labels have to be built using only the terms in the documents of the collection. This paper presents the SeCLAR (Selecting Candidate Labels using Association Rules) method, which explores the use of association rules for the selection of good candidates for labels of hierarchical document clusters. The candidates are processed by a classical method to generate the labels. The idea of the proposed method is to process each parent-child relationship of the nodes as an antecedent-consequent relationship of association rules. The experimental results show that the proposed method can improve the precision and recall of labels obtained by classical methods. © 2010 Springer-Verlag.

Comparative study of algorithms for mining association rules: Traditional approach versus multi-relational approach

The multi-relational Data Mining approach has emerged as alternative to the analysis of structured data, such as relational databases. Unlike traditional algorithms, the multi-relational proposals allow mining directly multiple tables, avoiding the costly join operations. In this paper, is presented a comparative study involving the traditional Patricia Mine algorithm and its corresponding multi-relational proposed, MR-Radix in order to evaluate the performance of two approaches for mining association rules are used for relational databases. This study presents two original contributions: the proposition of an algorithm multi-relational MR-Radix, which is efficient for use in relational databases, both in terms of execution time and in relation to memory usage and the presentation of the empirical approach multirelational advantage in performance over several tables, which avoids the costly join operations from multiple tables. © 2011 IEEE.

Multi-relational algorithm for mining association rules in large databases

Multi-relational data mining enables pattern mining from multiple tables. The existing multi-relational mining association rules algorithms are not able to process large volumes of data, because the amount of memory required exceeds the amount available. The proposed algorithm MRRadix presents a framework that promotes the optimization of memory usage. It also uses the concept of partitioning to handle large volumes of data. The original contribution of this proposal is enable a superior performance when compared to other related algorithms and moreover successfully concludes the task of mining association rules in large databases, bypass the problem of available memory. One of the tests showed that the MR-Radix presents fourteen times less memory usage than the GFP-growth. © 2011 IEEE.

Post-processing association rules with clustering and objective measures

The post-processing of association rules is a difficult task, since a large number of patterns can be obtained. Many approaches have been developed to overcome this problem, as objective measures and clustering, which are respectively used to: (i) highlight the potentially interesting knowledge in domain; (ii) structure the domain, organizing the rules in groups that contain, somehow, similar knowledge. However, objective measures don't reduce nor organize the collection of rules, making the understanding of the domain difficult. On the other hand, clustering doesn't reduce the exploration space nor direct the user to find interesting knowledge, making the search for relevant knowledge not so easy. This work proposes the PAR-COM (Post-processing Association Rules with Clustering and Objective Measures) methodology that, combining clustering and objective measures, reduces the association rule exploration space directing the user to what is potentially interesting. Thereby, PAR-COM minimizes the user's effort during the post-processing process.

PAR-COM: A new methodology for post-processing association rules

The post-processing of association rules is a difficult task, since a huge number of rules that are generated are of no interest to the user. To overcome this problem many approaches have been developed, such as objective measures and clustering. However, objective measures don't reduce nor organize the collection of rules, therefore making the understanding of the domain difficult. On the other hand, clustering doesn't reduce the exploration space nor direct the user to find interesting knowledge, therefore making the search for relevant knowledge not so easy. In this context this paper presents the PAR-COM methodology that, by combining clustering and objective measures, reduces the association rule exploration space directing the user to what is potentially interesting. An experimental study demonstrates the potential of PAR-COM to minimize the user's effort during the post-processing process. © 2012 Springer-Verlag.

Tjon Lines and Scaling Limit in Four-Body Systems

The fixed-slope correlation between tetramer and trimer binding energies, observed by Tjon in the context of nuclear physics, is mainly a manifestation of the dominance of the two-nucleon force in the nuclear potential, which makes the four-body scale on the order of the three-body one. In a more general four-boson case, the correlation between tetramer and trimer binding energies has a non-fixed slope, which expresses the dependence on the new scale. The associated scaling function generates a family of Tjon lines. This conclusion relies on a recent study with weakly-bound four identical bosons, within a renormalized zero-range Faddeev-Yakubovsky formalism. © 2012 Springer-Verlag.

Saddle points and rare collisions under scaling approach in a Fermi accelerator with two nonlinear terms

Rare collisions of a classical particle bouncing between two walls are studied. The dynamics is described by a two-dimensional, nonlinear and area-preserving mapping in the variables velocity and time at the instant that the particle collides with the moving wall. The phase space is of mixed type preventing diffusion of the particle to high energy. Successive and therefore rare collisions are shown to have a histogram of frequency which is scaling invariant with respect to the control parameters. The saddle fixed points are studied and shown to be scaling invariant with respect to the control parameters too. © 2012 Elsevier B.V. All rights reserved.

Scaling invariance of the diffusion coefficient in a family of two-dimensional Hamiltonian mappings

We consider a family of two-dimensional nonlinear area-preserving mappings that generalize the Chirikov standard map and model a variety of periodically forced systems. The action variable diffuses in increments whose phase is controlled by a negative power of the action and hence effectively uncorrelated for small actions, leading to a chaotic sea in phase space. For larger values of the action the phase space is mixed and contains a family of elliptic islands centered on periodic orbits and invariant Kolmogorov-Arnold-Moser (KAM) curves. The transport of particles along the phase space is considered by starting an ensemble of particles with a very low action and letting them evolve in the phase until they reach a certain height h. For chaotic orbits below the periodic islands, the survival probability for the particles to reach h is characterized by an exponential function, well modeled by the solution of the diffusion equation. On the other hand, when h reaches the position of periodic islands, the diffusion slows markedly. We show that the diffusion coefficient is scaling invariant with respect to the control parameter of the mapping when h reaches the position of the lowest KAM island. © 2013 American Physical Society.

Scaling attractors in interacting teleparallel dark energy

It has been proposed recently the existence of a non-minimal coupling between a canonical scalar field (quintessence) and gravity in the framework of teleparallel gravity, motivated by similar constructions in the context of General Relativity. The dynamics of the model, known as teleparallel dark energy, has been further developed, but no scaling attractor has been found. Here we consider a model in which the non-minimal coupling is ruled by a dynamically changing coefficient α≡f,φ/(f)1/2, with f(φ) an arbitrary function of the scalar field φ. It is shown that in this case the existence of scaling attractors is possible, which means that the universe will eventually enter these scaling attractors, regardless of the initial conditions. As a consequence, the cosmological coincidence problem could be alleviated without fine-tunings. © 2013 IOP Publishing Ltd and Sissa Medialab srl.