CoordenaÃÃo de AperfeiÃoamento de Pessoal de NÃvel Superior / Apresentamos um mÃtodo para a obtenÃÃo de limites inferiores para o primeiro autovalor de Dirichlet em termos de campos vetoriais com divergÃncia positiva. Aplicando-o ao gradiente de uma funÃÃo distante, obtemos estimativas de de autovalor em bolas geodÃsicas em cut locus e dos domÃnios de subvariedades com curvatura mÃdia localmente limitada.Para subvariedades das variedade de Hadamard com limites mÃdios de curvaturas, estes limites inferiores dependem da dimensÃo das subvariedades e limite sobre sua curvatura mÃdia. / We present a method to obtain lower bounds for first Dirichlet eigenvalue in terms of vector fields with positive divergence. Applying this to the gradient of a distance function we obtain estimates of eigenvalue of geodesic balls inside the cut locus and of domains in submanifolds with locally bounded mean curvature. For submanifolds of Hadamard manifolds with bounded mean curvature these lower bounds depend only on the dimension of the submanifold and the bound on its mean curvature.

Neste trabalho estudamos questões relativas a existência, unicidade, dependência contínua, continuidade, taxas de decaimento e comportamento assintótico de soluções para uma classe de equações de placas lineares e não lineares. No primeiro capítulo revisamos alguns conteúdos e colecionamos uma série de resultados provenientes da teoria geral de análise funcional, semigrupos lineares e atratores, os quais serão aplicados ao longo desta tese. Nos dois próximos capítulos abordamos uma equação da placa de quarta ordem dissipativa com perturbações não lineares do tipo p- Laplaciano e localmente Lipschitz e com memória. No segundo capítulo provamos a estabilidade exponencial de energia correspondente ao problema homogêneo com memória de segunda ordem. Em seguida, no terceiro capítulo estabelecemos resultados que comprovam a existência de um atrator global com dimensão fractal finita para o sistema dinâmico associado ao problema com história de deslocamento relativo que equivale ao problema original. Finalmente, no quarto capítulo tratamos um modelo viscoelástico de placas de Mindlin-Timoshenko de segunda ordem. Nesta ocasião, consideramos essecialmente dois casos, o primeiro quando o sistema é totalmente dissipativo e, em seguida, quando o sistema é parcialmente dissipativo. No primeiro caso, determinamos que o semigrupo linear associado ao problema é analítico e, como consequência, é exponencialmente estável. No segundo caso, mostramos que o semigrupo perde decaimento exponencial e analiticidade, no entanto, provamos que as soluções possuem decaimento do tipo polinomial / In this work we study some questions concerning with existence, uniqueness, continuous dependence, continuity, rates of decay and asymptotic behavior of solutions for a class of linear and nonlinear plate equations. In the first chapter we review some concepts and collect a series of results provided from general theory of functional analysis, linear semigroups and attractors which will be applied throughout this thesis. In the next two chapters we discuss a damped plate equation of fourth order with nonlinear perturbations of the lower order of p-Laplacian type and locally Lipschitz, and a memory term. In the second chapter we prove the exponential stability of energy corresponding to the homogeneous problem with memory of second order. Then in the third chapter we establish some results that allow us to prove the existence of a global attractor with finite fractal dimension for dynamical system associated to the problem with relative displacement history which is equivalent to the original problem. Finally, in the fourth chapter we deal with a viscoelastic Mindlin-Timoshenko plate model of second order. At this moment we consider essentially two cases. The first one when the system is fully damped, then when the system is partially damped. In the first case we show that the semigroup associated to the Mindlin-Timoskenko system is analytic, which in particular implies exponential decay. In the second case we show that such semigroup loses exponential decay, also loses analyticity. However, we prove in this last case that the solutions have decay of polynomial type

Let (E,h) be a holomorphic, Hermitian vector bundle over a polarized manifold. We provide a canonical quantisation of the Laplacian operator acting on sections of the bundle of Hermitian endomorphisms of E. If E is simple we obtain an approximation of the eigenvalues and eigenspaces of the Laplacian. In the case when the bundle E is the trivial line bundle, we quantise solutions to the heat equation on the manifold. Furthermore we show that geometric quantisation can be seen as the differential of a natural map between two Riemannian manifolds. Motivated by this fact we compute its next order approximation, namely its Hessian. / Option Mathématique du Doctorat en Sciences / info:eu-repo/semantics/nonPublished

