Sistemas de rankings para avaliação de políticas públicas e redução de assimetria de informação na decisão do voto

O objetivo deste trabalho é abordar uma das linhas de investigação que tenta explicar o comportamento dos indivíduos no voto, a teoria da escolha racional ou teoria econômica do voto, a qual defende que os eleitores votam em governantes ou partidos potencialmente capazes de trazer-lhes algum benefício social ou econômico. No entanto, a relação entre desempenho de indicadores socioeconômicos e o resultado das urnas não se mostra tão evidente. A elevada assimetria de informação presente entre eleitores e formuladores de políticas públicas, além do problema conhecido como bounded memory, pode ajudar a explicar a não identificação ou a frágil evidência de racionalidade econômica no voto. Uma forma de tentar dirimir esses problemas, particularmente no caso de eleições estaduais, é através da divulgação de sistemas de rankings estaduais, que sejam de simples interpretação para o eleitorado. Assim, é feita uma proposta de elaboração de um ranking de desenvolvimento estadual que, por fim, é utilizado para testar a presença de racionalidade econômica nas eleições estaduais brasileiras. Os resultados não mostraram indicações de escolha racional nas eleições estaduais brasileiras e reforçam o argumento de que há elevada assimetria de informação e de bounded memory, o que poderia ser dirimido, ao menos em parte, com a maior propagação de sistemas de rankings estaduais.

Does bounded rationality lead to individual heterogeneity? The impact of the experimentation process and of memory constraints

In this paper we explore the effect of bounded rationality on the convergence of individual behavior toward equilibrium. In the context of a Cournot game with a unique and symmetric Nash equilibrium, firms are modeled as adaptive economic agents through a genetic algorithm. Computational experiments show that (1) there is remarkable heterogeneity across identical but boundedly rational agents; (2) such individual heterogeneity is not simply a consequence of the random elements contained in the genetic algorithm; (3) the more rational agents are in terms of memory abilities and pre-play evaluation of strategies, the less heterogeneous they are in their actions. At the limit case of full rationality, the outcome converges to the standard result of uniform individual behavior.

Software transactional memory as a building block for parallel embedded realtime systems

The recent trends of chip architectures with higher number of heterogeneous cores, and non-uniform memory/non-coherent caches, brings renewed attention to the use of Software Transactional Memory (STM) as a fundamental building block for developing parallel applications. Nevertheless, although STM promises to ease concurrent and parallel software development, it relies on the possibility of aborting conflicting transactions to maintain data consistency, which impacts on the responsiveness and timing guarantees required by embedded real-time systems. In these systems, contention delays must be (efficiently) limited so that the response times of tasks executing transactions are upper-bounded and task sets can be feasibly scheduled. In this paper we assess the use of STM in the development of embedded real-time software, defending that the amount of contention can be reduced if read-only transactions access recent consistent data snapshots, progressing in a wait-free manner. We show how the required number of versions of a shared object can be calculated for a set of tasks. We also outline an algorithm to manage conflicts between update transactions that prevents starvation.

Exponential stability for a plate equation with p-Laplacian and memory terms

This paper is concerned with the energy decay for a class of plate equations with memory and lower order perturbation of p-Laplacian type, utt+?2u-?pu+?0tg(t-s)?u(s)ds-?ut+f(u)=0inOXR+, with simply supported boundary condition, where O is a bounded domain of RN, g?>?0 is a memory kernel that decays exponentially and f(u) is a nonlinear perturbation. This kind of problem without the memory term models elastoplastic flows.

The Intrahippocampal Infusion Of Crotamine From Crotalus Durissus Terrificus Venom Enhances Memory Persistence In Rats.

