IOPT Petri Net State Space Generation Algorithm with Maximal-Step Execution Semantics

This paper presents an algorithm to efficiently generate the state-space of systems specified using the IOPT Petri-net modeling formalism. IOPT nets are a non-autonomous Petri-net class, based on Place-Transition nets with an extended set of features designed to allow the rapid prototyping and synthesis of system controllers through an existing hardware-software co-design framework. To obtain coherent and deterministic operation, IOPT nets use a maximal-step execution semantics where, in a single execution step, all enabled transitions will fire simultaneously. This fact increases the resulting state-space complexity and can cause an arc "explosion" effect. Real-world applications, with several million states, will reach a higher order of magnitude number of arcs, leading to the need for high performance state-space generator algorithms. The proposed algorithm applies a compilation approach to read a PNML file containing one IOPT model and automatically generate an optimized C program to calculate the corresponding state-space.

Geometric picture of generalized-CP and Higgs-family transformations in the two-Higgs-doublet model

In the two-Higgs-doublet model (THDM), generalized-CP transformations (phi(i) -> X-ij phi(*)(j) where X is unitary) and unitary Higgs-family transformations (phi(i) -> U-ij phi(j)) have recently been examined in a series of papers. In terms of gauge-invariant bilinear functions of the Higgs fields phi(i), the Higgs-family transformations and the generalized-CP transformations possess a simple geometric description. Namely, these transformations correspond in the space of scalar-field bilinears to proper and improper rotations, respectively. In this formalism, recent results relating generalized CP transformations with Higgs-family transformations have a clear geometric interpretation. We will review what is known regarding THDM symmetries, as well as derive new results concerning those symmetries, namely how they can be interpreted geometrically as applications of several CP transformations.

Paul Auster and the music of change: building new stories

In the work of Paul Auster (Newark, 1947 - ), we find two main themes: the sense of loss and existential drift and the loneliness of the individual fully committed to the work of writing, as if he had been confined to the book that commands his life. However, this second theme is clearly the dominant one because the character's space of solitude may include its own wandering, because this wandering is also often performed inside the four walls of a room, just like it is narrated inside the space of the page and the book. Both in his poetry, essays and fiction, Auster seems to face the work of writing as an actual physical effort of effective construction, as if the words that are aligned in the poem-text were stones to place in a row when building a wall or some other structure in stone.

SCANNERS: constraining the phase diagram of a complex scalar singlet at the LHC

We present the first version of a new tool to scan the parameter space of generic scalar potentials, SCANNERS (Coimbra et al., SCANNERS project., 2013). The main goal of SCANNERS is to help distinguish between different patterns of symmetry breaking for each scalar potential. In this work we use it to investigate the possibility of excluding regions of the phase diagram of several versions of a complex singlet extension of the Standard Model, with future LHC results. We find that if another scalar is found, one can exclude a phase with a dark matter candidate in definite regions of the parameter space, while predicting whether a third scalar to be found must be lighter or heavier. The first version of the code is publicly available and contains various generic core routines for tree level vacuum stability analysis, as well as implementations of collider bounds, dark matter constraints, electroweak precision constraints and tree level unitarity.

Telling stories of culture through literature

Grounded on Raymond Williams‘s definition of knowable community as a cultural tool to analyse literary texts, the essay reads the texts D.H.Lawrence wrote while travelling in the Mediterranean (Twilight in Italy, Sea and Sardinia and Etruscan Places) as knowable communities, bringing to the discussion the wide importance of literature not only as an object for aesthetic or textual readings, but also as a signifying practice which tells stories of culture. Departing from some considerations regarding the historical development of the relationship between literature and culture, the essay analyses the ways D. H. Lawrence constructed maps of meaning, where the readers, in a dynamic relation with the texts, apprehend experiences, structures and feelings; putting into perspective Williams‘s theory of culture as a whole way of life, it also analyses the ways the author communicates and organizes these experiences, creating a space of communication and operating at different levels of reality: on the one hand, the reality of the whole way of Italian life, and, on the other hand, the reality of the reader who aspires to make sense and to create an interpretative context where all the information is put, and, also, the reality of the writer in the poetic act of writing. To read these travel writings as knowable communities is to understand them as a form that invents a community with no other existence but that of the literary text. The cultural construction we find in these texts is the result of the selection, and interpretation done by D.H.Lawrence, as well as the product of the author‘s enunciative positions, and of his epistemological and ontological filigrees of existence, structured by the conditions of possibility. In the rearticulation of the text, of the writer and of the reader, in a dynamic and shared process of discursive alliances, we understand that Lawrence tells stories of the Mediterranean through his literary art.

