Modification of the B meson mass in a magnetic field from QCD sum rules

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Learning kernels for support vector machines with polynomial powers of sigmoid

In the pattern recognition research field, Support Vector Machines (SVM) have been an effectiveness tool for classification purposes, being successively employed in many applications. The SVM input data is transformed into a high dimensional space using some kernel functions where linear separation is more likely. However, there are some computational drawbacks associated to SVM. One of them is the computational burden required to find out the more adequate parameters for the kernel mapping considering each non-linearly separable input data space, which reflects the performance of SVM. This paper introduces the Polynomial Powers of Sigmoid for SVM kernel mapping, and it shows their advantages over well-known kernel functions using real and synthetic datasets.

QCD sum rules calculation of heavy Λ semileptonic decay

We set up sum rules for heavy lambda decays in a full QCD calculation which in the heavy quark mass limit incorporates the symmetries of heavy quark effective theory. For the semileptonic Λc decay we obtain a reasonable agreement with experiment. For the Λb semileptonic decay we find at the zero recoil point a violation of the heavy quark symmetry of about 20%. © 1998 Published by Elsevier Science B.V. All rights reserved.

Szegö polynomials: quadrature rules on the unit circle and on [-1, 1]

We consider some of the relations that exist between real Szegö polynomials and certain para-orthogonal polynomials defined on the unit circle, which are again related to certain orthogonal polynomials on [-1, 1] through the transformation x = (z1/2+z1/2)/2. Using these relations we study the interpolatory quadrature rule based on the zeros of polynomials which are linear combinations of the orthogonal polynomials on [-1, 1]. In the case of any symmetric quadrature rule on [-1, 1], its associated quadrature rule on the unit circle is also given.

Comparative study between powers of sigmoid functions, MLP-backpropagation and polynomials in function approximation problems

Function approximation is a very important task in environments where the computation has to be based on extracting information from data samples in real world processes. So, the development of new mathematical model is a very important activity to guarantee the evolution of the function approximation area. In this sense, we will present the Polynomials Powers of Sigmoid (PPS) as a linear neural network. In this paper, we will introduce one series of practical results for the Polynomials Powers of Sigmoid, where we will show some advantages of the use of the powers of sigmiod functions in relationship the traditional MLP-Backpropagation and Polynomials in functions approximation problems.

Connections between the Sznajd model with general confidence rules and graph theory

The Sznajd model is a sociophysics model that is used to model opinion propagation and consensus formation in societies. Its main feature is that its rules favor bigger groups of agreeing people. In a previous work, we generalized the bounded confidence rule in order to model biases and prejudices in discrete opinion models. In that work, we applied this modification to the Sznajd model and presented some preliminary results. The present work extends what we did in that paper. We present results linking many of the properties of the mean-field fixed points, with only a few qualitative aspects of the confidence rule (the biases and prejudices modeled), finding an interesting connection with graph theory problems. More precisely, we link the existence of fixed points with the notion of strongly connected graphs and the stability of fixed points with the problem of finding the maximal independent sets of a graph. We state these results and present comparisons between the mean field and simulations in Barabasi-Albert networks, followed by the main mathematical ideas and appendices with the rigorous proofs of our claims and some graph theory concepts, together with examples. We also show that there is no qualitative difference in the mean-field results if we require that a group of size q > 2, instead of a pair, of agreeing agents be formed before they attempt to convince other sites (for the mean field, this would coincide with the q-voter model).

DeCS terminology and the new rules on orthography of Portuguese language: guidelines for an update

PURPOSE: To indicate orthographic changes to be used as a basic reference for professionals, researchers, doctors, teachers, students and users, which are directly linked and performing activities in health services in general, aimed at implementing the correct orthography in recovery and production of their scientific studies. METHODS: For data collection, were shown some examples of terminology DeCS (Descriptors in Health Science) analyzed according to the current spelling and compared with the Orthographic Vocabulary of Portuguese Language (VOLP). RESULTS: It was select and listed examples of key words and/or terms related to Health Sciences, which was compared to the respective rules of the Orthographic Agreement of Portuguese Language, and divided into three items: graphical accentuation, the non use of dieresis and exceptions and, the use of hyphen. CONCLUSION: This study show some guidelines for the orthographic alterations of the terms used by scientific community, according the new orthographic rules, contributing for the efficiency in the description of the documents and consequently in their recovery.

Exotic B-c-like molecules in QCD sum rules

We use the QCD sum rules to study possible B-c-like molecular states. We consider isoscalar J(P) = 0(+) and J(P) = 1(+) D(*) B(*) molecular currents. We consider the contributions of condensates up to dimension eight and we work at leading order in alpha(s). We obtain for these states masses around 7 GeV. (C) 2012 Elsevier B.V. All rights reserved.

