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)

Direitos e garantias fundamentais no direito societário

Pós-graduação em Direito - FCHS

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)

Considerações da lei falimentar no direito brasileiro em comparação ao direito francês

This article brings brief comparison of Brazilian bankruptcy law between the French law of societies in difficulties. In this way, an analysis of the legal provisions of the two countries, to the end see if both aim at the preservation of the company, respectively, Law Recovery and Bankruptcy no. 11.101/05, in Code de Commerce - French commercial code, chapter Des difficultés des enterprises.

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.

CC96-396 Productcion Flexibility Contracts: Provisions, Implications and the Participation Decision

The Federal Agriculture Improvement and Reform (FAIR) Act of 1996 (P.L. 104-127) was signed into law by President Clinton on April 4, 1996. Most provisions of the new law, including the commodity provisions, will be effective for seven years, 1996-2002. Unlike previous farm bills, provisions relating to commodity supports are grouped together under what is known as the Agricultural Market Transition Act (AMTA) program. Producers of seven commodities: corn, sorghum, barley, oats, wheat, rice and cotton must sign Productive Flexibility Contracts (PFCs) to participate in the AMTA. These seven commodities are referred to as "contract commodities." This publication focuses on the PFCs, beginning with an overview of contract provisions. Potential short- and long-run implications of PFCs are then discussed.

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.

Huckebein is part of a combinatorial repression code in the anterior blastoderm

The hierarchy of the segmentation cascade responsible for establishing the Drosophila body plan is composed by gap, pair-rule and segment polarity genes. However, no pair-rule stripes are formed in the anterior regions of the embryo. This lack of stripe formation, as well as other evidence from the literature that is further investigated here, led us to the hypothesis that anterior gap genes might be involved in a combinatorial mechanism responsible for repressing the cis-regulatory modules (CRMs) of hairy (h), even-skipped (eve), runt (run), and fushi-tarazu (ftz) anterior-most stripes. In this study, we investigated huckebein (hkb), which has a gap expression domain at the anterior tip of the embryo. Using genetic methods we were able to detect deviations from the wild-type patterns of the anterior-most pair-rule stripes in different genetic backgrounds, which were consistent with Hkb-mediated repression. Moreover, we developed an image processing tool that, for the most part, confirmed our assumptions. Using an hkb misexpression system, we further detected specific repression on anterior stripes. Furthermore, bioinformatics analysis predicted an increased significance of binding site clusters in the CRMs of h 1, eve 1, run 1 and ftz 1 when Hkb was incorporated in the analysis, indicating that Hkb plays a direct role in these CRMs. We further discuss that Hkb and Slp1, which is the other previously identified common repressor of anterior stripes, might participate in a combinatorial repression mechanism controlling stripe CRMs in the anterior parts of the embryo and define the borders of these anterior stripes. (C) 2011 Elsevier Inc. All rights reserved.

Shear force and torsion in reinforced concrete beam elements: theoretical analysis based on Brazilian Standard Code ABNT NBR 6118:2007

Reinforced concrete beam elements are submitted to applicable loads along their life cycle that cause shear and torsion. These elements may be subject to only shear, pure torsion or both, torsion and shear combined. The Brazilian Standard Code ABNT NBR 6118:2007 [1] fixes conditions to calculate the transverse reinforcement area in beam reinforced concrete elements, using two design models, based on the strut and tie analogy model, first studied by Mörsch [2]. The strut angle θ (theta) can be considered constant and equal to 45º (Model I), or varying between 30º and 45º (Model II). In the case of transversal ties (stirrups), the variation of angle α (alpha) is between 45º and 90º. When the equilibrium torsion is required, a resistant model based on space truss with hollow section is considered. The space truss admits an inclination angle θ between 30º and 45º, in accordance with beam elements subjected to shear. This paper presents a theoretical study of models I and II for combined shear and torsion, in which ranges the geometry and intensity of action in reinforced concrete beams, aimed to verify the consumption of transverse reinforcement in accordance with the calculation model adopted As the strut angle on model II ranges from 30º to 45º, transverse reinforcement area (Asw) decreases, and total reinforcement area, which includes longitudinal torsion reinforcement (Asℓ), increases. It appears that, when considering model II with strut angle above 40º, under shear only, transverse reinforcement area increases 22% compared to values obtained using model I.