Results 261 to 270 of about 15,432 (298)
Some of the next articles are maybe not open access.

From Node Embeddings to Triple Embeddings.

2021
An extended version of this paper has been published at the the 34th AAAI Conference on Artificial Intelligence (AAAI) with the title “Learning Triple Embeddings from Knowledge Graphs”. Graph embedding techniques allow to learn high-quality low-dimensional graph representations useful in various tasks, from node classification to clustering.
Fionda Valeria, Pirro' Giuseppe
openaire   +3 more sources

Embedded interpreters

Journal of Functional Programming, 2005
This is a tutorial on using type-indexed embedding/projection pairs when writing interpreters in statically-typed functional languages. The method allows (higher-order) values in the interpreting language to be embedded in the interpreted language and values from the interpreted language may be projected back into the interpreting ...
openaire   +1 more source

Embedment behaviour of hybrid cross-laminated timber (HCLT) made of fast-growing Chinese fir and OSB [PDF]

open access: yesConstruction and Building Materials
The embedment strength and stiffness of wood products are key parameters in the design of timber structures using dowel-type connections. The embedment behaviour of layered wood products such as hybrid cross-laminated timber (HCLT) will result from a ...
Thomas Reynolds   +2 more
exaly   +2 more sources

On an Embedding Problem

Journal of Mathematical Sciences, 2002
Let \(n\) be an odd integer. Then the splitting fields \(K\) of \(f(x)= x^4- 2nx-1\) over \(\mathbb{Q}\) has Galois group \(S_4\). The author proves that the nonsplit embedding problem of \(K/\mathbb{Q}\) with kernel of order 2 has a solution if in the prime decomposition of \(16+ 27n^4\) the primes of odd multiplicity are of the form \(8m+ 1\), \(8m ...
openaire   +2 more sources

Antipodes and embeddings

Sbornik: Mathematics, 2005
The famous \textit{Borsuk Ulam theorem} asserts that every continuous \(f: S^n \to \mathbb R^n\) has an antipodal coincidence point, i.e., there exists an \(x \in S^n\) such that \(f(x)=f(-x)\). The main objective of the present paper is to solve the following question by H.
Volovikov, A. Yu., Shchepin, E. V.
openaire   +1 more source

Embedding F

Proceedings of the 8th ACM SIGPLAN workshop on Generic programming, 2012
This millennium has seen a great deal of research into embedded domain-specific languages. Primarily, such languages are simply-typed. Focusing on System F, we demonstrate how to embed polymorphic domain specific languages in Haskell and OCaml. We exploit recent language extensions including kind polymorphism and first-class modules.
openaire   +2 more sources

Fixation and Embedding

2003
For electron microscopic immunocytochemistry, the fixation procedure is always a compromise between good morphological preservation and retention of antigenicity. The choice of fixative depends on whether the immunogold labeling will be done before or after the samples are embedded and on how resistant the antigen is to fixation.
Constance, Oliver, Maria Célia, Jamur
openaire   +3 more sources

A Note on Embedding

Canadian Mathematical Bulletin, 1969
Let Qt = [0, 1] be equipped with the topology consisting of Qt, the empty set and all subsets of Qt of the form [0, x), 0 < x ≦ 1. R. Nielsen and C. Sloyer [1, p. 514] proved that every T0-space can be embedded in for a suitable F. The purpose of this note is to generalize this result.
openaire   +1 more source

Modularity Embedding

2013
A number of nonlinear dimensionality reduction, or graph embedding, techniques have been proposed recently. These embedding techniques aim to provide a low-dimensional depiction of graphs while preserving certain properties of the data. In this manuscript we propose a novel graph embedding method which tries to optimize the "modularity" of graphs ...
openaire   +2 more sources

Behavior of Piggy-Backed Drag Embedment Anchors in Marine Soils

Journal of Geotechnical and Geoenvironmental Engineering - ASCE, 2022
Charles Aubeny   +2 more
exaly  

Home - About - Disclaimer - Privacy