Invasions of non-native species cause problems in ecosystems worldwide, and despite the extensive effort that has been put into research about invasions, we still lack a good understanding for why some, but not other, communities resist these invasions. In this doctoral thesis I test hypotheses on biotic resistance using a large dataset of more than 1000 both failed and successful introductions of freshwater fish into Swedish lakes. We have found that the classic species richness hypothesis is a poor descriptor of introduction success because it fails to acknowledge that resident species contribute to the resistance in different ways. We developed a new measure of biotic resistance, the weighted species richness, which takes into account that the resident species contributes to the resistance with different strength and sign. Further, we correlated performance traits of species in their role as an invader and as a resident species to predict how the biotic resistance of these communities would develop over time. We found a positive correlation between performance traits: Some species have high introduction success, they make a large contribution to the resistance, and they cause extinctions when introduced but do not go extinct themselves when other species establishes, whereas other species are weak performers in these respects. Thus, the biotic resistance of these communities should grow stronger as non-native species accumulates. These results give us clues about what type of communities that should be most sensitive to further invasions, i.e., communities harboring species weak performers.  My results show that the biotic resistance of communities is an important factor in determining invasibility of a community. They also show that methods for quantifying resistance must take into account how interactions are structured in nature. What determine the biotic resistance of a community is the type of interactions that the resident species have with the invader and not the species richness of the community.

No description available.

There is investigated the weighted boundary value problem for the ordinary linear of the second order differential unhomogeneous equation with the strong singular coefficients at a separate point in this work and the singularity of the coefficients are of the degree type. The mentioned above boundary value problem are researched in interval which beginning coincides with the singular point of equation. Weighted condition is formed at singular point for the solution, the value of the solution is indicated in the another point. There are proved general characteristics of the homogeneous equation, also the existence and uniqueness of the solution of the analysed problem.

Weighted group algebras have been studied extensively in Abstract Harmonic Analysis.Complete characterizations have been found for some important properties of weighted group algebras, namely, amenability and Arens regularity. Also studies on some other features of these algebras, say weak amenability and isomorphism to operator algebras, have attracted attention. Hypergroups are generalized versions of locally compact groups. When a discrete group has all its conjugacy classes finite, the set of all conjugacy classes forms a discrete commutative hypergroup. Also the set of equivalence classes of irreducible unitary representations of a compact group forms a discrete commutative hypergroup. Other examples of discrete commutative hypergroups come from families of orthogonal polynomials. The center of the group algebra of a discrete finite conjugacy (FC) group can be identified with a hypergroup algebra. For a specific class of discrete FC groups, the restricted direct products of finite groups (RDPF), we study some properties of the center of the group algebra including amenability, maximal ideal space, and existence of a bounded approximate identity of maximal ideals. One of the generalizations of weighted group algebras which may be considered is weighted hypergroup algebras. Defining weighted hypergroups, analogous to weighted groups, we study a variety of examples, features and applications of weighted hypergroup algebras. We investigate some properties of these algebras including: dual Banach algebra structure, Arens regularity, and isomorphism with operator algebras. We define and study Folner type conditions for hypergroups. We study the relation of the Folner type conditions with other amenability properties of hypergroups. We also demonstrate some results obtained from the Leptin condition for Fourier algebras of certain hypergroups. Highlighting these tools, we specially study the Leptin condition on duals of compact groups for some specific compact groups. An application is given to Segal algebras on compact groups.

No description available.

Darbe nagrinėjamos Hurvico dzeta funkcijos _dzeta(s; alfa_), s = _alfa +it su algebriniu iracionaliuoju parametru _alfa, 0 < alfa_ ≤ 1 diskretusis reikšmių pasiskirstymas. Įrodyta, jog funkcijai _(s; alfa_) galioja diskrečioji ribinė teorema su svoriu kompleksinėje plokštumoje C. / Master’s work is devoted to the investigation of value distribution of Hurwitz zeta-function _(s; alfa_), s = alfa_ + it with algebraic irrational parameter alfa_, 0 < alfa_ ≤ 1. It is proved that for the function _(s; alfa_) valid discrete limit theorem with weight in the complex plane.

Despite the benefit of the memory hierarchy, it is still essential, in order to reduce accesses to higher levels of memory, to have an efficient usage of registers and local memories (also called scratchpad memories) present in most embedded processors, graphical processors (GPUs) and network processors. During the compilation, from a source language to an executable code, there are two optimizations that are of utmost importance: the register allocation and the local memory allocation. In this thesis's report we are interested in decoupled approaches, solving separately the allocation and assignment problems, that helps to improve the quality of the register and local memory allocations. In the first part of this thesis we are interested in two aspects of the register allocation problem: the improvements of the just-in-time (JIT) register allocation and the spill minimization problem. We introduce the split register allocation which leverages the decoupled approach to improve register allocation in the context of JIT compilation. We experimentally validate the effectiveness of split register allocation and its portability with respect to register count variations, relying on annotations whose impact on the bytecode size is negligible. We introduce a new decoupled approach, called iterated-optimal allocation, which focus on the spill minimization problem. The iterated-optimal allocation algorithm achieves results close to optimal while offering pseudo-polynomial guarantees for SSA programs and fast allocations on general programs. In the second part of this thesis, we study how a decoupled local memory allocation can be proposed in light of recent progresses in register allocation. We first validate our intuition for decoupled approach to local memory allocation. Then, we study the local memory allocation in a more theoretical way setting the junction between local memory allocation for linearized programs and weighted interval graph coloring. We design and analyze a new variant of the ship-building problem called the submarine-building problem. We show that this problem is NP-complete on interval graphs, while it is solvable in linear time for proper interval graphs, equivalent to unit interval graphs. The submarine-building problem is the first problem that is known to be NP-complete on interval graphs, while it is solvable in linear time for unit interval graphs. In the third part of this thesis, we propose a heuristic-based solution, the clustering allocator, which decouples the local memory allocation problem and aims to minimize the allocation cost. The clustering allocator while devised for local memory allocation, it appears to be a very good solution to the register allocation problem. After many years of separation, this new algorithm seems to be a bridge to reconcile the local memory allocation and the register allocation problems.

