Relevant bibliographies by topics / Embedding types

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Embedding types'

Author: Grafiati
Published: 4 June 2021
Last updated: 13 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Embedding types.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Embedding types"

1

Cárdenas, M., T. Fernández, F. F. Lasheras, and A. Quintero. "Embedding proper homotopy types." Colloquium Mathematicum 95, no. 1 (2003): 1–20. http://dx.doi.org/10.4064/cm95-1-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Wang, Peng, Jing Zhou, Yuzhang Liu, and Xingchen Zhou. "TransET: Knowledge Graph Embedding with Entity Types." Electronics 10, no. 12 (June 11, 2021): 1407. http://dx.doi.org/10.3390/electronics10121407.

Full text
Abstract:
Knowledge graph embedding aims to embed entities and relations into low-dimensional vector spaces. Most existing methods only focus on triple facts in knowledge graphs. In addition, models based on translation or distance measurement cannot fully represent complex relations. As well-constructed prior knowledge, entity types can be employed to learn the representations of entities and relations. In this paper, we propose a novel knowledge graph embedding model named TransET, which takes advantage of entity types to learn more semantic features. More specifically, circle convolution based on the embeddings of entity and entity types is utilized to map head entity and tail entity to type-specific representations, then translation-based score function is used to learn the presentation triples. We evaluated our model on real-world datasets with two benchmark tasks of link prediction and triple classification. Experimental results demonstrate that it outperforms state-of-the-art models in most cases.
APA, Harvard, Vancouver, ISO, and other styles
3

Hebda, James J. "The possible cohomology of certain types of taut submanifolds." Nagoya Mathematical Journal 111 (September 1988): 85–97. http://dx.doi.org/10.1017/s0027763000001008.

Full text
Abstract:
The first purpose of this paper is to exhibit several families of compact manifolds that do not ad nit taut embeddings into any sphere. The second is to enumerate ths possible Z2-cohomology rings of those compact manifolds which do admit a taut embedding and whose cohomology rings satisfy certain degeneracy conditions. The first purpose is easily attained once the second has been accomplished, for it is a simple matter to present families of spaces whose cohomology rings satisfy the required degeneracy conditions, but are not on the list of those admitting a taut embedding.
APA, Harvard, Vancouver, ISO, and other styles
4

Bocchi, Laura, and Romain Demangeon. "Embedding Session Types in HML." Electronic Proceedings in Theoretical Computer Science 137 (December 8, 2013): 53–62. http://dx.doi.org/10.4204/eptcs.137.5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Lindley, Sam, and J. Garrett Morris. "Embedding session types in Haskell." ACM SIGPLAN Notices 51, no. 12 (July 19, 2018): 133–45. http://dx.doi.org/10.1145/3241625.2976018.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

BOZKURT, ILKER NADI, HAI HUANG, BRUCE MAGGS, ANDRÉA RICHA, and MAVERICK WOO. "Mutual Embeddings." Journal of Interconnection Networks 15, no. 01n02 (March 2015): 1550001. http://dx.doi.org/10.1142/s0219265915500012.

Full text
Abstract:
This paper introduces a type of graph embedding called a mutual embedding. A mutual embedding between two n-node graphs [Formula: see text] and [Formula: see text] is an identification of the vertices of V1 and V2, i.e., a bijection [Formula: see text], together with an embedding of G1 into G2 and an embedding of G2 into G1 where in the embedding of G1 into G2, each node u of G1 is mapped to π(u) in G2 and in the embedding of G2 into G1 each node v of G2 is mapped to [Formula: see text] in G1. The identification of vertices in G1 and G2 constrains the two embeddings so that it is not always possible for both to exhibit small congestion and dilation, even if there are traditional one-way embeddings in both directions with small congestion and dilation. Mutual embeddings arise in the context of finding preconditioners for accelerating the convergence of iterative methods for solving systems of linear equations. We present mutual embeddings between several types of graphs such as linear arrays, cycles, trees, and meshes, prove lower bounds on mutual embeddings between several classes of graphs, and present some open problems related to optimal mutual embeddings.
APA, Harvard, Vancouver, ISO, and other styles
7

LUDWIG, LEWIS D., and PAMELA ARBISI. "LINKING IN STRAIGHT-EDGE EMBEDDINGS OF K7." Journal of Knot Theory and Its Ramifications 19, no. 11 (November 2010): 1431–47. http://dx.doi.org/10.1142/s0218216510008467.

Full text
Abstract:
In 1983 Conway and Gordon and Sachs proved that every embedding of the complete graph on six vertices, K6, is intrinsically linked. In 2004 it was shown that all straight-edge embeddings of K6 have either one or three linked triangle pairs. We expand this work to characterize the straight-edge embeddings of K7 and determine the number and types of links in every embedding which forms a convex polyhedron of seven vertices.
APA, Harvard, Vancouver, ISO, and other styles
8

Park, Chanyoung, Donghyun Kim, Jiawei Han, and Hwanjo Yu. "Unsupervised Attributed Multiplex Network Embedding." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 04 (April 3, 2020): 5371–78. http://dx.doi.org/10.1609/aaai.v34i04.5985.

