Meromorphic continuation of functions and arbitrary distribution of interpolation points

We characterize the region of meromorphic continuation of an analytic function ff in terms of the geometric rate of convergence on a compact set of sequences of multi-point rational interpolants of ff. The rational approximants have a bounded number of poles and the distribution of interpolation points is arbitrary.

Analytic model of a cache-only memory architecture

An approximate analytic model of a shared memory multiprocessor with a Cache Only Memory Architecture (COMA), the busbased Data Difussion Machine (DDM), is presented and validated. It describes the timing and interference in the system as a function of the hardware, the protocols, the topology and the workload. Model results have been compared to results from an independent simulator. The comparison shows good model accuracy specially for non-saturated systems, where the errors in response times and device utilizations are independent of the number of processors and remain below 10% in 90% of the simulations. Therefore, the model can be used as an average performance prediction tool that avoids expensive simulations in the design of systems with many processors.

Analytic free-form lens design for imaging applications with high aspect ratio

A new three-dimensional analytic optics design method is presented that enables the coupling of three ray sets with only two free-form lens surfaces. Closely related to the Simultaneous Multiple Surface method in three dimensions (SMS3D), it is derived directly from Fermat?s principle, leading to multiple sets of functional differential equations. The general solution of these equations makes it possible to calculate more than 80 coefficients for each implicit surface function. Ray tracing simulations of these free-form lenses demonstrate superior imaging performance for applications with high aspect ratio, compared to conventional rotational symmetric systems.

Analytic free-form lens design for tracking integration in concentrating photovoltaics

In this work the concept of tracking integration in concentrating photovoltaics (CPV) is revisited and developed further. With respect to conventional CPV, tracking integration eliminates the clear separation between stationary units of optics and solar cells, and external solar trackers. This approach is capable of further increasing the concentration ratio and makes high concentrating photovoltaics (> 500x) available for single-axis tracker installations. The reduced external solar tracking effort enables possibly cheaper and more compact installations. Our proposed optical system uses two laterally moving plano-convex lenses to achieve high concentration over a wide angular range of ±24°. The lateral movement allows to combine both steering and concentration of the incident direct sun light. Given the specific symmetry conditions of the underlying optical design problem, rotational symmetric lenses are not ideal for this application. For this type of design problems, a new free-form optics design method presented in previous papers perfectly matches the symmetry. It is derived directly from Fermat's principle, leading to sets of functional differential equations allowing the successive calculation of the Taylor series coeficients of each implicit surface function up to very high orders. For optical systems designed for wide field of view and with clearly separated optical surfaces, this new analytic design method has potential application in both fields of nonimaging and imaging optics.

Nonparametric generalized belief propagation based on pseudo-junction tree for cooperative localization in wireless networks

Non-parametric belief propagation (NBP) is a well-known message passing method for cooperative localization in wireless networks. However, due to the over-counting problem in the networks with loops, NBP’s convergence is not guaranteed, and its estimates are typically less accurate. One solution for this problem is non-parametric generalized belief propagation based on junction tree. However, this method is intractable in large-scale networks due to the high-complexity of the junction tree formation, and the high-dimensionality of the particles. Therefore, in this article, we propose the non-parametric generalized belief propagation based on pseudo-junction tree (NGBP-PJT). The main difference comparing with the standard method is the formation of pseudo-junction tree, which represents the approximated junction tree based on thin graph. In addition, in order to decrease the number of high-dimensional particles, we use more informative importance density function, and reduce the dimensionality of the messages. As by-product, we also propose NBP based on thin graph (NBP-TG), a cheaper variant of NBP, which runs on the same graph as NGBP-PJT. According to our simulation and experimental results, NGBP-PJT method outperforms NBP and NBP-TG in terms of accuracy, computational, and communication cost in reasonably sized networks.