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 list | embeddings list | 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 list |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
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... |
1401.0282 | Reza Nourjou | Reza Nourjou, Michinori Hatayama, Stephen F. Smith, Atabak Sadeghi and
Pedro Szekely | Design of a GIS-based Assistant Software Agent for the Incident
Commander to Coordinate Emergency Response Operations | 3 pages, 1 figure, In Workshop on Robots and Sensors integration in
future rescue INformation system (ROSIN' 13). In Conjunction of the IEEE/RSJ
International Conference on Intelligent Robots and Systems (IROS' 13), 2013 | null | null | null | cs.MA cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Problem: This paper addresses the design of an intelligent software system
for the IC (incident commander) of a team in order to coordinate actions of
agents (field units or robots) in the domain of emergency/crisis response
operations. Objective: This paper proposes GICoordinator. It is a GIS-based
assistant software agent that assists and collaborates with the human planner
in strategic planning and macro tasks assignment for centralized multi-agent
coordination. Method: Our approach to design GICoordinator was to: analyze the
problem, design a complete data model, design an architecture of GICoordinator,
specify required capabilities of human and system in coordination problem
solving, specify development tools, and deploy. Result: The result was an
architecture/design of GICoordinator that contains system requirements.
Findings: GICoordinator efficiently integrates geoinformatics with artifice
intelligent techniques in order to provide a spatial intelligent coordinator
system for an IC to efficiently coordinate and control agents by making
macro/strategic decisions. Results define a framework for future works to
develop this system.
| [
{
"created": "Wed, 1 Jan 2014 13:35:06 GMT",
"version": "v1"
}
] | 2014-01-03 | [
[
"Nourjou",
"Reza",
""
],
[
"Hatayama",
"Michinori",
""
],
[
"Smith",
"Stephen F.",
""
],
[
"Sadeghi",
"Atabak",
""
],
[
"Szekely",
"Pedro",
""
]
] | [
-0.0476042814552784,
-0.05095984786748886,
-0.014366514049470425,
-0.04714398831129074,
-0.08165472000837326,
-0.06165529787540436,
0.034545328468084335,
0.06190421059727669,
0.007892868481576443,
0.11375465244054794,
-0.06397505849599838,
0.0020491969771683216,
0.08913020044565201,
0.0624... | null | null | null | null | null | null | null | [
-0.0476042814552784,
-0.05095984786748886,
-0.014366514049470425,
-0.04714398831129074,
-0.08165472000837326,
-0.06165529787540436,
0.034545328468084335,
0.06190421059727669,
0.007892868481576443,
0.11375465244054794,
-0.06397505849599838,
0.0020491969771683216,
0.08913020044565201,
0.0624... |
1401.0293 | Helge Kragh | Helge Kragh | Photon: New light on an old name | 16 pages; 4 figures | null | null | null | physics.hist-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | After G. N. Lewis (1875-1946) proposed the term "photon" in 1926, many
physicists adopted it as a more apt name for Einstein's light quantum. However,
Lewis' photon was a concept of a very different kind, something few physicists
knew or cared about. It turns out that Lewis' name was not quite the neologism
that it has usually been assumed to be. The same name was proposed or used
earlier, apparently independently, by at least four scientists. Three of the
four early proposals were related to physiology or visual perception, and only
one to quantum physics. Priority belongs to the American physicist and
psychologist L. T. Troland (1889-1932), who coined the word in 1916, and five
years later it was independently introduced by the Irish physicist J. Joly
(1857-1933). Then in 1925 a French physiologist, Rene Wurmser (1890-1993),
wrote about the photon, and in July 1926 his compatriot, the physicist F.
Wolfers (ca. 1890-1971), did the same in the context of optical physics. None
of the four pre-Lewis versions of "photon" was well known and they were soon
forgotten.
| [
{
"created": "Wed, 1 Jan 2014 15:19:18 GMT",
"version": "v1"
},
{
"created": "Fri, 3 Jan 2014 08:21:54 GMT",
"version": "v2"
},
{
"created": "Fri, 28 Feb 2014 07:39:43 GMT",
"version": "v3"
}
] | 2014-03-03 | [
[
"Kragh",
"Helge",
""
]
] | [
-0.04979116842150688,
-0.06703688204288483,
-0.10456114262342453,
0.07836902141571045,
-0.06630556285381317,
-0.08681055903434753,
0.05025871470570564,
0.01411250326782465,
0.028141381219029427,
0.033992666751146317,
0.08685582876205444,
0.009652980603277683,
-0.04620945081114769,
0.083357... | null | null | null | null | null | null | null | [
-0.04979116842150688,
-0.06703688204288483,
-0.10456114262342453,
0.07836902141571045,
-0.06630556285381317,
-0.08681055903434753,
0.05025871470570564,
0.01411250326782465,
0.028141381219029427,
0.033992666751146317,
0.08685582876205444,
0.009652980603277683,
-0.04620945081114769,
0.083357... |
1401.0294 | Vadim E. Levit | Vadim E. Levit and David Tankus | Complexity results for generating subgraphs | 18 pages, 3 figures, 1 table. arXiv admin note: text overlap with
arXiv:1312.7563 | null | null | null | cs.DM math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A graph G is well-covered if all its maximal independent sets are of the same
cardinality. Assume that a weight function w is defined on its vertices. Then G
is w-well-covered if all maximal independent sets are of the same weight.
For every graph G, the set of weight functions w such that G is
w-well-covered is a vector space, denoted WCW(G). Let B be a complete bipartite
induced subgraph of G on vertex sets of bipartition B_X and B_Y. Then B is
generating if there exists an independent set S such that S \cup B_X and S \cup
B_Y are both maximal independent sets of G. A relating edge is a generating
subgraph in the restricted case that B = K_{1,1}.
Deciding whether an input graph G is well-covered is co-NP-complete.
Therefore finding WCW(G) is co-NP-hard. Deciding whether an edge is relating is
co-NP-complete. Therefore, deciding whether a subgraph is generating is
co-NP-complete as well.
In this article we discuss the connections among these problems, provide
proofs for NP-completeness for several restricted cases, and present polynomial
characterizations for some other cases.
| [
{
"created": "Wed, 1 Jan 2014 15:20:17 GMT",
"version": "v1"
},
{
"created": "Sun, 20 Nov 2016 12:56:29 GMT",
"version": "v2"
}
] | 2016-11-22 | [
[
"Levit",
"Vadim E.",
""
],
[
"Tankus",
"David",
""
]
] | [
-0.0391409657895565,
0.03917583078145981,
0.04932703822851181,
-0.005178680177778006,
0.09129031002521515,
0.04521758109331131,
0.06827889382839203,
-0.06783925741910934,
-0.05987846106290817,
0.014649542979896069,
-0.12083659321069717,
-0.04295920953154564,
0.013653470203280449,
0.0368974... | null | null | null | null | null | null | null | [
-0.0391409657895565,
0.03917583078145981,
0.04932703822851181,
-0.005178680177778006,
0.09129031002521515,
0.04521758109331131,
0.06827889382839203,
-0.06783925741910934,
-0.05987846106290817,
0.014649542979896069,
-0.12083659321069717,
-0.04295920953154564,
0.013653470203280449,
0.0368974... |
1401.0297 | Pratim Kumar Chattaraj | Ranjita Das and Pratim Kumar Chattaraj | Gas Storage Potential of Li-decorated ExBox4+ | null | null | null | null | physics.atm-clus | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The newly developed compound ExBox4+ is explored to check whether it is a
proficient hydrogen storage material. Both exoherdal and endohedral hydrogen
adsorption on ExBox4+ are studied. Endohedral hydrogen molecules interact
strongly than exohedral ones. The hydrogen adsorption energy is as good as the
recently studied charged fullerenes. The hydrogen storage capacity appears to
be ~4.3 wt%. The endohedral CO sorption is also analysed with the help of DFT.
The first principle DFT calculation and MD simulation are performed to
investigate the effect of lithium doping on the gas adsorbing capacity and
adsorption enthalpy as well as adsorption energy of ExBox4+.The metal atom
interaction with ExBox4+is found to be pretty strong, and the interaction
energy appears to be higher than the metal cohesive energy.The thermodynamic
parameters suggest that metal doping method is spontaneous in nature. The
analysis of adsorption energy, thermodynamic properties and MD simulation
results suggest that Li doped ExBox4+ can be a promising gas adsorbing
material. Lithium doping increases the gas adsorption capacity of ExBox4+. The
Li decorated ExBox4+ is found to adsorb twenty four hydrogen molecules with a
gravimetric wt% of 6.23. Adsorption of CO on the metal decorated ExBox4+ is
also studied. AIM analysis is performed to obtain a general idea of the bonding
interaction between Li-H and Li-C.
| [
{
"created": "Wed, 1 Jan 2014 15:46:40 GMT",
"version": "v1"
}
] | 2014-01-03 | [
[
"Das",
"Ranjita",
""
],
[
"Chattaraj",
"Pratim Kumar",
""
]
] | [
0.034019555896520615,
0.06414594501256943,
-0.0825205072760582,
0.027188779786229134,
0.09858591109514236,
-0.036896996200084686,
0.03403088450431824,
0.031338077038526535,
-0.06518646329641342,
-0.02332865446805954,
-0.02999630756676197,
0.0026087358128279448,
-0.03279927000403404,
0.0047... | null | null | null | null | null | null | null | [
0.034019555896520615,
0.06414594501256943,
-0.0825205072760582,
0.027188779786229134,
0.09858591109514236,
-0.036896996200084686,
0.03403088450431824,
0.031338077038526535,
-0.06518646329641342,
-0.02332865446805954,
-0.02999630756676197,
0.0026087358128279448,
-0.03279927000403404,
0.0047... |
1401.0302 | Yinan Yu | Yinan Yu, Shawn Mitryk, Guido Mueller | Arm locking for space-based laser interferometry gravitational wave
observatories | 18 pages | null | 10.1103/PhysRevD.90.062005 | null | gr-qc astro-ph.IM physics.ins-det | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Laser frequency stabilization is a critical part of the interferometry
measurement system of space-based gravitational wave observatories such as the
Laser Interferometer Space Antenna (LISA). Arm locking as a proposed frequency
stabilization technique, transfers the stability of the long arm lengths to the
laser frequency. The arm locking sensor synthesizes an adequately filtered
linear combination of the inter-spacecraft phase measurements to estimate the
laser frequency noise, which can be used to control the laser frequency. At the
University of Florida we developed the hardware-based University of Florida
LISA Interferometer Simulator (UFLIS) to study and verify laser frequency noise
reduction and suppression techniques under realistic LISA-like conditions.
These conditions include the variable Doppler shifts between the spacecraft,
LISA-like signal travel times, optical transponders, realistic laser frequency
and timing noise. We review the different types of arm locking sensors and
discuss their expected performance in LISA. The presented results are supported
by results obtained during experimental studies of arm locking under relevant
LISA-like conditions. We measured the noise suppression as well as initial
transients and frequency pulling in the presence of Doppler frequency errors.
This work has demonstrated the validity and \ feasibility of arm locking in
LISA.
| [
{
"created": "Wed, 1 Jan 2014 16:20:29 GMT",
"version": "v1"
},
{
"created": "Wed, 8 Jan 2014 18:14:11 GMT",
"version": "v2"
}
] | 2015-06-18 | [
[
"Yu",
"Yinan",
""
],
[
"Mitryk",
"Shawn",
""
],
[
"Mueller",
"Guido",
""
]
] | [
-0.05659705772995949,
-0.04250139743089676,
0.013577803038060665,
-0.0025537251494824886,
-0.09781820327043533,
-0.08140397816896439,
0.0193286444991827,
-0.08031613379716873,
-0.02363002486526966,
-0.03919503465294838,
-0.018361512571573257,
-0.0007436358137056231,
0.0007547605782747269,
... | null | null | null | null | null | null | null | [
-0.05659705772995949,
-0.04250139743089676,
0.013577803038060665,
-0.0025537251494824886,
-0.09781820327043533,
-0.08140397816896439,
0.0193286444991827,
-0.08031613379716873,
-0.02363002486526966,
-0.03919503465294838,
-0.018361512571573257,
-0.0007436358137056231,
0.0007547605782747269,
... |
1401.0304 | Shahar Mendelson | Shahar Mendelson | Learning without Concentration | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We obtain sharp bounds on the performance of Empirical Risk Minimization
performed in a convex class and with respect to the squared loss, without
assuming that class members and the target are bounded functions or have
rapidly decaying tails.
Rather than resorting to a concentration-based argument, the method used here
relies on a `small-ball' assumption and thus holds for classes consisting of
heavy-tailed functions and for heavy-tailed targets.
The resulting estimates scale correctly with the `noise level' of the
problem, and when applied to the classical, bounded scenario, always improve
the known bounds.
| [
{
"created": "Wed, 1 Jan 2014 16:28:19 GMT",
"version": "v1"
},
{
"created": "Wed, 22 Oct 2014 17:59:50 GMT",
"version": "v2"
}
] | 2014-10-23 | [
[
"Mendelson",
"Shahar",
""
]
] | [
0.010815334506332874,
0.013108198530972004,
0.03713249787688255,
-0.050386328250169754,
0.1440725177526474,
0.02986706979572773,
0.07108550518751144,
0.015379860997200012,
0.0014918649103492498,
0.046397801488637924,
-0.05397621914744377,
0.029243336990475655,
0.08491028100252151,
-0.08897... | null | null | null | null | null | null | null | [
0.010815334506332874,
0.013108198530972004,
0.03713249787688255,
-0.050386328250169754,
0.1440725177526474,
0.02986706979572773,
0.07108550518751144,
0.015379860997200012,
0.0014918649103492498,
0.046397801488637924,
-0.05397621914744377,
0.029243336990475655,
0.08491028100252151,
-0.08897... |
1401.0323 | Tian Wang | Tian Wang, Hamid Krim, Yannis Viniotis | Analysis and Control of Beliefs in Social Networks | null | null | 10.1109/TSP.2014.2352591 | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we investigate the problem of how beliefs diffuse among
members of social networks. We propose an information flow model (IFM) of
belief that captures how interactions among members affect the diffusion and
eventual convergence of a belief. The IFM model includes a generalized Markov
Graph (GMG) model as a social network model, which reveals that the diffusion
of beliefs depends heavily on two characteristics of the social network
characteristics, namely degree centralities and clustering coefficients. We
apply the IFM to both converged belief estimation and belief control strategy
optimization. The model is compared with an IFM including the Barabasi-Albert
model, and is evaluated via experiments with published real social network
data.
| [
{
"created": "Wed, 1 Jan 2014 19:22:14 GMT",
"version": "v1"
},
{
"created": "Fri, 3 Jan 2014 01:48:10 GMT",
"version": "v2"
}
] | 2015-06-18 | [
[
"Wang",
"Tian",
""
],
[
"Krim",
"Hamid",
""
],
[
"Viniotis",
"Yannis",
""
]
] | [
0.0189856868237257,
-0.0846911370754242,
0.011443215422332287,
0.019065767526626587,
0.040117297321558,
-0.062190357595682144,
0.03869859129190445,
-0.014513896778225899,
0.10238299518823624,
0.014175976626574993,
-0.015099921263754368,
0.028537124395370483,
0.07566111534833908,
0.03960481... | null | null | null | null | null | null | null | [
0.0189856868237257,
-0.0846911370754242,
0.011443215422332287,
0.019065767526626587,
0.040117297321558,
-0.062190357595682144,
0.03869859129190445,
-0.014513896778225899,
0.10238299518823624,
0.014175976626574993,
-0.015099921263754368,
0.028537124395370483,
0.07566111534833908,
0.03960481... |
1401.0332 | Himadri Pathak | Himadri Pathak, B. K. Sahoo, B. P. Das, Nayana Vaval, Sourav Pal | Relativistic Equation of Motion Coupled-Cluster Method: Application to
the closed-shell atomic systems | null | PhysRevA.89.042510,(2014) | 10.1103/PhysRevA.89.042510 | null | physics.atom-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We report our successful implementation of the full fledged relativistic
equation of motion coupled cluster (EOMCC) method. This method is employed to
compute the principal ionization potentials (IPs) of closed-shell rare gas
atoms, He-like ions, Be-like ions along with Na+, Al+, K+, Be, and Mg. Four
component Dirac spinors are used in the calculations and the one and two
electron integrals are evaluated using the Dirac Coulomb Hamiltonian. Our
results are in excellent agreement with those available measurements, which are
taken from the National Institute of Science and Technology database (NIST). We
also present results using the second order many-body perturbation theory
(MBPT(2)) and random phase approximation (RPA) in the EOMCC framework. These
results are compared with those of EOMCC at the level of single and double
excitations in order to assess the role of the electron correlation effects in
the intermediate schemes considered in our calculations .
| [
{
"created": "Wed, 1 Jan 2014 21:11:37 GMT",
"version": "v1"
},
{
"created": "Sun, 5 Jan 2014 21:45:44 GMT",
"version": "v2"
},
{
"created": "Wed, 8 Jan 2014 06:54:08 GMT",
"version": "v3"
}
] | 2014-04-24 | [
[
"Pathak",
"Himadri",
""
],
[
"Sahoo",
"B. K.",
""
],
[
"Das",
"B. P.",
""
],
[
"Vaval",
"Nayana",
""
],
[
"Pal",
"Sourav",
""
]
] | [
-0.01692918874323368,
-0.03703342750668526,
0.03791418671607971,
0.10135918855667114,
-0.04000718519091606,
0.0624217689037323,
-0.003935720771551132,
0.033263128250837326,
0.011437959037721157,
-0.0333876796066761,
0.08364048600196838,
-0.014583028852939606,
0.03994448482990265,
-0.076130... | null | null | null | null | null | null | null | [
-0.01692918874323368,
-0.03703342750668526,
0.03791418671607971,
0.10135918855667114,
-0.04000718519091606,
0.0624217689037323,
-0.003935720771551132,
0.033263128250837326,
0.011437959037721157,
-0.0333876796066761,
0.08364048600196838,
-0.014583028852939606,
0.03994448482990265,
-0.076130... |
1401.0333 | Kiran Sankar Maiti | Kiran Sankar Maiti and Christoph Scheurer | Vibrational Spectroscopy of Methyl benzoate | 11 pages, 8 figures | null | null | null | physics.chem-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Methyl benzoate (MB) is studied as a model compound for the development of
new IR pulse schemes with possible applicability to biomolecules. Anharmonic
vibrational modes of MB are calculated on different level (MP2, SCS, CCSD(T)
with varying basis sets) ab-initio PESs using the vibrational self-consistent
field (VSCF) method and its correlation corrected extensions. Dual level
schemes, combining different quantum chemical methods for diagonal and coupling
potentials, are systematically studied and applied successfully to reduce the
computational cost. Isotopic substitution of {\beta}-hydrogen by deuterium is
studied to obtain a better understanding of the molecular vibrational coupling
topology.
| [
{
"created": "Wed, 1 Jan 2014 21:12:53 GMT",
"version": "v1"
}
] | 2014-01-03 | [
[
"Maiti",
"Kiran Sankar",
""
],
[
"Scheurer",
"Christoph",
""
]
] | [
-0.007939271628856659,
-0.043983958661556244,
-0.04601138085126877,
-0.028183139860630035,
-0.025448346510529518,
-0.0281632449477911,
-0.006631287280470133,
0.07483845204114914,
0.02862515300512314,
-0.056859295815229416,
0.01154940016567707,
-0.036275506019592285,
-0.06440214067697525,
-... | null | null | null | null | null | null | null | [
-0.007939271628856659,
-0.043983958661556244,
-0.04601138085126877,
-0.028183139860630035,
-0.025448346510529518,
-0.0281632449477911,
-0.006631287280470133,
0.07483845204114914,
0.02862515300512314,
-0.056859295815229416,
0.01154940016567707,
-0.036275506019592285,
-0.06440214067697525,
-... |
1401.0336 | Rachel Cummings | Rachel Cummings, Federico Echenique, Adam Wierman | The Empirical Implications of Privacy-Aware Choice | null | null | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper initiates the study of the testable implications of choice data in
settings where agents have privacy preferences. We adapt the standard
conceptualization of consumer choice theory to a situation where the consumer
is aware of, and has preferences over, the information revealed by her choices.
The main message of the paper is that little can be inferred about consumers'
preferences once we introduce the possibility that the consumer has concerns
about privacy. This holds even when consumers' privacy preferences are assumed
to be monotonic and separable. This motivates the consideration of stronger
assumptions and, to that end, we introduce an additive model for privacy
preferences that does have testable implications.
| [
{
"created": "Wed, 1 Jan 2014 21:17:22 GMT",
"version": "v1"
}
] | 2014-01-03 | [
[
"Cummings",
"Rachel",
""
],
[
"Echenique",
"Federico",
""
],
[
"Wierman",
"Adam",
""
]
] | [
0.0002591912925709039,
-0.052413348108530045,
-0.0650969073176384,
0.04525366052985191,
0.03098941035568714,
0.052818361669778824,
0.08179910480976105,
0.008835519663989544,
-0.008523264899849892,
0.04094471037387848,
0.11824177205562592,
0.007825362496078014,
0.012037173844873905,
-0.0308... | null | null | null | null | null | null | null | [
0.0002591912925709039,
-0.052413348108530045,
-0.0650969073176384,
0.04525366052985191,
0.03098941035568714,
0.052818361669778824,
0.08179910480976105,
0.008835519663989544,
-0.008523264899849892,
0.04094471037387848,
0.11824177205562592,
0.007825362496078014,
0.012037173844873905,
-0.0308... |
1401.0340 | Ahmed El Shafie | Ahmed El Shafie | Optimal Random Access and Random Spectrum Sensing for an Energy
Harvesting Cognitive Radio with and without Primary Feedback Leveraging | ACCEPTED in EAI Endorsed Transactions on Cognitive Communications.
arXiv admin note: substantial text overlap with arXiv:1208.5659 | null | null | null | cs.IT cs.NI math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider a secondary user (SU) with energy harvesting capability. We
design access schemes for the SU which incorporate random spectrum sensing and
random access, and which make use of the primary automatic repeat request (ARQ)
feedback. We study two problem-formulations. In the first problem-formulation,
we characterize the stability region of the proposed schemes. The sensing and
access probabilities are obtained such that the secondary throughput is
maximized under the constraints that both the primary and secondary queues are
stable. Whereas in the second problem-formulation, the sensing and access
probabilities are obtained such that the secondary throughput is maximized
under the stability of the primary queue and that the primary queueing delay is
kept lower than a specified value needed to guarantee a certain quality of
service (QoS) for the primary user (PU). We consider spectrum sensing errors
and assume multipacket reception (MPR) capabilities. Numerical results show the
enhanced performance of our proposed systems.
| [
{
"created": "Wed, 1 Jan 2014 22:08:31 GMT",
"version": "v1"
},
{
"created": "Sat, 4 Jan 2014 10:27:35 GMT",
"version": "v2"
},
{
"created": "Sun, 27 Apr 2014 11:35:14 GMT",
"version": "v3"
}
] | 2014-04-29 | [
[
"Shafie",
"Ahmed El",
""
]
] | [
-0.0681486427783966,
0.0804978683590889,
-0.06081414967775345,
0.02591797150671482,
-0.08193212002515793,
-0.048134900629520416,
0.1476719081401825,
-0.05100395902991295,
0.03643520921468735,
0.059550002217292786,
-0.048305436968803406,
0.04953758791089058,
0.06204274296760559,
-0.03666963... | null | null | null | null | null | null | null | [
-0.0681486427783966,
0.0804978683590889,
-0.06081414967775345,
0.02591797150671482,
-0.08193212002515793,
-0.048134900629520416,
0.1476719081401825,
-0.05100395902991295,
0.03643520921468735,
0.059550002217292786,
-0.048305436968803406,
0.04953758791089058,
0.06204274296760559,
-0.03666963... |
1401.0346 | Dmitry Shcherbakov L | D. Shcherbakov, K. Motovilov, I. Erofeev, A. Astafiev | Optical control of cardiac cell excitability based on two-photon
infrared absorption of AzoTAB | null | null | null | null | physics.chem-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent studies of AzoTAB activity in excitable cell cultures have shown that
this substance is able to control excitability depending on isomer, cis or
trans, predominating in the cellular membrane. Control of isomerization can be
performed noninvasively by UV-visual radiation. At the same time it is
well-known that azobenezenes can be effectively transformed from one isomer
into another by two-photon absorption. Current work is devoted to the study of
trans-AzoTAB two-photon transformation in aqueous solution and inside primal
neonatal contractive rat cardiomyocytes. In accordance with results obtained
Azo-TAB can be used as a probe for two-photon optical control of cardiac
excitability.
| [
{
"created": "Wed, 1 Jan 2014 22:52:18 GMT",
"version": "v1"
}
] | 2014-01-03 | [
[
"Shcherbakov",
"D.",
""
],
[
"Motovilov",
"K.",
""
],
[
"Erofeev",
"I.",
""
],
[
"Astafiev",
"A.",
""
]
] | [
0.01032557524740696,
-0.08187765628099442,
-0.07225963473320007,
0.06224392354488373,
-0.022682875394821167,
-0.02972654066979885,
0.07926397770643234,
0.023089351132512093,
0.0356750451028347,
0.05273626372218132,
0.020626787096261978,
-0.02402534708380699,
-0.03625411540269852,
0.1088899... | null | null | null | null | null | null | null | [
0.01032557524740696,
-0.08187765628099442,
-0.07225963473320007,
0.06224392354488373,
-0.022682875394821167,
-0.02972654066979885,
0.07926397770643234,
0.023089351132512093,
0.0356750451028347,
0.05273626372218132,
0.020626787096261978,
-0.02402534708380699,
-0.03625411540269852,
0.1088899... |
1401.0347 | Rodrigo de Lamare | Peng Li and Rodrigo C. de Lamare | Distributed Iterative Detection Based on Reduced Message Passing for
Networked MIMO Cellular Systems | 9 pages, 6 figures. IEEE Transactions on Vehicular Technology, 2014 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper considers base station cooperation (BSC) strategies for the uplink
of a multi-user multi-cell high frequency reuse scenario where distributed
iterative detection (DID) schemes with soft/hard interference cancellation
algorithms are studied. The conventional distributed detection scheme exchanges
{soft symbol estimates} with all cooperating BSs. Since a large amount of
information needs to be shared via the backhaul, the exchange of hard bit
information is preferred, however a performance degradation is experienced. In
this paper, we consider a reduced message passing (RMP) technique in which each
BS generates a detection list with the probabilities for the desired symbol
that are sorted according to the calculated probability. The network then
selects the best {detection candidates} from the lists and conveys the index of
the constellation symbols (instead of double-precision values) among the
cooperating cells. The proposed DID-RMP achieves an inter-cell-interference
(ICI) suppression with low backhaul traffic overhead compared with {the
conventional soft bit exchange} and outperforms the previously reported
hard/soft information exchange algorithms.
| [
{
"created": "Wed, 1 Jan 2014 23:10:48 GMT",
"version": "v1"
}
] | 2014-01-03 | [
[
"Li",
"Peng",
""
],
[
"de Lamare",
"Rodrigo C.",
""
]
] | [
0.03527113050222397,
0.023011162877082825,
0.016115348786115646,
-0.0184855367988348,
-0.052264705300331116,
-0.004564948379993439,
0.05898318067193031,
0.0036137516144663095,
0.007378833368420601,
0.03327225521206856,
-0.09962514042854309,
0.10111309587955475,
0.0961565226316452,
-0.01532... | null | null | null | null | null | null | null | [
0.03527113050222397,
0.023011162877082825,
0.016115348786115646,
-0.0184855367988348,
-0.052264705300331116,
-0.004564948379993439,
0.05898318067193031,
0.0036137516144663095,
0.007378833368420601,
0.03327225521206856,
-0.09962514042854309,
0.10111309587955475,
0.0961565226316452,
-0.01532... |
1401.0348 | Henry Cohn | Nir Bitansky, Ran Canetti, Henry Cohn, Shafi Goldwasser, Yael Tauman
Kalai, Omer Paneth, Alon Rosen | The impossibility of obfuscation with auxiliary input or a universal
simulator | 19 pages | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we show that the existence of general indistinguishability
obfuscators conjectured in a few recent works implies, somewhat
counterintuitively, strong impossibility results for virtual black box
obfuscation. In particular, we show that indistinguishability obfuscation for
all circuits implies:
* The impossibility of average-case virtual black box obfuscation with
auxiliary input for any circuit family with super-polynomial pseudo-entropy.
Such circuit families include all pseudo-random function families, and all
families of encryption algorithms and randomized digital signatures that
generate their required coin flips pseudo-randomly. Impossibility holds even
when the auxiliary input depends only on the public circuit family, and not the
specific circuit in the family being obfuscated.
* The impossibility of average-case virtual black box obfuscation with a
universal simulator (with or without any auxiliary input) for any circuit
family with super-polynomial pseudo-entropy.
These bounds significantly strengthen the impossibility results of Goldwasser
and Kalai (STOC 2005).
| [
{
"created": "Wed, 1 Jan 2014 23:18:36 GMT",
"version": "v1"
},
{
"created": "Sun, 5 Jan 2014 03:47:42 GMT",
"version": "v2"
},
{
"created": "Thu, 13 Feb 2014 04:58:39 GMT",
"version": "v3"
}
] | 2014-02-14 | [
[
"Bitansky",
"Nir",
""
],
[
"Canetti",
"Ran",
""
],
[
"Cohn",
"Henry",
""
],
[
"Goldwasser",
"Shafi",
""
],
[
"Kalai",
"Yael Tauman",
""
],
[
"Paneth",
"Omer",
""
],
[
"Rosen",
"Alon",
""
]
] | [
-0.10499975830316544,
0.04846725985407829,
-0.022514382377266884,
0.006370333954691887,
0.02527580037713051,
-0.0261249877512455,
0.018825754523277283,
-0.049098215997219086,
0.04411716014146805,
-0.03998427465558052,
0.009697048924863338,
0.006697681732475758,
0.06672660261392593,
-0.0242... | null | null | null | null | null | null | null | [
-0.10499975830316544,
0.04846725985407829,
-0.022514382377266884,
0.006370333954691887,
0.02527580037713051,
-0.0261249877512455,
0.018825754523277283,
-0.049098215997219086,
0.04411716014146805,
-0.03998427465558052,
0.009697048924863338,
0.006697681732475758,
0.06672660261392593,
-0.0242... |
1401.0355 | Liya Fan | Liya Fan, Bo Gao, Xi Sun, Fa Zhang and Zhiyong Liu | Improving the Load Balance of MapReduce Operations based on the Key
Distribution of Pairs | null | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Load balance is important for MapReduce to reduce job duration, increase
parallel efficiency, etc. Previous work focuses on coarse-grained scheduling.
This study concerns fine-grained scheduling on MapReduce operations. Each
operation represents one invocation of the Map or Reduce function. Scheduling
MapReduce operations is difficult due to highly screwed operation loads, no
support to collect workload statistics, and high complexity of the scheduling
problem. So current implementations adopt simple strategies, leading to poor
load balance. To address these difficulties, we design an algorithm to schedule
operations based on the key distribution of intermediate pairs. The algorithm
involves a sub-program for selecting operations for task slots, and we name it
the Balanced Subset Sum (BSS) problem. We discuss properties of BSS and design
exact and approximation algorithms for it. To transparently incorporate these
algorithms into MapReduce, we design a communication mechanism to collect
statistics, and a pipeline within Reduce tasks to increase resource
utilization. To the best of our knowledge, this is the first work on scheduling
MapReduce workload at this fine-grained level. Experiments on PUMA [T+12]
benchmarks show consistent performance improvement. The job duration can be
reduced by up to 37%, compared with standard MapReduce.
| [
{
"created": "Thu, 2 Jan 2014 01:42:23 GMT",
"version": "v1"
},
{
"created": "Mon, 14 Apr 2014 03:35:22 GMT",
"version": "v2"
}
] | 2014-04-15 | [
[
"Fan",
"Liya",
""
],
[
"Gao",
"Bo",
""
],
[
"Sun",
"Xi",
""
],
[
"Zhang",
"Fa",
""
],
[
"Liu",
"Zhiyong",
""
]
] | [
-0.0692201778292656,
0.041898757219314575,
0.02998274192214012,
0.011144394055008888,
-0.07838021963834763,
-0.0669306069612503,
-0.0658513531088829,
-0.03911835700273514,
-0.06669268757104874,
0.047998666763305664,
-0.11480939388275146,
0.003556518815457821,
0.00963385310024023,
0.0012618... | null | null | null | null | null | null | null | [
-0.0692201778292656,
0.041898757219314575,
0.02998274192214012,
0.011144394055008888,
-0.07838021963834763,
-0.0669306069612503,
-0.0658513531088829,
-0.03911835700273514,
-0.06669268757104874,
0.047998666763305664,
-0.11480939388275146,
0.003556518815457821,
0.00963385310024023,
0.0012618... |
1401.0359 | Andrew Winslow | Benjamin Hescott, Caleb Malchik, Andrew Winslow | Tight Bounds for Active Self-Assembly Using an Insertion Primitive | To appear in Algorithmica. An abstract (12-page) version of this
paper appeared in the proceedings of ESA 2014 | null | null | null | cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We prove two tight bounds on the behavior of a model of self-assembling
particles introduced by Dabby and Chen (SODA 2013), called insertion systems,
where monomers insert themselves into the middle of a growing linear polymer.
First, we prove that the expressive power of these systems is equal to
context-free grammars, answering a question posed by Dabby and Chen. Second, we
prove that systems of $k$ monomer types can deterministically construct
polymers of length $n = 2^{\Theta(k^{3/2})}$ in $O(\log^{5/3}(n))$ expected
time, and that this is optimal in both the number of monomer types and expected
time.
| [
{
"created": "Thu, 2 Jan 2014 02:50:43 GMT",
"version": "v1"
},
{
"created": "Tue, 21 Jan 2014 19:39:28 GMT",
"version": "v2"
},
{
"created": "Mon, 5 May 2014 18:20:05 GMT",
"version": "v3"
},
{
"created": "Tue, 1 Jul 2014 18:38:13 GMT",
"version": "v4"
},
{
"crea... | 2015-10-29 | [
[
"Hescott",
"Benjamin",
""
],
[
"Malchik",
"Caleb",
""
],
[
"Winslow",
"Andrew",
""
]
] | [
0.00640458706766367,
-0.0788285881280899,
0.076146200299263,
-0.005713309161365032,
-0.004851457662880421,
-0.05122927576303482,
0.0755404382944107,
0.006056623999029398,
0.10172603279352188,
0.06111250817775726,
0.017804043367505074,
0.021313760429620743,
-0.009819833561778069,
0.04302980... | null | null | null | null | null | null | null | [
0.00640458706766367,
-0.0788285881280899,
0.076146200299263,
-0.005713309161365032,
-0.004851457662880421,
-0.05122927576303482,
0.0755404382944107,
0.006056623999029398,
0.10172603279352188,
0.06111250817775726,
0.017804043367505074,
0.021313760429620743,
-0.009819833561778069,
0.04302980... |
1401.0362 | Hao Peng | Hao Peng and Yuan Qi | EigenGP: Gaussian Process Models with Adaptive Eigenfunctions | Accepted by IJCAI 2015 | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Gaussian processes (GPs) provide a nonparametric representation of functions.
However, classical GP inference suffers from high computational cost for big
data. In this paper, we propose a new Bayesian approach, EigenGP, that learns
both basis dictionary elements--eigenfunctions of a GP prior--and prior
precisions in a sparse finite model. It is well known that, among all
orthogonal basis functions, eigenfunctions can provide the most compact
representation. Unlike other sparse Bayesian finite models where the basis
function has a fixed form, our eigenfunctions live in a reproducing kernel
Hilbert space as a finite linear combination of kernel functions. We learn the
dictionary elements--eigenfunctions--and the prior precisions over these
elements as well as all the other hyperparameters from data by maximizing the
model marginal likelihood. We explore computational linear algebra to simplify
the gradient computation significantly. Our experimental results demonstrate
improved predictive performance of EigenGP over alternative sparse GP methods
as well as relevance vector machine.
| [
{
"created": "Thu, 2 Jan 2014 03:12:28 GMT",
"version": "v1"
},
{
"created": "Tue, 25 Mar 2014 03:50:33 GMT",
"version": "v2"
},
{
"created": "Mon, 13 Jul 2015 06:11:18 GMT",
"version": "v3"
}
] | 2015-07-14 | [
[
"Peng",
"Hao",
""
],
[
"Qi",
"Yuan",
""
]
] | [
-0.09105975925922394,
-0.13022655248641968,
-0.02136736549437046,
-0.01851431094110012,
0.005368135403841734,
-0.029932605102658272,
-0.0009845694294199347,
-0.03689085319638252,
-0.011592254042625427,
-0.011373684741556644,
0.016426878049969673,
0.06885002553462982,
0.012808877974748611,
... | EigenGP: Gaussian Process Models with Adaptive Eigenfunctions | http://arxiv.org/abs/1401.0362v3 | http://arxiv.org/pdf/1401.0362v3.pdf | https://github.com/hao-peng/EigenGP | true | false | https://paperswithcode.com/paper/eigengp-gaussian-process-models-with-adaptive | [
-0.09105975925922394,
-0.13022655248641968,
-0.02136736549437046,
-0.01851431094110012,
0.005368135403841734,
-0.029932605102658272,
-0.0009845694294199347,
-0.03689085319638252,
-0.011592254042625427,
-0.011373684741556644,
0.016426878049969673,
0.06885002553462982,
0.012808877974748611,
... |
1401.0366 | Vaisagh Viswanathan | Vaisagh Viswanathan and Chong Eu Lee and Michael Harold Lees and Siew
Ann Cheong and Peter M. A. Sloot | Quantitative Comparison Between Crowd Models for Evacuation Planning and
Evaluation | 12 pages, 25 figures, accepted in EPJ B | null | 10.1140/epjb/e2014-40699-x | null | cs.MA cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Crowd simulation is rapidly becoming a standard tool for evacuation planning
and evaluation. However, the many crowd models in the literature are
structurally different, and few have been rigorously calibrated against
real-world egress data, especially in emergency situations. In this paper we
describe a procedure to quantitatively compare different crowd models or
between models and real-world data. We simulated three models: (1) the lattice
gas model, (2) the social force model, and (3) the RVO2 model, and obtained the
distributions of six observables: (1) evacuation time, (2) zoned evacuation
time, (3) passage density, (4) total distance traveled, (5) inconvenience, and
(6) flow rate. We then used the DISTATIS procedure to compute the compromise
matrix of statistical distances between the three models. Projecting the three
models onto the first two principal components of the compromise matrix, we
find the lattice gas and RVO2 models are similar in terms of the evacuation
time, passage density, and flow rates, whereas the social force and RVO2 models
are similar in terms of the total distance traveled. Most importantly, we find
that the zoned evacuation times of the three models to be very different from
each other. Thus we propose to use this variable, if it can be measured, as the
key test between different models, and also between models and the real world.
Finally, we compared the model flow rates against the flow rate of an emergency
evacuation during the May 2008 Sichuan earthquake, and found the social force
model agrees best with this real data.
| [
{
"created": "Thu, 2 Jan 2014 04:44:20 GMT",
"version": "v1"
},
{
"created": "Fri, 10 Jan 2014 06:02:51 GMT",
"version": "v2"
}
] | 2014-02-05 | [
[
"Viswanathan",
"Vaisagh",
""
],
[
"Lee",
"Chong Eu",
""
],
[
"Lees",
"Michael Harold",
""
],
[
"Cheong",
"Siew Ann",
""
],
[
"Sloot",
"Peter M. A.",
""
]
] | [
0.06172871217131615,
-0.07334578037261963,
-0.027567412704229355,
0.04391970857977867,
0.10389944911003113,
-0.02976793423295021,
-0.02934117801487446,
0.007588771637529135,
0.09918966889381409,
0.04668693616986275,
0.03487140312790871,
-0.03803877905011177,
0.019303854554891586,
0.0773920... | null | null | null | null | null | null | null | [
0.06172871217131615,
-0.07334578037261963,
-0.027567412704229355,
0.04391970857977867,
0.10389944911003113,
-0.02976793423295021,
-0.02934117801487446,
0.007588771637529135,
0.09918966889381409,
0.04668693616986275,
0.03487140312790871,
-0.03803877905011177,
0.019303854554891586,
0.0773920... |
1401.0367 | Jianwen Dong | Wen-Jie Chen, Shao-Ji Jiang, Xiao-Dong Chen, Jian-Wen Dong, C. T. Chan | Experimental realization of photonic topological insulator in a uniaxial
metacrystal waveguide | 8 pages, 4 figures | Nature Communications 5, 5782 (2014) | 10.1038/ncomms6782 | null | physics.optics cond-mat.mes-hall | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Achieving robust transport has attracted much attention in both electronic
and photonic systems. Time-reversal invariant photonic crystal can be employed
to realize backscattering-immune chiral state, but the chiral bandgap is
topologically trivial. Here, we designed and fabricated a metacrystal
comprising non-resonant meta-atoms sandwiched between two metallic plates and
the system exhibits topological phase transition as established by group
classification. The nontrivial bandgap was confirmed by experimentally measured
transmission spectra, calculated nonzero spin Chern number and Z2 index.
Gapless spin-filtered edge states were demonstrated experimentally by measuring
the magnitude and phase of the fields. The transpsort robustness of the edge
states were also observed when an obstacle is introduced near the edge.
| [
{
"created": "Thu, 2 Jan 2014 05:43:02 GMT",
"version": "v1"
}
] | 2016-02-11 | [
[
"Chen",
"Wen-Jie",
""
],
[
"Jiang",
"Shao-Ji",
""
],
[
"Chen",
"Xiao-Dong",
""
],
[
"Dong",
"Jian-Wen",
""
],
[
"Chan",
"C. T.",
""
]
] | [
-0.005044860765337944,
-0.016235224902629852,
-0.0597478486597538,
0.02773924171924591,
0.003354631131514907,
-0.0012495878618210554,
0.04852062836289406,
-0.0072644115425646305,
-0.04531744122505188,
-0.003080561989918351,
0.03557901456952095,
0.027468163520097733,
-0.056004442274570465,
... | null | null | null | null | null | null | null | [
-0.005044860765337944,
-0.016235224902629852,
-0.0597478486597538,
0.02773924171924591,
0.003354631131514907,
-0.0012495878618210554,
0.04852062836289406,
-0.0072644115425646305,
-0.04531744122505188,
-0.003080561989918351,
0.03557901456952095,
0.027468163520097733,
-0.056004442274570465,
... |
1401.0376 | Chao Zhang | Chao Zhang, Lei Zhang, Wei Fan, Jieping Ye | Generalization Bounds for Representative Domain Adaptation | arXiv admin note: substantial text overlap with arXiv:1304.1574 | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a novel framework to analyze the theoretical
properties of the learning process for a representative type of domain
adaptation, which combines data from multiple sources and one target (or
briefly called representative domain adaptation). In particular, we use the
integral probability metric to measure the difference between the distributions
of two domains and meanwhile compare it with the H-divergence and the
discrepancy distance. We develop the Hoeffding-type, the Bennett-type and the
McDiarmid-type deviation inequalities for multiple domains respectively, and
then present the symmetrization inequality for representative domain
adaptation. Next, we use the derived inequalities to obtain the Hoeffding-type
and the Bennett-type generalization bounds respectively, both of which are
based on the uniform entropy number. Moreover, we present the generalization
bounds based on the Rademacher complexity. Finally, we analyze the asymptotic
convergence and the rate of convergence of the learning process for
representative domain adaptation. We discuss the factors that affect the
asymptotic behavior of the learning process and the numerical experiments
support our theoretical findings as well. Meanwhile, we give a comparison with
the existing results of domain adaptation and the classical results under the
same-distribution assumption.
| [
{
"created": "Thu, 2 Jan 2014 07:32:01 GMT",
"version": "v1"
}
] | 2014-01-03 | [
[
"Zhang",
"Chao",
""
],
[
"Zhang",
"Lei",
""
],
[
"Fan",
"Wei",
""
],
[
"Ye",
"Jieping",
""
]
] | [
0.004706827457994223,
-0.11446034908294678,
0.005380422808229923,
-0.059569843113422394,
0.1194753423333168,
-0.046951066702604294,
0.031631067395210266,
-0.006091611925512552,
0.03060864843428135,
-0.04678500071167946,
-0.07864812761545181,
0.0007492643781006336,
0.08556286990642548,
-0.0... | null | null | null | null | null | null | null | [
0.004706827457994223,
-0.11446034908294678,
0.005380422808229923,
-0.059569843113422394,
0.1194753423333168,
-0.046951066702604294,
0.031631067395210266,
-0.006091611925512552,
0.03060864843428135,
-0.04678500071167946,
-0.07864812761545181,
0.0007492643781006336,
0.08556286990642548,
-0.0... |
1401.0379 | Pierre Lescanne | Katarzyna Grygiel, Pierre Lescanne (LIP) | Counting Terms in the Binary Lambda Calculus | null | null | null | null | cs.LO cs.DM cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In a paper entitled Binary lambda calculus and combinatory logic, John Tromp
presents a simple way of encoding lambda calculus terms as binary sequences. In
what follows, we study the numbers of binary strings of a given size that
represent lambda terms and derive results from their generating functions,
especially that the number of terms of size n grows roughly like 1.963447954^n.
| [
{
"created": "Thu, 2 Jan 2014 07:43:54 GMT",
"version": "v1"
}
] | 2014-01-03 | [
[
"Grygiel",
"Katarzyna",
"",
"LIP"
],
[
"Lescanne",
"Pierre",
"",
"LIP"
]
] | [
0.005895472131669521,
0.003887838451191783,
-0.044013310223817825,
-0.018273714929819107,
-0.08461438119411469,
0.013009446673095226,
0.09185858070850372,
-0.011960329487919807,
0.03388016298413277,
-0.03333889693021774,
-0.03256574273109436,
-0.015056456439197063,
0.03812343254685402,
-0.... | null | null | null | null | null | null | null | [
0.005895472131669521,
0.003887838451191783,
-0.044013310223817825,
-0.018273714929819107,
-0.08461438119411469,
0.013009446673095226,
0.09185858070850372,
-0.011960329487919807,
0.03388016298413277,
-0.03333889693021774,
-0.03256574273109436,
-0.015056456439197063,
0.03812343254685402,
-0.... |
1401.0380 | Jeng-Da Chai | Jeng-Da Chai | Thermally-assisted-occupation density functional theory with
generalized-gradient approximations | 27 pages, 15 figures, 3 tables, supplementary material not included.
This is an extension of our previous work [e.g., see arXiv:1201.4866] | J. Chem. Phys. 140, 18A521 (2014) | 10.1063/1.4867532 | null | physics.chem-ph cond-mat.mtrl-sci cond-mat.str-el physics.atm-clus physics.comp-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We extend the recently proposed thermally-assisted-occupation density
functional theory (TAO-DFT) [J.-D. Chai, J. Chem. Phys. 136, 154104 (2012)] to
generalized-gradient approximation (GGA) exchange-correlation density
functionals. Relative to our previous TAO-LDA (i.e., the local density
approximation to TAO-DFT), the resulting TAO-GGAs are significantly superior
for a wide range of applications, such as thermochemistry, kinetics, and
reaction energies. For noncovalent interactions, TAO-GGAs with empirical
dispersion corrections are shown to yield excellent performance. Due to their
computational efficiency for systems with strong static correlation effects,
TAO-LDA and TAO-GGAs are applied to study the electronic properties (e.g., the
singlet-triplet energy gaps, vertical ionization potentials, vertical electron
affinities, fundamental gaps, and symmetrized von Neumann entropy) of acenes
with different number of linearly fused benzene rings (up to 100), which is
very challenging for conventional electronic structure methods. The ground
states of acenes are shown to be singlets for all the chain lengths studied
here. With the increase of acene length, the singlet-triplet energy gaps,
vertical ionization potentials, and fundamental gaps decrease monotonically,
while the vertical electron affinities and symmetrized von Neumann entropy
(i.e., a measure of polyradical character) increase monotonically.
| [
{
"created": "Thu, 2 Jan 2014 07:48:17 GMT",
"version": "v1"
},
{
"created": "Thu, 13 Feb 2014 19:24:41 GMT",
"version": "v2"
}
] | 2015-06-18 | [
[
"Chai",
"Jeng-Da",
""
]
] | [
-0.09938573837280273,
-0.03901733085513115,
-0.0317084975540638,
0.09810558706521988,
0.01600470207631588,
-0.05688534304499626,
0.056309979408979416,
-0.02999521605670452,
0.019442414864897728,
-0.04057340696454048,
-0.0288860946893692,
-0.01971340924501419,
-0.06189480423927307,
0.033858... | null | null | null | null | null | null | null | [
-0.09938573837280273,
-0.03901733085513115,
-0.0317084975540638,
0.09810558706521988,
0.01600470207631588,
-0.05688534304499626,
0.056309979408979416,
-0.02999521605670452,
0.019442414864897728,
-0.04057340696454048,
-0.0288860946893692,
-0.01971340924501419,
-0.06189480423927307,
0.033858... |
1401.0387 | Giovanni Bussi | Cameron Abrams and Giovanni Bussi | Enhanced Sampling in Molecular Dynamics Using Metadynamics,
Replica-Exchange, and Temperature-Acceleration | Accepted for publication on Entropy | C. Abrams and G. Bussi, Entropy 16, 163 (2014) | 10.3390/e16010163 | null | cond-mat.stat-mech physics.chem-ph physics.comp-ph | http://creativecommons.org/licenses/by/3.0/ | We review a selection of methods for performing enhanced sampling in
molecular dynamics simulations. We consider methods based on collective
variable biasing and on tempering, and offer both historical and contemporary
perspectives. In collective-variable biasing, we first discuss methods stemming
from thermodynamic integration that use mean force biasing, including the
adaptive biasing force algorithm and temperature acceleration. We then turn to
methods that use bias potentials, including umbrella sampling and metadynamics.
We next consider parallel tempering and replica-exchange methods. We conclude
with a brief presentation of some combination methods.
| [
{
"created": "Thu, 2 Jan 2014 08:30:03 GMT",
"version": "v1"
}
] | 2014-01-03 | [
[
"Abrams",
"Cameron",
""
],
[
"Bussi",
"Giovanni",
""
]
] | [
-0.07226812839508057,
-0.03247547522187233,
-0.007060871925204992,
0.05535569041967392,
0.01158087607473135,
-0.053514666855335236,
-0.09039948135614395,
0.00042911130003631115,
0.04187113791704178,
0.039262499660253525,
-0.07669128477573395,
-0.02788500301539898,
0.03171093761920929,
-0.0... | null | null | null | null | null | null | null | [
-0.07226812839508057,
-0.03247547522187233,
-0.007060871925204992,
0.05535569041967392,
0.01158087607473135,
-0.053514666855335236,
-0.09039948135614395,
0.00042911130003631115,
0.04187113791704178,
0.039262499660253525,
-0.07669128477573395,
-0.02788500301539898,
0.03171093761920929,
-0.0... |
1401.0395 | Trupti Kodinariya prof | Trupti M. Kodinariya | Hybrid Approach to Face Recognition System using Principle component and
Independent component with score based fusion process | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Hybrid approach has a special status among Face Recognition Systems as they
combine different recognition approaches in an either serial or parallel to
overcome the shortcomings of individual methods. This paper explores the area
of Hybrid Face Recognition using score based strategy as a combiner/fusion
process. In proposed approach, the recognition system operates in two modes:
training and classification. Training mode involves normalization of the face
images (training set), extracting appropriate features using Principle
Component Analysis (PCA) and Independent Component Analysis (ICA). The
extracted features are then trained in parallel using Back-propagation neural
networks (BPNNs) to partition the feature space in to different face classes.
In classification mode, the trained PCA BPNN and ICA BPNN are fed with new face
image(s). The score based strategy which works as a combiner is applied to the
results of both PCA BPNN and ICA BPNN to classify given new face image(s)
according to face classes obtained during the training mode. The proposed
approach has been tested on ORL and other face databases; the experimented
results show that the proposed system has higher accuracy than face recognition
systems using single feature extractor.
| [
{
"created": "Thu, 2 Jan 2014 09:21:24 GMT",
"version": "v1"
}
] | 2014-01-03 | [
[
"Kodinariya",
"Trupti M.",
""
]
] | [
-0.034635815769433975,
-0.004394748713821173,
-0.0026541552506387234,
-0.014156597666442394,
0.03747829422354698,
0.08337695896625519,
-0.007281824946403503,
0.014844059944152832,
-0.04818163812160492,
-0.09111201763153076,
0.021668873727321625,
-0.053412169218063354,
0.04177238792181015,
... | null | null | null | null | null | null | null | [
-0.034635815769433975,
-0.004394748713821173,
-0.0026541552506387234,
-0.014156597666442394,
0.03747829422354698,
0.08337695896625519,
-0.007281824946403503,
0.014844059944152832,
-0.04818163812160492,
-0.09111201763153076,
0.021668873727321625,
-0.053412169218063354,
0.04177238792181015,
... |
1401.0396 | Marek Piotr\'ow | Marek Piotr\'ow | Faster 3-Periodic Merging Networks | null | null | null | null | cs.DS cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the problem of merging two sorted sequences on a comparator
network that is used repeatedly, that is, if the output is not sorted, the
network is applied again using the output as input. The challenging task is to
construct such networks of small depth. The first constructions of merging
networks with a constant period were given by Kuty{\l}owski, Lory\'s and
Oesterdikhoff. They have given $3$-periodic network that merges two sorted
sequences of $N$ numbers in time $12\log N$ and a similar network of period $4$
that works in $5.67\log N$. We present a new family of such networks that are
based on Canfield and Williamson periodic sorter. Our $3$-periodic merging
networks work in time upper-bounded by $6\log N$. The construction can be
easily generalized to larger constant periods with decreasing running time, for
example, to $4$-periodic ones that work in time upper-bounded by $4\log N$.
Moreover, to obtain the facts we have introduced a new proof technique.
| [
{
"created": "Thu, 2 Jan 2014 09:24:17 GMT",
"version": "v1"
}
] | 2014-01-03 | [
[
"Piotrów",
"Marek",
""
]
] | [
-0.053292494267225266,
-0.019815340638160706,
-0.002983987098559737,
-0.09513581544160843,
-0.040934111922979355,
-0.00023960806720424443,
-0.02469482645392418,
-0.009743866510689259,
0.017902472987771034,
-0.08357632905244827,
-0.03786131739616394,
0.07047371566295624,
0.00402591098099947,
... | null | null | null | null | null | null | null | [
-0.053292494267225266,
-0.019815340638160706,
-0.002983987098559737,
-0.09513581544160843,
-0.040934111922979355,
-0.00023960806720424443,
-0.02469482645392418,
-0.009743866510689259,
0.017902472987771034,
-0.08357632905244827,
-0.03786131739616394,
0.07047371566295624,
0.00402591098099947,
... |
1401.0400 | Simon Schmidt | Gabriel Renault and Simon Schmidt | On the Complexity of the Mis\`ere Version of Three Games Played on
Graphs | null | null | null | null | cs.DM math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We investigate the complexity of finding a winning strategy for the mis\`ere
version of three games played on graphs : two variants of the game
$\text{NimG}$, introduced by Stockmann in 2004 and the game $\text{Vertex
Geography}$ on both directed and undirected graphs. We show that on general
graphs those three games are $\text{PSPACE}$-Hard or Complete. For one
$\text{PSPACE}$-Hard variant of $\text{NimG}$, we find an algorithm to compute
an effective winning strategy in time $\mathcal{O}(\sqrt{|V(G)|}.|E(G)|)$ when
$G$ is a bipartite graph.
| [
{
"created": "Thu, 2 Jan 2014 09:43:40 GMT",
"version": "v1"
},
{
"created": "Sun, 3 May 2015 16:12:37 GMT",
"version": "v2"
}
] | 2015-05-05 | [
[
"Renault",
"Gabriel",
""
],
[
"Schmidt",
"Simon",
""
]
] | [
0.013020869344472885,
-0.02649870328605175,
0.006005727685987949,
-0.0841587707400322,
0.00017785676755011082,
-0.015679193660616875,
0.008565821684896946,
0.014486757107079029,
-0.029668349772691727,
0.09279021620750427,
-0.0978911742568016,
0.03882468119263649,
0.02813030034303665,
0.007... | null | null | null | null | null | null | null | [
0.013020869344472885,
-0.02649870328605175,
0.006005727685987949,
-0.0841587707400322,
0.00017785676755011082,
-0.015679193660616875,
0.008565821684896946,
0.014486757107079029,
-0.029668349772691727,
0.09279021620750427,
-0.0978911742568016,
0.03882468119263649,
0.02813030034303665,
0.007... |
1401.0406 | Milton da Costa Lopes Fo. | Anne Bronzi, Milton Lopes Filho and Helena Nussenzveig Lopes | Wild solutions for 2D incompressible ideal flow with passive tracer | 10 pages | null | 10.4310/CMS.2015.v13.n5.a12 | null | math.AP physics.flu-dyn | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In Ann. Math., 170 (2009), 1417-1436, C. De Lellis and L. Sz\'ekelyhidi Jr.
constructed wild solutions of the incompressible Euler equations using a
reformulation of the Euler equations as a differential inclusion together with
convex integration. In this article we adapt their construction to the system
consisting of adding the transport of a passive scalar to the two-dimensional
incompressible Euler equations.
| [
{
"created": "Thu, 2 Jan 2014 10:18:58 GMT",
"version": "v1"
}
] | 2015-10-01 | [
[
"Bronzi",
"Anne",
""
],
[
"Filho",
"Milton Lopes",
""
],
[
"Lopes",
"Helena Nussenzveig",
""
]
] | [
-0.10358292609453201,
-0.01430731825530529,
0.02775716409087181,
0.011277553625404835,
0.06785368919372559,
-0.013762500137090683,
0.07854530960321426,
0.03593618422746658,
-0.06802760064601898,
-0.007297847419977188,
0.029426055029034615,
0.003879757132381201,
0.06416185200214386,
0.02789... | null | null | null | null | null | null | null | [
-0.10358292609453201,
-0.01430731825530529,
0.02775716409087181,
0.011277553625404835,
0.06785368919372559,
-0.013762500137090683,
0.07854530960321426,
0.03593618422746658,
-0.06802760064601898,
-0.007297847419977188,
0.029426055029034615,
0.003879757132381201,
0.06416185200214386,
0.02789... |
1401.0412 | Fei Tan | Fei Tan, Jiajing Wu, Yongxiang Xia and Chi K. Tse | Traffic congestion in interconnected complex networks | 8 pages | Phys. Rev. E 89, 062813 (2014) | 10.1103/PhysRevE.89.062813 | null | physics.soc-ph cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Traffic congestion in isolated complex networks has been investigated
extensively over the last decade. Coupled network models have recently been
developed to facilitate further understanding of real complex systems. Analysis
of traffic congestion in coupled complex networks, however, is still relatively
unexplored. In this paper, we try to explore the effect of interconnections on
traffic congestion in interconnected BA scale-free networks. We find that
assortative coupling can alleviate traffic congestion more readily than
disassortative and random coupling when the node processing capacity is
allocated based on node usage probability. Furthermore, the optimal coupling
probability can be found for assortative coupling. However, three types of
coupling preferences achieve similar traffic performance if all nodes share the
same processing capacity. We analyze interconnected Internet AS-level graphs of
South Korea and Japan and obtain similar results. Some practical suggestions
are presented to optimize such real-world interconnected networks accordingly.
| [
{
"created": "Thu, 2 Jan 2014 11:06:58 GMT",
"version": "v1"
},
{
"created": "Thu, 23 Jan 2014 02:03:14 GMT",
"version": "v2"
}
] | 2014-07-02 | [
[
"Tan",
"Fei",
""
],
[
"Wu",
"Jiajing",
""
],
[
"Xia",
"Yongxiang",
""
],
[
"Tse",
"Chi K.",
""
]
] | [
0.04378269612789154,
-0.08901389688253403,
-0.008829506114125252,
-0.013110434636473656,
-0.04337817057967186,
-0.020657725632190704,
-0.023441161960363388,
0.03487928956747055,
0.01997859962284565,
-0.003362880786880851,
-0.008528117090463638,
-0.021973777562379837,
0.002887131879106164,
... | null | null | null | null | null | null | null | [
0.04378269612789154,
-0.08901389688253403,
-0.008829506114125252,
-0.013110434636473656,
-0.04337817057967186,
-0.020657725632190704,
-0.023441161960363388,
0.03487928956747055,
0.01997859962284565,
-0.003362880786880851,
-0.008528117090463638,
-0.021973777562379837,
0.002887131879106164,
... |
1401.0417 | Christos Boutsidis | Christos Boutsidis, Malik Magdon-Ismail | Faster SVD-Truncated Least-Squares Regression | 2014 IEEE International Symposium on Information Theory | null | null | null | cs.DS math.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We develop a fast algorithm for computing the "SVD-truncated" regularized
solution to the least-squares problem: $ \min_{\x} \TNorm{\matA \x - \b}. $ Let
$\matA_k$ of rank $k$ be the best rank $k$ matrix computed via the SVD of
$\matA$. Then, the SVD-truncated regularized solution is: $ \x_k =
\pinv{\matA}_k \b. $ If $\matA$ is $m \times n$, then, it takes $O(m n
\min\{m,n\})$ time to compute $\x_k $ using the SVD of \math{\matA}. We give an
approximation algorithm for \math{\x_k} which constructs a rank-\math{k}
approximation $\tilde{\matA}_{k}$ and computes $ \tilde{\x}_{k} =
\pinv{\tilde\matA}_{k} \b$ in roughly $O(\nnz(\matA) k \log n)$ time. Our
algorithm uses a randomized variant of the subspace iteration. We show that,
with high probability: $ \TNorm{\matA \tilde{\x}_{k} - \b} \approx \TNorm{\matA
\x_k - \b}$ and $\TNorm{\x_k - \tilde\x_k} \approx 0. $
| [
{
"created": "Thu, 2 Jan 2014 11:19:11 GMT",
"version": "v1"
},
{
"created": "Wed, 28 May 2014 19:44:50 GMT",
"version": "v2"
}
] | 2014-05-29 | [
[
"Boutsidis",
"Christos",
""
],
[
"Magdon-Ismail",
"Malik",
""
]
] | [
-0.031103791669011116,
0.005450728815048933,
0.04334839805960655,
-0.02628367953002453,
0.06600538641214371,
-0.028333038091659546,
0.0029697492718696594,
-0.025311045348644257,
0.046357735991477966,
0.03141036257147789,
0.011508669704198837,
0.11297597736120224,
-0.011820989660918713,
0.0... | null | null | null | null | null | null | null | [
-0.031103791669011116,
0.005450728815048933,
0.04334839805960655,
-0.02628367953002453,
0.06600538641214371,
-0.028333038091659546,
0.0029697492718696594,
-0.025311045348644257,
0.046357735991477966,
0.03141036257147789,
0.011508669704198837,
0.11297597736120224,
-0.011820989660918713,
0.0... |
1401.0423 | Jungwon Kim | Hyoji Kim, Peng Qin, Youjian Song, Heewon Yang, Junho Shin, Chur Kim,
Kwangyun Jung, Chingyue Wang, and Jungwon Kim | Sub-20-Attosecond Timing Jitter Mode-Locked Fiber Lasers | 7 pages, 8 figures, 1 table | IEEE J. Sel. Top. Quantum Electron. 20, 901108 (2014) | 10.1109/JSTQE.2014.2298454 | null | physics.optics physics.ins-det | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We demonstrate 14.3-attosecond timing jitter [integrated from 10 kHz to 94
MHz offset frequency] optical pulse trains from 188-MHz repetition-rate
mode-locked Yb-fiber lasers. In order to minimize the timing jitter, we shorten
the non-gain fiber length to shorten the pulsewidth and reduce excessive
higher-order nonlinearity and nonlinear chirp in the fiber laser. The measured
jitter spectrum is limited by the amplified spontaneous emission limited
quantum noise in the 100 kHz - 1 MHz offset frequency range, while it was
limited by the relative intensity noise-converted jitter in the lower offset
frequency range. This intrinsically low timing jitter enables
sub-100-attosecond synchronization between the two mode-locked Yb-fiber lasers
over the full Nyquist frequency with a modest 10-kHz locking bandwidth. The
demonstrated performance is the lowest timing jitter measured from any
free-running mode-locked fiber lasers, comparable to the performance of the
lowest-jitter Ti:sapphire solid-state lasers.
| [
{
"created": "Thu, 2 Jan 2014 11:56:41 GMT",
"version": "v1"
},
{
"created": "Fri, 17 Jan 2014 11:37:16 GMT",
"version": "v2"
}
] | 2014-03-25 | [
[
"Kim",
"Hyoji",
""
],
[
"Qin",
"Peng",
""
],
[
"Song",
"Youjian",
""
],
[
"Yang",
"Heewon",
""
],
[
"Shin",
"Junho",
""
],
[
"Kim",
"Chur",
""
],
[
"Jung",
"Kwangyun",
""
],
[
"Wang",
"Chingyue"... | [
0.002905092900618911,
-0.05663910508155823,
-0.005943198688328266,
0.021154092624783516,
-0.05072043091058731,
0.021533498540520668,
0.038523439317941666,
-0.05739226192235947,
-0.0017906668363139033,
-0.04830295965075493,
0.04256325960159302,
0.08323557674884796,
-0.11913225799798965,
-0.... | null | null | null | null | null | null | null | [
0.002905092900618911,
-0.05663910508155823,
-0.005943198688328266,
0.021154092624783516,
-0.05072043091058731,
0.021533498540520668,
0.038523439317941666,
-0.05739226192235947,
-0.0017906668363139033,
-0.04830295965075493,
0.04256325960159302,
0.08323557674884796,
-0.11913225799798965,
-0.... |
1401.0430 | Constantin Siriteanu | Constantin Siriteanu, Akimichi Takemura, Satoshi Kuriki, Donald St. P.
Richards, Hyundong Shin | Schur Complement Based Analysis of MIMO Zero-Forcing for Rician Fading | 32 pages, 4 figures, 1 table | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For multiple-input/multiple-output (MIMO) spatial multiplexing with
zero-forcing detection (ZF), signal-to-noise ratio (SNR) analysis for Rician
fading involves the cumbersome noncentral-Wishart distribution (NCWD) of the
transmit sample-correlation (Gramian) matrix. An \textsl{approximation} with a
\textsl{virtual} CWD previously yielded for the ZF SNR an approximate (virtual)
Gamma distribution. However, analytical conditions qualifying the accuracy of
the SNR-distribution approximation were unknown. Therefore, we have been
attempting to exactly characterize ZF SNR for Rician fading. Our previous
attempts succeeded only for the sole Rician-fading stream under
Rician--Rayleigh fading, by writing it as scalar Schur complement (SC) in the
Gramian. Herein, we pursue a more general, matrix-SC-based analysis to
characterize SNRs when several streams may undergo Rician fading. On one hand,
for full-Rician fading, the SC distribution is found to be exactly a CWD if and
only if a channel-mean--correlation \textsl{condition} holds. Interestingly,
this CWD then coincides with the \textsl{virtual} CWD ensuing from the
\textsl{approximation}. Thus, under the \textsl{condition}, the actual and
virtual SNR-distributions coincide. On the other hand, for Rician--Rayleigh
fading, the matrix-SC distribution is characterized in terms of determinant of
matrix with elementary-function entries, which also yields a new
characterization of the ZF SNR. Average error probability results validate our
analysis vs.~simulation.
| [
{
"created": "Thu, 2 Jan 2014 12:57:23 GMT",
"version": "v1"
},
{
"created": "Tue, 4 Mar 2014 13:28:59 GMT",
"version": "v2"
},
{
"created": "Thu, 13 Mar 2014 23:59:25 GMT",
"version": "v3"
},
{
"created": "Fri, 26 Sep 2014 06:47:16 GMT",
"version": "v4"
}
] | 2014-09-29 | [
[
"Siriteanu",
"Constantin",
""
],
[
"Takemura",
"Akimichi",
""
],
[
"Kuriki",
"Satoshi",
""
],
[
"Richards",
"Donald St. P.",
""
],
[
"Shin",
"Hyundong",
""
]
] | [
0.0021307487040758133,
-0.07593514770269394,
0.00002166010017390363,
-0.003767509711906314,
0.006602191831916571,
0.04060981795191765,
0.012484343722462654,
-0.06103047728538513,
0.06573402136564255,
0.04467911273241043,
-0.0036684409715235233,
0.02303600311279297,
0.10488522052764893,
0.1... | null | null | null | null | null | null | null | [
0.0021307487040758133,
-0.07593514770269394,
0.00002166010017390363,
-0.003767509711906314,
0.006602191831916571,
0.04060981795191765,
0.012484343722462654,
-0.06103047728538513,
0.06573402136564255,
0.04467911273241043,
-0.0036684409715235233,
0.02303600311279297,
0.10488522052764893,
0.1... |
1401.0432 | G Ramakrishna | N.S. Narayanaswamy and G. Ramakrishna | On Minimum Average Stretch Spanning Trees in Polygonal 2-trees | 17 pages, 12 figures | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A spanning tree of an unweighted graph is a minimum average stretch spanning
tree if it minimizes the ratio of sum of the distances in the tree between the
end vertices of the graph edges and the number of graph edges. We consider the
problem of computing a minimum average stretch spanning tree in polygonal
2-trees, a super class of 2-connected outerplanar graphs. For a polygonal
2-tree on $n$ vertices, we present an algorithm to compute a minimum average
stretch spanning tree in $O(n \log n)$ time. This algorithm also finds a
minimum fundamental cycle basis in polygonal 2-trees.
| [
{
"created": "Thu, 2 Jan 2014 13:31:13 GMT",
"version": "v1"
},
{
"created": "Mon, 14 Apr 2014 07:37:46 GMT",
"version": "v2"
}
] | 2014-04-15 | [
[
"Narayanaswamy",
"N. S.",
""
],
[
"Ramakrishna",
"G.",
""
]
] | [
-0.02042616717517376,
0.04039894789457321,
0.003807529341429472,
0.005831301212310791,
0.023655425757169724,
-0.08605912327766418,
-0.0787518173456192,
0.13665632903575897,
-0.03829634562134743,
-0.012166930362582207,
-0.022085150703787804,
-0.01569473184645176,
0.0008074560901150107,
0.02... | null | null | null | null | null | null | null | [
-0.02042616717517376,
0.04039894789457321,
0.003807529341429472,
0.005831301212310791,
0.023655425757169724,
-0.08605912327766418,
-0.0787518173456192,
0.13665632903575897,
-0.03829634562134743,
-0.012166930362582207,
-0.022085150703787804,
-0.01569473184645176,
0.0008074560901150107,
0.02... |
1401.0437 | Omer Melih Gul | Omer Melih Gul, Elif Uysal-Biyikoglu | UROP: A Simple, Near-Optimal Scheduling Policy for Energy Harvesting
Sensors | 32 pages, 10 figures, submitted to IEEE Transactions on Information
Theory | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper considers a single-hop wireless network where a central node (or
fusion center, FC) collects data from a set of m energy harvesting (EH) nodes
(e.g. nodes of a wireless sensor network). In each time slot, k of m nodes can
be scheduled by the FC for transmission over k orthogonal channels. FC has no
knowledge about EH processes and current battery states of nodes; however, it
knows outcomes of previous transmission attempts. The objective is to find a
low complexity scheduling policy that maximizes total throughput of the data
backlogged system using the harvested energy, for all types (uniform,
non-uniform, independent, correlated (i.e. Markovian), etc.) EH processes.
Energy is assumed to be stored losslessly in the nodes batteries, up to a
storage capacity (the infinite capacity case is also considered.) The problem
is treated in finite and infinite problem horizons. A low-complexity policy,
UROP (Uniformizing Random Ordered Policy) is proposed, whose near optimality is
shown. Numerical examples indicate that under a reasonable-sized battery
capacity, UROP uses the arriving energy with almost perfect efficiency. As the
problem is a restless multi-armed bandit (RMAB) problem with an average reward
criterion, UROP may have a wider application area than communication networks.
| [
{
"created": "Thu, 2 Jan 2014 13:49:28 GMT",
"version": "v1"
}
] | 2014-01-03 | [
[
"Gul",
"Omer Melih",
""
],
[
"Uysal-Biyikoglu",
"Elif",
""
]
] | [
-0.053239498287439346,
0.08725807070732117,
-0.03788837790489197,
0.037196774035692215,
0.027960900217294693,
-0.06352143734693527,
0.07728182524442673,
-0.049529410898685455,
-0.006753183901309967,
0.12243208289146423,
-0.033946581184864044,
0.04342234134674072,
0.09580380469560623,
-0.02... | null | null | null | null | null | null | null | [
-0.053239498287439346,
0.08725807070732117,
-0.03788837790489197,
0.037196774035692215,
0.027960900217294693,
-0.06352143734693527,
0.07728182524442673,
-0.049529410898685455,
-0.006753183901309967,
0.12243208289146423,
-0.033946581184864044,
0.04342234134674072,
0.09580380469560623,
-0.02... |
1401.0443 | Pradeesha Ashok | Pradeesha Ashok and Ninad Rajgopal and Sathish Govindarajan | Selection Lemmas for various geometric objects | null | null | null | null | cs.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Selection lemmas are classical results in discrete geometry that have been
well studied and have applications in many geometric problems like weak epsilon
nets and slimming Delaunay triangulations. Selection lemma type results
typically show that there exists a point that is contained in many objects that
are induced (spanned) by an underlying point set.
In the first selection lemma, we consider the set of all the objects induced
(spanned) by a point set $P$. This question has been widely explored for
simplices in $\mathbb{R}^d$, with tight bounds in $\mathbb{R}^2$. In our paper,
we prove first selection lemma for other classes of geometric objects. We also
consider the strong variant of this problem where we add the constraint that
the piercing point comes from $P$. We prove an exact result on the strong and
the weak variant of the first selection lemma for axis-parallel rectangles,
special subclasses of axis-parallel rectangles like quadrants and slabs, disks
(for centrally symmetric point sets). We also show non-trivial bounds on the
first selection lemma for axis-parallel boxes and hyperspheres in
$\mathbb{R}^d$.
In the second selection lemma, we consider an arbitrary $m$ sized subset of
the set of all objects induced by $P$. We study this problem for axis-parallel
rectangles and show that there exists an point in the plane that is contained
in $\frac{m^3}{24n^4}$ rectangles. This is an improvement over the previous
bound by Smorodinsky and Sharir when $m$ is almost quadratic.
| [
{
"created": "Thu, 2 Jan 2014 14:06:04 GMT",
"version": "v1"
}
] | 2014-01-03 | [
[
"Ashok",
"Pradeesha",
""
],
[
"Rajgopal",
"Ninad",
""
],
[
"Govindarajan",
"Sathish",
""
]
] | [
-0.0012270889710634947,
-0.015560856088995934,
0.014023971743881702,
-0.0777212530374527,
0.08823443204164505,
0.030512435361742973,
0.06703194975852966,
0.008818225935101509,
0.07380198687314987,
0.01658870279788971,
-0.03162285313010216,
-0.018198207020759583,
0.033916737884283066,
0.032... | null | null | null | null | null | null | null | [
-0.0012270889710634947,
-0.015560856088995934,
0.014023971743881702,
-0.0777212530374527,
0.08823443204164505,
0.030512435361742973,
0.06703194975852966,
0.008818225935101509,
0.07380198687314987,
0.01658870279788971,
-0.03162285313010216,
-0.018198207020759583,
0.033916737884283066,
0.032... |
1401.0444 | Vincent Wens | Vincent Wens | Investigating complex networks with inverse models: analytical aspects
of spatial leakage and connectivity estimation | 19 pages, 4 figures, including 5 appendices; v2: minor edits, 1
appendix added; v3: expanded version, v4: minor edits | Physical Review E 91, 012823 (2015) | 10.1103/PhysRevE.91.012823 | null | physics.data-an q-bio.NC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Network theory and inverse modeling are two standard tools of applied
physics, whose combination is needed when studying the dynamical organization
of spatially distributed systems from indirect measurements. However, the
associated connectivity estimation may be affected by spatial leakage, an
artifact of inverse modeling that limits the interpretability of network
analysis. This paper investigates general analytical aspects pertaining to this
issue. First, the existence of spatial leakage is derived from the topological
structure of inverse operators. Then, the geometry of spatial leakage is
modeled and used to define a geometric correction scheme, which limits spatial
leakage effects in connectivity estimation. Finally, this new approach for
network analysis is compared analytically to existing methods based on linear
regressions, which are shown to yield biased coupling estimates.
| [
{
"created": "Thu, 2 Jan 2014 14:09:31 GMT",
"version": "v1"
},
{
"created": "Mon, 6 Jan 2014 08:16:56 GMT",
"version": "v2"
},
{
"created": "Wed, 10 Dec 2014 17:36:40 GMT",
"version": "v3"
},
{
"created": "Thu, 29 Jan 2015 13:37:24 GMT",
"version": "v4"
}
] | 2015-01-30 | [
[
"Wens",
"Vincent",
""
]
] | [
-0.008772479370236397,
-0.07530998438596725,
0.1102212592959404,
0.09208235889673233,
-0.00794874969869852,
-0.08243857324123383,
-0.013523850589990616,
-0.01107051782310009,
0.10375461727380753,
0.023190869018435478,
-0.009693820029497147,
0.058779921382665634,
0.016653018072247505,
0.009... | null | null | null | null | null | null | null | [
-0.008772479370236397,
-0.07530998438596725,
0.1102212592959404,
0.09208235889673233,
-0.00794874969869852,
-0.08243857324123383,
-0.013523850589990616,
-0.01107051782310009,
0.10375461727380753,
0.023190869018435478,
-0.009693820029497147,
0.058779921382665634,
0.016653018072247505,
0.009... |
1401.0445 | Siva ANANTHARAMAN | Siva Anantharaman (LIFO, Universite d'Orleans (France)), Christopher
Bouchard (University at Albany - SUNY), Paliath Narendran (University at
Albany - SUNY), Micha\"el Rusinowitch (Loria-INRIA Grand Est, Nancy (France)) | Unification modulo a 2-sorted Equational theory for Cipher-Decipher
Block Chaining | 26 pages | Logical Methods in Computer Science, Volume 10, Issue 1 (February
9, 2014) lmcs:808 | 10.2168/LMCS-10(1:5)2014 | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We investigate unification problems related to the Cipher Block Chaining
(CBC) mode of encryption. We first model chaining in terms of a simple,
convergent, rewrite system over a signature with two disjoint sorts: list and
element. By interpreting a particular symbol of this signature suitably, the
rewrite system can model several practical situations of interest. An inference
procedure is presented for deciding the unification problem modulo this rewrite
system. The procedure is modular in the following sense: any given problem is
handled by a system of `list-inferences', and the set of equations thus derived
between the element-terms of the problem is then handed over to any
(`black-box') procedure which is complete for solving these element-equations.
An example of application of this unification procedure is given, as attack
detection on a Needham-Schroeder like protocol, employing the CBC encryption
mode based on the associative-commutative (AC) operator XOR. The 2-sorted
convergent rewrite system is then extended into one that fully captures a block
chaining encryption-decryption mode at an abstract level, using no AC-symbols;
and unification modulo this extended system is also shown to be decidable.
| [
{
"created": "Thu, 2 Jan 2014 14:17:55 GMT",
"version": "v1"
},
{
"created": "Tue, 4 Feb 2014 21:35:17 GMT",
"version": "v2"
},
{
"created": "Thu, 6 Feb 2014 13:14:05 GMT",
"version": "v3"
}
] | 2015-07-01 | [
[
"Anantharaman",
"Siva",
"",
"LIFO, Universite d'Orleans"
],
[
"Bouchard",
"Christopher",
"",
"University at Albany - SUNY"
],
[
"Narendran",
"Paliath",
"",
"University at\n Albany - SUNY"
],
[
"Rusinowitch",
"Michaël",
"",
"Loria-INRIA G... | [
-0.11398223787546158,
0.07309142500162125,
0.018576549366116524,
-0.0003994382859673351,
-0.04731832817196846,
-0.057239364832639694,
-0.01764705963432789,
-0.008745040744543076,
0.018237940967082977,
-0.030623603612184525,
-0.0017419009236618876,
-0.015762189403176308,
0.07158627361059189,
... | null | null | null | null | null | null | null | [
-0.11398223787546158,
0.07309142500162125,
0.018576549366116524,
-0.0003994382859673351,
-0.04731832817196846,
-0.057239364832639694,
-0.01764705963432789,
-0.008745040744543076,
0.018237940967082977,
-0.030623603612184525,
-0.0017419009236618876,
-0.015762189403176308,
0.07158627361059189,
... |
1401.0447 | Renaud Lambiotte | Renaud Lambiotte, Vsevolod Salnikov and Martin Rosvall | Effect of Memory on the Dynamics of Random Walks on Networks | 6 pages; 6 figures | null | null | null | physics.soc-ph cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Pathways of diffusion observed in real-world systems often require stochastic
processes going beyond first-order Markov models, as implicitly assumed in
network theory. In this work, we focus on second-order Markov models, and
derive an analytical expression for the effect of memory on the spectral gap
and thus, equivalently, on the characteristic time needed for the stochastic
process to asymptotically reach equilibrium. Perturbation analysis shows that
standard first-order Markov models can either overestimate or underestimate the
diffusion rate of flows across the modular structure of a system captured by a
second-order Markov network. We test the theoretical predictions on a toy
example and on numerical data, and discuss their implications for network
theory, in particular in the case of temporal or multiplex networks.
| [
{
"created": "Thu, 2 Jan 2014 14:27:29 GMT",
"version": "v1"
}
] | 2014-01-03 | [
[
"Lambiotte",
"Renaud",
""
],
[
"Salnikov",
"Vsevolod",
""
],
[
"Rosvall",
"Martin",
""
]
] | [
0.04478299617767334,
-0.07664863765239716,
-0.015608998015522957,
0.009873817674815655,
0.027871906757354736,
-0.027236323803663254,
-0.01519007422029972,
-0.023967348039150238,
0.10420116782188416,
-0.0430312380194664,
0.07461443543434143,
0.08503930270671844,
0.06825371086597443,
-0.0082... | null | null | null | null | null | null | null | [
0.04478299617767334,
-0.07664863765239716,
-0.015608998015522957,
0.009873817674815655,
0.027871906757354736,
-0.027236323803663254,
-0.01519007422029972,
-0.023967348039150238,
0.10420116782188416,
-0.0430312380194664,
0.07461443543434143,
0.08503930270671844,
0.06825371086597443,
-0.0082... |
1401.0450 | Michele Merano | G.Jayaswal, G.Mistura, and M.Merano | Observation of the Imbert-Fedorov effect via weak value amplification | null | null | 10.1364/OL.39.002266 | null | physics.optics quant-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Weak measurements have recently allowed for the observation of the spin-Hall
effect of light in reflection or transmission, which is a spin-dependent light
beam shift orthogonal to the plane of incidence. We report here the observation
of the Imbert-Fedorov shift via a weak value amplification scheme. The
Imbert-Fedorov effect does not depend on the spin of the incident photon only,
but it has richer polarization dependence. We prove that weak measurements
allow for a complete experimental characterization of the polarization
properties of this tiny optical effect.
| [
{
"created": "Thu, 2 Jan 2014 14:42:27 GMT",
"version": "v1"
},
{
"created": "Fri, 24 Jan 2014 11:11:04 GMT",
"version": "v2"
},
{
"created": "Wed, 19 Mar 2014 16:45:23 GMT",
"version": "v3"
}
] | 2015-06-18 | [
[
"Jayaswal",
"G.",
""
],
[
"Mistura",
"G.",
""
],
[
"Merano",
"M.",
""
]
] | [
-0.04894273355603218,
-0.04514601454138756,
-0.020078977569937706,
-0.019400378689169884,
-0.007025496102869511,
-0.02044135145843029,
0.034882042557001114,
-0.03013812005519867,
-0.018653085455298424,
0.03733329474925995,
-0.006997006479650736,
0.07987203449010849,
-0.03267122432589531,
0... | null | null | null | null | null | null | null | [
-0.04894273355603218,
-0.04514601454138756,
-0.020078977569937706,
-0.019400378689169884,
-0.007025496102869511,
-0.02044135145843029,
0.034882042557001114,
-0.03013812005519867,
-0.018653085455298424,
0.03733329474925995,
-0.006997006479650736,
0.07987203449010849,
-0.03267122432589531,
0... |
1401.0458 | David F. Nettleton | David F. Nettleton, Vicenc Torra, and Anton Dries | The effect of constraints on information loss and risk for clustering
and modification based graph anonymization methods | 21 pages, 6 figures, 7 tables | null | null | This research is partially supported by the Spanish MEC (projects
ARES CONSOLIDER INGENIO 2010 CSD2007-00004--eAEGISTSI2007-65406-C03-02--and
HIPERGRAPH TIN2009-14560-C03-01) | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we present a novel approach for anonymizing Online Social
Network graphs which can be used in conjunction with existing perturbation
approaches such as clustering and modification. The main insight of this paper
is that by imposing additional constraints on which nodes can be selected we
can reduce the information loss with respect to key structural metrics, while
maintaining an acceptable risk. We present and evaluate two constraints,
'local1' and 'local2' which select the most similar subgraphs within the same
community while excluding some key structural nodes. To this end, we introduce
a novel distance metric based on local subgraph characteristics and which is
calibrated using an isomorphism matcher. Empirical testing is conducted with
three real OSN datasets, six information loss measures, five adversary queries
as risk measures, and different levels of k-anonymity. The results show that
overall, the methods with constraints give the best results for information
loss and risk of disclosure.
| [
{
"created": "Thu, 2 Jan 2014 15:46:06 GMT",
"version": "v1"
},
{
"created": "Fri, 14 Feb 2014 17:04:36 GMT",
"version": "v2"
},
{
"created": "Thu, 27 Feb 2014 17:02:33 GMT",
"version": "v3"
},
{
"created": "Tue, 1 Jul 2014 15:10:06 GMT",
"version": "v4"
}
] | 2021-01-07 | [
[
"Nettleton",
"David F.",
""
],
[
"Torra",
"Vicenc",
""
],
[
"Dries",
"Anton",
""
]
] | [
-0.09948870539665222,
-0.015707483515143394,
-0.0090330196544528,
0.03261673450469971,
0.04150984808802605,
-0.020756591111421585,
0.03167589753866196,
-0.032651640474796295,
0.06397107243537903,
-0.040673159062862396,
0.06323216110467911,
-0.05270925536751747,
0.09919998049736023,
0.01297... | null | null | null | null | null | null | null | [
-0.09948870539665222,
-0.015707483515143394,
-0.0090330196544528,
0.03261673450469971,
0.04150984808802605,
-0.020756591111421585,
0.03167589753866196,
-0.032651640474796295,
0.06397107243537903,
-0.040673159062862396,
0.06323216110467911,
-0.05270925536751747,
0.09919998049736023,
0.01297... |
1401.0461 | Boris Gralak | Boris Gralak, Michel Lequime, Myriam Zerrad, Claude Amra | Phase retrieval of reflection and transmission coefficients from
Kramers-Kronig relations | submitted for publication | null | 10.1364/JOSAA.32.000456 | null | physics.optics | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Analytic and passivity properties of reflection and transmission coefficients
of thin-film multilayered stacks are investigated. Using a rigorous formalism
based on the inverse Helmholtz operator, properties associated to causality
principle and passivity are established when both temporal frequency and
spatial wavevector are continued in the complex plane. This result extends the
range of situations where the Kramers-Kronig relations can be used to deduce
the phase from the intensity. In particular, it is rigorously shown that
Kramers-Kronig relations for reflection and transmission coefficients remain
valid at a fixed angle of incidence. Possibilities to exploit the new
relationships are discussed.
| [
{
"created": "Thu, 2 Jan 2014 16:04:00 GMT",
"version": "v1"
}
] | 2015-06-18 | [
[
"Gralak",
"Boris",
""
],
[
"Lequime",
"Michel",
""
],
[
"Zerrad",
"Myriam",
""
],
[
"Amra",
"Claude",
""
]
] | [
-0.010991287417709827,
-0.010833789594471455,
0.06716234982013702,
0.006663444917649031,
-0.020301274955272675,
0.01604178361594677,
0.026377134025096893,
0.028881991282105446,
-0.017270175740122795,
-0.020779669284820557,
-0.01430994737893343,
-0.04359268397092819,
-0.01119083259254694,
0... | null | null | null | null | null | null | null | [
-0.010991287417709827,
-0.010833789594471455,
0.06716234982013702,
0.006663444917649031,
-0.020301274955272675,
0.01604178361594677,
0.026377134025096893,
0.028881991282105446,
-0.017270175740122795,
-0.020779669284820557,
-0.01430994737893343,
-0.04359268397092819,
-0.01119083259254694,
0... |
1401.0463 | Rodrigo de Lamare | Rodrigo C. de Lamare and Raimundo Sampaio-Neto | Sparsity-Aware Adaptive Algorithms Based on Alternating Optimization
with Shrinkage | 10 pages, 3 figures. IEEE Signal Processing Letters, 2014 | null | null | null | cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This letter proposes a novel sparsity-aware adaptive filtering scheme and
algorithms based on an alternating optimization strategy with shrinkage. The
proposed scheme employs a two-stage structure that consists of an alternating
optimization of a diagonally-structured matrix that speeds up the convergence
and an adaptive filter with a shrinkage function that forces the coefficients
with small magnitudes to zero. We devise alternating optimization least-mean
square (LMS) algorithms for the proposed scheme and analyze its mean-square
error. Simulations for a system identification application show that the
proposed scheme and algorithms outperform in convergence and tracking existing
sparsity-aware algorithms.
| [
{
"created": "Thu, 2 Jan 2014 16:15:09 GMT",
"version": "v1"
}
] | 2014-01-03 | [
[
"de Lamare",
"Rodrigo C.",
""
],
[
"Sampaio-Neto",
"Raimundo",
""
]
] | [
-0.0031883770134299994,
-0.0019058975158259273,
-0.011095460504293442,
0.08027192205190659,
0.004105727653950453,
-0.04146207869052887,
-0.015549257397651672,
-0.08204565942287445,
-0.01226777397096157,
-0.03709815815091133,
-0.000842577195726335,
0.06102317199110985,
0.028925608843564987,
... | null | null | null | null | null | null | null | [
-0.0031883770134299994,
-0.0019058975158259273,
-0.011095460504293442,
0.08027192205190659,
0.004105727653950453,
-0.04146207869052887,
-0.015549257397651672,
-0.08204565942287445,
-0.01226777397096157,
-0.03709815815091133,
-0.000842577195726335,
0.06102317199110985,
0.028925608843564987,
... |
1401.0468 | Mabel Iglesias-Ham | Mabel Iglesias-Ham, Michael Kerber and Caroline Uhler | Sphere Packing with Limited Overlap | 12 pages, 3 figures, submitted to SOCG 2014 | null | null | null | cs.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The classical sphere packing problem asks for the best (infinite) arrangement
of non-overlapping unit balls which cover as much space as possible. We define
a generalized version of the problem, where we allow each ball a limited amount
of overlap with other balls. We study two natural choices of overlap measures
and obtain the optimal lattice packings in a parameterized family of lattices
which contains the FCC, BCC, and integer lattice.
| [
{
"created": "Thu, 2 Jan 2014 16:36:24 GMT",
"version": "v1"
}
] | 2014-01-03 | [
[
"Iglesias-Ham",
"Mabel",
""
],
[
"Kerber",
"Michael",
""
],
[
"Uhler",
"Caroline",
""
]
] | [
0.04231596738100052,
0.011897976510226727,
-0.04893839359283447,
-0.044549498707056046,
0.011103098280727863,
0.012397556565701962,
0.09378175437450409,
-0.042401183396577835,
0.019882457330822945,
0.017437279224395752,
-0.0420168973505497,
-0.013645337894558907,
0.03682911396026611,
0.089... | null | null | null | null | null | null | null | [
0.04231596738100052,
0.011897976510226727,
-0.04893839359283447,
-0.044549498707056046,
0.011103098280727863,
0.012397556565701962,
0.09378175437450409,
-0.042401183396577835,
0.019882457330822945,
0.017437279224395752,
-0.0420168973505497,
-0.013645337894558907,
0.03682911396026611,
0.089... |
1401.0480 | Denzil Correa | Denzil Correa and Ashish Sureka | Chaff from the Wheat : Characterization and Modeling of Deleted
Questions on Stack Overflow | 11 pages, Pre-print | null | null | null | cs.IR cs.SI | http://creativecommons.org/licenses/by-nc-sa/3.0/ | Stack Overflow is the most popular CQA for programmers on the web with 2.05M
users, 5.1M questions and 9.4M answers. Stack Overflow has explicit, detailed
guidelines on how to post questions and an ebullient moderation community.
Despite these precise communications and safeguards, questions posted on Stack
Overflow can be extremely off topic or very poor in quality. Such questions can
be deleted from Stack Overflow at the discretion of experienced community
members and moderators. We present the first study of deleted questions on
Stack Overflow. We divide our study into two parts (i) Characterization of
deleted questions over approx. 5 years (2008-2013) of data, (ii) Prediction of
deletion at the time of question creation. Our characterization study reveals
multiple insights on question deletion phenomena. We observe a significant
increase in the number of deleted questions over time. We find that it takes
substantial time to vote a question to be deleted but once voted, the community
takes swift action. We also see that question authors delete their questions to
salvage reputation points. We notice some instances of accidental deletion of
good quality questions but such questions are voted back to be undeleted
quickly. We discover a pyramidal structure of question quality on Stack
Overflow and find that deleted questions lie at the bottom (lowest quality) of
the pyramid. We also build a predictive model to detect the deletion of
question at the creation time. We experiment with 47 features based on User
Profile, Community Generated, Question Content and Syntactic style and report
an accuracy of 66%. Our feature analysis reveals that all four categories of
features are important for the prediction task. Our findings reveal important
suggestions for content quality maintenance on community based question
answering websites.
| [
{
"created": "Thu, 2 Jan 2014 17:36:32 GMT",
"version": "v1"
}
] | 2014-01-03 | [
[
"Correa",
"Denzil",
""
],
[
"Sureka",
"Ashish",
""
]
] | [
-0.09462355822324753,
-0.09991829842329025,
-0.05443548411130905,
0.050546396523714066,
0.016166329383850098,
-0.038962822407484055,
0.07377664744853973,
-0.040716737508773804,
0.03906860202550888,
-0.005814411211758852,
0.025061042979359627,
-0.01420227624475956,
0.0945613756775856,
0.019... | null | null | null | null | null | null | null | [
-0.09462355822324753,
-0.09991829842329025,
-0.05443548411130905,
0.050546396523714066,
0.016166329383850098,
-0.038962822407484055,
0.07377664744853973,
-0.040716737508773804,
0.03906860202550888,
-0.005814411211758852,
0.025061042979359627,
-0.01420227624475956,
0.0945613756775856,
0.019... |
1401.0486 | Najiba Tagougui | Najiba Tagougui, Houcine Boubaker, Monji Kherallah, Adel M. ALIMI | A Hybrid NN/HMM Modeling Technique for Online Arabic Handwriting
Recognition | null | International Journal of Computational Linguistics Research Volume
4 Number 3 September 2013 pp. 107-118 | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work we propose a hybrid NN/HMM model for online Arabic handwriting
recognition. The proposed system is based on Hidden Markov Models (HMMs) and
Multi Layer Perceptron Neural Networks (MLPNNs). The input signal is segmented
to continuous strokes called segments based on the Beta-Elliptical strategy by
inspecting the extremum points of the curvilinear velocity profile. A neural
network trained with segment level contextual information is used to extract
class character probabilities. The output of this network is decoded by HMMs to
provide character level recognition. In evaluations on the ADAB database, we
achieved 96.4% character recognition accuracy that is statistically
significantly important in comparison with character recognition accuracies
obtained from state-of-the-art online Arabic systems.8
| [
{
"created": "Thu, 2 Jan 2014 17:58:27 GMT",
"version": "v1"
}
] | 2014-01-03 | [
[
"Tagougui",
"Najiba",
""
],
[
"Boubaker",
"Houcine",
""
],
[
"Kherallah",
"Monji",
""
],
[
"ALIMI",
"Adel M.",
""
]
] | [
-0.10525859892368317,
-0.0460771881043911,
0.007911535911262035,
-0.03504248335957527,
-0.09854702651500702,
0.13021719455718994,
-0.01614965870976448,
-0.0907050371170044,
0.06459522992372513,
-0.05981850251555443,
0.014453507028520107,
0.015479659661650658,
0.04596414417028427,
0.0025782... | null | null | null | null | null | null | null | [
-0.10525859892368317,
-0.0460771881043911,
0.007911535911262035,
-0.03504248335957527,
-0.09854702651500702,
0.13021719455718994,
-0.01614965870976448,
-0.0907050371170044,
0.06459522992372513,
-0.05981850251555443,
0.014453507028520107,
0.015479659661650658,
0.04596414417028427,
0.0025782... |
1401.0494 | Minyar Sassi | Ines Benali-Sougui, Minyar Sassi-Hidri, Amel Grissa-Touzi | Flexible SQLf query based on fuzzy linguistic summaries | null | International Conference on Control, Engineering & Information
Technology (CEIT), Proceedings Engineering & Technology, Vol. 1, pp. 175-180,
2013 | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Data is often partially known, vague or ambiguous in many real world
applications. To deal with such imprecise information, fuzziness is introduced
in the classical model. SQLf is one of the practical language to deal with
flexible fuzzy querying in Fuzzy DataBases (FDB). However, with a huge amount
of fuzzy data, the necessity to work with synthetic views became a challenge
for many DB community researchers. The present work deals with Flexible SQLf
query based on fuzzy linguistic summaries. We use the fuzzy summaries produced
by our Fuzzy-SaintEtiq approach. It provides a description of objects depending
on the fuzzy linguistic labels specified as selection criteria.
| [
{
"created": "Thu, 2 Jan 2014 18:14:33 GMT",
"version": "v1"
}
] | 2014-01-03 | [
[
"Benali-Sougui",
"Ines",
""
],
[
"Sassi-Hidri",
"Minyar",
""
],
[
"Grissa-Touzi",
"Amel",
""
]
] | [
0.046211808919906616,
-0.04749872907996178,
0.03155098110437393,
-0.0018427566392347217,
-0.03887012228369713,
0.061076126992702484,
0.12721973657608032,
-0.020105335861444473,
0.004565540235489607,
-0.014354446902871132,
0.02974032610654831,
-0.06276021152734756,
0.019251514226198196,
0.0... | null | null | null | null | null | null | null | [
0.046211808919906616,
-0.04749872907996178,
0.03155098110437393,
-0.0018427566392347217,
-0.03887012228369713,
0.061076126992702484,
0.12721973657608032,
-0.020105335861444473,
0.004565540235489607,
-0.014354446902871132,
0.02974032610654831,
-0.06276021152734756,
0.019251514226198196,
0.0... |
1401.0496 | Iasson Karafyllis | Iasson Karafyllis and Markos Papageorgiou | Global Stability Results for Traffic Networks | 22 pages, 1 figure, to be submitted for possible publication | null | null | null | math.OC cs.SY math.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper provides sufficient conditions for global asymptotic stability and
global exponential stability, which can be applied to nonlinear, large-scale,
uncertain discrete-time systems. The conditions are derived by means of vector
Lyapunov functions. The obtained results are applied to traffic networks for
the derivation of sufficient conditions of global exponential stability of the
uncongested equilibrium point of the network. Specific results and algorithms
are provided for freeway models. Various examples illustrate the applicability
of the obtained results.
| [
{
"created": "Thu, 2 Jan 2014 18:16:51 GMT",
"version": "v1"
},
{
"created": "Mon, 24 Mar 2014 08:58:03 GMT",
"version": "v2"
}
] | 2014-03-25 | [
[
"Karafyllis",
"Iasson",
""
],
[
"Papageorgiou",
"Markos",
""
]
] | [
0.024020276963710785,
-0.04296179488301277,
-0.010908565483987331,
-0.09761229902505875,
-0.05453915148973465,
-0.004341001156717539,
0.008089171722531319,
0.02413060888648033,
0.08943671733140945,
0.04018164426088333,
0.018173838034272194,
0.060348790138959885,
0.039602987468242645,
-0.02... | null | null | null | null | null | null | null | [
0.024020276963710785,
-0.04296179488301277,
-0.010908565483987331,
-0.09761229902505875,
-0.05453915148973465,
-0.004341001156717539,
0.008089171722531319,
0.02413060888648033,
0.08943671733140945,
0.04018164426088333,
0.018173838034272194,
0.060348790138959885,
0.039602987468242645,
-0.02... |
1401.0508 | Giulio Magli | Giulio Magli | The Giza "written" landscape and the double project of King Khufu | Archaeoastronomy/History of Astronomy | Time and Mind 9, 57-74, 2016 | null | null | physics.hist-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In recent years, different scientific disciplines, from Physics to
Egyptology, from Geology to Archaeoastronomy, evidenced a series of clues
pointing to the possibility that the original project of the pyramid complex of
Khufu at Giza included also the project of the second pyramid complex at the
same site, that of Khafra. The aim of the present paper is to discuss this
issue in a systematic fashion and to explore its consequences on the way the
ancient Egyptians conceived and built monuments and entire landscapes during
the Old Kingdom.
| [
{
"created": "Thu, 2 Jan 2014 19:08:42 GMT",
"version": "v1"
}
] | 2016-09-27 | [
[
"Magli",
"Giulio",
""
]
] | [
-0.09486135095357895,
0.13252149522304535,
-0.0033844264689832926,
0.016614846885204315,
-0.12496644258499146,
-0.09609265625476837,
-0.08176098018884659,
-0.03860513120889664,
-0.0607515312731266,
0.006395951844751835,
-0.06329508125782013,
-0.10128085315227509,
-0.009349459782242775,
0.0... | null | null | null | null | null | null | null | [
-0.09486135095357895,
0.13252149522304535,
-0.0033844264689832926,
0.016614846885204315,
-0.12496644258499146,
-0.09609265625476837,
-0.08176098018884659,
-0.03860513120889664,
-0.0607515312731266,
0.006395951844751835,
-0.06329508125782013,
-0.10128085315227509,
-0.009349459782242775,
0.0... |
1401.0513 | Bernhard Mehlig | K. Gustavsson, S. Vajedi, and B. Mehlig | Clustering of particles falling in a turbulent flow | 5 pages, 3 figures, supplemental material | Phys. Rev. Lett. 112, 214501 (2014) | 10.1103/PhysRevLett.112.214501 | null | physics.flu-dyn | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Spatial clustering of identical particles falling through a turbulent flow
enhances the collision rate between the falling particles, an important problem
in aerosol science. We analyse this problem using perturbation theory in a
dimensionless parameter, the so-called Kubo number. This allows us to derive an
analytical theory quantifying the spatial clustering. We find that clustering
of small particles in incompressible random velocity fields may be reduced or
enhanced by the effect of gravity (depending on the Stokes number of the
particles) and may be strongly anisotropic.
| [
{
"created": "Thu, 2 Jan 2014 19:28:10 GMT",
"version": "v1"
},
{
"created": "Fri, 28 Mar 2014 19:10:06 GMT",
"version": "v2"
}
] | 2015-06-18 | [
[
"Gustavsson",
"K.",
""
],
[
"Vajedi",
"S.",
""
],
[
"Mehlig",
"B.",
""
]
] | [
0.054858800023794174,
-0.0916144847869873,
0.05520704761147499,
0.04821794852614403,
0.03961171582341194,
0.054223522543907166,
0.05304889380931854,
-0.04437393322587013,
0.09476801753044128,
-0.07264495640993118,
-0.009341136552393436,
-0.04343763738870621,
-0.014018820598721504,
-0.02383... | null | null | null | null | null | null | null | [
0.054858800023794174,
-0.0916144847869873,
0.05520704761147499,
0.04821794852614403,
0.03961171582341194,
0.054223522543907166,
0.05304889380931854,
-0.04437393322587013,
0.09476801753044128,
-0.07264495640993118,
-0.009341136552393436,
-0.04343763738870621,
-0.014018820598721504,
-0.02383... |
1401.0514 | Chris J. Maddison | Chris J. Maddison and Daniel Tarlow | Structured Generative Models of Natural Source Code | null | null | null | null | cs.PL cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the problem of building generative models of natural source code
(NSC); that is, source code written and understood by humans. Our primary
contribution is to describe a family of generative models for NSC that have
three key properties: First, they incorporate both sequential and hierarchical
structure. Second, we learn a distributed representation of source code
elements. Finally, they integrate closely with a compiler, which allows
leveraging compiler logic and abstractions when building structure into the
model. We also develop an extension that includes more complex structure,
refining how the model generates identifier tokens based on what variables are
currently in scope. Our models can be learned efficiently, and we show
empirically that including appropriate structure greatly improves the models,
measured by the probability of generating test programs.
| [
{
"created": "Thu, 2 Jan 2014 19:35:31 GMT",
"version": "v1"
},
{
"created": "Fri, 20 Jun 2014 08:12:20 GMT",
"version": "v2"
}
] | 2014-06-23 | [
[
"Maddison",
"Chris J.",
""
],
[
"Tarlow",
"Daniel",
""
]
] | [
-0.09610521048307419,
-0.057874903082847595,
0.029873529449105263,
0.059415388852357864,
0.03169270604848862,
-0.03774222731590271,
-0.06181761622428894,
0.013011327013373375,
0.007727343589067459,
0.02407267317175865,
-0.06316664069890976,
-0.10644152760505676,
0.07297154515981674,
-0.074... | null | null | null | null | null | null | null | [
-0.09610521048307419,
-0.057874903082847595,
0.029873529449105263,
0.059415388852357864,
0.03169270604848862,
-0.03774222731590271,
-0.06181761622428894,
0.013011327013373375,
0.007727343589067459,
0.02407267317175865,
-0.06316664069890976,
-0.10644152760505676,
0.07297154515981674,
-0.074... |
1401.0523 | Khalid Jebari hassani | Khalid Jebari, Mohammed Madiafi, Abdelaziz El Moujahid | Solving Poisson Equation by Genetic Algorithms | null | International Journal of Computer Applications Volume 83, No 5,
December 2013 | null | null | cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper deals with a method for solving Poisson Equation (PE) based on
genetic algorithms and grammatical evolution. The method forms generations of
solutions expressed in an analytical form. Several examples of PE are tested
and in most cases the exact solution is recovered. But, when the solution
cannot be expressed in an analytical form, our method produces a satisfactory
solution with a good level of accuracy
| [
{
"created": "Thu, 2 Jan 2014 20:15:00 GMT",
"version": "v1"
}
] | 2014-01-03 | [
[
"Jebari",
"Khalid",
""
],
[
"Madiafi",
"Mohammed",
""
],
[
"Moujahid",
"Abdelaziz El",
""
]
] | [
-0.06385629624128342,
0.035881608724594116,
0.036437369883060455,
-0.02171666920185089,
-0.07557474821805954,
-0.03615303710103035,
0.05463385209441185,
-0.020345641300082207,
0.02924410253763199,
0.007132954429835081,
0.12040967494249344,
-0.04794417694211006,
-0.03286879137158394,
-0.026... | null | null | null | null | null | null | null | [
-0.06385629624128342,
0.035881608724594116,
0.036437369883060455,
-0.02171666920185089,
-0.07557474821805954,
-0.03615303710103035,
0.05463385209441185,
-0.020345641300082207,
0.02924410253763199,
0.007132954429835081,
0.12040967494249344,
-0.04794417694211006,
-0.03286879137158394,
-0.026... |
1401.0525 | Konstantinos Mavrokoridis | K. Mavrokoridis, F. Ball, J. Carroll, M. Lazos, K. J. McCormick, N. A.
Smith, C. Touramanis, J. Walker | Optical Readout of a Two Phase Liquid Argon TPC using CCD Camera and
THGEMs | The acronym TGEM was changed to THGEM. Typos in text and figures were
corrected. References were added | null | 10.1088/1748-0221/9/02/P02006 | null | physics.ins-det | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a preliminary study into the use of CCDs to image
secondary scintillation light generated by THick Gas Electron Multipliers
(THGEMs) in a two phase LAr TPC. A Sony ICX285AL CCD chip was mounted above a
double THGEM in the gas phase of a 40 litre two-phase LAr TPC with the majority
of the camera electronics positioned externally via a feedthrough. An Am-241
source was mounted on a rotatable motion feedthrough allowing the positioning
of the alpha source either inside or outside of the field cage. Developed for
and incorporated into the TPC design was a novel high voltage feedthrough
featuring LAr insulation. Furthermore, a range of webcams were tested for
operation in cryogenics as an internal detector monitoring tool. Of the range
of webcams tested the Microsoft HD-3000 (model no:1456) webcam was found to be
superior in terms of noise and lowest operating temperature.
In ambient temperature and atmospheric pressure 1 ppm pure argon gas, the
THGEM gain was approximately 1000 and using a 1 msec exposure the CCD captured
single alpha tracks. Successful operation of the CCD camera in two-phase
cryogenic mode was also achieved. Using a 10 sec exposure a photograph of
secondary scintillation light induced by the Am-241 source in LAr has been
captured for the first time.
| [
{
"created": "Thu, 2 Jan 2014 20:24:50 GMT",
"version": "v1"
},
{
"created": "Thu, 20 Feb 2014 09:44:27 GMT",
"version": "v2"
}
] | 2015-06-18 | [
[
"Mavrokoridis",
"K.",
""
],
[
"Ball",
"F.",
""
],
[
"Carroll",
"J.",
""
],
[
"Lazos",
"M.",
""
],
[
"McCormick",
"K. J.",
""
],
[
"Smith",
"N. A.",
""
],
[
"Touramanis",
"C.",
""
],
[
"Walker",
... | [
-0.03429008647799492,
0.018980352208018303,
-0.0325433649122715,
-0.057377852499485016,
0.057744063436985016,
-0.06169360131025314,
0.013584382832050323,
0.01618312858045101,
0.014058454893529415,
0.02737036906182766,
0.03959507495164871,
-0.06590782850980759,
-0.03963501751422882,
-0.0141... | null | null | null | null | null | null | null | [
-0.03429008647799492,
0.018980352208018303,
-0.0325433649122715,
-0.057377852499485016,
0.057744063436985016,
-0.06169360131025314,
0.013584382832050323,
0.01618312858045101,
0.014058454893529415,
0.02737036906182766,
0.03959507495164871,
-0.06590782850980759,
-0.03963501751422882,
-0.0141... |
1401.0543 | Amy Fu | Amy Fu and Parastoo Sadeghi and Muriel Medard | Beyond the Min-Cut Bound: Deterministic Network Coding for Asynchronous
Multirate Broadcast | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In a single hop broadcast packet erasure network, we demonstrate that it is
possible to provide multirate packet delivery outside of what is given by the
network min-cut. This is achieved by using a deterministic non-block-based
network coding scheme, which allows us to sidestep some of the limitations put
in place by the block coding model used to determine the network capacity.
Under the network coding scheme we outline, the sender is able to transmit
network coded packets above the channel rate of some receivers, while ensuring
that they still experience nonzero delivery rates. Interestingly, in this
generalised form of asynchronous network coded broadcast, receivers are not
required to obtain knowledge of all packets transmitted so far. Instead, causal
feedback from the receivers about packet erasures is used by the sender to
determine a network coded transmission that will allow at least one, but often
multiple receivers, to deliver their next needed packet.
Although the analysis of deterministic coding schemes is generally a
difficult problem, by making some approximations we are able to obtain
tractable estimates of the receivers' delivery rates, which are shown to match
reasonably well with simulation. Using these estimates, we design a fairness
algorithm that allocates the sender's resources so all receivers will
experience fair delivery rate performance.
| [
{
"created": "Thu, 2 Jan 2014 21:02:34 GMT",
"version": "v1"
}
] | 2014-01-06 | [
[
"Fu",
"Amy",
""
],
[
"Sadeghi",
"Parastoo",
""
],
[
"Medard",
"Muriel",
""
]
] | [
-0.011709966696798801,
-0.023205509409308434,
-0.017866259440779686,
0.01669437624514103,
0.06443338841199875,
-0.0003643093223217875,
0.04851999133825302,
-0.12924373149871826,
-0.008641255088150501,
0.09968070685863495,
-0.030181018635630608,
0.022649459540843964,
0.03232130780816078,
-0... | null | null | null | null | null | null | null | [
-0.011709966696798801,
-0.023205509409308434,
-0.017866259440779686,
0.01669437624514103,
0.06443338841199875,
-0.0003643093223217875,
0.04851999133825302,
-0.12924373149871826,
-0.008641255088150501,
0.09968070685863495,
-0.030181018635630608,
0.022649459540843964,
0.03232130780816078,
-0... |
1401.0546 | Muhammad Omer Bin Saeed | Muhammad Saqib Sohail, Muhammad Omer Bin Saeed, Syed Zeeshan Rizvi,
Mobien Shoaib and Asrar Ul Haq Sheikh | Low-Complexity Particle Swarm Optimization for Time-Critical
Applications | 24 pages, 1 figure | null | null | null | cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Particle swam optimization (PSO) is a popular stochastic optimization method
that has found wide applications in diverse fields. However, PSO suffers from
high computational complexity and slow convergence speed. High computational
complexity hinders its use in applications that have limited power resources
while slow convergence speed makes it unsuitable for time critical
applications. In this paper, we propose two techniques to overcome these
limitations. The first technique reduces the computational complexity of PSO
while the second technique speeds up its convergence. These techniques can be
applied, either separately or in conjunction, to any existing PSO variant. The
proposed techniques are robust to the number of dimensions of the optimization
problem. Simulation results are presented for the proposed techniques applied
to the standard PSO as well as to several PSO variants. The results show that
the use of both these techniques in conjunction results in a reduction in the
number of computations required as well as faster convergence speed while
maintaining an acceptable error performance for time-critical applications.
| [
{
"created": "Thu, 2 Jan 2014 21:09:55 GMT",
"version": "v1"
}
] | 2014-01-06 | [
[
"Sohail",
"Muhammad Saqib",
""
],
[
"Saeed",
"Muhammad Omer Bin",
""
],
[
"Rizvi",
"Syed Zeeshan",
""
],
[
"Shoaib",
"Mobien",
""
],
[
"Sheikh",
"Asrar Ul Haq",
""
]
] | [
-0.01672757789492607,
0.04553960636258125,
-0.006180092226713896,
0.0487494021654129,
-0.028013264760375023,
-0.07339140772819519,
-0.018421603366732597,
-0.016903923824429512,
-0.04893010854721069,
-0.019761791452765465,
-0.047634515911340714,
0.019659312441945076,
-0.04356445372104645,
-... | null | null | null | null | null | null | null | [
-0.01672757789492607,
0.04553960636258125,
-0.006180092226713896,
0.0487494021654129,
-0.028013264760375023,
-0.07339140772819519,
-0.018421603366732597,
-0.016903923824429512,
-0.04893010854721069,
-0.019761791452765465,
-0.047634515911340714,
0.019659312441945076,
-0.04356445372104645,
-... |
1401.0550 | Valeriy Etkin | V. A. Etkin | Methodological principles of modern thermodynamics | 17 pages, 2 figures | null | null | null | physics.gen-ph | http://creativecommons.org/licenses/by/3.0/ | The article describes basic principles of the theory which unites
thermodynamics of reversible and irreversible processes also extends them
methods on processes of transfer and transformation of any forms of energy
| [
{
"created": "Thu, 2 Jan 2014 21:45:34 GMT",
"version": "v1"
}
] | 2014-02-10 | [
[
"Etkin",
"V. A.",
""
]
] | [
-0.12844526767730713,
0.0006179701304063201,
-0.017567170783877373,
0.07282212376594543,
-0.004138196352869272,
0.0038760320749133825,
0.04107310250401497,
-0.008697064593434334,
0.05107772350311279,
0.03285517916083336,
-0.041473887860774994,
0.04025048762559891,
-0.016700120642781258,
-0... | null | null | null | null | null | null | null | [
-0.12844526767730713,
0.0006179701304063201,
-0.017567170783877373,
0.07282212376594543,
-0.004138196352869272,
0.0038760320749133825,
0.04107310250401497,
-0.008697064593434334,
0.05107772350311279,
0.03285517916083336,
-0.041473887860774994,
0.04025048762559891,
-0.016700120642781258,
-0... |
1401.0555 | Xiang-Yao Wu | Xiang-Yao Wu, Hong Li, Xiao-Jing Liu, Si-Qi Zhang, Ji Ma, Guang-Huai
Wang, Hai-Xin Gao, Heng-Mei Li, Hong-Chun Yuan | Relativistic spinor equation of photon | null | null | null | null | physics.gen-ph quant-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we have proposed the spiron equation of free and non-free
photon, and give the spin operator and spin wave function of photon. We
calculate the helicity of photon and prove there are left-handed and
right-handed photon. By the spiron equation of non-free photon, we can study
the quantum property of photon in medium, which can be used in quantum optics,
photonic crystals and so on.
| [
{
"created": "Thu, 2 Jan 2014 22:11:08 GMT",
"version": "v1"
}
] | 2014-01-06 | [
[
"Wu",
"Xiang-Yao",
""
],
[
"Li",
"Hong",
""
],
[
"Liu",
"Xiao-Jing",
""
],
[
"Zhang",
"Si-Qi",
""
],
[
"Ma",
"Ji",
""
],
[
"Wang",
"Guang-Huai",
""
],
[
"Gao",
"Hai-Xin",
""
],
[
"Li",
"Heng-Mei... | [
-0.06781613081693649,
-0.03630823269486427,
-0.030378028750419617,
0.03812125325202942,
-0.013862643390893936,
0.07255344092845917,
0.02332679182291031,
0.007273808587342501,
-0.013886607252061367,
0.03903694823384285,
0.1596960425376892,
-0.0004256753309164196,
-0.08692247420549393,
0.076... | null | null | null | null | null | null | null | [
-0.06781613081693649,
-0.03630823269486427,
-0.030378028750419617,
0.03812125325202942,
-0.013862643390893936,
0.07255344092845917,
0.02332679182291031,
0.007273808587342501,
-0.013886607252061367,
0.03903694823384285,
0.1596960425376892,
-0.0004256753309164196,
-0.08692247420549393,
0.076... |
1401.0561 | Janne Lindqvist | Michael Sherman, Gradeigh Clark, Yulong Yang, Shridatt Sugrim, Arttu
Modig, Janne Lindqvist, Antti Oulasvirta, Teemu Roos | User-Generated Free-Form Gestures for Authentication: Security and
Memorability | null | null | null | null | cs.CR cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper studies the security and memorability of free-form multitouch
gestures for mobile authentication. Towards this end, we collected a dataset
with a generate-test-retest paradigm where participants (N=63) generated
free-form gestures, repeated them, and were later retested for memory. Half of
the participants decided to generate one-finger gestures, and the other half
generated multi-finger gestures. Although there has been recent work on
template-based gestures, there are yet no metrics to analyze security of either
template or free-form gestures. For example, entropy-based metrics used for
text-based passwords are not suitable for capturing the security and
memorability of free-form gestures. Hence, we modify a recently proposed metric
for analyzing information capacity of continuous full-body movements for this
purpose. Our metric computed estimated mutual information in repeated sets of
gestures. Surprisingly, one-finger gestures had higher average mutual
information. Gestures with many hard angles and turns had the highest mutual
information. The best-remembered gestures included signatures and simple
angular shapes. We also implemented a multitouch recognizer to evaluate the
practicality of free-form gestures in a real authentication system and how they
perform against shoulder surfing attacks. We conclude the paper with strategies
for generating secure and memorable free-form gestures, which present a robust
method for mobile authentication.
| [
{
"created": "Thu, 2 Jan 2014 23:15:27 GMT",
"version": "v1"
}
] | 2014-01-06 | [
[
"Sherman",
"Michael",
""
],
[
"Clark",
"Gradeigh",
""
],
[
"Yang",
"Yulong",
""
],
[
"Sugrim",
"Shridatt",
""
],
[
"Modig",
"Arttu",
""
],
[
"Lindqvist",
"Janne",
""
],
[
"Oulasvirta",
"Antti",
""
],
[
... | [
-0.055174656212329865,
-0.03419545292854309,
0.04211807623505592,
-0.0864652693271637,
0.015090230852365494,
0.04079071059823036,
0.06062861159443855,
-0.037663783878088,
0.07198699563741684,
-0.013240339234471321,
0.0650491714477539,
-0.0455058217048645,
0.06162801384925842,
0.02377084083... | null | null | null | null | null | null | null | [
-0.055174656212329865,
-0.03419545292854309,
0.04211807623505592,
-0.0864652693271637,
0.015090230852365494,
0.04079071059823036,
0.06062861159443855,
-0.037663783878088,
0.07198699563741684,
-0.013240339234471321,
0.0650491714477539,
-0.0455058217048645,
0.06162801384925842,
0.02377084083... |
1401.0564 | EPTCS | Nazareno Aguirre (Universidad Nacional de R\'io Cuarto), Leila Ribeiro
(Universidade Federal do Rio Grande do Sul) | Proceedings First Latin American Workshop on Formal Methods | null | EPTCS 139, 2014 | 10.4204/EPTCS.139 | null | cs.SE cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Formal approaches to software development are techniques that aim at
developing quality software by employing notations, analysis processes, etc.,
based on mathematical grounds. Although traditionally they aim at increasing
software correctness, formal techniques have been applied to various other
aspects of software quality. Moreover, while originally formal methods employed
complex "heavyweight" mechanisms for analysis (often manual or semi automated),
there has been progress towards embracing "lightweight", many times fully
automated, analysis techniques, that broaden the adoption of formal methods in
various software engineering contexts.
The Latin American Workshop on Formal Methods brings together researchers
working in formal methods, and related areas such as automated analysis. In
particular, the workshop provides a venue for Latin American researchers
working in these areas, to promote their interaction and collaboration.
The workshop was held in August as a satellite event of CONCUR 2013. It took
place in Buenos Aires, Argentina's capital and largest city, and one of the
most interesting cultural places in South America.
| [
{
"created": "Thu, 2 Jan 2014 23:29:24 GMT",
"version": "v1"
}
] | 2014-01-06 | [
[
"Aguirre",
"Nazareno",
"",
"Universidad Nacional de Río Cuarto"
],
[
"Ribeiro",
"Leila",
"",
"Universidade Federal do Rio Grande do Sul"
]
] | [
-0.0461706668138504,
0.04349328577518463,
-0.01298152469098568,
-0.0036577556747943163,
-0.02472410909831524,
-0.08910135924816132,
-0.003062683157622814,
0.06629537791013718,
0.0009083324111998081,
0.03319020941853523,
-0.052249036729335785,
-0.057384565472602844,
0.028974706307053566,
-0... | null | null | null | null | null | null | null | [
-0.0461706668138504,
0.04349328577518463,
-0.01298152469098568,
-0.0036577556747943163,
-0.02472410909831524,
-0.08910135924816132,
-0.003062683157622814,
0.06629537791013718,
0.0009083324111998081,
0.03319020941853523,
-0.052249036729335785,
-0.057384565472602844,
0.028974706307053566,
-0... |
1401.0565 | Rona Oran | R. Oran, E. Landi, B. van der Holst, I. V. Sokolov, T. I. Gombosi | Alfv\'en Wave Turbulence as a Coronal Heating Mechanism: Simultaneously
Predicting the Heating Rate and the Wave-Induced Emission Line Broadening | Submitted to the Astrophysical Journal | null | null | null | astro-ph.SR physics.space-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the present work, we test the predictions of the AWSoM model, a global
extended-MHD model capable of calculating the propagation and turbulent
dissipation of Alfv\'en waves in any magnetic topology, against high resolution
spectra of the quiescent off-disk solar corona. Wave dissipation is the only
heating mechanism assumed in this model. Combining 3D model results with the
CHIANTI atomic database, we were able to create synthetic line-of-sight spectra
which include the effects of emission line broadening due to both thermal and
wave-related non-thermal motions. To the best of our knowledge this is the
first time a global model is used to obtain synthetic non-thermal line
broadening. We obtained a steady-state solution driven by a synoptic
magnetogram and compared the synthetic spectra with SUMER observations of a
quiescent area above the solar west limb extending between 1.04 and 1.34 solar
radii at the equator. Both the predicted line widths and the total line fluxes
were consistent with the observations for 5 different ions. Using the 3D
solution, we were able to locate the region that contributes the most to the
emission used for measuring electron properties; we found that region to be a
pseudo-streamer, whose modeled electron temperature and density are consistent
with the measured ones. We conclude that the turbulent dissipation assumed in
the AWSoM model can simultaneously account for the observed heating rate and
the non-dissipated wave energy observed in this region.
| [
{
"created": "Thu, 2 Jan 2014 23:39:39 GMT",
"version": "v1"
}
] | 2014-01-06 | [
[
"Oran",
"R.",
""
],
[
"Landi",
"E.",
""
],
[
"van der Holst",
"B.",
""
],
[
"Sokolov",
"I. V.",
""
],
[
"Gombosi",
"T. I.",
""
]
] | [
-0.06154145672917366,
-0.02508651465177536,
0.007997159846127033,
0.04084492474794388,
0.002284452086314559,
-0.0568963959813118,
-0.05064152926206589,
0.027344197034835815,
0.007071836851537228,
-0.0012503417674452066,
-0.04482218623161316,
-0.07857217639684677,
-0.01976541057229042,
-0.0... | null | null | null | null | null | null | null | [
-0.06154145672917366,
-0.02508651465177536,
0.007997159846127033,
0.04084492474794388,
0.002284452086314559,
-0.0568963959813118,
-0.05064152926206589,
0.027344197034835815,
0.007071836851537228,
-0.0012503417674452066,
-0.04482218623161316,
-0.07857217639684677,
-0.01976541057229042,
-0.0... |
1401.0569 | Son Doan | Son Doan, Mike Conway, Tu Minh Phuong, Lucila Ohno-Machado | Natural Language Processing in Biomedicine: A Unified System
Architecture Overview | 25 pages, 5 figures, book chapter in Clinical Bioinformatics, 2014,
edited by Ronand Trent | null | 10.1007/978-1-4939-0847-9_16 | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In modern electronic medical records (EMR) much of the clinically important
data - signs and symptoms, symptom severity, disease status, etc. - are not
provided in structured data fields, but rather are encoded in clinician
generated narrative text. Natural language processing (NLP) provides a means of
"unlocking" this important data source for applications in clinical decision
support, quality assurance, and public health. This chapter provides an
overview of representative NLP systems in biomedicine based on a unified
architectural view. A general architecture in an NLP system consists of two
main components: background knowledge that includes biomedical knowledge
resources and a framework that integrates NLP tools to process text. Systems
differ in both components, which we will review briefly. Additionally,
challenges facing current research efforts in biomedical NLP include the
paucity of large, publicly available annotated corpora, although initiatives
that facilitate data sharing, system evaluation, and collaborative work between
researchers in clinical NLP are starting to emerge.
| [
{
"created": "Fri, 3 Jan 2014 00:57:13 GMT",
"version": "v1"
},
{
"created": "Wed, 8 Jan 2014 19:00:04 GMT",
"version": "v2"
}
] | 2014-08-10 | [
[
"Doan",
"Son",
""
],
[
"Conway",
"Mike",
""
],
[
"Phuong",
"Tu Minh",
""
],
[
"Ohno-Machado",
"Lucila",
""
]
] | [
0.008098547346889973,
0.05215849354863167,
-0.007642743177711964,
-0.03194879740476608,
-0.01059973519295454,
-0.009800008498132229,
-0.031107470393180847,
0.10827213525772095,
0.03612828999757767,
-0.013612307608127594,
-0.05953475832939148,
-0.017333386465907097,
-0.0007938405033200979,
... | null | null | null | null | null | null | null | [
0.008098547346889973,
0.05215849354863167,
-0.007642743177711964,
-0.03194879740476608,
-0.01059973519295454,
-0.009800008498132229,
-0.031107470393180847,
0.10827213525772095,
0.03612828999757767,
-0.013612307608127594,
-0.05953475832939148,
-0.017333386465907097,
-0.0007938405033200979,
... |
1401.0572 | Pengfei Lan | Pengfei Lan, Yuming Zhou, Adrian N. Pfeiffer, Qingbin Zhang, Peixiang
Lu, Katsumi Midorikawa Lu | Revealing the role of electron correlation in sequential double
ionization | 14 pages, 5 figures, submitted | Phys. Rev. A 89, 033424(2014) | 10.1103/PhysRevA.89.033424 | null | physics.atom-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The experimental observations of sequential double ionization (SDI) of Ar [A.
N. Pfeiffer {\it et al.}, Nature Phys. {\bf 7}, 428 (2011)], such as the
four-peak momentum distribution and the ionization time of the first and second
electrons, are investigated and reproduced with a quantum model by including
and excluding the $e$-$e$ correlation effect. Based on the comparison of
experiment and simulation, the role of $e$-$e$ correlation in SDI is discussed.
It is shown that the inclusion of $e$-$e$ correlation is necessary to reproduce
the momentum distribution of electrons.
| [
{
"created": "Fri, 3 Jan 2014 01:41:54 GMT",
"version": "v1"
}
] | 2014-04-01 | [
[
"Lan",
"Pengfei",
""
],
[
"Zhou",
"Yuming",
""
],
[
"Pfeiffer",
"Adrian N.",
""
],
[
"Zhang",
"Qingbin",
""
],
[
"Lu",
"Peixiang",
""
],
[
"Lu",
"Katsumi Midorikawa",
""
]
] | [
-0.045604903250932693,
0.004951659590005875,
0.01776837185025215,
0.04574001953005791,
-0.10909957438707352,
0.019170792773365974,
0.04616495966911316,
-0.0005348416161723435,
0.042227163910865784,
-0.025970255956053734,
0.053745366632938385,
0.018635142594575882,
0.029392467811703682,
-0.... | null | null | null | null | null | null | null | [
-0.045604903250932693,
0.004951659590005875,
0.01776837185025215,
0.04574001953005791,
-0.10909957438707352,
0.019170792773365974,
0.04616495966911316,
-0.0005348416161723435,
0.042227163910865784,
-0.025970255956053734,
0.053745366632938385,
0.018635142594575882,
0.029392467811703682,
-0.... |
1401.0578 | Jwo-Yuh Wu | Ling-Hua Chang and Jwo-Yuh Wu | An Improved RIP-Based Performance Guarantee for Sparse Signal Recovery
via Orthogonal Matching Pursuit | 38 pages,4 figures | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A sufficient condition reported very recently for perfect recovery of a
K-sparse vector via orthogonal matching pursuit (OMP) in K iterations is that
the restricted isometry constant of the sensing matrix satisfies
delta_K+1<1/(sqrt(delta_K+1)+1). By exploiting an approximate orthogonality
condition characterized via the achievable angles between two orthogonal sparse
vectors upon compression, this paper shows that the upper bound on delta can be
further relaxed to delta_K+1<(sqrt(1+4*delta_K+1)-1)/(2K).This result thus
narrows the gap between the so far best known bound and the ultimate
performance guarantee delta_K+1<1/(sqrt(delta_K+1)) that is conjectured by Dai
and Milenkovic in 2009. The proposed approximate orthogonality condition is
also exploited to derive less restricted sufficient conditions for signal
reconstruction in several compressive sensing problems, including signal
recovery via OMP in a noisy environment, compressive domain interference
cancellation, and support identification via the subspace pursuit algorithm.
| [
{
"created": "Fri, 3 Jan 2014 02:48:12 GMT",
"version": "v1"
}
] | 2014-01-06 | [
[
"Chang",
"Ling-Hua",
""
],
[
"Wu",
"Jwo-Yuh",
""
]
] | [
-0.11207185685634613,
0.02612806297838688,
0.006758533418178558,
-0.039386067539453506,
0.019527386873960495,
0.03015274368226528,
0.09068462997674942,
-0.06848924607038498,
-0.00399808119982481,
0.009318947792053223,
-0.010962453670799732,
0.09188389778137207,
-0.0038268358912318945,
-0.0... | null | null | null | null | null | null | null | [
-0.11207185685634613,
0.02612806297838688,
0.006758533418178558,
-0.039386067539453506,
0.019527386873960495,
0.03015274368226528,
0.09068462997674942,
-0.06848924607038498,
-0.00399808119982481,
0.009318947792053223,
-0.010962453670799732,
0.09188389778137207,
-0.0038268358912318945,
-0.0... |
1401.0579 | Tengyu Ma | Sanjeev Arora, Aditya Bhaskara, Rong Ge, Tengyu Ma | More Algorithms for Provable Dictionary Learning | 23 pages | null | null | null | cs.DS cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In dictionary learning, also known as sparse coding, the algorithm is given
samples of the form $y = Ax$ where $x\in \mathbb{R}^m$ is an unknown random
sparse vector and $A$ is an unknown dictionary matrix in $\mathbb{R}^{n\times
m}$ (usually $m > n$, which is the overcomplete case). The goal is to learn $A$
and $x$. This problem has been studied in neuroscience, machine learning,
visions, and image processing. In practice it is solved by heuristic algorithms
and provable algorithms seemed hard to find. Recently, provable algorithms were
found that work if the unknown feature vector $x$ is $\sqrt{n}$-sparse or even
sparser. Spielman et al. \cite{DBLP:journals/jmlr/SpielmanWW12} did this for
dictionaries where $m=n$; Arora et al. \cite{AGM} gave an algorithm for
overcomplete ($m >n$) and incoherent matrices $A$; and Agarwal et al.
\cite{DBLP:journals/corr/AgarwalAN13} handled a similar case but with weaker
guarantees.
This raised the problem of designing provable algorithms that allow sparsity
$\gg \sqrt{n}$ in the hidden vector $x$. The current paper designs algorithms
that allow sparsity up to $n/poly(\log n)$. It works for a class of matrices
where features are individually recoverable, a new notion identified in this
paper that may motivate further work.
The algorithm runs in quasipolynomial time because they use limited
enumeration.
| [
{
"created": "Fri, 3 Jan 2014 02:52:17 GMT",
"version": "v1"
}
] | 2014-01-06 | [
[
"Arora",
"Sanjeev",
""
],
[
"Bhaskara",
"Aditya",
""
],
[
"Ge",
"Rong",
""
],
[
"Ma",
"Tengyu",
""
]
] | [
-0.051322486251592636,
-0.033685777336359024,
-0.09586555510759354,
-0.0396682433784008,
0.025417817756533623,
-0.03736652433872223,
0.020287882536649704,
-0.0764331966638565,
-0.030059292912483215,
0.026744302362203598,
0.032973241060972214,
0.13290001451969147,
0.05420900136232376,
0.034... | null | null | null | null | null | null | null | [
-0.051322486251592636,
-0.033685777336359024,
-0.09586555510759354,
-0.0396682433784008,
0.025417817756533623,
-0.03736652433872223,
0.020287882536649704,
-0.0764331966638565,
-0.030059292912483215,
0.026744302362203598,
0.032973241060972214,
0.13290001451969147,
0.05420900136232376,
0.034... |
1401.0583 | Garrett Warnell | Garrett Warnell, Sourabh Bhattacharya, Rama Chellappa, Tamer Basar | Adaptive-Rate Compressive Sensing Using Side Information | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We provide two novel adaptive-rate compressive sensing (CS) strategies for
sparse, time-varying signals using side information. Our first method utilizes
extra cross-validation measurements, and the second one exploits extra
low-resolution measurements. Unlike the majority of current CS techniques, we
do not assume that we know an upper bound on the number of significant
coefficients that comprise the images in the video sequence. Instead, we use
the side information to predict the number of significant coefficients in the
signal at the next time instant. For each image in the video sequence, our
techniques specify a fixed number of spatially-multiplexed CS measurements to
acquire, and adjust this quantity from image to image. Our strategies are
developed in the specific context of background subtraction for surveillance
video, and we experimentally validate the proposed methods on real video
sequences.
| [
{
"created": "Fri, 3 Jan 2014 04:01:29 GMT",
"version": "v1"
}
] | 2014-01-06 | [
[
"Warnell",
"Garrett",
""
],
[
"Bhattacharya",
"Sourabh",
""
],
[
"Chellappa",
"Rama",
""
],
[
"Basar",
"Tamer",
""
]
] | [
-0.030786994844675064,
-0.01142491027712822,
-0.013177194632589817,
0.04917475953698158,
0.11093143373727798,
0.03602296859025955,
-0.025250347331166267,
-0.005435318220406771,
0.04595308378338814,
-0.06244874745607376,
-0.04289676621556282,
0.007860029116272926,
-0.02010657638311386,
0.01... | null | null | null | null | null | null | null | [
-0.030786994844675064,
-0.01142491027712822,
-0.013177194632589817,
0.04917475953698158,
0.11093143373727798,
0.03602296859025955,
-0.025250347331166267,
-0.005435318220406771,
0.04595308378338814,
-0.06244874745607376,
-0.04289676621556282,
0.007860029116272926,
-0.02010657638311386,
0.01... |
1401.0585 | Thomas Sandholm | Thomas Sandholm, Dongman Lee, Bjorn Tegelund, Seonyeong Han,
Byoungheon Shin, Byoungoh Kim | CloudFridge: A Testbed for Smart Fridge Interactions | null | null | null | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a testbed for exploring novel smart refrigerator interactions, and
identify three key adoption-limiting interaction shortcomings of
state-of-the-art smart fridges: lack of 1) user experience focus, 2)
low-intrusion object recognition and 2) automatic item position detection. Our
testbed system addresses these limitations by a combination of sensors,
software filters, architectural components and a RESTful API to track
interaction events in real-time, and retrieve current state and historical data
to learn patterns and recommend user actions. We evaluate the accuracy and
overhead of our system in a realistic interaction flow. The accuracy was
measured to 83-88% and the overhead compared to a representative
state-of-the-art barcode scanner improved by 27%. We also showcase two
applications built on top of our testbed, one for finding expired items and
ingredients of dishes; and one to monitor your health. The pattern that these
applications have in common is that they cast the interaction as an
item-recommendation problem triggered when the user takes something out. Our
testbed could help reveal further user-experience centric interaction patterns
and new classes of applications for smart fridges that inherently, by relying
on our testbed primitives, mitigate the issues with existing approaches.
| [
{
"created": "Fri, 3 Jan 2014 04:45:49 GMT",
"version": "v1"
}
] | 2014-01-06 | [
[
"Sandholm",
"Thomas",
""
],
[
"Lee",
"Dongman",
""
],
[
"Tegelund",
"Bjorn",
""
],
[
"Han",
"Seonyeong",
""
],
[
"Shin",
"Byoungheon",
""
],
[
"Kim",
"Byoungoh",
""
]
] | [
-0.07081535458564758,
0.006472322158515453,
-0.013713639229536057,
0.04787583649158478,
0.07031772285699844,
-0.009047453291714191,
0.04840865731239319,
-0.031034162268042564,
-0.03760064020752907,
-0.059485845267772675,
-0.04592961445450783,
-0.00996123906224966,
0.03704189509153366,
0.01... | null | null | null | null | null | null | null | [
-0.07081535458564758,
0.006472322158515453,
-0.013713639229536057,
0.04787583649158478,
0.07031772285699844,
-0.009047453291714191,
0.04840865731239319,
-0.031034162268042564,
-0.03760064020752907,
-0.059485845267772675,
-0.04592961445450783,
-0.00996123906224966,
0.03704189509153366,
0.01... |
1401.0587 | Stephen Pankavich | Stephen Pankavich and Peter Ortoleva | Nanosystem Self-Assembly Pathways Discovered via All-Atom Multiscale
Analysis | 3 figures | J. Phys. Chem. B. 116 (2012) 8355-8362 | null | null | physics.bio-ph q-bio.BM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the self-assembly of composite structures from a group of
nanocomponents, each consisting of particles within an $N$-atom system.
Self-assembly pathways and rates for nanocomposites are derived via a
multiscale analysis of the classical Liouville equation. From a reduced
statistical framework, rigorous stochastic equations for population levels of
beginning, intermediate, and final aggregates are also derived. It is shown
that the definition of an assembly type is a self-consistency criterion that
must strike a balance between precision and the need for population levels to
be slowly varying relative to the time scale of atomic motion. The deductive
multiscale approach is complemented by a qualitative notion of multicomponent
association and the ensemble of exact atomic-level configurations consistent
with them. In processes such as viral self-assembly from proteins and RNA or
DNA, there are many possible intermediates, so that it is usually difficult to
predict the most efficient assembly pathway. However, in the current study,
rates of assembly of each possible intermediate can be predicted. This avoids
the need, as in a phenomenological approach, for recalibration with each new
application. The method accounts for the feedback across scales in space and
time that is fundamental to nanosystem self-assembly. The theory has
applications to bionanostructures, geomaterials, engineered composites, and
nanocapsule therapeutic delivery systems.
| [
{
"created": "Fri, 3 Jan 2014 05:23:54 GMT",
"version": "v1"
}
] | 2014-01-06 | [
[
"Pankavich",
"Stephen",
""
],
[
"Ortoleva",
"Peter",
""
]
] | [
0.025209829211235046,
-0.1589450091123581,
0.003639751113951206,
0.039633627980947495,
0.023210151121020317,
-0.00539204990491271,
-0.012119230814278126,
0.024017315357923508,
0.05789652094244957,
0.0021014867816120386,
0.06984036415815353,
-0.03831140697002411,
-0.03458338975906372,
0.038... | null | null | null | null | null | null | null | [
0.025209829211235046,
-0.1589450091123581,
0.003639751113951206,
0.039633627980947495,
0.023210151121020317,
-0.00539204990491271,
-0.012119230814278126,
0.024017315357923508,
0.05789652094244957,
0.0021014867816120386,
0.06984036415815353,
-0.03831140697002411,
-0.03458338975906372,
0.038... |
1401.0591 | Puneet Kumar | Puneet Kumar, Dharminder Kumar, Narendra Kumar | ICT in Local Self Governance: A Study of Rural India | 6 pages, 4 figures, Published with International Journal of Computer
Applications (IJCA) | International Journal of Computer Applications 83(6):31-36,
December 2013. Published by Foundation of Computer Science, New York, USA | 10.5120/14453-2714 | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The concept of local self-governance is not new as it has its roots in
ancient time even before the era of Mauryan emperors. This paper depicts the
journey of local self-governance from antediluvian time to 21st century.
Further, in the current scenario Information and Communication Technology (ICT)
has emerged as a successful tool for dissemination of various e-governance
services and in this regard the Government of India has formulated NeGP with
adequate service delivery mechanism. With the inculcation of ICT, various
applications were designed by central as well as state governments which lead
towards strengthening of PRIs for rural reform. This paper also throws some
light on necessity of ICT in self-governance along with some case studies.
| [
{
"created": "Fri, 3 Jan 2014 06:09:33 GMT",
"version": "v1"
}
] | 2014-01-06 | [
[
"Kumar",
"Puneet",
""
],
[
"Kumar",
"Dharminder",
""
],
[
"Kumar",
"Narendra",
""
]
] | [
-0.023656833916902542,
0.02999439835548401,
0.053104326128959656,
-0.10053707659244537,
-0.06017747148871422,
-0.03852115198969841,
0.04889809712767601,
0.0300594549626112,
0.006765949539840221,
0.002567755524069071,
0.03005242347717285,
-0.01923227868974209,
0.02633235789835453,
0.0340206... | null | null | null | null | null | null | null | [
-0.023656833916902542,
0.02999439835548401,
0.053104326128959656,
-0.10053707659244537,
-0.06017747148871422,
-0.03852115198969841,
0.04889809712767601,
0.0300594549626112,
0.006765949539840221,
0.002567755524069071,
0.03005242347717285,
-0.01923227868974209,
0.02633235789835453,
0.0340206... |
1401.0592 | Fei Xu | Fei Xu, Bi-cai Zheng, WEi Luo, Yan-qing Lu | The influence of van der Waals forces on the waveguide deformation and
power limit of nanoscale optomechanical systems | null | null | null | null | physics.optics | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The ultra-short range force, van der Waals force (VWF), will rise rapidly
when one nanoscale waveguide is close to another one, and be stronger than the
external transverse gradient force (TGF). We theoretically investigate the
giant influence of the VWF on the device performance in a typical
optomechanical system consisting of a suspended silicon waveguide and a silica
substrate including waveguide deformation stiction and failure mechanism. The
device shows unique optically-activated plastic/elastic behaviors and stiction
due to the VWF. When the input optical power is above the critical power, the
waveguide is sticking to the substrate and the deformation is plastic and
unrecoverable, even though the total force is less than the yield strength of
the waveguide material. This is important and helpful for the design and
applications of optomechanical devices.
| [
{
"created": "Fri, 3 Jan 2014 06:13:32 GMT",
"version": "v1"
}
] | 2014-01-06 | [
[
"Xu",
"Fei",
""
],
[
"Zheng",
"Bi-cai",
""
],
[
"Luo",
"WEi",
""
],
[
"Lu",
"Yan-qing",
""
]
] | [
0.029972227290272713,
-0.01795060746371746,
0.02831626683473587,
0.019388839602470398,
-0.010177523829042912,
-0.04470496252179146,
-0.01534334383904934,
0.05141608417034149,
-0.02527698129415512,
0.007928003557026386,
0.03721899166703224,
0.022949468344449997,
-0.04067905247211456,
-0.013... | null | null | null | null | null | null | null | [
0.029972227290272713,
-0.01795060746371746,
0.02831626683473587,
0.019388839602470398,
-0.010177523829042912,
-0.04470496252179146,
-0.01534334383904934,
0.05141608417034149,
-0.02527698129415512,
0.007928003557026386,
0.03721899166703224,
0.022949468344449997,
-0.04067905247211456,
-0.013... |
1401.0598 | Wu Wu | Wu Wu, Jiulin Hu, Xiaofang Huang, Huijie Chen, Bo Sun | Flight trajectory recreation and playback system of aerial mission based
on ossimplanet | null | null | null | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recreation of flight trajectory is important among research areas. The design
of a flight trajectory recreation and playback system is presented in this
paper. Rather than transferring the flight data to diagram, graph and table,
flight data is visualized on the 3D global of ossimPlanet. ossimPlanet is an
open-source 3D global geo-spatial viewer and the system realization is based on
analysis it. Users are allowed to choose their interested flight of aerial
mission. The aerial photographs and corresponding configuration files in which
flight data is included would be read in. And the flight statuses would be
stored. The flight trajectory is then recreated. Users can view the photographs
and flight trajectory marks on the correct positions of 3D global. The scene
along flight trajectory is also simulated at the plane's eye point. This paper
provides a more intuitive way for recreation of flight trajectory. The cost is
decreased remarkably and security is ensured by secondary development on
open-source platform.
| [
{
"created": "Fri, 3 Jan 2014 07:10:25 GMT",
"version": "v1"
}
] | 2014-01-06 | [
[
"Wu",
"Wu",
""
],
[
"Hu",
"Jiulin",
""
],
[
"Huang",
"Xiaofang",
""
],
[
"Chen",
"Huijie",
""
],
[
"Sun",
"Bo",
""
]
] | [
0.05366230010986328,
-0.034877289086580276,
-0.0883801206946373,
-0.10035224258899689,
0.04599185660481453,
-0.01601616106927395,
-0.029021022841334343,
0.024496465921401978,
0.05077867954969406,
0.07090090215206146,
0.020375659689307213,
0.023491941392421722,
-0.012274574488401413,
0.0472... | null | null | null | null | null | null | null | [
0.05366230010986328,
-0.034877289086580276,
-0.0883801206946373,
-0.10035224258899689,
0.04599185660481453,
-0.01601616106927395,
-0.029021022841334343,
0.024496465921401978,
0.05077867954969406,
0.07090090215206146,
0.020375659689307213,
0.023491941392421722,
-0.012274574488401413,
0.0472... |
1401.0606 | Sergiy Perepelytsya | O.O. Liubysh, O.M. Alekseev, S.Yu. Tkachov, S.M. Perepelytsya | Effect of ionic ordering in conductivity experiments of DNA aqueous
solutions | 12 pages, 6figures. Ukr. J. Phys. (2014) | null | null | null | q-bio.BM cond-mat.soft physics.bio-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The effects of ionic ordering in DNA water solutions are studied by
conductivity experiments. The conductivity measurements are performed for the
solutions of DNA with KCl salt in the temperature range from 28 to 70 C. Salt
concentration vary from 0 to 2 M. The conductivity of solutions without DNA but
with the same concentration of KCl salt are also performed. The results show
that in case of salt free solution of DNA the melting process of the double
helix is observed, while in case of DNA solution with added salt the
macromolecule denaturation is not featured. For salt concentrations lower than
some critical one (0.4 M) the conductivity of DNA solution is higher than the
conductivity of KCl water solution without DNA. Starting from the critical
concentration the conductivity of KCl solution is higher than the conductivity
of DNA solution with added salt. For description of the experimental data
phenomenological model is elaborated basing on electrolyte theory. In framework
of the developed model a mechanism of counterion ordering is introduced.
According to this mechanism under the low salt concentrations electrical
conductivity of the system is caused by counterions of DNA ion-hydrate shell.
Increasing the amount of salt to the critical concentration counterions
condense on DNA polyanion. Further increase of salt concentration leads to the
formation of DNA-salt complexes that decreases the conductivity of the system.
| [
{
"created": "Fri, 3 Jan 2014 08:43:34 GMT",
"version": "v1"
}
] | 2014-01-06 | [
[
"Liubysh",
"O. O.",
""
],
[
"Alekseev",
"O. M.",
""
],
[
"Tkachov",
"S. Yu.",
""
],
[
"Perepelytsya",
"S. M.",
""
]
] | [
-0.0987372174859047,
-0.03527316451072693,
0.051305558532476425,
-0.019391890615224838,
-0.050676796585321426,
-0.00335006695240736,
0.04085636883974075,
0.0451543815433979,
-0.040247876197099686,
0.05909156799316406,
0.03130033239722252,
0.003288692096248269,
0.013709351420402527,
0.05115... | null | null | null | null | null | null | null | [
-0.0987372174859047,
-0.03527316451072693,
0.051305558532476425,
-0.019391890615224838,
-0.050676796585321426,
-0.00335006695240736,
0.04085636883974075,
0.0451543815433979,
-0.040247876197099686,
0.05909156799316406,
0.03130033239722252,
0.003288692096248269,
0.013709351420402527,
0.05115... |
1401.0608 | Ali Sheharyar | Ali Sheharyar, Othmane Bouhali | A Framework for Creating a Distributed Rendering Environment on the
Compute Clusters | null | null | null | null | cs.DC cs.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper discusses the deployment of existing render farm manager in a
typical compute cluster environment such as a university. Usually, both a
render farm and a compute cluster use different queue managers and assume total
control over the physical resources. But, taking out the physical resources
from an existing compute cluster in a university-like environment whose primary
use of the cluster is to run numerical simulations may not be possible. It can
potentially reduce the overall resource utilization in a situation where
compute tasks are more than rendering tasks. Moreover, it can increase the
system administration cost. In this paper, a framework has been proposed that
creates a dynamic distributed rendering environment on top of the compute
clusters using existing render farm managers without requiring the physical
separation of the resources.
| [
{
"created": "Fri, 3 Jan 2014 08:48:25 GMT",
"version": "v1"
}
] | 2014-01-06 | [
[
"Sheharyar",
"Ali",
""
],
[
"Bouhali",
"Othmane",
""
]
] | [
0.0016500999918207526,
-0.023396514356136322,
0.0033632488921284676,
0.001723174238577485,
0.02656671591103077,
-0.10355189442634583,
-0.049093347042798996,
-0.028014810755848885,
-0.024595191702246666,
0.05984010174870491,
-0.059984005987644196,
-0.07574427872896194,
0.057145100086927414,
... | null | null | null | null | null | null | null | [
0.0016500999918207526,
-0.023396514356136322,
0.0033632488921284676,
0.001723174238577485,
0.02656671591103077,
-0.10355189442634583,
-0.049093347042798996,
-0.028014810755848885,
-0.024595191702246666,
0.05984010174870491,
-0.059984005987644196,
-0.07574427872896194,
0.057145100086927414,
... |
1401.0613 | Peixiang Lu | Cheng Huang, Pengfei Lan, Yueming Zhou, Qingbin Zhang, Kunlong Liu,
and Peixiang Lu | Revisiting the tunnelling site of electrons in strong field enhanced
ionization of molecules | null | null | 10.1103/PhysRevA.90.043420 | null | physics.atom-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We investigated electron emissions in strong field enhanced ionization of
asymmetric diatomic molecules by quantum calculations. It is demonstrated that
the widely-used intuitive physical pic- ture, i.e., electron wave packet direct
ionization from the up-field site (DIU), is incomplete. Besides DIU, we find
another two new ionization channels, the field-induced excitation with
subsequent ionization from the down-field site (ESID), and the up-field site
(ESIU). The contributions from these channels depend on the molecular asymmetry
and internuclear distance. Our work provides a more comprehensive physical
picture for the long-standing issue about enhanced ionization of diatomic
molecules.
| [
{
"created": "Fri, 3 Jan 2014 09:28:55 GMT",
"version": "v1"
}
] | 2015-06-18 | [
[
"Huang",
"Cheng",
""
],
[
"Lan",
"Pengfei",
""
],
[
"Zhou",
"Yueming",
""
],
[
"Zhang",
"Qingbin",
""
],
[
"Liu",
"Kunlong",
""
],
[
"Lu",
"Peixiang",
""
]
] | [
0.010431056842207909,
0.04514893889427185,
0.0035164356231689453,
-0.033635929226875305,
-0.07021324336528778,
-0.09138143062591553,
0.062020719051361084,
0.011181778274476528,
-0.001629848382435739,
0.01320800743997097,
-0.0057708509266376495,
0.0416945144534111,
-0.05633582919836044,
-0.... | null | null | null | null | null | null | null | [
0.010431056842207909,
0.04514893889427185,
0.0035164356231689453,
-0.033635929226875305,
-0.07021324336528778,
-0.09138143062591553,
0.062020719051361084,
0.011181778274476528,
-0.001629848382435739,
0.01320800743997097,
-0.0057708509266376495,
0.0416945144534111,
-0.05633582919836044,
-0.... |
1401.0614 | Paola Gori-Giorgi | Andr\'e Mirtschink, C. J. Umrigar, John D. Morgan III, and Paola
Gori-Giorgi | Energy Density Functionals From the Strong-Coupling Limit Applied to the
Anions of the He Isoelectronic Series | Accepted for the JCP Special Topic Issue "Advances in DFT
Methodology" | null | 10.1063/1.4871018 | null | physics.chem-ph physics.atom-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Anions and radicals are important for many applications including
environmental chemistry, semiconductors, and charge transfer, but are poorly
described by the available approximate energy density functionals. Here we test
an approximate exchange-correlation functional based on the exact
strong-coupling limit of the Hohenberg-Kohn functional on the prototypical case
of the He isoelectronic series with varying nuclear charge $Z<2$, which
includes weakly bound negative ions and a quantum phase transition at a
critical value of $Z$, representing a big challenge for density functional
theory. We use accurate wavefunction calculations to validate our results,
comparing energies and Kohn-Sham potentials, thus also providing useful
reference data close to and at the quantum phase transition. We show that our
functional is able to bind H$^-$ and to capture in general the physics of
loosely bound anions, with a tendency to strongly overbind that can be proven
mathematically. We also include corrections based on the uniform electron gas
which improve the results.
| [
{
"created": "Fri, 3 Jan 2014 09:38:14 GMT",
"version": "v1"
},
{
"created": "Sun, 6 Apr 2014 10:49:56 GMT",
"version": "v2"
}
] | 2015-06-18 | [
[
"Mirtschink",
"André",
""
],
[
"Umrigar",
"C. J.",
""
],
[
"Morgan",
"John D.",
"III"
],
[
"Gori-Giorgi",
"Paola",
""
]
] | [
-0.10707506537437439,
0.05493488907814026,
-0.033080603927373886,
0.1271912157535553,
-0.02732182666659355,
-0.0003371986676938832,
0.0846191793680191,
0.002078735502436757,
0.010394680313766003,
-0.01254575327038765,
0.011489953845739365,
-0.05130613595247269,
-0.0650763213634491,
0.06034... | null | null | null | null | null | null | null | [
-0.10707506537437439,
0.05493488907814026,
-0.033080603927373886,
0.1271912157535553,
-0.02732182666659355,
-0.0003371986676938832,
0.0846191793680191,
0.002078735502436757,
0.010394680313766003,
-0.01254575327038765,
0.011489953845739365,
-0.05130613595247269,
-0.0650763213634491,
0.06034... |
1401.0615 | Anna-Lena Trautmann | Anna-Lena Trautmann | Message Encoding for Spread and Orbit Codes | Submitted to IEEE International Symposium on Information Theory 2014 | null | 10.1109/ISIT.2014.6875303 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Spread codes and orbit codes are special families of constant dimension
subspace codes. These codes have been well-studied for their error correction
capability and transmission rate, but the question of how to encode messages
has not been investigated. In this work we show how the message space can be
chosen for a given code and how message en- and decoding can be done.
| [
{
"created": "Fri, 3 Jan 2014 10:07:28 GMT",
"version": "v1"
}
] | 2014-09-03 | [
[
"Trautmann",
"Anna-Lena",
""
]
] | [
-0.00873291864991188,
-0.0225807037204504,
-0.02041839435696602,
-0.007508252281695604,
-0.038218580186367035,
0.0012615311425179243,
0.005331411492079496,
-0.0509691946208477,
-0.06063469499349594,
-0.0024760228116065264,
0.0833752378821373,
0.0767054408788681,
0.033266253769397736,
-0.08... | null | null | null | null | null | null | null | [
-0.00873291864991188,
-0.0225807037204504,
-0.02041839435696602,
-0.007508252281695604,
-0.038218580186367035,
0.0012615311425179243,
0.005331411492079496,
-0.0509691946208477,
-0.06063469499349594,
-0.0024760228116065264,
0.0833752378821373,
0.0767054408788681,
0.033266253769397736,
-0.08... |
1401.0616 | Colin Cotter | C.J. Cotter and A.T.T. McRae | Compatible finite element methods for numerical weather prediction | To appear in ECMWF Seminar proceedings 2014 | null | null | null | math.NA physics.ao-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This article takes the form of a tutorial on the use of a particular class of
mixed finite element methods, which can be thought of as the finite element
extension of the C-grid staggered finite difference method. The class is often
referred to as compatible finite elements, mimetic finite elements, discrete
differential forms or finite element exterior calculus. We provide an
elementary introduction in the case of the one-dimensional wave equation,
before summarising recent results in applications to the rotating shallow water
equations on the sphere, before taking an outlook towards applications in
three-dimensional compressible dynamical cores.
| [
{
"created": "Fri, 3 Jan 2014 10:20:07 GMT",
"version": "v1"
}
] | 2014-01-06 | [
[
"Cotter",
"C. J.",
""
],
[
"McRae",
"A. T. T.",
""
]
] | [
-0.09821156412363052,
0.10546001046895981,
0.07617495208978653,
0.015676267445087433,
-0.030149122700095177,
-0.053557030856609344,
-0.073854461312294,
-0.04238668829202652,
-0.06570956856012344,
-0.012593010440468788,
-0.021102404221892357,
-0.028593553230166435,
0.002454238710924983,
-0.... | null | null | null | null | null | null | null | [
-0.09821156412363052,
0.10546001046895981,
0.07617495208978653,
0.015676267445087433,
-0.030149122700095177,
-0.053557030856609344,
-0.073854461312294,
-0.04238668829202652,
-0.06570956856012344,
-0.012593010440468788,
-0.021102404221892357,
-0.028593553230166435,
0.002454238710924983,
-0.... |
1401.0621 | Zizheng Cao | Z. Cao, Q. Wang, R. Lu, H.P.A. van den Boom, E. Tangdiongga, and
A.M.J. Koonen | Phase modulation parallel optical delay detector for microwave
angle-of-arrival measurement with accuracy monitored | null | null | 10.1364/OL.39.001497 | null | physics.optics | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A novel phase modulation parallel optical delay detector is proposed for
microwave angle-of-arrival (AOA) measurement with accuracy monitored by using
only one dual-electrode Mach-Zenhder modulator. A theoretical model is built up
to analyze the proposed system including measurement accuracy monitoring. The
spatial delay measurement is translated into the phase shift between two
replicas of a microwave signal. Thanks to the accuracy monitoring, the phase
shifts from 5{\deg} to 165{\deg} are measured with less than 3.1{\deg}
measurement error.
| [
{
"created": "Fri, 3 Jan 2014 10:57:17 GMT",
"version": "v1"
}
] | 2015-06-18 | [
[
"Cao",
"Z.",
""
],
[
"Wang",
"Q.",
""
],
[
"Lu",
"R.",
""
],
[
"Boom",
"H. P. A. van den",
""
],
[
"Tangdiongga",
"E.",
""
],
[
"Koonen",
"A. M. J.",
""
]
] | [
-0.026022853329777718,
0.030721012502908707,
-0.09985613077878952,
0.03696943446993828,
0.05559682101011276,
0.0029383969958871603,
0.008171898312866688,
-0.05456170812249184,
0.06704355776309967,
0.018966220319271088,
0.05179017037153244,
-0.07270508259534836,
-0.047676943242549896,
-0.03... | null | null | null | null | null | null | null | [
-0.026022853329777718,
0.030721012502908707,
-0.09985613077878952,
0.03696943446993828,
0.05559682101011276,
0.0029383969958871603,
0.008171898312866688,
-0.05456170812249184,
0.06704355776309967,
0.018966220319271088,
0.05179017037153244,
-0.07270508259534836,
-0.047676943242549896,
-0.03... |
1401.0625 | Yakov Nekrich | Moshe Lewenstein, Yakov Nekrich, Jeffrey Scott Vitter | Space-Efficient String Indexing for Wildcard Pattern Matching | 15 pages, extended version of the STACS paper | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we describe compressed indexes that support pattern matching
queries for strings with wildcards. For a constant size alphabet our data
structure uses $O(n\log^{\varepsilon}n)$ bits for any $\varepsilon>0$ and
reports all $\mathrm{occ}$ occurrences of a wildcard string in $O(m+\sigma^g
\cdot\mu(n) + \mathrm{occ})$ time, where $\mu(n)=o(\log\log\log n)$, $\sigma$
is the alphabet size, $m$ is the number of alphabet symbols and $g$ is the
number of wildcard symbols in the query string. We also present an $O(n)$-bit
index with $O((m+\sigma^g+\mathrm{occ})\log^{\varepsilon}n)$ query time and an
$O(n(\log\log n)^2)$-bit index with $O((m+\sigma^g+\mathrm{occ})\log\log n)$
query time. These are the first non-trivial data structures for this problem
that need $o(n\log n)$ bits of space.
| [
{
"created": "Fri, 3 Jan 2014 11:08:34 GMT",
"version": "v1"
}
] | 2014-01-06 | [
[
"Lewenstein",
"Moshe",
""
],
[
"Nekrich",
"Yakov",
""
],
[
"Vitter",
"Jeffrey Scott",
""
]
] | [
0.00232548825442791,
0.030212685465812683,
0.025285279378294945,
0.05551993101835251,
-0.026280635967850685,
0.005058529321104288,
0.042537834495306015,
-0.001909443992190063,
0.04490099102258682,
-0.0644155815243721,
-0.029575593769550323,
0.06768486648797989,
0.06301131844520569,
-0.0128... | null | null | null | null | null | null | null | [
0.00232548825442791,
0.030212685465812683,
0.025285279378294945,
0.05551993101835251,
-0.026280635967850685,
0.005058529321104288,
0.042537834495306015,
-0.001909443992190063,
0.04490099102258682,
-0.0644155815243721,
-0.029575593769550323,
0.06768486648797989,
0.06301131844520569,
-0.0128... |
1401.0629 | Thomas Niebler | Stephan Doerfel and Daniel Zoller and Philipp Singer and Thomas
Niebler and Andreas Hotho and Markus Strohmaier | Of course we share! Testing Assumptions about Social Tagging Systems | null | null | null | null | cs.IR cs.DL cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Social tagging systems have established themselves as an important part in
today's web and have attracted the interest from our research community in a
variety of investigations. The overall vision of our community is that simply
through interactions with the system, i.e., through tagging and sharing of
resources, users would contribute to building useful semantic structures as
well as resource indexes using uncontrolled vocabulary not only due to the
easy-to-use mechanics. Henceforth, a variety of assumptions about social
tagging systems have emerged, yet testing them has been difficult due to the
absence of suitable data. In this work we thoroughly investigate three
available assumptions - e.g., is a tagging system really social? - by examining
live log data gathered from the real-world public social tagging system
BibSonomy. Our empirical results indicate that while some of these assumptions
hold to a certain extent, other assumptions need to be reflected and viewed in
a very critical light. Our observations have implications for the design of
future search and other algorithms to better reflect the actual user behavior.
| [
{
"created": "Fri, 3 Jan 2014 11:59:34 GMT",
"version": "v1"
},
{
"created": "Thu, 27 Mar 2014 13:03:32 GMT",
"version": "v2"
},
{
"created": "Fri, 28 Mar 2014 09:41:21 GMT",
"version": "v3"
}
] | 2014-03-31 | [
[
"Doerfel",
"Stephan",
""
],
[
"Zoller",
"Daniel",
""
],
[
"Singer",
"Philipp",
""
],
[
"Niebler",
"Thomas",
""
],
[
"Hotho",
"Andreas",
""
],
[
"Strohmaier",
"Markus",
""
]
] | [
-0.03669821470975876,
-0.03756595775485039,
-0.08898447453975677,
0.020906588062644005,
0.07962324470281601,
-0.10139257460832596,
0.07615363597869873,
-0.017284348607063293,
-0.01265894528478384,
-0.014443013817071915,
0.0041604903526604176,
-0.010818090289831161,
0.08908288925886154,
0.0... | null | null | null | null | null | null | null | [
-0.03669821470975876,
-0.03756595775485039,
-0.08898447453975677,
0.020906588062644005,
0.07962324470281601,
-0.10139257460832596,
0.07615363597869873,
-0.017284348607063293,
-0.01265894528478384,
-0.014443013817071915,
0.0041604903526604176,
-0.010818090289831161,
0.08908288925886154,
0.0... |
1401.0630 | Nikita Tarasov | E. G. Turitsyna, S. V. Smirnov, S. Sugavanam, N. Tarasov, X. Shu, S.
A. Babin, E. V. Podivilov, D. V. Churkin, G. Falkovich, S. K. Turitsyn | The laminar-turbulent transition in a fibre laser | 27 pages, 12 figures | Nature Photonics 7, 783-786 (2013) | 10.1038/nphoton.2013.246 | null | physics.optics physics.flu-dyn | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Studying transition to a highly disordered state of turbulence from a
linearly stable coherent laminar state is conceptually and technically
challenging and immensely important, e.g. all pipe and channel flows are of
that type. In optics, understanding how systems lose coherence with increase of
spatial size or excitation level is an open fundamental problem of practical
importance. Here we identify, arguably, the simplest system where this
classical problem can be studied: we learnt to operate a fibre laser in laminar
and turbulent regimes. We show that laminar phase is an analogue of a
one-dimensional coherent condensate and turbulence onset is through a spatial
loss of coherence. We discover a new mechanism of laminar-turbulent transition
in laser operation: condensate destruction by the clustering of dark and grey
solitons. This is important both for the design of devices exploiting coherent
dynamics and for conceptually new technologies based on systems operating far
from thermodynamic equilibrium.
| [
{
"created": "Fri, 3 Jan 2014 12:02:44 GMT",
"version": "v1"
}
] | 2014-01-06 | [
[
"Turitsyna",
"E. G.",
""
],
[
"Smirnov",
"S. V.",
""
],
[
"Sugavanam",
"S.",
""
],
[
"Tarasov",
"N.",
""
],
[
"Shu",
"X.",
""
],
[
"Babin",
"S. A.",
""
],
[
"Podivilov",
"E. V.",
""
],
[
"Churkin",
... | [
0.008066401816904545,
-0.061433132737874985,
0.00499343778938055,
0.06909721344709396,
-0.06931629031896591,
-0.002613383810967207,
0.02793884091079235,
-0.10286826640367508,
0.07948166877031326,
-0.01835695467889309,
-0.007969634607434273,
0.03052057884633541,
-0.07251666486263275,
-0.041... | null | null | null | null | null | null | null | [
0.008066401816904545,
-0.061433132737874985,
0.00499343778938055,
0.06909721344709396,
-0.06931629031896591,
-0.002613383810967207,
0.02793884091079235,
-0.10286826640367508,
0.07948166877031326,
-0.01835695467889309,
-0.007969634607434273,
0.03052057884633541,
-0.07251666486263275,
-0.041... |
1401.0636 | Franz X. Bronold | Elena Thiessen, Rafael L. Heinisch, Franz X. Bronold, and Holger
Fehske | Infrared light extinction by charged dielectric core-coat particles | 12 pages, 8 figures | Eur. Phys. J. D 68, 98 (2014) | 10.1140/epjd/e2014-50009-7 | null | physics.plasm-ph physics.optics | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the effect of surplus electrons on the infrared extinction of
dielectric particles with a core-coat structure and propose to use it for an
optical measurement of the particle charge in a dusty plasma. The particles
consist of an inner core with negative and an outer coat with positive electron
affinity. Both the core and the coat give rise to strong transverse optical
phonon resonances, leading to anomalous light scattering in the infrared. Due
to the radial profile of the electron affinity electrons accumulate in the coat
region making the infrared extinction of this type of particles very
charge-sensitive, in particular, the extinction due to a resonance arising
solely due to the core-coat structure. The maximum of this resonance is in the
far-infrared and responds to particle charges realizable in ordinary dusty
laboratory plasmas.
| [
{
"created": "Fri, 3 Jan 2014 12:27:36 GMT",
"version": "v1"
}
] | 2014-04-30 | [
[
"Thiessen",
"Elena",
""
],
[
"Heinisch",
"Rafael L.",
""
],
[
"Bronold",
"Franz X.",
""
],
[
"Fehske",
"Holger",
""
]
] | [
-0.0666331872344017,
0.04821305721998215,
0.006078078877180815,
0.03332469239830971,
0.02468441240489483,
0.014308233745396137,
0.06887327879667282,
0.014450655318796635,
0.027570627629756927,
0.020394964143633842,
-0.020794691517949104,
-0.09021148085594177,
-0.03071325644850731,
-0.01197... | null | null | null | null | null | null | null | [
-0.0666331872344017,
0.04821305721998215,
0.006078078877180815,
0.03332469239830971,
0.02468441240489483,
0.014308233745396137,
0.06887327879667282,
0.014450655318796635,
0.027570627629756927,
0.020394964143633842,
-0.020794691517949104,
-0.09021148085594177,
-0.03071325644850731,
-0.01197... |
1401.0640 | Tarek El-Shishtawy Ahmed | Fatma El-Ghannam and Tarek El-Shishtawy | Multi-Topic Multi-Document Summarizer | null | International Journal of Computer Science & Information Technology
(IJCSIT) Vol 5, No 6, December 2013 | 10.5121/ijcsit | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Current multi-document summarization systems can successfully extract summary
sentences, however with many limitations including: low coverage, inaccurate
extraction to important sentences, redundancy and poor coherence among the
selected sentences. The present study introduces a new concept of centroid
approach and reports new techniques for extracting summary sentences for
multi-document. In both techniques keyphrases are used to weigh sentences and
documents. The first summarization technique (Sen-Rich) prefers maximum
richness sentences. While the second (Doc-Rich), prefers sentences from
centroid document. To demonstrate the new summarization system application to
extract summaries of Arabic documents we performed two experiments. First, we
applied Rouge measure to compare the new techniques among systems presented at
TAC2011. The results show that Sen-Rich outperformed all systems in ROUGE-S.
Second, the system was applied to summarize multi-topic documents. Using human
evaluators, the results show that Doc-Rich is the superior, where summary
sentences characterized by extra coverage and more cohesion.
| [
{
"created": "Fri, 3 Jan 2014 13:07:29 GMT",
"version": "v1"
}
] | 2014-01-06 | [
[
"El-Ghannam",
"Fatma",
""
],
[
"El-Shishtawy",
"Tarek",
""
]
] | [
-0.012495988979935646,
0.03617328032851219,
0.00727334339171648,
-0.0076639000326395035,
0.05081911012530327,
0.04954589158296585,
0.0009084150078706443,
-0.038689520210027695,
0.09102461487054825,
0.047082025557756424,
-0.003311947686597705,
0.03206731751561165,
0.08656612038612366,
-0.00... | null | null | null | null | null | null | null | [
-0.012495988979935646,
0.03617328032851219,
0.00727334339171648,
-0.0076639000326395035,
0.05081911012530327,
0.04954589158296585,
0.0009084150078706443,
-0.038689520210027695,
0.09102461487054825,
0.047082025557756424,
-0.003311947686597705,
0.03206731751561165,
0.08656612038612366,
-0.00... |
1401.0642 | Uri Levy | Uri Levy and Yaron Silberberg | Electrical-Field Distributions in Waveguide Arrays - Exact and
Approximate | 93 pages, 67 figures | null | null | null | physics.optics | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Five methods of calculating electrical field distributions in one dimensional
wave-guide arrays are reviewed. We analytically solve the scalar Helmholtz
Equation and, based on the computed Bloch functions and associated bands of
propagation constants, generate the exact field distribution maps. For the
approximated slowly varying envelope equation we show that the base Bloch
functions are identical to those in the exact case, and study the differences
in the bands of propagation constants. We demonstrate that by selecting the
reference refractive index value, it is possible to minimize the error in
propagation constants of any desired band. For the distributions calculated by
the coupled mode theory, we reveal the similarity and differences of the band
made of eigenvalues of the coupled mode equations matrix when compared to the
first band of propagation constants found by the exact solution. Analysis of
two numeric beam propagation methods shows that the relative accuracy of the
calculated field distributions of each of these methods depends on excitation
conditions. The presented analysis of the slowly varying envelope equation
provides guide lines for selecting the value of the reference refractive index
to be incorporated in these numeric methods where an analytic solution is
difficult to work out or in the frequently occurring cases where an analytic
solution does not exist at all.
| [
{
"created": "Fri, 3 Jan 2014 13:12:38 GMT",
"version": "v1"
},
{
"created": "Mon, 6 Jan 2014 07:28:28 GMT",
"version": "v2"
},
{
"created": "Thu, 27 Feb 2014 10:38:38 GMT",
"version": "v3"
},
{
"created": "Fri, 21 Mar 2014 15:57:04 GMT",
"version": "v4"
}
] | 2014-03-24 | [
[
"Levy",
"Uri",
""
],
[
"Silberberg",
"Yaron",
""
]
] | [
0.03802116587758064,
0.013804539106786251,
0.03910280764102936,
0.015789154917001724,
-0.046956807374954224,
-0.07668744772672653,
-0.0017433793982490897,
-0.025500254705548286,
-0.08682383596897125,
-0.0163112785667181,
0.021226782351732254,
-0.02667226269841194,
-0.015329391695559025,
-0... | null | null | null | null | null | null | null | [
0.03802116587758064,
0.013804539106786251,
0.03910280764102936,
0.015789154917001724,
-0.046956807374954224,
-0.07668744772672653,
-0.0017433793982490897,
-0.025500254705548286,
-0.08682383596897125,
-0.0163112785667181,
0.021226782351732254,
-0.02667226269841194,
-0.015329391695559025,
-0... |
1401.0643 | Benjamin Favier | B. Favier, A.J. Barker, C. Baruteau and G.I. Ogilvie | Nonlinear evolution of tidally forced inertial waves in rotating fluid
bodies | 17 pages, 17 figures, accepted for publication in MNRAS | null | 10.1093/mnras/stu003 | null | astro-ph.EP physics.flu-dyn physics.geo-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We perform one of the first studies into the nonlinear evolution of tidally
excited inertial waves in a uniformly rotating fluid body, exploring a
simplified model of the fluid envelope of a planet (or the convective envelope
of a solar-type star) subject to the gravitational tidal perturbations of an
orbiting companion. Our model contains a perfectly rigid spherical core, which
is surrounded by an envelope of incompressible uniform density fluid. The
corresponding linear problem was studied in previous papers which this work
extends into the nonlinear regime, at moderate Ekman numbers (the ratio of
viscous to Coriolis accelerations). By performing high-resolution numerical
simulations, using a combination of pseudo-spectral and spectral element
methods, we investigate the effects of nonlinearities, which lead to
time-dependence of the flow and the corresponding dissipation rate. Angular
momentum is deposited non-uniformly, leading to the generation of significant
differential rotation in the initially uniformly rotating fluid, i.e. the body
does not evolve towards synchronism as a simple solid body rotator. This
differential rotation modifies the properties of tidally excited inertial
waves, changes the dissipative properties of the flow, and eventually becomes
unstable to a secondary shear instability provided that the Ekman number is
sufficiently small. Our main result is that the inclusion of nonlinearities
eventually modifies the flow and the resulting dissipation from what linear
calculations would predict, which has important implications for tidal
dissipation in fluid bodies. We finally discuss some limitations of our
simplified model, and propose avenues for future research to better understand
the tidal evolution of rotating planets and stars.
| [
{
"created": "Fri, 3 Jan 2014 13:16:00 GMT",
"version": "v1"
}
] | 2014-03-05 | [
[
"Favier",
"B.",
""
],
[
"Barker",
"A. J.",
""
],
[
"Baruteau",
"C.",
""
],
[
"Ogilvie",
"G. I.",
""
]
] | [
-0.03171125054359436,
0.00352160120382905,
0.0795656368136406,
-0.03353950008749962,
-0.01552584394812584,
-0.07012807577848434,
-0.07677177339792252,
-0.08327987790107727,
0.023795917630195618,
0.021304147318005562,
-0.015888534486293793,
-0.046099696308374405,
0.022670919075608253,
-0.09... | null | null | null | null | null | null | null | [
-0.03171125054359436,
0.00352160120382905,
0.0795656368136406,
-0.03353950008749962,
-0.01552584394812584,
-0.07012807577848434,
-0.07677177339792252,
-0.08327987790107727,
0.023795917630195618,
0.021304147318005562,
-0.015888534486293793,
-0.046099696308374405,
0.022670919075608253,
-0.09... |
1401.0645 | Matthew England Dr | Russell Bradford, James H. Davenport, Matthew England, Scott McCallum
and David Wilson | Truth Table Invariant Cylindrical Algebraic Decomposition | 40 pages | Journal of Symbolic Computation 76, pp. 1-35, 2016 | 10.1016/j.jsc.2015.11.002 | null | cs.SC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | When using cylindrical algebraic decomposition (CAD) to solve a problem with
respect to a set of polynomials, it is likely not the signs of those
polynomials that are of paramount importance but rather the truth values of
certain quantifier free formulae involving them. This observation motivates our
article and definition of a Truth Table Invariant CAD (TTICAD).
In ISSAC 2013 the current authors presented an algorithm that can efficiently
and directly construct a TTICAD for a list of formulae in which each has an
equational constraint. This was achieved by generalising McCallum's theory of
reduced projection operators. In this paper we present an extended version of
our theory which can be applied to an arbitrary list of formulae, achieving
savings if at least one has an equational constraint. We also explain how the
theory of reduced projection operators can allow for further improvements to
the lifting phase of CAD algorithms, even in the context of a single equational
constraint.
The algorithm is implemented fully in Maple and we present both promising
results from experimentation and a complexity analysis showing the benefits of
our contributions.
| [
{
"created": "Fri, 3 Jan 2014 13:23:05 GMT",
"version": "v1"
},
{
"created": "Tue, 30 Dec 2014 14:49:59 GMT",
"version": "v2"
},
{
"created": "Fri, 13 Nov 2015 18:08:13 GMT",
"version": "v3"
}
] | 2016-02-23 | [
[
"Bradford",
"Russell",
""
],
[
"Davenport",
"James H.",
""
],
[
"England",
"Matthew",
""
],
[
"McCallum",
"Scott",
""
],
[
"Wilson",
"David",
""
]
] | [
-0.08163141459226608,
0.08268439024686813,
-0.014659518375992775,
-0.004157795570790768,
0.012992839328944683,
-0.009900758042931557,
-0.007227851543575525,
-0.028521176427602768,
0.010707014240324497,
0.0042632753029465675,
-0.07086533308029175,
-0.03373122215270996,
0.04575465992093086,
... | null | null | null | null | null | null | null | [
-0.08163141459226608,
0.08268439024686813,
-0.014659518375992775,
-0.004157795570790768,
0.012992839328944683,
-0.009900758042931557,
-0.007227851543575525,
-0.028521176427602768,
0.010707014240324497,
0.0042632753029465675,
-0.07086533308029175,
-0.03373122215270996,
0.04575465992093086,
... |
1401.0647 | Matthew England Dr | D.J. Wilson, R.J. Bradford, J.H. Davenport and M. England | Cylindrical Algebraic Sub-Decompositions | 26 pages | Mathematics in Computer Science: Volume 8, Issue 2, pages 263-288,
Springer, 2014 | 10.1007/s11786-014-0191-z | null | cs.SC math.AG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Cylindrical algebraic decompositions (CADs) are a key tool in real algebraic
geometry, used primarily for eliminating quantifiers over the reals and
studying semi-algebraic sets. In this paper we introduce cylindrical algebraic
sub-decompositions (sub-CADs), which are subsets of CADs containing all the
information needed to specify a solution for a given problem.
We define two new types of sub-CAD: variety sub-CADs which are those cells in
a CAD lying on a designated variety; and layered sub-CADs which have only those
cells of dimension higher than a specified value. We present algorithms to
produce these and describe how the two approaches may be combined with each
other and the recent theory of truth-table invariant CAD.
We give a complexity analysis showing that these techniques can offer
substantial theoretical savings, which is supported by experimentation using an
implementation in Maple.
| [
{
"created": "Fri, 3 Jan 2014 13:49:31 GMT",
"version": "v1"
},
{
"created": "Thu, 24 Apr 2014 11:27:56 GMT",
"version": "v2"
}
] | 2014-06-27 | [
[
"Wilson",
"D. J.",
""
],
[
"Bradford",
"R. J.",
""
],
[
"Davenport",
"J. H.",
""
],
[
"England",
"M.",
""
]
] | [
-0.07163599133491516,
0.11094147711992264,
-0.012505291029810905,
-0.0022972363512963057,
0.019690509885549545,
-0.09800628572702408,
-0.013254841789603233,
-0.053180206567049026,
-0.026006212458014488,
-0.011379605159163475,
-0.07979747653007507,
-0.05260956287384033,
0.009197961539030075,
... | null | null | null | null | null | null | null | [
-0.07163599133491516,
0.11094147711992264,
-0.012505291029810905,
-0.0022972363512963057,
0.019690509885549545,
-0.09800628572702408,
-0.013254841789603233,
-0.053180206567049026,
-0.026006212458014488,
-0.011379605159163475,
-0.07979747653007507,
-0.05260956287384033,
0.009197961539030075,
... |
1401.0648 | Carl Mummert | Carl Mummert, Alaeddine Saadaoui, Sean Sovine | The modal logic of Reverse Mathematics | null | Archive for Mathematical Logic May 2015, Volume 54, Issue 3-4, pp
425-437 | 10.1007/s00153-015-0417-z | null | math.LO cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The implication relationship between subsystems in Reverse Mathematics has an
underlying logic, which can be used to deduce certain new Reverse Mathematics
results from existing ones in a routine way. We use techniques of modal logic
to formalize the logic of Reverse Mathematics into a system that we name
s-logic. We argue that s-logic captures precisely the "logical" content of the
implication and nonimplication relations between subsystems in Reverse
Mathematics. We present a sound, complete, decidable, and compact tableau-style
deductive system for s-logic, and explore in detail two fragments that are
particularly relevant to Reverse Mathematics practice and automated theorem
proving of Reverse Mathematics results.
| [
{
"created": "Fri, 3 Jan 2014 13:51:02 GMT",
"version": "v1"
}
] | 2015-04-21 | [
[
"Mummert",
"Carl",
""
],
[
"Saadaoui",
"Alaeddine",
""
],
[
"Sovine",
"Sean",
""
]
] | [
-0.033126309514045715,
-0.010278894565999508,
-0.007341903168708086,
-0.052921488881111145,
-0.04809780418872833,
-0.056607138365507126,
-0.031376730650663376,
0.035918112844228745,
-0.049601927399635315,
0.061614636331796646,
-0.019246406853199005,
0.02120133861899376,
0.10620191693305969,
... | null | null | null | null | null | null | null | [
-0.033126309514045715,
-0.010278894565999508,
-0.007341903168708086,
-0.052921488881111145,
-0.04809780418872833,
-0.056607138365507126,
-0.031376730650663376,
0.035918112844228745,
-0.049601927399635315,
0.061614636331796646,
-0.019246406853199005,
0.02120133861899376,
0.10620191693305969,
... |
1401.0654 | Weihua Deng Professor | Weihua Deng, Minghua Chen, Eli Barkai | Numerical algorithms for the forward and backward fractional Feynman-Kac
equations | 27 pages, 8 figures | Journal of Scientific Computing, 62(3), 718-746, 2015 | 10.1007/s10915-014-9873-6 | null | physics.comp-ph math.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Feynman-Kac equations are a type of partial differential equations
describing the distribution of functionals of diffusive motion. The probability
density function (PDF) of Brownian functionals satisfies the Feynman-Kac
formula, being a Schr\"{o}dinger equation in imaginary time. The functionals of
no-Brownian motion, or anomalous diffusion, follow the fractional Feynman-Kac
equation [J. Stat. Phys. 141, 1071-1092, 2010], where the fractional
substantial derivative is involved. Based on recently developed discretized
schemes for fractional substantial derivatives [arXiv:1310.3086], this paper
focuses on providing algorithms for numerically solving the forward and
backward fractional Feynman-Kac equations; since the fractional substantial
derivative is non-local time-space coupled operator, new challenges are
introduced comparing with the general fractional derivative. Two ways (finite
difference and finite element) of discretizing the space derivative are
considered. For the backward fractional Feynman-Kac equation, the numerical
stability and convergence of the algorithms with first order accuracy are
theoretically discussed; and the optimal estimates are obtained. For all the
provided schemes, including the first order and high order ones, of both
forward and backward Feynman-Kac equations, extensive numerical experiments are
performed to show their effectiveness.
| [
{
"created": "Fri, 3 Jan 2014 14:29:29 GMT",
"version": "v1"
}
] | 2015-02-03 | [
[
"Deng",
"Weihua",
""
],
[
"Chen",
"Minghua",
""
],
[
"Barkai",
"Eli",
""
]
] | [
-0.1113257184624672,
-0.06971133500337601,
0.052508991211652756,
0.057831428945064545,
0.02484956569969654,
-0.024368006736040115,
-0.009009226225316525,
-0.04290982708334923,
0.03943074122071266,
0.06816067546606064,
0.005931816063821316,
0.0027428881730884314,
-0.1002935841679573,
0.0419... | null | null | null | null | null | null | null | [
-0.1113257184624672,
-0.06971133500337601,
0.052508991211652756,
0.057831428945064545,
0.02484956569969654,
-0.024368006736040115,
-0.009009226225316525,
-0.04290982708334923,
0.03943074122071266,
0.06816067546606064,
0.005931816063821316,
0.0027428881730884314,
-0.1002935841679573,
0.0419... |
1401.0655 | Robert Gilles | Owen Sims and Robert P. Gilles | Critical Nodes In Directed Networks | 28 pages, 6 figures, 2 tables | null | null | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Critical nodes or "middlemen" have an essential place in both social and
economic networks when considering the flow of information and trade. This
paper extends the concept of critical nodes to directed networks. We identify
strong and weak middlemen. Node contestability is introduced as a form of
competition in networks; a duality between uncontested intermediaries and
middlemen is established. The brokerage power of middlemen is formally
expressed and a general algorithm is constructed to measure the brokerage power
of each node from the networks adjacency matrix. Augmentations of the brokerage
power measure are discussed to encapsulate relevant centrality measures. We use
these concepts to identify and measure middlemen in two empirical
socio-economic networks, the elite marriage network of Renaissance Florence and
Krackhardt's advice network.
| [
{
"created": "Fri, 3 Jan 2014 15:16:31 GMT",
"version": "v1"
},
{
"created": "Sat, 1 Feb 2014 16:03:36 GMT",
"version": "v2"
}
] | 2014-02-04 | [
[
"Sims",
"Owen",
""
],
[
"Gilles",
"Robert P.",
""
]
] | [
0.04120835289359093,
-0.07204568386077881,
-0.08400433510541916,
-0.05258738622069359,
0.05218628793954849,
0.019551919773221016,
0.023288555443286896,
0.03338925912976265,
-0.013648565858602524,
0.04273703694343567,
-0.03370155021548271,
-0.030903419479727745,
0.08059491217136383,
0.02147... | null | null | null | null | null | null | null | [
0.04120835289359093,
-0.07204568386077881,
-0.08400433510541916,
-0.05258738622069359,
0.05218628793954849,
0.019551919773221016,
0.023288555443286896,
0.03338925912976265,
-0.013648565858602524,
0.04273703694343567,
-0.03370155021548271,
-0.030903419479727745,
0.08059491217136383,
0.02147... |
1401.0657 | Ricard Menchon-Enrich | Ricard Menchon-Enrich, Suzanne McEndoo, Jordi Mompart, Veronica
Ahufinger, Thomas Busch | Tunneling-induced angular momentum for single cold atoms | 6 pages, 5 figures | Phys. Rev. A 89, 013626 (2014) | 10.1103/PhysRevA.89.013626 | null | quant-ph cond-mat.quant-gas physics.atom-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the generation of angular momentum carrying states for a single cold
particle by breaking the symmetry of a spatial adiabatic passage process in a
two-dimensional system consisting of three harmonic potential wells. By
following a superposition of two eigenstates of the system, a single cold
particle is completely transferred to the degenerate first excited states of
the final trap, which are resonantly coupled via tunneling to the ground states
of the initial and middle traps. Depending on the total time of the process,
angular momentum is generated in the final trap, with values that oscillate
between $\pm\hbar$. This process is discussed in terms of the asymptotic
eigenstates of the individual wells and the results have been checked by
simulations of the full two-dimensional Schr\"odinger equation.
| [
{
"created": "Fri, 3 Jan 2014 15:26:45 GMT",
"version": "v1"
}
] | 2014-04-02 | [
[
"Menchon-Enrich",
"Ricard",
""
],
[
"McEndoo",
"Suzanne",
""
],
[
"Mompart",
"Jordi",
""
],
[
"Ahufinger",
"Veronica",
""
],
[
"Busch",
"Thomas",
""
]
] | [
-0.044830210506916046,
0.019046690315008163,
0.0541420578956604,
0.04714063182473183,
-0.03939366340637207,
0.0031243441626429558,
-0.07056493312120438,
-0.041232943534851074,
0.06067903712391853,
0.012205574661493301,
-0.07630885392427444,
-0.030913488939404488,
-0.03971411660313606,
-0.1... | null | null | null | null | null | null | null | [
-0.044830210506916046,
0.019046690315008163,
0.0541420578956604,
0.04714063182473183,
-0.03939366340637207,
0.0031243441626429558,
-0.07056493312120438,
-0.041232943534851074,
0.06067903712391853,
0.012205574661493301,
-0.07630885392427444,
-0.030913488939404488,
-0.03971411660313606,
-0.1... |
1401.0658 | Stefan Ulrych | S. Ulrych | Conformal relativity with hypercomplex variables | null | Proc. R. Soc. A 470:20140027 (2014) | 10.1098/rspa.2014.0027 | null | physics.gen-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Majorana's arbitrary spin theory is considered in a hyperbolic complex
representation. The underlying differential equation is embedded into the gauge
field theories of Sachs and Carmeli. In particular, the approach of Sachs can
serve as a unified theory of general relativity and electroweak interactions.
The method is extended to conformal space with the intention to introduce the
strong interaction. It is then possible to use the wave equation, operating on
representation functions of the conformal group, to describe the dynamics of
matter fields. The resulting gauge groups resemble closely the gauge symmetries
of Glashow-Salam-Weinberg and the Standard Model.
| [
{
"created": "Wed, 1 Jan 2014 08:10:00 GMT",
"version": "v1"
},
{
"created": "Sat, 17 May 2014 04:32:34 GMT",
"version": "v2"
},
{
"created": "Sun, 15 Jun 2014 05:26:46 GMT",
"version": "v3"
},
{
"created": "Sat, 13 Sep 2014 14:32:45 GMT",
"version": "v4"
}
] | 2014-09-16 | [
[
"Ulrych",
"S.",
""
]
] | [
-0.12383072078227997,
-0.030382459983229637,
-0.06082182005047798,
-0.013909013010561466,
-0.050543054938316345,
0.010280693881213665,
-0.07520075142383575,
-0.021695014089345932,
-0.026965348049998283,
-0.029902538284659386,
0.029971322044730186,
0.006326122675091028,
-0.11312254518270493,
... | null | null | null | null | null | null | null | [
-0.12383072078227997,
-0.030382459983229637,
-0.06082182005047798,
-0.013909013010561466,
-0.050543054938316345,
0.010280693881213665,
-0.07520075142383575,
-0.021695014089345932,
-0.026965348049998283,
-0.029902538284659386,
0.029971322044730186,
0.006326122675091028,
-0.11312254518270493,
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.