Influence of uncorrected refractive error and unmet refractive error on visual impairment in a Brazilian population

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

Visual cues and gait improvement in Parkinson's disease: which piece of information is really important?

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

Epidemiological Models of Directly Transmitted Diseases: An Approach via Fuzzy Sets Theory

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

Construction and decoding of BCH codes over chain of commutative rings

In this paper, we present a new construction and decoding of BCH codes over certain rings. Thus, for a nonnegative integer t, let A0 ⊂ A1 ⊂···⊂ At−1 ⊂ At be a chain of unitary commutative rings, where each Ai is constructed by the direct product of appropriate Galois rings, and its projection to the fields is K0 ⊂ K1 ⊂···⊂ Kt−1 ⊂ Kt (another chain of unitary commutative rings), where each Ki is made by the direct product of corresponding residue fields of given Galois rings. Also, A∗ i and K∗ i are the groups of units of Ai and Ki, respectively. This correspondence presents a construction technique of generator polynomials of the sequence of Bose, Chaudhuri, and Hocquenghem (BCH) codes possessing entries from A∗ i and K∗ i for each i, where 0 ≤ i ≤ t. By the construction of BCH codes, we are confined to get the best code rate and error correction capability; however, the proposed contribution offers a choice to opt a worthy BCH code concerning code rate and error correction capability. In the second phase, we extend the modified Berlekamp-Massey algorithm for the above chains of unitary commutative local rings in such a way that the error will be corrected of the sequences of codewords from the sequences of BCH codes at once. This process is not much different than the original one, but it deals a sequence of codewords from the sequence of codes over the chain of Galois rings.

Linear codes over finite local rings in a chain

For a positive integer $t$, let \begin{equation*} \begin{array}{ccccccccc} (\mathcal{A}_{0},\mathcal{M}_{0}) & \subseteq & (\mathcal{A}_{1},\mathcal{M}_{1}) & \subseteq & & \subseteq & (\mathcal{A}_{t-1},\mathcal{M}_{t-1}) & \subseteq & (\mathcal{A},\mathcal{M}) \\ \cap & & \cap & & & & \cap & & \cap \\ (\mathcal{R}_{0},\mathcal{M}_{0}^{2}) & & (\mathcal{R}_{1},\mathcal{M}_{1}^{2}) & & & & (\mathcal{R}_{t-1},\mathcal{M}_{t-1}^{2}) & & (\mathcal{R},\mathcal{M}^{2}) \end{array} \end{equation*} be a chain of unitary local commutative rings $(\mathcal{A}_{i},\mathcal{M}_{i})$ with their corresponding Galois ring extensions $(\mathcal{R}_{i},\mathcal{M}_{i}^{2})$, for $i=0,1,\cdots,t$. In this paper, we have given a construction technique of the cyclic, BCH, alternant, Goppa and Srivastava codes over these rings. Though, initially in \cite{AP} it is for local ring $(\mathcal{A},\mathcal{M})$, in this paper, this new approach have given a choice in selection of most suitable code in error corrections and code rate perspectives.

Investment theory and empirical approach: a discussion on dificulties

In this paper, we analyse several contributions made concerning investment theory in the last decades. The objective of the paper is to discuss the difficulties of the testable theory identified by Chirinko (1983), Fazzari et al. (1988, 2000), Kaplan and Zingales (1997) and Hubbard (1998) to better understand the results of empirical approach. These few authors we worked with provided theoretical arguments and empirical evidences that internal finance variable of the firms may work as an indicator of financial constraint. In several developed countries, financing constraints has been identified as important to understand the investment spending. The principal indicator of financing constraints, that is, cash-flow has been questioned. However, the evidences offer a support to its relevance. We try to justify such evidence based on the few authors listed above, which have been quoted by empirical works. We try to contribute to debate adding aspect of the corporate finance to offer a logical explanation to econometric difficulties.

Power quality, smart meters and additional information from different power terms

This paper shows how the detailed examination of active and nonactive power components may produce new information for modern smart meters. For this purpose, a prototype of electronic power meter has been implemented and applied to the evaluation of the Conservative Power Theory (CPT). Considering five sorts of loads, under four different operating conditions, the experimental results indicate that the CPT is able to provide a good methodology for load characterization, which could possibly benefits consumers and power utilities in several different ways. The results also show that depending on the situation, the analysis of nonactive power terms may be more important than the observation of traditional power quality indices, such as total harmonic distortion, unbalance factors or the fundamental positive sequence power factor.

A new aspect of sign and its implications for the Theory of Communication

