Relevant bibliographies by topics / Embedding formalism

Contents

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

Academic literature on the topic 'Embedding formalism'

Author: Grafiati
Published: 25 May 2024

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 formalism.'

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 formalism"

1

ABREU, E. M. C., A. C. R. MENDES, C. NEVES, W. OLIVEIRA, and F. I. TAKAKURA. "DUALITY THROUGH THE SYMPLECTIC EMBEDDING FORMALISM." International Journal of Modern Physics A 22, no. 21 (August 20, 2007): 3605–20. http://dx.doi.org/10.1142/s0217751x07036932.

Full text
Abstract:
In this work we show that we can obtain dual equivalent actions following the symplectic formalism with the introduction of extra variables which enlarge the phase space. We show that the results are equal as the one obtained with the recently developed gauging iterative Noether dualization method. We believe that, with the arbitrariness property of the zero mode, the symplectic embedding method is more profound since it can reveal a whole family of dual equivalent actions. We illustrate the method demonstrating that the gauge-invariance of the electromagnetic Maxwell Lagrangian broken by the introduction of an explicit mass term and a topological term can be restored to obtain the dual equivalent and gauge-invariant version of the theory.
APA, Harvard, Vancouver, ISO, and other styles
2

Mikura, Yusuke, and Yuichiro Tada. "On UV-completion of Palatini-Higgs inflation." Journal of Cosmology and Astroparticle Physics 2022, no. 05 (May 1, 2022): 035. http://dx.doi.org/10.1088/1475-7516/2022/05/035.

Full text
Abstract:
Abstract We investigate the UV-completion of the Higgs inflation in the metric and the Palatini formalisms. It is known that the cutoff scales for the perturbative unitarity of these inflation models become much smaller than the Planck scale to be consistent with observations. Expecting that the low cutoff scales originate in the curvature of a field-space spanned by the Higgs fields, we consider embedding the curved field-space into a higher dimensional flat space and apply this procedure to the metric-Higgs and the Palatini-Higgs scenarios. The new field introduced in this way successfully flattens the field-space and UV-completes the Higgs inflation in the metric formalism. However, in the Palatini formalism, the new field cannot uplift the cutoff up to the Planck scale. We also discuss the unavoidable low cutoff in the Palatini formalism in the context of the local conformal symmetry.
APA, Harvard, Vancouver, ISO, and other styles
3

Abreu, E. M. C., J. Ananias Neto, A. C. R. Mendes, C. Neves, and W. Oliveira. "Obtaining gauge invariant actions via symplectic embedding formalism." Annalen der Physik 524, no. 8 (June 18, 2012): 434–55. http://dx.doi.org/10.1002/andp.201100199.

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

HONG, SOON-TAE, and YOUNG-JAI PARK. "BFT HAMILTONIAN EMBEDDING FOR SU(3) SKYRMION." Modern Physics Letters A 15, no. 14 (May 10, 2000): 913–23. http://dx.doi.org/10.1142/s0217732300000918.

Full text
Abstract:
We apply the Batalin, Fradkin and Tyutin (BFT) formalism to the SU (3) flavor Skyrmion model to investigate the Weyl ordering correction to the structure of the hyperfine splittings of strange baryons. On the other hand, the Berry phases and Casimir effects are also discussed.
APA, Harvard, Vancouver, ISO, and other styles
5

Banerjee, R., and J. Barcelos-Neto. "Reducible Systems and Embedding Procedures in the Canonical Formalism." Annals of Physics 265, no. 2 (May 1998): 134–54. http://dx.doi.org/10.1006/aphy.1997.9998.

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

Pernal, Katarzyna. "Reduced density matrix embedding. General formalism and inter-domain correlation functional." Physical Chemistry Chemical Physics 18, no. 31 (2016): 21111–21. http://dx.doi.org/10.1039/c6cp00524a.

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

MONEMZADEH, M., and M. TAKI. "HAMILTONIAN EMBEDDING OF NONCOMMUTATIVE D-BRANE SYSTEM." International Journal of Modern Physics A 26, no. 06 (March 10, 2011): 1035–43. http://dx.doi.org/10.1142/s0217751x11051597.