Jornalismo político na revolução: a imprensa Trotskista em 1974-75.

Dissertação apresentada à Escola Superior de Comunicação Social como parte dos requisitos para obtenção de grau de mestre em Jornalismo.

Body image in Brazil: recent advances in the state of knowledge and methodological issues

OBJECTIVE To analyze Brazilian literature on body image and the theoretical and methodological advances that have been made. METHODS A detailed review was undertaken of the Brazilian literature on body image, selecting published articles, dissertations and theses from the SciELO, SCOPUS, LILACS and PubMed databases and the CAPES thesis database. Google Scholar was also used. There was no start date for the search, which used the following search terms: “body image” AND “Brazil” AND “scale(s)”; “body image” AND “Brazil” AND “questionnaire(s)”; “body image” AND “Brazil” AND “instrument(s)”; “body image” limited to Brazil and “body image”. RESULTS The majority of measures available were intended to be used in college students, with half of them evaluating satisfaction/dissatisfaction with the body. Females and adolescents of both sexes were the most studied population. There has been a significant increase in the number of available instruments. Nevertheless, numerous published studies have used non-validated instruments, with much confusion in the use of the appropriate terms (e.g., perception, dissatisfaction, distortion). CONCLUSIONS Much more is needed to understand body image within the Brazilian population, especially in terms of evaluating different age groups and diversifying the components/dimensions assessed. However, interest in this theme is increasing, and important steps have been taken in a short space of time.

Coordinated transportation of a large object by a team of three robots

Dynamical systems theory in this work is used as a theoretical language and tool to design a distributed control architecture for a team of three robots that must transport a large object and simultaneously avoid collisions with either static or dynamic obstacles. The robots have no prior knowledge of the environment. The dynamics of behavior is defined over a state space of behavior variables, heading direction and path velocity. Task constraints are modeled as attractors (i.e. asymptotic stable states) of the behavioral dynamics. For each robot, these attractors are combined into a vector field that governs the behavior. By design the parameters are tuned so that the behavioral variables are always very close to the corresponding attractors. Thus the behavior of each robot is controlled by a time series of asymptotical stable states. Computer simulations support the validity of the dynamical model architecture.

Coordinated transportation of a large object by a team of two robots

In this paper dynamical systems theory is used as a theoretical language and tool to design a distributed control architecture for a team of two robots that must transport a large object and simultaneously avoid collisions with obstacles (either static or dynamic). This work extends the previous work with two robots (see [1] and [5]). However here we demonstrate that it’s possible to simplify the architecture presented in [1] and [5] and reach an equally stable global behavior. The robots have no prior knowledge of the environment. The dynamics of behavior is defined over a state space of behavior variables, heading direction and path velocity. Task constrains are modeled as attractors (i.e. asymptotic stable states) of a behavioral dynamics. For each robot, these attractors are combined into a vector field that governs the behavior. By design the parameters are tuned so that the behavioral variables are always very close to the corresponding attractors. Thus the behavior of each robot is controlled by a time series of asymptotic stable states. Computer simulations support the validity of the dynamical model architecture.

Using attractor dynamics to generate decentralized motion control of two mobile robots transporting a long object in coordination

Dynamical systems theory is used here as a theoretical language and tool to design a distributed control architecture for a team of two mobile robots that must transport a long object and simultaneously avoid obstacles. In this approach the level of modeling is at the level of behaviors. A “dynamics” of behavior is defined over a state space of behavioral variables (heading direction and path velocity). The environment is also modeled in these terms by representing task constraints as attractors (i.e. asymptotically stable states) or reppelers (i.e. unstable states) of behavioral dynamics. For each robot attractors and repellers are combined into a vector field that governs the behavior. The resulting dynamical systems that generate the behavior of the robots may be nonlinear. By design the systems are tuned so that the behavioral variables are always very close to one attractor. Thus the behavior of each robot is controled by a time series of asymptotically stable states. Computer simulations support the validity of our dynamic model architectures.

Visualization of clusters in geo-referenced data using three-dimensional self-organizing maps

Dissertação apresentada como requisito parcial para obtenção do grau de Mestre em Estatística e Gestão de Informação

Visual programming of XSLT from examples