Dans cette thèse, nous étudions les propriétés spectrales du Laplacien avec la condition de bord de Robin attractive sur des domaines du plan à coins. Notre but est de comprendre l’influence des coins convexes sur l’asymptotique des valeurs propres de cet opérateur lorsque le paramètre de Robin est grand. Nous montrons en particulier que l’asymptotique des premières valeurs propres de Robin sur des polygones curvilignes est déterminée par des opérateurs modèles : les Laplaciens agissant sur les secteurs tangents au domaine. Pour une certaine classe de polygones droits, nous montrons l’existence d’un opérateur effectif sur le bord du domaine qui détermine l’asymptotique des valeurs propres suivantes. Enfin, des asymptotiques de Weyl pour différents seuils dépendant du paramètre de Robin sont obtenues. / In this thesis, we are interested in the spectral properties of the Laplacian with the attractive Robin boundary condition on planar domains with corners. The aim is to understand the influence of the convex corners on the spectral properties of this operator when the Robin parameter is large. In particular, we show that the asymptotics of the first Robin eigenvalues on curvilinear polygons is determined by model operators: the Robin Laplacians acting on infinite sectors. For a particular class of polygons with straight edges, we prove the existence of an effective operator acting on the boundary of the domain and determining the asymptotics of the further eigenvalues. Finally, some Weyl-type asymptotics for different thresholds depending on the Robin parameter are obtained.

This thesis studies effective resistances of finite and infinite weighted graphs. Classical results state that it is a metric on the set of vertices of the graph and that it can be expressed completely in terms of the graph’s random walk. The first goal of this thesis is to provide a concise and accessible starting point for new scholars interested in the topic. In that spirit, we reproduce existing results and review different approaches to effective resistances using tools from several fields such as linear algebra, probability theory, geometry and functional analysis. The second goal is to characterize which metric spaces are given by the effective resistance of a graph. For the finite case, we begin by reconstructing the associated graph from the effective resistance. This leads to a complete algebraic characterization in terms of triangle inequality defects. A more geometric condition is given by showing that a metric space can only be an effective resistance if its minimal graph realization contains no incomplete cycles. We also show that our algebraic characterization can be applied to the more general theory of resistance forms as defined by Kigami. The third goal of this thesis is to investigate probabilistic representations of effective resistances. Building on the work of Tetali and Barlow, we characterize under which conditions known representations for finite graphs can be extended to infinite graphs.

L’opérateur du p-Laplacien non local, l’équation d’évolution et la régularisation variationnelle associées régies par un noyau donné ont des applications dans divers domaines de la science et de l’ingénierie. En particulier, ils sont devenus des outils modernes pour le traitement massif des données (y compris les signaux, les images, la géométrie) et dans les tâches d’apprentissage automatique telles que la classification. En pratique, cependant, ces modèles sont implémentés sous forme discrète (en espace et en temps, ou en espace pour la régularisation variationnelle) comme approximation numérique d’un problème continu, où le noyau est remplacé par la matrice d’adjacence d’un graphe. Pourtant, peu de résultats sur la consistence de ces discrétisations sont disponibles. En particulier, il est largement ouvert de déterminer quand les solutions de l’équation d’évolution ou du problème variationnel des tâches basées sur des graphes convergent (dans un sens approprié) à mesure que le nombre de sommets augmente, vers un objet bien défini dans le domaine continu, et si oui, à quelle vitesse. Dans ce manuscrit, nous posons les bases pour aborder ces questions.En combinant des outils de la théorie des graphes, de l’analyse convexe, de la théorie des semi- groupes non linéaires et des équations d’évolution, nous interprétons rigoureusement la limite continue du problème d’évolution et du problème variationnel du p-Laplacien discrets sur graphes. Plus précisé- ment, nous considérons une suite de graphes (déterministes) convergeant vers un objet connu sous le nom de graphon. Si les problèmes d’évolution et variationnel associés au p-Laplacien continu non local sont discrétisés de manière appropriée sur cette suite de graphes, nous montrons que la suite des solutions des problèmes discrets converge vers la solution du problème continu régi par le graphon, lorsque le nombre de sommets tend vers l’infini. Ce faisant, nous fournissons des bornes d’erreur/consistance.Cela permet à son tour d’établir les taux de convergence pour différents modèles de graphes. En parti- culier, nous mettons en exergue le rôle de la géométrie/régularité des graphons. Pour les séquences de graphes aléatoires, en utilisant des inégalités de déviation (concentration), nous fournissons des taux de convergence nonasymptotiques en probabilité et présentons les différents régimes en fonction de p, de la régularité du graphon et des données initiales. / The non-local p-Laplacian operator, the associated evolution equation and variational regularization, governed by a given kernel, have applications in various areas of science and engineering. In particular, they are modern tools for massive data processing (including signals, images, geometry), and machine learning tasks such as classification. In practice, however, these models are implemented in discrete form (in space and time, or in space for variational regularization) as a numerical approximation to a continuous problem, where the kernel is replaced by an adjacency matrix of a graph. Yet, few results on the consistency of these discretization are available. In particular it is largely open to determine when do the solutions of either the evolution equation or the variational problem of graph-based tasks converge (in an appropriate sense), as the number of vertices increases, to a well-defined object in the continuum setting, and if yes, at which rate. In this manuscript, we lay the foundations to address these questions.Combining tools from graph theory, convex analysis, nonlinear semigroup theory and evolution equa- tions, we give a rigorous interpretation to the continuous limit of the discrete nonlocal p-Laplacian evolution and variational problems on graphs. More specifically, we consider a sequence of (determin- istic) graphs converging to a so-called limit object known as the graphon. If the continuous p-Laplacian evolution and variational problems are properly discretized on this graph sequence, we prove that the solutions of the sequence of discrete problems converge to the solution of the continuous problem governed by the graphon, as the number of graph vertices grows to infinity. Along the way, we provide a consistency/error bounds. In turn, this allows to establish the convergence rates for different graph models. In particular, we highlight the role of the graphon geometry/regularity. For random graph se- quences, using sharp deviation inequalities, we deliver nonasymptotic convergence rates in probability and exhibit the different regimes depending on p, the regularity of the graphon and the initial data.