Full text
Abstract:
We choose the mechanical action of open string in the presence of constant B-fields, which allows us to build up constraint structures. In an open string theory, the secondary constraints give rise to noncommutativity of the string coordinates on the boundaries. We find that applying the Batalin–Fradkin–Fradkina–Tyutin (BFFT) formalism to this noncommutative system converts it to a commutative one and makes new local gauge symmetries.
APA, Harvard, Vancouver, ISO, and other styles
8

Pavanello, Michele, and Johannes Neugebauer. "Modelling charge transfer reactions with the frozen density embedding formalism." Journal of Chemical Physics 135, no. 23 (December 21, 2011): 234103. http://dx.doi.org/10.1063/1.3666005.

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

Kopeikin, Sergei. "Beyond the standard IAU framework." Proceedings of the International Astronomical Union 5, S261 (April 2009): 7–15. http://dx.doi.org/10.1017/s1743921309990081.

Full text
Abstract:
AbstractWe discuss three conceivable scenarios of extension and/or modification of the IAU relativistic resolutions on time scales and spatial coordinates beyond the Standard IAU Framework. These scenarios include: (1) the formalism of the monopole and dipole moment transformations of the metric tensor replacing the scale transformations of time and space coordinates; (2) implementing the parameterized post-Newtonian formalism with two PPN parameters – β and γ; (3) embedding the post-Newtonian barycentric reference system to the Friedman-Robertson-Walker cosmological model.
APA, Harvard, Vancouver, ISO, and other styles
10

MONEMZADEH, M., and AGHILEH S. EBRAHIMI. "EMBEDDING OF NONCOMMUTATIVE MASSIVE QED." Modern Physics Letters A 27, no. 14 (May 5, 2012): 1250081. http://dx.doi.org/10.1142/s0217732312500812.

Full text
Abstract:
In this paper, BFT formalism of Proca model in noncommutative space is investigated. Considering that all theories with first class constraint are gauge theories, Proca model in noncommutative space is not a gauge theory in general due to the appearance of second class constraints in it. In present research, the Proca model is converted into a gauge theory using BFT approach by introducing several auxiliary variables which in turn manage to convert the second class constraints to first class ones. Consequently, we apply modified BFT that preserve the chain structure of constraints. Modified BFT has the benefit that it gives less number of independent gauge parameters and we obtain gauge generating function and infinitesimal gauge variation of fields in Proca model. As results, we investigate partition function of this model and embedded noncommutative Proca is ready to quantize in usual way.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Embedding formalism"

1

Hariz, Belgacem Khader. "Higher-order Embedding Formalism, Noether’s Theorem on Time Scales and Eringen’s Nonlocal Elastica." Electronic Thesis or Diss., Pau, 2022. https://theses.hal.science/tel-03981833.

