Desempenho operacional e energético, segundo a norma OECD – code 2 de dois tratores agrícolas 4x2 TDA com motores de 132 kw em pista concreto e solo agrícola

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

What is the best additive to use at the ensiling of sugarcane SP81-3250?

Our objective was to determine the best additive to use for the ensiling of sugarcane SP81-3250 based on the nutritional properties and aerobic stability of the silages. The additives evaluated were (1) and (2): salt (NaCl) at rates of 1.0 or 2.0 kg/100 kg fresh sugarcane (as-is basis), respectively; (3) and (4): quicklime (CaO) at rates of 1.0 or 2.0 kg/100 kg fresh sugarcane, respectively; (5) and (6): commercial inoculants Silobac (R) and Maize All (R); and a control treatment. The addition of quicklime reduced the NDF and ADF contents of the silages by 11% compared with the control treatment, but did not increase the digestibility. On the other hand, after 24 h of in vitro fermentation, the application of 1.0 and 2.0% salt reduced the gas production by 34.15 and 33.55 mL/g OM, respectively, and the IVOMD was reduced 5.74 and 5.90%, respectively, compared with the untreated silage. Moreover, the addition of quicklime elevated the pH of the sugarcane silages, with a trend towards an increase in the DM recovery. In contrast, the bacterial inoculants did not alter the pH values, but there was an upward trend for a DM recovery. After the silos were opened, the silages that were treated with salt (independent of the dose) and 1.0% quicklime exhibited greater stability. We recommend applying 1.0 kg of quicklime to each 100 kg of sugarcane at the time of ensiling to improve the nutritional characteristics of sugarcane silage variety SP81-3250.

As relações públicas na ambiência da comunicação móvel digital: o QR code como estratégia de comunicação

The internet as well as all technologies arising from it are transforming and changing socially and economically, the forms of relationships between people and organizations. The environment of digital mobile communication is on the rise, allowing more communication strategies in public relations to be enhanced, in order to allow effective dialogue, relationship and interaction between organizations and their stakeholders. Accordingly, the purpose of this paper is to analyze digital communications, especially a locative media tool that has been gaining ground in communication activities: Quick Response Code. So in addition to conceptualize and contextualize it, one tried to map out various campaigns, both national and international, who made use of the QR Code, highlighting the strategic role that this tool can have in Integrated PR planning, in order to create visibility and to establish effective and lasting relationships with the brand / organization

A BCH code and a sequence of cyclic codes

This study establishes that for a given binary BCH code C0 n of length n generated by a polynomial g(x) ∈ F2[x] of degree r there exists a family of binary cyclic codes {Cm 2m−1(n+1)n}m≥1 such that for each m ≥ 1, the binary cyclic code Cm 2m−1(n+1)n has length 2m−1(n + 1)n and is generated by a generalized polynomial g(x 1 2m ) ∈ F2[x, 1 2m Z≥0] of degree 2mr. Furthermore, C0 n is embedded in Cm 2m−1(n+1)n and Cm 2m−1(n+1)n is embedded in Cm+1 2m(n+1)n for each m ≥ 1. By a newly proposed algorithm, codewords of the binary BCH code C0 n can be transmitted with high code rate and decoded by the decoder of any member of the family {Cm 2m−1(n+1)n}m≥1 of binary cyclic codes, having the same code rate.

A decoding procedure which improves code rate and error corrections

Corresponding to $C_{0}[n,n-r]$, a binary cyclic code generated by a primitive irreducible polynomial $p(X)\in \mathbb{F}_{2}[X]$ of degree $r=2b$, where $b\in \mathbb{Z}^{+}$, we can constitute a binary cyclic code $C[(n+1)^{3^{k}}-1,(n+1)^{3^{k}}-1-3^{k}r]$, which is generated by primitive irreducible generalized polynomial $p(X^{\frac{1}{3^{k}}})\in \mathbb{F}_{2}[X;\frac{1}{3^{k}}\mathbb{Z}_{0}]$ with degree $3^{k}r$, where $k\in \mathbb{Z}^{+}$. This new code $C$ improves the code rate and has error corrections capability higher than $C_{0}$. The purpose of this study is to establish a decoding procedure for $C_{0}$ by using $C$ in such a way that one can obtain an improved code rate and error-correcting capabilities for $C_{0}$.