Full text
Abstract:
Nodes in a multiplex network are connected by multiple types of relations. However, most existing network embedding methods assume that only a single type of relation exists between nodes. Even for those that consider the multiplexity of a network, they overlook node attributes, resort to node labels for training, and fail to model the global properties of a graph. We present a simple yet effective unsupervised network embedding method for attributed multiplex network called DMGI, inspired by Deep Graph Infomax (DGI) that maximizes the mutual information between local patches of a graph, and the global representation of the entire graph. We devise a systematic way to jointly integrate the node embeddings from multiple graphs by introducing 1) the consensus regularization framework that minimizes the disagreements among the relation-type specific node embeddings, and 2) the universal discriminator that discriminates true samples regardless of the relation types. We also show that the attention mechanism infers the importance of each relation type, and thus can be useful for filtering unnecessary relation types as a preprocessing step. Extensive experiments on various downstream tasks demonstrate that DMGI outperforms the state-of-the-art methods, even though DMGI is fully unsupervised.
APA, Harvard, Vancouver, ISO, and other styles
9

KARLSSON, FRED. "Constraints on multiple center-embedding of clauses." Journal of Linguistics 43, no. 2 (June 18, 2007): 365–92. http://dx.doi.org/10.1017/s0022226707004616.

Full text
Abstract:
A common view in theoretical syntax and computational linguistics holds that there are no grammatical restrictions on multiple center-embedding of clauses. Syntax would thus be characterized by unbounded recursion. An analysis of 119 genuine multiple clausal center-embeddings from seven ‘Standard Average European’ languages (English, Finnish, French, German, Latin, Swedish, Danish) uncovers usage-based regularities, constraints, that run counter to these and several other widely held views, such as that any type of multiple self-embedding (of the same clause type) would be possible, or that self-embedding would be more complex than multiple center-embedding of different clause types. The maximal degree of center-embedding in written language is three. In spoken language, multiple center-embedding is practically absent. Typical center-embeddings of any degree involve relative clauses specifying the referent of the subject NP of the superordinate clause. Only postmodifying clauses, especially relative clauses and that-clauses acting as noun complements, allow central self-embedding. Double relativization of objects (The rat the cat the dog chased killed ate the malt) does not occur. These corpus-based ‘soft constraints’ suggest that full-blown recursion creating multiple clausal center-embedding is not a central design feature of language in use. Multiple center-embedding emerged with the advent of written language, with Aristotle, Cicero, and Livy in the Greek and Latin stylistic tradition of ‘periodic’ sentence composition.
APA, Harvard, Vancouver, ISO, and other styles
10

Zhao, Yu, Jiayue Hou, Zongjian Yu, Yun Zhang, and Qing Li. "Confidence-Aware Embedding for Knowledge Graph Entity Typing." Complexity 2021 (April 16, 2021): 1–8. http://dx.doi.org/10.1155/2021/3473849.

Full text
Abstract:
Knowledge graphs (KGs) entity typing aims to predict the potential types to an entity, that is, (entity, entity type = ?). Recently, several embedding models are proposed for KG entity types prediction according to the existing typing information of the (entity, entity type) tuples in KGs. However, most of them unreasonably assume that all existing entity typing instances in KGs are completely correct, which ignore the nonnegligible entity type noises and may lead to potential errors for the downstream tasks. To address this problem, we propose ConfE, a novel confidence-aware embedding approach for modeling the (entity, entity type) tuples, which takes tuple confidence into consideration for learning better embeddings. Specifically, we learn the embeddings of entities and entity types in separate entity space and entity type space since they are different objects in KGs. We utilize an asymmetric matrix to specify the interaction of their embeddings and incorporate the tuple confidence as well. To make the tuple confidence more universal, we consider only the internal structural information in existing KGs. We evaluate our model on two tasks, including entity type noise detection and entity type prediction. The extensive experimental results in two public benchmark datasets (i.e., FB15kET and YAGO43kET) demonstrate that our proposed model outperforms all baselines on all tasks, which verify the effectiveness of ConfE in learning better embeddings on noisy KGs. The source code and data of this work can be obtained from https://github.com/swufenlp/ConfE.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Embedding types"

1

Genestier, Guillaume. "Dependently-Typed Termination and Embedding of Extensional Universe-Polymorphic Type Theory using Rewriting." Electronic Thesis or Diss., université Paris-Saclay, 2020. http://www.theses.fr/2020UPASG045.

