Rules of origin and trade facilitation

The contents of this article complement those of the recently published FAL Bulletin No. 201, which referred to the rules of origin included in economic integration agreements signed by members of the Latin American Integration Association (LAIA). On this occasion the relationship between rules of origin and facilitation of international trade in goods is examined. The contents of both this issue and of FAL Bulletin No. 201 have been taken from a more extensive document written by the same author, which is publication No. 28 of the ECLAC Comercio Internacional Series, Normas de origen y procedimientos para su administración en América Latina, of May 2003.

Niger Sum: Guerreiro Ramos, o problema do negro e a sociologia do preconceito

Os estudos de Guerreiro Ramos sobre condição do negro no Brasil repõem a questão em novas bases, identificando seu núcleo no reflexo da patologia social do branco brasileiro e na própria atitude dos estudiosos que transformariam o negro-vida em tema. Ramos propõe então a assunção da negritude e a integração social por meio do adestramento cultural, ao que se contrapõe Costa Pinto, ao afirmar a preponderância do negro proletário. Entretanto, ambos pensadores foram relegados pelo racialismo do discurso dominante na atualidade.

Parâmetros erosividade da chuva e da enxurrada correlacionados com as perdas de solo de um solo Bruno Não-Cálcico Vértico em Sumé (PB)

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

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.

O jogo de escopa adaptado para o uso em sala de aula

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Solving the multiobjective environmental/economic dispatch problem using weighted sum and ε-constraint strategies and a predictor-corrector primal-dual interior point method

This paper proposes a technique for solving the multiobjective environmental/economic dispatch problem using the weighted sum and ε-constraint strategies, which transform the problem into a set of single-objective problems. In the first strategy, the objective function is a weighted sum of the environmental and economic objective functions. The second strategy considers one of the objective functions: in this case, the environmental function, as a problem constraint, bounded above by a constant. A specific predictor-corrector primal-dual interior point method which uses the modified log barrier is proposed for solving the set of single-objective problems generated by such strategies. The purpose of the modified barrier approach is to solve the problem with relaxation of its original feasible region, enabling the method to be initialized with unfeasible points. The tests involving the proposed solution technique indicate i) the efficiency of the proposed method with respect to the initialization with unfeasible points, and ii) its ability to find a set of efficient solutions for the multiobjective environmental/economic dispatch problem.

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.

Bioelectrical Impedance Analysis and Skinfold Thickness Sum in Assessing Body Fat Mass of Renal Dialysis Patients

Objective: In chronic renal failure patients under hemodialysis (HD) treatment, the availability of simple, safe, and effective tools to assess body composition enables evaluation of body composition accurately, in spite of changes in body fluids that occur in dialysis therapy, thus contributing to planning and monitoring of nutritional treatment. We evaluated the performance of bioelectrical impedance analysis (BIA) and the skinfold thickness sum (SKF) to assess fat mass (FM) in chronic renal failure patients before (BHD) and after (AHD) HD, using air displacement plethysmography (ADP) as the standard method. Design: This single-center cross-sectional trial involved comparing the FM of 60 HD patients estimated BHD and AHD by BIA (multifrequential; 29 women, 31 men) and by SKF with those estimated by the reference method, ADP. Body fat-free mass (FFM) was also obtained by subtracting the total body fat from the individual total weight. Results: Mean estimated FM (kg [%]) observed by ADP BHD was 17.95 +/- 0.99 kg (30.11% +/- 1.30%), with a 95% confidence interval (CI) of 16.00 to 19.90 (27.56 to 32.66); mean estimated FM observed AHD was 17.92 +/- 1.11 kg (30.04% +/- 1.40%), with a 95% CI of 15.74 to 20.10 (27.28 to 32.79). Neither study period showed a difference in FM and FFM (for both kg and %) estimates by the SKF method when compared with ADP; however, the BIA underestimated the FM and overestimated the FFM (for both kg and %) when compared with ADP. Conclusion: The SKF, but not the BIA, method showed results similar to ADP and can be considered adequate for FM evaluation in HD patients. (C) 2012 by the National Kidney Foundation, Inc. All rights reserved.

Experimental and Theoretical Study on the One- and Two-Photon Absorption Properties of Novel Organic Molecules Based on Phenylacetylene and Azoaromatic Moieties

This Article reports a combined experimental and theoretical analysis on the one and two-photon absorption properties of a novel class of organic molecules with a pi-conjugated backbone based on phenylacetylene (JCM874, FD43, and FD48) and azoaromatic (YB3p2S) moieties. Linear optical properties show that the phenylacetylene-based compounds exhibit strong molar absorptivity in the UV and high fluorescence quantum yield with lifetimes of approximately 2.0 ns, while the azoaromatic-compound has a strong absorption in the visible region with very low fluorescence quantum yield. The two-photon absorption was investigated employing nonlinear optical techniques and quantum chemical calculations based on the response functions formalism within the density functional theory framework. The experimental data revealed well-defined 2PA spectra with reasonable cross-section values in the visible and IR. Along the nonlinear spectra we observed two 2PA allowed bands, as well as the resonance enhancement effect due to the presence of one intermediate one-photon allowed state. Quantum chemical calculations revealed that the 2PA allowed bands correspond to transitions to states that are also one-photon allowed, indicating the relaxation of the electric-dipole selection rules. Moreover, using the theoretical results, we were able to interpret the experimental trends of the 2PA spectra. Finally, using a few-energy-level diagram, within the sum-over-essential states approach, we observed strong qualitative and quantitative correlation between experimental and theoretical results.

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.