Generalized partition function zeros of 1D spin models and their critical behavior at edge singularities

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

KitSmart: Uma biblioteca de componentes para o desenvolvimento rigoroso de aplicações Java Card com o método B

The development of smart card applications requires a high level of reliability. Formal methods provide means for this reliability to be achieved. The BSmart method and tool contribute to the development of smart card applications with the support of the B method, generating Java Card code from B specifications. For the development with BSmart to be effectively rigorous without overloading the user it is important to have a library of reusable components built in B. The goal of KitSmart is to provide this support. A first research about the composition of this library was a graduation work from Universidade Federal do Rio Grande do Norte, made by Thiago Dutra in 2006. This first version of the kit resulted in a specification of Java Card primitive types byte, short and boolean in B and the creation of reusable components for application development. This work provides an improvement of KitSmart with the addition of API Java Card specification made in B and a guide for the creation of new components. The API Java Card in B, besides being available to be used for development of applications, is also useful as a documentation of each API class. The reusable components correspond to modules to manipulate specific structures, such as date and time. These structures are not available for B or Java Card. These components for Java Card are generated from specifications formally verified in B. The guide contains quick reference on how to specify some structures and how some situations were adapted from object-orientation to the B Method. This work was evaluated through a case study made through the BSmart tool, that makes use of the KitSmart library. In this case study, it is possible to see the contribution of the components in a B specification. This kit should be useful for B method users and Java Card application developers

Geração automática de hardware a partir de especificações formais: estendendo uma abordagem de tradução

Removing inconsistencies in a project is a less expensive activity when done in the early steps of design. The use of formal methods improves the understanding of systems. They have various techniques such as formal specification and verification to identify these problems in the initial stages of a project. However, the transformation from a formal specification into a programming language is a non-trivial task and error prone, specially when done manually. The aid of tools at this stage can bring great benefits to the final product to be developed. This paper proposes the extension of a tool whose focus is the automatic translation of specifications written in CSPM into Handel-C. CSP is a formal description language suitable for concurrent systems, and CSPM is the notation used in tools support. Handel-C is a programming language whose result can be compiled directly into FPGA s. Our extension increases the number of CSPM operators accepted by the tool, allowing the user to define local processes, to rename channels in a process and to use Boolean guards on external choices. In addition, we also propose the implementation of a communication protocol that eliminates some restrictions on parallel composition of processes in the translation into Handel-C, allowing communication in a same channel between multiple processes to be mapped in a consistent manner and that improper communication in a channel does not ocurr in the generated code, ie, communications that are not allowed in the system specification

On Fuzzy Implication Classes - Towards Extensions of Fuzzy Rule-Based Systems

Atualmente, há diferentes definições de implicações fuzzy aceitas na literatura. Do ponto de vista teórico, esta falta de consenso demonstra que há discordâncias sobre o real significado de "implicação lógica" nos contextos Booleano e fuzzy. Do ponto de vista prático, isso gera dúvidas a respeito de quais "operadores de implicação" os engenheiros de software devem considerar para implementar um Sistema Baseado em Regras Fuzzy (SBRF). Uma escolha ruim destes operadores pode implicar em SBRF's com menor acurácia e menos apropriados aos seus domínios de aplicação. Uma forma de contornar esta situação e conhecer melhor os conectivos lógicos fuzzy. Para isso se faz necessário saber quais propriedades tais conectivos podem satisfazer. Portanto, a m de corroborar com o significado de implicação fuzzy e corroborar com a implementação de SBRF's mais apropriados, várias leis Booleanas têm sido generalizadas e estudadas como equações ou inequações nas lógicas fuzzy. Tais generalizações são chamadas de leis Boolean-like e elas não são comumente válidas em qualquer semântica fuzzy. Neste cenário, esta dissertação apresenta uma investigação sobre as condições suficientes e necessárias nas quais três leis Booleanlike like — y ≤ I(x, y), I(x, I(y, x)) = 1 e I(x, I(y, z)) = I(I(x, y), I(x, z)) — se mantém válidas no contexto fuzzy, considerando seis classes de implicações fuzzy e implicações geradas por automorfismos. Além disso, ainda no intuito de implementar SBRF's mais apropriados, propomos uma extensão para os mesmos

Estudo integrado de análogo a reservatórios petrolíferos fluviais: caracterização, parametrização e modelagem tridimensional de depósitos recentes do Rio Assu (Rio Grande do Norte/Brasil)