Full text
Abstract:
En mathématiques, le calcul des variations est un ensemble de méthodes permettant la détermination de solutions à des problèmes d'optimisation des quantités traduites en termes de fonctionnelle. De nombreuses applications existent, notamment dans la recherche de courbes ou de surfaces minimales. Les systèmes dynamiques considérés sont de natures diverses (équations différentielles, intégrales ou stochastiques) et modélisent des problèmes d'origines multiples : aérospatiale, automobile, biologie, économie, médecine, etc. Le théorème de Noether présente un fort intérêt puisqu'il propose une loi de conservation explicite (traduisant souvent une quantité physique comme l'énergie totale ou le moment angulaire en mécanique classique) qui permet de réduire ou d'intégrer l'équation différentielle associée par quadrature. L'objectif de ma thèse contient de nombreux thèmes, dans le premier but nous allons : *) donner le théorème de Noether discret dans le cadre ”time scale” (Le formalisme lagrangien et hamiltonien). Le passage de la nature discrète à la nature continue de la structure la morphologie est d'un intérêt primordial en physique pour comprendre comment la microstructure peut influencer les propriétés macroscopiques du matériau à plus grande échelle. Ce passage peut être modélisé par un système discret appelé 'Hencky's chain' et l'équation du mouvement est donnée par des équations aux différences non linéaires et cette équation ne possède pas de Lagrangien. Le deuxième but nous allons : *) donner les structures lagrangienne, hamiltonienne via le facteur intégrant et trouver la solution analytique de l'équation non locale au sens d'Eringen (nonlocalité différentielle d'Eringen, 1983). Le troisième but nous allons : *) étudier l'existence des formulations variationnelles via le principe de Brezis Ekeland-Nayroles (Gery de Saxce) - application sur la formulation 4D développée par E. Rouhaud pour l'étude des déformations des matériaux *) développer des schémas numériques qui respectent certaines particularités. En particulier, un schéma permettent de mettre en œuvre la théorie 4D développée par E. Rouhaud. *) applications numériques et théoriques sur le problème des déformations des matériaux
The aim of this thesis is to deal with the connection between continuous and discrete versions of a given object. This connection can be studied in two different directions: one going from a continuous setting to a discrete analogue, and in a symmetric way, from a discrete setting to a continuous one. The first procedure is typically used in numerical analysis in order to construct numerical integrators and the second one is typical of continuous modeling for the study of micro-structured materials.In this manuscript, we focus our attention on three distinct problems. In the first part, we propose a general framework precising different ways to derive a discrete version of a differential equation called discrete embedding formalism.More precisely, we exhibit three main discrete associate: the differential, integral or variational structure in both classical and high-order approximations.The second part focuses on the preservation of symmetries for discrete versions of Lagrangian and Hamiltonian systems, i.e., the discrete analogue of Noether's theorem.Finally, the third part applies these results in mechanics, i.e., the problem studied by N. Challamel, Kocsis and Wang called Eringen's nonlocal elastica equation which can beobtained by the continualization method. Precisely, we construct a discrete version of Eringen's nonlocal elastica then we study the difference with Challamel's proposal
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Embedding formalism"

1

Formalin-fixed paraffin-embedded tissues: Methods and protocols. New York: Humana Press, 2011.

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

Book chapters on the topic "Embedding formalism"

1

Möller, Bernhard, Peter O’Hearn, and Tony Hoare. "On Algebra of Program Correctness and Incorrectness." In Relational and Algebraic Methods in Computer Science, 325–43. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-88701-8_20.

Full text
Abstract:
AbstractVariants of Kleene algebra have been used to provide foundations of reasoning about programs, for instance by representing Hoare Logic (HL) in algebra. That work has generally emphasised program correctness, i.e., proving the absence of bugs. Recently, Incorrectness Logic (IL) has been advanced as a formalism for the dual problem: proving the presence of bugs. IL is intended to underpin the use of logic in program testing and static bug finding. Here, we use a Kleene algebra with diamond operators and countable joins of tests, which embeds IL, and which also is complete for reasoning about the image of the embedding. Next to embedding IL, the algebra is able to embed HL, and allows making connections between IL and HL specifications. In this sense, it unifies correctness and incorrectness reasoning in one formalism.
APA, Harvard, Vancouver, ISO, and other styles
2

Krause, Franz, Kabul Kurniawan, Elmar Kiesling, Jorge Martinez-Gil, Thomas Hoch, Mario Pichler, Bernhard Heinzl, and Bernhard Moser. "Leveraging Semantic Representations via Knowledge Graph Embeddings." In Artificial Intelligence in Manufacturing, 71–85. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-46452-2_5.

Full text
Abstract:
AbstractThe representation and exploitation of semantics has been gaining popularity in recent research, as exemplified by the uptake of large language models in the field of Natural Language Processing (NLP) and knowledge graphs (KGs) in the Semantic Web. Although KGs are already employed in manufacturing to integrate and standardize domain knowledge, the generation and application of corresponding KG embeddings as lean feature representations of graph elements have yet to be extensively explored in this domain. Existing KGs in manufacturing often focus on top-level domain knowledge and thus ignore domain dynamics, or they lack interconnectedness, i.e., nodes primarily represent non-contextual data values with single adjacent edges, such as sensor measurements. Consequently, context-dependent KG embedding algorithms are either restricted to non-dynamic use cases or cannot be applied at all due to the given KG characteristics. Therefore, this work provides an overview of state-of-the-art KG embedding methods and their functionalities, identifying the lack of dynamic embedding formalisms and application scenarios as the key obstacles that hinder their implementation in manufacturing. Accordingly, we introduce an approach for dynamizing existing KG embeddings based on local embedding reconstructions. Furthermore, we address the utilization of KG embeddings in the Horizon2020 project Teaming.AI (www.teamingai-project.eu.) focusing on their respective benefits.
APA, Harvard, Vancouver, ISO, and other styles
3

Reetz, Ralf, and Thomas Kropf. "Simplifying deep embedding: A formalised code generator." In Higher Order Logic Theorem Proving and Its Applications, 378–90. Berlin, Heidelberg: Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/3-540-58450-1_55.

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

Reynolds, Conor. "Formalizing the Institution for Event-B in the Coq Proof Assistant." In Rigorous State-Based Methods, 162–66. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-77543-8_17.

Full text
Abstract:
AbstractWe formalize a fragment of the theory of institutions sufficient to establish basic facts about the institution "Image missing" for Event-B, and its relationship with the institution "Image missing" for first-order predicate logic. We prove the satisfaction condition for "Image missing" and encode the institution comorphism "Image missing" embedding "Image missing" in "Image missing" .
APA, Harvard, Vancouver, ISO, and other styles
5

Angelo, Catia M., Luc Claesen, and Hugo Man. "Degrees of formality in shallow embedding hardware description languages in HOL." In Higher Order Logic Theorem Proving and Its Applications, 89–100. Berlin, Heidelberg: Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/3-540-57826-9_127.

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

Bílková, Marta, Sabine Frittella, and Daniil Kozhemiachenko. "Paraconsistent Gödel Modal Logic." In Automated Reasoning, 429–48. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-10769-6_26.

Full text
Abstract:
AbstractWe introduce a paraconsistent modal logic $$\mathbf {K}\mathsf {G}^2$$ K G 2 , based on Gödel logic with coimplication (bi-Gödel logic) expanded with a De Morgan negation $$\lnot $$ ¬ . We use the logic to formalise reasoning with graded, incomplete and inconsistent information. Semantics of $$\mathbf {K}\mathsf {G}^2$$ K G 2 is two-dimensional: we interpret $$\mathbf {K}\mathsf {G}^2$$ K G 2 on crisp frames with two valuations $$v_1$$ v 1 and $$v_2$$ v 2 , connected via $$\lnot $$ ¬ , that assign to each formula two values from the real-valued interval [0, 1]. The first (resp., second) valuation encodes the positive (resp., negative) information the state gives to a statement. We obtain that $$\mathbf {K}\mathsf {G}^2$$ K G 2 is strictly more expressive than the classical modal logic $$\mathbf {K}$$ K by proving that finitely branching frames are definable and by establishing a faithful embedding of $$\mathbf {K}$$ K into $$\mathbf {K}\mathsf {G}^2$$ K G 2 . We also construct a constraint tableau calculus for $$\mathbf {K}\mathsf {G}^2$$ K G 2 over finitely branching frames, establish its decidability and provide a complexity evaluation.
APA, Harvard, Vancouver, ISO, and other styles
7

Murase, Yuito, Yuichi Nishiwaki, and Atsushi Igarashi. "Contextual Modal Type Theory with Polymorphic Contexts." In Programming Languages and Systems, 281–308. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30044-8_11.

Full text
Abstract:
AbstractModal types—types that are derived from proof systems of modal logic—have been studied as theoretical foundations of metaprogramming, where program code is manipulated as first-class values. In modal type systems, modality corresponds to a type constructor for code types and controls free variables and their types in code values. Nanevski et al. have proposed contextual modal type theory, which has modal types with fine-grained information on free variables: modal types are explicitly indexed by contexts—the types of all free variables in code values.This paper presents $$\lambda _{\forall []}$$ λ ∀ [ ] , a novel extension of contextual modal type theory with parametric polymorphism over contexts. Such an extension has been studied in the literature but, unlike earlier proposals, $$\lambda _{\forall []}$$ λ ∀ [ ] is more general in that it allows multiple occurrence of context variables in a single context. We formalize $$\lambda _{\forall []}$$ λ ∀ [ ] with its type system and operational semantics given by $$\beta $$ β -reduction and prove its basic properties including subject reduction, strong normalization, and confluence. Moreover, to demonstrate the expressive power of polymorphic contexts, we show a type-preserving embedding from a two-level fragment of Davies’ $$\lambda _{\bigcirc }$$ λ ◯ , which is based on linear-time temporal logic, to $$\lambda _{\forall []}$$ λ ∀ [ ] .
APA, Harvard, Vancouver, ISO, and other styles
8

Baggott, Jim. "Dirac, Von Neumann, and the Derivation of the Quantum Formalism." In The Quantum Cookbook, 203–18. Oxford University Press, 2020. http://dx.doi.org/10.1093/oso/9780198827856.003.0011.

Full text
Abstract:
The evolution of quantum mechanics through the 1920s was profoundly messy. Some physicists believed that it was necessary to throw out much of the conceptual baggage that early quantum mechanics tended to carry around with it and re-establish the theory on much firmer ground. It was at this critical stage that the search for deeper insights into the underlying reality was set aside in favour of mathematical expediency. All the conceptual problems appeared to be coming from the wavefunctions. But whatever was to replace them needed to retain all the properties and relationships that had so far been discovered. Dirac and von Neumann chose to derive a new quantum formalism by replacing the wavefunctions with state vectors operating in an abstract Hilbert space, and formally embedding all the most important definitions and relations within a system of axioms.
APA, Harvard, Vancouver, ISO, and other styles
9

Capra, Lorenzo, and Walter Cazzola. "An Introduction to Reflective Petri Nets." In Handbook of Research on Discrete Event Simulation Environments, 191–217. IGI Global, 2010. http://dx.doi.org/10.4018/978-1-60566-774-4.ch009.

Full text
Abstract:
Most discrete-event systems are subject to evolution during lifecycle. Evolution often implies the development of new features, and their integration in deployed systems. Taking evolution into account since the design phase therefore is mandatory. A common approach consists of hard-coding the foreseeable evolutions at the design level. Neglecting the obvious difficulties of this approach, we also get system’s design polluted by details not concerning functionality, which hamper analysis, reuse and maintenance. Petri Nets, as a central formalism for discrete-event systems, are not exempt from pollution when facing evolution. Embedding evolution in Petri nets requires expertise, other than early knowledge of evolution. The complexity of resulting models is likely to affect the consolidated analysis algorithms for Petri nets. We introduce Reflective Petri nets, a formalism for dynamic discrete-event systems. Based on a reflective layout, in which functional aspects are separated from evolution, this model preserves the description effectiveness and the analysis capabilities of Petri nets. Reflective Petri nets are provided with timed state-transition semantics.
APA, Harvard, Vancouver, ISO, and other styles
10

Dulak, M., and T. A. Wesolowski. "Adaptive grid technique for computer simulations of condensed matter using orbital-free embedding formalism." In In the Frontiers of Computational Science, 282–88. CRC Press, 2005. http://dx.doi.org/10.1201/b12167-28.

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

Conference papers on the topic "Embedding formalism"

1

Saraiva, J., and S. Schneider. "Embedding domain specific languages in the attribute grammar formalism." In 36th Annual Hawaii International Conference on System Sciences, 2003. Proceedings of the. IEEE, 2003. http://dx.doi.org/10.1109/hicss.2003.1174889.

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

Bustos-Brinez, Oscar, Joseph Gallego, and Fabio Gonzalez. "Anomaly Detection through Density Matrices and Kernel Density Estimation (AD-DMKDE)." In LatinX in AI at Neural Information Processing Systems Conference 2022. Journal of LatinX in AI Research, 2022. http://dx.doi.org/10.52591/lxai2022112810.

Full text
Abstract:
This paper presents a novel anomaly detection method, called AD-DMKDE, based on the use of Kernel Density Estimation (KDE) along with density matrices (a powerful mathematical formalism from quantum mechanics) and Fourier features. The proposed method was systematically compared with eleven state-of-the-art anomaly detection methods on various data sets, and AD-DMKDE shows competitive performance. The method uses neural-network optimization to find the parameters of data embedding, and the prediction phase complexity of the proposed algorithm is constant relative to the training data size.
APA, Harvard, Vancouver, ISO, and other styles
3

Benger, Werner. "Illustrating Geometric Algebra and Differential Geometry in 5D Color Space." In WSCG 2023 – 31. International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision. University of West Bohemia, Czech Republic, 2023. http://dx.doi.org/10.24132/csrn.3301.1.

Full text
Abstract:
Geometric Algebra (GA) is popular for its immediate geometric interpretations of algebraic objects and operations. It is based on Clifford Algebra on vector spaces and extends linear algebra of vectors by operations such as an invertible product, i.e. divisions by vectors. This formalism allows for a complete algebra on vectors same as for scalar or complex numbers. It is particularly suitable for rotations in arbitrary dimensions. In Euclidean 3D space quaternions are known to be numerically superior to rotation matrices and already widely used in computer graphics. However, their meaning beyond its numerical formalism often remains mysterious. GA allows for an intuitive interpretation in terms of planes of rotations and extends this concept to arbitrary dimensions by embedding vectors into a higher dimensional, but still intuitively graspable space of multi-vectors. However, out intuition of more than three spatial dimensions is deficient. The space of colors forms a vector space as well, though one of non-spatial nature, but spun by the primary colors red, green, blue. The GA formalism can be applied here as well, amalgamating surprisingly with the notion of vectors and co-vectors known from differential geometry: tangential vectors on a manifold correspond to additive colors red/green/blue, whereas co-vectors from the co-tangential space correspond to subtractive primary colors magenta, yellow, cyan. GA in turn considers vectors, bi-vectors and anti-vectors as part of its generalized multi-vector zoo of algebraic objects. In 3D space vectors, anti-vectors, bi-vectors and covectors are all three-dimensional objects that can be identified with each other, so their distinction is concealed. Confusions arise from notions such as “normal vectors” vs. “axial vectors”. Higher dimensional spaces exhibit the differences more clearly. Using colors instead of spatial dimensions we can expand our intuition by considering "transparency" as an independent, four-dimensional property of a color vector. We can thereby explore 4D GA alternatively to spacetime in special/general relativity. However, even in 4D possibly confusing ambiguities remain between vectors, co-vectors, bi-vectors and bi-co-vectors: bi-vectors and bi-co-vectors - both six-dimensional objects - are visually equivalent. They become unequivocal only in five or higher dimensions. Envisioning five-dimensional geometry is even more challenging to the human mind, but in color space we can add another property, "texture" to constitute a five-dimensional vector space. The properties of a bi-vector and a bi-co-vector becomes evident there: We can still study all possible combinations of colors/transparency/texture visually. This higher-dimensional yet intuitive approach demonstrates the need to distinguish among different kinds of vectors before identifying them in special situations, which also clarifies the meanings of algebraic objects in 3D Euclidean space and allows for better formulations of algorithms in 3D.
APA, Harvard, Vancouver, ISO, and other styles
4

Guo, Guibing, Shichang Ouyang, Fajie Yuan, and Xingwei Wang. "Approximating Word Ranking and Negative Sampling for Word 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/569.

Full text
Abstract:
CBOW (Continuous Bag-Of-Words) is one of the most commonly used techniques to generate word embeddings in various NLP tasks. However, it fails to reach the optimal performance due to uniform involvements of positive words and a simple sampling distribution of negative words. To resolve these issues, we propose OptRank to optimize word ranking and approximate negative sampling for bettering word embedding. Specifically, we first formalize word embedding as a ranking problem. Then, we weigh the positive words by their ranks such that highly ranked words have more importance, and adopt a dynamic sampling strategy to select informative negative words. In addition, an approximation method is designed to efficiently compute word ranks. Empirical experiments show that OptRank consistently outperforms its counterparts on a benchmark dataset with different sampling scales, especially when the sampled subset is small. The code and datasets can be obtained from https://github.com/ouououououou/OptRank.
APA, Harvard, Vancouver, ISO, and other styles
5

Tian, Yijun, Chuxu Zhang, Zhichun Guo, Yihong Ma, Ronald Metoyer, and Nitesh V. Chawla. "Recipe2Vec: Multi-modal Recipe Representation Learning with Graph Neural Networks." In Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/482.

Full text
Abstract:
Learning effective recipe representations is essential in food studies. Unlike what has been developed for image-based recipe retrieval or learning structural text embeddings, the combined effect of multi-modal information (i.e., recipe images, text, and relation data) receives less attention. In this paper, we formalize the problem of multi-modal recipe representation learning to integrate the visual, textual, and relational information into recipe embeddings. In particular, we first present Large-RG, a new recipe graph data with over half a million nodes, making it the largest recipe graph to date. We then propose Recipe2Vec, a novel graph neural network based recipe embedding model to capture multi-modal information. Additionally, we introduce an adversarial attack strategy to ensure stable learning and improve performance. Finally, we design a joint objective function of node classification and adversarial learning to optimize the model. Extensive experiments demonstrate that Recipe2Vec outperforms state-of-the-art baselines on two classic food study tasks, i.e., cuisine category classification and region prediction. Dataset and codes are available at https://github.com/meettyj/Recipe2Vec.
APA, Harvard, Vancouver, ISO, and other styles
6

Yi, Xiaoyuan, Zhenghao Liu, Wenhao Li, and Maosong Sun. "Text Style Transfer via Learning Style Instance Supported Latent Space." 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/526.

Full text
Abstract:
Text style transfer pursues altering the style of a sentence while remaining its main content unchanged. Due to the lack of parallel corpora, most recent work focuses on unsupervised methods and has achieved noticeable progress. Nonetheless, the intractability of completely disentangling content from style for text leads to a contradiction of content preservation and style transfer accuracy. To address this problem, we propose a style instance supported method, StyIns. Instead of representing styles with embeddings or latent variables learned from single sentences, our model leverages the generative flow technique to extract underlying stylistic properties from multiple instances of each style, which form a more discriminative and expressive latent style space. By combining such a space with the attention-based structure, our model can better maintain the content and simultaneously achieve high transfer accuracy. Furthermore, the proposed method can be flexibly extended to semi-supervised learning so as to utilize available limited paired data. Experiments on three transfer tasks, sentiment modification, formality rephrasing, and poeticness generation, show that StyIns obtains a better balance between content and style, outperforming several recent baselines.
APA, Harvard, Vancouver, ISO, and other styles
7

Thiesen, Ana Paula, Bruna Mielczarski, and Ricardo Francalacci Savaris. "DEEP LEARNING NEURAL NETWORK IMAGE ANALYSIS OF IMMUNOHISTOCHEMICAL PROTEIN EXPRESSION REVEALS A SIGNIFICANTLY REDUCED EXPRESSION OF BIGLYCAN IN BREAST CANCER." In Brazilian Breast Cancer Symposium 2022. Mastology, 2022. http://dx.doi.org/10.29289/259453942022v32s2014.

Full text
Abstract:
Objective: The aim of this study was to compare the protein expression of biglycan (BGN) in normal breast tissue and in breast cancer using deep learning and digital HScore techniques. Methods: In this case-control study, 24 formalin-fixed, paraffin-embedded tissues were obtained from pathological archives for analysis. Normal breast (n=9) and breast cancer (n=15) tissue sections were analyzed by immunohistochemistry using BGN monoclonal antibody (M01 – Abnova), clone 4E1-1G7 at dilution 1:300 at pH 6, and 3,3’-diaminobenzidine (DAB) as the chromogen. Photomicrographs of the slides were analyzed using the ImageJ software with “color deconvolution”. After selecting the regions of interest (ROI), deconvoluted panels with DAB only were quantified using arbitrary DAB units. Another set, with higher magnification without ROI selection, was submitted to the inception V3 deep neural network image embedding recognition model. Next, supervised neural network analysis, using stratified 20-fold cross-validation, with 200 hidden layers, ReLu activation, and regularization at α=0.0001 were applied for SDLNN. The sample size was calculated for a minimum of seven cases and seven controls, having a power of 90%, an α error=5%, and a standard deviation of 20, to identify a decrease from the average of 40 DAB units (control) to 4 DAB units in cancer. Ethical approval was obtained from the Hospital de Clínicas de Porto Alegre Ethical Review Board (2019/0337). CAAE 15329119.9.0000.5327. Results: BGN expression (mean±SD) was 6.1±3.9 in breast cancer tissue, while in normal breast tissue, it was 39.6±21.9, using D-HScore (p=0.0017, student t-test, Welch corrected). SDLNN was able to correctly classify 110 out of 129 photomicrographs of the dataset using DAB panels only, with a classification accuracy of 85.3% (95%CI 78.1–90.3%) and the area under the curve of 94.3%. Conclusion: D-HScore and SDLNN revealed that BGN protein expression is reduced in breast cancer tissue, compared to normal tissue. The use of SDLNN seems to be a potential tool for image analysis in histological samples.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Embedding formalism' for particular source types:
Journal articles
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