Previous research has shown that crotamine, a toxin isolated from the venom of Crotalus durissus terrificus, induces the release of acetylcholine and dopamine in the central nervous system of rats. Particularly, these neurotransmitters are important modulators of memory processes. Therefore, in this study we investigated the effects of crotamine infusion on persistence of memory in rats. We verified that the intrahippocampal infusion of crotamine (1 μg/μl; 1 μl/side) improved the persistence of object recognition and aversive memory. By other side, the intrahippocampal infusion of the toxin did not alter locomotor and exploratory activities, anxiety or pain threshold. These results demonstrate a future prospect of using crotamine as potential pharmacological tool to treat diseases involving memory impairment, although it is still necessary more researches to better elucidate the crotamine effects on hippocampus and memory.

Metabolic Memory Of ß-cells Controls Insulin Secretion And Is Mediated By Camkii.

Ca(2+)/calmodulin-dependent protein kinase II (CaMKII) functions both in regulation of insulin secretion and neurotransmitter release through common downstream mediators. Therefore, we hypothesized that pancreatic ß-cells acquire and store the information contained in calcium pulses as a form of metabolic memory, just as neurons store cognitive information. To test this hypothesis, we developed a novel paradigm of pulsed exposure of ß-cells to intervals of high glucose, followed by a 24-h consolidation period to eliminate any acute metabolic effects. Strikingly, ß-cells exposed to this high-glucose pulse paradigm exhibited significantly stronger insulin secretion. This metabolic memory was entirely dependent on CaMKII. Metabolic memory was reflected on the protein level by increased expression of proteins involved in glucose sensing and Ca(2+)-dependent vesicle secretion, and by elevated levels of the key ß-cell transcription factor MAFA. In summary, like neurons, human and mouse ß-cells are able to acquire and retrieve information.

Long-term social recognition memory in adult male rats: factor analysis of the social and non-social behaviors

A modified version of the intruder-resident paradigm was used to investigate if social recognition memory lasts at least 24 h. One hundred and forty-six adult male Wistar rats were used. Independent groups of rats were exposed to an intruder for 0.083, 0.5, 2, 24, or 168 h and tested 24 h after the first encounter with the familiar or a different conspecific. Factor analysis was employed to identify associations between behaviors and treatments. Resident rats exhibited a 24-h social recognition memory, as indicated by a 3- to 5-fold decrease in social behaviors in the second encounter with the same conspecific compared to those observed for a different conspecific, when the duration of the first encounter was 2 h or longer. It was possible to distinguish between two different categories of social behaviors and their expression depended on the duration of the first encounter. Sniffing the anogenital area (49.9% of the social behaviors), sniffing the body (17.9%), sniffing the head (3%), and following the conspecific (3.1%), exhibited mostly by resident rats, characterized social investigation and revealed long-term social recognition memory. However, dominance (23.8%) and mild aggression (2.3%), exhibited by both resident and intruders, characterized social agonistic behaviors and were not affected by memory. Differently, sniffing the environment (76.8% of the non-social behaviors) and rearing (14.3%), both exhibited mostly by adult intruder rats, characterized non-social behaviors. Together, these results show that social recognition memory in rats may last at least 24 h after a 2-h or longer exposure to the conspecific.

Modified silicas covalently bounded to 5,10,15,20-tetrakis(2-hydroxy-5-nitrophenyl)porphyrinato iron(III): synthesis, spectroscopic and EPR characterization. Catalytic studies