Referência e code-switching: traços de singularidade na linguagem de uma criança bilíngue

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

Thermal and spectroscopic studies of the antioxidant food additive propyl gallate

Literature mentions propyl gallate (PG) as a non-toxic synthetic antioxidant that can be used as a food additive due to its high tolerance to heat. It is important to understand the thermal properties and to identify the decomposition products of this substance, since it has been reported to be thermally stable at temperatures as high as 300 °C. Simultaneous thermogravimetry-differential thermal analysis (TG-DTA), differential scanning calorimetry-photovisual (DSC-photovisual), coupled thermogravimetry-infrared spectroscopy (TG-FTIR) analyses and spectroscopic techniques were used to study the food additive PG. The TG-DTA curves, which were performed with the aid of DSC-photovisual, provided information concerning the thermal stability and decomposition profiles of the compound. From the TG-FTIR coupled techniques, it was possible to identify n-propanol as a possible volatile compound released during the thermal decomposition of the antioxidant. A complete spectroscopic characterization in the ultraviolet, visible, near and middle infrared regions was performed in order to understand the spectroscopic properties of PG.

A formalized optimum code search for q-ary trellis codes

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

The Impact of Software Evolution on Code Coverage Information

Many tools and techniques for addressing software maintenance problems rely on code coverage information. Often, this coverage information is gathered for a specific version of a software system, and then used to perform analyses on subsequent versions of that system without being recalculated. As a software system evolves, however, modifications to the software alter the software’s behavior on particular inputs, and code coverage information gathered on earlier versions of a program may not accurately reflect the coverage that would be obtained on later versions. This discrepancy may affect the success of analyses dependent on code coverage information. Despite the importance of coverage information in various analyses, in our search of the literature we find no studies specifically examining the impact of software evolution on code coverage information. Therefore, we conducted empirical studies to examine this impact. The results of our studies suggest that even relatively small modifications can greatly affect code coverage information, and that the degree of impact of change on coverage may be difficult to predict.

Using Source-Code Analysis to Help End-user Programmers Create Dependable Software

Not long ago, most software was written by professional programmers, who could be presumed to have an interest in software engineering methodologies and in tools and techniques for improving software dependability. Today, however, a great deal of software is written not by professionals but by end-users, who create applications such as multimedia simulations, dynamic web pages, and spreadsheets. Applications such as these are often used to guide important decisions or aid in important tasks, and it is important that they be sufficiently dependable, but evidence shows that they frequently are not. For example, studies have shown that a large percentage of the spreadsheets created by end-users contain faults. Despite such evidence, until recently, relatively little research had been done to help end-users create more dependable software. We have been working to address this problem by finding ways to provide at least some of the benefits of formal software engineering techniques to end-user programmers. In this talk, focusing on the spreadsheet application paradigm, I present several of our approaches, focusing on methodologies that utilize source-code-analysis techniques to help end-users build more dependable spreadsheets. Behind the scenes, our methodologies use static analyses such as dataflow analysis and slicing, together with dynamic analyses such as execution monitoring, to support user tasks such as validation and fault localization. I show how, to accommodate the user base of spreadsheet languages, an interface to these methodologies can be provided in a manner that does not require an understanding of the theory behind the analyses, yet supports the interactive, incremental process by which spreadsheets are created. Finally, I present empirical results gathered in the use of our methodologies that highlight several costs and benefits trade-offs, and many opportunities for future work.

The Influence of Schematic Knowledge on Contradictory versus Additive Misinformation: False Memory for Typical and Atypical Items

