Computation of an integral basis of a quartic number field

"Vegeu el resum a l'inici del document del fitxer adjunt."

Computation of an integral basis of quartic number field

"Vegeu el resum a l'inici del document del fitxer ajunt."

Fast numerical algorithms for the computation of invariant tori in Hamiltonian systems

In this paper, we develop numerical algorithms that use small requirements of storage and operations for the computation of invariant tori in Hamiltonian systems (exact symplectic maps and Hamiltonian vector fields). The algorithms are based on the parameterization method and follow closely the proof of the KAM theorem given in [LGJV05] and [FLS07]. They essentially consist in solving a functional equation satisfied by the invariant tori by using a Newton method. Using some geometric identities, it is possible to perform a Newton step using little storage and few operations. In this paper we focus on the numerical issues of the algorithms (speed, storage and stability) and we refer to the mentioned papers for the rigorous results. We show how to compute efficiently both maximal invariant tori and whiskered tori, together with the associated invariant stable and unstable manifolds of whiskered tori. Moreover, we present fast algorithms for the iteration of the quasi-periodic cocycles and the computation of the invariant bundles, which is a preliminary step for the computation of invariant whiskered tori. Since quasi-periodic cocycles appear in other contexts, this section may be of independent interest. The numerical methods presented here allow to compute in a unified way primary and secondary invariant KAM tori. Secondary tori are invariant tori which can be contracted to a periodic orbit. We present some preliminary results that ensure that the methods are indeed implementable and fast. We postpone to a future paper optimized implementations and results on the breakdown of invariant tori.

Secure Care (PDF 301KB)

An Inspection of Secure Accommodation at Shamrock House and Linden House

Secure Care: An Inspection of Secure Accommodation at Shamrock House and Linden House (PDF 300 KB)

Secure Care: An Inspection of Secure Accommodation at Shamrock House and Linden House

Esquema criptogràfic : Joc electrònic remot segur - Ruleta

El sistema presentat proposa una solució de joc electrònic remot segur per a la ruleta, que usa criptografia de clan pública, certificats i signaturas digitals. Es difineix com es faran les accions, els protocols, per assegurar als participants que el joc és just i honest

Sistema criptográfico para la gestión segura dehistoriales médicos a través de la red

Explorar les possibilitats de la criptografía per garantir la consulta i modificació segures d'historials mèdics a través d'una xarxa de comunicacions.

Xifratge d'arxius

Actualment l'ús de la criptografia ha arribat a ser del tot generalitzat, tant en els processos de transmissió i intercanvi segur d'informació, com en l'emmagatzematge secret de dades. Es tracta d'una disciplina els fonaments teòrics de la qual són en l'Àlgebra i en el Càlcul de Probabilitats. La programació d'interfícies gràfiques s'ha realitzat en Java i amb la manipulació, tot i que molt elemental, de documents XML.

Història Mèdica electrònica remota i segura

Aquest treball vol aprofundir en els aspectos relacionats amb la seguretat per poder obtenir un producte segur. La utilització de la criptografia ens ajudarà en aquestes tasques

Promoting secure attachment: evaluation of the effectiveness of an early intervention pilot programme with mother-infant dyads in Santiago, Chile.

BackgroundResearch indicates that the early attachment patterns of babies could influence their socio-emotional development and prevent the emergence of problematic behaviours in the child later in life. Many studies in the field of early attachment interventions have promoted a secure attachment bond between mother and infant. The purpose of this study was to evaluate the effectiveness of an early pilot intervention programme designed to promote a secure attachment bond in mother-infant dyads belonging to a population seeking regular treatment at urban health centres in Santiago, Chile.MethodsPrimipara mothers were randomly assigned to two intervention conditions: a secure attachment promotion programme (experimental group = 43) or an educational talk (control group = 29). The Strange Situation Assessment was used to collect data on the attachment patterns of babies.ResultsThe results show that after the intervention, there were more babies with secure attachment in the experimental group than in the control group.ConclusionsThese findings represent a preliminary step towards evaluating interventions aimed at promoting secure attachment in Chilean mother-child dyads. While the effect of the intervention is not significant, the effect size obtained is respectable and consistent with other meta-analytic findings.

Omnidirectional Depth Computation from a Single Image

Omnidirectional cameras offer a much wider field of view than the perspective ones and alleviate the problems due to occlusions. However, both types of cameras suffer from the lack of depth perception. A practical method for obtaining depth in computer vision is to project a known structured light pattern on the scene avoiding the problems and costs involved by stereo vision. This paper is focused on the idea of combining omnidirectional vision and structured light with the aim to provide 3D information about the scene. The resulting sensor is formed by a single catadioptric camera and an omnidirectional light projector. It is also discussed how this sensor can be used in robot navigation applications

On optimal computation of MPLS label binding for multipoint-to-point connections

Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of underlaying Virtual Private Networks (VPNs) and, hence, reducing operational expenditure (OPEX). This letter discusses the problem of reducing the label spaces in Multiprotocol Label Switched (MPLS) networks using label merging - better known as MultiPoint-to-Point (MP2P) connections. Because of its origins in IP, MP2P connections have been considered to have tree- shapes with Label Switched Paths (LSP) as branches. Due to this fact, previous works by many authors affirm that the problem of minimizing the label space using MP2P in MPLS - the Merging Problem - cannot be solved optimally with a polynomial algorithm (NP-complete), since it involves a hard- decision problem. However, in this letter, the Merging Problem is analyzed, from the perspective of MPLS, and it is deduced that tree-shapes in MP2P connections are irrelevant. By overriding this tree-shape consideration, it is possible to perform label merging in polynomial time. Based on how MPLS signaling works, this letter proposes an algorithm to compute the minimum number of labels using label merging: the Full Label Merging algorithm. As conclusion, we reclassify the Merging Problem as Polynomial-solvable, instead of NP-complete. In addition, simulation experiments confirm that without the tree-branch selection problem, more labels can be reduced