In this work we have studied cyclooctene epoxidation with PhIO, using a new iron porphyrin, 5,10,15,20-tetrakis(2-hydroxy-5-nitrophenyl)porphyrinato iron(III), supported on silica matrices via eletrostatic interaction and / or covalent bonds as catalyst. These catalysts were obtained and immobilized on the solid supports propyltrimethylammonium silica (SiN+); propyltrimethylammonium and propylimidazole silica [SiN+(IPG)] and chloropropylsilica (CPS) via elestrostatic interactions and covalent binding. Characterization of the supported catalysts by UV-Vis spectroscopy and EPR (Electron paramagnetic resonance) indicated the presence of a mixture of FeII and FeIII species in all of the three obtained catalysts. In the case of (Z)-cyclooctene epoxidation by PhIO the yields observed for cis-epoxycyclooctane were satisfactory for the reactions catalyzed by the three materials (ranging from 68% to 85%). Such results indicate that immobilization of metalloporphyrins onto solid supports via groups localized on the ortho positions of their mesophenyl rings can lead to efficient catalysts for epoxidation reactions. The catalyst 1-CPS is less active than 1-SiN and 1-SiN(IPG), this argues in favour of the immobilization of this metalloporphyrin onto solids via electrostatic interactions, which is easier to achieve and results in more active oxidation catalysts. Interestingly, the activity of the supported catalysts remained the same even after three successive recyclings; therefore, they are stable under the oxidizing conditions.

Working memory impairment in multiple sclerosis relapsing-remitting patients with episodic memory deficits

Episodic memory is impaired in multiple sclerosis (MS) patients, possibly because of deficits in working memory (WM) functioning. If so, WM alterations should necessarily be found in patients with episodic memory deficits, but this has not yet been demonstrated. In this study we aimed at determining whether episodic memory deficits in relapsing-remitting MS are found in conjunction with impaired WM. We evaluated 32 MS patients and 32 matched healthy controls. Nineteen of the 32 patients had episodic memory impairment, and as a group only these individuals showed deficits in WM capacity, which may lead to difficulty in encoding, and/or retrieving information from episodic memory.

ASSOCIATION OF A MYOSIN MOTOR WITH MEMBRANE-BOUNDED PIGMENT GRANULES IN FRESHWATER SHRIMP CHROMATOPHORES: EVIDENCE FROM THE NITELLA ACTIN-CABLE ASSAY

We have adapted an actin-mosin motility assay to examine the interactions in vitro between actin cables isolated from the giant internodal cells of the freshwater alga, Nitella, and pigment granules extracted from red ovarian chromatophores of the freshwater palaemonid shrimp, Macrobrachium olfersi. The chromatophore pigment mass consists of large (0.5-1.0-mu m diameter) membrane-bounded granules, and small (140-nm diameter), a membranous granules, both structurally continuous with the abundant smooth endoplasmic reticulum. Our previous immunocytochemical studies show a myosin motor to be stably associated with the pigment mass; however, to which granule type or membrane the myosin motor is attached is unclear. Here, we show that sodium vanadate, a myosin ATPase inhibitor, markedly increases the affinity of isolated, large, membrane-bounded granules for Nitella actin cables to which they become permanently attached. This interaction does not occur in granule preparations containing ATP with uninhibited, active myosin without vanadate. We propose that a stable state of elevated affinity is established between the granule-located myosin motor and the Nitella actin cables, resulting from a vanadate-inhibited acto-myosin-ADP complex. This finding provides further evidence for a myosin motor positioned on the surface of the membrane-bounded pigment granules in shrimp ovarian chromatophores.

Influence of memory in deterministic walks in random media: Analytical calculation within a mean-field approximation

Consider a random medium consisting of N points randomly distributed so that there is no correlation among the distances separating them. This is the random link model, which is the high dimensionality limit (mean-field approximation) for the Euclidean random point structure. In the random link model, at discrete time steps, a walker moves to the nearest point, which has not been visited in the last mu steps (memory), producing a deterministic partially self-avoiding walk (the tourist walk). We have analytically obtained the distribution of the number n of points explored by the walker with memory mu=2, as well as the transient and period joint distribution. This result enables us to explain the abrupt change in the exploratory behavior between the cases mu=1 (memoryless walker, driven by extreme value statistics) and mu=2 (walker with memory, driven by combinatorial statistics). In the mu=1 case, the mean newly visited points in the thermodynamic limit (N >> 1) is just < n >=e=2.72... while in the mu=2 case, the mean number < n > of visited points grows proportionally to N(1/2). Also, this result allows us to establish an equivalence between the random link model with mu=2 and random map (uncorrelated back and forth distances) with mu=0 and the abrupt change between the probabilities for null transient time and subsequent ones.