Full text
Abstract:
Dedukti est un cadre logique dans lequel l’utilisateur encode la théorie qu’il souhaite utiliser à l’aide de règles de réécriture. Pour garantir la décidabilité du typage, il faut s’assurer que le système de réécriture utilisé est terminant.Après avoir rappelé les propriétés des systèmes de types purs et leur extension avec de la réécriture, un critère de terminaison pour la réécriture d’ordre supérieur avec types dépendants est présenté. Il s’agit d’une extension de la notion de paires de dépendances au cas du lambda-pi-calcul modulo réécriture. Cerésultat se décompose en deux théorèmes principaux. Le premier stipule que la bonne fondaison de la relation d’appel définie à partir des paires de dépendances implique la normalisation forte du système de réécriture.Le second résultat de cette partie décrit des conditions décidables suffisantes pour pouvoir utiliser le premier théorème. Cette version décidable du critère de terminaison est implémenté dans un outil appelé “SizeChange Tool”.La seconde partie de cette thèse est consacrée à l’utilisation du cadre logiqueDedukti pour encoder une théorie des types riche. Nous nous intéressons plusparticulièrement à la traduction d’un fragment d’Agda incluant deux fonctionnalités très répandues : l’extension de la conversion avec la règle eta et le polymorphisme d’univers.Une fois encore, ce travail possède un versant théorique, avec des encodagesprouvés corrects de ces deux fonctionnalités dans le lambda-pi-calcul modulo réécriture, ainsi qu’une implémentation prototypique de traducteur entre Agda et Dedukti
Dedukti is a logical framework in which the user encodes the theory she wantsto use via rewriting rules. To ensure the decidability of typing, the rewriting system must be terminating.After recalling some properties of pure type systems and their extension with rewriting, a termination criterion for higher-order rewriting with dependent types is presented. It is an extension of the dependency pairs to the lambda-pi-calculus modulo rewriting. This result features two main theorems. The first one states that the well-foundedness of the call relation defined from dependency pairs implies the strong normalization of the rewriting system.The second result of this part describes decidable sufficient conditions to use the first one. This decidable version of the termination criterion is implemented in “SizeChange Tool”.The second part of this thesis is dedicated to the use of the logical framework Dedukti to encode a rich type theory. We are interested in a fragment of the logic beyond Agda which includes two widely used features: extension of conversion with the eta rule and universe polymorphism.Once again, this work includes a theoretical part, with correct encodings of both features in the lambda-pi-calculus modulo rewriting, and a prototypical translator from Agda to Dedukti
APA, Harvard, Vancouver, ISO, and other styles
2

Skodlerack, Daniel. "Embedding types and canonical affine maps between Bruhat-Tits buildings of classical groups." Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2010. http://dx.doi.org/10.18452/16239.

Full text
Abstract:
P. Broussous and S. Stevens studierten für die Konstruktion einfacher Typen unitärer p-adischer Gruppen Abbildungen zwischen erweiterten Bruhat-Tits-Gebäuden, die die Moy-Prasad-Filtrierungen respektieren (CLF). Im ersten Teil der Doktorarbeit wird deren Arbeit zu solchen Abbildungen um den Quaternionenalgebrafall erweitert. Genauer, es sei k0 ein p-adischer Körper mit einer von 2 verschiedenen Restcharakteristik und beta ein eine halbeinfache k0-Algebra erzeugendes, k0-rationales Element der Lie-Algebra einer über k0 definierten unitaren Gruppe G=U(h) zu einer epsilon-hermitischen Form h. Es sei H der Zentralisator von beta in G. Es wird bewiesen, dass eine affine H(k0)-equivariante CLF-Abbildung j vom erweiterten Bruhat-Tits-Gebäude B^1(H,k0) nach B^1(G,k0) existiert. Wie von Broussous vermutet, stellt sich in der Doktorarbeit heraus, dass j durch die CLF-Eigenschaft eindeutig bestimmt wird, falls kein Faktor von H k0-isomorph zur isotropen orthogonalen Gruppe vom k0-Rank 1 ist und alle Faktoren unitäre Gruppen sind. Desweiteren wird bei abgeschwächter Äquivarianzeigenschaft bewiesen, dass j als affine und bezüglich dem Zentrum von H^0(k0) equivariante CLF-Abbildung bis auf eine Translation von B^1(H,k0) eindeutig bestimmt ist. Im zweiten Teil wird der von Broussous und M. Grabitz studierte Einbettungstyp mit Hilfe einer CLF-Abbildung entschlüsselt. Wir betrachten einen Schiefkörper von endlichem Index und p-adischem Zentrum F. Die Konstruktion einfacher Typen für GLn(D) nach der Methode von Bushnell und Kutzko bedurfte der Analyse sogenannter Strata, die eine Starrheitseingenschaft erfüllen mussten. Teil eines Stratums ist insbesondere ein Paar (E,a) bestehend aus einer Körpererweiterung E|F in Mn(D) und einer erblichen Ordnung a, welche von E^x normalisiert wird. Broussous und Grabitz klassifizierten diese Paare mit Hilfe von Invarianten. Im zweiten Teil werden diese Invarianten mit Hilfe der Geometrie einer CLF-Abbildung berechnet.
P. Broussous and S. Stevens studied maps between enlarged Bruhat-Tits buildings to construct types for p-adic unitary groups. They needed maps which respect the Moy-Prasad filtrations. That property is called (CLF), i.e. compatibility with the Lie algebra filtrations. In the first part of this thesis we generalise their results on such maps to the Quaternion-algebra case. Let k0 be a p-adic field of residue characteristic not two. We consider a semisimple k0-rational Lie algebra element beta of a unitary group G:=U(h) defined over k0 with a signed hermitian form h. Let H be the centraliser of beta in G. We prove the existence of an affine H(k0)-equivariant CLF-map j from the enlarged Bruhat-Tits building B^1(H,k0) to B^1(G,k0). As conjectured by Broussous the CLF-property determines j, if none of the factors of H is k0-isomorphic to the isotropic orthogonal group of k0-rank one and all factors are unitary groups. Under the weaker assumption that the affine CLF-map j is only equivariant under the center of H^0(k0) it is uniquely determined up to a translation of B^1(H,k0). The second part is devoted to the decoding of embedding types by the geometry of a CLF-map. Embedding types have been studied by Broussous and M. Grabitz. We consider a division algebra D of finite index with a p-adic center F. The construction of simple types for GLn(D) in the Budhnell-Kutzko framework required an investigation of strata which had to fulfil a rigidity property. Giving a stratum especially means to fix a pair (E,a) consisting of a field extension E|F in Mn(D) and a hereditary order a which is stable under conjugation by E^x, in other words we fix an embedding of E^x into the normalizer of a. Broussous and Grabitz classified these pairs with invariants. We describe and prove a way to decode these invariants using the geometry of a CLF-map.
APA, Harvard, Vancouver, ISO, and other styles
3

