On the Analytic Solutions of the Functional Equations w 1 f(a 1 z) + w 2 f(a 2 z) + ... + w n f(a n z) = 0

In this paper, it is showed that, given an integer number n ≥ 2, each zero of an exponential polynomial of the form w1az1+w2az2+⋯+wnazn, with non-null complex numbers w 1,w 2,…,w n and a 1,a 2,…,a n , produces analytic solutions of the functional equation w 1 f(a 1 z) + w 2 f(a 2 z) + ... + w n f(a n z) = 0 on certain domains of C, which represents an extension of some existing results in the literature on this functional equation for the case of positive coefficients a j and w j.

On the Result of Invariance of the Closure Set of the Real Projections of the Zeros of an Important Class of Exponential Polynomials

In this paper we provide the proof of a practical point-wise characterization of the set RP defined by the closure set of the real projections of the zeros of an exponential polynomial P(z) = Σn j=1 cjewjz with real frequencies wj linearly independent over the rationals. As a consequence, we give a complete description of the set RP and prove its invariance with respect to the moduli of the c′ js, which allows us to determine exactly the gaps of RP and the extremes of the critical interval of P(z) by solving inequations with positive real numbers. Finally, we analyse the converse of this result of invariance.

Orbital phase-resolved spectroscopy of 4U 1538−52 with MAXI

Context. 4U 1538−52, an absorbed high mass X-ray binary with an orbital period of ~3.73 days, shows moderate orbital intensity modulations with a low level of counts during the eclipse. Several models have been proposed to explain the accretion at different orbital phases by a spherically symmetric stellar wind from the companion. Aims. The aim of this work is to study both the light curve and orbital phase spectroscopy of this source in the long term. In particular, we study the folded light curve and the changes in the spectral parameters with orbital phase to analyse the stellar wind of QV Nor, the mass donor of this binary system. Methods. We used all the observations made from the Gas Slit Camera on board MAXI of 4U 1538−52 covering many orbits continuously. We obtained the good interval times for all orbital phase ranges, which were the input for extracting our data. We estimated the orbital period of the system and then folded the light curves, and we fitted the X-ray spectra with the same model for every orbital phase spectrum. We also extracted the averaged spectrum of all the MAXI data available. Results. The MAXI spectra in the 2–20 keV energy range were fitted with an absorbed Comptonisation of cool photons on hot electrons. We found a strong orbital dependence of the absorption column density but neither the fluorescence iron emission line nor low energy excess were needed to fit the MAXI spectra. The variation in the spectral parameters over the binary orbit were used to examine the mode of accretion onto the neutron star in 4U 1538−52. We deduce a best value of Ṁ/v∞ = 0.65 × 10-9M⊙ yr-1/ (km s-1) for QV Nor.

Convergence analysis and validation of low cost distance metrics for computational cost reduction of the Iterative Closest Point algorithm

The Iterative Closest Point algorithm (ICP) is commonly used in engineering applications to solve the rigid registration problem of partially overlapped point sets which are pre-aligned with a coarse estimate of their relative positions. This iterative algorithm is applied in many areas such as the medicine for volumetric reconstruction of tomography data, in robotics to reconstruct surfaces or scenes using range sensor information, in industrial systems for quality control of manufactured objects or even in biology to study the structure and folding of proteins. One of the algorithm’s main problems is its high computational complexity (quadratic in the number of points with the non-optimized original variant) in a context where high density point sets, acquired by high resolution scanners, are processed. Many variants have been proposed in the literature whose goal is the performance improvement either by reducing the number of points or the required iterations or even enhancing the complexity of the most expensive phase: the closest neighbor search. In spite of decreasing its complexity, some of the variants tend to have a negative impact on the final registration precision or the convergence domain thus limiting the possible application scenarios. The goal of this work is the improvement of the algorithm’s computational cost so that a wider range of computationally demanding problems from among the ones described before can be addressed. For that purpose, an experimental and mathematical convergence analysis and validation of point-to-point distance metrics has been performed taking into account those distances with lower computational cost than the Euclidean one, which is used as the de facto standard for the algorithm’s implementations in the literature. In that analysis, the functioning of the algorithm in diverse topological spaces, characterized by different metrics, has been studied to check the convergence, efficacy and cost of the method in order to determine the one which offers the best results. Given that the distance calculation represents a significant part of the whole set of computations performed by the algorithm, it is expected that any reduction of that operation affects significantly and positively the overall performance of the method. As a result, a performance improvement has been achieved by the application of those reduced cost metrics whose quality in terms of convergence and error has been analyzed and validated experimentally as comparable with respect to the Euclidean distance using a heterogeneous set of objects, scenarios and initial situations.