QCD sum rules for the 'Z POT + IND C' (3900) state.

We use the QCD sum rules to study the recently observed charmonium-like structure Z+ c (3900) as a tetraquark state. We evaluate the three-point function and extract the coupling constants of the Z+ c J/ψ π+, Z+ c ηc ρ+ and Z+ c D+ ¯D∗0 vertices and the corresponding decay widths in these channels. The results obtained are in good agreement with the experimental data and supports to the tetraquark picture of this state.

The charmed pentaquark Θc(3250) from QCD sum rules.

We study, using the QCD sum rule framework, the possible existence of a charmed pentaquark that we call Θc(3250). In the QCD side we work at leading order in αs and consider condensates up to dimension 10. The mass obtained: mΘc = (3.21±0.13) GeV, is compatible with the mass of the structure seen by BaBar Collaboration in the decay channel B− → ￣p Σ++ c π−π−.

Constraint handling rules. Compositional semantics and program transformation

This thesis intends to investigate two aspects of Constraint Handling Rules (CHR). It proposes a compositional semantics and a technique for program transformation. CHR is a concurrent committed-choice constraint logic programming language consisting of guarded rules, which transform multi-sets of atomic formulas (constraints) into simpler ones until exhaustion [Frü06] and it belongs to the declarative languages family. It was initially designed for writing constraint solvers but it has recently also proven to be a general purpose language, being as it is Turing equivalent [SSD05a]. Compositionality is the first CHR aspect to be considered. A trace based compositional semantics for CHR was previously defined in [DGM05]. The reference operational semantics for such a compositional model was the original operational semantics for CHR which, due to the propagation rule, admits trivial non-termination. In this thesis we extend the work of [DGM05] by introducing a more refined trace based compositional semantics which also includes the history. The use of history is a well-known technique in CHR which permits us to trace the application of propagation rules and consequently it permits trivial non-termination avoidance [Abd97, DSGdlBH04]. Naturally, the reference operational semantics, of our new compositional one, uses history to avoid trivial non-termination too. Program transformation is the second CHR aspect to be considered, with particular regard to the unfolding technique. Said technique is an appealing approach which allows us to optimize a given program and in more detail to improve run-time efficiency or spaceconsumption. Essentially it consists of a sequence of syntactic program manipulations which preserve a kind of semantic equivalence called qualified answer [Frü98], between the original program and the transformed ones. The unfolding technique is one of the basic operations which is used by most program transformation systems. It consists in the replacement of a procedure-call by its definition. In CHR every conjunction of constraints can be considered as a procedure-call, every CHR rule can be considered as a procedure and the body of said rule represents the definition of the call. While there is a large body of literature on transformation and unfolding of sequential programs, very few papers have addressed this issue for concurrent languages. We define an unfolding rule, show its correctness and discuss some conditions in which it can be used to delete an unfolded rule while preserving the meaning of the original program. Finally, confluence and termination maintenance between the original and transformed programs are shown. This thesis is organized in the following manner. Chapter 1 gives some general notion about CHR. Section 1.1 outlines the history of programming languages with particular attention to CHR and related languages. Then, Section 1.2 introduces CHR using examples. Section 1.3 gives some preliminaries which will be used during the thesis. Subsequentely, Section 1.4 introduces the syntax and the operational and declarative semantics for the first CHR language proposed. Finally, the methodologies to solve the problem of trivial non-termination related to propagation rules are discussed in Section 1.5. Chapter 2 introduces a compositional semantics for CHR where the propagation rules are considered. In particular, Section 2.1 contains the definition of the semantics. Hence, Section 2.2 presents the compositionality results. Afterwards Section 2.3 expounds upon the correctness results. Chapter 3 presents a particular program transformation known as unfolding. This transformation needs a particular syntax called annotated which is introduced in Section 3.1 and its related modified operational semantics !0t is presented in Section 3.2. Subsequently, Section 3.3 defines the unfolding rule and prove its correctness. Then, in Section 3.4 the problems related to the replacement of a rule by its unfolded version are discussed and this in turn gives a correctness condition which holds for a specific class of rules. Section 3.5 proves that confluence and termination are preserved by the program modifications introduced. Finally, Chapter 4 concludes by discussing related works and directions for future work.

Ex-post Liability Rules in Modern Patent Law

This doctoral thesis examines the use of liability rules to protect patent entitlements, focusing on a specific type of rule named ex-post since it is applied and designed ex-post by a court or an agency. The research starts from the premise that patents are defined by the legal and economic scholarship as exclusive rights but nevertheless, under certain circumstances there are economic as well as other compelling reasons to transform the exclusiveness of patent rights into a right to receive compensation.