Skodlerack, Daniel [Verfasser], Ernst-Wilhelm [Akademischer Betreuer] Zink, Paul [Akademischer Betreuer] Broussous, and Bertrand [Akademischer Betreuer] Lemaire. "Embedding types and canonical affine maps between Bruhat-Tits buildings of classical groups / Daniel Skodlerack. Gutachter: Ernst-Wilhelm Zink ; Paul Broussous ; Bertrand Lemaire." Berlin : Humboldt Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2010. http://d-nb.info/1014974771/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Ngwobia, Sunday C. "Capturing Knowledge of Emerging Entities from the Extended Search Snippets." University of Dayton / OhioLINK, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=dayton157309507473671.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Karlsson, Mikael. "Identifying New Fault Types Using Transformer Embeddings." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-303009.

Full text
Abstract:
Continuous integration/delivery and deployment consist of many automated tests, some of which may fail leading to faulty software. Similar faults may occur in different stages of the software production lifecycle and it is necessary to identify similar faults and cluster them into fault types in order to minimize troubleshooting time. Pretrained transformer based language models have been proven to achieve state of the art results in many natural language processing tasks like measuring semantic textual similarity. This thesis aims to investigate whether it is possible to cluster and identify new fault types by using a transformer based model to create context aware vector representations of fault records, which consists of numerical data and logs with domain specific technical terms. The clusters created were compared against the clusters created by an existing system, where log files are grouped by manual specified filters. Relying on already existing fault types with associated log data, this thesis shows that it is possible to finetune a transformer based model for a classification task in order to improve the quality of text embeddings. The embeddings are clustered by using density based and hierarchical clustering algorithms with cosine distance. The results show that it is possible to cluster log data and get comparable results to the existing manual system, where the cluster similarity was assessed with V-measure and Adjusted Rand Index.
Kontinuerlig integration består automatiserade tester där det finns risk för att några misslyckas vilket kan leda till felaktig programvara. Liknande fel kan uppstå under olika faser av en programvarans livscykel och det är viktigt att identifiera och gruppera olika feltyper för att optimera felsökningsprocessen. Det har bevisats att språkmodeller baserade på transformatorarkitekturen kan uppnå höga resultat i många uppgifter inom språkteknologi, inklusive att mäta semantisk likhet mellan två texter. Detta arbete undersöker om det är möjligt att gruppera och identifiera nya feltyper genom att använda en transformatorbaserad språkmodell för att skapa numeriska vektorer av loggtext, som består av domänspecifika tekniska termer och numerisk data. Klustren jämförs mot redan existerande grupperingar som skapats av ett befintligt system där feltyper identifieras med manuellt skrivna filter. Det här arbetet visar att det går att förbättra vektorrepresenationerna skapade av en språkmodell baserad på transformatorarkitekturen genom att tilläggsträna modellen för en klassificeringsuppgift. Vektorerna grupperas med hjälp av densitetsbaserade och hierarkiska klusteralgoritmer. Resultaten visar att det är möjligt att skapa vektorer av logg-texter med hjälp av en transformatorbaserad språkmodell och få jämförbara resultat som ett befintligt manuellt system, när klustren evaluerades med V-måttet och Adjusted Rand Index.
APA, Harvard, Vancouver, ISO, and other styles
6

Neves, Julio Severino. "Fractional Sobolev-type spaces and embeddings." Thesis, University of Sussex, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.341514.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Hauser, Bruno. "Embedding proof-carrying components into Isabelle." Zurich : ETH, Swiss Federal Institute of Technology Zurich, Institute of Theoretical Computer Science, Chair of Software Engineering, 2009. http://e-collection.ethbib.ethz.ch/show?type=dipl&nr=436.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kinsley, Sam. "Duality methods for barrier-type solutions to the Skorokhod embedding problem." Thesis, University of Bath, 2018. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.761046.