Evaluation of sampling method effects in 3D non-rigid registration

Since the beginning of 3D computer vision problems, the use of techniques to reduce the data to make it treatable preserving the important aspects of the scene has been necessary. Currently, with the new low-cost RGB-D sensors, which provide a stream of color and 3D data of approximately 30 frames per second, this is getting more relevance. Many applications make use of these sensors and need a preprocessing to downsample the data in order to either reduce the processing time or improve the data (e.g., reducing noise or enhancing the important features). In this paper, we present a comparison of different downsampling techniques which are based on different principles. Concretely, five different downsampling methods are included: a bilinear-based method, a normal-based, a color-based, a combination of the normal and color-based samplings, and a growing neural gas (GNG)-based approach. For the comparison, two different models have been used acquired with the Blensor software. Moreover, to evaluate the effect of the downsampling in a real application, a 3D non-rigid registration is performed with the data sampled. From the experimentation we can conclude that depending on the purpose of the application some kernels of the sampling methods can improve drastically the results. Bilinear- and GNG-based methods provide homogeneous point clouds, but color-based and normal-based provide datasets with higher density of points in areas with specific features. In the non-rigid application, if a color-based sampled point cloud is used, it is possible to properly register two datasets for cases where intensity data are relevant in the model and outperform the results if only a homogeneous sampling is used.

Inherited Photoreceptor Degeneration Causes the Death of Melanopsin-Positive Retinal Ganglion Cells and Increases Their Coexpression of Brn3a

Purpose: To study the population of intrinsically photosensitive retinal ganglion cells (melanopsin-expressing RGCs, m+RGCs) in P23H-1 rats, a rat model of inherited photoreceptor degeneration. Methods: At postnatal (P) times P30, P365, and P540, retinas from P23H dystrophic rats (line 1, rapid degeneration; and line 3, slow degeneration) and Sprague Dawley (SD) rats (control) were dissected as whole-mounts and immunodetected for melanopsin and/or Brn3a. The dendritic arborization of m+RGCs and the numbers of Brn3a+RGCs and m+RGCs were quantified and their retinal distribution and coexpression analyzed. Results: In SD rats, aging did not affect the population of Brn3a+RGCs or m+RGCs or the percentage that showed coexpression (0.27%). Young P23H-1 rats had a significantly lower number of Brn3a+RGCs and showed a further decline with age. The population of m+RGCs in young P23H-1 rats was similar to that found in SD rats and decreased by 22.6% and 28.2% at P365 and P540, respectively, similarly to the decrease of the Brn3a+RGCs. At these ages the m+RGCs showed a decrease of their dendritic arborization parameters, which was similar in both the P23H-1 and P23H-3 lines. The percentage of coexpression of Brn3a was, however, already significantly higher at P30 (3.31%) and increased significantly with age (10.65% at P540). Conclusions: Inherited photoreceptor degeneration was followed by secondary loss of Brn3a+RGCs and m+RGCs. Surviving m+RGCs showed decreased dendritic arborization parameters and increased coexpression of Brn3a and melanopsin, phenotypic and molecular changes that may represent an effort to resist degeneration and/or preferential survival of m+RGCs capable of synthesizing Brn3a.