Pointwise estimates for the Bergman kernel of the weighted Fock space

We prove upper pointwise estimates for the Bergman kernel of the weighted Fock space of entire functions in $L^{2}(e^{-2\phi}) $ where $\phi$ is a subharmonic function with $\Delta\phi$ a doubling measure. We derive estimates for the canonical solution operator to the inhomogeneous Cauchy-Riemann equation and we characterize the compactness of this operator in terms of $\Delta\phi$.

The Human Mesenchymal Stromal Cell-Derived Osteocyte Capacity to Modulate Dendritic Cell Functions Is Strictly Dependent on the Culture System.

In vitro differentiation of mesenchymal stromal cells (MSC) into osteocytes (human differentiated osteogenic cells, hDOC) before implantation has been proposed to optimize bone regeneration. However, a deep characterization of the immunological properties of DOC, including their effect on dendritic cell (DC) function, is not available. DOC can be used either as cellular suspension (detached, Det-DOC) or as adherent cells implanted on scaffolds (adherent, Adh-DOC). By mimicking in vitro these two different routes of administration, we show that both Det-DOC and Adh-DOC can modulate DC functions. Specifically, the weak downregulation of CD80 and CD86 caused by Det-DOC on DC surface results in a weak modulation of DC functions, which indeed retain a high capacity to induce T-cell proliferation and to generate CD4(+)CD25(+)Foxp3(+) T cells. Moreover, Det-DOC enhance the DC capacity to differentiate CD4(+)CD161(+)CD196(+) Th17-cells by upregulating IL-6 secretion. Conversely, Adh-DOC strongly suppress DC functions by a profound downregulation of CD80 and CD86 on DC as well as by the inhibition of TGF-β production. In conclusion, we demonstrate that different types of DOC cell preparation may have a different impact on the modulation of the host immune system. This finding may have relevant implications for the design of cell-based tissue-engineering strategies.

A Gradient based algorithm for blind inversion of Wiener System using multi-variate score functions

A Wiener system is a linear time-invariant filter, followed by an invertible nonlinear distortion. Assuming that the input signal is an independent and identically distributed (iid) sequence, we propose an algorithm for estimating the input signal only by observing the output of the Wiener system. The algorithm is based on minimizing the mutual information of the output samples, by means of a steepest descent gradient approach.

On the bicanonical map of irregular varieties

From the point of view of uniform bounds for the birationality of pluricanonical maps, irregular varieties of general type and maximal Albanese dimension behave similarly to curves. In fact Chen-Hacon showed that, at least when their holomorphic Euler characteristic is positive, the tricanonical map of such varieties is always birational. In this paper we study the bicanonical map. We consider the natural subclass of varieties of maximal Albanese dimension formed by primitive varieties of Albanese general type. We prove that the only such varieties with non-birational bicanonical map are the natural higher-dimensional generalization to this context of curves of genus $2$: varieties birationally equivalent to the theta-divisor of an indecomposable principally polarized abelian variety. The proof is based on the (generalized) Fourier-Mukai transform.

The Bonenblust-Hille inequality for homogeneous polynomials is hypercontractive

The Bohnenblust-Hille inequality says that the $\ell^{\frac{2m}{m+1}}$ -norm of the coefficients of an $m$-homogeneous polynomial $P$ on $\Bbb{C}^n$ is bounded by $\| P \|_\infty$ times a constant independent of $n$, where $\|\cdot \|_\infty$ denotes the supremum norm on the polydisc $\mathbb{D}^n$. The main result of this paper is that this inequality is hypercontractive, i.e., the constant can be taken to be $C^m$ for some $C>1$. Combining this improved version of the Bohnenblust-Hille inequality with other results, we obtain the following: The Bohr radius for the polydisc $\mathbb{D}^n$ behaves asymptotically as $\sqrt{(\log n)/n}$ modulo a factor bounded away from 0 and infinity, and the Sidon constant for the set of frequencies $\bigl\{ \log n: n \text{a positive integer} \le N\bigr\}$ is $\sqrt{N}\exp\{(-1/\sqrt{2}+o(1))\sqrt{\log N\log\log N}\}$.

The induced generalized OWA operator

