_id stringlengths 36 36 | text stringlengths 5 665k | marker stringlengths 3 6 | marker_offsets list | label stringlengths 28 32 |
|---|---|---|---|---|
736125ad-44a9-4af5-8450-d588e6c6b63b | On this basis, Eq. 1 is false because it implies two contradictory statements. How can there be an event at \(t_1\) if S can, before \(t_2\) , physically reverse it as if it never happened? Ref. [1]} is correct: a reversible measurement is a contradiction. The von Neumann amplification chain of Eq. 1, on which the in-... | [1] | [
[
196,
199
]
] | https://openalex.org/W3142343317 |
67c5b681-3ee2-47c1-8fed-30c96fb2b544 | A large part of the (vast) literature on metric dimension reduction focuses on showing that a typical low-rank linear operator chosen randomly from a specific ensemble acts as an approximate isometry on a given set \({S}\) with high probability. For subsets \({S}\) of Euclidean space, this principle has been confirme... | [1] | [
[
345,
348
]
] | https://openalex.org/W2979473749 |
4cada0b3-94d2-48bf-90e2-8fe5f893d7ad | A large part of the (vast) literature on metric dimension reduction focuses on showing that a typical low-rank linear operator chosen randomly from a specific ensemble acts as an approximate isometry on a given set \({S}\) with high probability. For subsets \({S}\) of Euclidean space, this principle has been confirme... | [13] | [
[
469,
473
]
] | https://openalex.org/W2288884963 |
e73339d7-7f45-4b73-ba47-2e77ed4a255a | Sign language recognition is a task taking the visual content performed by sign language signers to produce the associated glosses.
Early studies on SLR focused on recognizing isolated signs or gestures to produce word-level or phrase-level outputs, which followed a pattern recognition pipeline: various hand-crafted vi... | [8] | [
[
1119,
1122
]
] | https://openalex.org/W2188882108 |
407595e5-0f1a-4b94-8af6-57c5268e4caf | Sign language recognition is a task taking the visual content performed by sign language signers to produce the associated glosses.
Early studies on SLR focused on recognizing isolated signs or gestures to produce word-level or phrase-level outputs, which followed a pattern recognition pipeline: various hand-crafted vi... | [13] | [
[
1394,
1398
]
] | https://openalex.org/W2463640844 |
f8c54597-a553-4271-ae5c-452456ae5e51 | Sign language recognition is a task taking the visual content performed by sign language signers to produce the associated glosses.
Early studies on SLR focused on recognizing isolated signs or gestures to produce word-level or phrase-level outputs, which followed a pattern recognition pipeline: various hand-crafted vi... | [16] | [
[
1415,
1419
]
] | https://openalex.org/W2997931247 |
b76fd16f-0fc9-4c6e-a86f-336b216cfe14 | Although there have been impressive SLR results, the gap between glosses and spoken language sentences still exist. To address this problem, sign language translation has been studied to take the rich grammatical structures in spoken languages into consideration. It aims to generate spoken language sentences rather tha... | [2] | [
[
367,
370
]
] | https://openalex.org/W2799020610 |
7383f1e4-b8a1-4035-babf-ba02c7c981d5 | Although there have been impressive SLR results, the gap between glosses and spoken language sentences still exist. To address this problem, sign language translation has been studied to take the rich grammatical structures in spoken languages into consideration. It aims to generate spoken language sentences rather tha... | [3] | [
[
394,
397
]
] | https://openalex.org/W2954798773 |
ce9b139c-7006-466e-bda8-7045d6a3e972 | Although there have been impressive SLR results, the gap between glosses and spoken language sentences still exist. To address this problem, sign language translation has been studied to take the rich grammatical structures in spoken languages into consideration. It aims to generate spoken language sentences rather tha... | [4] | [
[
574,
577
]
] | https://openalex.org/W3114337930 |
c89d4d80-0b4b-442c-953b-80eec3921f07 | A high-level graph characterizes the spatio-temporal relationships between the three key regions of a human body in video frames.
That is, a high-level graph can be constructed with three vertices which denote facial region, left-hand region, and right-hand region, respectively.
The three key regions can be obtained by... | [1] | [
[
361,
364
]
] | https://openalex.org/W3014641072 |
1d9e0889-f90c-4fa9-a496-eece11142c5f | The proposed method was evaluated on two widely used benchmark sources: PHOENIX-2014, PHOENIX-2014-T [1]} and Chinese Sign Language Recognition (CSL) [2]}, [3]}, [4]}.
PHOENIX-2014 contains videos from PHOENIX TV station, which includes the weather forecast content featured with signers over a period of three years. Th... | [1] | [
[
101,
104
]
] | https://openalex.org/W2759302818 |
cb726154-ab49-4805-a3e9-f9dbc77b327b | To demonstrate the effectiveness of the proposed method, a number of recently proposed methods were compared as shown in Table REF : iterative alignment network (IAN) [1]}, which adopts an iterative alignment network to reduce the gap between videos and generated glosses, enabling a better correspondence between glosse... | [1] | [
[
167,
170
]
] | https://openalex.org/W2948139159 |
915fb1d5-d5ca-45dc-99b8-f9330775805d | To demonstrate the effectiveness of the proposed method, a number of recently proposed methods were compared as shown in Table REF : iterative alignment network (IAN) [1]}, which adopts an iterative alignment network to reduce the gap between videos and generated glosses, enabling a better correspondence between glosse... | [6] | [
[
935,
938
]
] | https://openalex.org/W2788334925 |
8180e8b3-e23d-4d70-921d-90f7a32c36de | The interfoamsolver has been validated in previous studies [1]}, and it showed nice agreement in tracking interfaces for highly inertial flows and surface-tension-driven capillary flows. Standard tests showed that the CSF formulation in interfoamled to a proper discrete balance between pressure and surface tension [1]}... | [1] | [
[
59,
62
],
[
316,
319
]
] | https://openalex.org/W1973206369 |
98737d65-7eb3-4a3c-9c34-b55078baf934 | Although details are not presented here, we independently performed validation studies to assess the quantitative predictive ability of the interfoamsolver on two-phase problems with oscillating liquid-gas interfaces. We evaluated extensive simulation results from interfoamagainst reference solutions in canonical multi... | [2] | [
[
417,
420
],
[
867,
870
]
] | https://openalex.org/W2037356874 |
15494c25-c4be-4556-969c-26c0928468bd | Although details are not presented here, we independently performed validation studies to assess the quantitative predictive ability of the interfoamsolver on two-phase problems with oscillating liquid-gas interfaces. We evaluated extensive simulation results from interfoamagainst reference solutions in canonical multi... | [4] | [
[
429,
432
],
[
873,
876
]
] | https://openalex.org/W1982595563 |
4a3744ec-2303-445b-8438-2c10a68ececd | This rest of the paper is organized as follows. The system model is described in Sec. II. Then in Sec. III we propose two fast optimal time allocation algorithms for the sum-throughput maximization and the min-throughput maximization, respectively. Sec. IV presents the simulation results for comparison with the algorit... | [1] | [
[
326,
329
]
] | https://openalex.org/W2094000142 |
924a805e-b494-4b44-b442-45125088dbef | The first term in Eq. (REF ) corresponds to the so-called tadpole (reducible) contribution explored in numerous studies (see, e.g., Refs. [1]}, [2]}, [3]}, [4]}, [5]}, [6]}, [7]}, [8]}, [9]}, [10]}, [11]}, [12]}). It predicts emission of photons similar to those constituting the external field or higher harmonics. The ... | [3] | [
[
150,
153
]
] | https://openalex.org/W1584972625 |
2600d80e-6237-49f6-ba9a-223b5d0a2c36 | Computing now the number of pairs (REF ), we will identify the threshold value of the field amplitude \(E_0\) depending on \(\tau \) by the condition \(N^{(\text{pairs})} = 10\) . Finally, we point out that the expression (REF ) is quite universal with respect to the choice of the temporal profile of the external fie... | [1] | [
[
534,
537
]
] | https://openalex.org/W3205166059 |
937f908c-34ed-413f-9b3c-61a3441c70f2 | It follows from the previous equation that the temporal factor of the ponderomotive force is nonzero only when we consider the effects of the temperature in the dielectric tensor [1]} . Hence, the temporal term of the Washimi and Karpman ponderomotive force for unmagnetized plasmas is a thermal effect. Figure REF show... | [1] | [
[
179,
182
]
] | https://openalex.org/W3016053968 |
bc997727-aeb9-4483-bf19-ed13a2a3e971 | where we have written them in terms of an orthonormal
basis \(\left|{x}\right\rangle \) and \(\left|{y}\right\rangle \) of a two dimensional Hilbert
space and an angle \(\theta \) between them.
Let us denote the overlap between them as \(\langle {\psi _0}|{\psi _1}\rangle =\cos 2\theta =:c\) .
We use a three outcome... | [1] | [
[
378,
381
]
] | https://openalex.org/W2041907204 |
c6596492-f39f-49ea-8b91-633b0259a79c | The reason of the simple substitution on Eq. (REF ) is that the global
performance of the unambiguous protocol is achieved by an online strategy [1]}.
The online strategy is to apply an unambiguous POVM for each available copy.
Being an unambiguous measurement then the probability of success with \(N\)
copies coincide... | [1] | [
[
145,
148
]
] | https://openalex.org/W3108274925 |
894e7e7d-2da5-458f-bb26-1110d7a6be56 | Now we can ask for collective measurements. Returning to our original question: Bob has \(N\) copies of pure states
and makes collective measurements such that he has \(N_0=N/l\) chunks of \(l\) copies. Bob uses an
ordering given by a function \(f:{N}\rightarrow {N}\) that for our purposes can be any function that ... | [1] | [
[
662,
665
]
] | https://openalex.org/W1963779635 |
8cf7e069-0623-479b-81cb-bb48010f0719 |
By Chen's theory of iterated integrals (see e.g., [1]}) we know that
AMMVs must satisfy the integral shuffle relations. For example,
\(&M(\check{\bar{1}})M(\check{\bar{2}})=M_{-1}^{\operatorname{od}}(1)M_{-1}^{\operatorname{od}}(2)\\=&\displaystyle \int _{0}^{1} w_{-1}^{-1} \displaystyle \int _{0}^{1} w_0w_{-1}^{-1}=\... | [1] | [
[
51,
54
]
] | https://openalex.org/W4230781866 |
d033ae73-778a-4f3e-bb48-d75bcf3fd9a4 | The proof is the same as that for the corresponding results of MMVs. See [1]}.
| [1] | [
[
73,
76
]
] | https://openalex.org/W3082022163 |
5f9cf838-6533-4e34-bf37-8ba2f73af7c9 | In [1]}, Flajolet and Salvy used residue computations on large circular contour and specific functions to obtain more independent relations for Euler sums. These functions are of the form \(\xi (s)r(s)\) , where \(r(s):=1/{s^q}\) and \(\xi (s)\) is a product of cotangent (or cosecant) and polygamma function. Applying... | [1] | [
[
3,
6
]
] | https://openalex.org/W2083779556 |
c4709049-da7a-4c0c-81b7-e6269a57d0d6 | For each weight \(w\) , we let \({\bf MB}_w\) be the conjectural basis of \(\mathbb {Q}\) -vector space generated by all AMMVs of weight \(w\) . Using Au's Mathematica package [1]}, [2]}, we obtain
\(&{\bf MB}_1=\lbrace \pi ,\log (2)\rbrace ,\\&{\bf MB}_2=\lbrace G,\pi ^2,\pi \log (2),\log ^2(2)\rbrace ,\\&{\bf MB}_3=... | [1] | [
[
177,
180
]
] | https://openalex.org/W3041180731 |
59969008-8cd2-491d-82d6-b341c1d4a314 | In this section, we briefly review end-to-end trainable Bilinear pooling (BP) [1]}.
This method extracts representations from the same image with two CNNs and computes the cross-covariance as representation.
This representation outperforms its first-order version and other second-order representations such as Fisher Ve... | [2] | [
[
326,
329
]
] | https://openalex.org/W1606858007 |
0e928f42-b40e-4723-9fb8-fe47bc0bd9b1 | In this section, we compare our method to the state-of-the-art on 3 retrieval datasets: Stanford Online Products [1]}, CUB-200-2011 [2]} and Cars-196 [3]}.
For Stanford Online Products and CUB-200-2011, we use the same train/test split as [1]}.
For Cars-196, we use the same as [5]}.
We report the standard recall@K with... | [1] | [
[
113,
116
],
[
239,
242
]
] | https://openalex.org/W2963026686 |
ddacac0e-0a02-4ab3-b2bb-fe386b26783d | Li and Panigrahi [1]} gave an algorithm for finding exact
isolating cuts using \(O(\log n)\) max-flow/mincut computations that crucially relies
on the uncrossing property of mincuts. This property ensures
that if we take a minimum isolating cut \(X\) containing a terminal
vertex \(s\) and a crossing mincut \(Y\) , t... | [1] | [
[
17,
20
]
] | https://openalex.org/W3129188913 |
858d4662-a884-4e91-b5eb-9184a8fd3c42 | The more complicated application of approximate isolating
cuts is the approximate Gomory-Hu tree problem. In the recursive algorithm of Li and Panigrahi [1]}, it is crucial to ensure that
the approximation is one-sided in the sense that
the “large” recursive subproblem preserves mincut
values exactly. But, in general,
... | [1] | [
[
153,
156
]
] | https://openalex.org/W3170659189 |
4110044f-5517-47fd-92fd-2f952bb45449 | When we want to argue that flow \(f\) \(\epsilon \) -satsifies a source
function \(\Delta \) , it can be inconvenient to ensure that \(|\Delta ^{f}(S)|\le \epsilon \cdot \delta (S)\)
for all \(S\subseteq V\) because there are exponentially many sets.
Surprisingly, there is a collection \(\mathcal {S}\) of linearly ... | [2] | [
[
626,
629
]
] | https://openalex.org/W4307609184 |
8e75c235-fdeb-48f6-9795-4f90422a9000 | The second approach uses the current graph technique. Within this method, it was provided the first exponential lower bound (of type \(2^{dv}\) ) on the number of non-isomorphic face 2-colorable triangular embeddings of \(K_v\) for infinitely many values of \(v\) . Then, similar results have been also given in the cas... | [3] | [
[
377,
380
]
] | https://openalex.org/W2023344889 |
02c76d2c-ee56-4772-84a1-f425e14770d2 | An \(m\times n\) partially filled (p.f., for short) array on a given set \(\Omega \) is an \(m\times n\) matrix with elements in \(\Omega \)
in which some cells can be empty. Archdeacon [1]} introduced a class of p.f. arrays, called Heffter arrays, and showed how it is related to several other mathematical concepts... | [1] | [
[
190,
193
]
] | https://openalex.org/W2963868215 |
e6b2e4a6-b467-4bdc-a706-f71f635a6feb | Reasoning as in [1]}, we get the following.
| [1] | [
[
16,
19
]
] | https://openalex.org/W3034195266 |
616184ad-dab5-4012-96f4-86573531150f | The Crazy Knight's Tour Problem for a given array \(A\) is denoted by \(P(A)\) , known results can be found in [1]}.
Also, given a filled cell \((i,j)\) , if \(L_{\mathcal {R},\mathcal {C}}(i,j)\) covers all the filled positions of \(A\) we will
say that \((\mathcal {R},\mathcal {C})\) is a solution of \(P(A)\) .
T... | [1] | [
[
112,
115
]
] | https://openalex.org/W3134379180 |
d9b68799-f47a-434e-af66-917a84522755 | We consider now the family of embeddings of \(K_v\) obtained by Cavenagh, Donovan, and Yazıcı in [1]}. In their constructions, all the face boundaries are cycles of length \(k\) .
| [1] | [
[
98,
101
]
] | https://openalex.org/W3090730147 |
13d89151-3bb6-449d-b46a-701feed00561 | (1)
\(t\in \lbrace 1,2\rbrace \) and \(k\equiv 0\pmod {4}\) [1]}, [2]};
(2)
\(t\in \lbrace 1,2\rbrace \) , \(k\equiv 1\pmod {4}\) and \(n\equiv 3\pmod {4}\) [3]}, [4]};
(3)
\(t\in \lbrace 1,2\rbrace \) , \(k\equiv 3\pmod {4}\) and \(n\equiv 0,1\pmod {4}\) [1]};
(4)
\(t=k\) , \(k\equiv 1\pmod {4}\) and \(n\equiv ... | [3] | [
[
161,
164
]
] | https://openalex.org/W2755624844 |
6f30262e-f312-43a3-ae96-a6bdc2eda6b0 | The second class of techniques are overlay-based set visualizations.
Here, all the elements are explicitly shown at pre-defined positions in the plane, which could represent geolocations in spatial datasets or positions of nodes in a node-link diagram of underlying network data.
The techniques create visual overlays th... | [2] | [
[
624,
627
]
] | https://openalex.org/W2159205441 |
38c0f828-7c50-49b4-bc75-158233373b45 | Visualizations based on bipartite graphs represent elements and sets as two types of vertices.
Each element is connected by an edge to all sets containing that element, which yields a bipartite graph.
General visualization techniques for (bipartite) graphs can then be employed and have been integrated in several system... | [5] | [
[
487,
490
]
] | https://openalex.org/W2180041965 |
cca408c8-99db-45dc-a027-e88122dfd40c | The archetypal analysis formulation we consider adds a constraint
and forces the endmembers to be convex combinations of the pixels present in
\(\mathbf {X}\) . Formally, it simply means that there exists a
matrix \(\mathbf {B}\) in \(\mathbb {R}^{N \times p}\) such that \(\mathbf {E}= \mathbf {X}\mathbf {B}\) and t... | [1] | [
[
494,
497
]
] | https://openalex.org/W4253763636 |
69308d7f-c6ba-4b62-84e6-778ed671b2c5 | We will now see how the negative entropy \(h\) yields
explicit steps that effectively enforce the simplicial constraints.
Indeed, after a short classical calculation (see, for instance [1]}),
it is possible to show that the update (REF ) is equivalent to the
following one: for all \(j\) in \(\lbrace 1, \ldots , d\rbr... | [1] | [
[
186,
189
]
] | https://openalex.org/W2016384870 |
1c8de755-e50e-4343-8c97-d1f13157a160 | In this section, we introduce the developed dataset and compare pre-trained language models [1]}, [2]} on our dataset DocBank-TB to understand the extent to which table caption can be generated automatically.
Specifically, we compared the table parts to be used,
and retrieval methods to find relevant sentences
by the c... | [1] | [
[
92,
95
]
] | https://openalex.org/W3082274269 |
8903cc70-0426-4d5a-8525-6fcbdfa4e6c6 | In this work, we propose a fine-tuning technique, Custom Diffusion for text-to-image diffusion models. Our method is computationally and memory efficient. To overcome the above-mentioned challenges, we identify a small subset of model weights, namely the key and value mapping from text to latent features in the cross-a... | [1] | [
[
336,
339
]
] | https://openalex.org/W2963403868 |
c538cf62-0205-4324-b190-9da0f34cf8f4 | Deep generative models Generative models aim to synthesize samples from a data distribution, given a set of training examples. These include GANs [1]}, [2]}, [3]}, VAEs [4]}, auto-regressive [5]}, [6]}, [7]}, flow-based [8]}, [9]}, and diffusion models [10]}, [11]}, [12]}. To improve controllability, these models can... | [10] | [
[
255,
259
]
] | https://openalex.org/W3036167779 |
1ce5eaca-b46f-420d-843b-32cb23c5ce70 | Deep generative models Generative models aim to synthesize samples from a data distribution, given a set of training examples. These include GANs [1]}, [2]}, [3]}, VAEs [4]}, auto-regressive [5]}, [6]}, [7]}, flow-based [8]}, [9]}, and diffusion models [10]}, [11]}, [12]}. To improve controllability, these models can... | [29] | [
[
582,
586
]
] | https://openalex.org/W1797268635 |
f43d0376-9850-4251-bf5a-90940a9a5073 | Deep generative models Generative models aim to synthesize samples from a data distribution, given a set of training examples. These include GANs [1]}, [2]}, [3]}, VAEs [4]}, auto-regressive [5]}, [6]}, [7]}, flow-based [8]}, [9]}, and diffusion models [10]}, [11]}, [12]}. To improve controllability, these models can... | [30] | [
[
589,
593
]
] | https://openalex.org/W1861492603 |
d5eee6d9-15f5-4910-851d-6b1fb5f25121 | Adapting text-to-image models. Similar to our goals, two concurrent works, DreamBooth [1]} and Textual Inversion [2]}, adopt transfer learning to text-to-image diffusion models [3]}, [4]} via either fine-tuning all the parameters [1]} or introducing and optimizing a word vector [2]} for the new concept. Our work diff... | [3] | [
[
179,
182
]
] | https://openalex.org/W4281485151 |
2a256fd0-eb6e-425f-be56-d3967d25fae1 | Adapting text-to-image models. Similar to our goals, two concurrent works, DreamBooth [1]} and Textual Inversion [2]}, adopt transfer learning to text-to-image diffusion models [3]}, [4]} via either fine-tuning all the parameters [1]} or introducing and optimizing a word vector [2]} for the new concept. Our work diff... | [4] | [
[
185,
188
]
] | https://openalex.org/W4226317937 |
d84017fe-b3ab-4ece-9753-13e52cf7d664 | Regularization dataset.
Fine-tuning on the target concept and text caption pair can lead to the issue of language drift [1]}, [2]}. For example, training on “moongate” will lead to the model forgetting the association of “moon” and “gate” with their previously trained visual concepts, as shown in Figure REF . Similar... | [4] | [
[
685,
688
]
] | https://openalex.org/W3135367836 |
91955f1e-60b4-4d57-8f7b-07c055745a5b | Baselines.
We compare our method with the two concurrent works, DreamBooth [1]} (third-party implementation [2]}) and Textual Inversion [3]}. DreamBooth fine-tunes all the parameters in the diffusion model, keeping the text transformer frozen, and uses generated images as the regularization dataset. Each target conce... | [3] | [
[
138,
141
]
] | https://openalex.org/W4289785095 |
8e2554d3-a09f-4f13-9436-3bb0fb00ca14 | Quantitative evaluation.
We evaluate on 20 text prompts and 50 samples per prompt for each dataset, resulting in a total of 1000 generated images. We use DDPM sampling with 50 steps and a classifier-free guidance scale of 6 across all methods. As shown in Figure REF , our method outperforms the concurrent methods [1]... | [1] | [
[
317,
320
]
] | https://openalex.org/W4293342478 |
01f4d80a-4d64-4fc7-855c-9c217aabb329 |
We propose a new FL algorithm with only assumption of strongly convex and smooth loss functions, named FEDL. The crux of FEDL is a new local surrogate function, which is designed for each UE to solve its local problem approximately up to a local accuracy level \(\theta \) , and is characterized by a hyper-learning rat... | [1] | [
[
784,
787
]
] | https://openalex.org/W2541884796 |
338fd3f1-9bb6-4861-bb9a-698471d973cd | The first approach is based on de facto algorithm SGD with a fixed number of local iterations on each device [1]}. Despite its feasibility, these studies still have limitations as lacking the convergence analysis. The work in [2]}, on the other hand, used GD and additional assumptions on Lipschitz local functions and b... | [2] | [
[
226,
229
]
] | https://openalex.org/W2963318081 |
336a89c0-829d-4b93-a828-bc7fb693b33f |
The convergence of FEDL can always be obtained by setting sufficiently small values of both \(\eta \) and \(\theta \in (0, 1)\) such that \(\Theta \in (0,1)\) . While the denominator of (REF ) is greater than 2, its numerator can be rewritten as \(2 \eta (A - B)\) , where \(A = 2(\theta -1)^2- (\theta +1)\theta (3\e... | [1] | [
[
1223,
1226
]
] | https://openalex.org/W2962741697 |
8ae2a4a5-8741-43a5-b43a-7aba5f1cbb11 | Minimize both UEs' energy consumption and the FL time are conflicting. For example, the UEs can save the energy by setting the lowest frequency level all the time, but this will certainly increase the training time. Therefore, to strike the balance between energy cost and training time, the weight \(\kappa \) (Joules/... | [1] | [
[
800,
803
]
] | https://openalex.org/W2296319761 |
69005716-9bca-4d2b-8713-babbecac7364 | Most recently, there have been some other approaches particularly designed to solve state classification challenge [1]}, [2]}, [3]}, [4]}. These models are based on pretrained models like VGG[5]}, ResNet[6]}, Inception network [7]}. The current state recognition challenge requires to classify the states without using a... | [5] | [
[
191,
194
]
] | https://openalex.org/W1686810756 |
d8ffa33d-0fe6-4d1a-8dcc-ea33a81a3358 | Most recently, there have been some other approaches particularly designed to solve state classification challenge [1]}, [2]}, [3]}, [4]}. These models are based on pretrained models like VGG[5]}, ResNet[6]}, Inception network [7]}. The current state recognition challenge requires to classify the states without using a... | [7] | [
[
227,
230
]
] | https://openalex.org/W2097117768 |
7f07dc70-7608-4005-8a60-4aca7eefbd85 | Image generation in various forms has been a long quest in the vision community, not only for its practical use and aesthetic value, but also for assessing our model's ability to disentangle and exploit different aspects of image variability. Separating content and style in image generation dates back to the seminar wo... | [3] | [
[
521,
524
]
] | https://openalex.org/W1959608418 |
6d15160c-6938-4a9c-9a84-1cd7d1acb506 | Generative Adversarial Networks. Generative Adversarial Networks [1]} have achieved impressive performance in lots of computer vision tasks [2]}, [3]}, [4]}, [5]}, [6]}, [7]}, [8]}, [9]}. StyleGAN [10]} proposed an alternative generator architecture for generative adversarial networks, borrowing from style transfer lit... | [4] | [
[
152,
155
],
[
1112,
1115
]
] | https://openalex.org/W2963073614 |
fb5f9e57-ab10-4a7e-8ae1-add74f12f506 | Generative Adversarial Networks. Generative Adversarial Networks [1]} have achieved impressive performance in lots of computer vision tasks [2]}, [3]}, [4]}, [5]}, [6]}, [7]}, [8]}, [9]}. StyleGAN [10]} proposed an alternative generator architecture for generative adversarial networks, borrowing from style transfer lit... | [17] | [
[
1775,
1779
]
] | https://openalex.org/W2962754210 |
2f3357f0-52bd-4baf-b3fa-145f0d00471e | Control for image generation. Many approaches [1]}, [2]}, [3]}, [4]}, [5]} exploit the inherent disentanglement properties of GAN latent space to control the generated images. InfoGAN [6]} maximizes the mutual information between the observation and a subset of the latent variables. InfoGAN successfully disentangles wr... | [10] | [
[
582,
586
],
[
895,
899
]
] | https://openalex.org/W3120777408 |
2df5e90f-897e-4a4e-8ccc-5e8083391a53 | Overview. We start by creating an embedding of the training images that reflects their continuously varying artistic style. Vectors in the style embedding space (that we call style vectors) are subsequently used in the image generator and the extended projection discriminator [1]} that we use to help training. To be mo... | [2] | [
[
389,
392
]
] | https://openalex.org/W2962770929 |
e0208484-5a33-414a-b822-debe9e59dd65 | Overview. We start by creating an embedding of the training images that reflects their continuously varying artistic style. Vectors in the style embedding space (that we call style vectors) are subsequently used in the image generator and the extended projection discriminator [1]} that we use to help training. To be mo... | [3] | [
[
395,
398
]
] | https://openalex.org/W3035574324 |
1e7cae02-25aa-449b-9dc4-8b037ec21e94 | We hope to embed original artwork examples into a continuous style space which reflects their slightly varying artistic style. The Gram matrix has been widely used to extract style information from images [1]}, [2]}, it consists of the correlations between different filter responses. We use VGG-19 CNN architecture pre-... | [2] | [
[
211,
214
]
] | https://openalex.org/W2475287302 |
9cdcf903-2adb-4ef3-95c0-fae42cc11bb6 | One of the basic building block of a generator \(G\) is the adaptive instance normalization (AdaIN) module [1]} defined as:
\(\mathbf {AdaIN}(\mathbf {f}, \gamma , \beta ) = \gamma (\frac{\mathbf {f}-\mu (\mathbf {f})}{\sigma (\mathbf {f})})+\beta \)
| [1] | [
[
108,
111
]
] | https://openalex.org/W2603777577 |
9af9fba3-f809-48fa-91a2-8428403b54bc |
Metfaces [1]} with 1,336 high-quality \(1024 \times 1024\) artistic faces collected from Metropolitan Museum of Art.
Selfie2anime with 3,400 anime images for training, with an image size of \(256 \times 256\) . For this dataset we follow the same experimental setting as in UGATIT [2]}.
We also collected our own ext... | [1] | [
[
10,
13
]
] | https://openalex.org/W3104876213 |
5640c5a5-e2a7-4f32-91d4-112763c39d68 | This example generalizes, recovering a result of [1]} about theta functions of monomial curves.
| [1] | [
[
49,
52
]
] | https://openalex.org/W1983011652 |
c065b82d-d30d-4af8-af09-19b367a33b13 | Conversely, suppose that \(\Lambda _C=0\) . Then it must be that \(\Lambda _{\widetilde{C}}=0\) as well. Since \(\widetilde{C}\) is a smooth curve, this implies that it is a union of projective lines, hence every component of \(C\) is rational.
Hence, \(\operatorname{Jac}(\widetilde{C})=0\) and then [1]} shows that... | [1] | [
[
305,
308
],
[
464,
467
]
] | https://openalex.org/W4234505739 |
195658c1-2392-42c4-97b8-8a5ae7e6573a | Values for the hyperparameters were obtained from preliminary experiments by evaluating the model performance on the development sets.
Concretely, all neural and hybrid models used the same \(D_m = 300\) -dimensional word embeddings, the hidden-size of the LSTM was set to \(D_h = 100\) , the hidden-layer size of the at... | [1] | [
[
469,
472
]
] | https://openalex.org/W2964121744 |
d858f7a0-b3d8-4031-b9ed-6f4ac0313553 | In this work, we focus on the form of collision term for dense gases and consider only spinless particles, whcih is free from the complexity of handling spinor calculations. The Wigner function for spin-0 particles is defined as
[1]},
\(W(x,p)=4\pi \int \frac{d^4y}{(2\pi \hbar )^5} e^{-\frac{i}{\hbar }p\cdot y}\left\la... | [1] | [
[
229,
232
]
] | https://openalex.org/W659068132 |
e375f6b5-3f16-42b9-8f6e-e8481564e051 | In ANN, deep learning uses a cascade of multiple layers for feature extraction [1]}. Convolutional neural networks (CNNs) are specific deep learning architecture that enhances state-of-the-art performance for various image tasks, such as classification, object detection, and pattern recognition [2]}. A CNN consists of ... | [1] | [
[
79,
82
]
] | https://openalex.org/W2919115771 |
d29958db-3bf8-4135-9121-9c6776cde8b8 | In this report, the Hadamard method is used instead of convolution to extract the features in the images. The CNNs using the Hadamard method are implemented to show the effect of reduced energy consumption. In single-layer and three-layer CNNs, the performance of the Hadamard method is compared with convolution for MNI... | [2] | [
[
340,
343
]
] | https://openalex.org/W3118608800 |
32fc8ae3-e551-467a-919b-ea8979b9dbfb | Neutron stars are on the one side a challenge requiring to understand their properties i.e mass, radius, tidal deformability, structure etc. On the other hand, they can provide information about the dense, strongly interacting matter in a region of the phase diagram that is inaccessible to terrestrial experiments [1]},... | [3] | [
[
327,
330
]
] | https://openalex.org/W4246383199 |
ec0a69f3-20dd-4815-8326-c9214524d199 | The atomic neural networks are able to describe the complex relation between the atomic energies and the local chemical environments of the atoms. These environments are described by vectors of many-body atom-centered symmetry functions (ACSF)[1]} \(\mathbf {G}_n^\alpha \) serving as structural fingerprints of the loc... | [5] | [
[
1286,
1289
]
] | https://openalex.org/W3141927472 |
a9b72e8a-43cd-4e24-a2f3-953d93f8a7da | For the generation of the reference data the local hybrid exchange-correlation functional PBE0r[1]}, [2]} including D3 dispersion corrections[3]}, [4]} was used in collinar spin-polarized DFT calculations. PBE0r considers only on-site Hartree-Fock exchange terms yielding an accurate description of the partially filled ... | [9] | [
[
644,
647
]
] | https://openalex.org/W3039309865 |
14415ab5-b7c7-45d2-85d3-9bf022a1de9d | The HDNNP and HDNNS were constructed using the RuNNer code (versions from October 19, 2020 and December 4, 2018, respectively).[1]}, [2]}, [3]} The architecture of the atomic neural networks is 180-25-20-15-1 for all elements in the HDNNP and 180-20-15-10-1 for Mn in the HDNNS, which is the only spin-polarized atom in ... | [1] | [
[
127,
130
]
] | https://openalex.org/W2055526416 |
054d3f22-4f3c-4694-b5dd-e6850ec23d5e | The HDNNP and HDNNS were constructed using the RuNNer code (versions from October 19, 2020 and December 4, 2018, respectively).[1]}, [2]}, [3]} The architecture of the atomic neural networks is 180-25-20-15-1 for all elements in the HDNNP and 180-20-15-10-1 for Mn in the HDNNS, which is the only spin-polarized atom in ... | [2] | [
[
133,
136
]
] | https://openalex.org/W2746244909 |
08090bfa-aa57-46e7-b510-7e44c81e3689 | To assess the impact of the interface on the properties of the liquid, the system has to be sufficiently large to ensure the presence of a bulk-like region in the center of the liquid phase. This bulk-like region is not only important for comparing interfacial properties to those of the bulk, but also to obtain converg... | [6] | [
[
1636,
1639
]
] | https://openalex.org/W2900475422 |
2cc9b9f9-b9e9-408b-b4ce-864c025eeff1 | At the \(\lbrace 100\rbrace _\mathrm {Li}\) interface the dominant PT mechanism is the hydroxylation of the solid surface (Figure REF (a)), which has been called “surface PT” in earlier work.[1]}, [2]}, [3]} An O\(^{2-}\) ion from the solid accepts one proton from an H\(_2\) O molecule such that two OH\(^-\) ions a... | [1] | [
[
193,
196
],
[
629,
632
]
] | https://openalex.org/W2600764488 |
e8e2548f-4ed6-4947-bf24-f0bb87923735 | We observe that when \(r=1\) , we obtain the linear case studied in [1]}, [2]}, [3]}. Instead values of \(r\) greater than one are useful both from an analytical and a physical point of view, as the power-type nonlinearity in the pairwise force function resembles a fractional derivative (see for instance [4]}, [5]}), ... | [2] | [
[
74,
77
]
] | https://openalex.org/W1993499036 |
fde67cb0-bc96-4e87-bcf7-ce624b1def27 | On the other hand, the time integration of the model can be done by using explicit forward and backward difference techniques (see [1]}, [2]}, [3]}). The Störmer-Verlet method consists in an explicit central second-order finite difference scheme widely used in elastodynamics and in the context of wave propagation (see ... | [5] | [
[
338,
341
]
] | https://openalex.org/W3089129046 |
748867be-6c67-460c-92f6-621fc45b1189 | On the other hand, the time integration of the model can be done by using explicit forward and backward difference techniques (see [1]}, [2]}, [3]}). The Störmer-Verlet method consists in an explicit central second-order finite difference scheme widely used in elastodynamics and in the context of wave propagation (see ... | [6] | [
[
344,
347
]
] | https://openalex.org/W2962982010 |
206bbce9-cd46-4ca4-9f19-3e75a63ba82a | Lemma 1 (see [1]})
For every real \(0\le \mu \le s\) , there exists a positive constant \(L\) such that
\(\left\Vert u-P_N u \right\Vert _{H_p^{\mu }(V)} \le L N^{\mu -s}\left\Vert u \right\Vert _{H^s_p(V)}, \quad \text{for every $u\in H_p^{s}(V)$}.\)
| [1] | [
[
13,
16
]
] | https://openalex.org/W2031567600 |
d74a8c1f-dd70-4b10-a536-a24e0862a387 | To achieve a computationally
efficient implementationRemark: For the sake of a fast prototyping of algorithms, the proposed
time-stepping scheme is implemented in the high-level programming
tool MATLAB., the matrix polynomial \(\mathbf {Q}\) is factorized such that only
terms linear or quadratic in \(\mathbf {A}\) ne... | [2] | [
[
714,
717
]
] | https://openalex.org/W2550093246 |
122bed9d-4ada-43a4-b502-a6ed4b3946ec | The situation is obviously different when studying high-order accurate
time-stepping methods such as the one proposed in this article. Here,
larger time increments are possible due to the increased accuracy
of the algorithm. Hence, it is in principle possible to apply similar
refinement strategies in both space and tim... | [1] | [
[
1612,
1615
]
] | https://openalex.org/W1573186872 |
ec886f4e-93bb-47bf-9cec-b9366f887c69 | In general we assume a graph \(\mathcal {G} = (\mathcal {V}, \mathcal {E})\) with the set of nodes \(\mathcal {V}\) , \(N = |\mathcal {V}|\) and the set of directed edges \(\mathcal {E} \subseteq \lbrace (i, j) \subseteq \mathcal {V} \rbrace \) .
Moreover, we assume an original node feature matrix \(X \in \operatorna... | [3] | [
[
559,
562
]
] | https://openalex.org/W2970706905 |
8eb0b2ce-a79c-4c9e-8fc5-34d6190c80cf | In general we assume a graph \(\mathcal {G} = (\mathcal {V}, \mathcal {E})\) with the set of nodes \(\mathcal {V}\) , \(N = |\mathcal {V}|\) and the set of directed edges \(\mathcal {E} \subseteq \lbrace (i, j) \subseteq \mathcal {V} \rbrace \) .
Moreover, we assume an original node feature matrix \(X \in \operatorna... | [5] | [
[
583,
586
]
] | https://openalex.org/W2912555327 |
2e04cd49-082b-4b09-9aa4-1c399374fe4c | CVRP For the CVRP we use the recent benchmark dataset of Uchoa et al.[1]} and select all instance up to 300 customer nodes. We define four groups of instances with 100-149 nodes as n100, 150-199 nodes as n150, 200-249 as n200 and 250-299 as n250. We compare against the same meta-heuristics mentioned above and additiona... | [3] | [
[
455,
458
]
] | https://openalex.org/W3098134815 |
b9ba7bd6-e1d8-466c-bb44-a1b3f61f5390 | CVRP For the CVRP we use the recent benchmark dataset of Uchoa et al.[1]} and select all instance up to 300 customer nodes. We define four groups of instances with 100-149 nodes as n100, 150-199 nodes as n150, 200-249 as n200 and 250-299 as n250. We compare against the same meta-heuristics mentioned above and additiona... | [4] | [
[
468,
471
]
] | https://openalex.org/W3203997865 |
05061427-94c2-4892-a1ab-8d22f7b04fcf | For spatiotemporal fields \(\underline{{\rm E}}(\underline{r},t)\) and \(\underline{{\rm B}}(\underline{r},t)\) , the
(real)
local instantaneous AM density with reference to a location \(\underline{r}_0\) is [1]}, [2]}
\(\underline{{\rm M}} (\underline{r}, \underline{r}_0, t) \stackrel{\Delta }{=} (\underline{r} - \u... | [1] | [
[
210,
213
]
] | https://openalex.org/W3039083618 |
19cc9c1c-c7c5-44cd-8376-8cb2e201df77 | For each plane-wave component \(\lbrace \underline{{\cal E}}_i,\underline{{\cal H}}_i,\underline{k}_i\rbrace \) , a TE/TM decomposition is performed with respect to its plane of incidence \(o k_i z\) defining \(\phi _i=0\) [1]}, [2]}.
The incident plus reflected field is aggregated across the angular spectrum by inte... | [2] | [
[
231,
234
],
[
524,
527
]
] | https://openalex.org/W1981596389 |
d9effd9f-27ce-40a4-9593-7851c5d4d809 | because the azimuthal dependence of their kernels are of the form \(\sin \phi \) , \(\cos \phi \) or \(\sin (2\phi )\) , or because \(\langle {\cal E}_{1\phi }{\cal E}^*_{2\theta }\rangle \propto \langle \sin \psi _1 \cos \psi _2 \rangle = 0\) .
From (REF ) and (REF ), with the aid of [1]}, it follows that \(\langle \... | [1] | [
[
287,
290
]
] | https://openalex.org/W2163961553 |
6d1a6556-eef6-4321-a184-8a5090f368e0 | For deterministic fields in vacuum, the conservation of LM density states that [1]}, [2]}
\(\underline{\nabla } \cdot \underline{\underline{T}} - {\rm j}\omega \underline{P} = \underline{0}.\)
| [2] | [
[
85,
88
]
] | https://openalex.org/W1505881492 |
260cfb7f-521d-4d6f-b803-9c9e7df16aa1 | In contrast, the ellipsoid mapping approach recovers all the correct long-time limits by construction, as shown with green and red lines for the global and local constructions, respectively. Because these methods preserve their respective distributions and obey Liouville's theorem, it is possible to obtain converged re... | [1] | [
[
397,
400
]
] | https://openalex.org/W1548618691 |
269f6b66-17e0-4c32-a2f4-0a83db91efa6 | This author has attempted to follow the lead exhibited in two excellent publications, namely a paper by H. Wiseman [1]} and an article by A. Shimony [2]}. Wiseman's paper points out how Bell's thinking evolved over the years, and he analyzes two of his papers in depth, namely [3]} and [4]}. Along the way he creates a c... | [3] | [
[
277,
280
]
] | https://openalex.org/W2135830616 |
0013c806-9bae-40e0-ba32-1d09e9cbba8e | This author has attempted to follow the lead exhibited in two excellent publications, namely a paper by H. Wiseman [1]} and an article by A. Shimony [2]}. Wiseman's paper points out how Bell's thinking evolved over the years, and he analyzes two of his papers in depth, namely [3]} and [4]}. Along the way he creates a c... | [4] | [
[
286,
289
]
] | https://openalex.org/W1595578028 |
39b58ea0-9be6-49e6-8c07-a078c2f61944 | First, an advantage of trees is the possibility to implement a handling strategy for missing values (NA). Several approaches have been introduced (some of them specifically designed for classification trees), for a short overview and comparison see [1]} and references therein. In this work the approach based on so-call... | [2] | [
[
352,
355
]
] | https://openalex.org/W3085162807 |
8b66f0dd-3893-4a9b-8692-cc9b620774a1 | To evaluate the classification performance across all possible classification thresholds \(\tau \) , the respective Receiving Operator Characteristic (ROC, see, for example, [1]}, [2]}) curves are inspected. An ROC curve is obtained by plotting the true positive rate (sensitivity) versus the true negative rate (specifi... | [1] | [
[
174,
177
]
] | https://openalex.org/W1554944419 |
122dad5d-f188-46ea-9557-a9d135c54582 | Baseline REF shows that achieving the social welfare benchmark \(S^*\) requires two ideal conditions.
Condition C1 requires the prior knowledge on the uncertain environment.
Similar condition also appears in the benchmark definition of stochastic MAB [1]}.
Condition C2 relaxes that fact that the agents are selfish.
T... | [1] | [
[
253,
256
]
] | https://openalex.org/W2049934117 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.