A general global approximation scheme is developed and its generality is demonstrated by the derivation of classical Lagrange and Hermite interpolation and finite difference and finite element approximations as its special cases. It is also shown that previously reported general approximation techniques which use the idea of moving least square are also special cases of the present method. The combination of the developed general global approximation technique with the weighted residual methods provides a very powerful scheme for the solution of the boundary value problems formulated in terms of differential equations. Although this application is the main purpose of the this project, nevertheless, the power and flexibility of the developed approximation allows it to be used in many other areas. In this study the following applications of the described approximation are developed: 1- data fitting (including curve and surface fitting) 2- plane mapping (both in cases where a conformal mapping exists and for non-conformal mapping) 3- solution of eigenvalue problems with particular application to spectral expansions used in the modal representation of shallow water equations 4- solution of ordinary differential equations (including Sturm-Liouville equations, non-homogeneous equations with non-smooth right hand sides and 4th order equations) 5- elliptic partial differential equations (including Poisson equations with non-smooth right hand sides) A computer program which can handle the above applications is developed. This program utilises symbolic, numerical and graphical and the programming language provided by the Mathematica package.

The purpose of this thesis is to implement Finite Volume Weighted Essentially Non-Oscillatory (FV-WENO) scheme to solution of one and two-dimensional discretised Euler equations with different flux algorithms. The effects of the different fluxes on the solution have been tested and discussed. Beside, the effect of the grid on these fluxes has been investigated. Weighted Essentially Non-Oscillatory (WENO) schemes are high order accurate schemes designed for problems with piecewise smooth solutions that involve discontinuities. WENO schemes have been successfully used in applications, especially for problems containing both shocks and complicated smooth solution structures. Fluxes are used as building blocks in FV-WENO scheme. The efficiency of the scheme is dependent on the fluxes used in scheme The applications tested in this thesis are the 1-D Shock Tube Problem, Double Mach Reflection, Supersonic Channel Flow, and supersonic Staggered Wedge Cascade. The numerical solutions for 1-D Shock Tube Problem and the supersonic channel flow are compared with the analytical solutions. The results for the Double Mach Reflection and the supersonic staggered cascade are compared with results from literature.

Casamento de padrões de pontos em Espaços Euclidianos é um dos problemas fundamentais em reconhecimento de padrões, tendo aplicações que vão desde Visão Computacional até Química Computacional. Sempre que dois padrões complexos estão codi- ficados em termos de dois conjuntos de pontos que identificam suas características fundamentais, sua comparação pode ser vista como um problema de casamento de padrões de pontos. Este trabalho propõe uma abordagem unificada para os problemas de casamento exato e inexato de padrões de pontos em Espaços Euclidianos de dimensão arbitrária. No caso de casamento exato, é garantida a obtenção de uma solução ótima. Para casamento inexato (quando ruído está presente), resultados experimentais confirmam a validade da abordagem. Inicialmente, considera-se o problema de casamento de padrões de pontos como um problema de casamento de grafos ponderados. O problema de casamento de grafos ponderados é então formulado como um problema de inferência Bayesiana em um modelo gráfico probabilístico. Ao explorar certos vínculos fundamentais existentes em padrões de pontos imersos em Espaços Euclidianos, provamos que, para o casamento exato de padrões de pontos, um modelo gráfico simples é equivalente ao modelo completo. É possível mostrar que inferência probabilística exata neste modelo simples tem complexidade polinomial para qualquer dimensionalidade do Espaço Euclidiano em consideração. Experimentos computacionais comparando esta técnica com a bem conhecida baseada em relaxamento probabilístico evidenciam uma melhora significativa de desempenho para casamento inexato de padrões de pontos. A abordagem proposta é signi- ficativamente mais robusta diante do aumento do tamanho dos padrões envolvidos. Na ausência de ruído, os resultados são sempre perfeitos. / Point pattern matching in Euclidean Spaces is one of the fundamental problems in Pattern Recognition, having applications ranging from Computer Vision to Computational Chemistry. Whenever two complex patterns are encoded by two sets of points identifying their key features, their comparison can be seen as a point pattern matching problem. This work proposes a single approach to both exact and inexact point set matching in Euclidean Spaces of arbitrary dimension. In the case of exact matching, it is assured to find an optimal solution. For inexact matching (when noise is involved), experimental results confirm the validity of the approach. We start by regarding point pattern matching as a weighted graph matching problem. We then formulate the weighted graph matching problem as one of Bayesian inference in a probabilistic graphical model. By exploiting the existence of fundamental constraints in patterns embedded in Euclidean Spaces, we prove that for exact point set matching a simple graphical model is equivalent to the full model. It is possible to show that exact probabilistic inference in this simple model has polynomial time complexity with respect to the number of elements in the patterns to be matched. This gives rise to a technique that for exact matching provably finds a global optimum in polynomial time for any dimensionality of the underlying Euclidean Space. Computational experiments comparing this technique with well-known probabilistic relaxation labeling show significant performance improvement for inexact matching. The proposed approach is significantly more robust under augmentation of the sizes of the involved patterns. In the absence of noise, the results are always perfect.