P-248 Futility and utility of two-stage hepatectomy

Meeting abstract in the European-Society-for-Medical-Oncology (ESMO) 21st World Congress on Gastrointestinal Cancer.info:eu-repo/semantics/publishedVersio

Asteroseismic Theory of Rapidly Oscillating Ap Stars

This paper reviews some of the important advances made over the last decade concerning theory of roAp stars.Comment: 9 pages, 5 figure

Self-dual vortices in a Maxwell-Chern-Simons model with non-minimal coupling

We find self-dual vortex solutions in a Maxwell-Chern-Simons model with anomalous magnetic moment. From a recently developed N=2-supersymmetric extension, we obtain the proper Bogomol'nyi equations together with a Higgs potential allowing both topological and non-topological phases in the theory.Comment: 12 pages, 9 figures, 2 tables; some typos corrected, one reference updated. To be published in the Int. J. Mod. Phys. A (1999

N=2-Maxwell-Chern-Simons model with anomalous magnetic moment coupling via dimensional reduction

An N=1--supersymmetric version of the Cremmer-Scherk-Kalb-Ramond model with non-minimal coupling to matter is built up both in terms of superfields and in a component-field formalism. By adopting a dimensional reduction procedure, the N=2--D=3 counterpart of the model comes out, with two main features: a genuine (diagonal) Chern-Simons term and an anomalous magnetic moment coupling between matter and the gauge potential.Comment: 15 pages, Latex; one reference corrected; To be published in the Int. J. Mod. Phys.

Generalised verification of the observer property in discrete event systems

The observer property is an important condition to be satisfied by abstractions of Discrete Event Systems (DES) models. This paper presents a generalised version of a previous algorithm which tests if an abstraction of a DES obtained through natural projection has the observer property. The procedure called OP-verifier II overcomes the limitations of the previously proposed verifier while keeping its computational complexity. Results are illustrated by a case study of a transfer line system

Generalised verification of the observer property in discrete event systems

The observer property is an important condition to be satisfied by abstractions of Discrete Event Systems (DES) models. This paper presents a generalised version of a previous algorithm which tests if an abstraction of a DES obtained through natural projection has the observer property. The procedure called OP-verifier II overcomes the limitations of the previously proposed verifier while keeping its computational complexity. Results are illustrated by a case study of a transfer line system

Multifocal: a strategic bidirectional transformation language for XML schemas

Lenses are one of the most popular approaches to define bidirectional transformations between data models. However, writing a lens transformation typically implies describing the concrete steps that convert values in a source schema to values in a target schema. In contrast, many XML-based languages allow writing structure-shy programs that manipulate only specific parts of XML documents without having to specify the behavior for the remaining structure. In this paper, we propose a structure-shy bidirectional two-level transformation language for XML Schemas, that describes generic type-level transformations over schema representations coupled with value-level bidirectional lenses for document migration. When applying these two-level programs to particular schemas, we employ an existing algebraic rewrite system to optimize the automatically-generated lens transformations, and compile them into Haskell bidirectional executables. We discuss particular examples involving the generic evolution of recursive XML Schemas, and compare their performance gains over non-optimized definitions.Fundação para a Ciência e a Tecnologi

Quantum computing with incoherent resources and quantum jumps

Spontaneous emission and the inelastic scattering of photons are two natural processes usually associated with decoherence and the reduction in the capacity to process quantum information. Here we show that when suitably detected, these photons are sufficient to build all the fundamental blocks needed to perform quantum computation in the emitting qubits while protecting them from deleterious dissipative effects. We exemplify by showing how to teleport an unknown quantum state and how to efficiently prepare graph states for the implementation of measurement-based quantum computation.Comment: 5 pages, 5 figure

Authentication of professionals in the RTS e-Health system

This paper describes the design and implementation of a PKI-based e-Health authentication architecture. This architecture was developed to authenticate e-Health Professionals accessing RTS (Rede Telemática da Saúde), a regional platform for sharing clinical data among a set of affiliated health institutions. The architecture had to accommodate specific RTS requirements, namely the security of Professionals' credentials, the mobility of Professionals, and the scalability to accommodate new health institutions. The adopted solution uses short lived certificates and cross-certification agreements between RTS and e-Health institutions for authenticating Professionals accessing the RTS. These certificates carry as well the Professional's role at their home institution for role-based authorization. Trust agreements between health institutions and RTS are necessary in order to make the certificates recognized by the RTS. As a proof of concept, a prototype was implemented with Windows technology. The presented authentication architecture is intended to be applied to other medical telematic systems

Verification of the observer property in discrete event systems

The observer property is an important condition to be satisfied by abstractions of Discrete Event System (DES) models. This technical note presents a new algorithm that tests if an abstraction of a DES obtained through natural projection has the observer property. The procedure, called OP-Verifier, can be applied to (potentially nondeterministic) automata, with no restriction on the existence of cycles of 'non-relevant' events. This procedure has quadratic complexity in the number of states. The performance of the algorithm is illustrated by a set of experiments