Este artigo propõe que a semiótica peirceana pode oferecer bases tanto lógicas quanto epistemológicas para a busca de uma teoria geral da comunicação. No entanto, o desenvolvimento de uma teoria semiótica da comunicação depende, em primeiro lugar, de uma melhor compreensão dos aspectos formais do signo, tarefa atribuída por Peirce à gramática, o primeiro ramo de sua semiótica. Nós apresentamos uma análise das relações do signo, revelando um aspecto não trabalhado por Peirce, ampliando seu número para onze. Este novo aspecto é a relação triádica entre signo, objeto dinâmico e interpretante dinâmico (S-OD-ID). Nós defendemos que esta relação é essencial para a compreensão da comunicação como semiose, por dar conta da repetição ou redundância do signo comunicativo, quando se cria ou transmite informação. O artigo pretende dar um passo a mais na direção de uma teoria da comunicação verdadeiramente universal, através do vínculo entre a semiótica peirceana e a moderna filosofia da linguagem.

Error Autocorrelation and Linear Regression for Temperature-Based Evapotranspiration Estimates Improvement

Estimates of evapotranspiration on a local scale is important information for agricultural and hydrological practices. However, equations to estimate potential evapotranspiration based only on temperature data, which are simple to use, are usually less trustworthy than the Food and Agriculture Organization (FAO)Penman-Monteith standard method. The present work describes two correction procedures for potential evapotranspiration estimates by temperature, making the results more reliable. Initially, the standard FAO-Penman-Monteith method was evaluated with a complete climatologic data set for the period between 2002 and 2006. Then temperature-based estimates by Camargo and Jensen-Haise methods have been adjusted by error autocorrelation evaluated in biweekly and monthly periods. In a second adjustment, simple linear regression was applied. The adjusted equations have been validated with climatic data available for the Year 2001. Both proposed methodologies showed good agreement with the standard method indicating that the methodology can be used for local potential evapotranspiration estimates.

COMPLEXITY MEASURE: A QUANTUM INFORMATION APPROACH

In the past decades, all of the efforts at quantifying systems complexity with a general tool has usually relied on using Shannon's classical information framework to address the disorder of the system through the Boltzmann-Gibbs-Shannon entropy, or one of its extensions. However, in recent years, there were some attempts to tackle the quantification of algorithmic complexities in quantum systems based on the Kolmogorov algorithmic complexity, obtaining some discrepant results against the classical approach. Therefore, an approach to the complexity measure is proposed here, using the quantum information formalism, taking advantage of the generality of the classical-based complexities, and being capable of expressing these systems' complexity on other framework than its algorithmic counterparts. To do so, the Shiner-Davison-Landsberg (SDL) complexity framework is considered jointly with linear entropy for the density operators representing the analyzed systems formalism along with the tangle for the entanglement measure. The proposed measure is then applied in a family of maximally entangled mixed state.

Holographic field theory models of dark energy in interaction with dark matter

We discuss two Lagrangian interacting dark energy models in the context of the holographic principle. The potentials of the interacting fields are constructed. The models are compared with CMB distance information, baryonic acoustic oscillations, lookback time and the Constitution supernovae sample. For both models, the results are consistent with a nonvanishing interaction in the dark sector of the Universe and the sign of coupling is consistent with dark energy decaying into dark matter, alleviating the coincidence problem-with more than 3 standard deviations of confidence for one of them. However, this is because the noninteracting holographic dark energy model is a bad fit to the combination of data sets used in this work as compared to the cosmological constant with cold dark matter model, so that one needs to introduce the interaction in order to improve this model.

Universal behavior of the Shannon mutual information of critical quantum chains

We consider the Shannon mutual information of subsystems of critical quantum chains in their ground states. Our results indicate a universal leading behavior for large subsystem sizes. Moreover, as happens with the entanglement entropy, its finite-size behavior yields the conformal anomaly c of the underlying conformal field theory governing the long-distance physics of the quantum chain. We study analytically a chain of coupled harmonic oscillators and numerically the Q-state Potts models (Q = 2, 3, and 4), the XXZ quantum chain, and the spin-1 Fateev-Zamolodchikov model. The Shannon mutual information is a quantity easily computed, and our results indicate that for relatively small lattice sizes, its finite-size behavior already detects the universality class of quantum critical behavior.

Research and theory driven insights: ten suggestions for L2 reading instruction

[EN]Research and theory on second language reading has reached heightened dimensions in recent years. It is through reading that learners access much information concerning the target language and culture, and consequently reading is an important part of almost all language programs across stages of acquisition. The purpose of this article is to offer informed suggestions for the foreign language instructor of reading. The ideas given in this paper constitute a collaborative project that developed as part of a graduate seminar on L2 Reading and Writing taught at Washington University in St. Louis.

