The Schenberg data acquisition and analysis: results from its first commissioning run

The Mario Schenberg gravitational wave detector has started its commissioning phase at the Physics Institute of the University of Sao Paulo. We have collected almost 200 h of data from the instrument in order to check out its behavior and performance. We have also been developing a data acquisition system for it under a VXI System. Such a system is composed of an analog-to-digital converter and a GPS receiver for time synchronization. We have been building the software that controls and sets up the data acquisition. Here we present an overview of the Mario Schenberg detector and its data acquisition system, some results from the first commissioning run and solutions for some problems we have identified.

FAST, PARALLEL AND SECURE CRYPTOGRAPHY ALGORITHM USING LORENZ`S ATTRACTOR

A novel cryptography method based on the Lorenz`s attractor chaotic system is presented. The proposed algorithm is secure and fast, making it practical for general use. We introduce the chaotic operation mode, which provides an interaction among the password, message and a chaotic system. It ensures that the algorithm yields a secure codification, even if the nature of the chaotic system is known. The algorithm has been implemented in two versions: one sequential and slow and the other, parallel and fast. Our algorithm assures the integrity of the ciphertext (we know if it has been altered, which is not assured by traditional algorithms) and consequently its authenticity. Numerical experiments are presented, discussed and show the behavior of the method in terms of security and performance. The fast version of the algorithm has a performance comparable to AES, a popular cryptography program used commercially nowadays, but it is more secure, which makes it immediately suitable for general purpose cryptography applications. An internet page has been set up, which enables the readers to test the algorithm and also to try to break into the cipher.

Seeking for simplicity in complex networks

Complex networks can be understood as graphs whose connectivity properties deviate from those of regular or near-regular graphs, which are understood as being ""simple"". While a great deal of the attention so far dedicated to complex networks has been duly driven by the ""complex"" nature of these structures, in this work we address the identification of their simplicity. The basic idea is to seek for subgraphs whose nodes exhibit similar measurements. This approach paves the way for complementing the characterization of networks, including results suggesting that the protein-protein interaction networks, and to a lesser extent also the Internet, may be getting simpler over time. Copyright (C) EPLA, 2009

Spontaneous recoherence of quantum states after decoherence

In this work, we identify the set of time-dependent pure states building the statistical mixture to which a system, initially in a pure state, is driven by the reservoir. This set of time-dependent pure states, composing what we term a pure basis, are those that diagonalize the reduced density operator of the system. Next, we show that the evolution of the pure-basis states reveals an interesting phenomenon as the system, after decoherence, evolves toward the equilibrium: the spontaneous recoherence of quantum states. Around our defined recoherence time, the statistical mixture associated with a special kind of initial states termed even-symmetric, spontaneously undergoes a recoherence process, by which the initial state of the system emerges from the mixture except for its reduced excitation drained into the reservoir. This phenomenon reveals that the reservoir only shuffle the original information carried out by the initial state of the system instead of erasing it. Moreover, as the spontaneously recohered state occurs only for asymptotic time, we also present a protocol to extract it from the mixture through specific projective measurements. The password to retrieve the original information stems is the knowledge of both the initial state itself and the associated pure basis. A definition of the decoherence time of an N-state superposition is also presented.

Symmetry breaking in the genetic code: Finite groups

We investigate the possibility of interpreting the degeneracy of the genetic code, i.e., the feature that different codons (base triplets) of DNA are transcribed into the same amino acid, as the result of a symmetry breaking process, in the context of finite groups. In the first part of this paper, we give the complete list of all codon representations (64-dimensional irreducible representations) of simple finite groups and their satellites (central extensions and extensions by outer automorphisms). In the second part, we analyze the branching rules for the codon representations found in the first part by computational methods, using a software package for computational group theory. The final result is a complete classification of the possible schemes, based on finite simple groups, that reproduce the multiplet structure of the genetic code. (C) 2010 Elsevier Ltd. All rights reserved.

On moduli spaces for abelian categories

We show that if A is an abelian category satisfying certain mild conditions, then one can introduce the concept of a moduli space of (semi)stable objects which has the structure of a projective algebraic variety. This idea is applied to several important abelian categories in representation theory, like highest weight categories.

REALIZING PROFINITE REDUCED SPECIAL GROUPS

Special groups are an axiomatization of the algebraic theory of quadratic forms over fields. It is known that any finite reduced special group is the special group of some field. We show that any special group that is the projective limit of a projective system of finite reduced special groups is also the special group of some field.

d-Koszul algebras, 2-d-determined algebras and 2-d-Koszul algebras

The relationship between an algebra and its associated monomial algebra is investigated when at least one of the algebras is d-Koszul It is shown that an algebra which has a reduced Grobnerbasis that is composed of homogeneous elements of degree d is d-Koszul if and only if its associated monomial algebra is d-Koszul The class of 2-d-determined algebras and the class 2-d-Koszul algebras are introduced In particular it is shown that 2-d-determined monomial algebras are 2-d-Koszul algebras and the structure of the ideal of relations of such an algebra is completely determined (C) 2010 Elsevier B V All rights reserved

Coincidence Wecken homotopies versus Wecken homotopies relative to a fixed homotopy in one of the maps

