Coincident brane nucleation and the neutralization of Lambda

"static" instanton, representing pair creation of critical bubbles¿a process somewhat analogous to thermal activation in flat space. In that case, the branes may stick together due to thermal symmetry restoration, and the pair creation rate depends exponentially on the ambient de Sitter temperature, switching off sharply as the temperature approaches zero. Such a static instanton may be well suited for the ¿saltatory¿ relaxation scenario proposed by Feng et al.

Constraints on effective field theory parameters for the Lambda N -> NN transition

The relation between the low-energy constants appearing in the effective field theory description of the Lambda N -> NN transition potential and the parameters of the one-meson-exchange model previously developed is obtained. We extract the relative importance of the different exchange mechanisms included in the meson picture by means of a comparison to the corresponding operational structures appearing in the effective approach. The ability of this procedure to obtain the weak baryon-baryon-meson couplings for a possible scalar exchange is also discussed.

Constraints on effective field theory parameters for the Lambda N -> NN transition

The relation between the low-energy constants appearing in the effective field theory description of the Lambda N -> NN transition potential and the parameters of the one-meson-exchange model previously developed is obtained. We extract the relative importance of the different exchange mechanisms included in the meson picture by means of a comparison to the corresponding operational structures appearing in the effective approach. The ability of this procedure to obtain the weak baryon-baryon-meson couplings for a possible scalar exchange is also discussed.

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.

Disseny web intranet

S¿ha realitzat el desenvolupament del disseny d¿una web per una empresa dedicada als serveis a les persones de la seva ciutat. El principal objectiu d¿aquesta empresa amb aquesta web és apropar informació de l¿organització a tots els treballadors. S¿ha pensat que el millor es centrar el disseny en allò que l¿usuari vol i per això s¿ha triat la tècnica del ¿Disseny centrat en l¿usuari¿.En primer lloc s¿ha utilitzat unes enquestes basades en la web de TRUMP per identificar els diferents usuaris que ens podem trobar. Amb la tècnica de ¿focus group¿ s¿han identificat les tasques principals que s¿han de recollir en el disseny i amb la tècnica de ¿card sorting¿ s¿han triat uns possibles escenaris de treball en la web. Amb aquesta informació s¿han realitzat uns fluxos d¿iteració que donen resposta a tasques i escenaris i un prototipus de disseny usable per a tots els tipus d¿usuari.

A two-stage approach for tonic identification in indian art music

In this paper we propose a new approach for tonic identification in Indian art music and present a proposal for acomplete iterative system for the same. Our method splits the task of tonic pitch identification into two stages. In the first stage, which is applicable to both vocal and instrumental music, we perform a multi-pitch analysis of the audio signal to identify the tonic pitch-class. Multi-pitch analysisallows us to take advantage of the drone sound, which constantlyreinforces the tonic. In the second stage we estimate the octave in which the tonic of the singer lies and is thusneeded only for the vocal performances. We analyse the predominant melody sung by the lead performer in order to establish the tonic octave. Both stages are individually evaluated on a sizable music collection and are shown toobtain a good accuracy. We also discuss the types of errors made by the method.Further, we present a proposal for a system that aims to incrementally utilize all the available data, both audio and metadata in order to identify the tonic pitch. It produces a tonic estimate and a confidence value, and is iterative in nature. At each iteration, more data is fed into the systemuntil the confidence value for the identified tonic is above a defined threshold. Rather than obtain high overall accuracy for our complete database, ultimately our goal is to develop a system which obtains very high accuracy on a subset of the database with maximum confidence.

A systolic array for linear MIMO detection based on an all-swap lattice reduction algorithm

A systolic array to implement lattice-reduction-aided lineardetection is proposed for a MIMO receiver. The lattice reductionalgorithm and the ensuing linear detections are operated in the same array, which can be hardware-efficient. All-swap lattice reduction algorithm (ASLR) is considered for the systolic design.ASLR is a variant of the LLL algorithm, which processes all lattice basis vectors within one iteration. Lattice-reduction-aided linear detection based on ASLR and LLL algorithms have very similarbit-error-rate performance, while ASLR is more time efficient inthe systolic array, especially for systems with a large number ofantennas.

The HP-filter in cross-country comparisons

Many empirical studies of business cycles have followed the practise ofapplying the Hodrick-Prescott filter for cross-country comparisons. Thestandard procedure is to set the weight \lambda, which determines the'smoothness' of the trend equal to 1600. We show that if this value isused for against common wisdom about business cycles. As an example, weshow that the long recession occurred inSpain between 1975 and 1985 goesunnotoced by the HP filter. We propose a method for adjusting \lambda byreinterpreting the HP-filter as the solution to a constrained minimizationproblem. We argue that the common practice of fixing \lambda across countriesamounts to chankging the constraints on trend variability across countries.Our proposed method is easy to apply, retains all the virtues of thestandard HP-filter and when applied to Spanish data the results are inthe line with economic historian's view. Applying the method to a numberof OECD countries we find that, with the exception of Spain, Italy andJapan, the standard choice of \lambda=1600 is sensible.

Generalized canonical correlation analysis of matrices with different row and column orders