Full text
Abstract:
The Skorokhod embedding problem is to find a stopping time of a Brownian motion, W, for which the stopped process has a given distribution. The Root, Rost, and cave embedding solutions to the problem can be seen as the first hitting time for (Wt,t) of regions known as barriers, inverse barriers, and cave barriers, respectively. In this thesis we present three ways of approaching the embedding problem, and apply the methods to these barrier-type solutions. Specifically, we consider infinite dimensional linear optimisation problems in both discrete and continuous time, and we also reformulate into an optimisation constrained by backwards stochastic differential equations and then solve using techniques from stochastic optimal control. For certain financial derivatives it is well known that there is an optimal Skorokhod embedding problem which corresponds to finding a model-independent upper bound on the price of the contingent claim. With this application in mind, the embedding problem has the dual problem of finding the minimal cost of a superhedging portfolio for the option. The methods developed in this thesis enable us to explore the rela- tion between the primal and dual problems, and, in the applications above, find dual optimisers. We also introduce a new barrier-type embedding, known as a K-cave em- bedding, which has the property of maximising the price of a European call option on a leveraged exchange traded fund. For the cave and K-cave embeddings the attainment of an optimal superhedging strategy is needed to find the optimal barriers. Unlike in the cases of Root and Rost, there are not unique cave, or K-cave barriers which embed a given distribution and in this way these are the first examples of embeddings which are not uniquely determined by their geometric structure.
APA, Harvard, Vancouver, ISO, and other styles
9

Ernstsson, August. "SkePU 2: Language Embedding and Compiler Support for Flexible and Type-Safe Skeleton Programming." Thesis, Linköpings universitet, Programvara och system, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-129381.

Full text
Abstract:
This thesis presents SkePU 2, the next generation of the SkePU C++ framework for programming of heterogeneous parallel systems using the skeleton programming concept. SkePU 2 is presented after a thorough study of the state of parallel programming models, frameworks and tools, including other skeleton programming systems. The advancements in SkePU 2 include a modern C++11 foundation, a native syntax for skeleton parameterization with user functions, and an entirely new source-to-source translator based on Clang compiler front-end libraries. SkePU 2 extends the functionality of SkePU 1 by embracing metaprogramming techniques and C++11 features, such as variadic templates and lambda expressions. The results are improved programmability and performance in many situations, as shown in both a usability survey and performance evaluations on high-performance computing hardware. SkePU’s skeleton programming model is also extended with a new construct, Call, unique in the sense that it does not impose any predefined skeleton structure and can encapsulate arbitrary user-defined multi-backend computations. We conclude that SkePU 2 is a promising new direction for the SkePU project, and a solid basis for future work, for example in performance optimization.
APA, Harvard, Vancouver, ISO, and other styles
10

Walter, Alexander I. "Embedding transdisciplinary research : interface requirements for joint problem solving between scientists and stakeholders /." Zürich : ETH, 2006. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=16938.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Embedding types"

1

Ledet, Arne. Brauer type embedding problems. Providence, RI: American Mathematical Society, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Brauer type embedding problems. Providence, RI: American Mathematical Society, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Hrushovski, Ehud, and François Loeser. The space of stably dominated types. Princeton University Press, 2017. http://dx.doi.org/10.23943/princeton/9780691161686.003.0003.

Full text
Abstract:
This chapter introduces the space unit vector V of stably dominated types on a definable set V. It first endows unit vector V with a canonical structure of a (strict) pro-definable set before providing some examples of stably dominated types. It then endows unit vector V with the structure of a definable topological space, and the properties of this definable topology are discussed. It also examines the canonical embedding of V in unit vector V as the set of simple points. An essential feature in the approach used in this chapter is the existence of a canonical extension for a definable function on V to unit vector V. This is considered in the next section where continuity criteria are given. The chapter concludes by describing basic notions of (generalized) paths and homotopies, along with good metrics, Zariski topology, and schematic distance.
APA, Harvard, Vancouver, ISO, and other styles
4

Neves, Júlio Severino. Fractional Sobolev-type spaces and embeddings. 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Geurts, Bart. Presupposition and Givenness. Edited by Yan Huang. Oxford University Press, 2016. http://dx.doi.org/10.1093/oxfordhb/9780199697960.013.21.

Full text
Abstract:
Presuppositions are items of information triggered by certain words and constructions that exhibit ‘projection behaviour’, which is to say that, except in special cases, they will escape from any level of embedding. Presupposed information is given, or at least presented as such, and there are two main theories of what it means for presuppositions to be given. On one account, a presupposition must be entailed in the local context in which it is triggered; on the other, presuppositions require that certain discourse entities be available in the context. On the latter account, but not on the former, anaphora is a special case of presupposition. It might be that both accounts are correct, though for different types of presupposition.
APA, Harvard, Vancouver, ISO, and other styles
6