Vishnu is a tool for XSLT visual programming in Eclipse - a popular and extensible integrated development environment. Rather than writing the XSLT transformations, the programmer loads or edits two document instances, a source document and its corresponding target document, and pairs texts between then by drawing lines over the documents. This form of XSLT programming is intended for simple transformations between related document types, such as HTML formatting or conversion among similar formats. Complex XSLT programs involving, for instance, recursive templates or second order transformations are out of the scope of Vishnu. We present the architecture of Vishnu composed by a graphical editor and a programming engine. The editor is an Eclipse plug-in where the programmer loads and edits document examples and pairs their content using graphical primitives. The programming engine receives the data collected by the editor and produces an XSLT program. The design of the engine and the process of creation of an XSLT program from examples are also detailed. It starts with the generation of an initial transformation that maps source document to the target document. This transformation is fed to a rewrite process where each step produces a refined version of the transformation. Finally, the transformation is simplified before being presented to the programmer for further editing.

Algorithm-oriented design of efficient many-core architectures applied to dense matrix multiplication

Recent integrated circuit technologies have opened the possibility to design parallel architectures with hundreds of cores on a single chip. The design space of these parallel architectures is huge with many architectural options. Exploring the design space gets even more difficult if, beyond performance and area, we also consider extra metrics like performance and area efficiency, where the designer tries to design the architecture with the best performance per chip area and the best sustainable performance. In this paper we present an algorithm-oriented approach to design a many-core architecture. Instead of doing the design space exploration of the many core architecture based on the experimental execution results of a particular benchmark of algorithms, our approach is to make a formal analysis of the algorithms considering the main architectural aspects and to determine how each particular architectural aspect is related to the performance of the architecture when running an algorithm or set of algorithms. The architectural aspects considered include the number of cores, the local memory available in each core, the communication bandwidth between the many-core architecture and the external memory and the memory hierarchy. To exemplify the approach we did a theoretical analysis of a dense matrix multiplication algorithm and determined an equation that relates the number of execution cycles with the architectural parameters. Based on this equation a many-core architecture has been designed. The results obtained indicate that a 100 mm(2) integrated circuit design of the proposed architecture, using a 65 nm technology, is able to achieve 464 GFLOPs (double precision floating-point) for a memory bandwidth of 16 GB/s. This corresponds to a performance efficiency of 71 %. Considering a 45 nm technology, a 100 mm(2) chip attains 833 GFLOPs which corresponds to 84 % of peak performance These figures are better than those obtained by previous many-core architectures, except for the area efficiency which is limited by the lower memory bandwidth considered. The results achieved are also better than those of previous state-of-the-art many-cores architectures designed specifically to achieve high performance for matrix multiplication.

Thermodynamic and kinetic modelling of the redox properties of tetrahaem cytochromes C3

Dissertação apresentada para obtenção do grau de Doutor em Bioquímica,especialidade Bioquímica-Física, pela Universidade Nova de Lisboa, Faculdade de Cincias e Tecnologia

Molecular details of INH-C-10 binding to wt KatG and Its S315T mutant

Isoniazid (INH) is still one of the two most effective antitubercular drugs and is included in all recommended multitherapeutic regimens. Because of the increasing resistance of Mycobacterium tuberculosis to INH, mainly associated with mutations in the katG gene, new INH-based compounds have been proposed to circumvent this problem. In this work, we present a detailed comparative study of the molecular determinants of the interactions between wt KatG or its S315T mutant form and either INH or INH-C10, a new acylated INH derivative. MD simulations were used to explore the conformational space of both proteins, and results indicate that the S315T mutation did not have a significant impact on the average size of the access tunnel in the vicinity of these residues. Our simulations also indicate that the steric hindrance role assigned to Asp137 is transient and that electrostatic changes can be important in understanding the enzyme activity data of mutations in KatG. Additionally, molecular docking studies were used to determine the preferred modes of binding of the two substrates. Upon mutation, the apparently less favored docking solution for reaction became the most abundant, suggesting that S315T mutation favors less optimal binding modes. Moreover, the aliphatic tail in INH-C10 seems to bring the hydrazine group closer to the heme, thus favoring the apparent most reactive binding mode, regardless of the enzyme form. The ITC data is in agreement with our interpretation of the C10 alkyl chain role and helped to rationalize the significantly lower experimental MIC value observed for INH-C10. This compound seems to be able to counterbalance most of the conformational restrictions introduced by the mutation, which are thought to be responsible for the decrease in INH activity in the mutated strain. Therefore, INH-C10 appears to be a very promising lead compound for drug development.