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.

Internal and External Determinants of Radical and incremental Innovation in SMEs: the case of Catalonia

There is a major concern in economic literature about innovation, which is the interaction between internal and external factors.. In this paper those activities are hypothesized as being determined by some territorial characteristics like labour skills, technological infrastructure, educational facilities, agglomeration economies and industrial structure. This assumption allows understanding why those innovative activities are not spread across space and are located into specific areas. We use a detailed survey containing microdata for 497 SMEs located in Catalonia.

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

Transmission delays in residual computation

The design of control, estimation or diagnosis algorithms most often assumes that all available process variables represent the system state at the same instant of time. However, this is never true in current network systems, because of the unknown deterministic or stochastic transmission delays introduced by the communication network. During the diagnosing stage, this will often generate false alarms. Under nominal operation, the different transmission delays associated with the variables that appear in the computation form produce discrepancies of the residuals from zero. A technique aiming at the minimisation of the resulting false alarms rate, that is based on the explicit modelling of communication delays and on their best-case estimation is proposed

Incremental Prognostic Value of Myocardial Blood Flow Quantification with Rb-82 Cardiac PET in Patients With Known or Suspected CAD

Rb-82cardiac PET has been used to non-invasively assess myocardial blood flow (MBF)and myocardial flow reserve (MFR). The impact of MBF and MFR for predictingmajor adverse cardiovascular events (MACE) has not been investigated in aprospective study, which was our aim. MATERIAL AND METHODS: In total, 280patients (65±10y, 36% women) with known or suspected CAD were prospectivelyenrolled. They all underwent both a rest and adenosine stress Rb-82 cardiacPET/CT. Dynamic acquisitions were processed with the FlowQuant 2.1.3 softwareand analyzed semi-quantitatively (SSS, SDS) and quantitatively (MBF, MFR) andreported using the 17-segment AHA model. Patients were stratified based on SDS,stress MBF and MFR and allocated into tertiles. For each group, annualizedevent rates were computed by dividing the number of annualized MACE (cardiacdeath, myocardial infarction, revascularisation or hospitalisation forcardiac-related event) by the sum of individual follow-up periods in years.Outcome were analysed for each group using Kaplan-Meier event-free survivalcurves and compared using the log-rank test. Multivariate analysis wasperformed in a stepwise fashion using Cox proportional hazards regressionmodels (p<0.05 for model inclusion). RESULTS: In a median follow-up of 256days (range 168-440d), 44 MACE were observed. Ischemia (SDS≥2) was observed in95 patients who had higher annualized MACE rate as compared to those without(55% vs. 9.8%, p<0.0001). The group with the lowest MFR tertile (MFR<1.76)had higher MACE rate than the two highest tertiles (51% vs. 9% and 14%,p<0.0001). Similarly, the group with the lowest stress MBF tertile(MBF<1.78mL/min/g) had the highest annualized MACE rate (41% vs. 26% and 6%,p=0.0002). On multivariate analysis, the addition of MFR or stress MBF to SDSsignificantly increased the global χ2 (from 56 to 60, p=0.04; and from56 to 63, p=0.01). The best prognostic power was obtained in a model combiningSDS (p<0.001) and stress MBF (p=0.01). Interestingly, the integration ofstress MBF enhanced risk stratification even in absence of ischemia.CONCLUSIONS: Quantification of MBF or MFR in Rb-82 cardiac PET/CT providesindependent and incremental prognostic information over semi-quantitativeassessment with SDS and is of value for risk stratification.

A Monte Carlo method for accelerating the computation of animated radiosity sequences

Realistic rendering animation is known to be an expensive processing task when physically-based global illumination methods are used in order to improve illumination details. This paper presents an acceleration technique to compute animations in radiosity environments. The technique is based on an interpolated approach that exploits temporal coherence in radiosity. A fast global Monte Carlo pre-processing step is introduced to the whole computation of the animated sequence to select important frames. These are fully computed and used as a base for the interpolation of all the sequence. The approach is completely view-independent. Once the illumination is computed, it can be visualized by any animated camera. Results present significant high speed-ups showing that the technique could be an interesting alternative to deterministic methods for computing non-interactive radiosity animations for moderately complex scenarios

Disseny dels elements constitutius per adaptar un centre de mecanitzat de control numèric a la tecnologia Incremental Sheet Forming (ISF)

Un dels processos tradicionals de conformació de xapa més utilitzats a nivell industrial, degut a la seva rapidesa d’operació i la seva maduresa del procés, és l’embotició. Per a dur a terme aquest procés és necessària la construcció d’uns utillatges (matriu i punxó) per a cada tipus de producte. Aquests utillatges estan fabricats amb materials altament resistents ja que han de poder suportar càrregues molt importants durant la deformació. A més, s’han de garantir unes precisions dimensionals molt bones per tal d’evitar el xoc entre les dues parts de l’utillatge i per a assegurar que la peça obtinguda tingui les dimensions desitjades. Aquest fet implica que el procés d’obtenció de les matrius i punxons tingui un cost molt elevat i per a amortitzar-lo és necessari que la producció sigui en massa.L’objecte d’aquest projecte és adaptar el centre de mecanitzat Kondia HS1000 per tal de poder dur a terme recerca bàsica de la tecnologia de conformat incremental de xapa (ISF) en el Grup de Recerca en Enginyeria del Producte, Procés i Producció (GREP)