Jäger, Agnes. On the history of the IPP construction in German. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198813545.003.0016.

Full text
Abstract:
The chapter discusses the development and syntactic analysis of IPP (infinitivus pro participio), i.e. certain perfect tense constructions in which a verb embedding an infinitive appears in the form of an infinitive itself rather than in the expected form of a past participle. This effect is indicative of verb cluster formation and typically linked to a re-ordering of verbs at the right clausal periphery. It can be observed since the MHG period spreading to more verbs over time in accordance with the typological hierarchy of IPP verbs. IPP is argued to involve true infinitives from the beginning rather than originating in homophonous ge-less participles. Recent analyses of IPP as one repair strategy among others are supported by historical and dialectal data as several types of competing constructions are evidenced. These data further show that IPP is not inherently linked to the specific word order of verbs found in MSG.
APA, Harvard, Vancouver, ISO, and other styles
7

Berry, Craig, and Scott Lavery. Towards a Political Economy of Depoliticization Strategies. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198748977.003.0011.

Full text
Abstract:
This chapter argues that the literature on depoliticization tends to overlook the structural context within which depoliticization processes take place and, in particular, the way in which depoliticization strategies are embedded within distinctively capitalist forms of social organization. Too often, analysis focuses on categorizing different ‘types’ of depoliticization processes or outcomes, while neglecting to examine how depoliticization strategies are used as a discursive tool for embedding or shoring up dominant models of economic growth. The chapter seeks to resituate depoliticization in the political economy framework developed originally by Peter Burnham, while acknowledging that Burnham’s reductionist approach to institutions has paradoxically encouraged subsequent scholars to largely ignore structural context in characterizing instances of depoliticization. The chapter offers a preliminary application of an alternative political economy approach by examining macroeconomic policymaking in the post-crisis period in the United Kingdom, focusing on the Help to Buy scheme and the Office for Budget Responsibility.
APA, Harvard, Vancouver, ISO, and other styles
8

Sequence spaces with exponent weights, realizations of Colombeau type algebras. Warszawa: Institute of Mathematics, Polish Academy of Sciences, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

M¨uhlherr, Bernhard, Holger P. Petersson, and Richard M. Weiss. Residues. Princeton University Press, 2017. http://dx.doi.org/10.23943/princeton/9780691166902.003.0010.

Full text
Abstract:
This chapter deals with the residues of a Bruhat-Tits building whose building at infinity is an exceptional quadrangle. It begins with the remark that if Λ‎ is an arbitrary quadratic space of type Eℓ for ℓ = 6, 7 or 8 or of typeF₄ over a field K that is complete with respect to a discrete valuation, and if in the F4-case the subfield F is closed with respect to this valuation and if Δ‎ is the corresponding Moufang quadrangle of type Eℓ or F₄, then there always exists a unique affine building Ξ‎ such that Δ‎ is the building at infinity of Ξ‎ with respect to its complete system of apartments. The chapter also considers the standard embedding of the apartment A in the Euclidean plane which takes the intersection of A and R to the set of eight triangles containing the origin. Finally, it describes a Moufang polygon with two root group sequences.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Embedding types"

1

Fujita, Ken-etsu. "Galois Embedding from Polymorphic Types into Existential Types." In Lecture Notes in Computer Science, 194–208. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11417170_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Altenschmidt, Christian, Joachim Biskup, Jürgen Freitag, and Barbara Sprick. "Weakly Constraining Multimedia Types Based on a Type Embedding Ordering." In Advances in Multimedia Information Systems, 121–29. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/3-540-49651-3_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Zhang, Cheng, Le Zhang, Xiaobo Guo, and Ying Qi. "Exploiting Tri-types of Information for Attributed Network Embedding." In Knowledge Science, Engineering and Management, 326–38. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-29563-9_29.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Baumgartner, Peter. "The Fusemate Logic Programming System." In Automated Deduction – CADE 28, 589–601. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-79876-5_34.

Full text
Abstract:
AbstractFusemate is a logic programming system that implements the possible model semantics for disjunctive logic programs. Its input language is centered around a weak notion of stratification with comprehension and aggregation operators on top of it. Fusemate is implemented as a shallow embedding in the Scala programming language. This enables using Scala data types natively as terms, a tight interface with external systems, and it makes model computation available as an ordinary container data structure constructor. The paper describes the above features and implementation aspects. It also demonstrates them with a non-trivial use-case, the embedding of the description logic $$\mathcal ALCIF$$ A L C I F into Fusemate’s input language.
APA, Harvard, Vancouver, ISO, and other styles
5

Jarke, Juliane. "Learning from Co-creation Practice." In Public Administration and Information Technology, 179–201. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-52873-7_8.

Full text
Abstract:
Abstract This chapter reflects on the learnings from the three co-creation projects featured in this book and attends to the central research questions posed in the introduction. In sum, the chapter presents nine learning points. These cover very different aspects of co-creation ranging from the different roles local government, social care service providers, intermediaries and older citizens may assume, to the implications of embedding co-creation processes in existing service portfolios and strategic policies. The chapter furthermore reflects on different types of co-creation methods (e.g. cultural probes, data tables, data walks) and how they allow for meaningful participation and sharing of knowledge. Ultimately the chapter considers to what extent the openness of a co-creation process impacts on the sustainability of its results and the ways in which co-creation may contribute to joint socio-technical future-making.
APA, Harvard, Vancouver, ISO, and other styles
6

