Porto Oscillation Code (POSC)

The Porto Oscillation Code (POSC) has been developed in 1995 and improved over the years, with the main goal of calculating linear adiabatic oscillations for models of solar-type stars. It has also been used to estimate the frequencies and eigenfunctions of stars from the pre-main sequence up to the sub-giant phase, having a mass between 0.8 and 4 solar masses. The code solves the linearised perturbation equations of adiabatic pulsations for an equilibrium model using a second order numerical integration method. The possibility of using Richardson extrapolation is implemented. Several options for the surface boundary condition can be used. In this work we briefly review the key ingredients of the calculations, namely the equations, the numerical scheme and the output.Comment: Accepted for publication in Astrophysics and Space Science

Construction of a non-standard quantum field theory through a generalized Heisenberg algebra

We construct a Heisenberg-like algebra for the one dimensional quantum free Klein-Gordon equation defined on the interval of the real line of length $L$. Using the realization of the ladder operators of this type Heisenberg algebra in terms of physical operators we build a 3+1 dimensional free quantum field theory based on this algebra. We introduce fields written in terms of the ladder operators of this type Heisenberg algebra and a free quantum Hamiltonian in terms of these fields. The mass spectrum of the physical excitations of this quantum field theory are given by $\sqrt{n^2 \pi^2/L^2+m_q^2}$, where $n= 1,2,...$ denotes the level of the particle with mass $m_q$ in an infinite square-well potential of width $L$.Comment: Latex, 16 page

Narrowband Photon Pair Source for Quantum Networks

We demonstrate a compact photon pair source based on a periodically poled lithium niobate nonlinear crystal in a cavity. The cavity parameters are chosen such that the emitted photon pair modes can be matched in the region of telecom ultra dense wavelength division multiplexing (U-DWDM) channel spacings. This approach provides efficient, low-loss, mode selection that is compatible with standard telecommunication networks. Photons with a coherence time of 8.6 ns (116 MHz) are produced and their purity is demonstrated. A source brightness of 134 pairs(s.mW.MHz)$^{-1}$ is reported. The high level of purity and compatibility with standard telecom networks is of great importance for complex quantum communication networks

Fitting isochrones to open cluster photometric data III. Estimating metallicities from UBV photometry

The metallicity is a critical parameter that affects the correct determination fundamental characteristics stellar cluster and has important implications in Galactic and Stellar evolution research. Fewer than 10 % of the 2174 currently catalog open clusters have their metallicity determined in the literature. In this work we present a method for estimating the metallicity of open clusters via non-subjective isochrone fitting using the cross-entropy global optimization algorithm applied to UBV photometric data. The free parameters distance, reddening, age, and metallicity simultaneously determined by the fitting method. The fitting procedure uses weights for the observational data based on the estimation of membership likelihood for each star, which considers the observational magnitude limit, the density profile of stars as a function of radius from the center of the cluster, and the density of stars in multi-dimensional magnitude space. We present results of [Fe/H] for nine well-studied open clusters based on 15 distinct UBV data sets. The [Fe/H] values obtained in the ten cases for which spectroscopic determinations were available in the literature agree, indicating that our method provides a good alternative to determining [Fe/H] by using an objective isochrone fitting. Our results show that the typical precision is about 0.1 dex

Gibbs sampling detection for large MIMO and MTC uplinks with adaptive modulation

Wireless networks beyond 5G will mostly be serving myriads of sensors and other machine-type communications (MTC), with each device having different requirements in respect to latency, error rate, energy consumption, spectral efficiency or other specifications. Multiple-input multiple-output (MIMO) systems remain a central technology towards 6G, and in cases where massive antenna arrays or cell-free networks are not possible to deploy and only moderately large antenna arrays are allowed, the detection problem at the base-station cannot rely on zero-forcing or matched filters and more complex detection schemes have to be used. The main challenge is to find low complexity, hardware feasible methods that are able to attain near optimal performance. Randomized algorithms based on Gibbs sampling (GS) were proven to perform very close to the optimal detection, even for moderately large antenna arrays, while yielding an acceptable number of operations. However, their performance is highly dependent on the chosen “temperature” parameter (TP). In this paper, we propose and study an optimized variant of the GS method, denoted by triple mixed GS, and where three distinct values for the TP are considered. The method exhibits faster convergence rates than the existing ones in the literature, hence requiring fewer iterations to achieve a target bit error rate. The proposed detector is suitable for symmetric large MIMO systems, however the proposed fixed complexity detector is highly suitable to spectrally efficient adaptively modulated MIMO (AM-MIMO) systems where different types of devices upload information at different bit rates or have different requirements regarding spectral efficiency. The proposed receiver is shown to attain quasi-optimal performance in both scenarios.info:eu-repo/semantics/publishedVersio

Fast matrix inversion updates for massive MIMO detection and precoding

In this letter, methods and corresponding complexities for fast matrix inversion updates in the context of massive multiple-input multiple-output (MIMO) are studied. In particular, we propose an on-the-fly method to recompute the zero forcing (ZF) filter when a user is added or removed from the system. Additionally, we evaluate the recalculation of the inverse matrix after a new channel estimation is obtained for a given user. Results are evaluated numerically in terms of bit error rate (BER) using the Neumann series approximation as the initial inverse matrix. It is concluded that, with fewer operations, the performance after an update remains close to the initial one.info:eu-repo/semantics/acceptedVersio