In the current study, we examined the influence of schema consistency on contradictory and additive misinformation. Sixty-four participants were shown a series of still photographs of common scenes (e.g., a kitchen), were later exposed to narratives containing misinformation, and were then tested on their memory of the photographic scenes. In addition, participants were asked to reflect on their phenomenological experience of remembering by giving remember/know responses. Participants reported greater false memory for schema-inconsistent items than schema-consistent items. The findings failed to replicate Roediger, Meade, and Bergman (2001). Explanations for the discrepant findings are discussed.

Estimation methods of non-additive effects for characteristics of weight and scrotal circumference in crossbred beef cattle

The objective of this study was to investigate, in a population of crossbred cattle, the obtainment of the non-additive genetic effects for the characteristics weight at 205 and 390 days and scrotal circumference, and to evaluate the consideration of these effects in the prediction of breeding values of sires using different estimation methodologies. In method 1, the data were pre-adjusted for the non-additive effects obtained by least squares means method in a model that considered the direct additive, maternal and non-additive fixed genetic effects, the direct and total maternal heterozygosities, and epistasis. In method 2, the non-additive effects were considered covariates in genetic model. Genetic values for adjusted and non-adjusted data were predicted considering additive direct and maternal effects, and for weight at 205 days, also the permanent environmental effect, as random effects in the model. The breeding values of the categories of sires considered for the weight characteristic at 205 days were organized in files, in order to verify alterations in the magnitude of the predictions and ranking of animals in the two methods of correction data for the non-additives effects. The non-additive effects were not similar in magnitude and direction in the two estimation methods used, nor for the characteristics evaluated. Pearson and Spearman correlations between breeding values were higher than 0.94, and the use of different methods does not imply changes in the selection of animals.

Ractopamine as a Metabolic Modifier Feed Additive for Finishing Pigs: A Review

The beta-adrenergic agonist ractopamine is increasingly used in the swine industry due to higher consumer demand for leaner pork products. Redirecting nutrients to favor leanness rather than fat deposition, ractopamine improves growth and carcass traits of finishing pigs. However, the impact of this agonist on pork quality is not clearly defined. Understanding the biological effects of dietary ractopamine dose, treatment period, lysine levels, and the lysine to metabolizable energy ratio will help pork producers achieve improvements in animal performance, carcass leanness, and economic efficiency in swine production systems.

Optimal Code Set Selection and Security Issues in Spectral Phase-Encoded Time Spreading (SPECTS) OCDMA Systems

In this paper, we perform a thorough analysis of a spectral phase-encoded time spreading optical code division multiple access (SPECTS-OCDMA) system based on Walsh-Hadamard (W-H) codes aiming not only at finding optimal code-set selections but also at assessing its loss of security due to crosstalk. We prove that an inadequate choice of codes can make the crosstalk between active users to become large enough so as to cause the data from the user of interest to be detected by other user. The proposed algorithm for code optimization targets code sets that produce minimum bit error rate (BER) among all codes for a specific number of simultaneous users. This methodology allows us to find optimal code sets for any OCDMA system, regardless the code family used and the number of active users. This procedure is crucial for circumventing the unexpected lack of security due to crosstalk. We also show that a SPECTS-OCDMA system based on W-H 32(64) fundamentally limits the number of simultaneous users to 4(8) with no security violation due to crosstalk. More importantly, we prove that only a small fraction of the available code sets is actually immune to crosstalk with acceptable BER (<10(-9)) i.e., approximately 0.5% for W-H 32 with four simultaneous users, and about 1 x 10(-4)% for W-H 64 with eight simultaneous users.

Is a Genome a Codeword of an Error-Correcting Code?

Since a genome is a discrete sequence, the elements of which belong to a set of four letters, the question as to whether or not there is an error-correcting code underlying DNA sequences is unavoidable. The most common approach to answering this question is to propose a methodology to verify the existence of such a code. However, none of the methodologies proposed so far, although quite clever, has achieved that goal. In a recent work, we showed that DNA sequences can be identified as codewords in a class of cyclic error-correcting codes known as Hamming codes. In this paper, we show that a complete intron-exon gene, and even a plasmid genome, can be identified as a Hamming code codeword as well. Although this does not constitute a definitive proof that there is an error-correcting code underlying DNA sequences, it is the first evidence in this direction.