Cuypers, Hans, and Jos in ’t Panhuis. "Embeddings of Cotriangular Spaces." In Groups of Exceptional Type, Coxeter Groups and Related Geometries, 135–45. New Delhi: Springer India, 2014. http://dx.doi.org/10.1007/978-81-322-1814-2_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Reverter, Ferran, Esteban Vegas, and Josep M. Oller. "Kernel Conditional Embeddings for Associating Omic Data Types." In Bioinformatics and Biomedical Engineering, 501–10. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-78723-7_43.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Chaudhuri, Kaustuv. "Subformula Linking for Intuitionistic Logic with Application to Type Theory." In Automated Deduction – CADE 28, 200–216. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-79876-5_12.

Full text
Abstract:
AbstractSubformula linking is an interactive theorem proving technique that was initially proposed for (classical) linear logic. It is based on truth and context preserving rewrites of a conjecture that are triggered by a user indicating links between subformulas, which can be done by direct manipulation, without the need of tactics or proof languages. The system guarantees that a true conjecture can always be rewritten to a known, usually trivial, theorem. In this work, we extend subformula linking to intuitionistic first-order logic with simply typed lambda-terms as the term language of this logic. We then use a well known embedding of intuitionistic type theory into this logic to demonstrate one way to extend linking to type theory.
APA, Harvard, Vancouver, ISO, and other styles
9

Kaposi, Ambrus, András Kovács, and Nicolai Kraus. "Shallow Embedding of Type Theory is Morally Correct." In Lecture Notes in Computer Science, 329–65. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-33636-3_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Rahman, Md Mostafizur, and Atsuhiro Takasu. "Knowledge Graph Embedding via Entities’ Type Mapping Matrix." In Neural Information Processing, 114–25. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-04182-3_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Embedding types"

1

Lindley, Sam, and J. Garrett Morris. "Embedding session types in Haskell." In ICFP'16: ACM SIGPLAN International Conference on Functional Programming. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2976002.2976018.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Zhang, Hongming, Liwei Qiu, Lingling Yi, and Yangqiu Song. "Scalable Multiplex Network Embedding." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/428.

Full text
Abstract:
Network embedding has been proven to be helpful for many real-world problems. In this paper, we present a scalable multiplex network embedding model to represent information of multi-type relations into a unified embedding space. To combine information of different types of relations while maintaining their distinctive properties, for each node, we propose one high-dimensional common embedding and a lower-dimensional additional embedding for each type of relation. Then multiple relations can be learned jointly based on a unified network embedding model. We conduct experiments on two tasks: link prediction and node classification using six different multiplex networks. On both tasks, our model achieved better or comparable performance compared to current state-of-the-art models with less memory use.
APA, Harvard, Vancouver, ISO, and other styles
3

Zhang, Mingyang, Tong Li, Yong Li, and Pan Hui. "Multi-View Joint Graph Representation Learning for Urban Region Embedding." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/611.

Full text
Abstract:
The increasing amount of urban data enable us to investigate urban dynamics, assist urban planning, and eventually, make our cities more livable and sustainable. In this paper, we focus on learning an embedding space from urban data for urban regions. For the first time, we propose a multi-view joint learning model to learn comprehensive and representative urban region embeddings. We first model different types of region correlations based on both human mobility and inherent region properties. Then, we apply a graph attention mechanism in learning region representations from each view of the built correlations. Moreover, we introduce a joint learning module that boosts the region embedding learning by sharing cross-view information and fuses multi-view embeddings by learning adaptive weights. Finally, we exploit the learned embeddings in the downstream applications of land usage classification and crime prediction in urban areas with real-world data. Extensive experiment results demonstrate that by exploiting our proposed joint learning model, the performance is improved by a large margin on both tasks compared with the state-of-the-art methods.
APA, Harvard, Vancouver, ISO, and other styles
4

Ramsey, Norman. "Embedding an interpreted language using higher-order functions and types." In the 2003 workshop. New York, New York, USA: ACM Press, 2003. http://dx.doi.org/10.1145/858570.858571.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Zhang, Jie, Yuxiao Dong, Yan Wang, Jie Tang, and Ming Ding. "ProNE: Fast and Scalable Network Representation Learning." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/594.

