id stringlengths 9 10 | submitter stringlengths 1 64 ⌀ | authors stringlengths 4 23.3k | title stringlengths 1 294 | comments stringlengths 1 658 ⌀ | journal-ref stringlengths 1 557 ⌀ | doi stringlengths 10 153 ⌀ | report-no stringlengths 2 479 ⌀ | categories stringlengths 5 102 | license stringclasses 9
values | abstract stringlengths 6 5.09k | versions list | update_date stringlengths 10 10 | authors_parsed sequence | embeddings sequence | paper_title stringlengths 4 229 ⌀ | paper_url_abs stringlengths 32 35 ⌀ | paper_url_pdf stringlengths 36 39 ⌀ | repo_url stringlengths 26 195 ⌀ | is_official bool 2
classes | mentioned_in_paper bool 2
classes | pwc_url stringlengths 40 81 ⌀ | abs_enc sequence |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1401.0240 | Ming-Chang Chen | M.-C. Chen, C. Hern\'andez-Garc\'ia, C. Mancuso, F. Dollar, B.
Galloway, D. Popmintchev, P.-C. Huang, B. Walker, L. Plaja, A. Jaron-Becker,
A. Becker, T. Popmintchev, M. M. Murnane, H. C. Kapteyn | Generation of Bright Isolated Attosecond Soft X-Ray Pulses Driven by
Multi-Cycle Mid-Infrared Lasers | 14 pages, and 4 figures | null | 10.1073/pnas.1407421111 | null | physics.optics physics.atom-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | High harmonic generation driven by femtosecond lasers makes it possible to
capture the fastest dynamics in molecules and materials. However, to date the
shortest attosecond (as) pulses have been produced only in the extreme
ultraviolet (EUV) region of the spectrum below 100 eV, which limits the range
of materials and molecular systems that can be explored. Here we use advanced
experiment and theory to demonstrate a remarkable convergence of physics: when
mid-infrared lasers are used to drive the high harmonic generation process, the
conditions for optimal bright soft X-ray generation naturally coincide with the
generation of isolated attosecond pulses. The temporal window over which phase
matching occurs shrinks rapidly with increasing driving laser wavelength, to
the extent that bright isolated attosecond pulses are the norm for 2 \mu m
driving lasers. Harnessing this realization, we demonstrate the generation of
isolated soft X-ray attosecond pulses at photon energies up to 180 eV for the
first time, that emerge as linearly chirped 300 as pulses with a transform
limit of 35 as. Most surprisingly, we find that in contrast to as pulse
generation in the EUV, long-duration, multi-cycle, driving laser pulses are
required to generate isolated soft X-ray bursts efficiently, to mitigate group
velocity walk-off between the laser and the X-ray fields that otherwise limit
the conversion efficiency. Our work demonstrates a clear and straightforward
approach for robustly generating bright attosecond pulses of electromagnetic
radiation throughout the soft X ray region of the spectrum.
| [
{
"created": "Wed, 1 Jan 2014 01:18:15 GMT",
"version": "v1"
}
] | 2014-07-17 | [
[
"Chen",
"M. -C.",
""
],
[
"Hernández-García",
"C.",
""
],
[
"Mancuso",
"C.",
""
],
[
"Dollar",
"F.",
""
],
[
"Galloway",
"B.",
""
],
[
"Popmintchev",
"D.",
""
],
[
"Huang",
"P. -C.",
""
],
[
"Walker... | [
-0.06035137176513672,
-0.07912968099117279,
-0.03427138179540634,
0.052964579313993454,
0.047834206372499466,
-0.062494080513715744,
0.008900254033505917,
-0.0043813311494886875,
0.00006058514190954156,
-0.015597319230437279,
0.013529208488762379,
-0.042021747678518295,
-0.010398059152066708... | null | null | null | null | null | null | null | [
-0.06035137176513672,
-0.07912968099117279,
-0.03427138179540634,
0.052964579313993454,
0.047834206372499466,
-0.062494080513715744,
0.008900254033505917,
-0.0043813311494886875,
0.00006058514190954156,
-0.015597319230437279,
0.013529208488762379,
-0.042021747678518295,
-0.010398059152066708... |
1401.0242 | Shulabh Gupta | Shulabh Gupta, Li Jun Jiang and Christophe Caloz | Unveiling Magnetic Dipole Radiation in Phase-Reversal Leaky-Wave
Antennas | 4 pages, 3 figures | null | 10.1109/LAWP.2014.2317739 | null | physics.class-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The radiation principle of travelling-wave type phase-reversal antennas is
explained in details, unveiling the presence of magnetic-dipole radiation in
addition to well-known electric dipole radiation. It is point out that such
magnetic dipole radiation is specific to the case of traveling-wave
phase-reversal antennas whereas only electric-dipole radiation exists in
resonant-type phase-reversal antennas. It is shown that a phase-reversal
travelling-wave antenna alternately operates as an array of magnetic dipoles
and an array of electric-dipoles during a time-harmonic period. This radiation
mechanism is confirmed through both full-wave and experimental results.
| [
{
"created": "Wed, 1 Jan 2014 02:15:32 GMT",
"version": "v1"
}
] | 2015-06-18 | [
[
"Gupta",
"Shulabh",
""
],
[
"Jiang",
"Li Jun",
""
],
[
"Caloz",
"Christophe",
""
]
] | [
-0.009691618382930756,
0.017977913841605186,
0.050880033522844315,
-0.0018695612670853734,
-0.05011403188109398,
-0.014457257464528084,
-0.011423768475651741,
-0.0030972054228186607,
-0.059165120124816895,
0.0032544322311878204,
0.018674300983548164,
0.05342647060751915,
0.004595827311277389... | null | null | null | null | null | null | null | [
-0.009691618382930756,
0.017977913841605186,
0.050880033522844315,
-0.0018695612670853734,
-0.05011403188109398,
-0.014457257464528084,
-0.011423768475651741,
-0.0030972054228186607,
-0.059165120124816895,
0.0032544322311878204,
0.018674300983548164,
0.05342647060751915,
0.004595827311277389... |
1401.0245 | Sujit Gath | S.J Gath and R.V Kulkarni | A Review: Expert System for Diagnosis of Myocardial Infarction | 7 pages. arXiv admin note: text overlap with arXiv:1006.4544 by other
authors | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A computer Program Capable of performing at a human-expert level in a narrow
problem domain area is called an expert system. Management of uncertainty is an
intrinsically important issue in the design of expert systems because much of
the information in the knowledge base of a typical expert system is imprecise,
incomplete or not totally reliable. In this paper, the author present s the
review of past work that has been carried out by various researchers based on
development of expert systems for the diagnosis of cardiac disease
| [
{
"created": "Wed, 1 Jan 2014 03:59:22 GMT",
"version": "v1"
}
] | 2014-01-03 | [
[
"Gath",
"S. J",
""
],
[
"Kulkarni",
"R. V",
""
]
] | [
0.016659440472722054,
0.06143384799361229,
-0.022798903286457062,
-0.0024606683291494846,
-0.06840081512928009,
-0.11205565184354782,
0.04632676765322685,
0.11842482537031174,
-0.07236505299806595,
-0.004567162599414587,
-0.028866464272141457,
-0.028357259929180145,
0.13458020985126495,
0.... | null | null | null | null | null | null | null | [
0.016659440472722054,
0.06143384799361229,
-0.022798903286457062,
-0.0024606683291494846,
-0.06840081512928009,
-0.11205565184354782,
0.04632676765322685,
0.11842482537031174,
-0.07236505299806595,
-0.004567162599414587,
-0.028866464272141457,
-0.028357259929180145,
0.13458020985126495,
0.... |
1401.0247 | Yingyu Liang | Maria-Florina Balcan, Yingyu Liang, Pramod Gupta | Robust Hierarchical Clustering | 37 pages | null | null | null | cs.LG cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One of the most widely used techniques for data clustering is agglomerative
clustering. Such algorithms have been long used across many different fields
ranging from computational biology to social sciences to computer vision in
part because their output is easy to interpret. Unfortunately, it is well
known, however, that many of the classic agglomerative clustering algorithms
are not robust to noise. In this paper we propose and analyze a new robust
algorithm for bottom-up agglomerative clustering. We show that our algorithm
can be used to cluster accurately in cases where the data satisfies a number of
natural properties and where the traditional agglomerative algorithms fail. We
also show how to adapt our algorithm to the inductive setting where our given
data is only a small random sample of the entire data set. Experimental
evaluations on synthetic and real world data sets show that our algorithm
achieves better performance than other hierarchical algorithms in the presence
of noise.
| [
{
"created": "Wed, 1 Jan 2014 04:16:21 GMT",
"version": "v1"
},
{
"created": "Sun, 13 Jul 2014 01:51:05 GMT",
"version": "v2"
}
] | 2014-07-15 | [
[
"Balcan",
"Maria-Florina",
""
],
[
"Liang",
"Yingyu",
""
],
[
"Gupta",
"Pramod",
""
]
] | [
-0.06357288360595703,
-0.04720552638173103,
0.05027145892381668,
0.014669502153992653,
0.07136430591344833,
-0.07407565414905548,
0.017979592084884644,
-0.031267017126083374,
0.0005195413250476122,
-0.09129162132740021,
-0.0571073517203331,
-0.056983210146427155,
0.06956258416175842,
0.039... | null | null | null | null | null | null | null | [
-0.06357288360595703,
-0.04720552638173103,
0.05027145892381668,
0.014669502153992653,
0.07136430591344833,
-0.07407565414905548,
0.017979592084884644,
-0.031267017126083374,
0.0005195413250476122,
-0.09129162132740021,
-0.0571073517203331,
-0.056983210146427155,
0.06956258416175842,
0.039... |
1401.0248 | Evgeny Latkin | Evgeny Latkin | Twofold fast summation | All used tests and testing results available at author's Web site:
https://sites.google.com/site/yevgenylatkin/ | null | null | null | cs.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Debugging accumulation of floating-point errors is hard; ideally, computer
should track it automatically. Here we consider twofold approximation of an
exact real with value + error pair of floating-point numbers. Normally, value +
error sum is more accurate than value alone, so error can estimate deviation
between value and its exact target. Fast summation algorithm, that provides
twofold sum of x[1]+...+x[N] or dot product x[1]*y[1]+...+x[N]*y[N], can be
same fast as direct summation sometimes if leveraging processor underused
potential. This way, we can hit three goals: improve precision, track
inaccuracy, and do this with little if any loss in performance.
| [
{
"created": "Wed, 1 Jan 2014 04:25:16 GMT",
"version": "v1"
},
{
"created": "Fri, 3 Jan 2014 03:35:24 GMT",
"version": "v2"
}
] | 2014-01-06 | [
[
"Latkin",
"Evgeny",
""
]
] | [
-0.0654587373137474,
0.008891231380403042,
-0.018005529418587685,
0.017262917011976242,
0.006616770755499601,
-0.09675424546003342,
0.024815041571855545,
0.00598228769376874,
0.00924009457230568,
-0.037930507212877274,
-0.06779972463846207,
-0.06642740964889526,
-0.003635131288319826,
-0.0... | null | null | null | null | null | null | null | [
-0.0654587373137474,
0.008891231380403042,
-0.018005529418587685,
0.017262917011976242,
0.006616770755499601,
-0.09675424546003342,
0.024815041571855545,
0.00598228769376874,
0.00924009457230568,
-0.037930507212877274,
-0.06779972463846207,
-0.06642740964889526,
-0.003635131288319826,
-0.0... |
1401.0255 | Dinesh Govindaraj | Dinesh Govindaraj, Tao Wang, S.V.N. Vishwanathan | Modeling Attractiveness and Multiple Clicks in Sponsored Search Results | null | null | null | null | cs.IR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Click models are an important tool for leveraging user feedback, and are used
by commercial search engines for surfacing relevant search results. However,
existing click models are lacking in two aspects. First, they do not share
information across search results when computing attractiveness. Second, they
assume that users interact with the search results sequentially. Based on our
analysis of the click logs of a commercial search engine, we observe that the
sequential scan assumption does not always hold, especially for sponsored
search results. To overcome the above two limitations, we propose a new click
model. Our key insight is that sharing information across search results helps
in identifying important words or key-phrases which can then be used to
accurately compute attractiveness of a search result. Furthermore, we argue
that the click probability of a position as well as its attractiveness changes
during a user session and depends on the user's past click experience. Our
model seamlessly incorporates the effect of externalities (quality of other
search results displayed in response to a user query), user fatigue, as well as
pre and post-click relevance of a sponsored search result. We propose an
efficient one-pass inference scheme and empirically evaluate the performance of
our model via extensive experiments using the click logs of a large commercial
search engine.
| [
{
"created": "Wed, 1 Jan 2014 06:45:58 GMT",
"version": "v1"
}
] | 2014-01-03 | [
[
"Govindaraj",
"Dinesh",
""
],
[
"Wang",
"Tao",
""
],
[
"Vishwanathan",
"S. V. N.",
""
]
] | [
-0.06816902756690979,
-0.10064908117055893,
-0.014940950088202953,
0.05752754583954811,
0.08422745019197464,
-0.020221568644046783,
0.07780437916517258,
-0.00956487562507391,
0.022087140008807182,
-0.09871090203523636,
-0.06438104808330536,
0.006361921783536673,
0.06580992043018341,
-0.009... | null | null | null | null | null | null | null | [
-0.06816902756690979,
-0.10064908117055893,
-0.014940950088202953,
0.05752754583954811,
0.08422745019197464,
-0.020221568644046783,
0.07780437916517258,
-0.00956487562507391,
0.022087140008807182,
-0.09871090203523636,
-0.06438104808330536,
0.006361921783536673,
0.06580992043018341,
-0.009... |
1401.0260 | Pedro Henrique Juliano Nardelli | Pedro H. J. Nardelli, Nicolas Rubido, Chengwei Wang, Murilo S.
Baptista, Carlos Pomalaza-Raez, Paulo Cardieri, Matti Latva-aho | Models for the modern power grid | Submitted to EPJ-ST Power Grids, May 2015 | null | 10.1140/epjst/e2014-02219-6 | null | cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This article reviews different kinds of models for the electric power grid
that can be used to understand the modern power system, the smart grid. From
the physical network to abstract energy markets, we identify in the literature
different aspects that co-determine the spatio-temporal multilayer dynamics of
power system. We start our review by showing how the generation, transmission
and distribution characteristics of the traditional power grids are already
subject to complex behaviour appearing as a result of the the interplay between
dynamics of the nodes and topology, namely synchronisation and cascade effects.
When dealing with smart grids, the system complexity increases even more: on
top of the physical network of power lines and controllable sources of
electricity, the modernisation brings information networks, renewable
intermittent generation, market liberalisation, prosumers, among other aspects.
In this case, we forecast a dynamical co-evolution of the smart grid and other
kind of networked systems that cannot be understood isolated. This review
compiles recent results that model electric power grids as complex systems,
going beyond pure technological aspects. From this perspective, we then
indicate possible ways to incorporate the diverse co-evolving systems into the
smart grid model using, for example, network theory and multi-agent simulation.
| [
{
"created": "Wed, 1 Jan 2014 07:14:36 GMT",
"version": "v1"
},
{
"created": "Mon, 14 Apr 2014 13:48:28 GMT",
"version": "v2"
},
{
"created": "Thu, 8 May 2014 06:43:43 GMT",
"version": "v3"
},
{
"created": "Mon, 16 Jun 2014 07:41:15 GMT",
"version": "v4"
}
] | 2015-06-18 | [
[
"Nardelli",
"Pedro H. J.",
""
],
[
"Rubido",
"Nicolas",
""
],
[
"Wang",
"Chengwei",
""
],
[
"Baptista",
"Murilo S.",
""
],
[
"Pomalaza-Raez",
"Carlos",
""
],
[
"Cardieri",
"Paulo",
""
],
[
"Latva-aho",
"Matti",... | [
-0.04345148056745529,
-0.00008379952487302944,
-0.030405227094888687,
0.03831811994314194,
0.04178407043218613,
-0.04500269144773483,
-0.041560206562280655,
-0.02951429970562458,
0.0314202681183815,
-0.04072008654475212,
-0.028001056984066963,
-0.031645312905311584,
0.02917230874300003,
-0... | null | null | null | null | null | null | null | [
-0.04345148056745529,
-0.00008379952487302944,
-0.030405227094888687,
0.03831811994314194,
0.04178407043218613,
-0.04500269144773483,
-0.041560206562280655,
-0.02951429970562458,
0.0314202681183815,
-0.04072008654475212,
-0.028001056984066963,
-0.031645312905311584,
0.02917230874300003,
-0... |
1401.0263 | Xiongwei Zhu | Xiongwei Zhu | The Roads to LPA Based Free Electron Laser | 5 pages, 2 figures | null | null | null | physics.acc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we simply outline the present status of the free electron
laser and the laser plasma based accelerator, and we simply discuss the
potential possible roads appearing in the accelerator community to use the
laser plasma based accelerator into the field of the free electron laser.
| [
{
"created": "Wed, 1 Jan 2014 08:12:43 GMT",
"version": "v1"
}
] | 2014-01-03 | [
[
"Zhu",
"Xiongwei",
""
]
] | [
-0.10092993080615997,
0.01852514035999775,
-0.034439586102962494,
0.040376611053943634,
-0.11306846141815186,
-0.012908280827105045,
-0.05054599046707153,
-0.0020646185148507357,
-0.05449901521205902,
-0.07187245041131973,
0.011801136657595634,
-0.07513018697500229,
0.027911778539419174,
-... | null | null | null | null | null | null | null | [
-0.10092993080615997,
0.01852514035999775,
-0.034439586102962494,
0.040376611053943634,
-0.11306846141815186,
-0.012908280827105045,
-0.05054599046707153,
-0.0020646185148507357,
-0.05449901521205902,
-0.07187245041131973,
0.011801136657595634,
-0.07513018697500229,
0.027911778539419174,
-... |
1401.0270 | Aurelio Agliolo Gallitto | Rosaria Conti, Aurelio Agliolo Gallitto, Emilio Fiordilino | Measurement of the convective heat-transfer coefficient | 8 pages, 2 embedded figures. Accepted for publication in The Physics
Teacher | Phys. Teach. 52 (2014) 109 | 10.1119/1.4862118 | null | physics.ed-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose an experiment for investigating how objects cool down toward the
thermal equilibrium with its surrounding through convection. We describe the
time dependence of the temperature difference of the cooling object and the
environment with an exponential decay function. By measuring the thermal
constant tau, we determine the convective heat-transfer coefficient, which is a
characteristic constant of the convection system.
| [
{
"created": "Wed, 1 Jan 2014 10:38:03 GMT",
"version": "v1"
}
] | 2014-01-28 | [
[
"Conti",
"Rosaria",
""
],
[
"Gallitto",
"Aurelio Agliolo",
""
],
[
"Fiordilino",
"Emilio",
""
]
] | [
-0.0055596474558115005,
0.02039487659931183,
0.030407637357711792,
0.05332886427640915,
0.0692691057920456,
-0.1411251723766327,
-0.0152596989646554,
-0.03005373105406761,
0.07068879902362823,
0.04911930114030838,
0.004738841205835342,
-0.07189232110977173,
0.05261155590415001,
-0.03462508... | null | null | null | null | null | null | null | [
-0.0055596474558115005,
0.02039487659931183,
0.030407637357711792,
0.05332886427640915,
0.0692691057920456,
-0.1411251723766327,
-0.0152596989646554,
-0.03005373105406761,
0.07068879902362823,
0.04911930114030838,
0.004738841205835342,
-0.07189232110977173,
0.05261155590415001,
-0.03462508... |
1401.0279 | Darko Dimitrov | Darko Dimitrov | On structural properties of trees with minimal atom-bond connectivity
index | null | null | null | null | cs.DM math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The {\em atom-bond connectivity (ABC) index} is a degree-based molecular
descriptor, that found chemical applications. It is well known that among all
connected graphs, the graphs with minimal ABC index are trees. A complete
characterization of trees with minimal $ABC$ index is still an open problem. In
this paper, we present new structural properties of trees with minimal ABC
index. Our main results reveal that trees with minimal ABC index do not contain
so-called {\em $B_k$-branches}, with $k \geq 5$, and that they do not have more
than four $B_4$-branches.
| [
{
"created": "Wed, 1 Jan 2014 12:44:58 GMT",
"version": "v1"
}
] | 2014-01-03 | [
[
"Dimitrov",
"Darko",
""
]
] | [
0.03873225301504135,
0.03288017585873604,
-0.03047853894531727,
0.020555803552269936,
0.01577524095773697,
0.03280879929661751,
-0.028457436710596085,
0.026506079360842705,
0.08383230119943619,
0.0035176791716367006,
0.02667551301419735,
0.010007613338530064,
0.0021229865960776806,
0.04948... | null | null | null | null | null | null | null | [
0.03873225301504135,
0.03288017585873604,
-0.03047853894531727,
0.020555803552269936,
0.01577524095773697,
0.03280879929661751,
-0.028457436710596085,
0.026506079360842705,
0.08383230119943619,
0.0035176791716367006,
0.02667551301419735,
0.010007613338530064,
0.0021229865960776806,
0.04948... |
1401.0281 | Artem Badasyan | Artem Badasyan, Shushanik A. Tonoyan, Achille Giacometti, Rudolf
Podgornik, V. Adrian Parsegian, Yevgeni Sh. Mamasakhlisov and Vladimir F.
Morozov | A unified description of solvent effects in the helix-coil transition | 12 pages, 12 figures, to be submitted to PRE | null | 10.1103/PhysRevE.89.022723 | null | q-bio.BM cond-mat.soft physics.bio-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We analyze the problem of the helix-coil transition in explicit solvents
analytically by using spin-based models incorporating two different mechanisms
of solvent action: explicit solvent action through the formation of
solvent-polymer hydrogen bonds that can compete with the intrinsic
intra-polymer hydrogen bonded configurations (competing interactions) and
implicit solvent action, where the solvent-polymer interactions tune biopolymer
configurations by changing the activity of the solvent (non-competing
interactions). The overall spin Hamiltonian is comprised of three terms: the
background \emph{in vacuo} Hamiltonian of the "Generalized Model of Polypeptide
Chain" type and two additive terms that account for the two above mechanisms of
solvent action. We show that on this level the solvent degrees of freedom can
be {\sl explicitly} and {\sl exactly} traced over, the ensuing effective
partition function combining all the solvent effects in a unified framework. In
this way we are able to address helix-coil transitions for polypeptides,
proteins, and DNA, with different buffers and different external constraints.
Our spin-based effective Hamiltonian is applicable for treatment of such
diverse phenomena as cold denaturation, effects of osmotic pressure on the cold
and warm denaturation, complicated temperature dependence of the hydrophobic
effect as well as providing a conceptual base for understanding the behavior of
Intrinsically Disordered Proteins and their analogues.
| [
{
"created": "Wed, 1 Jan 2014 13:29:29 GMT",
"version": "v1"
}
] | 2015-06-18 | [
[
"Badasyan",
"Artem",
""
],
[
"Tonoyan",
"Shushanik A.",
""
],
[
"Giacometti",
"Achille",
""
],
[
"Podgornik",
"Rudolf",
""
],
[
"Parsegian",
"V. Adrian",
""
],
[
"Mamasakhlisov",
"Yevgeni Sh.",
""
],
[
"Morozov",
... | [
-0.06925001740455627,
-0.09089390933513641,
-0.016577405855059624,
-0.06419649720191956,
0.019522840157151222,
0.04144654422998428,
-0.02596050128340721,
0.04088689759373665,
0.026996251195669174,
-0.046473197638988495,
-0.013620978221297264,
0.10501065105199814,
-0.004855836275964975,
0.0... | null | null | null | null | null | null | null | [
-0.06925001740455627,
-0.09089390933513641,
-0.016577405855059624,
-0.06419649720191956,
0.019522840157151222,
0.04144654422998428,
-0.02596050128340721,
0.04088689759373665,
0.026996251195669174,
-0.046473197638988495,
-0.013620978221297264,
0.10501065105199814,
-0.004855836275964975,
0.0... |
End of preview. Expand in Data Studio
- Downloads last month
- 3
Size of downloaded dataset files:
3.24 GB
Size of the auto-converted Parquet files:
3.24 GB
Number of rows:
612,833