This work shows a integrated study of modern analog to fluvial reservoirs of Açu Formation (Unit 3). The modern analog studied has been Assu River located in the same named city, Rio Grande do Norte State, Northeast of Brazil. It has been developed a new methodology to parameterizating the fluvial geological bodies by GPR profile (by central frequency antennas of 50, 100 and 200 MHz). The main parameters obtained were width and thickness. Still in the parameterization, orthophotomaps have been used to calculate the canal sinuosity and braided parameters of Assu River. These information are integrated in a database to supply input data in 3D geological models of fluvial reservoirs. It was made an architectural characterization of the deposit by trench description, GPR profile interpretation and natural expositions study to recognize and describe the facies and its associations, external and internal geometries, boundary surfaces and archtetural elements. Finally, a three-dimensional modeling has been built using all the acquired data already in association with real well data of a reservoir which Rio Assu is considered as analogous. Facies simulations have been used simple kriging (deterministic algorithm), SIS and Boolean (object-based, both stochastics). And, for modeling porosities have used the stochastic algorithm SGS

Uso do procedimento de bissecção temporal na avaliação de idosos com doença de Alzheimer: uma revisão sistemática

OBJETIVO: Realizar revisão sistemática de artigos que utilizaram o método de bissecção, para avaliar a percepção de tempo em idosos com doença de Alzheimer e analisar seus parâmetros. MÉTODO: As buscas dos artigos foram conduzidas no período de março a maio de 2011, nas seguintes bases de dados: Web of Science, Science Direct on Line, Biological Abstracts, PsychoInfo e Medline. As palavras-chave e operadores booleanos foram: interval timing ou perception of time ou time discrimination ou reproduction of time e Alzheimer's disease. Também foram realizadas buscas manuais nas referências dos artigos selecionados. RESULTADOS: Quatro artigos contemplavam todos os critérios de inclusão, nos quais foram encontradas grandes variações nos parâmetros utilizados no método. CONCLUSÃO: Pacientes com doença de Alzheimer apresentam prejuízos nas tarefas de bissecção de tempo, que podem ser explicados pelo declínio gradual nas habilidades que são utilizadas no teste de percepção de tempo. Há grandes variações nos intervalos de tempo utilizados. Neste contexto, há necessidade de mais estudos, controlados e randomizados, para investigar potenciais efeitos das variações nos intervalos de tempo do método de bissecção. Os resultados de tais estudos poderão contribuir para o estabelecimento de parâmetros mais adequados e fidedignos.

On the worldsheet derivation of large N dualities for the superstring

Large N topological string dualities have led to a class of proposed open/ closed dualities for superstrings. In the topological string context, the worldsheet derivation of these dualities has already been given. In this paper we take the first step in deriving the full ten-dimensional superstring dualities by showing how the dualities arise on the superstring worldsheet at the level of F terms. As part of this derivation, we show for F-term computations that the hybrid formalism for the superstring is equivalent to a (c) over cap = 5 topological string in ten-dimensional spacetime. Using the (c) over cap = 5 description, we then show that the D brane boundary state for the ten-dimensional open superstring naturally emerges on the worldsheet of the closed superstring dual.

The light-cone gauge without prescriptions

Feynman integrals in the physical light-cone gauge are more difficult to solve than their covariant counterparts. The difficulty is associated with the presence of unphysical singularities due to the inherent residual gauge freedom in the intermediate boson propagators constrained within this gauge choice. In order to circumvent these non-physical singularities, the headlong approach has always been to call for mathematical devices - prescriptions - some successful and others not. A more elegant approach is to consider the propagator from its physical point of view, that is, an object obeying basic principles such as causality. Once this fact is realized and carefully taken into account, the crutch of prescriptions can be avoided altogether. An alternative, third approach, which for practical computations could dispense with prescriptions as well as avoiding the necessity of careful stepwise consideration of causality, would be of great advantage. and this third option is realizable within the context of negative dimensions, or as it has been coined, the negative dimensional integration method (NDIM).

Taming the b antighost with Ramond-Ramond flux

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

The tachyon potential in the sliver frame

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

Arquitetura multiprocessada e reconfigurável para a síntese de redes de Petri em hardware