We study the 1-parameter Wecken problem versus the restricted Wecken problem, for coincidence free pairs of maps between surfaces. For this we use properties of the function space between two surfaces and of the pure braid group on two strings of a surface. When the target surface is either the 2-sphere or the torus it is known that the two problems are the same. We classify most pairs of homotopy classes of maps according to the answer of the two problems are either the same or different when the target is either projective space or the Klein bottle. Some partial results are given for surfaces of negative Euler characteristic. (C) 2010 Elsevier B.V. All rights reserved.

On the Relative Socle for Stratifying Systems

Let A be a finite dimensional k-algebra, (, ) be a stratifying system in mod(A) and F() be the class of -filtered A-modules. In this article, we give the definition and also study some of the properties of the relative socle in F(). We approach the relative socle in three ways. Namely, we view it as (1) a -semisimple subobject of M having the largest -length, (2) a maximal -semisimple subobject of M, and (3) a minimal -essential subobject of M.

NONSTATIONARY MIXING AND THE UNIQUE ERGODICITY OF ADIC TRANSFORMATIONS

We define topological and measure-theoretic mixing for nonstationary dynamical systems and prove that for a nonstationary subshift of finite type, topological mixing implies the minimality of any adic transformation defined on the edge space, while if the Parry measure sequence is mixing, the adic transformation is uniquely ergodic. We also show this measure theoretic mixing is equivalent to weak ergodicity of the edge matrices in the sense of inhomogeneous Markov chain theory.

Dynamically Adapting BDI Agent Architectures based on High-level User Specifications

Users are facing an increasing challenge of managing information and being available anytime anywhere, as the web exponentially grows. As a consequence, assisting them in their routine tasks has become a relevant issue to be addressed. In this paper, we introduce a software framework that supports the development of Personal Assistance Software (PAS). It relies on the idea of exposing a high level user model in order to increase user trust in the task delegation process as well as empowering them to manage it. The framework provides a synchronization mechanism that is responsible for dynamically adapting an underlying BDI agent-based running implementation in order to keep this high-level view of user customizations consistent with it.

Sistema de produção sincronizado : uma aplicação em processos produtivos de propriedade contínuos segundo a teoria das restrições

Este trabalho de conclusão investiga o efeito da geração de estoques intermediários nos indicadores principais empregados na Teoria das Restrições (Ganho, Despesa Operacional e Inventário) em uma unidade industrial de processo produtivo de Propriedade contínuo, que emprega embalagens, matérias-primas obtidas em larga escala e cadeias logísticas de longo curso. Este tipo de indústria produz bens de consumo imediato, com pouca variabilidade, de modo “empurrado”. A principal conseqüência é a perda do sincronismo na cadeia logística, resultando em uma grande quantidade de estoques intermediários e custos crescentes, relacionados principalmente ao custo de manutenção destes estoques. Através dos cinco passos de focalização e das ferramentas lógicas da Teoria das Restrições, propõe-se uma alternativa gerencial, que inclui o algoritmo Tambor-Pulmão-Corda e insere a organização em um processo de melhoria contínua, cujos impactos são avaliados por simulação computacional. Através de técnicas estatísticas e software apropriados, constrói-se um modelo de simulação computacional baseado em dados reais de uma planta produtora de cimento. A partir deste modelo, diferentes cenários são testados, descobrindo-se a condição ótima. Chega-se a uma conclusão, considerando a mudança na política de geração de estoques intermediários e seus impactos na redução de custos e riscos.

Proposta de um método para a implantação de um sistema de planejamento fino da produção baseado na teoria das restrições

Esta dissertação propõe um método de trabalho para a implantação de um sistema de Planejamento Fino da Produção baseado na Teoria das Restrições. É apresentada uma revisão bibliográfica sobre Planejamento e Controle da Produção, destacando a abordagem da Teoria das Restrições. É realizado um estudo sobre ferramentas computacionais de Planejamento Fino da Produção e suas particularidades. A seguir é desenvolvido o método de trabalho, que foi seguido de sua aplicação prática em uma empresa industrial do ramo metal-mecânico. O estudo apresenta as modificações no sistema de Planejamento e Controle da Produção da empresa, que foi adequado as práticas e princípios da Manufatura Sincronizada. As melhorias decorrentes da implantação podem ser constatadas através dos resultados divulgados. Este trabalho explora as particularidades e dificuldades da implementação desta ferramenta de apoio à tomada de decisão, e discute aspectos referentes às mudanças na “filosofia” de produção impostas pela sincronização da manufatura.

A tecnologia de informação e o indivíduo: propondo um modelo de adoção de tecnologia para a inclusão digital

A presente pesquisa sugeriu um novo modelo de Adoção de Tecnologia com o foco na inclusão digital, levando em consideração três dimensões: o acesso à tecnologia, a capacitação para utilizá-la e a atitude do usuário em relação a ela. Foi proposto um modelo cúbico, onde o volume do cubo representaria a tendência à adoção de tecnologia de um determinado sujeito ou grupo. Foram criados, para tanto, um conjunto de quatro instrumentos de pesquisa, a saber, um questionário, duas lâminas relacionadas à capacitação e uma lâmina projetiva para o estudo da atitude. Como resultado, foi possível observar que o volume do cubo de adoção realmente aumenta quanto mais freqüente é a utilização de tecnologia. Apesar disso, houve uma inversão interessante em relação à atitude. Viu-se que ela tende a diminuir quando o usuário está sendo inserido numa determinada tecnologia, nova para ele.