A Method is offered that makes it possible to apply generalized canonicalcorrelations analysis (CANCOR) to two or more matrices of different row and column order. The new method optimizes the generalized canonical correlationanalysis objective by considering only the observed values. This is achieved byemploying selection matrices. We present and discuss fit measures to assessthe quality of the solutions. In a simulation study we assess the performance of our new method and compare it to an existing procedure called GENCOM,proposed by Green and Carroll. We find that our new method outperforms the GENCOM algorithm both with respect to model fit and recovery of the truestructure. Moreover, as our new method does not require any type of iteration itis easier to implement and requires less computation. We illustrate the methodby means of an example concerning the relative positions of the political parties inthe Netherlands based on provincial data.

A Variant of Higher-Order Anti-Unification

We present a rule-based Huet’s style anti-unification algorithm for simply-typed lambda-terms in ɳ long β normal form, which computes a least general higher-order pattern generalization. For a pair of arbitrary terms of the same type, such a generalization always exists and is unique modulo α equivalence and variable renaming. The algorithm computes it in cubic time within linear space. It has been implemented and the code is freely available

Mossbauer and magnetization studies of amorphous NdFeB compositionally modulated thin films

Several NdFeB compositionally modulated thin films are studied by using both conversion electron Mossbauer spectra and SQUID (superconducting quantum-interference-device) magnetometry. Both the hyperfine fields and the easy magnetization magnitude are not correlated with the modulation characteristic length (lambda) while the magnetization perpendicular to the thin-film plane decreases as lambda increases. The spectra were recorded at room temperature being the gamma rays perpendicular to the substrate plane. The magnetization measurements were recorded by using a SHE SQUID magnetometer in applied magnetic fields up to 5.5 T and in the temperature range between 1.8 and 30 K.

Periodic points of holomorphic maps via Lefschetz numbers

In this paper we study the set of periods of holomorphic maps on compact manifolds, using the periodic Lefschetz numbers introduced by Dold and Llibre, which can be computed from the homology class of the map. We show that these numbers contain information about the existence of periodic points of a given period; and, if we assume the map to be transversal, then they give us the exact number of such periodic orbits. We apply this result to the complex projective space of dimension n and to some special type of Hopf surfaces, partially characterizing their set of periods. In the first case we also show that any holomorphic map of CP(n) of degree greater than one has infinitely many distinct periodic orbits, hence generalizing a theorem of Fornaess and Sibony. We then characterize the set of periods of a holomorphic map on the Riemann sphere, hence giving an alternative proof of Baker's theorem.

On the connectivity of the escaping set for complex exponential Misiurewicz parameters

Let $ E_{\lambda}(z)=\lambda {\rm exp}(z), \lambda\in \mathbb{C}$, be the complex exponential family. For all functions in the family there is a unique asymptotic value at 0 (and no critical values). For a fixed $ \lambda$, the set of points in $ \mathbb{C}$ with orbit tending to infinity is called the escaping set. We prove that the escaping set of $ E_{\lambda}$ with $ \lambda$ Misiurewicz (that is, a parameter for which the orbit of the singular value is strictly preperiodic) is a connected set.

Partial correlation : Network analysis

The final year project came to us as an opportunity to get involved in a topic which has appeared to be attractive during the learning process of majoring in economics: statistics and its application to the analysis of economic data, i.e. econometrics.Moreover, the combination of econometrics and computer science is a very hot topic nowadays, given the Information Technologies boom in the last decades and the consequent exponential increase in the amount of data collected and stored day by day. Data analysts able to deal with Big Data and to find useful results from it are verydemanded in these days and, according to our understanding, the work they do, although sometimes controversial in terms of ethics, is a clear source of value added both for private corporations and the public sector. For these reasons, the essence of this project is the study of a statistical instrument valid for the analysis of large datasets which is directly related to computer science: Partial Correlation Networks.The structure of the project has been determined by our objectives through the development of it. At first, the characteristics of the studied instrument are explained, from the basic ideas up to the features of the model behind it, with the final goal of presenting SPACE model as a tool for estimating interconnections in between elements in large data sets. Afterwards, an illustrated simulation is performed in order to show the power and efficiency of the model presented. And at last, the model is put into practice by analyzing a relatively large data set of real world data, with the objective of assessing whether the proposed statistical instrument is valid and useful when applied to a real multivariate time series. In short, our main goals are to present the model and evaluate if Partial Correlation Network Analysis is an effective, useful instrument and allows finding valuable results from Big Data.As a result, the findings all along this project suggest the Partial Correlation Estimation by Joint Sparse Regression Models approach presented by Peng et al. (2009) to work well under the assumption of sparsity of data. Moreover, partial correlation networks are shown to be a very valid tool to represent cross-sectional interconnections in between elements in large data sets.The scope of this project is however limited, as there are some sections in which deeper analysis would have been appropriate. Considering intertemporal connections in between elements, the choice of the tuning parameter lambda, or a deeper analysis of the results in the real data application are examples of aspects in which this project could be completed.To sum up, the analyzed statistical tool has been proved to be a very useful instrument to find relationships that connect the elements present in a large data set. And after all, partial correlation networks allow the owner of this set to observe and analyze the existing linkages that could have been omitted otherwise.