Results 1 to 10 of about 2,861,135 (304)
Frontiers in Psychology, 2022
Companies that use online group-buying to get new business expansion opportunities at a price advantage are failing. Therefore, there is a need to develop new marketing strategies for group-buying companies to achieve market share and consumer favor ...
Lu Jiang+4 more
doaj +1 more source
Companies that use online group-buying to get new business expansion opportunities at a price advantage are failing. Therefore, there is a need to develop new marketing strategies for group-buying companies to achieve market share and consumer favor ...
Lu Jiang+4 more
doaj +1 more source
The institution of group and genocidal acts [PDF]
Filozofija i Društvo, 2013This critique is focused on a small theory regarding the constituting of a group through the simultaneous exclusion of some other group. Is it possible, then, to produce social and non-social acts (negative social acts) at the same time?
Bojanić Petar
doaj +1 more source
The weight of cognitions in panic: the link between misinterpretations and panic attacks. [PDF]
PLoS ONE, 2013In cognitive theory it is hypothesized that panic attacks are provoked by catastrophic misinterpretations of bodily sensations. The aim of the present study was to investigate the ability of associated word pairs referring to catastrophic thinking (e.g ...
Klara De Cort+5 more
doaj +1 more source
Comparative Analysis of Using Word Embedding in Deep Learning for Text Classification
Jurnal Riset Informatika, 2023A group of theory-driven computing techniques known as natural language processing (NLP) are used to interpret and represent human discourse automatically.
Mukhamad Rizal Ilham, Arif Dwi Laksito
doaj +1 more source
Sub-Finsler Horofunction Boundaries of the Heisenberg Group
Analysis and Geometry in Metric Spaces, 2021We give a complete analytic and geometric description of the horofunction boundary for polygonal sub-Finsler metrics, that is, those that arise as asymptotic cones of word metrics, on the Heisenberg group.
Fisher Nate, Golo Sebastiano Nicolussi
doaj +1 more source
Combien d’acceptions le mot keuz ‘regret’ a-t-il ?
La Bretagne Linguistique, 2014In this article, we present the criteria for distinguishing the different meanings of a polysemous word. This preliminary differentiation process – or lexemisation – is essential for compiling a description of a word in a dictionary. We use as an example
François Louis, Jasmina Milićević
doaj +1 more source
Communications in Algebra, 2024, 2023
A word $w$ in a free group is {\em achiral} if for every group $G,$ $G_w=G_{w^{-1}},$ where $G_w$ is the image of the word map $w$ on $G.$ We will give few classes of examples of achiral words. Cocke and Ho asked whether Engel words are achiral or not. We will prove that it is enough to apply Whitehead's algorithm to check the same.
arxiv +1 more source
A word $w$ in a free group is {\em achiral} if for every group $G,$ $G_w=G_{w^{-1}},$ where $G_w$ is the image of the word map $w$ on $G.$ We will give few classes of examples of achiral words. Cocke and Ho asked whether Engel words are achiral or not. We will prove that it is enough to apply Whitehead's algorithm to check the same.
arxiv +1 more source
Random Operator Approach for Word Enumeration in Braid Groups [PDF]
, 1997We investigate analytically the problem of enumeration of nonequivalent primitive words in the braid group B_n for n >> 1 by analysing the random word statistics and the target space on the basis of the locally free group approximation.
Alain Comtet+35 more
core +3 more sources
On Schubert calculus in elliptic cohomology [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015An important combinatorial result in equivariant cohomology and $K$-theory Schubert calculus is represented by the formulas of Billey and Graham-Willems for the localization of Schubert classes at torus fixed points.
Cristian Lenart, Kirill Zainoulline
doaj +1 more source
Real Computational Universality: The Word Problem for a class of groups with infinite presentation [PDF]
, 2006The word problem for discrete groups is well-known to be undecidable by a Turing Machine; more precisely, it is reducible both to and from and thus equivalent to the discrete Halting Problem.
Meer, Klaus, Ziegler, Martin
core +4 more sources