Complete fusion enhancement and suppression of weakly bound nuclei at near barrier energies

We consider the influence of breakup channels on the complete fusion of weakly bound systems in terms of dynamic polarization potentials. It is argued that the enhancement of the cross section at sub-barrier energies may be consistent with recent experimental observations that nucleon transfer, often leading to breakup, is dominant compared to direct breakup. The main trends of the experimental complete fusion cross sections are analyzed in the framework of the DPP approach. The qualitative conclusions are supported by CDCC calculations including a sequential breakup channel, the one neutron stripping of Li-7 followed by the breakup of Li-6.

Self-bound interacting QCD matter in compact stars

The quark gluon plasma (QGP) at zero temperature and high baryon number is a system that may be present inside compact stars. It is quite possible that this cold QGP shares some relevant features with the hot QGP observed in heavy ion collisions, being also a strongly interacting system. In a previous work we have derived from the QCD Lagrangian an equation of state (EOS) for the cold QGP, which can be considered an improved version of the MIT bag-model EOS. Compared to the latter, our EOS reaches higher values of the pressure at comparable baryon densities. This feature is due to perturbative corrections and also to nonperturbative effects. Here we apply this EOS to the study of neutron stars, discussing the absolute stability of quark matter and computing the mass-radius relation for self-bound (strange) stars. The maximum masses of the sequences exceed two solar masses, in agreement with the recently measured values of the mass of the pulsar PSR J1614-2230, and the corresponding radii of around 10-11 km.

Mini-Mental State Examination sentence writing among community-dwelling elderly adults in Brazil: text fluency and grammar complexity

Background: In normal aging, the decrease in the syntactic complexity of written production is usually associated with cognitive deficits. This study was aimed to analyze the quality of older adults' textual production indicated by verbal fluency (number of words) and grammatical complexity (number of ideas) in relation to gender, age, schooling, and cognitive status. Methods: From a probabilistic sample of community-dwelling people aged 65 years and above (n = 900), 577 were selected on basis of their responses to the Mini-Mental State Examination (MMSE) sentence writing, which were submitted to content analysis; 323 were excluded as they left the item blank or performed illegible or not meaningful responses. Education adjusted cut-off scores for the MMSE were used to classify the participants as cognitively impaired or unimpaired. Total and subdomain MMSE scores were computed. Results: 40.56% of participants whose answers to the MMSE sentence were excluded from the analyses had cognitive impairment compared to 13.86% among those whose answers were included. The excluded participants were older and less educated. Women and those older than 80 years had the lowest scores in the MMSE. There was no statistically significant relationship between gender, age, schooling, and textual performance. There was a modest but significant correlation between number of words written and the scores in the Language subdomain. Conclusions: Results suggest the strong influence of schooling and age over MMSE sentence performance. Failing to write a sentence may suggest cognitive impairment, yet, instructions for the MMSE sentence, i.e. to produce a simple sentence, may limit its clinical interpretation.

IDM - A New Parallel Methodology to Calculate the Determinant of Matrices of the Order n, with Computational Complexity O(n)

This paper presents a new parallel methodology for calculating the determinant of matrices of the order n, with computational complexity O(n), using the Gauss-Jordan Elimination Method and Chio's Rule as references. We intend to present our step-by-step methodology using clear mathematical language, where we will demonstrate how to calculate the determinant of a matrix of the order n in an analytical format. We will also present a computational model with one sequential algorithm and one parallel algorithm using a pseudo-code.

The complexity of narrative interferes in the use of conjunctions in children with specific language impairment

PURPOSE: To verify the use of conjunctions in narratives, and to investigate the influence of stimuli's complexity over the type of conjunctions used by children with specific language impairment (SLI) and children with typical language development. METHODS: Participants were 40 children (20 with typical language development and 20 with SLI) with ages between 7 and 10 years, paired by age range. Fifteen stories with increasing of complexity were used to obtain the narratives; stories were classified into mechanical, behavioral and intentional, and each of them was represented by four scenes. Narratives were analyzed according to occurrence and classification of conjunctions. RESULTS: Both groups used more coordinative than subordinate conjunctions, with significant decrease in the use of conjunctions in the discourse of SLI children. The use of conjunctions varied according to the type of narrative: for coordinative conjunctions, both groups differed only between intentional and behavioral narratives, with higher occurrence in behavioral ones; for subordinate conjunctions, typically developing children's performance did not show differences between narratives, while SLI children presented fewer occurrences in intentional narratives, which was different from other narratives. CONCLUSION: Both groups used more coordinative than subordinate conjunctions; however, typically developing children presented more conjunctions than SLI children. The production of children with SLI was influenced by stimulus, since more complex narratives has less use of subordinate conjunctions.

Complexity of inferences in polytree-shaped semi-qualitative probabilistic networks

Semi-qualitative probabilistic networks (SQPNs) merge two important graphical model formalisms: Bayesian networks and qualitative probabilistic networks. They provade a very Complexity of inferences in polytree-shaped semi-qualitative probabilistic networks and qualitative probabilistic networks. They provide a very general modeling framework by allowing the combination of numeric and qualitative assessments over a discrete domain, and can be compactly encoded by exploiting the same factorization of joint probability distributions that are behind the bayesian networks. This paper explores the computational complexity of semi-qualitative probabilistic networks, and takes the polytree-shaped networks as its main target. We show that the inference problem is coNP-Complete for binary polytrees with multiple observed nodes. We also show that interferences can be performed in time linear in the number of nodes if there is a single observed node. Because our proof is construtive, we obtain an efficient linear time algorithm for SQPNs under such assumptions. To the best of our knowledge, this is the first exact polynominal-time algorithm for SQPn. Together these results provide a clear picture of the inferential complexity in polytree-shaped SQPNs.

Quasi-bound alpha resonant states populated by the 12C(6Li,d) reaction.

Several narrow alpha resonant 16O states were detected through the 12C(6Li,d) reaction, in the range of 12 to 17 MeV of excitation energy. The reaction was measured at a bombarding energy of 25.5 MeV employing the São Paulo Pelletron-Enge-Spectrograph facility and the nuclear emulsion technique. Experimental angular distributions associated with four natural parity quasi-bound states ncar the 4α threshold are presented and compared to DWBA predictions.

A Skyrme-like model with an exact BPS bound

We propose a new Skyrme-like model with fields taking values on the sphere S3 or, equivalently, on the group SU(2). The action of the model contains a quadratic kinetic term plus a quartic term which is the same as that of the Skyrme-Faddeev model. The novelty of the model is that it possess a first order Bogomolny type equation whose solutions automatically satisfy the second order Euler-Lagrange equations. It also possesses a lower bound on the static energy which is saturated by the Bogomolny solutions. Such Bogomolny equation is equivalent to the so-called force free equation used in plasma and solar Physics, and which possesses large classes of solutions. An old result due to Chandrasekhar prevents the existence of finite energy solutions for the force free equation on the entire three- dimensional space R3. We construct new exact finite energy solutions to the Bogomolny equations for the case where the space is the three-sphere S3, using toroidal like coordinates.