Trees that have greatest maximum p-Laplacian eigenvalue among all trees with a given degree sequence are characterized. It is shown that such extremal trees can be obtained by breadth-first search where the vertex degrees are non-increasing. These trees are uniquely determined up to isomorphism. Moreover, their structure does not depend on p.

The topic of this thesis is the convex hull property for systems of partial differential equations, which is a natural generalisation of the maximum principle for scalar equations. The main result of this thesis is a theorem asserting the convex hull property for the solutions of a certain class of parabolic systems of nonlinear partial differential equations. It also investigates the coefficients of linear systems. The respective results are sharp which is demonstrated by counterexamples to the convex hull property for solutions of linear elliptic and parabolic systems. The general theme is that the coupling of the system is what breaks the convex hull property, not necessarily the non-linearity.

Video thumbnails are essential to represent the content and summary of a video. This thesis proposed a thumbnail extraction approach for fashion videos based on the presence of clothing items, sharpness, and contrast. Furthermore, this thesis investigated how the proposed thumbnail selection method performed concerning user engagement. Other research has been done on user engagement; however, the impact of clothing item presence has yet to be investigated. Firstly, a YOLOv7 model was trained on a fashion dataset to identify clothing items. The proposed selection method used the model to extract labels to determine what frames contain the maximum number of clothing items. The selected frames were filtered based on a contrast threshold, and the sharpest frame was kept as the proposed thumbnail from the remaining frames. The contrast was measured by calculating the standard deviation of the pixels in each frame. The sharpness was measured with the Laplacian operator. The user engagement was investigated by surveying 119 participants on thumbnail preference. The participants were presented with three frames, the thumbnail extracted with the proposed method, and two control frames: the middle frame of the video and a frame where the YOLOv7 model had only identified one object. The results show that the proposed thumbnail selection method performs well, receiving 59.75% of the total votes, compared to a middle frame and a single-item frame that received 17.46% and 22.79% of the votes, respectively. The results indicate that the proposed parameters for the thumbnail extraction could lead to higher user engagement. / Video-miniatyrbilder är en essentiell del av att presentera och sammanfatta videoinnehåll. Den här uppsatsen föreslår en miniatyrbilds extraktionsmetod för modevideos baserat på klädesplagg, skärpa och kontrast. Denna uppsats utvärderade hur den föreslagna metoden presterar i relation till användarengagemang. Tidigare forskning har utvärderat användarengagemang på miniatyrbilder, dock inte kopplat till närvaro av klädesplagg. Först tränades en YOLOv7 modell på ett modedataset för att identifiera klädesplagg. Den föreslagna metoden använde modellen för att extrahera etiketter för att fastställa vilka bilder som inkluderade flest klädesplagg. De utvalda bilderna filtrerades med en kontrast-tröskel, och den skarpaste bilden av de resterande bilderna behölls som en föreslagen miniatyrbild. Kontrasten mättes med standardavvikelsen mellan pixlar i varje bild. Skärpan mättes med Laplaceoperatorn. Användarengagemanget undersöktes med en enkät genomförd av 119 deltagare för att identifiera vilken miniatyrbild som föredrogs. Deltagarna blev presenterade med tre bilder, en extraherad med den föreslagna metoden och två kontrollbilder: mittenbilden från videon och en bild där YOLOv7 modellen endast identifierat ett objekt. Resultaten visar att den föreslagna metoden presterar bra, den fick 59,75% av rösterna, jämfört med mittenbilden och bilden med ett objekt, som fick respektive 17.46% och 22.79%. Resultaten indikerar att den föreslagna parametrarna kan bidra till ökat användarengagamang i modefilmer.

The aim of this project is to design an algorithm that identifies the Area of Interest (AOI) in ELISpot and FluoroSpot images. ELISpot and FluoroSpot are two varieties of a biochemical test used to analyze immune responses by quantifying the amount of cytokine secreted by cells. ELISpot and FluoroSpot images show a well that contains the cytokinesecreting cells which appear as scattered spots. Prior to counting the number of spots, it is required to detect the area in which to count the spots, i.e. the area delimited by the contour of the well. We propose to use the Circle Hough Transform together with filtering and the Laplacian of Gaussian edge detector in order to accurately detect such area. Furthermore we develop an outlier removal method that contributes to increase the robustness of the proposed detection method. Finally we compare our algorithm with another algorithm already in use. A Swedish biotech company called Mabtech has implemented an AOI identifier in the same field. Our proposed algorithm proves to be more robust and provides consistent results for all the images in the dataset.