We present the induced generalized ordered weighted averaging (IGOWA) operator. It is a new aggregation operator that generalizes the OWA operator by using the main characteristics of two well known aggregation operators: the generalized OWA and the induced OWA operator. Then, this operator uses generalized means and order inducing variables in the reordering process. With this formulation, we get a wide range of aggregation operators that include all the particular cases of the IOWA and the GOWA operator, and a lot of other cases such as the induced ordered weighted geometric (IOWG) operator and the induced ordered weighted quadratic averaging (IOWQA) operator. We further generalize the IGOWA operator by using quasi-arithmetic means. The result is the Quasi-IOWA operator. Finally, we also develop a numerical example of the new approach in a financial decision making problem.

On Short Exponential Sums Involving Fourier Coefficients of Holomorphic Cusp Forms

By an exponential sum of the Fourier coefficients of a holomorphic cusp form we mean the sum which is formed by first taking the Fourier series of the said form,then cutting the beginning and the tail away and considering the remaining sum on the real axis. For simplicity’s sake, typically the coefficients are normalized. However, this isn’t so important as the normalization can be done and removed simply by using partial summation. We improve the approximate functional equation for the exponential sums of the Fourier coefficients of the holomorphic cusp forms by giving an explicit upper bound for the error term appearing in the equation. The approximate functional equation is originally due to Jutila [9] and a crucial tool for transforming sums into shorter sums. This transformation changes the point of the real axis on which the sum is to be considered. We also improve known upper bounds for the size estimates of the exponential sums. For very short sums we do not obtain any better estimates than the very easy estimate obtained by multiplying the upper bound estimate for a Fourier coefficient (they are bounded by the divisor function as Deligne [2] showed) by the number of coefficients. This estimate is extremely rough as no possible cancellation is taken into account. However, with small sums, it is unclear whether there happens any remarkable amounts of cancellation.

Biological interpretation of genome-wide association studies using predicted gene functions.

The main challenge for gaining biological insights from genetic associations is identifying which genes and pathways explain the associations. Here we present DEPICT, an integrative tool that employs predicted gene functions to systematically prioritize the most likely causal genes at associated loci, highlight enriched pathways and identify tissues/cell types where genes from associated loci are highly expressed. DEPICT is not limited to genes with established functions and prioritizes relevant gene sets for many phenotypes.

Implementing Role Based Access Control into the Enterprise Environment to Support Business and IT Functions

The thesis studies role based access control and its suitability in the enterprise environment. The aim is to research how extensively role based access control can be implemented in the case organization and how it support organization’s business and IT functions. This study points out the enterprise’s needs for access control, factors of access control in the enterprise environment and requirements for implementation and the benefits and challenges it brings along. To find the scope how extensively role based access control can be implemented into the case organization, firstly is examined the actual state of access control. Secondly is defined a rudimentary desired state (how things should be) and thirdly completed it by using the results of the implementation of role based access control application. The study results the role model for case organization unit, and the building blocks and the framework for the organization wide implementation. Ultimate value for organization is delivered by facilitating the normal operations of the organization whilst protecting its information assets.

New kernel functions and learning methods for text and data mining

Recent advances in machine learning methods enable increasingly the automatic construction of various types of computer assisted methods that have been difficult or laborious to program by human experts. The tasks for which this kind of tools are needed arise in many areas, here especially in the fields of bioinformatics and natural language processing. The machine learning methods may not work satisfactorily if they are not appropriately tailored to the task in question. However, their learning performance can often be improved by taking advantage of deeper insight of the application domain or the learning problem at hand. This thesis considers developing kernel-based learning algorithms incorporating this kind of prior knowledge of the task in question in an advantageous way. Moreover, computationally efficient algorithms for training the learning machines for specific tasks are presented. In the context of kernel-based learning methods, the incorporation of prior knowledge is often done by designing appropriate kernel functions. Another well-known way is to develop cost functions that fit to the task under consideration. For disambiguation tasks in natural language, we develop kernel functions that take account of the positional information and the mutual similarities of words. It is shown that the use of this information significantly improves the disambiguation performance of the learning machine. Further, we design a new cost function that is better suitable for the task of information retrieval and for more general ranking problems than the cost functions designed for regression and classification. We also consider other applications of the kernel-based learning algorithms such as text categorization, and pattern recognition in differential display. We develop computationally efficient algorithms for training the considered learning machines with the proposed kernel functions. We also design a fast cross-validation algorithm for regularized least-squares type of learning algorithm. Further, an efficient version of the regularized least-squares algorithm that can be used together with the new cost function for preference learning and ranking tasks is proposed. In summary, we demonstrate that the incorporation of prior knowledge is possible and beneficial, and novel advanced kernels and cost functions can be used in algorithms efficiently.