Uma arquitetura reconfigurável e multiprocessada para a implementação física de Redes de Petri foi desenvolvida em VHDL e mapeada sobre um FPGA. Convencionalmente, as Redes de Petri são transformadas em uma linguagem de descrição de hardware no nível de transferências entre registradores e um processo de síntese de alto nível é utilizado para gerar as funções booleanas e tabelas de transição de estado para que se possa, finalmente, mapeá-las num FPGA (Morris et al., 2000) (Soto and Pereira, 2001). A arquitetura proposta possui blocos lógicos reconfiguráveis desenvolvidos exclusivamente para a implementação dos lugares e das transições da rede, não sendo necessária a descrição da rede em níveis de abstração intermediários e nem a utilização de um processo de síntese para realizar o mapeamento da rede na arquitetura. A arquitetura permite o mapeamento de modelos de Redes de Petri com diferenciação entre as marcas e associação de tempo no disparo das transições, sendo composta por um arranjo de processadores reconfiguráveis, cada um dos quais representando o comportamento de uma transição da Rede de Petri a ser mapeada e por um sistema de comunicação, implementado por um conjunto de roteadores que são capazes de enviar pacotes de dados de um processador reconfigurável a outro. A arquitetura proposta foi validada num FPGA de 10.570 elementos lógicos com uma topologia que permitiu a implementação de Redes de Petri de até 9 transições e 36 lugares, atingindo uma latência de 15,4ns e uma vazão de até 17,12GB/s com uma freqüência de operação de 64,58MHz.

SEMICLASSICAL THEORY OF MAGNETIZATION FOR A 2-DIMENSIONAL NONINTERACTING ELECTRON-GAS

We compute the semiclassical magnetization and susceptibility of non-interacting electrons, confined by a smooth two-dimensional potential and subjected to a uniform perpendicular magnetic field, in the general case when their classical motion is chaotic. It is demonstrated that the magnetization per particle m(B) is directly related to the staircase function N(E), which counts the single-particle levels up to energy E. Using Gutzwiller's trace formula for N, we derive a semiclassical expression for m. Our results show that the magnetization has a non-zero average, which arises from quantum corrections to the leading-order Weyl approximation to the mean staircase and which is independent of whether the classical motion is chaotic or not. Fluctuations about the average are due to classical periodic orbits and do represent a signature of chaos. This behaviour is confirmed by numerical computations for a specific system.

Bayesian longitudinal data analysis with mixed models and thick-tailed distributions using MCMC

Linear mixed effects models are frequently used to analyse longitudinal data, due to their flexibility in modelling the covariance structure between and within observations. Further, it is easy to deal with unbalanced data, either with respect to the number of observations per subject or per time period, and with varying time intervals between observations. In most applications of mixed models to biological sciences, a normal distribution is assumed both for the random effects and for the residuals. This, however, makes inferences vulnerable to the presence of outliers. Here, linear mixed models employing thick-tailed distributions for robust inferences in longitudinal data analysis are described. Specific distributions discussed include the Student-t, the slash and the contaminated normal. A Bayesian framework is adopted, and the Gibbs sampler and the Metropolis-Hastings algorithms are used to carry out the posterior analyses. An example with data on orthodontic distance growth in children is discussed to illustrate the methodology. Analyses based on either the Student-t distribution or on the usual Gaussian assumption are contrasted. The thick-tailed distributions provide an appealing robust alternative to the Gaussian process for modelling distributions of the random effects and of residuals in linear mixed models, and the MCMC implementation allows the computations to be performed in a flexible manner.

Analog Modeling of Human Cognitive Functions with Tripartite Synapses

Searching for an understanding of how the brain supports conscious processes, cognitive scientists have proposed two main classes of theory: Global Workspace and Information Integration theories. These theories seem to be complementary, but both still lack grounding in terms of brain mechanisms responsible for the production of coherent and unitary conscious states. Here we propose following James Robertson's "Astrocentric Hypothesis" - that conscious processing is based on analog computing in astrocytes. The "hardware" for these computations is calcium waves mediated by adenosine triphosphate signaling. Besides presenting our version of this hypothesis, we also review recent findings on astrocyte morphology that lend support to their functioning as Local Hubs (composed of protoplasmic astrocytes) that integrate synaptic activity, and as a Master Hub (composed, in the human brain, by a combination of interlaminar, fibrous, polarized and varicose projection astrocytes) that integrates whole-brain activity.

Enzymatic Logic Gates with Noise-Reducing Sigmoid Response

Biochemical computing is an emerging field of unconventional computing that attempts to process information with biomolecules and biological objects using digital logic. In this work we survey filtering in general, in biochemical computing, and summarize the experimental realization of an and logic gate with sigmoid response in one of the inputs. The logic gate is realized with electrode-immobilized glucose-6-phosphate dehydrogenase enzyme that catalyzes a reaction corresponding to the Boolean and functions. A kinetic model is also developed and used to evaluate the extent to which the performance of the experimentally realized logic gate is close to optimal.