Cooperative Wireless Networks for Localization

This thesis adresses the problem of localization, and analyzes its crucial aspects, within the context of cooperative WSNs. The three main issues discussed in the following are: network synchronization, position estimate and tracking. Time synchronization is a fundamental requirement for every network. In this context, a new approach based on the estimation theory is proposed to evaluate the ultimate performance limit in network time synchronization. In particular the lower bound on the variance of the average synchronization error in a fully connected network is derived by taking into account the statistical characterization of the Message Delivering Time (MDT) . Sensor network localization algorithms estimate the locations of sensors with initially unknown location information by using knowledge of the absolute positions of a few sensors and inter-sensor measurements such as distance and bearing measurements. Concerning this issue, i.e. the position estimate problem, two main contributions are given. The first is a new Semidefinite Programming (SDP) framework to analyze and solve the problem of flip-ambiguity that afflicts range-based network localization algorithms with incomplete ranging information. The occurrence of flip-ambiguous nodes and errors due to flip ambiguity is studied, then with this information a new SDP formulation of the localization problem is built. Finally a flip-ambiguity-robust network localization algorithm is derived and its performance is studied by Monte-Carlo simulations. The second contribution in the field of position estimate is about multihop networks. A multihop network is a network with a low degree of connectivity, in which couples of given any nodes, in order to communicate, they have to rely on one or more intermediate nodes (hops). Two new distance-based source localization algorithms, highly robust to distance overestimates, typically present in multihop networks, are presented and studied. The last point of this thesis discuss a new low-complexity tracking algorithm, inspired by the Fano’s sequential decoding algorithm for the position tracking of a user in a WLAN-based indoor localization system.

O (alpha 4 s) loop-by-loop contributions to heavy quark pair production in hadronic collisions

The present state of the theoretical predictions for the hadronic heavy hadron production is not quite satisfactory. The full next-to-leading order (NLO) ${cal O} (alpha_s^3)$ corrections to the hadroproduction of heavy quarks have raised the leading order (LO) ${cal O} (alpha_s^2)$ estimates but the NLO predictions are still slightly below the experimental numbers. Moreover, the theoretical NLO predictions suffer from the usual large uncertainty resulting from the freedom in the choice of renormalization and factorization scales of perturbative QCD.In this light there are hopes that a next-to-next-to-leading order (NNLO) ${cal O} (alpha_s^4)$ calculation will bring theoretical predictions even closer to the experimental data. Also, the dependence on the factorization and renormalization scales of the physical process is expected to be greatly reduced at NNLO. This would reduce the theoretical uncertainty and therefore make the comparison between theory and experiment much more significant. In this thesis I have concentrated on that part of NNLO corrections for hadronic heavy quark production where one-loop integrals contribute in the form of a loop-by-loop product. In the first part of the thesis I use dimensional regularization to calculate the ${cal O}(ep^2)$ expansion of scalar one-loop one-, two-, three- and four-point integrals. The Laurent series of the scalar integrals is needed as an input for the calculation of the one-loop matrix elements for the loop-by-loop contributions. Since each factor of the loop-by-loop product has negative powers of the dimensional regularization parameter $ep$ up to ${cal O}(ep^{-2})$, the Laurent series of the scalar integrals has to be calculated up to ${cal O}(ep^2)$. The negative powers of $ep$ are a consequence of ultraviolet and infrared/collinear (or mass ) divergences. Among the scalar integrals the four-point integrals are the most complicated. The ${cal O}(ep^2)$ expansion of the three- and four-point integrals contains in general classical polylogarithms up to ${rm Li}_4$ and $L$-functions related to multiple polylogarithms of maximal weight and depth four. All results for the scalar integrals are also available in electronic form. In the second part of the thesis I discuss the properties of the classical polylogarithms. I present the algorithms which allow one to reduce the number of the polylogarithms in an expression. I derive identities for the $L$-functions which have been intensively used in order to reduce the length of the final results for the scalar integrals. I also discuss the properties of multiple polylogarithms. I derive identities to express the $L$-functions in terms of multiple polylogarithms. In the third part I investigate the numerical efficiency of the results for the scalar integrals. The dependence of the evaluation time on the relative error is discussed. In the forth part of the thesis I present the larger part of the ${cal O}(ep^2)$ results on one-loop matrix elements in heavy flavor hadroproduction containing the full spin information. The ${cal O}(ep^2)$ terms arise as a combination of the ${cal O}(ep^2)$ results for the scalar integrals, the spin algebra and the Passarino-Veltman decomposition. The one-loop matrix elements will be needed as input in the determination of the loop-by-loop part of NNLO for the hadronic heavy flavor production.