Chaotic model and memory in single calcium-activated potassium channel kinetics

Ion channels are pores formed by proteins and responsible for carrying ion fluxes through cellular membranes. The ion channels can assume conformational states thereby controlling ion flow. Physically, the conformational transitions from one state to another are associated with energy barriers between them and are dependent on stimulus, such as, electrical field, ligands, second messengers, etc. Several models have been proposed to describe the kinetics of ion channels. The classical Markovian model assumes that a future transition is independent of the time that the ion channel stayed in a previous state. Others models as the fractal and the chaotic assume that the rate of transitions between the states depend on the time that the ionic channel stayed in a previous state. For the calcium activated potassium channels of Leydig cells the R/S Hurst analysis has indicated that the channels are long-term correlated with a Hurst coefficient H around 0.7, showing a persistent memory in this kinetic. Here, we applied the R/S analysis to the opening and closing dwell time series obtained from simulated data from a chaotic model proposed by L. Liebovitch and T. Toth [J. Theor. Biol. 148, 243 (1991)] and we show that this chaotic model or any model that treats the set of channel openings and closings as independent events is inadequate to describe the long-term correlation (memory) already described for the experimental data. (C) 2008 American Institute of Physics.

Mn-doped cubic BN as an atomiclike memory device: A density functional study

We investigate the electronic properties of Mn(B) substitutional doping in cubic boron nitride (BN), for different charge states, using density functional theory (DFT) calculations. We show that the neutral Mn has a nonmagnetic ground state (S=0). Upon charge injection, it is unambiguously shown that the Mn(B)(-) has a high-spin configuration with a strong, localized magnetic moment of 5 mu(Bohr). We developed a simple model, parameterized by the DFT results, that allows us to interpret the rules played by the crystal-field and exchange-correlation splitting in the magnetization process.

Lossless filter for multiple repeats with bounded edit distance

Background: Identifying local similarity between two or more sequences, or identifying repeats occurring at least twice in a sequence, is an essential part in the analysis of biological sequences and of their phylogenetic relationship. Finding such fragments while allowing for a certain number of insertions, deletions, and substitutions, is however known to be a computationally expensive task, and consequently exact methods can usually not be applied in practice. Results: The filter TUIUIU that we introduce in this paper provides a possible solution to this problem. It can be used as a preprocessing step to any multiple alignment or repeats inference method, eliminating a possibly large fraction of the input that is guaranteed not to contain any approximate repeat. It consists in the verification of several strong necessary conditions that can be checked in a fast way. We implemented three versions of the filter. The first is simply a straightforward extension to the case of multiple sequences of an application of conditions already existing in the literature. The second uses a stronger condition which, as our results show, enable to filter sensibly more with negligible (if any) additional time. The third version uses an additional condition and pushes the sensibility of the filter even further with a non negligible additional time in many circumstances; our experiments show that it is particularly useful with large error rates. The latter version was applied as a preprocessing of a multiple alignment tool, obtaining an overall time (filter plus alignment) on average 63 and at best 530 times smaller than before (direct alignment), with in most cases a better quality alignment. Conclusion: To the best of our knowledge, TUIUIU is the first filter designed for multiple repeats and for dealing with error rates greater than 10% of the repeats length.

Random perturbations of stochastic processes with unbounded variable length memory

We consider binary infinite order stochastic chains perturbed by a random noise. This means that at each time step, the value assumed by the chain can be randomly and independently flipped with a small fixed probability. We show that the transition probabilities of the perturbed chain are uniformly close to the corresponding transition probabilities of the original chain. As a consequence, in the case of stochastic chains with unbounded but otherwise finite variable length memory, we show that it is possible to recover the context tree of the original chain, using a suitable version of the algorithm Context, provided that the noise is small enough.