Dissertationen zum Thema „Embedding space“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Machen Sie sich mit Top-50 Dissertationen für die Forschung zum Thema "Embedding space" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Sehen Sie die Dissertationen für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.
Zhang, Xinhua, und xinhua zhang cs@gmail com. „Graphical Models: Modeling, Optimization, and Hilbert Space Embedding“. The Australian National University. ANU College of Engineering and Computer Sciences, 2010. http://thesis.anu.edu.au./public/adt-ANU20100729.072500.
Der volle Inhalt der QuelleGibert, Domingo Jaume. „Vector Space Embedding of Graphs via Statistics of Labelling Information“. Doctoral thesis, Universitat Autònoma de Barcelona, 2012. http://hdl.handle.net/10803/96240.
Der volle Inhalt der QuellePattern recognition is the task that aims at distinguishing objects among different classes. When such a task wants to be solved in an automatic way a crucial step is how to formally represent such patterns to the computer. Based on the different representational formalisms, we may distinguish between statistical and structural pattern recognition. The former describes objects as a set of measurements arranged in the form of what is called a feature vector. The latter assumes that relations between parts of the underlying objects need to be explicitly represented and thus it uses relational structures such as graphs for encoding their inherent information. Vector spaces are a very flexible mathematical structure that has allowed to come up with several efficient ways for the analysis of patterns under the form of feature vectors. Nevertheless, such a representation cannot explicitly cope with binary relations between parts of the objects and it is restricted to measure the exact same number of features for each pattern under study regardless of their complexity. Graph-based representations present the contrary situation. They can easily adapt to the inherent complexity of the patterns but introduce a problem of high computational complexity, hindering the design of efficient tools to process and analyze patterns. Solving this paradox is the main goal of this thesis. The ideal situation for solving pattern recognition problems would be to represent the patterns using relational structures such as graphs, and to be able to use the wealthy repository of data processing tools from the statistical pattern recognition domain. An elegant solution to this problem is to transform the graph domain into a vector domain where any processing algorithm can be applied. In other words, by mapping each graph to a point in a vector space we automatically get access to the rich set of algorithms from the statistical domain to be applied in the graph domain. Such methodology is called graph embedding. In this thesis we propose to associate feature vectors to graphs in a simple and very efficient way by just putting attention on the labelling information that graphs store. In particular, we count frequencies of node labels and of edges between labels. Although their locality, these features are able to robustly represent structurally global properties of graphs, when considered together in the form of a vector. We initially deal with the case of discrete attributed graphs, where features are easy to compute. The continuous case is tackled as a natural generalization of the discrete one, where rather than counting node and edge labelling instances, we count statistics of some representatives of them. We encounter how the proposed vectorial representations of graphs suffer from high dimensionality and correlation among components and we face these problems by feature selection algorithms. We also explore how the diversity of different embedding representations can be exploited in order to boost the performance of base classifiers in a multiple classifier systems framework. An extensive experimental evaluation finally shows how the methodology we propose can be efficiently computed and compete with other graph matching and embedding methodologies.
Sandvick, Joshua Sandvick. „Machine Translation Through the Creation of a Common Embedding Space“. The Ohio State University, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=osu1531420294211248.
Der volle Inhalt der QuelleBishop, Jonathan R. B. „Embedding population dynamics in mark-recapture models“. Thesis, St Andrews, 2009. http://hdl.handle.net/10023/718.
Der volle Inhalt der QuelleDube, Matthew P. „An Embedding Graph for 9-Intersection Topological Spatial Relations“. Fogler Library, University of Maine, 2009. http://www.library.umaine.edu/theses/pdf/DubeMP2009.pdf.
Der volle Inhalt der QuelleDonald, Andrew. „Embedding 3-manifolds in 4-space and link concordance via double branched covers“. Thesis, University of Glasgow, 2013. http://theses.gla.ac.uk/4425/.
Der volle Inhalt der QuelleStrickrodt, Marianne [Verfasser], und Tobias [Akademischer Betreuer] Meilinger. „The impossible puzzle : No global embedding in environmental space memory / Marianne Strickrodt ; Betreuer: Tobias Meilinger“. Tübingen : Universitätsbibliothek Tübingen, 2019. http://d-nb.info/1190639653/34.
Der volle Inhalt der QuelleStewart, Nigel Timothy, und nigels@nigels com. „An Image-Space Algorithm for Hardware-Based Rendering of Constructive Solid Geometry“. RMIT University. Aerospace, Mechanical and Manufacturing Engineering, 2008. http://adt.lib.rmit.edu.au/adt/public/adt-VIT20080721.144757.
Der volle Inhalt der QuelleBELLAVITA, CARLO. „FUNCTIONAL PROPERTIES OF P-DE BRANGES SPACES“. Doctoral thesis, Università degli Studi di Milano, 2022. http://hdl.handle.net/2434/924712.
Der volle Inhalt der QuelleSinnokrot, Mohanned Omar. „Space-time block codes with low maximum-likelihood decoding complexity“. Diss., Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/31752.
Der volle Inhalt der QuelleCommittee Chair: Barry, John; Committee Co-Chair: Madisetti, Vijay; Committee Member: Andrew, Alfred; Committee Member: Li, Ye; Committee Member: Ma, Xiaoli; Committee Member: Stuber, Gordon. Part of the SMARTech Electronic Thesis and Dissertation Collection.
Quintanar, Cortes Patricia Tanessi. „Plongements polyédriques du tore carré plat“. Thesis, Lyon, 2019. http://www.theses.fr/2019LYSE1354.
Der volle Inhalt der QuelleIn 1996 Burago and Zalgaller showed the following theorem: Theorem (Burago and Zalgaller): Let S be a polyhedral surface, then S admits an isometric PL embedding in E3. This theorem shows in particular that the Flat Square Torus admits an isometric PL embedding in E3. In 1997 Zalgaller constructs such an embedding of Flat Rectangular Torii into E3. In the first part of this work, we do show an isometric embedding du Flat Square Torus in E3. This first result is stated as follows: Theorem: There is an isometric PL embedding of the flat Square Torus with at most 48 points. We know that the minimal triangulation of the flat torus is the Moebius Torus M. The 1-skeleton of the Moebius Torus is the graph K7. We consider GE(M, T2) the set of all geodesic triangulations of T2 isomorphic to M modulo translations. In the second part of this work, we give a complete description of this set : - The configuration space GE(M, T2) is the disjoint union of 12 products of 6-simplex. We writte LT(E3) the set of lineal isometric embeddings of a triangulation T of T2 in E3, in the third part of this worg, we have the following result : - There is a 12-dimensional neighborhood N(S) of a 6-diensional set S such that for every T in E3, we have LT(E3)= Ø
Muller, Carole. „Minor-closed classes of graphs: Isometric embeddings, cut dominants and ball packings“. Doctoral thesis, Universite Libre de Bruxelles, 2021. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/331629.
Der volle Inhalt der QuelleA class of graphs is closed under taking minors if for each graph in the class and each minor of this graph, the minor is also in the class. By a famous result of Robertson and Seymour, we know that characterizing such a class can be done by identifying a finite set of minimal excluded minors, that is, graphs which do not belong to the class and are minor-minimal for this property.In this thesis, we study three problems in minor-closed classes of graphs. The first two are related to the characterization of some graph classes, while the third one studies a packing-covering relation for graphs excluding a minor.In the first problem, we study isometric embeddings of edge-weighted graphs into metric spaces. In particular, we consider ell_2- and ell_∞-spaces. Given a weighted graph, an isometric embedding maps the vertices of this graph to vectors such that for each edge of the graph the weight of the edge equals the distance between the vectors representing its ends. We say that a weight function on the edges of the graph is a realizable distance function if such an embedding exists. The minor-monotone parameter f_p(G) determines the minimum dimension k of an ell_p-space such that any realizable distance function of G is realizable in ell_p^k. We characterize graphs with large f_p(G) value in terms of unavoidable minors for p = 2 and p = ∞. Roughly speaking, a family of graphs gives unavoidable minors for a minor-monotone parameter if these graphs “explain” why the parameter is high.The second problem studies the minimal excluded minors of the class of graphs such that φ(G) is bounded by some constant k, where φ(G) is a parameter related to the cut dominant of a graph G. This unbounded polyhedron contains all points that are componentwise larger than or equal to a convex combination of incidence vectors of cuts in G. The parameter φ(G) is equal to the maximum right-hand side of a facet-defining inequality of the cut dominant of G in minimum integer form. We study minimal excluded graphs for the property φ(G) <= 4 and provide also a new bound of φ(G) in terms of the vertex cover number.The last problem has a different flavor as it studies a packing-covering relation in classes of graphs excluding a minor. Given a graph G, a ball of center v and radius r is the set of all vertices in G that are at distance at most r from v. Given a graph and a collection of balls, we can define a hypergraph H such that its vertices are the vertices of G and its edges correspond to the balls in the collection. It is well-known that, in the hypergraph H, the transversal number τ(H) is at least the packing number ν(H). We show that we can bound τ(H) from above by a linear function of ν(H) for every graphs G and ball collections H if the graph G excludes a minor, solving an open problem by Chepoi, Estellon et Vaxès.
Doctorat en Sciences
info:eu-repo/semantics/nonPublished
Larsson, Leo. „Carlson type inequalities and their applications“. Doctoral thesis, Uppsala : Univ. : Matematiska institutionen, Univ. [distributör], 2003. http://publications.uu.se/theses/91-506-1654-4/.
Der volle Inhalt der QuelleDrezga, Irislav. „A generalized ANN-based model for short-term load forecasting“. Diss., This resource online, 1996. http://scholar.lib.vt.edu/theses/available/etd-06062008-151653/.
Der volle Inhalt der QuelleBird, Gregory David. „Linear and Nonlinear Dimensionality-Reduction-Based Surrogate Models for Real-Time Design Space Exploration of Structural Responses“. BYU ScholarsArchive, 2020. https://scholarsarchive.byu.edu/etd/8653.
Der volle Inhalt der QuelleListe, Erika. „Orders of Geo-Kinetic Manifestation in Ivan Doig´s The Sea Runners“. Thesis, Stockholms universitet, Engelska institutionen, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-86913.
Der volle Inhalt der QuelleFogaça, Isis Caroline Oliveira de Sousa. „Análise da evolução temporal de dados métricos“. Universidade Federal de São Carlos, 2016. https://repositorio.ufscar.br/handle/ufscar/8661.
Der volle Inhalt der QuelleApproved for entry into archive by Ronildo Prado (ronisp@ufscar.br) on 2017-04-24T13:10:09Z (GMT) No. of bitstreams: 1 DissCOSF.pdf: 3751345 bytes, checksum: 50050f093a497de77a404a0a957ad02c (MD5)
Approved for entry into archive by Ronildo Prado (ronisp@ufscar.br) on 2017-04-24T13:10:17Z (GMT) No. of bitstreams: 1 DissCOSF.pdf: 3751345 bytes, checksum: 50050f093a497de77a404a0a957ad02c (MD5)
Made available in DSpace on 2017-04-24T13:13:58Z (GMT). No. of bitstreams: 1 DissCOSF.pdf: 3751345 bytes, checksum: 50050f093a497de77a404a0a957ad02c (MD5) Previous issue date: 2016-11-22
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
The expansion of different areas of knowledge through many types of information brought the necessity to support complex data (images, sounds, videos, strings, DNA chains, etc.), that do not have a Total Order Relationship and need other management mechanisms, like the contentbased retrieval. In general, they are represented in metric space domains, where we have only the elements and the distances between them. Through the characteristics extracted from them, we perform the similarity search. Considering the necessity to associate temporal information on these data in many applications, this work aims to analyze the temporal evolve of metric data. One alternative for this is embedding them into a multidimensional space to allow trajectories estimates. We studied different methods of embedding and analyzed how this affected the data’s distribution and, consequently, the estimates. Two new methods were purposed to estimate an element’s status on a different time from that available in database, in order to reduce the number of non-relevant elements on search results. These methods are based on radius search reduction (range) and evaluation of retrieved element’s proximity by using an approximation of reverse k- NN. We performed experiments which showed that purposed methods could improve the estimate’s result, that used to be performed only using k-NN searches.
A expansão de diferentes áreas do conhecimento com os diversos tipos de informação tornou necessário o suporte a dados complexos (imagens, sons, vídeos, cadeias de DNA, entre outros), que por não possuírem uma Relação de Ordem Total (ROT), necessitam de outros mecanismos de gerenciamento, como a recuperação por conteúdo. Em geral, esses dados são representados em domínios de espaços métricos, onde apenas se tem os elementos e as distâncias entre eles. Através das características extraídas dos mesmos, realiza-se consultas por similaridade. Considerando a necessidade de associar a informação temporal a esses dados em muitas aplicações, este trabalho visa analisar a evolução temporal dos dados métricos. Para isso, uma alternativa é mapeá-los para um espaço multidimensional, a fim possibilitar a estimativa de trajetórias. Neste trabalho, foram estudados diferentes métodos de mapeamento, sendo também analisado como o mapeamento afetou a distribuição dos mesmos e, por conseguinte, a realização das estimativas. Foram propostos dois novos métodos para estimar o estado de um elemento em um tempo diferente daqueles disponíveis na base de dados, com o objetivo de reduzir no conjunto resposta a quantidade de elementos não relevantes. Os métodos propostos são baseados na redução do raio de consulta na região estimada pela delimitação do raio de consulta (range) e a avaliação da proximidade dos elementos retornados utilizando verificação (aproximação) do k-NN reverso. Foram realizados experimentos que mostraram que os métodos propostos melhoraram o resultado final das estimativas, que anteriormente eram realizadas apenas com consultas aos vizinhos mais próximos.
Arzhantsev, I. V., D. A. Timashev und Andreas Cap@esi ac at. „Affine Embeddings of Homogeneous Spaces“. ESI preprints, 2000. ftp://ftp.esi.ac.at/pub/Preprints/esi929.ps.
Der volle Inhalt der QuelleAbdikalikova, Zamira. „Embedding theorems for spaces with multiweighted derivatives“. Licentiate thesis, Luleå tekniska universitet, Matematiska vetenskaper, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-26092.
Der volle Inhalt der QuelleGodkänd; 2007; 20071107 (ysko)
Abdikalikova, Zamira T. „Embedding theorems for spaces with multiweighted derivatives /“. Luleå : Luleå University of Technology, 2007. http://epubl.ltu.se/1402-1757/2007/53/.
Der volle Inhalt der QuelleCarroll, Douglas Edmonds. „Embedding parameterized graph classes into normed spaces“. Diss., Restricted to subscribing institutions, 2007. http://proquest.umi.com/pqdweb?did=1324389171&sid=1&Fmt=2&clientId=1564&RQT=309&VName=PQD.
Der volle Inhalt der QuelleZheng, Bentuo. „Embeddings and factorizations of Banach spaces“. [College Station, Tex. : Texas A&M University, 2007. http://hdl.handle.net/1969.1/ETD-TAMU-1551.
Der volle Inhalt der QuelleNeves, Julio Severino. „Fractional Sobolev-type spaces and embeddings“. Thesis, University of Sussex, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.341514.
Der volle Inhalt der QuelleAlgervik, Robert. „Embedding Theorems for Mixed Norm Spaces and Applications“. Doctoral thesis, Karlstads universitet, Avdelningen för matematik, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-5646.
Der volle Inhalt der QuelleAlgervik, Robert. „Embedding Theorems for Mixed Norm Spaces and Applications“. Licentiate thesis, Karlstad : Faculty of Technology and Science, Mathematics, Karlstads universitet, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-2874.
Der volle Inhalt der QuelleRilk, Albrecht Johannes. „The flicker electroretinogram in phase space embeddings and techniques /“. [S.l.] : [s.n.], 2003. http://deposit.ddb.de/cgi-bin/dokserv?idn=969749384.
Der volle Inhalt der QuellePelatt, Kristine, und Kristine Pelatt. „Geometry and Combinatorics Pertaining to the Homology of Spaces of Knots“. Thesis, University of Oregon, 2012. http://hdl.handle.net/1794/12423.
Der volle Inhalt der QuelleHume, David S. „Embeddings of infinite groups into Banach spaces“. Thesis, University of Oxford, 2013. http://ora.ox.ac.uk/objects/uuid:e38f58ec-484c-4088-bb44-1556bc647cde.
Der volle Inhalt der QuelleBuckingham, Lawrence. „K-mer based algorithms for biological sequence comparison and search“. Thesis, Queensland University of Technology, 2022. https://eprints.qut.edu.au/236377/1/Buckingham%2BThesis%281%29.pdf.
Der volle Inhalt der QuelleFearnley, David L. „Dense embeddings of #sigma#-discrete #pi#-based spaces“. Thesis, University of Oxford, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.244550.
Der volle Inhalt der QuelleClavero, Nadia F. „Optimal Sobolev Embeddings in Spaces with Mixed Norm“. Doctoral thesis, Universitat de Barcelona, 2015. http://hdl.handle.net/10803/292613.
Der volle Inhalt der QuelleThis thesis project concerns estimates, in function spaces, that relate the norm of a function and that of its derivatives. Speci.cally, our main purpose is to study the classical Sobolev-type inequalities due to Gagliardo and Nirenberg for higher order derivatives and more general spaces. In particular, we concentrate on seeking the optimal domains and the optimal ranges for these embeddings between rearrangement-invariant spaces (r.i.) and mixed norm spaces.
Carpenter, Timothy E. „Algorithms For Low-Distortion Embeddings Into Geometrically Restricted Spaces“. The Ohio State University, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1555337435997622.
Der volle Inhalt der QuelleKilbane, James. „Finite metric subsets of Banach spaces“. Thesis, University of Cambridge, 2019. https://www.repository.cam.ac.uk/handle/1810/288272.
Der volle Inhalt der QuelleDesai, Palash. „Embeddings of a cray T3D supercomputer onto a free-space optical backplane“. Thesis, McGill University, 1995. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=23743.
Der volle Inhalt der QuelleThe objectives of this thesis are three fold. First, we motivate the study of optical backplanes by demonstrating that the interconnection network of a Cray T3D Supercomputer can be embedded onto the optical backplane. In particular, we demonstrate that the 3D mesh interconnect of the Cray T3D can be embedded into the "Dual Stream Linear HyperPlane" (9). Secondly, having established a motivation we then provide a detailed review of the functional specifications of an optical backplane. In particular, we provide a detailed review of the June 1995 backplane design (31). Thirdly, having established a motivation and a detailed design we then develop a executable software model of the June 1995 backplane using the VHDL hardware description language. The VHDL model is used to establish the functional correctness of the design. In addition, the VHDL model is used to develop a real-time simulator for the photonic backplane using 4013 Field Programmable Gate Arrays (FPGAs). The real time simulator can operate at a 4 MHz clock rate and can be used to test other electronic components such as the Message-Processors at realistic clock rates. (Abstract shortened by UMI.)
Samuel, Javed K. K. „Lower bounds for embedding the Earth Mover Distance metric into normed spaces“. Thesis, Massachusetts Institute of Technology, 2005. http://hdl.handle.net/1721.1/33346.
Der volle Inhalt der QuelleIncludes bibliographical references (p. 71-73).
This thesis presents a lower bounds for embedding the Earth Mover Distance (EMID) metric into normed spaces. The EMID is a metric over two distributions where one is a mass of earth spread out in space and the other is a collection of holes in that same space. The EMD between these two distributions is defined as the least amount of work needed to fill the holes with earth. The EMD metric is used in a number of applications, for example in similarity searching and for image retrieval. We present a simple construction of point sets in the ENID metric space over two dimensions that cannot be embedded from the ED metric exactly into normed spaces, namely l1 and the square of l2. An embedding is a mapping f : X --> V with X a set of points in a metric space and ' Va set of points in some normed vector space. When the Manhattan distance is used as the underlying metric for the EMD, it can be shown that this example is isometric to K2,4 which has distortion equal to 1.25 when it is embedded into I and( 1.1180 when embedded into the square of 12. Other constructions of points sets in the EMID metric space over three and higher dimensisions are also discussed..
by Javed K.K. Samuel.
M.Eng.
Sidiropoulos, Anastasios. „Approximation algorithms for low-distortion embeddings into low-dimensional spaces“. Thesis, Massachusetts Institute of Technology, 2005. http://hdl.handle.net/1721.1/34126.
Der volle Inhalt der QuelleIncludes bibliographical references (p. 33-35).
We present several approximation algorithms for the problem of embedding metric spaces into a line, and into the two-dimensional plane. We give an O([square root] n)-approximation algorithm for the problem of finding a line embedding of a metric induced by a given unweighted graph, that minimizes the (standard) multiplicative distortion. For the same problem, we give an exact algorithm, with running-time exponential in the distortion. We complement these results by showing that the problem is NP-hard to [alpha]-approximate, for some constant [alpha] > 1. For the two-dimensional case, we show a O([square root] n) upper bound for the distortion required to embed an n-point subset of the two-dimensional sphere, into the plane. We prove that this bound is asymptotically tight, by exhibiting n-point subsets such that any embedding into the plane has distortion [omega]([square root] n). These techniques yield a O(1)-approximation algorithm for the problem of embedding an n-point subset of the sphere into the plane.
by Anastasios Sidiropoulos.
S.M.
Prang, Mathieu. „Representation learning for symbolic music“. Electronic Thesis or Diss., Sorbonne université, 2021. http://www.theses.fr/2021SORUS489.
Der volle Inhalt der QuelleA key part in the recent success of deep language processing models lies in the ability to learn efficient word embeddings. These methods provide structured spaces of reduced dimensionality with interesting metric relationship properties. These, in turn, can be used as efficient input representations for handling more complex tasks. In this thesis, we focus on the task of learning embedding spaces for polyphonic music in the symbolic domain. To do so, we explore two different approaches.We introduce an embedding model based on a convolutional network with a novel type of self-modulated hierarchical attention, which is computed at each layer to obtain a hierarchical vision of musical information.Then, we propose another system based on VAEs, a type of auto-encoder that constrains the data distribution of the latent space to be close to a prior distribution. As polyphonic music information is very complex, the design of input representation is a crucial process. Hence, we introduce a novel representation of symbolic music data, which transforms a polyphonic score into a continuous signal.Finally, we show the potential of the resulting embedding spaces through the development of several creative applications used to enhance musical knowledge and expression, through tasks such as melodies modification or composer identification
Boavida, de Brito Pedro. „Homotopy sheaves on manifolds and applications to spaces of smooth embeddings“. Thesis, University of Aberdeen, 2014. http://digitool.abdn.ac.uk:80/webclient/DeliveryManager?pid=215123.
Der volle Inhalt der QuelleShaker, Jomaa K. M. A. „Algebraic computing in general relativity and supergravity : space-time embeddings and higher dimensional theories“. Thesis, Imperial College London, 1985. http://hdl.handle.net/10044/1/37849.
Der volle Inhalt der QuelleSanomiya, Thais Akemi Tokubo. „Sobre o teorema de Campbell-Magaard e o problema de Cauchy na relatividade“. Universidade Federal da Paraíba, 2016. http://tede.biblioteca.ufpb.br:8080/handle/tede/9542.
Der volle Inhalt der QuelleMade available in DSpace on 2017-09-18T11:49:17Z (GMT). No. of bitstreams: 1 arquivototal.pdf: 2571485 bytes, checksum: 176b4eb5f639864aaef387d41330b286 (MD5) Previous issue date: 2016-03-11
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES
After the formulation of general relativity differential geometry has become an increasing important tool in theoretical physics. This is even more clear in the investigation of the so-called embedding space-time theories. In this work we focus our attention in the Cauchy problem. These have played a crucial role in our understanding of the mathematical structure of general relativity and embedding theories. We investigate the similarities and differences between the two approaches. We also study an extension of the Campbell-Magaard theorem and give two examples of both formalisms.
A geometria diferencial passou a ser uma ferramenta fundamental na fisica com o surgimento da relatividade geral. Em particular, destacamos sua importância na investigado das chamadas teorias de imersdo do espaco-tempo. Neste trabalho analisamos dois grandes formalismos fundamentados de forma direta ou indireta na teoria de imersões: o teorema de Campbell-Magaard e o problema de Cauchy para a relatividade geral. Tendo como principal objetivo tracar um paralelo entre esses dois formalismos, estudamos, nesta dissertacdo, o problema de valor inicial (pvi) para a relatividade geral mostrando que alem de admitir a formulae-do de pvi, a mesma é bem posta. Ademais, aplicamos este formalismo para o caso de uma metrica do tipo Friedmann-Robertson-Walker em (3+1). Estudamos tambem o teorema de Campbell-Magaard e sua extensdo para o espaco-tempo de Einstein e aplicamos este teorema para uma metrica do tipo de Sitter em (2+1).
Voigtlaender, Felix Verfasser], Hartmut [Akademischer Betreuer] Führ, Hans G. [Akademischer Betreuer] [Feichtinger und Holger [Akademischer Betreuer] Rauhut. „Embedding theorems for decomposition spaces with applications to wavelet coorbit spaces / Felix Voigtlaender ; Hartmut Führ, Hans G. Feichtinger, Holger Rauhut“. Aachen : Universitätsbibliothek der RWTH Aachen, 2016. http://d-nb.info/112733719X/34.
Der volle Inhalt der QuelleVoigtlaender, Felix [Verfasser], Hartmut Akademischer Betreuer] Führ, Hans G. [Akademischer Betreuer] [Feichtinger und Holger [Akademischer Betreuer] Rauhut. „Embedding theorems for decomposition spaces with applications to wavelet coorbit spaces / Felix Voigtlaender ; Hartmut Führ, Hans G. Feichtinger, Holger Rauhut“. Aachen : Universitätsbibliothek der RWTH Aachen, 2016. http://d-nb.info/112733719X/34.
Der volle Inhalt der QuelleChoudhary, Rishabh R. „Construction and Visualization of Semantic Spaces for Domain-Specific Text Corpora“. University of Cincinnati / OhioLINK, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1627666092811419.
Der volle Inhalt der QuelleAbdikalikova, Zamira. „Some new results concerning boundedness and compactness for embeddings between spaces with multiweighted derivatives“. Doctoral thesis, Luleå, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-25800.
Der volle Inhalt der QuelleGodkänd; 2009; 20090429 (zamira); DISPUTATION Ämnesområde: Matematik/Mathematics Opponent: Professor Victor Burenkov, Cardiff University, United Kingdom Ordförande: Professor Lars-Erik Persson, Luleå tekniska universitet Tid: Fredag den 12 juni 2009, kl 10.00 Plats: D 2214, Luleå tekniska universitet
Abdikalikova, Zamira T. „Some new results concerning boundedness and compactness for embeddings between spaces with multiweighted derivates /“. Luleå : Department of Mathematics, Luleå University of Technology, 2009. http://pure.ltu.se/ws/fbspretrieve/2745822.
Der volle Inhalt der QuelleMelo, Givanildo Donizeti de [UNESP]. „Sobre a dimensão do quadrado de um espaço métrico compacto X de dimensão n e o conjunto dos mergulhos de X em R2n“. Universidade Estadual Paulista (UNESP), 2016. http://hdl.handle.net/11449/138318.
Der volle Inhalt der QuelleApproved for entry into archive by Felipe Augusto Arakaki (arakaki@reitoria.unesp.br) on 2016-05-13T16:57:01Z (GMT) No. of bitstreams: 1 melo_gd_me_sjrp.pdf: 1055550 bytes, checksum: 47636418da76c9ad7d114b45ea3e96c1 (MD5)
Made available in DSpace on 2016-05-13T16:57:01Z (GMT). No. of bitstreams: 1 melo_gd_me_sjrp.pdf: 1055550 bytes, checksum: 47636418da76c9ad7d114b45ea3e96c1 (MD5) Previous issue date: 2016-03-23
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Neste trabalho nós estudamos o seguinte resultado: para um espaço métrico compacto X, de dimensão n, o subespaço dos mergulhos de X em R2n é denso no espaço das funções contínuas de X em R2n se, e somente se, dim(X x X)<2n. A demonstração apresentada é aquela dada por J. Krasinkiewicz e por S. Spiez.
In this work we study the following result: given a compact metric space X of dimension n, the subspace consisting of all embeddings of X into R2n is dense in the space of all continuous maps of X into R2n if and only if dim(X x X)<2n. The presented proof is the one given by J. Krasinkiewicz e por S. Spiez.
James, Morrison-Knight. „Experiences of Immigrant Entrepreneurs in the Falafel Trade in Malmö“. Thesis, Malmö universitet, Fakulteten för kultur och samhälle (KS), 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-23641.
Der volle Inhalt der QuelleCouairon, Guillaume. „Text-Based Semantic Image Editing“. Electronic Thesis or Diss., Sorbonne université, 2023. http://www.theses.fr/2023SORUS248.
Der volle Inhalt der QuelleThe aim of this thesis is to propose algorithms for the task of Text-based Image Editing (TIE), which consists in editing digital images according to an instruction formulated in natural language. For instance, given an image of a dog, and the query "Change the dog into a cat", we want to produce a novel image where the dog has been replaced by a cat, keeping all other image aspects unchanged (animal color and pose, background). The north-star goal is to enable anyone to edit their images using only queries in natural language. One specificity of text-based image editing is that there is practically no training data to train a supervised algorithm. In this thesis, we propose different solutions for editing images, based on the adaptation of large multimodal models trained on huge datasets. We first study a simplified editing setup, named Retrieval-based image edit- ing, which does not require to directly modify the input image. Instead, given the image and modification query, we search in a large database an image that corresponds to the requested edit. We leverage multimodal image/text alignment models trained on web-scale datasets (like CLIP) to perform such transformations without any examples. We also propose the SIMAT framework for evaluating retrieval-based image editing. We then study how to directly modify the input image. We propose FlexIT, a method which iteratively changes the input image until it satisfies an abstract "editing objective" defined in a multimodal embedding space. We introduce a variety of regularization terms to enforce realistic transformations. Next, we focus on diffusion models, which are powerful generative models able to synthetize novel images conditioned on a wide variety of textual prompts. We demonstrate their versatility by proposing DiffEdit, an algorithm which adapts diffusion models for image editing without finetuning. We propose a zero-shot strategy for finding automatically where the initial image should be changed to satisfy the text transformation query. Finally, we study a specific challenge useful in the context of image editing: how to synthetize a novel image by giving as constraint a spatial layout of objects with textual descriptions, a task which is known as Semantic Image Synthesis. We adopt the same strategy, consisting in adapting diffusion models to solve the task without any example. We propose the ZestGuide algorithm, which leverages the spatio-semantic information encoded in the attention layers of diffusion models
Batson, Scott Christopher. „On the Relationship Between Two Embeddings of Ideals into Geometric Space and the Shortest Vector Problem in Principal Ideal Lattices“. Thesis, North Carolina State University, 2015. http://pqdtopen.proquest.com/#viewpdf?dispub=3710729.
Der volle Inhalt der QuelleAn ideal lattice is the geometric embedding of an ideal in the algebraic integer ring of some number field. Many recent developments in lattice-based cryptography are centered around the use of ideal lattices. The shortest vector problem (SVP) is the most important hard lattice problem. Few algorithms that find a short vector in ideal lattices exploit their additional algebraic structure, and whether or not the SVP can be solved algebraically in ideal lattices remains unknown. We study the relationship between the canonical and coefficient embeddings of ideals in algebraic integer rings of cyclotomic number fields. We examine the algebraic structure of principal ideal lattices under the coefficient embedding by considering them as principal ideals of a cyclotomic quotient ring. Finally, empirical evidence is provided to exhibit a relationship between the algebraic structure of a principal ideal in this quotient ring and the geometric structure of its corresponding ideal lattice. These results demonstrate progress towards solving the SVP in ideal lattices algebraically.
Duquenne, Paul-Ambroise. „Sentence Embeddings for Massively Multilingual Speech and Text Processing“. Electronic Thesis or Diss., Sorbonne université, 2024. http://www.theses.fr/2024SORUS039.
Der volle Inhalt der QuelleRepresentation learning of sentences has been widely studied in NLP. While many works have explored different pre-training objectives to create contextual representations from sentences, several others have focused on learning sentence embeddings for multiple languages with the aim of closely encoding paraphrases and translations in the sentence embedding space.In this thesis, we first study how to extend text sentence embedding spaces to the speech modality in order to build a multilingual speech/text sentence embedding space. Next, we explore how to use this multilingual and multimodal sentence embedding space for large-scale speech mining. This allows us to automatically create alignments between written and spoken sentences in different languages. For high similarity thresholds in the latent space, aligned sentences can be considered as translations. If the alignments involve written sentences on one side and spoken sentences on the other, then these are potential speech-to-text translations. If the alignments involve on both sides spoken sentences, then these are potential speech-to-speech translations. To validate the quality of the mined data, we train speech-to-text translation models and speech-to-speech translation models. We show that adding the automatically mined data significantly improves the quality of the learned translation models, demonstrating the quality of the alignments and the usefulness of the mined data.Then, we study how to decode these sentence embeddings into text or speech in different languages. We explore several methods for training decoders and analyze their robustness to modalities/languages not seen during training, to evaluate cross-lingual and cross-modal transfers. We demonstrate that we could perform zero-shot cross-modal translation in this framework, achieving translation results close to systems learned in a supervised manner with a cross-attention mechanism. The compatibility between speech/text representations from different languages enables these very good performances, despite an intermediate fixed-size representation.Finally, we develop a new state-of-the-art massively multilingual speech/text sentence embedding space, named SONAR, based on conclusions drawn from the first two projects. We study different objective functions to learn such a space and we analyze their impact on the organization of the space as well as on the capabilities to decode these representations. We show that such sentence embedding space outperform previous state-of-the-art methods for both cross-lingual and cross-modal similarity search as well as decoding capabilities. This new space covers 200 written languages and 37 spoken languages. It also offers text translation results close to the NLLB system on which it is based, and speech translation results competitive with the Whisper supervised system. We also present SONAR EXPRESSIVE, which introduces an additional representation encoding non-semantic speech properties, such as vocal style or expressivity of speech