Full text
Abstract:
Recent advances in network embedding has revolutionized the field of graph and network mining. However, (pre-)training embeddings for very large-scale networks is computationally challenging for most existing methods. In this work, we present ProNE---a fast, scalable, and effective model, whose single-thread version is 10--400x faster than efficient network embedding benchmarks with 20 threads, including LINE, DeepWalk, node2vec, GraRep, and HOPE. As a concrete example, the single-version ProNE requires only 29 hours to embed a network of hundreds of millions of nodes while it takes LINE weeks and DeepWalk months by using 20 threads. To achieve this, ProNE first initializes network embeddings efficiently by formulating the task as sparse matrix factorization. The second step of ProNE is to enhance the embeddings by propagating them in the spectrally modulated space. Extensive experiments on networks of various scales and types demonstrate that ProNE achieves both effectiveness and significant efficiency superiority when compared to the aforementioned baselines. In addition, ProNE's embedding enhancement step can be also generalized for improving other models at speed, e.g., offering >10% relative gains for the used baselines.
APA, Harvard, Vancouver, ISO, and other styles
6

Sun, Yiwei, Suhang Wang, Tsung-Yu Hsieh, Xianfeng Tang, and Vasant Honavar. "MEGAN: A Generative Adversarial Network for Multi-View Network Embedding." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/489.

Full text
Abstract:
Data from many real-world applications can be naturally represented by multi-view networks where the different views encode different types of relationships (e.g., friendship, shared interests in music, etc.) between real-world individuals or entities. There is an urgent need for methods to obtain low-dimensional, information preserving and typically nonlinear embeddings of such multi-view networks. However, most of the work on multi-view learning focuses on data that lack a network structure, and most of the work on network embeddings has focused primarily on single-view networks. Against this background, we consider the multi-view network representation learning problem, i.e., the problem of constructing low-dimensional information preserving embeddings of multi-view networks. Specifically, we investigate a novel Generative Adversarial Network (GAN) framework for Multi-View Network Embedding, namely MEGAN, aimed at preserving the information from the individual network views, while accounting for connectivity across (and hence complementarity of and correlations between) different views. The results of our experiments on two real-world multi-view data sets show that the embeddings obtained using MEGAN outperform the state-of-the-art methods on node classification, link prediction and visualization tasks.
APA, Harvard, Vancouver, ISO, and other styles
7

Yang, Liang, Yuanfang Guo, Di Jin, Huazhu Fu, and Xiaochun Cao. "3-in-1 Correlated Embedding via Adaptive Exploration of the Structure and Semantic Subspaces." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/502.

Full text
Abstract:
Combinational network embedding, which learns the node representation by exploring both topological and non-topological information, becomes popular due to the fact that the two types of information are complementing each other. Most of the existing methods either consider the topological and non-topological information being aligned or possess predetermined preferences during the embedding process.Unfortunately, previous methods fail to either explicitly describe the correlations between topological and non-topological information or adaptively weight their impacts. To address the existing issues, three new assumptions are proposed to better describe the embedding space and its properties. With the proposed assumptions, nodes, communities and topics are mapped into one embedding space. A novel generative model is proposed to formulate the generation process of the network and content from the embeddings, with respect to the Bayesian framework. The proposed model automatically leans to the information which is more discriminative.The embedding result can be obtained by maximizing the posterior distribution by adopting the variational inference and reparameterization trick. Experimental results indicate that the proposed method gives superior performances compared to the state-of-the-art methods when a variety of real-world networks is analyzed.
APA, Harvard, Vancouver, ISO, and other styles
8

Dong, Yuxiao, Ziniu Hu, Kuansan Wang, Yizhou Sun, and Jie Tang. "Heterogeneous Network Representation Learning." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/677.

Full text
Abstract:
Representation learning has offered a revolutionary learning paradigm for various AI domains. In this survey, we examine and review the problem of representation learning with the focus on heterogeneous networks, which consists of different types of vertices and relations. The goal of this problem is to automatically project objects, most commonly, vertices, in an input heterogeneous network into a latent embedding space such that both the structural and relational properties of the network can be encoded and preserved. The embeddings (representations) can be then used as the features to machine learning algorithms for addressing corresponding network tasks. To learn expressive embeddings, current research developments can fall into two major categories: shallow embedding learning and graph neural networks. After a thorough review of the existing literature, we identify several critical challenges that remain unaddressed and discuss future directions. Finally, we build the Heterogeneous Graph Benchmark to facilitate open research for this rapidly-developing topic.
APA, Harvard, Vancouver, ISO, and other styles
9

Kursuncu, Ugur, Manas Gaur, Usha Lokala, Anurag Illendula, Krishnaprasad Thirunarayan, Raminta Daniulaityte, Amit Sheth, and I. Budak Arpinar. "What's ur Type? Contextualized Classification of User Types in Marijuana-Related Communications Using Compositional Multiview Embedding." In 2018 IEEE/WIC/ACM International Conference on Web Intelligence (WI). IEEE, 2018. http://dx.doi.org/10.1109/wi.2018.00-50.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Li, Lei, Liyuan Mao, and Moye Chen. "Word Embedding and Topic Modeling Enhanced Multiple Features for Content Linking and Argument / Sentiment Labeling in Online Forums." In Proceedings of the MultiLing 2017 Workshop on Summarization and Summary Evaluation Across Source Types and Genres. Stroudsburg, PA, USA: Association for Computational Linguistics, 2017. http://dx.doi.org/10.18653/v1/w17-1005.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Embedding types' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography