Datasets:
Tags:
License:
id
stringlengths 9
16
| submitter
stringlengths 2
64
⌀ | authors
stringlengths 4
23.3k
| title
stringlengths 3
294
| comments
stringlengths 1
627
⌀ | journal-ref
stringlengths 4
349
⌀ | doi
stringlengths 12
145
⌀ | report-no
stringlengths 2
341
⌀ | categories
stringlengths 5
125
| license
stringclasses 9
values | abstract
stringlengths 21
3.66k
| versions
stringlengths 62
5.08k
| update_date
stringlengths 10
10
| authors_parsed
stringlengths 18
30.8k
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2008.11845 | Shlomo Chazan | Hodaya Hammer and Shlomo E. Chazan and Jacob Goldberger and Sharon
Gannot | FCN Approach for Dynamically Locating Multiple Speakers | null | null | null | null | eess.AS cs.LG cs.SD | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we present a deep neural network-based online multi-speaker
localisation algorithm. Following the W-disjoint orthogonality principle in the
spectral domain, each time-frequency (TF) bin is dominated by a single speaker,
and hence by a single direction of arrival (DOA). A fully convolutional network
is trained with instantaneous spatial features to estimate the DOA for each TF
bin. The high resolution classification enables the network to accurately and
simultaneously localize and track multiple speakers, both static and dynamic.
Elaborated experimental study using both simulated and real-life recordings in
static and dynamic scenarios, confirms that the proposed algorithm outperforms
both classic and recent deep-learning-based algorithms.
| [{'version': 'v1', 'created': 'Wed, 26 Aug 2020 22:21:29 GMT'}] | 2020-08-28 | [['Hammer', 'Hodaya', ''], ['Chazan', 'Shlomo E.', ''], ['Goldberger', 'Jacob', ''], ['Gannot', 'Sharon', '']] |
1309.7495 | Itai Arad | Dorit Aharonov, Itai Arad and Thomas Vidick | The Quantum PCP Conjecture | 45 pages, 4 figures, an enhanced version of the SIGACT guest column
from Volume 44 Issue 2, June 2013 | ACM SIGACT News archive Volume 44 Issue 2, June 2013, Pages 47--79 | null | null | quant-ph cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The classical PCP theorem is arguably the most important achievement of
classical complexity theory in the past quarter century. In recent years,
researchers in quantum computational complexity have tried to identify
approaches and develop tools that address the question: does a quantum version
of the PCP theorem hold? The story of this study starts with classical
complexity and takes unexpected turns providing fascinating vistas on the
foundations of quantum mechanics, the global nature of entanglement and its
topological properties, quantum error correction, information theory, and much
more; it raises questions that touch upon some of the most fundamental issues
at the heart of our understanding of quantum mechanics. At this point, the jury
is still out as to whether or not such a theorem holds. This survey aims to
provide a snapshot of the status in this ongoing story, tailored to a general
theory-of-CS audience.
| [{'version': 'v1', 'created': 'Sat, 28 Sep 2013 19:42:01 GMT'}] | 2013-10-01 | [['Aharonov', 'Dorit', ''], ['Arad', 'Itai', ''], ['Vidick', 'Thomas', '']] |
1911.07417 | Michael Whitmeyer | Michael Whitmeyer, Jonathan Liu | Algorithmic Discrepancy Minimization | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This report will be a literature review on a result in algorithmic
discrepancy theory. We will begin by providing a quick overview on discrepancy
theory and some major results in the field, and then focus on an important
result by Shachar Lovett and Raghu Meka. We restate the main algorithm and
ideas of the paper, and rewrite proofs for some of the major results in the
paper.
| [{'version': 'v1', 'created': 'Mon, 18 Nov 2019 04:10:43 GMT'}] | 2019-11-19 | [['Whitmeyer', 'Michael', ''], ['Liu', 'Jonathan', '']] |
2209.02480 | M. K. Bossard | M. K. Bossard (1), N. Banerjee (1), J. Brandt (1), Y.-K. Kim (1), M.
Krieg (2), B. Cathey (3), S. Nagaitsev (3), G. Stancari (3) ((1) University
of Chicago (2) St. Olaf College (3) Fermilab) | Thermionic Sources For Electron Cooling At IOTA | null | null | null | FERMILAB-CONF-22-621-AD | physics.acc-ph | http://creativecommons.org/licenses/by/4.0/ | We are designing and fabricating two new thermionic sources of magnetized
electrons for use in the electron lens project at the Integrable Optics Test
Accelerator (IOTA) at Fermilab. These electron sources will be used for cooling
of 2.5 MeV protons in the presence of intense space-charge. Furthermore, we are
constructing an electron source test stand at the University of Chicago which
will validate the electrical, thermal, and vacuum characteristics of thermionic
sources. In this paper we present the progress made so far and the upcoming
steps for the thermionic electron sources for electron cooling and the test
stand.
| [{'version': 'v1', 'created': 'Tue, 6 Sep 2022 13:26:31 GMT'}] | 2022-09-07 | [['Bossard', 'M. K.', ''], ['Banerjee', 'N.', ''], ['Brandt', 'J.', ''], ['Kim', 'Y. -K.', ''], ['Krieg', 'M.', ''], ['Cathey', 'B.', ''], ['Nagaitsev', 'S.', ''], ['Stancari', 'G.', '']] |
0910.2414 | Erez Hatna | Itzhak Benenson and Erez Hatna | The Third State of the Schelling Model of Residential Dynamics | null | null | null | null | physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Schelling model of segregation between two groups of residential agents
(Schelling 1971; Schelling 1978) reflects the most abstract view of the
non-economic forces of residential migrations: be close to people of 'your
own'. The model assumes that the residential agent, located in the neighborhood
where the fraction of 'friends' is less than a predefined threshold value F,
tries to relocate to a neighborhood for which this fraction is above F. It is
well known that for the equal groups, depending on F, Schelling's residential
pattern converges either to complete integration (random pattern) or
segregation. We investigate Schelling model pattern dynamics as dependent on F,
the ratio of the group numbers and the size of the neighborhood and demonstrate
that the traditional integrate-segregate dichotomy is incomplete. In case of
unequal groups, there exists the wide interval of the F-values that entails the
third persistent residential pattern, in which part of the majority population
segregates, while the rest remains integrated with the minority. We also
demonstrate that Schelling model dynamics essentially depends on the
description of agents' residential behavior. To obtain sociologically
meaningful results, the agents should be satisficers, and the fraction of the
agents who relocate irrespective of the neighborhood state should be non-zero.
| [{'version': 'v1', 'created': 'Tue, 13 Oct 2009 15:16:24 GMT'}] | 2009-10-14 | [['Benenson', 'Itzhak', ''], ['Hatna', 'Erez', '']] |
2204.08303 | Austin Hoover | A. Hoover, N. E. Evans | Four-dimensional emittance measurement at the Spallation Neutron Source | null | null | 10.1016/j.nima.2022.167376 | null | physics.acc-ph | http://creativecommons.org/licenses/by/4.0/ | A coasting hadron beam with an elliptical transverse profile, uniform charge
density, and small transverse four-dimensional (4D) emittance could improve
accelerator performance in several contexts. A phase space painting method to
generate such a distribution is being tested in the Spallation Neutron Source
(SNS) accumulator ring. A critical component of these efforts is to measure the
4D emittance of the beam during accumulation. The 4D emittance can be
reconstructed from measured beam profiles in two ways: in the multi-optics
method, the optics between a reconstruction and measurement location are
varied; in the fixed-optics method, multiple measurement locations are used
without modifying the optics. The fixed-optics method is faster but can lead to
large uncertainty in the reconstructed 4D emittance. In this paper, we
implement a variant of the multi-optics method using the four available
wire-scanners near the SNS target. We also modify the wire-scanner region to
reduce the uncertainty of the fixed-optics method. We then demonstrate the
usefulness of the fixed-optics method by reconstructing the 4D emittance
evolution during accumulation in the SNS ring.
| [{'version': 'v1', 'created': 'Mon, 18 Apr 2022 13:18:38 GMT'}, {'version': 'v2', 'created': 'Sun, 24 Jul 2022 23:57:26 GMT'}] | 2022-09-14 | [['Hoover', 'A.', ''], ['Evans', 'N. E.', '']] |
physics/9908056 | Norayr Akopov | A.R. Tumanyan, N.Z. Akopov, Z.G. Guiragossian, Z.N. Akopov | Concept of Powerful Multistage Coaxial Cyclotron for Pulsed and
Continuous Beam Production | 10 pages, 1 figure | null | null | null | physics.acc-ph | null | The concept of large-radius multistage coaxial cyclotrons having separated
orbits is described, to generate proton beams of 120-2000 MeV energy at tens of
GW pulsed and hundreds of MW in continuous beam power operation. Accelerated
beam losses must be less than 0.1 W/m for the intercepted average beam power
linear density. The concept is inherently configured to actively compensate the
longitudinal and transverse space charge expansion in beam bunches. These are
based on (1) actively varying the bunch acceleration equilibrium phase while
maintaining isochronism, independently for each cyclotron turns; (2)
independently changing the acceleration voltage for each turn together with
orbit corrections that preserve isochronism; (3) independently changing the
transverse betatron oscillation tune shift, to assure non-resonant operation.
Also, (4) sextupole lenses are included to compensate for chromaticity effects.
Moreover, the concept is based on optimum uses of practical successful results
so far achieved in beam acceleration and storage techniques. This accelerator
can be used to deliver a pulsed intense source of neutrons without the use of
storage rings, and to drive the different transmutation technologies. As an
example of such a cyclotron system, we describe our approach of accelerating
single-bunch proton beams at up to 1 GeV energy, with pulsed beam power of 80
GW and bunch duration of 2 ns. The exemplar cyclotron accelerator system is
configured to be located in the shielded structure of the 6-GeV Yerevan
Electron Synchrotron. The cost of such a cyclotron system is estimated to be
approximately 40,000,000 US dollars, if implemented in Armenia at substantially
reduced labor costs.
| [{'version': 'v1', 'created': 'Sun, 29 Aug 1999 12:02:50 GMT'}] | 2007-05-23 | [['Tumanyan', 'A. R.', ''], ['Akopov', 'N. Z.', ''], ['Guiragossian', 'Z. G.', ''], ['Akopov', 'Z. N.', '']] |
1210.7093 | Bruno Paroli | B. Paroli | Thomson backscattering diagnostics of nanosecond electron bunches in
high space charge regime | PhD thesis 2012, link http://phd.fisica.unimi.it | null | null | null | physics.plasm-ph physics.acc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The intra-beam repulsions play a significant role in determining the
performances of free-electron devices when an high brilliance of the beam is
required. The transversal and longitudinal spread of the beam, its energy and
density are fundamental parameters in any beam experiment and different beam
diagnostics are available to measure such parameters. A diagnostic method based
on the Thomson backscattering of a laser beam impinging on the particle beam is
proposed in this work for the study of nanosecond electron bunches in high
space charge regime. This diagnostics, aimed to the measurement of density,
energy and energy spread, was set-up in a Malmberg-Penning trap (generally used
for the electron/ion confinment) in two different configurations designed to
optimize sensitivity, spatial resolution and electron-beam coincidence in space
and time. To this purpose an electron bunch (pulse time <4ns), produced by a
photocathode source, was preliminary characterized with different electrostatic
diagnostics and used to test the diagnostics systems. The solutions are
detailed, which were devised for both the laser and bunch injection in the
vacuum chamber, space and time coincidence of electron and laser pulses, photon
detection, optimization of the geometry in the laser-beam interaction. The
results are then summarized with an estimate of the minimum sensitivity of the
set-up.
| [{'version': 'v1', 'created': 'Fri, 26 Oct 2012 10:52:35 GMT'}] | 2012-10-29 | [['Paroli', 'B.', '']] |
1805.10159 | Nikolai Zolotykh | Vadim Lozin, Igor Razgon, Viktor Zamaraev, Elena Zamaraeva, Nikolai
Yu. Zolotykh | Linear read-once and related Boolean functions | Submitted to Discrete and Applied Mathematics. arXiv admin note: text
overlap with arXiv:1706.01747 | null | null | null | math.CO cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | It is known that a positive Boolean function f depending on n variables has
at least n + 1 extremal points, i.e. minimal ones and maximal zeros. We show
that f has exactly n + 1 extremal points if and only if it is linear read-once.
The class of linear read-once functions is known to be the intersection of the
classes of read-once and threshold functions. Generalizing this result we show
that the class of linear read-once functions is the intersection of read-once
and Chow functions. We also find the set of minimal read-once functions which
are not linear read-once and the set of minimal threshold functions which are
not linear read-once. In other words, we characterize the class of linear
read-once functions by means of minimal forbidden subfunctions within the
universe of read-once and the universe of threshold functions. Within the
universe of threshold functions the importance of linear read-once func- tions
is due to the fact that they attain the minimum value of the specification
number, which is n + 1 for functions depending on n variables. In 1995 Anthony
et al. conjec- tured that for all other threshold functions the specification
number is strictly greater than n + 1. We disprove this conjecture by
exhibiting a threshold non-linear read-once function depending on n variables
whose specification number is n + 1.
| [{'version': 'v1', 'created': 'Thu, 24 May 2018 08:13:16 GMT'}] | 2018-05-28 | [['Lozin', 'Vadim', ''], ['Razgon', 'Igor', ''], ['Zamaraev', 'Viktor', ''], ['Zamaraeva', 'Elena', ''], ['Zolotykh', 'Nikolai Yu.', '']] |
2301.08189 | Mihir Durve | Mihir Durve, Sibilla Orsini, Adriano Tiribocchi, Andrea Montessori,
Jean-Michel Tucny, Marco Lauricella, Andrea Camposeo, Dario Pisignano, and
Sauro Succi | Benchmarking YOLOv5 and YOLOv7 models with DeepSORT for droplet tracking
applications | 13 pages, 4 figures, 3 tables | null | null | null | cs.CV physics.flu-dyn | http://creativecommons.org/licenses/by/4.0/ | Tracking droplets in microfluidics is a challenging task. The difficulty
arises in choosing a tool to analyze general microfluidic videos to infer
physical quantities. The state-of-the-art object detector algorithm You Only
Look Once (YOLO) and the object tracking algorithm Simple Online and Realtime
Tracking with a Deep Association Metric (DeepSORT) are customizable for droplet
identification and tracking. The customization includes training YOLO and
DeepSORT networks to identify and track the objects of interest. We trained
several YOLOv5 and YOLOv7 models and the DeepSORT network for droplet
identification and tracking from microfluidic experimental videos. We compare
the performance of the droplet tracking applications with YOLOv5 and YOLOv7 in
terms of training time and time to analyze a given video across various
hardware configurations. Despite the latest YOLOv7 being 10% faster, the
real-time tracking is only achieved by lighter YOLO models on RTX 3070 Ti GPU
machine due to additional significant droplet tracking costs arising from the
DeepSORT algorithm. This work is a benchmark study for the YOLOv5 and YOLOv7
networks with DeepSORT in terms of the training time and inference time for a
custom dataset of microfluidic droplets.
| [{'version': 'v1', 'created': 'Thu, 19 Jan 2023 17:37:40 GMT'}] | 2023-01-20 | [['Durve', 'Mihir', ''], ['Orsini', 'Sibilla', ''], ['Tiribocchi', 'Adriano', ''], ['Montessori', 'Andrea', ''], ['Tucny', 'Jean-Michel', ''], ['Lauricella', 'Marco', ''], ['Camposeo', 'Andrea', ''], ['Pisignano', 'Dario', ''], ['Succi', 'Sauro', '']] |
2104.13974 | Mohammad Shojafar | Farooq Hoseiny, Sadoon Azizi, Mohammad Shojafar, Rahim Tafazolli | Joint QoS-aware and Cost-efficient Task Scheduling for Fog-Cloud
Resources in a Volunteer Computing System | 21 pages, 6 figures, ACM Transactions on Internet Technology (TOIT) | null | 10.1145/3418501 | null | cs.DC math.OC | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Volunteer computing is an Internet-based distributed computing system in
which volunteers share their extra available resources to manage large-scale
tasks. However, computing devices in a Volunteer Computing System (VCS) are
highly dynamic and heterogeneous in terms of their processing power, monetary
cost, and data transferring latency. To ensure both the high Quality of Service
(QoS) and low cost for different requests, all of the available computing
resources must be used efficiently. Task scheduling is an NP-hard problem that
is considered one of the main critical challenges in a heterogeneous VCS. Due
to this, in this paper, we design two task scheduling algorithms for VCSs,
named Min-CCV and Min-V. The main goal of the proposed algorithms is jointly
minimizing the computation, communication and delay violation cost for the
Internet of Things (IoT) requests. Our extensive simulation results show that
proposed algorithms are able to allocate tasks to volunteer fog/cloud resources
more efficiently than the state-of-the-art. Specifically, our algorithms
improve the deadline satisfaction task rates by around 99.5% and decrease the
total cost between 15 to 53% in comparison with the genetic-based algorithm.
| [{'version': 'v1', 'created': 'Wed, 28 Apr 2021 18:58:51 GMT'}] | 2021-04-30 | [['Hoseiny', 'Farooq', ''], ['Azizi', 'Sadoon', ''], ['Shojafar', 'Mohammad', ''], ['Tafazolli', 'Rahim', '']] |
2005.12540 | Leopold Tremant | Philippe Chartier (MINGUS), Mohammed Lemou (IRMAR, MINGUS), L\'eopold
Tr\'emant (MINGUS) | Uniformly accurate numerical schemes for a class of dissipative systems | null | null | null | null | math.AP cs.NA math.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider a class of relaxation problems mixing slow and fast variations
which can describe population dynamics models or hyperbolic systems, with
varying stiffness (from non-stiff to strongly dissipative), and develop a
multi-scale method by decomposing this problem into a micro-macro system where
the original stiffness is broken. We show that this new problem can therefore
be simulated with a uniform order of accuracy using standard explicit numerical
schemes. In other words, it is possible to solve the micro-macro problem with a
cost independent of the stiffness (a.k.a. uniform cost), such that the error is
also uniform. This method is successfully applied to two hyperbolic systems
with and without non-linearities, and is shown to circumvent the phenomenon of
order reduction.
| [{'version': 'v1', 'created': 'Tue, 26 May 2020 06:48:57 GMT'}] | 2020-05-27 | [['Chartier', 'Philippe', '', 'MINGUS'], ['Lemou', 'Mohammed', '', 'IRMAR, MINGUS'], ['Trémant', 'Léopold', '', 'MINGUS']] |
2204.05727 | Hui Kong | Banghe Wu, Chengzhong Xu, Hui Kong | LiDAR Road-Atlas: An Efficient Map Representation for General 3D Urban
Environment | null | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we propose the LiDAR Road-Atlas, a compactable and efficient 3D
map representation, for autonomous robot or vehicle navigation in general urban
environment. The LiDAR Road-Atlas can be generated by an online mapping
framework based on incrementally merging local 2D occupancy grid maps (2D-OGM).
Specifically, the contributions of our LiDAR Road-Atlas representation are
threefold. First, we solve the challenging problem of creating local 2D-OGM in
non-structured urban scenes based on a real-time delimitation of traversable
and curb regions in LiDAR point cloud. Second, we achieve accurate 3D mapping
in multiple-layer urban road scenarios by a probabilistic fusion scheme. Third,
we achieve very efficient 3D map representation of general environment thanks
to the automatic local-OGM induced traversable-region labeling and a sparse
probabilistic local point-cloud encoding. Given the LiDAR Road-Atlas, one can
achieve accurate vehicle localization, path planning and some other tasks. Our
map representation is insensitive to dynamic objects which can be filtered out
in the resulting map based on a probabilistic fusion. Empirically, we compare
our map representation with a couple of popular map representation methods in
robotics and autonomous driving societies, and our map representation is more
favorable in terms of efficiency, scalability and compactness. In addition, we
also evaluate localization accuracy extensively given the created LiDAR
Road-Atlas representations on several public benchmark datasets. With a
16-channel LiDAR sensor, our method achieves an average global localization
errors of 0.26m (translation) and 1.07 degrees (rotation) on the Apollo
dataset, and 0.89m (translation) and 1.29 degrees (rotation) on the MulRan
dataset, respectively, at 10Hz, which validates the promising performance of
our map representation for autonomous driving.
| [{'version': 'v1', 'created': 'Tue, 12 Apr 2022 11:46:09 GMT'}, {'version': 'v2', 'created': 'Mon, 13 Mar 2023 07:16:04 GMT'}] | 2023-03-14 | [['Wu', 'Banghe', ''], ['Xu', 'Chengzhong', ''], ['Kong', 'Hui', '']] |
1906.05118 | Faisal Khan | Faisal Shah Khan | Nash embedding: a road map to realizing quantum hardware | 1 figure | Digitale Welt, Issue 1 2020 - Proceedings of the first
International Symposium on Applied Artificial Intelligence, Munich, 2019 | null | null | physics.gen-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The non-Euclidean nature of the mathematical model of quantum circuits leaves
open the question of their practical implementation in hardware platforms which
necessarily reside in the Euclidean space $\mathbb{R}^3$. On the other hand,
reversible circuits are elements of Euclidean spaces, making their physical
realization in hardware platforms possible and practical. Here, the quantum
circuit model for quantum computing is mapped into that of reversible computing
in a mathematically robust fashion using Nash embedding so that every quantum
computation can be realized as an equivalent reversible one.
| [{'version': 'v1', 'created': 'Sun, 9 Jun 2019 19:44:04 GMT'}, {'version': 'v2', 'created': 'Sat, 15 Jun 2019 18:20:58 GMT'}] | 2019-11-25 | [['Khan', 'Faisal Shah', '']] |
1809.01587 | Minsuk Kahng | Minsuk Kahng, Nikhil Thorat, Duen Horng Chau, Fernanda Vi\'egas,
Martin Wattenberg | GAN Lab: Understanding Complex Deep Generative Models using Interactive
Visual Experimentation | This paper will be published in the IEEE Transactions on
Visualization and Computer Graphics, 25(1), January 2019, and presented at
IEEE VAST 2018 | null | 10.1109/TVCG.2018.2864500 | null | cs.HC cs.AI cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent success in deep learning has generated immense interest among
practitioners and students, inspiring many to learn about this new technology.
While visual and interactive approaches have been successfully developed to
help people more easily learn deep learning, most existing tools focus on
simpler models. In this work, we present GAN Lab, the first interactive
visualization tool designed for non-experts to learn and experiment with
Generative Adversarial Networks (GANs), a popular class of complex deep
learning models. With GAN Lab, users can interactively train generative models
and visualize the dynamic training process's intermediate results. GAN Lab
tightly integrates an model overview graph that summarizes GAN's structure, and
a layered distributions view that helps users interpret the interplay between
submodels. GAN Lab introduces new interactive experimentation features for
learning complex deep learning models, such as step-by-step training at
multiple levels of abstraction for understanding intricate training dynamics.
Implemented using TensorFlow.js, GAN Lab is accessible to anyone via modern web
browsers, without the need for installation or specialized hardware, overcoming
a major practical challenge in deploying interactive tools for deep learning.
| [{'version': 'v1', 'created': 'Wed, 5 Sep 2018 15:51:50 GMT'}] | 2018-09-06 | [['Kahng', 'Minsuk', ''], ['Thorat', 'Nikhil', ''], ['Chau', 'Duen Horng', ''], ['Viégas', 'Fernanda', ''], ['Wattenberg', 'Martin', '']] |
1801.05617 | Gilles Jacobs | Cynthia Van Hee, Gilles Jacobs, Chris Emmery, Bart Desmet, Els
Lefever, Ben Verhoeven, Guy De Pauw, Walter Daelemans and V\'eronique Hoste | Automatic Detection of Cyberbullying in Social Media Text | 21 pages, 9 tables, under review | null | 10.1371/journal.pone.0203794 | null | cs.CL cs.CY cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While social media offer great communication opportunities, they also
increase the vulnerability of young people to threatening situations online.
Recent studies report that cyberbullying constitutes a growing problem among
youngsters. Successful prevention depends on the adequate detection of
potentially harmful messages and the information overload on the Web requires
intelligent systems to identify potential risks automatically. The focus of
this paper is on automatic cyberbullying detection in social media text by
modelling posts written by bullies, victims, and bystanders of online bullying.
We describe the collection and fine-grained annotation of a training corpus for
English and Dutch and perform a series of binary classification experiments to
determine the feasibility of automatic cyberbullying detection. We make use of
linear support vector machines exploiting a rich feature set and investigate
which information sources contribute the most for this particular task.
Experiments on a holdout test set reveal promising results for the detection of
cyberbullying-related posts. After optimisation of the hyperparameters, the
classifier yields an F1-score of 64% and 61% for English and Dutch
respectively, and considerably outperforms baseline systems based on keywords
and word unigrams.
| [{'version': 'v1', 'created': 'Wed, 17 Jan 2018 10:38:20 GMT'}] | 2020-03-03 | [['Van Hee', 'Cynthia', ''], ['Jacobs', 'Gilles', ''], ['Emmery', 'Chris', ''], ['Desmet', 'Bart', ''], ['Lefever', 'Els', ''], ['Verhoeven', 'Ben', ''], ['De Pauw', 'Guy', ''], ['Daelemans', 'Walter', ''], ['Hoste', 'Véronique', '']] |
2211.01209 | Ryan Dougherty | Ryan E. Dougherty | An Asymptotically Optimal Bound for Covering Arrays of Higher Index | null | null | null | null | math.CO cs.DM | http://creativecommons.org/licenses/by/4.0/ | A \emph{covering array} is an $N \times k$ array ($N$ rows, $k$ columns) with
each entry from a $v$-ary alphabet, and for every $N\times t$ subarray, all
$v^t$ tuples of size $t$ appear at least $\lambda$ times. The \emph{covering
array number} is the smallest number $N$ for which such an array exists. For
$\lambda = 1$, the covering array number is asymptotically logarithmic in $k$,
when $v, t$ are fixed. Godbole, Skipper, and Sunley proved a bound of the form
$\log k + \lambda \log \log k$ for the covering array number for arbitrary
$\lambda$ and $v,t$ constant. The author proved a similar bound via a different
technique, and conjectured that the $\log \log k$ term can be removed. In this
short note we answer the conjecture in the affirmative with an asymptotically
tight upper bound. In particular, we employ the probabilistic method in
conjunction with the Lambert $W$ function.
| [{'version': 'v1', 'created': 'Wed, 2 Nov 2022 15:39:17 GMT'}] | 2022-11-03 | [['Dougherty', 'Ryan E.', '']] |
2007.08926 | Gordon Plotkin | Martin Abadi and Gordon Plotkin | Smart Choices and the Selection Monad | Revision for LMCS publication | null | null | null | cs.LO cs.LG cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Describing systems in terms of choices and their resulting costs and rewards
offers the promise of freeing algorithm designers and programmers from
specifying how those choices should be made; in implementations, the choices
can be realized by optimization techniques and, increasingly, by
machine-learning methods. We study this approach from a programming-language
perspective. We define two small languages that support decision-making
abstractions: one with choices and rewards, and the other additionally with
probabilities. We give both operational and denotational semantics.
In the case of the second language we consider three denotational semantics,
with varying degrees of correlation between possible program values and
expected rewards. The operational semantics combine the usual semantics of
standard constructs with optimization over spaces of possible execution
strategies. The denotational semantics, which are compositional, rely on the
selection monad, to handle choice, augmented with an auxiliary monad to handle
other effects, such as rewards or probability.
We establish adequacy theorems that the two semantics coincide in all cases.
We also prove full abstraction at base types, with varying notions of
observation in the probabilistic case corresponding to the various degrees of
correlation. We present axioms for choice combined with rewards and
probability, establishing completeness at base types for the case of rewards
without probability.
| [{'version': 'v1', 'created': 'Fri, 17 Jul 2020 12:13:16 GMT'}, {'version': 'v2', 'created': 'Tue, 27 Oct 2020 18:53:23 GMT'}, {'version': 'v3', 'created': 'Thu, 10 Dec 2020 18:33:28 GMT'}, {'version': 'v4', 'created': 'Thu, 11 Mar 2021 11:48:28 GMT'}, {'version': 'v5', 'created': 'Mon, 28 Jun 2021 02:11:21 GMT'}, {'version': 'v6', 'created': 'Tue, 17 Aug 2021 00:30:18 GMT'}, {'version': 'v7', 'created': 'Sat, 14 Jan 2023 04:01:39 GMT'}] | 2023-01-18 | [['Abadi', 'Martin', ''], ['Plotkin', 'Gordon', '']] |
1810.04034 | Hai Son Nguyen | S\'ebastien Cueff, Matthew Shao Ran Huang, Dongfang Li, X. Letartre,
Rashid Zia, Pierre Viktorovitch, Hai Son Nguyen | Tailoring the Local Density of Optical States and directionality of
light emission by symmetry-breaking | null | null | null | null | physics.optics | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a method to simultaneously engineer the energy-momentum dispersion
and the local density of optical states. Using vertical symmetry-breaking in
high-contrast gratings, we enable the mixing of modes with different parities,
thus producing hybridized modes with controlled dispersion. By tuning geometric
parameters, we control the coupling between Bloch modes, leading to flatband,
M- and W-shaped dispersion as well as Dirac dispersion. Such a platform opens
up a new way to control the direction of emitted photons, and to enhance the
spontaneous emission into desired modes. We then experimentally demonstrate
that this method can be used to redirect light emission from weak emitters --
defects in Silicon -- to optical modes with adjustable density of states and
angle of emission.
| [{'version': 'v1', 'created': 'Mon, 8 Oct 2018 14:22:25 GMT'}] | 2018-10-10 | [['Cueff', 'Sébastien', ''], ['Huang', 'Matthew Shao Ran', ''], ['Li', 'Dongfang', ''], ['Letartre', 'X.', ''], ['Zia', 'Rashid', ''], ['Viktorovitch', 'Pierre', ''], ['Nguyen', 'Hai Son', '']] |
1809.04981 | Niklas Edberg | Niklas J. T. Edberg, M. Alho, M. Andr\'e, D. J. Andrews, E. Behar, J.
L. Burch, C. M. Carr, E. Cupido, I. A. D. Engelhardt, A. I. Eriksson, K.-H.
Glassmeier, C. Goetz, R. Goldstein, P. Henri, F. L. Johansson, C. Koenders,
K. Mandt, H. Nilsson, E. Odelstad, I. Richter, C. Simon Wedlund, G. Stenberg
Wieser, K. Szego, E. Vigren, and M. Volwerk | CME impact on comet 67P/Churyumov-Gerasimenko | 14 pages, 12 figures | Monthly Notices of the Royal Astronomical Society, Volume 462,
2016 | 10.1093/mnras/stw2112 | null | physics.space-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present Rosetta observations from comet 67P/Churyumov-Gerasimenko during
the impact of a coronal mass ejection (CME). The CME impacted on 5-6 Oct 2015,
when Rosetta was about 800 km from the comet nucleus, \textcolor{black}{and 1.4
AU from the Sun}. Upon impact, the plasma environment is compressed to the
level that solar wind ions, not seen a few days earlier when at 1500 km, now
reach Rosetta. In response to the compression, the flux of suprathermal
electrons increases by a factor of 5-10 and the background magnetic field
strength increases by a factor of $\sim$2.5. The plasma density increases by a
factor of 10 and reaches 600 cm$^{-3}$, due to increased particle impact
ionisation, charge exchange and the adiabatic compression of the plasma
environment. We also observe unprecedentedly large magnetic field spikes at 800
km, reaching above 200 nT, which are interpreted as magnetic flux ropes. We
suggest that these could possibly be formed by magnetic reconnection processes
in the coma as the magnetic field across the CME changes polarity, or as a
consequence of strong shears causing Kelvin-Helmholtz instabilities in the
plasma flow. Due to the \textcolor{black}{limited orbit of Rosetta}, we are not
able to observe if a tail disconnection occurs during the CME impact, which
could be expected based on previous remote observations of other CME-comet
interactions.
| [{'version': 'v1', 'created': 'Thu, 13 Sep 2018 14:20:46 GMT'}] | 2018-09-14 | [['Edberg', 'Niklas J. T.', ''], ['Alho', 'M.', ''], ['André', 'M.', ''], ['Andrews', 'D. J.', ''], ['Behar', 'E.', ''], ['Burch', 'J. L.', ''], ['Carr', 'C. M.', ''], ['Cupido', 'E.', ''], ['Engelhardt', 'I. A. D.', ''], ['Eriksson', 'A. I.', ''], ['Glassmeier', 'K. -H.', ''], ['Goetz', 'C.', ''], ['Goldstein', 'R.', ''], ['Henri', 'P.', ''], ['Johansson', 'F. L.', ''], ['Koenders', 'C.', ''], ['Mandt', 'K.', ''], ['Nilsson', 'H.', ''], ['Odelstad', 'E.', ''], ['Richter', 'I.', ''], ['Wedlund', 'C. Simon', ''], ['Wieser', 'G. Stenberg', ''], ['Szego', 'K.', ''], ['Vigren', 'E.', ''], ['Volwerk', 'M.', '']] |
1506.03885 | Dietmar Berwanger | Dietmar Berwanger and Marie van den Bogaard | Games with Delays. A Frankenstein Approach | null | null | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We investigate infinite games on finite graphs where the information flow is
perturbed by nondeterministic signalling delays. It is known that such
perturbations make synthesis problems virtually unsolvable, in the general
case. On the classical model where signals are attached to states, tractable
cases are rare and difficult to identify.
Here, we propose a model where signals are detached from control states, and
we identify a subclass on which equilibrium outcomes can be preserved, even if
signals are delivered with a delay that is finitely bounded. To offset the
perturbation, our solution procedure combines responses from a collection of
virtual plays following an equilibrium strategy in the instant- signalling game
to synthesise, in a Frankenstein manner, an equivalent equilibrium strategy for
the delayed-signalling game.
| [{'version': 'v1', 'created': 'Fri, 12 Jun 2015 01:19:54 GMT'}] | 2015-06-15 | [['Berwanger', 'Dietmar', ''], ['Bogaard', 'Marie van den', '']] |
2010.03022 | Jie Ma | Jie Ma, Shuai Wang, Rishita Anubhai, Miguel Ballesteros, Yaser
Al-Onaizan | Resource-Enhanced Neural Model for Event Argument Extraction | Findings of EMNLP 2020 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Event argument extraction (EAE) aims to identify the arguments of an event
and classify the roles that those arguments play. Despite great efforts made in
prior work, there remain many challenges: (1) Data scarcity. (2) Capturing the
long-range dependency, specifically, the connection between an event trigger
and a distant event argument. (3) Integrating event trigger information into
candidate argument representation. For (1), we explore using unlabeled data in
different ways. For (2), we propose to use a syntax-attending Transformer that
can utilize dependency parses to guide the attention mechanism. For (3), we
propose a trigger-aware sequence encoder with several types of
trigger-dependent sequence representations. We also support argument extraction
either from text annotated with gold entities or from plain text. Experiments
on the English ACE2005 benchmark show that our approach achieves a new
state-of-the-art.
| [{'version': 'v1', 'created': 'Tue, 6 Oct 2020 21:00:54 GMT'}] | 2020-10-08 | [['Ma', 'Jie', ''], ['Wang', 'Shuai', ''], ['Anubhai', 'Rishita', ''], ['Ballesteros', 'Miguel', ''], ['Al-Onaizan', 'Yaser', '']] |
2303.01595 | Ellis Solaiman | Adrian Delchev and Ioannis Sfyrakis and Ellis Solaiman | Developing a Compiler for EROP -- A Language for the Specification of
Smart Contracts, An Experience Report | null | null | null | null | cs.PL cs.DC cs.SE | http://creativecommons.org/licenses/by/4.0/ | A smart contract is a translation of a standard paper-based contract that can
be enforced and executed by a contract management system. At a high level of
abstraction, a contract is only a document that describes how the signing
parties are to behave in different scenarios; nevertheless, the translation of
a typical paper-based contract to its electronic counterpart has proved to be
both time-consuming and difficult. The requirement for a language capable of
capturing the core of a contract in simple phrases and definitions has been a
focus of study for many years. EROP (Events, Rights, Obligations, Prohibitions)
is a contract specification language that breaks a contract down into sets of
events, rights, obligations, and prohibitions.
| [{'version': 'v1', 'created': 'Thu, 2 Mar 2023 21:35:25 GMT'}] | 2023-03-06 | [['Delchev', 'Adrian', ''], ['Sfyrakis', 'Ioannis', ''], ['Solaiman', 'Ellis', '']] |
2106.01806 | Dorcas Ofori-Boateng | Dorcas Ofori-Boateng, Ignacio Segovia Dominguez, Murat Kantarcioglu,
Cuneyt G. Akcora, Yulia R. Gel | Topological Anomaly Detection in Dynamic Multilayer Blockchain Networks | 26 pages, 6 figures, 7 tables | null | null | null | cs.CR math.AT stat.AP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Motivated by the recent surge of criminal activities with
cross-cryptocurrency trades, we introduce a new topological perspective to
structural anomaly detection in dynamic multilayer networks. We postulate that
anomalies in the underlying blockchain transaction graph that are composed of
multiple layers are likely to also be manifested in anomalous patterns of the
network shape properties. As such, we invoke the machinery of clique persistent
homology on graphs to systematically and efficiently track evolution of the
network shape and, as a result, to detect changes in the underlying network
topology and geometry. We develop a new persistence summary for multilayer
networks, called stacked persistence diagram, and prove its stability under
input data perturbations. We validate our new topological anomaly detection
framework in application to dynamic multilayer networks from the Ethereum
Blockchain and the Ripple Credit Network, and demonstrate that our stacked PD
approach substantially outperforms state-of-art techniques.
| [{'version': 'v1', 'created': 'Thu, 3 Jun 2021 12:58:04 GMT'}, {'version': 'v2', 'created': 'Tue, 6 Jul 2021 18:05:13 GMT'}] | 2021-07-08 | [['Ofori-Boateng', 'Dorcas', ''], ['Dominguez', 'Ignacio Segovia', ''], ['Kantarcioglu', 'Murat', ''], ['Akcora', 'Cuneyt G.', ''], ['Gel', 'Yulia R.', '']] |
1109.4347 | Yohji Akama | Yohji Akama and Kei Irie | VC dimension of ellipsoids | null | null | null | null | math.CO cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We will establish that the VC dimension of the class of d-dimensional
ellipsoids is (d^2+3d)/2, and that maximum likelihood estimate with N-component
d-dimensional Gaussian mixture models induces a geometric class having VC
dimension at least N(d^2+3d)/2.
Keywords: VC dimension; finite dimensional ellipsoid; Gaussian mixture model
| [{'version': 'v1', 'created': 'Tue, 20 Sep 2011 16:53:29 GMT'}] | 2011-09-21 | [['Akama', 'Yohji', ''], ['Irie', 'Kei', '']] |
0807.4825 | Thomas Heimburg | Andreas Blicher, Katarzyna Wodzinska, Matthias Fidorra, Mathias
Winterhalter and Thomas Heimburg | The temperature dependence of lipid membrane permeability, its quantized
nature, and the influence of anesthetics | 12 pages, 6 figures | Biophys. J. 96 (2009), 4581-4591 | 10.1016/j.bpj.2009.01.062 | null | physics.bio-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We investigate the permeability of lipid membranes for fluorescence dyes and
ions. We find that permeability reaches a maximum close to the chain melting
transition of the membranes. Close to transitions, fluctuations in area and
compressibility are high, leading to an increased likelihood of spontaneous
lipid pore formation. Fluorescence Correlation Spectroscopy (FCS) reveals the
permeability for rhodamine dyes across 100 nm vesicles. Using FCS, we find that
the permeability of vesicle membranes for fluorescence dyes is within error
proportional to the excess heat capacity. To estimate defect size we measure
the conductance of solvent-free planar lipid bilayer. Microscopically, we show
that permeation events appear as quantized current events. Further, we
demonstrate that anesthetics lead to a change in membrane permeability that can
be predicted from their effect on heat capacity profiles. Depending on
temperature, the permeability can be enhanced or reduced. We demonstrate that
anesthetics decrease channel conductance and ultimately lead to 'blocking' of
the lipid pores in experiments performed at or above the chain melting
transition. Our data suggest that the macroscopic increase in permeability
close to transitions and microscopic lipid channel formation are the same
physical process.
| [{'version': 'v1', 'created': 'Wed, 30 Jul 2008 18:15:16 GMT'}] | 2009-06-09 | [['Blicher', 'Andreas', ''], ['Wodzinska', 'Katarzyna', ''], ['Fidorra', 'Matthias', ''], ['Winterhalter', 'Mathias', ''], ['Heimburg', 'Thomas', '']] |
0906.3683 | Matteo Cherchi | Matteo Cherchi, Alberto Taormina, Alessandro C. Busacca, Roberto L.
Oliveri, Saverio Bivona, Alfonso C. Cino, Salvatore Stivala, Stefano Riva
Sanseverino, and Claudio Leone | Exploiting the optical quadratic nonlinearity of zincblende
semiconductors for guided-wave terahertz generation: a material comparison | 8 pages in two columns format, 6 figures, 2 Tables | IEEE J. Quantum Electron. 46, 368-376 (2010) | 10.1109/JQE.2009.2033821 | null | physics.optics | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a detailed analysis and comparison of dielectric waveguides made
of CdTe, GaP, GaAs and InP for modal phase matched optical difference frequency
generation (DFG) in the terahertz domain. From the form of the DFG equations,
we derived the definition of a very general figure of merit (FOM). In turn,
this FOM enabled us to compare different configurations, by taking into account
linear and nonlinear susceptibility dispersion, terahertz absorption, and a
rigorous evaluation of the waveguide modes properties. The most efficient
waveguides found with this procedure are predicted to approach the quantum
efficiency limit with input optical power in the order of kWs.
| [{'version': 'v1', 'created': 'Fri, 19 Jun 2009 14:40:57 GMT'}] | 2010-03-26 | [['Cherchi', 'Matteo', ''], ['Taormina', 'Alberto', ''], ['Busacca', 'Alessandro C.', ''], ['Oliveri', 'Roberto L.', ''], ['Bivona', 'Saverio', ''], ['Cino', 'Alfonso C.', ''], ['Stivala', 'Salvatore', ''], ['Sanseverino', 'Stefano Riva', ''], ['Leone', 'Claudio', '']] |
1803.03797 | Pawan Kumar | Sahithi Rampalli, Natasha Sehgal, Ishita Bindlish, Tanya Tyagi, and
Pawan Kumar | Efficient FPGA Implementation of Conjugate Gradient Methods for
Laplacian System using HLS | 10 pages, 11 figures, 5 tables | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we study FPGA based pipelined and superscalar design of two
variants of conjugate gradient methods for solving Laplacian equation on a
discrete grid; the first version corresponds to the original conjugate gradient
algorithm, and the second version corresponds to a slightly modified version of
the same.
In conjugate gradient method to solve partial differential equations, matrix
vector operations are required in each iteration; these operations can be
implemented as 5 point stencil operations on the grid without explicitely
constructing the matrix. We show that a pipelined and superscalar design using
high level synthesis written in C language leads to a significant reduction in
latencies for both methods. When comparing these two, we show that the later
has roughly two times lower latency than the former given the same degree of
superscalarity. These reductions in latencies for the newer variant of CG is
due to parallel implementations of stencil operation on subdomains of the grid,
and dut to overlap of these stencil operations with dot product operations. In
a superscalar design, domain needs to be partitioned, and boundary data needs
to be copied, which requires padding. In 1D partition, the padding latency
increases as the number of partitions increase. For a streaming data flow
model, we propose a novel traversal of the grid for 2D domain decomposition
that leads to 2 times reduction in latency cost involved with padding compared
to 1D partitions. Our implementation is roughly 10 times faster than software
implementation for linear system of dimension $10000 \times 10000.$
| [{'version': 'v1', 'created': 'Sat, 10 Mar 2018 12:05:35 GMT'}] | 2018-03-13 | [['Rampalli', 'Sahithi', ''], ['Sehgal', 'Natasha', ''], ['Bindlish', 'Ishita', ''], ['Tyagi', 'Tanya', ''], ['Kumar', 'Pawan', '']] |
2303.05946 | Kyle Hart | Kyle M. Hart (1 and 2), Brendan Englot (2), Ryan P. O'Shea (1), John
D. Kelly (1), David Martinez (1) ((1) Naval Air Warfare Center Aircraft
Division Lakehurst, (2) Stevens Institute of Technology) | Monocular Simultaneous Localization and Mapping using Ground Textures | 7 pages, 9 figures. To appear at ICRA 2023, London, UK. Distribution
Statement A: Approved for public release; distribution is unlimited, as
submitted under NAVAIR Public Release Authorization 2022-0586. The views
expressed here are those of the authors and do not reflect the official
policy or position of the U.S. Navy, Department of Defense, or U.S.
Government | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent work has shown impressive localization performance using only images
of ground textures taken with a downward facing monocular camera. This provides
a reliable navigation method that is robust to feature sparse environments and
challenging lighting conditions. However, these localization methods require an
existing map for comparison. Our work aims to relax the need for a map by
introducing a full simultaneous localization and mapping (SLAM) system. By not
requiring an existing map, setup times are minimized and the system is more
robust to changing environments. This SLAM system uses a combination of several
techniques to accomplish this. Image keypoints are identified and projected
into the ground plane. These keypoints, visual bags of words, and several
threshold parameters are then used to identify overlapping images and revisited
areas. The system then uses robust M-estimators to estimate the transform
between robot poses with overlapping images and revisited areas. These
optimized estimates make up the map used for navigation. We show, through
experimental data, that this system performs reliably on many ground textures,
but not all.
| [{'version': 'v1', 'created': 'Fri, 10 Mar 2023 14:27:31 GMT'}] | 2023-03-13 | [['Hart', 'Kyle M.', '', '1 and 2'], ['Englot', 'Brendan', ''], ["O'Shea", 'Ryan P.', ''], ['Kelly', 'John D.', ''], ['Martinez', 'David', '']] |
2101.07517 | Inga Abel | Inga Abel, Helmut Graeb | FUBOCO: Structure Synthesis of Basic Op-Amps by FUnctional BlOck
COmposition | This work has been submitted to ACM for possible publication.
Copyright may be transferred without notice, after which this version may no
longer be accessible | null | null | null | eess.SY cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a method to automatically synthesize the structure of an
operational amplifier. It is positioned between approaches with fixed design
plans and a small search space of structures and approaches with generic
structural production rules and a large search space with technically
impractical structures. The presented approach develops a hierarchical
composition graph based on functional blocks that spans a search space of
thousands of technically meaningful structure variants for single-output,
fully-differential and complementary operational amplifiers. The search
algorithm is a combined heuristic and enumerative process. The evaluation is
based on circuit sizing with a library of behavioral equations of functional
blocks. Formalizing the knowledge of functional blocks in op-amps for
structural synthesis and sizing inherently reduces the search space and lessens
the number of created topologies not fulfilling the specifications.
Experimental results for the three op-amp classes are presented. An outlook how
this method can be extended to multi-stage op-amps is given.
| [{'version': 'v1', 'created': 'Tue, 19 Jan 2021 09:01:12 GMT'}, {'version': 'v2', 'created': 'Fri, 24 Sep 2021 11:15:22 GMT'}] | 2021-09-27 | [['Abel', 'Inga', ''], ['Graeb', 'Helmut', '']] |
1406.3700 | Bingkai Lin | Bingkai Lin | The Parameterized Complexity of k-Biclique | null | null | null | null | cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Given a graph $G$ and a parameter $k$, the $k$-biclique problem asks whether
$G$ contains a complete bipartite subgraph $K_{k,k}$. This is the most easily
stated problem on graphs whose parameterized complexity is still unknown. We
provide an fpt-reduction from $k$-clique to $k$-biclique, thus solving this
longstanding open problem.
Our reduction use a class of bipartite graphs with a threshold property of
independent interest. More specifically, for positive integers $n$, $s$ and
$t$, we consider a bipartite graph $G=(A\;\dot\cup\;B, E)$ such that $A$ can be
partitioned into $A=V_1\;\dot\cup \;V_2\;\dot\cup\cdots\dot\cup\; V_n$ and for
every $s$ distinct indices $i_1\cdots i_s$, there exist $v_{i_1}\in
V_{i_1}\cdots v_{i_s}\in V_{i_s}$ such that $v_{i_1}\cdots v_{i_s}$ have at
least $t+1$ common neighbors in $B$; on the other hand, every $s+1$ distinct
vertices in $A$ have at most $t$ common neighbors in $B$.
Using the Paley-type graphs and Weil's character sum theorem, we show that
for $t=(s+1)!$ and $n$ large enough, such threshold bipartite graphs can be
computed in $n^{O(1)}$. One corollary of our reduction is that there is no
$f(k)\cdot n^{o(k)}$ time algorithm to decide whether a graph contains a
subgraph isomorphic to $K_{k!,k!}$ unless the ETH(Exponential Time Hypothesis)
fails. We also provide a probabilistic construction with better parameters
$t=\Theta(s^2)$, which indicates that $k$-biclique has no $f(k)\cdot
n^{o(\sqrt{k})}$-time algorithm unless 3-SAT with $m$ clauses can be solved in
$2^{o(m)}$-time with high probability. Our result also implies the dichotomy
classification of the parameterized complexity of cardinality constrain
satisfaction problem and the inapproximability of maximum $k$-intersection
problem.
| [{'version': 'v1', 'created': 'Sat, 14 Jun 2014 08:20:39 GMT'}, {'version': 'v2', 'created': 'Sat, 1 Nov 2014 05:46:37 GMT'}, {'version': 'v3', 'created': 'Sat, 8 Jun 2019 02:09:26 GMT'}] | 2019-06-11 | [['Lin', 'Bingkai', '']] |
1207.1427 | Segev Wasserkrug | Segev Wasserkrug, Avigdor Gal, Opher Etzion | A Model for Reasoning with Uncertain Rules in Event Composition Systems | Appears in Proceedings of the Twenty-First Conference on Uncertainty
in Artificial Intelligence (UAI2005) | null | null | UAI-P-2005-PG-599-608 | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In recent years, there has been an increased need for the use of active
systems - systems required to act automatically based on events, or changes in
the environment. Such systems span many areas, from active databases to
applications that drive the core business processes of today's enterprises.
However, in many cases, the events to which the system must respond are not
generated by monitoring tools, but must be inferred from other events based on
complex temporal predicates. In addition, in many applications, such inference
is inherently uncertain. In this paper, we introduce a formal framework for
knowledge representation and reasoning enabling such event inference. Based on
probability theory, we define the representation of the associated uncertainty.
In addition, we formally define the probability space, and show how the
relevant probabilities can be calculated by dynamically constructing a Bayesian
network. To the best of our knowledge, this is the first work that enables
taking such uncertainty into account in the context of active systems.
herefore, our contribution is twofold: We formally define the representation
and semantics of event composition for probabilistic settings, and show how to
apply these extensions to the quantification of the occurrence probability of
events. These results enable any active system to handle such uncertainty.
| [{'version': 'v1', 'created': 'Wed, 4 Jul 2012 16:29:47 GMT'}] | 2012-07-09 | [['Wasserkrug', 'Segev', ''], ['Gal', 'Avigdor', ''], ['Etzion', 'Opher', '']] |
2110.07391 | Zongzheng Zhao | Zongzheng Zhao, Yixin Liu, Li Guo, Linquan Bai, and Chengshan Wang | Distribution Locational Marginal Pricing Under Uncertainty Considering
Coordination of Distribution and Wholesale Markets | null | null | null | null | eess.SY cs.SY | http://creativecommons.org/licenses/by-nc-nd/4.0/ | An effective distribution electricity market (DEM) is required to manage the
rapidly growing small-scale distributed energy resources (DERs) in distribution
systems (DSs). This paper proposes a day-ahead DEM clearing and pricing
mechanism to account for the uncertainty of DERs and the coordination with the
wholesale electricity market (WEM) through a bi-level model. The upper-level
model clears the WEM in the transmission system (TS) and forms the locational
marginal price (LMP) and uncertainty LMP (ULMP) for energy and
uncertainty/reserve, respectively. In the lower level, a robust scheduling
model considering WEM-DEM coordination and uncertainties is proposed to clear
the DEM. Accordingly, the distribution LMPs (DLMPs) for active power, reactive
power and uncertainty/reserve are derived to reward the energy/reserve
provision and charge uncertain resources in the DEM, which provide effective
price signals for managing not only the voltage and congestion, but also the
uncertainty in DSs. A heterogeneous decomposition (HGD) algorithm is utilized
to solve the bi-level model in a decentralized manner with limited information
interaction between TS and DSs, which guarantees the solution efficiency and
information privacy. The effectiveness of the proposed method is verified via
numerous case studies.
| [{'version': 'v1', 'created': 'Thu, 14 Oct 2021 14:27:23 GMT'}] | 2021-10-15 | [['Zhao', 'Zongzheng', ''], ['Liu', 'Yixin', ''], ['Guo', 'Li', ''], ['Bai', 'Linquan', ''], ['Wang', 'Chengshan', '']] |
1906.02944 | Han-Jia Ye | Han-Jia Ye, Hexiang Hu, De-Chuan Zhan | Learning Adaptive Classifiers Synthesis for Generalized Few-Shot
Learning | Accepted by IJCV; The code is available at
https://github.com/Sha-Lab/aCASTLE | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Object recognition in the real-world requires handling long-tailed or even
open-ended data. An ideal visual system needs to recognize the populated head
visual concepts reliably and meanwhile efficiently learn about emerging new
tail categories with a few training instances. Class-balanced many-shot
learning and few-shot learning tackle one side of this problem, by either
learning strong classifiers for head or learning to learn few-shot classifiers
for the tail. In this paper, we investigate the problem of generalized few-shot
learning (GFSL) -- a model during the deployment is required to learn about
tail categories with few shots and simultaneously classify the head classes. We
propose the ClAssifier SynThesis LEarning (CASTLE), a learning framework that
learns how to synthesize calibrated few-shot classifiers in addition to the
multi-class classifiers of head classes with a shared neural dictionary,
shedding light upon the inductive GFSL. Furthermore, we propose an adaptive
version of CASTLE (ACASTLE) that adapts the head classifiers conditioned on the
incoming tail training examples, yielding a framework that allows effective
backward knowledge transfer. As a consequence, ACASTLE can handle GFSL with
classes from heterogeneous domains effectively. CASTLE and ACASTLE demonstrate
superior performances than existing GFSL algorithms and strong baselines on
MiniImageNet as well as TieredImageNet datasets. More interestingly, they
outperform previous state-of-the-art methods when evaluated with standard
few-shot learning criteria.
| [{'version': 'v1', 'created': 'Fri, 7 Jun 2019 08:07:05 GMT'}, {'version': 'v2', 'created': 'Sat, 28 Sep 2019 06:27:48 GMT'}, {'version': 'v3', 'created': 'Sun, 29 Dec 2019 02:39:02 GMT'}, {'version': 'v4', 'created': 'Wed, 28 Oct 2020 04:34:30 GMT'}, {'version': 'v5', 'created': 'Sun, 27 Jun 2021 02:17:15 GMT'}] | 2021-06-29 | [['Ye', 'Han-Jia', ''], ['Hu', 'Hexiang', ''], ['Zhan', 'De-Chuan', '']] |
1812.01801 | Ryota Yamanaka | Shota Matsumoto, Ryota Yamanaka, Hirokazu Chiba | Mapping RDF Graphs to Property Graphs | 4 pages, 4 figures | null | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Increasing amounts of scientific and social data are published in the
Resource Description Framework (RDF). Although the RDF data can be queried
using the SPARQL language, even the SPARQL-based operation has a limitation in
implementing traversal or analytical algorithms. Recently, a variety of graph
database implementations dedicated to analyses on the property graph model have
emerged. However, the RDF model and the property graph model are not
interoperable. Here, we developed a framework based on the Graph to Graph
Mapping Language (G2GML) for mapping RDF graphs to property graphs to make the
most of accumulated RDF data. Using this framework, graph data described in the
RDF model can be converted to the property graph model and can be loaded to
several graph database engines for further analysis. Future works include
implementing and utilizing graph algorithms to make the most of the accumulated
data in various analytical engines.
| [{'version': 'v1', 'created': 'Wed, 5 Dec 2018 03:22:37 GMT'}] | 2018-12-06 | [['Matsumoto', 'Shota', ''], ['Yamanaka', 'Ryota', ''], ['Chiba', 'Hirokazu', '']] |
1312.1993 | Marcell Stippinger | Marcell Stippinger and J\'anos Kert\'esz | Enhancing resilience of interdependent networks by healing | 6 pages, 6 figures. Acknowledgements: This work was partially
supported by the European Union and the European Social Fund through project
FuturICT.hu (Grant No.: TAMOP-4.2.2.C-11/1/KONV-2012-0013). JK thanks
MULTIPLEX, Grant No. 317532. Thanks are due to \'Eva R\'acz for her help at
the early stage of this work and to Michael Danziger for a critical reading
of the manuscript | null | 10.1016/j.physa.2014.08.069 | null | physics.soc-ph cond-mat.stat-mech cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Interdependent networks are characterized by two kinds of interactions: The
usual connectivity links within each network and the dependency links coupling
nodes of different networks. Due to the latter links such networks are known to
suffer from cascading failures and catastrophic breakdowns. When modeling these
phenomena, usually one assumes that a fraction of nodes gets damaged in one of
the networks, which is followed possibly by a cascade of failures. In real life
the initiating failures do not occur at once and effort is made replace the
ties eliminated due to the failing nodes. Here we study a dynamic extension of
the model of interdependent networks and introduce the possibility of link
formation with a probability w, called healing, to bridge non-functioning nodes
and enhance network resilience. A single random node is removed, which may
initiate an avalanche. After each removal step healing sets in resulting in a
new topology. Then a new node fails and the process continues until the giant
component disappears either in a catastrophic breakdown or in a smooth
transition. Simulation results are presented for square lattices as starting
networks under random attacks of constant intensity. We find that the shift in
the position of the breakdown has a power-law scaling as a function of the
healing probability with an exponent close to 1. Below a critical healing
probability, catastrophic cascades form and the average degree of surviving
nodes decreases monotonically, while above this value there are no macroscopic
cascades and the average degree has first an increasing character and decreases
only at the very late stage of the process. These findings facilitate to plan
intervention in case of crisis situation by describing the efficiency of
healing efforts needed to suppress cascading failures.
| [{'version': 'v1', 'created': 'Fri, 6 Dec 2013 20:37:41 GMT'}, {'version': 'v2', 'created': 'Tue, 4 Mar 2014 21:19:47 GMT'}, {'version': 'v3', 'created': 'Fri, 6 Jun 2014 10:09:02 GMT'}, {'version': 'v4', 'created': 'Thu, 4 Sep 2014 21:13:51 GMT'}] | 2015-06-18 | [['Stippinger', 'Marcell', ''], ['Kertész', 'János', '']] |
1512.05867 | Shuai Dong | Shuang Zhou, Yakui Weng, Zhangting Wu, Jinlong Wang, Lingzhi Wu,
Zhenhua Ni, Qingyu Xu, Shuai Dong | Strong room-temperature blue-violet photoluminescence of multiferroic
BaMnF$_4$ | 13 pages, 4 figures, 1 table | Physical Chemistry Chemical Physics 18, 2054-2058 (2016) | 10.1039/C5CP05864C | null | cond-mat.mtrl-sci cond-mat.str-el physics.chem-ph physics.optics | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | BaMnF$_4$ microsheets have been prepared by hydrothermal method. Strong
room-temperature blue-violet photoluminescence has been observed (absolute
luminescence quantum yield 67%), with two peaks located at 385 nm and 410 nm,
respectively. More interestingly, photon self-absorption phenomenon has been
observed, leading to unusual abrupt drop of luminescence intensity at
wavelength of 400 nm. To understand the underlying mechanism of such emitting,
the electronic structure of BaMnF$_4$ has been studied by first principles
calculations. The observed two peaks are attributed to electrons' transitions
between the upper-Hubbard bands of Mn's $t_{2g}$ orbitals and the lower-Hubbard
bands of Mn's $e_g$ orbitals. Those Mott gap mediated d-d orbital transitions
may provide additional degrees of freedom to tune the photon generation and
absorption in ferroelectrics.
| [{'version': 'v1', 'created': 'Fri, 18 Dec 2015 07:47:37 GMT'}] | 2016-01-20 | [['Zhou', 'Shuang', ''], ['Weng', 'Yakui', ''], ['Wu', 'Zhangting', ''], ['Wang', 'Jinlong', ''], ['Wu', 'Lingzhi', ''], ['Ni', 'Zhenhua', ''], ['Xu', 'Qingyu', ''], ['Dong', 'Shuai', '']] |
1710.02468 | Micha{\l} Lesiuk | Justyna G. Balcerzak, Micha{\l} Lesiuk, Robert Moszynski | Calculation of Araki-Sucher correction for many-electron systems | submitted to Phys. Rev. A | Phys. Rev. A 96, 052510 (2017) | 10.1103/PhysRevA.96.052510 | null | physics.chem-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we consider the evaluation of the Araki-Sucher correction for
arbitrary many-electron atomic and molecular systems. This contribution appears
in the leading order quantum electrodynamics corrections to the energy of a
bound state. The conventional one-electron basis set of Gaussian-type orbitals
(GTOs) is adopted; this leads to two-electron matrix elements which are
evaluated with help of generalised the McMurchie-Davidson scheme. We also
consider the convergence of the results towards the complete basis set. A
rigorous analytic result for the convergence rate is obtained and verified by
comparing with independent numerical values for the helium atom. Finally, we
present a selection of numerical examples and compare our results with the
available reference data for small systems. In contrast with other methods used
for the evaluation of the Araki-Sucher correction, our method is not restricted
to few-electron atoms or molecules. This is illustrated by calculations for
several many-electron atoms and molecules.
| [{'version': 'v1', 'created': 'Fri, 6 Oct 2017 15:59:57 GMT'}, {'version': 'v2', 'created': 'Fri, 10 Nov 2017 16:36:38 GMT'}] | 2017-12-06 | [['Balcerzak', 'Justyna G.', ''], ['Lesiuk', 'Michał', ''], ['Moszynski', 'Robert', '']] |
1410.5642 | Hartmut Grote | Hartmut Grote | On the possibility of Vacuum-QED measurements with gravitational wave
detectors | 11 pages, 10 figures | Phys. Rev. D 91, 022002 (2015) | 10.1103/PhysRevD.91.022002 | null | physics.ins-det quant-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Quantum electro dynamics (QED) comprises virtual particle production and thus
gives rise to a refractive index of the vacuum larger than unity in the
presence of a magnetic field. This predicted effect has not been measured to
date, even after considerable effort of a number of experiments. It has been
proposed by other authors to possibly use gravitational wave detectors for such
vacuum QED measurements, and we give this proposal some new consideration in
this paper. In particular we look at possible source field magnet designs and
further constraints on the implementation at a gravitational wave detector. We
conclude that such an experiment seems to be feasible with permanent magnets,
yet still challenging in its implementation.
| [{'version': 'v1', 'created': 'Tue, 21 Oct 2014 12:54:44 GMT'}, {'version': 'v2', 'created': 'Wed, 29 Oct 2014 15:31:40 GMT'}, {'version': 'v3', 'created': 'Fri, 31 Oct 2014 11:55:57 GMT'}, {'version': 'v4', 'created': 'Thu, 27 Nov 2014 11:38:53 GMT'}, {'version': 'v5', 'created': 'Mon, 15 Dec 2014 13:33:57 GMT'}] | 2015-01-14 | [['Grote', 'Hartmut', '']] |
1302.4384 | Jean-Philippe Cointet | Michel Zitt and Jean-Philippe Cointet | Citation impacts revisited: how novel impact measures reflect
interdisciplinarity and structural change at the local and global level | submitted to ISSI 2013, Vienna | null | null | null | cs.DL physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Citation networks have fed numerous works in scientific evaluation, science
mapping (and more recently large-scale network studies) for decades. The
variety of citation behavior across scientific fields is both a research topic
in sociology of science, and a problem in scientific evaluation. Normalization,
tantamount to a particular weighting of links in the citation network, is
necessary for allowing across-field comparisons of citation scores and
interdisciplinary studies. In addition to classical normalization which
drastically reduces all variability factors altogether, two tracks of research
have emerged in the recent years. One is the revival of iterative "influence
measures". The second is the "citing-side" normalization, whose only purpose is
to control for the main factor of variability, the inequality in citing
propensity, letting other aspects play: knowledge export/imports and growth.
When all variables are defined at the same field-level, two propositions are
established: (a) the gross impact measure identifies with the product of
relative growth rate, gross balance of citation exchanges, and relative number
of references (b) the normalized impact identifies with the product of relative
growth rate and normalized balance. At the science level, the variance of
growth rate over domains is a proxy for change in the system, and the variance
of balance a measure of inter-disciplinary dependences. This opens a new
perspective, where the resulting variance of normalized impact, and a related
measure, the sum of these variances proposed as a Change-Exchange Indicator,
summarize important aspects of science structure and dynamism. Results based on
a decade's data are discussed. The behavior of normalized impact according to
scale changes is also briefly discussed.
| [{'version': 'v1', 'created': 'Mon, 18 Feb 2013 18:40:03 GMT'}, {'version': 'v2', 'created': 'Tue, 19 Feb 2013 09:26:42 GMT'}] | 2013-02-20 | [['Zitt', 'Michel', ''], ['Cointet', 'Jean-Philippe', '']] |
2010.14484 | Saurabh Kumar | Saurabh Kumar, Aviral Kumar, Sergey Levine, Chelsea Finn | One Solution is Not All You Need: Few-Shot Extrapolation via Structured
MaxEnt RL | Accepted at NeurIPS 2020 | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While reinforcement learning algorithms can learn effective policies for
complex tasks, these policies are often brittle to even minor task variations,
especially when variations are not explicitly provided during training. One
natural approach to this problem is to train agents with manually specified
variation in the training task or environment. However, this may be infeasible
in practical situations, either because making perturbations is not possible,
or because it is unclear how to choose suitable perturbation strategies without
sacrificing performance. The key insight of this work is that learning diverse
behaviors for accomplishing a task can directly lead to behavior that
generalizes to varying environments, without needing to perform explicit
perturbations during training. By identifying multiple solutions for the task
in a single environment during training, our approach can generalize to new
situations by abandoning solutions that are no longer effective and adopting
those that are. We theoretically characterize a robustness set of environments
that arises from our algorithm and empirically find that our diversity-driven
approach can extrapolate to various changes in the environment and task.
| [{'version': 'v1', 'created': 'Tue, 27 Oct 2020 17:41:57 GMT'}, {'version': 'v2', 'created': 'Mon, 7 Dec 2020 22:33:16 GMT'}] | 2020-12-09 | [['Kumar', 'Saurabh', ''], ['Kumar', 'Aviral', ''], ['Levine', 'Sergey', ''], ['Finn', 'Chelsea', '']] |
1409.1726 | Monika Cerin\v{s}ek | Monika Cerin\v{s}ek and Vladimir Batagelj | Network analysis of Zentralblatt MATH data | 25 pages, 10 figures, 13 tables | Scientometrics Volume: 102 Issue: 1 Pages: 977-1001 (2015) | null | null | cs.SI cs.DL physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We analyze the data about works (papers, books) from the time period
1990-2010 that are collected in Zentralblatt MATH database. The data were
converted into four 2-mode networks (works $\times$ authors, works $\times$
journals, works $\times$ keywords and works $\times$ MSCs) and into a partition
of works by publication year. The networks were analyzed using Pajek -- a
program for analysis and visualization of large networks. We explore the
distributions of some properties of works and the collaborations among
mathematicians. We also take a closer look at the characteristics of the field
of graph theory as were realized with the publications.
| [{'version': 'v1', 'created': 'Fri, 5 Sep 2014 10:19:51 GMT'}] | 2016-03-30 | [['Cerinšek', 'Monika', ''], ['Batagelj', 'Vladimir', '']] |
0810.0623 | Bo Yan | Bo Yan, Yisheng Ma, Yuzhu Wang | Atomic Frequency standards Based on Pulsed Coherent Light Storage | 6 pages, 5 figures | null | 10.1103/PhysRevA.79.063820 | null | physics.atom-ph physics.optics | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a new scheme of microwave frequency standards based on pulsed
coherent optical information storage. Unlike the usual frequency reference
where the Ramsey fringe is printed on the population of a certain state, we
print the Ramsey fringe on the coherence. Then the coherence is detected in the
form of a retrieval light. The central line of the Ramsey fringe can be used as
a frequency reference in an absorption-cell-based atomic frequency standard.
This scheme is free of light shifts as the interrogating process is separated
from the optical pumping processes, and the cavity pulling effect is negligible
due to the low Q requirement. Encoding the Ramsey interference into the
retrieval light pulse has the merit of high signal to noise ratio and the
estimated frequency stability of shot noise limit is about $2\times10^{-14}$ in
1 second, this scheme is promising for building small, compact and stable
atomic frequency standards.
| [{'version': 'v1', 'created': 'Fri, 3 Oct 2008 12:10:11 GMT'}] | 2013-10-28 | [['Yan', 'Bo', ''], ['Ma', 'Yisheng', ''], ['Wang', 'Yuzhu', '']] |
1904.13205 | Zhujun Zhang | Zhujun Zhang | A Note on Computational Complexity of Dou Shou Qi | 11 pages, 11 figures. arXiv admin note: text overlap with
arXiv:1904.00200 | null | null | null | cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Dou Shou Qi is a Chinese strategy board game for two players. We use a
EXPTIME-hardness framework to analyse computational complexity of the game. We
construct all gadgets of the hardness framework. In conclusion, we prove that
Dou Shou Qi is EXPTIME-complete.
| [{'version': 'v1', 'created': 'Sat, 27 Apr 2019 07:25:14 GMT'}] | 2019-05-01 | [['Zhang', 'Zhujun', '']] |
2211.07708 | Meziane Privat | Meziane Privat (CPHT) | Infinite horizon for symetric strategy population game | null | null | null | null | cs.GT math.PR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | To predict the behavior of a population game when time becomes very long, the
process that characterizes the evolution of our game dynamics must be
reversible. Known games satisfying this are 2 strategy games as well as
potential games with an exponential protocol. We will try to extend the study
of infinite horizons for what are called symetric strategy games.
| [{'version': 'v1', 'created': 'Mon, 14 Nov 2022 19:38:34 GMT'}, {'version': 'v2', 'created': 'Fri, 6 Jan 2023 14:03:18 GMT'}] | 2023-01-09 | [['Privat', 'Meziane', '', 'CPHT']] |
2106.06536 | Firas Jarboui | Firas Jarboui, Vianney Perchet | Unsupervised Neural Hidden Markov Models with a Continuous latent state
space | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce a new procedure to neuralize unsupervised Hidden Markov Models
in the continuous case. This provides higher flexibility to solve problems with
underlying latent variables. This approach is evaluated on both synthetic and
real data. On top of generating likely model parameters with comparable
performances to off-the-shelf neural architecture (LSTMs, GRUs,..), the
obtained results are easily interpretable.
| [{'version': 'v1', 'created': 'Thu, 10 Jun 2021 11:53:38 GMT'}] | 2021-06-14 | [['Jarboui', 'Firas', ''], ['Perchet', 'Vianney', '']] |
1711.03880 | Sebastian Eckart | S. Eckart, M. Kunitski, I. Ivanov, M. Richter, K. Fehre, A. Hartung,
J. Rist, K. Henrichs, D. Trabert, N. Schlott, L. Ph. H. Schmidt, T. Jahnke,
M. S. Sch\"offler, A. Kheifets, R. D\"orner | Sub-Cycle Interference upon Tunnel-Ionization by Counterrotating
Two-Color Fields | 5 pages, 4 figures, PRA Rapid Communications accepted | Phys. Rev. A 97, 041402 (2018) | 10.1103/PhysRevA.97.041402 | null | physics.atom-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We report on three-dimensional (3D) electron momentum distributions from
single ionization of helium by a laser pulse consisting of two counterrotating
circularly polarized fields (390 nm and 780 nm). A pronounced 3D low energy
structure and sub-cycle interferences are observed experimentally and
reproduced numerically using a trajectory based semi-classical simulation. The
orientation of the low energy structure in the polarization plane is verified
by numerical simulations solving the time dependent Schr\"odinger equation.
| [{'version': 'v1', 'created': 'Fri, 10 Nov 2017 15:33:55 GMT'}, {'version': 'v2', 'created': 'Fri, 23 Mar 2018 17:07:34 GMT'}] | 2018-04-18 | [['Eckart', 'S.', ''], ['Kunitski', 'M.', ''], ['Ivanov', 'I.', ''], ['Richter', 'M.', ''], ['Fehre', 'K.', ''], ['Hartung', 'A.', ''], ['Rist', 'J.', ''], ['Henrichs', 'K.', ''], ['Trabert', 'D.', ''], ['Schlott', 'N.', ''], ['Schmidt', 'L. Ph. H.', ''], ['Jahnke', 'T.', ''], ['Schöffler', 'M. S.', ''], ['Kheifets', 'A.', ''], ['Dörner', 'R.', '']] |
physics/0002020 | Tomomi Ohgaki | T.Ohgaki | Simulation of Laser-Compton Cooling of Electron Beams | 11 pages, 12 figures, Given at 3nd International Workshop on
Electron-Electron Interactions at TeV Energies, Dec 10-12, Santa Cruz,
California, 1999 | Int.J.Mod.Phys.A15:2587-2598,2000 | 10.1142/S0217751X00002664 | LBNL-44993 | physics.acc-ph | null | We study a method of laser-Compton cooling of electron beams. Using a Monte
Carlo code, we evaluate the effects of the laser-electron interaction for
transverse cooling. The optics with and without chromatic correction for the
cooling are examined. The laser-Compton cooling for JLC/NLC at E_0=2 GeV is
considered.
| [{'version': 'v1', 'created': 'Wed, 9 Feb 2000 23:59:58 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Feb 2000 05:01:18 GMT'}] | 2015-06-26 | [['Ohgaki', 'T.', '']] |
2009.09677 | Jesus L. Lobo | Jesus L. Lobo, Javier Del Ser, Eneko Osaba, Albert Bifet, Francisco
Herrera | CURIE: A Cellular Automaton for Concept Drift Detection | null | null | null | null | cs.LG stat.ML | http://creativecommons.org/licenses/by-sa/4.0/ | Data stream mining extracts information from large quantities of data flowing
fast and continuously (data streams). They are usually affected by changes in
the data distribution, giving rise to a phenomenon referred to as concept
drift. Thus, learning models must detect and adapt to such changes, so as to
exhibit a good predictive performance after a drift has occurred. In this
regard, the development of effective drift detection algorithms becomes a key
factor in data stream mining. In this work we propose CU RIE, a drift detector
relying on cellular automata. Specifically, in CU RIE the distribution of the
data stream is represented in the grid of a cellular automata, whose
neighborhood rule can then be utilized to detect possible distribution changes
over the stream. Computer simulations are presented and discussed to show that
CU RIE, when hybridized with other base learners, renders a competitive
behavior in terms of detection metrics and classification accuracy. CU RIE is
compared with well-established drift detectors over synthetic datasets with
varying drift characteristics.
| [{'version': 'v1', 'created': 'Mon, 21 Sep 2020 08:28:21 GMT'}] | 2020-09-22 | [['Lobo', 'Jesus L.', ''], ['Del Ser', 'Javier', ''], ['Osaba', 'Eneko', ''], ['Bifet', 'Albert', ''], ['Herrera', 'Francisco', '']] |
2206.13929 | David Messerschmitt | David Messerschmitt, Philip Lubin, Ian Morrison | Optimal mass and speed for interstellar flyby with directed-energy
propulsion | null | null | null | null | astro-ph.IM physics.space-ph | http://creativecommons.org/licenses/by-nc-nd/4.0/ | The design of mission scenarios for the flyby investigation of nearby star
systems by probes launched using directed energy is addressed. Multiple probes
are launched with a fixed launch infrastructure, and download of scientific
data occurs following target encounter and data collection. Assuming the
primary goal is to reliably recover a larger volume of collected scientific
data with a smaller data latency (elapsed time from launch to complete recovery
of the data), it is shown that there is an efficient frontier where volume
cannot be increased for a given latency and latency cannot be reduced for a
given volume. For each probe launch, increasing the volume along this frontier
is achieved by increasing the probe mass, which results in a reduced probe
speed. Thus choosing the highest feasible probe speed generally does not
achieve an efficient tradeoff of volume and latency. Along this frontier the
total distance traveled to the completion of data download does not vary
significantly, implying that the download time duration is approximately a
fixed fraction of the launch-to-target transit time. Due to longer propulsion
duration when probe mass is increased, increasing data volume incurs a cost in
the total launch energy expended, but with favorable economies of scale. An
important characteristic of any probe technology is the scaling law that
relates probe mass to transmit data rate, as this affects details of the
efficient frontier.
| [{'version': 'v1', 'created': 'Mon, 27 Jun 2022 17:55:17 GMT'}] | 2022-06-29 | [['Messerschmitt', 'David', ''], ['Lubin', 'Philip', ''], ['Morrison', 'Ian', '']] |
2111.03120 | Peru Bhardwaj | Peru Bhardwaj, John Kelleher, Luca Costabello and Declan O'Sullivan | Adversarial Attacks on Knowledge Graph Embeddings via Instance
Attribution Methods | 2021 Conference on Empirical Methods in Natural Language Processing
(EMNLP 2021) | null | null | null | cs.LG cs.AI cs.CL cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Despite the widespread use of Knowledge Graph Embeddings (KGE), little is
known about the security vulnerabilities that might disrupt their intended
behaviour. We study data poisoning attacks against KGE models for link
prediction. These attacks craft adversarial additions or deletions at training
time to cause model failure at test time. To select adversarial deletions, we
propose to use the model-agnostic instance attribution methods from
Interpretable Machine Learning, which identify the training instances that are
most influential to a neural model's predictions on test instances. We use
these influential triples as adversarial deletions. We further propose a
heuristic method to replace one of the two entities in each influential triple
to generate adversarial additions. Our experiments show that the proposed
strategies outperform the state-of-art data poisoning attacks on KGE models and
improve the MRR degradation due to the attacks by up to 62% over the baselines.
| [{'version': 'v1', 'created': 'Thu, 4 Nov 2021 19:38:48 GMT'}] | 2021-11-08 | [['Bhardwaj', 'Peru', ''], ['Kelleher', 'John', ''], ['Costabello', 'Luca', ''], ["O'Sullivan", 'Declan', '']] |
1312.4076 | Rodrigo Lopez-Pablos | Rodrigo Lopez-Pablos (Universidad Nacional de La Matanza y Universidad
Tecnol\'ogica Nacional) | Elementos de ingenier\'ia de explotaci\'on de la informaci\'on:
r\'eplica y algunos trazos sobre teor\'ia inform\'atica | 4 pages, 1 figure, written in castilian, Anales de la AAEP, ISSN
1852-0022 | Asoc.Arg.Econ.Polit. XLVIII RA (2013): 1-4 | null | null | cs.IT math.IT | http://creativecommons.org/licenses/by-nc-sa/3.0/ | A reply to the commentaries of Yana (2013), and some jots on information
theory.
| [{'version': 'v1', 'created': 'Sat, 14 Dec 2013 18:18:20 GMT'}] | 2013-12-17 | [['Lopez-Pablos', 'Rodrigo', '', 'Universidad Nacional de La Matanza y Universidad\n Tecnológica Nacional']] |
2010.13607 | Fabian Hofmann | Fabian Hofmann | Tracing prices: A flow-based cost allocation for optimized power systems | 12 pages (+8 pages appendix), 18 figures | null | null | null | physics.soc-ph | http://creativecommons.org/licenses/by/4.0/ | Power system models are a valuable and widely used tool to determine
cost-minimal future operation and investment under political or ecological
boundary conditions. Yet they are silent about the allocation of costs of
single assets, as generators or transmission lines, to consumers in the
network. Existing cost-allocation methods hardly suit large networks and do not
take all relevant costs into account. This paper bridges this gap. Based on
flow tracing, it introduces a peer-to-peer or more precisely an
asset-to-consumer allocation of all costs in an optimized power system. The
resulting cost allocation is both locally constrained and aligned with
locational marginal prices in the optimum. The approach is applied and
discussed using a future German scenario.
| [{'version': 'v1', 'created': 'Mon, 26 Oct 2020 14:25:20 GMT'}] | 2020-10-27 | [['Hofmann', 'Fabian', '']] |
1909.01837 | Siddhartha Datta | Siddhartha Datta | DeepObfusCode: Source Code Obfuscation Through Sequence-to-Sequence
Networks | Accepted in Advances in Intelligent Systems and Computing 2021 &
Computing Conference 2021 | null | null | null | cs.CR cs.LG cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The paper explores a novel methodology in source code obfuscation through the
application of text-based recurrent neural network (RNN) encoder-decoder models
in ciphertext generation and key generation. Sequence-to-sequence models are
incorporated into the model architecture to generate obfuscated code, generate
the deobfuscation key, and live execution. Quantitative benchmark comparison to
existing obfuscation methods indicate significant improvement in stealth and
execution cost for the proposed solution, and experiments regarding the model's
properties yield positive results regarding its character variation,
dissimilarity to the original codebase, and consistent length of obfuscated
code.
| [{'version': 'v1', 'created': 'Tue, 3 Sep 2019 17:22:39 GMT'}, {'version': 'v2', 'created': 'Wed, 29 Jan 2020 18:01:16 GMT'}, {'version': 'v3', 'created': 'Thu, 25 Feb 2021 11:30:06 GMT'}] | 2021-02-26 | [['Datta', 'Siddhartha', '']] |
2007.00857 | Meilin Gao | Meilin Gao, Bo Ai, Yong Niu, Wen Wu, Peng Yang, Feng Lyu, Xuemin
(Sherman) Shen | Efficient Hybrid Beamforming with Anti-Blockage Design for High-Speed
Railway Communications | 11 Pages, 9 Figures | IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2020 | 10.1109/TVT.2020.3000757 | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Future railway is expected to accommodate both train operation services and
passenger broadband services. The millimeter wave (mmWave) communication is a
promising technology in providing multi-gigabit data rates to onboard users.
However, mmWave communications suffer from severe propagation attenuation and
vulnerability to blockage, which can be very challenging in high-speed railway
(HSR) scenarios. In this paper, we investigate efficient hybrid beamforming
(HBF) design for train-to-ground communications. First, we develop a two-stage
HBF algorithm in blockage-free scenarios. In the first stage, the minimum mean
square error method is adopted for optimal hybrid beamformer design with low
complexity and fast convergence; in the second stage, the orthogonal matching
pursuit method is utilized to approximately recover the analog and digital
beamformers. Second, in blocked scenarios, we design an anti-blockage scheme by
adaptively invoking the proposed HBF algorithm, which can efficiently deal with
random blockages. Extensive simulation results are presented to show the sum
rate performance of the proposed algorithms under various configurations,
including transmission power, velocity of the train, blockage probability, etc.
It is demonstrated that the proposed anti-blockage algorithm can improve the
effective rate by 20% in severely-blocked scenarios while maintaining low
outage probability.
| [{'version': 'v1', 'created': 'Thu, 2 Jul 2020 03:44:37 GMT'}] | 2020-07-03 | [['Gao', 'Meilin', '', 'Sherman'], ['Ai', 'Bo', '', 'Sherman'], ['Niu', 'Yong', '', 'Sherman'], ['Wu', 'Wen', '', 'Sherman'], ['Yang', 'Peng', '', 'Sherman'], ['Lyu', 'Feng', '', 'Sherman'], ['Xuemin', '', '', 'Sherman'], ['Shen', '', '']] |
2207.10506 | Aline Sindel | Aline Sindel, Bettina Hohberger, Andreas Maier, Vincent Christlein | Multi-modal Retinal Image Registration Using a Keypoint-Based Vessel
Structure Aligning Network | 11 pages, 3 figures, 3 tables, accepted to MICCAI 2022 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In ophthalmological imaging, multiple imaging systems, such as color fundus,
infrared, fluorescein angiography, optical coherence tomography (OCT) or OCT
angiography, are often involved to make a diagnosis of retinal disease.
Multi-modal retinal registration techniques can assist ophthalmologists by
providing a pixel-based comparison of aligned vessel structures in images from
different modalities or acquisition times. To this end, we propose an
end-to-end trainable deep learning method for multi-modal retinal image
registration. Our method extracts convolutional features from the vessel
structure for keypoint detection and description and uses a graph neural
network for feature matching. The keypoint detection and description network
and graph neural network are jointly trained in a self-supervised manner using
synthetic multi-modal image pairs and are guided by synthetically sampled
ground truth homographies. Our method demonstrates higher registration accuracy
as competing methods for our synthetic retinal dataset and generalizes well for
our real macula dataset and a public fundus dataset.
| [{'version': 'v1', 'created': 'Thu, 21 Jul 2022 14:36:51 GMT'}] | 2022-07-22 | [['Sindel', 'Aline', ''], ['Hohberger', 'Bettina', ''], ['Maier', 'Andreas', ''], ['Christlein', 'Vincent', '']] |
2009.14635 | Kourosh Meshgi | Kourosh Meshgi, Maryam Sadat Mirzaei | Adversarial Semi-Supervised Multi-Domain Tracking | Accepted for ACCV 2020 | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Neural networks for multi-domain learning empowers an effective combination
of information from different domains by sharing and co-learning the
parameters. In visual tracking, the emerging features in shared layers of a
multi-domain tracker, trained on various sequences, are crucial for tracking in
unseen videos. Yet, in a fully shared architecture, some of the emerging
features are useful only in a specific domain, reducing the generalization of
the learned feature representation. We propose a semi-supervised learning
scheme to separate domain-invariant and domain-specific features using
adversarial learning, to encourage mutual exclusion between them, and to
leverage self-supervised learning for enhancing the shared features using the
unlabeled reservoir. By employing these features and training dedicated layers
for each sequence, we build a tracker that performs exceptionally on different
types of videos.
| [{'version': 'v1', 'created': 'Wed, 30 Sep 2020 12:47:28 GMT'}] | 2020-10-01 | [['Meshgi', 'Kourosh', ''], ['Mirzaei', 'Maryam Sadat', '']] |
1111.3107 | EPTCS | Alex Spelten (RWTH Aachen University), Wolfgang Thomas (RWTH Aachen
University), Sarah Winter (RWTH Aachen University) | Trees over Infinite Structures and Path Logics with Synchronization | In Proceedings INFINITY 2011, arXiv:1111.2678 | EPTCS 73, 2011, pp. 20-34 | 10.4204/EPTCS.73.5 | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We provide decidability and undecidability results on the model-checking
problem for infinite tree structures. These tree structures are built from
sequences of elements of infinite relational structures. More precisely, we
deal with the tree iteration of a relational structure M in the sense of
Shelah-Stupp. In contrast to classical results where model-checking is shown
decidable for MSO-logic, we show decidability of the tree model-checking
problem for logics that allow only path quantifiers and chain quantifiers
(where chains are subsets of paths), as they appear in branching time logics;
however, at the same time the tree is enriched by the equal-level relation
(which holds between vertices u, v if they are on the same tree level). We
separate cleanly the tree logic from the logic used for expressing properties
of the underlying structure M. We illustrate the scope of the decidability
results by showing that two slight extensions of the framework lead to
undecidability. In particular, this applies to the (stronger) tree iteration in
the sense of Muchnik-Walukiewicz.
| [{'version': 'v1', 'created': 'Mon, 14 Nov 2011 06:35:15 GMT'}] | 2011-11-15 | [['Spelten', 'Alex', '', 'RWTH Aachen University'], ['Thomas', 'Wolfgang', '', 'RWTH Aachen\n University'], ['Winter', 'Sarah', '', 'RWTH Aachen University']] |
1811.08362 | Yunbo Wang | Zhiyu Yao, Yunbo Wang, Mingsheng Long, Jianmin Wang, Philip S Yu,
Jiaguang Sun | Multi-Task Learning of Generalizable Representations for Video Action
Recognition | ICME 2020 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In classic video action recognition, labels may not contain enough
information about the diverse video appearance and dynamics, thus, existing
models that are trained under the standard supervised learning paradigm may
extract less generalizable features. We evaluate these models under a
cross-dataset experiment setting, as the above label bias problem in video
analysis is even more prominent across different data sources. We find that
using the optical flows as model inputs harms the generalization ability of
most video recognition models.
Based on these findings, we present a multi-task learning paradigm for video
classification. Our key idea is to avoid label bias and improve the
generalization ability by taking data as its own supervision or supervising
constraints on the data. First, we take the optical flows and the RGB frames by
taking them as auxiliary supervisions, and thus naming our model as Reversed
Two-Stream Networks (Rev2Net). Further, we collaborate the auxiliary flow
prediction task and the frame reconstruction task by introducing a new training
objective to Rev2Net, named Decoding Discrepancy Penalty (DDP), which
constraints the discrepancy of the multi-task features in a self-supervised
manner. Rev2Net is shown to be effective on the classic action recognition
task. It specifically shows a strong generalization ability in the
cross-dataset experiments.
| [{'version': 'v1', 'created': 'Tue, 20 Nov 2018 16:49:17 GMT'}, {'version': 'v2', 'created': 'Sun, 12 Apr 2020 02:56:41 GMT'}] | 2020-04-14 | [['Yao', 'Zhiyu', ''], ['Wang', 'Yunbo', ''], ['Long', 'Mingsheng', ''], ['Wang', 'Jianmin', ''], ['Yu', 'Philip S', ''], ['Sun', 'Jiaguang', '']] |
2206.04893 | Chuyang Ke | Chuyang Ke, Jean Honorio | Provable Guarantees for Sparsity Recovery with Deterministic Missing
Data Patterns | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the problem of consistently recovering the sparsity pattern of a
regression parameter vector from correlated observations governed by
deterministic missing data patterns using Lasso. We consider the case in which
the observed dataset is censored by a deterministic, non-uniform filter.
Recovering the sparsity pattern in datasets with deterministic missing
structure can be arguably more challenging than recovering in a
uniformly-at-random scenario. In this paper, we propose an efficient algorithm
for missing value imputation by utilizing the topological property of the
censorship filter. We then provide novel theoretical results for exact recovery
of the sparsity pattern using the proposed imputation strategy. Our analysis
shows that, under certain statistical and topological conditions, the hidden
sparsity pattern can be recovered consistently with high probability in
polynomial time and logarithmic sample complexity.
| [{'version': 'v1', 'created': 'Fri, 10 Jun 2022 06:14:45 GMT'}] | 2022-06-13 | [['Ke', 'Chuyang', ''], ['Honorio', 'Jean', '']] |
physics/0703097 | Peter H. L. Christiansen | P. Christiansen (for the ALICE TPC Collaboration) | Particle Identification Studies with an ALICE Test TPC | 6 pages, 4 figures, Quark Matter 06 poster proceeding | Int.J.Mod.Phys.E16:2457-2462,2007 | 10.1142/S0218301307008094 | null | physics.ins-det | null | Using a test TPC, consisting of the ALICE TPC field cage prototype in
combination with the final ALICE TPC readout and electronics, the energy loss
distribution and resolution were measured for identified protons. The
measurements were compared to theoretical calculations and good quantitative
agreement was found when detector effects were taken into account. The
implications for particle identification are discussed.
| [{'version': 'v1', 'created': 'Thu, 8 Mar 2007 15:41:42 GMT'}] | 2019-08-14 | [['Christiansen', 'P.', '', 'for the ALICE TPC Collaboration']] |
1312.0841 | Ben Ruijl | Ben Ruijl and Jos Vermaseren and Aske Plaat and Jaap van den Herik | Combining Simulated Annealing and Monte Carlo Tree Search for Expression
Simplification | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In many applications of computer algebra large expressions must be simplified
to make repeated numerical evaluations tractable. Previous works presented
heuristically guided improvements, e.g., for Horner schemes. The remaining
expression is then further reduced by common subexpression elimination. A
recent approach successfully applied a relatively new algorithm, Monte Carlo
Tree Search (MCTS) with UCT as the selection criterion, to find better variable
orderings. Yet, this approach is fit for further improvements since it is
sensitive to the so-called exploration-exploitation constant $C_p$ and the
number of tree updates $N$. In this paper we propose a new selection criterion
called Simulated Annealing UCT (SA-UCT) that has a dynamic
exploration-exploitation parameter, which decreases with the iteration number
$i$ and thus reduces the importance of exploration over time. First, we provide
an intuitive explanation in terms of the exploration-exploitation behavior of
the algorithm. Then, we test our algorithm on three large expressions of
different origins. We observe that SA-UCT widens the interval of good initial
values $C_p$ where best results are achieved. The improvement is large (more
than a tenfold) and facilitates the selection of an appropriate $C_p$.
| [{'version': 'v1', 'created': 'Tue, 3 Dec 2013 14:56:28 GMT'}] | 2013-12-04 | [['Ruijl', 'Ben', ''], ['Vermaseren', 'Jos', ''], ['Plaat', 'Aske', ''], ['Herik', 'Jaap van den', '']] |
1107.4150 | Kun He Dr. | Wenqi Huang and Kun He | Analysis on the computability over the efficient utilization problem of
the four-dimensional space-time | 13 pages, 3 figures | Theoretical Computer Science, vol. 501(27): 1-10, 2013 | null | null | cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper formally proposes a problem about the efficient utilization of the
four dimensional space-time. Given a cuboid container, a finite number of rigid
cuboid items, and the time length that each item should be continuous baked in
the container, the problem asks to arrange the starting time for each item
being placed into the container and to arrange the position and orientation for
each item at each instant during its continuous baking period such that the
total time length the container be utilized is as short as possible. Here all
side dimensions of the container and of the items are positive real numbers
arbitrarily given. Differs from the classical packing problems, the position
and orientation of each item in the container could be changed over time.
Therefore, according to above mathematical model, the four-dimensional
space-time can be utilized more truly and more fully. This paper then proves
that there exists an exact algorithm that could solve the problem by finite
operations, so we say this problem is weak computable. Based on the
understanding of this computability proof, it is expected to design effective
approximate algorithms in the near future. A piggyback work completed is a
strict proof on the weak computability over general and natural case of the
three-dimensional cuboid packing decision problem that all parameters are
positive real numbers.
| [{'version': 'v1', 'created': 'Thu, 21 Jul 2011 03:19:09 GMT'}] | 2015-01-26 | [['Huang', 'Wenqi', ''], ['He', 'Kun', '']] |
1410.6796 | Wojciech Mazurczyk | Wojciech Mazurczyk and Luca Caviglione | Steganography in Modern Smartphones and Mitigation Techniques | 25 pages, 8 figures, 6 tables | null | null | null | cs.MM cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | By offering sophisticated services and centralizing a huge volume of personal
data, modern smartphones changed the way we socialize, entertain and work. To
this aim, they rely upon complex hardware/software frameworks leading to a
number of vulnerabilities, attacks and hazards to profile individuals or gather
sensitive information. However, the majority of works evaluating the security
degree of smartphones neglects steganography, which can be mainly used to: i)
exfiltrate confidential data via camouflage methods, and ii) conceal valuable
or personal information into innocent looking carriers.
Therefore, this paper surveys the state of the art of steganographic
techniques for smartphones, with emphasis on methods developed over the period
2005 to the second quarter of 2014. The different approaches are grouped
according to the portion of the device used to hide information, leading to
three different covert channels, i.e., local, object and network. Also, it
reviews the relevant approaches used to detect and mitigate steganographic
attacks or threats. Lastly, it showcases the most popular software applications
to embed secret data into carriers, as well as possible future directions.
| [{'version': 'v1', 'created': 'Wed, 27 Aug 2014 08:46:05 GMT'}] | 2014-10-27 | [['Mazurczyk', 'Wojciech', ''], ['Caviglione', 'Luca', '']] |
1703.06822 | Kees Middelburg | J. A. Bergstra, C. A. Middelburg | Process algebra with strategic interleaving | 19 pages, this version is a revision of the published version | Theory of Computing Systems, 63(3):488--505, 2019 | 10.1007/s00224-018-9873-2 | null | cs.LO cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In process algebras such as ACP (Algebra of Communicating Processes),
parallel processes are considered to be interleaved in an arbitrary way. In the
case of multi-threading as found in contemporary programming languages,
parallel processes are actually interleaved according to some interleaving
strategy. An interleaving strategy is what is called a process-scheduling
policy in the field of operating systems. In many systems, for instance
hardware/software systems, we have to do with both parallel processes that may
best be considered to be interleaved in an arbitrary way and parallel processes
that may best be considered to be interleaved according to some interleaving
strategy. Therefore, we extend ACP in this paper with the latter form of
interleaving. The established properties of the extension concerned include an
elimination property, a conservative extension property, and a unique expansion
property.
| [{'version': 'v1', 'created': 'Mon, 20 Mar 2017 16:15:17 GMT'}, {'version': 'v2', 'created': 'Mon, 19 Feb 2018 11:05:48 GMT'}, {'version': 'v3', 'created': 'Tue, 21 Apr 2020 12:39:01 GMT'}] | 2020-04-22 | [['Bergstra', 'J. A.', ''], ['Middelburg', 'C. A.', '']] |
2301.08810 | Yinghao Aaron Li | Yinghao Aaron Li, Cong Han, Xilin Jiang, Nima Mesgarani | Phoneme-Level BERT for Enhanced Prosody of Text-to-Speech with Grapheme
Predictions | null | null | null | null | cs.CL cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Large-scale pre-trained language models have been shown to be helpful in
improving the naturalness of text-to-speech (TTS) models by enabling them to
produce more naturalistic prosodic patterns. However, these models are usually
word-level or sup-phoneme-level and jointly trained with phonemes, making them
inefficient for the downstream TTS task where only phonemes are needed. In this
work, we propose a phoneme-level BERT (PL-BERT) with a pretext task of
predicting the corresponding graphemes along with the regular masked phoneme
predictions. Subjective evaluations show that our phoneme-level BERT encoder
has significantly improved the mean opinion scores (MOS) of rated naturalness
of synthesized speech compared with the state-of-the-art (SOTA) StyleTTS
baseline on out-of-distribution (OOD) texts.
| [{'version': 'v1', 'created': 'Fri, 20 Jan 2023 21:36:16 GMT'}] | 2023-01-24 | [['Li', 'Yinghao Aaron', ''], ['Han', 'Cong', ''], ['Jiang', 'Xilin', ''], ['Mesgarani', 'Nima', '']] |
2205.12354 | Nitish K Panigrahy | Nitish K. Panigrahy, Prajit Dhara, Don Towsley, Saikat Guha and
Leandros Tassiulas | Optimal Entanglement Distribution using Satellite Based Quantum Networks | null | null | null | null | quant-ph cs.NI | http://creativecommons.org/licenses/by/4.0/ | Recent technological advancements in satellite based quantum communication
has made it a promising technology for realizing global scale quantum networks.
Due to better loss distance scaling compared to ground based fiber
communication, satellite quantum communication can distribute high quality
quantum entanglements among ground stations that are geographically separated
at very long distances. This work focuses on optimal distribution of bipartite
entanglements to a set of pair of ground stations using a constellation of
orbiting satellites. In particular, we characterize the optimal
satellite-to-ground station transmission scheduling policy with respect to the
aggregate entanglement distribution rate subject to various resource
constraints at the satellites and ground stations. We cast the optimal
transmission scheduling problem as an integer linear programming problem and
solve it efficiently for some specific scenarios. Our framework can also be
used as a benchmark tool to measure the performance of other potential
transmission scheduling policies.
| [{'version': 'v1', 'created': 'Tue, 24 May 2022 20:32:00 GMT'}, {'version': 'v2', 'created': 'Thu, 26 May 2022 02:00:05 GMT'}] | 2022-05-27 | [['Panigrahy', 'Nitish K.', ''], ['Dhara', 'Prajit', ''], ['Towsley', 'Don', ''], ['Guha', 'Saikat', ''], ['Tassiulas', 'Leandros', '']] |
2002.05141 | Anastasios Tsiamis | Anastasios Tsiamis and George Pappas | Online Learning of the Kalman Filter with Logarithmic Regret | null | null | null | null | cs.LG cs.SY eess.SY math.OC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we consider the problem of predicting observations generated
online by an unknown, partially observed linear system, which is driven by
stochastic noise. For such systems the optimal predictor in the mean square
sense is the celebrated Kalman filter, which can be explicitly computed when
the system model is known. When the system model is unknown, we have to learn
how to predict observations online based on finite data, suffering possibly a
non-zero regret with respect to the Kalman filter's prediction. We show that it
is possible to achieve a regret of the order of $\mathrm{poly}\log(N)$ with
high probability, where $N$ is the number of observations collected. Our work
is the first to provide logarithmic regret guarantees for the widely used
Kalman filter. This is achieved using an online least-squares algorithm, which
exploits the approximately linear relation between future observations and past
observations. The regret analysis is based on the stability properties of the
Kalman filter, recent statistical tools for finite sample analysis of system
identification, and classical results for the analysis of least-squares
algorithms for time series. Our regret analysis can also be applied for state
prediction of the hidden state, in the case of unknown noise statistics but
known state-space basis. A fundamental technical contribution is that our
bounds hold even for the class of non-explosive systems, which includes the
class of marginally stable systems, which was an open problem for the case of
online prediction under stochastic noise.
| [{'version': 'v1', 'created': 'Wed, 12 Feb 2020 18:31:31 GMT'}] | 2020-02-13 | [['Tsiamis', 'Anastasios', ''], ['Pappas', 'George', '']] |
2211.00701 | Alexander Khanikaev | Svetlana Kiriushechkina, Anton Vakulenko, Daria Smirnova, Sriram
Guddala, Filipp Komissarenko, Monica Allen, Jeffery Allen, Alexander B.
Khanikaev | Photonic Dirac Waveguides | 16 pages, 5 figures | null | null | null | physics.optics cond-mat.mtrl-sci physics.app-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Dirac equation is a paradigmatic model that describes a range of
intriguing properties of relativistic spin-1/2 particles, from the existence of
antiparticles to Klein tunneling. However, the Dirac-like equations have found
application far beyond its original scope, and has been used to comprehend the
properties of graphene and topological phases of matter. In the field of
photonics, the opportunity to emulate Dirac physics has also enabled
topological photonic insulators. In this paper, we demonstrate that judiciously
engineered synthetic potentials in photonic Dirac systems can offer physical
properties beyond both the elementary and quasi-particles, and topological
realms. Specifically, we introduce a new class of optical Dirac waveguides,
whose guided electromagnetic modes are endowed with pseudo-spin degree of
freedom. Pseudo-spin coupled with the ability to engineer synthetic gauge
potentials acting on it, enables control over the guided modes which is
unattainable in conventional optical waveguides. In particular, we use a
silicon nanophotonic metasurface that supports pseudo-spin degree of freedom as
a testing platform to predict and experimentally confirm a spin-full nature of
the Dirac waveguides. We also demonstrate that, for suitable trapping
potentials, the guided modes exhibit spin-dependent field distributions, which
gives rise to their distinct transport and radiative properties. Thereby, the
Dirac waveguides manifest spin-dependent radiative lifetimes - the
non-Hermitian spin-Hall effect - and open new avenues for spin-multiplexing,
controlling characteristics of guided optical modes, and tuning light-matter
interactions with photonic pseudo-spins.
| [{'version': 'v1', 'created': 'Tue, 1 Nov 2022 18:56:55 GMT'}] | 2022-11-03 | [['Kiriushechkina', 'Svetlana', ''], ['Vakulenko', 'Anton', ''], ['Smirnova', 'Daria', ''], ['Guddala', 'Sriram', ''], ['Komissarenko', 'Filipp', ''], ['Allen', 'Monica', ''], ['Allen', 'Jeffery', ''], ['Khanikaev', 'Alexander B.', '']] |
1901.10744 | Pasquale De Luca | Pasquale De Luca, Vincenzo Maria Russiello, Raffaele Ciro Sannino and
Lorenzo Valente | A study for Image compression using Re-Pair algorithm | 8 pages | null | null | null | cs.MM cs.CV | http://creativecommons.org/publicdomain/zero/1.0/ | The compression is an important topic in computer science which allows we to
storage more amount of data on our data storage. There are several techniques
to compress any file. In this manuscript will be described the most important
algorithm to compress images such as JPEG and it will be compared with another
method to retrieve good reason to not use this method on images. So to compress
the text the most encoding technique known is the Huffman Encoding which it
will be explained in exhaustive way. In this manuscript will showed how to
compute a text compression method on images in particular the method and the
reason to choice a determinate image format against the other. The method
studied and analyzed in this manuscript is the Re-Pair algorithm which is
purely for grammatical context to be compress. At the and it will be showed the
good result of this application.
| [{'version': 'v1', 'created': 'Wed, 30 Jan 2019 10:17:52 GMT'}, {'version': 'v2', 'created': 'Thu, 7 Feb 2019 13:56:41 GMT'}, {'version': 'v3', 'created': 'Wed, 13 Feb 2019 11:36:43 GMT'}] | 2019-02-14 | [['De Luca', 'Pasquale', ''], ['Russiello', 'Vincenzo Maria', ''], ['Sannino', 'Raffaele Ciro', ''], ['Valente', 'Lorenzo', '']] |
1702.01731 | Mohammadreza Babaee | Mohammadreza Babaee, Duc Tung Dinh, Gerhard Rigoll | A Deep Convolutional Neural Network for Background Subtraction | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we present a novel background subtraction system that uses a
deep Convolutional Neural Network (CNN) to perform the segmentation. With this
approach, feature engineering and parameter tuning become unnecessary since the
network parameters can be learned from data by training a single CNN that can
handle various video scenes. Additionally, we propose a new approach to
estimate background model from video. For the training of the CNN, we employed
randomly 5 percent video frames and their ground truth segmentations taken from
the Change Detection challenge 2014(CDnet 2014). We also utilized
spatial-median filtering as the post-processing of the network outputs. Our
method is evaluated with different data-sets, and the network outperforms the
existing algorithms with respect to the average ranking over different
evaluation metrics. Furthermore, due to the network architecture, our CNN is
capable of real time processing.
| [{'version': 'v1', 'created': 'Mon, 6 Feb 2017 18:24:04 GMT'}] | 2017-02-07 | [['Babaee', 'Mohammadreza', ''], ['Dinh', 'Duc Tung', ''], ['Rigoll', 'Gerhard', '']] |
2102.09516 | Jung-Wan Ryu | Jung-Wan Ryu, Jinhang Cho | Transformation cavities with a narrow refractive index profile | 13 pages, 4 figures | null | 10.1364/OL.422529 | null | physics.optics | http://creativecommons.org/licenses/by/4.0/ | Recently, gradient index cavities, or so-called transformation cavities,
designed by conformal transformation optics have been studied to support
resonant modes with both high Q-factors and emission directionality. We propose
a new design method for transformation cavities to realize a narrower width of
the refractive index profile, a great advantage in experimental
implementations, without losing the benefits of conformal mapping. We study the
resonant modes with both high Q-factor and directional emission in the newly
designed transformation cavities, where the refractive index profile is 50
percent narrower than in previously proposed transformation cavities. By
varying a system parameter with a fixed maximal value of the refractive index
profile inside the cavity, the width of the refractive index profile narrows,
the Q-factors become higher, and the near and far field patterns maintain their
properties, namely conformal whispering gallery modes and bidirectional
emission, respectively.
| [{'version': 'v1', 'created': 'Thu, 18 Feb 2021 17:59:12 GMT'}] | 2021-04-21 | [['Ryu', 'Jung-Wan', ''], ['Cho', 'Jinhang', '']] |
1806.02677 | A. E. Sitnitsky | A.E. Sitnitsky | Analytic calculation of ground state splitting in symmetric double well
potential | 21 p., 4 fig. arXiv admin note: text overlap with arXiv:1801.03733 | Computational and Theoretical Chemistry 1138C (2018) pp. 15-22 | 10.1016/j.comptc.2018.05.021 | null | physics.chem-ph quant-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The exact solution of the one-dimensional Schr\"odinger equation with
symmetric trigonometric double-well potential (DWP) is obtained via angular
oblate spheroidal function. The results of stringent analytic calculation for
the ground state splitting of ring-puckering vibration in the 1,3-dioxole (as
an example of the case when the ground state tunneling doublet is well below
the potential barrier top) and 2,3-dihydrofuran (as an example of the case when
the ground state tunneling doublet is close to the potential barrier top) are
compared with several variants of approximate semiclassical (WKB) ones. This
enables us to verify the accuracy of various WKB formulas suggested in the
literature: 1. ordinary WKB, i.e., the formula from the Landau and Lifshitz
textbook; 2. Garg's formula; 3. instanton approach. We show that for the former
case all three variants of WKB provide good accuracy while for the latter one
they are very inaccurate. The results obtained provide a new theoretical tool
for describing relevant experimental data on IR spectroscopy of ring-puckering
vibrations.
| [{'version': 'v1', 'created': 'Wed, 6 Jun 2018 08:36:49 GMT'}] | 2018-06-08 | [['Sitnitsky', 'A. E.', '']] |
2205.12808 | Haoyuan Sun | Haoyuan Sun, Kwangjun Ahn, Christos Thrampoulidis, Navid Azizan | Mirror Descent Maximizes Generalized Margin and Can Be Implemented
Efficiently | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Driven by the empirical success and wide use of deep neural networks,
understanding the generalization performance of overparameterized models has
become an increasingly popular question. To this end, there has been
substantial effort to characterize the implicit bias of the optimization
algorithms used, such as gradient descent (GD), and the structural properties
of their preferred solutions. This paper answers an open question in this
literature: For the classification setting, what solution does mirror descent
(MD) converge to? Specifically, motivated by its efficient implementation, we
consider the family of mirror descent algorithms with potential function chosen
as the $p$-th power of the $\ell_p$-norm, which is an important generalization
of GD. We call this algorithm $p$-$\textsf{GD}$. For this family, we
characterize the solutions it obtains and show that it converges in direction
to a generalized maximum-margin solution with respect to the $\ell_p$-norm for
linearly separable classification. While the MD update rule is in general
expensive to compute and perhaps not suitable for deep learning,
$p$-$\textsf{GD}$ is fully parallelizable in the same manner as SGD and can be
used to train deep neural networks with virtually no additional computational
overhead. Using comprehensive experiments with both linear and deep neural
network models, we demonstrate that $p$-$\textsf{GD}$ can noticeably affect the
structure and the generalization performance of the learned models.
| [{'version': 'v1', 'created': 'Wed, 25 May 2022 14:33:13 GMT'}, {'version': 'v2', 'created': 'Thu, 29 Sep 2022 17:14:59 GMT'}] | 2022-09-30 | [['Sun', 'Haoyuan', ''], ['Ahn', 'Kwangjun', ''], ['Thrampoulidis', 'Christos', ''], ['Azizan', 'Navid', '']] |
1803.06515 | Chunfang Li | Chun-Fang Li and Yun-Long Zhang | From nonholonomic quantum constraint to canonical variables of photons
I: true intrinsic degree of freedom | 18 pages, 1 figure | null | null | null | quant-ph math.RT physics.optics | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We report that the true intrinsic degree of freedom of the photon is neither
the polarization nor the spin. It describes a local property in momentum space
and is represented in the local representation by the Pauli matrices. This
result is achieved by treating the transversality condition on the vector
wavefunction as a nonholonomic quantum constraint. We find that the quantum
constraint makes it possible to generalize the Stokes parameters to
characterize the polarization of a general state. Unexpectedly, the generalized
Stokes parameters are specified in a momentum-space local reference system that
is fixed by another degree of freedom, called Stratton vector. Only constant
Stokes parameters in one particular local reference system can convey the
intrinsic degree of freedom of the photon. We show that the optical rotation is
one of such processes that change the Stratton vector with the intrinsic
quantum number remaining fixed. Changing the Stratton vector of the eigenstate
of the helicity will give rise to a Berry's phase.
| [{'version': 'v1', 'created': 'Sat, 17 Mar 2018 14:36:30 GMT'}] | 2018-03-20 | [['Li', 'Chun-Fang', ''], ['Zhang', 'Yun-Long', '']] |
1609.07407 | Joshua Rapp | Joshua Rapp and Vivek K Goyal | A Few Photons Among Many: Unmixing Signal and Noise for Photon-Efficient
Active Imaging | null | IEEE TCI vol. 3, no. 3 (2017) 445-459 | 10.1109/TCI.2017.2706028 | null | stat.AP physics.ins-det | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Conventional LIDAR systems require hundreds or thousands of photon detections
to form accurate depth and reflectivity images. Recent photon-efficient
computational imaging methods are remarkably effective with only 1.0 to 3.0
detected photons per pixel, but they are not demonstrated at
signal-to-background ratio (SBR) below 1.0 because their imaging accuracies
degrade significantly in the presence of high background noise. We introduce a
new approach to depth and reflectivity estimation that focuses on unmixing
contributions from signal and noise sources. At each pixel in an image,
short-duration range gates are adaptively determined and applied to remove
detections likely to be due to noise. For pixels with too few detections to
perform this censoring accurately, we borrow data from neighboring pixels to
improve depth estimates, where the neighborhood formation is also adaptive to
scene content. Algorithm performance is demonstrated on experimental data at
varying levels of noise. Results show improved performance of both reflectivity
and depth estimates over state-of-the-art methods, especially at low
signal-to-background ratios. In particular, accurate imaging is demonstrated
with SBR as low as 0.04. This validation of a photon-efficient, noise-tolerant
method demonstrates the viability of rapid, long-range, and low-power LIDAR
imaging.
| [{'version': 'v1', 'created': 'Fri, 23 Sep 2016 15:49:24 GMT'}] | 2019-11-13 | [['Rapp', 'Joshua', ''], ['Goyal', 'Vivek K', '']] |
1808.00727 | Christoph Redl | Christoph Redl | Inlining External Sources in Answer Set Programs | Under consideration in Theory and Practice of Logic Programming
(TPLP) | Theory and Practice of Logic Programming 19 (2019) 360-411 | 10.1017/S147106841800056X | null | cs.AI cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | HEX-programs are an extension of answer set programs (ASP) with external
sources. To this end, external atoms provide a bidirectional interface between
the program and an external source. The traditional evaluation algorithm for
HEX-programs is based on guessing truth values of external atoms and verifying
them by explicit calls of the external source. The approach was optimized by
techniques that reduce the number of necessary verification calls or speed them
up, but the remaining external calls are still expensive. In this paper we
present an alternative evaluation approach based on inlining of external atoms,
motivated by existing but less general approaches for specialized formalisms
such as DL-programs. External atoms are then compiled away such that no
verification calls are necessary. The approach is implemented in the dlvhex
reasoner. Experiments show a significant performance gain. Besides performance
improvements, we further exploit inlining for extending previous (semantic)
characterizations of program equivalence from ASP to HEX-programs, including
those of strong equivalence, uniform equivalence and H, B -equivalence.
Finally, based on these equivalence criteria, we characterize also
inconsistency of programs wrt. extensions. Since well-known ASP extensions
(such as constraint ASP) are special cases of HEX, the results are interesting
beyond the particular formalism. Under consideration in Theory and Practice of
Logic Programming (TPLP).
| [{'version': 'v1', 'created': 'Thu, 2 Aug 2018 09:32:20 GMT'}] | 2020-02-19 | [['Redl', 'Christoph', '']] |
1503.08866 | Bin Li | Bin Li, Berenice Mettler, Timonthy M. Kowalewski | Towards Data-Driven Hierarchical Surgical Skill Analysis | M2CAI 2014 | null | null | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper evaluates methods of hierarchical skill analysis developed in
aerospace to the problem of surgical skill assessment and modeling. The
analysis employs tool motion data of Fundamental of Laparoscopic Skills (FLS)
tasks collected from clinicians of various skill levels at three different
clinical teaching hospitals in the United States. Outcomes are evaluated based
on their ability to provide relevant information about the underlying processes
across the entire system hierarchy including control, guidance and planning.
| [{'version': 'v1', 'created': 'Mon, 30 Mar 2015 22:35:03 GMT'}] | 2015-04-01 | [['Li', 'Bin', ''], ['Mettler', 'Berenice', ''], ['Kowalewski', 'Timonthy M.', '']] |
1408.4976 | Richard Katz | John W. Crowley, Richard F. Katz, Peter J. Huybers, Charles H.
Langmuir, Sung-Hyun Park | Glacial cycles drive variations in the production of oceanic crust | 30 pages, 6 figures (including supplementary information).
Resubmitted to Science on 12 December 2014 | Science, Vol. 347, no. 6227, pp. 1237-1240, 2015 | 10.1126/science.1261508 | null | physics.geo-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Glacial cycles redistribute water between oceans and continents causing
pressure changes in the upper mantle, with consequences for melting of Earth's
interior. Using Plio-Pleistocene sea-level variations as a forcing function,
theoretical models of mid-ocean ridge dynamics that include melt transport
predict temporal variations in crustal thickness of hundreds of meters. New
bathymetry from the Australian-Antarctic ridge shows significant spectral
energy near the Milankovitch periods of 23, 41, and 100 ky, consistent with
model predictions. These results suggest that abyssal hills, one of the most
common bathymetric features on Earth, record the magmatic response to changes
in sea level. The models and data support a link between glacial cycles at the
surface and mantle melting at depth, recorded in the bathymetric fabric of the
sea floor.
| [{'version': 'v1', 'created': 'Thu, 21 Aug 2014 12:43:28 GMT'}, {'version': 'v2', 'created': 'Mon, 15 Dec 2014 13:13:57 GMT'}] | 2015-06-16 | [['Crowley', 'John W.', ''], ['Katz', 'Richard F.', ''], ['Huybers', 'Peter J.', ''], ['Langmuir', 'Charles H.', ''], ['Park', 'Sung-Hyun', '']] |
1709.06661 | Murat Arcak | Murat Arcak and John Maidens | Simulation-based reachability analysis for nonlinear systems using
componentwise contraction properties | null | null | null | null | cs.SY | http://creativecommons.org/licenses/by-nc-sa/4.0/ | A shortcoming of existing reachability approaches for nonlinear systems is
the poor scalability with the number of continuous state variables. To mitigate
this problem we present a simulation-based approach where we first sample a
number of trajectories of the system and next establish bounds on the
convergence or divergence between the samples and neighboring trajectories. We
compute these bounds using contraction theory and reduce the conservatism by
partitioning the state vector into several components and analyzing contraction
properties separately in each direction. Among other benefits this allows us to
analyze the effect of constant but uncertain parameters by treating them as
state variables and partitioning them into a separate direction. We next
present a numerical procedure to search for weighted norms that yield a
prescribed contraction rate, which can be incorporated in the reachability
algorithm to adjust the weights to minimize the growth of the reachable set.
| [{'version': 'v1', 'created': 'Tue, 19 Sep 2017 22:04:58 GMT'}] | 2017-09-21 | [['Arcak', 'Murat', ''], ['Maidens', 'John', '']] |
2012.09914 | Md. Selim Habib | Md. Selim Habib, Christos Markos, and Rodrigo Amezcua-Correa | Impact of cladding elements on the loss performance of hollow-core
anti-resonant fibers | null | null | null | null | physics.optics | http://creativecommons.org/licenses/by/4.0/ | Understanding the impact of the cladding tube structure on the overall
guiding performance is crucial for designing single-mode, wide-band, and ultra
low-loss nested hollow-core anti-resonant fiber (HC-ARF). Here we thoroughly
investigate on how the propagation loss is affected by the nested elements when
their geometry is realistic (i.e., non-ideal). Interestingly, it was found that
the size rather than the shape of the nested elements, have a dominant role in
the final loss performance of the HC-ARFs. We identify a unique 'V-shape'
pattern for suppression of higher-order modes loss by optimizing free design
parameters of HC-ARF. We find that a 5-tube nested HC-ARF has wider
transmission window and better single-mode operation than 6-tube HC-ARF. We
show that the propagation loss can be significantly improved by using
anisotropic nested anti-resonant tubes elongated in the radial direction. Our
simulations indicate that with this novel fiber design, a propagation loss as
low as 0.11 dB/km at 1.55 $\mu$m can be achieved. Our results provide design
insights towards fully exploiting single-mode, wide-band, and ultra low-loss
HC-ARF. In addition, the extraordinary optical properties of the proposed fiber
can be beneficial for several applications such as future optical communication
system, high energy light transport, extreme non-nonlinear optics and beyond.
| [{'version': 'v1', 'created': 'Thu, 17 Dec 2020 20:18:53 GMT'}] | 2020-12-21 | [['Habib', 'Md. Selim', ''], ['Markos', 'Christos', ''], ['Amezcua-Correa', 'Rodrigo', '']] |
1812.03761 | Lucy Martin | Lucy Martin, Shinji Machida, David Kelliher and Suzie Sheehy | A study of coherent and incoherent resonances in high intensity beams
using a linear Paul trap | null | New J. Phys. 21 053023 (2019) | 10.1088/1367-2630/ab0e28 | null | physics.acc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we present a quantitative measurement of the change in
frequency (tune) with intensity of four transverse resonances in a high
intensity Gaussian beam. Due to the non-linear space charge forces present in
high intensity beams, particle motion cannot be analytically described. Instead
we use the Simulator of Particle Orbit Dynamics (S-POD) and the Intense Beam
Experiment (IBEX), two linear Paul traps, to experimentally replicate the
system. In high intensity beams a coherent resonant response to both space
charge and external field driven perturbations is possible, these coherent
resonances are excited at a tune that differs by a factor $C_{m}$ from that of
the incoherent resonance. By increasing the number of ions stored in the linear
Paul trap and studying the location of four different resonances we extract
provisional values describing the change in tune of the resonance with
intensity. These values are then compared to the $C_{m}$ factors for coherent
resonances. We find that the $C_{m}$ factors do not accurately predict the
location of resonances in high intensity Gaussian beams. Further insight into
the experiment is gained through simulation using Warp, a particle-in-cell
code.
| [{'version': 'v1', 'created': 'Mon, 10 Dec 2018 12:40:45 GMT'}, {'version': 'v2', 'created': 'Mon, 3 Jun 2019 14:15:35 GMT'}] | 2019-06-04 | [['Martin', 'Lucy', ''], ['Machida', 'Shinji', ''], ['Kelliher', 'David', ''], ['Sheehy', 'Suzie', '']] |
2001.07799 | Ziyue Xiang | Ziyue Xiang, Daniel E. Acuna | Scientific Image Tampering Detection Based On Noise Inconsistencies: A
Method And Datasets | null | null | null | null | cs.CV eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Scientific image tampering is a problem that affects not only authors but
also the general perception of the research community. Although previous
researchers have developed methods to identify tampering in natural images,
these methods may not thrive under the scientific setting as scientific images
have different statistics, format, quality, and intentions. Therefore, we
propose a scientific-image specific tampering detection method based on noise
inconsistencies, which is capable of learning and generalizing to different
fields of science. We train and test our method on a new dataset of manipulated
western blot and microscopy imagery, which aims at emulating problematic images
in science. The test results show that our method can detect various types of
image manipulation in different scenarios robustly, and it outperforms existing
general-purpose image tampering detection schemes. We discuss applications
beyond these two types of images and suggest next steps for making detection of
problematic images a systematic step in peer review and science in general.
| [{'version': 'v1', 'created': 'Tue, 21 Jan 2020 22:29:56 GMT'}, {'version': 'v2', 'created': 'Wed, 4 Mar 2020 20:46:46 GMT'}] | 2020-03-06 | [['Xiang', 'Ziyue', ''], ['Acuna', 'Daniel E.', '']] |
1605.08590 | Zuogong Yue | Zuogon Yue, Johan Thunberg, Lennart Ljung, Ye Yuan and Jorge Goncalves | Systems Aliasing in Dynamic Network Reconstruction: Issues on Low
Sampling Frequencies | 14 pages. arXiv admin note: substantial text overlap with
arXiv:1605.06973 | null | null | null | cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Network reconstruction of dynamical continuous-time (CT) systems is motivated
by applications in many fields. Due to experimental limitations, especially in
biology, data could be sampled at low frequencies, leading to significant
challenges in network inference. We introduce the concept of "system aliasing"
and characterize the minimal sampling frequency that allows reconstruction of
CT systems from low sampled data. A test criterion is also proposed to check
whether system aliasing is presented. With no system aliasing, the paper
provides an algorithm to reconstruct dynamic network from data in the presence
of noise. In addition, when there is system aliasing we perform studies that
add additional prior information of the system such as sparsity. This paper
opens new directions in modelling of network systems where samples have
significant costs. Such tools are essential to process the available data in
applications subject to current experimental limitations.
| [{'version': 'v1', 'created': 'Fri, 27 May 2016 11:36:41 GMT'}, {'version': 'v2', 'created': 'Mon, 30 May 2016 11:40:08 GMT'}, {'version': 'v3', 'created': 'Thu, 28 Sep 2017 15:17:12 GMT'}, {'version': 'v4', 'created': 'Mon, 29 Oct 2018 15:20:41 GMT'}] | 2018-10-30 | [['Yue', 'Zuogon', ''], ['Thunberg', 'Johan', ''], ['Ljung', 'Lennart', ''], ['Yuan', 'Ye', ''], ['Goncalves', 'Jorge', '']] |
2208.01905 | YuLi Sun | Yuli Sun, Lin Lei, Dongdong Guan, Gangyao Kuang, Li Liu | Graph Signal Processing for Heterogeneous Change Detection Part II:
Spectral Domain Analysis | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This is the second part of the paper that provides a new strategy for the
heterogeneous change detection (HCD) problem, that is, solving HCD from the
perspective of graph signal processing (GSP). We construct a graph to represent
the structure of each image, and treat each image as a graph signal defined on
the graph. In this way, we can convert the HCD problem into a comparison of
responses of signals on systems defined on the graphs. In the part I, the
changes are measured by comparing the structure difference between the graphs
from the vertex domain. In this part II, we analyze the GSP for HCD from the
spectral domain. We first analyze the spectral properties of the different
images on the same graph, and show that their spectra exhibit commonalities and
dissimilarities. Specially, it is the change that leads to the dissimilarities
of their spectra. Then, we propose a regression model for the HCD, which
decomposes the source signal into the regressed signal and changed signal, and
requires the regressed signal have the same spectral property as the target
signal on the same graph. With the help of graph spectral analysis, the
proposed regression model is flexible and scalable. Experiments conducted on
seven real data sets show the effectiveness of the proposed method.
| [{'version': 'v1', 'created': 'Wed, 3 Aug 2022 08:11:24 GMT'}, {'version': 'v2', 'created': 'Mon, 8 Aug 2022 03:00:43 GMT'}] | 2022-08-09 | [['Sun', 'Yuli', ''], ['Lei', 'Lin', ''], ['Guan', 'Dongdong', ''], ['Kuang', 'Gangyao', ''], ['Liu', 'Li', '']] |
2008.00075 | Stepan Kuznetsov | Max Kanovich, Stepan Kuznetsov, Andre Scedrov | The Multiplicative-Additive Lambek Calculus with Subexponential and
Bracket Modalities | Accepted for publication in the Journal of Logic, Language, and
Information | null | null | null | cs.LO math.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We give a proof-theoretic and algorithmic complexity analysis for systems
introduced by Morrill to serve as the core of the CatLog categorial grammar
parser. We consider two recent versions of Morrill's calculi, and focus on
their fragments including multiplicative (Lambek) connectives, additive
conjunction and disjunction, brackets and bracket modalities, and the !
subexponential modality. For both systems, we resolve issues connected with the
cut rule and provide necessary modifications, after which we prove
admissibility of cut (cut elimination theorem). We also prove algorithmic
undecidability for both calculi, and show that categorial grammars based on
them can generate arbitrary recursively enumerable languages.
| [{'version': 'v1', 'created': 'Fri, 31 Jul 2020 20:42:13 GMT'}, {'version': 'v2', 'created': 'Wed, 30 Sep 2020 20:02:13 GMT'}] | 2020-10-02 | [['Kanovich', 'Max', ''], ['Kuznetsov', 'Stepan', ''], ['Scedrov', 'Andre', '']] |
2010.10670 | Joseph Marino | Joseph Marino, Alexandre Pich\'e, Alessandro Davide Ialongo, Yisong
Yue | Iterative Amortized Policy Optimization | Advances in Neural Processing Systems (NeurIPS) 2021 | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Policy networks are a central feature of deep reinforcement learning (RL)
algorithms for continuous control, enabling the estimation and sampling of
high-value actions. From the variational inference perspective on RL, policy
networks, when used with entropy or KL regularization, are a form of
\textit{amortized optimization}, optimizing network parameters rather than the
policy distributions directly. However, \textit{direct} amortized mappings can
yield suboptimal policy estimates and restricted distributions, limiting
performance and exploration. Given this perspective, we consider the more
flexible class of \textit{iterative} amortized optimizers. We demonstrate that
the resulting technique, iterative amortized policy optimization, yields
performance improvements over direct amortization on benchmark continuous
control tasks.
| [{'version': 'v1', 'created': 'Tue, 20 Oct 2020 23:25:42 GMT'}, {'version': 'v2', 'created': 'Fri, 22 Oct 2021 20:44:57 GMT'}] | 2021-10-26 | [['Marino', 'Joseph', ''], ['Piché', 'Alexandre', ''], ['Ialongo', 'Alessandro Davide', ''], ['Yue', 'Yisong', '']] |
1810.12834 | Ciriaco Andrea D'Angelo | Giovanni Abramo, Ciriaco Andrea D'Angelo | Assessing national strengths and weaknesses in research fields | null | Abramo, G., D'Angelo, C.A. (2014). Assessing national strengths
and weaknesses in research fields. Journal of Informetrics, 8(3), 766-775 | 10.1016/j.joi.2014.07.002 | null | cs.DL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | National policies aimed at fostering the effectiveness of scientific systems
should be based on reliable strategic analysis identifying strengths and
weaknesses at field level. Approaches and indicators thus far proposed in the
literature have not been completely satisfactory, since they fail to
distinguish the effect of the size of production factors from that of their
quality, particularly the quality of labor. The current work proposes an
innovative "input-oriented" approach, which permits: i) estimation of national
research performance in a field and comparison to that of other nations,
independent of the size of their respective research staffs; and, for fields of
comparable intensity of publication, ii) identification of the strong and weak
research fields within a national research system on the basis of international
comparison. In reference to the second objective, the proposed approach is
applied to the Italian case, through the analysis of the 2006-2010 scientific
production of the Italian academic system, in the 200 research fields where
bibliometric analysis is meaningful.
| [{'version': 'v1', 'created': 'Tue, 30 Oct 2018 16:06:36 GMT'}] | 2018-10-31 | [['Abramo', 'Giovanni', ''], ["D'Angelo", 'Ciriaco Andrea', '']] |
1606.01781 | Alexis Conneau | Alexis Conneau, Holger Schwenk, Lo\"ic Barrault, Yann Lecun | Very Deep Convolutional Networks for Text Classification | 10 pages, EACL 2017, camera-ready | null | null | null | cs.CL cs.LG cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The dominant approach for many NLP tasks are recurrent neural networks, in
particular LSTMs, and convolutional neural networks. However, these
architectures are rather shallow in comparison to the deep convolutional
networks which have pushed the state-of-the-art in computer vision. We present
a new architecture (VDCNN) for text processing which operates directly at the
character level and uses only small convolutions and pooling operations. We are
able to show that the performance of this model increases with depth: using up
to 29 convolutional layers, we report improvements over the state-of-the-art on
several public text classification tasks. To the best of our knowledge, this is
the first time that very deep convolutional nets have been applied to text
processing.
| [{'version': 'v1', 'created': 'Mon, 6 Jun 2016 15:14:50 GMT'}, {'version': 'v2', 'created': 'Fri, 27 Jan 2017 12:49:11 GMT'}] | 2017-01-30 | [['Conneau', 'Alexis', ''], ['Schwenk', 'Holger', ''], ['Barrault', 'Loïc', ''], ['Lecun', 'Yann', '']] |
2010.15877 | Yunchengh Hua | Yuncheng Hua, Yuan-Fang Li, Gholamreza Haffari, Guilin Qi and Tongtong
Wu | Few-Shot Complex Knowledge Base Question Answering via Meta
Reinforcement Learning | 11 pages, 1 figure, accepted in EMNLP 2020 | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Complex question-answering (CQA) involves answering complex natural-language
questions on a knowledge base (KB). However, the conventional neural program
induction (NPI) approach exhibits uneven performance when the questions have
different types, harboring inherently different characteristics, e.g.,
difficulty level. This paper proposes a meta-reinforcement learning approach to
program induction in CQA to tackle the potential distributional bias in
questions. Our method quickly and effectively adapts the meta-learned
programmer to new questions based on the most similar questions retrieved from
the training data. The meta-learned policy is then used to learn a good
programming policy, utilizing the trial trajectories and their rewards for
similar questions in the support set. Our method achieves state-of-the-art
performance on the CQA dataset (Saha et al., 2018) while using only five trial
trajectories for the top-5 retrieved questions in each support set, and
metatraining on tasks constructed from only 1% of the training set. We have
released our code at https://github.com/DevinJake/MRL-CQA.
| [{'version': 'v1', 'created': 'Thu, 29 Oct 2020 18:34:55 GMT'}] | 2020-11-02 | [['Hua', 'Yuncheng', ''], ['Li', 'Yuan-Fang', ''], ['Haffari', 'Gholamreza', ''], ['Qi', 'Guilin', ''], ['Wu', 'Tongtong', '']] |
1009.0297 | Gideon Simpson | Gideon Simpson, Marc Spiegelman | Solitary Wave Benchmarks in Magma Dynamics | 25 pages, 7 figures | null | null | null | physics.geo-ph math.NA nlin.PS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a model problem for benchmarking codes that investigate magma
migration in the Earth's interior. This system retains the essential features
of more sophisticated models, yet has the advantage of possessing solitary wave
solutions. The existence of such exact solutions to the nonlinear problem make
it an excellent benchmark problem for combinations of solver algorithms. In
this work, we explore a novel algorithm for computing high quality
approximations of the solitary waves and use them to benchmark a
semi-Lagrangian Crank-Nicholson scheme for a finite element discretization of
the time dependent problem.
| [{'version': 'v1', 'created': 'Wed, 1 Sep 2010 22:38:02 GMT'}] | 2010-09-03 | [['Simpson', 'Gideon', ''], ['Spiegelman', 'Marc', '']] |
1706.08817 | Kyriakos Georgiou | Kyriakos Georgiou, Samuel Xavier-de-Souza, Kerstin Eder | The IoT energy challenge: A software perspective | 9 pages, 1 figure | IEEE Embedded Systems Letters, 2017, vol. PP, no. 99, pp. 1-1 | 10.1109/LES.2017.2741419 | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Internet of Things (IoT) sparks a whole new world of embedded
applications. Most of these applications are based on deeply embedded systems
that have to operate on limited or unreliable sources of energy, such as
batteries or energy harvesters. Meeting the energy requirements for such
applications is a hard challenge, which threatens the future growth of the IoT.
Software has the ultimate control over hardware. Therefore, its role is
significant in optimizing the energy consumption of a system. Currently,
programmers have no feedback on how their software affects the energy
consumption of a system. Such feedback can be enabled by energy transparency, a
concept that makes a program's energy consumption visible, from hardware to
software. This paper discusses the need for energy transparency in software
development and emphasizes on how such transparency can be realized to help
tackling the IoT energy challenge.
| [{'version': 'v1', 'created': 'Tue, 27 Jun 2017 12:38:30 GMT'}] | 2017-09-06 | [['Georgiou', 'Kyriakos', ''], ['Xavier-de-Souza', 'Samuel', ''], ['Eder', 'Kerstin', '']] |
2011.14393 | Jalal Arabneydi | Vida Fathi, Jalal Arabneydi and Amir G. Aghdam | Reinforcement Learning in Linear Quadratic Deep Structured Teams: Global
Convergence of Policy Gradient Methods | Proceedings of IEEE Conference on Decision and Control, 2020 | null | null | null | cs.MA cs.LG cs.SY eess.SY math.OC | http://creativecommons.org/licenses/by/4.0/ | In this paper, we study the global convergence of model-based and model-free
policy gradient descent and natural policy gradient descent algorithms for
linear quadratic deep structured teams. In such systems, agents are partitioned
into a few sub-populations wherein the agents in each sub-population are
coupled in the dynamics and cost function through a set of linear regressions
of the states and actions of all agents. Every agent observes its local state
and the linear regressions of states, called deep states. For a sufficiently
small risk factor and/or sufficiently large population, we prove that
model-based policy gradient methods globally converge to the optimal solution.
Given an arbitrary number of agents, we develop model-free policy gradient and
natural policy gradient algorithms for the special case of risk-neutral cost
function. The proposed algorithms are scalable with respect to the number of
agents due to the fact that the dimension of their policy space is independent
of the number of agents in each sub-population. Simulations are provided to
verify the theoretical results.
| [{'version': 'v1', 'created': 'Sun, 29 Nov 2020 16:02:39 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Dec 2020 06:55:09 GMT'}] | 2020-12-16 | [['Fathi', 'Vida', ''], ['Arabneydi', 'Jalal', ''], ['Aghdam', 'Amir G.', '']] |
2203.11079 | Fabian Egidy | Anton Ehrmanntraut, Fabian Egidy, Christian Gla{\ss}er | Oracle with $\mathrm{P=NP\cap coNP}$, but no Many-One Completeness in
UP, DisjNP, and DisjCoNP | null | null | null | null | cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We construct an oracle relative to which $\mathrm{P} = \mathrm{NP} \cap
\mathrm{coNP}$, but there are no many-one complete sets in $\mathrm{UP}$, no
many-one complete disjoint $\mathrm{NP}$-pairs, and no many-one complete
disjoint $\mathrm{coNP}$-pairs. This contributes to a research program
initiated by Pudl\'ak [Pud17], which studies incompleteness in the finite
domain and which mentions the construction of such oracles as open problem. The
oracle shows that $\mathsf{NP}\cap\mathsf{coNP}$ is indispensable in the list
of hypotheses studied by Pudl\'ak. Hence one should consider stronger
hypotheses, in order to find a universal one.
| [{'version': 'v1', 'created': 'Mon, 21 Mar 2022 15:58:52 GMT'}] | 2022-03-22 | [['Ehrmanntraut', 'Anton', ''], ['Egidy', 'Fabian', ''], ['Glaßer', 'Christian', '']] |
2009.13901 | Carlo Cossu | Carlo Cossu | Evaluation of tilt control for wind-turbine arrays in the atmospheric
boundary layer | submitted to Wind Energy Science (revised version) | null | null | null | physics.flu-dyn | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Wake redirection is a promising approach designed to mitigate turbine-wake
interactions which have a negative impact on the performance and lifetime of
wind farms. It has recently been found that substantial power gains can be
obtained by tilting the rotors of spanwise-periodic wind-turbine arrays. Rotor
tilt is associated to the generation of coherent streamwise vortices which
deflect wakes towards the ground and, by exploiting the vertical wind shear,
replace them with higher-momentum fluid (high-speed streaks). The objective of
this work is to evaluate power gains that can be obtained by tilting rotors in
spanwise-periodic wind-turbine arrays immersed in the atmospheric boundary
layer and, in particular, to analyze the influence of the rotor size on power
gains in the case where the turbines emerge from the atmospheric surface layer.
We show that, for the case of wind-aligned arrays, large power gains can be
obtained for positive tilt angles of the order of 30{\deg}. Power gains are
substantially enhanced by operating tilted-rotor turbines at thrust
coefficients higher than in the reference configuration. These power gains
initially increase with the rotor size reaching a maximum for rotor diameters
of the order of 3.6 boundary layer momentum thicknesses (for the considered
cases) and decrease for larger sizes. Maximum power gains are obtained for
wind-turbine spanwise spacings which are very similar to those of large-scale
and very large scale streaky motions which are naturally amplified in turbulent
boundary layers. These results are all congruent with the findings of previous
investigations of passive control of canonical boundary layers for
drag-reduction applications where high-speed streaks replaced wakes of
spanwise-periodic rows of wall-mounted roughness elements.
| [{'version': 'v1', 'created': 'Tue, 29 Sep 2020 09:48:55 GMT'}, {'version': 'v2', 'created': 'Mon, 8 Feb 2021 15:47:22 GMT'}] | 2021-02-09 | [['Cossu', 'Carlo', '']] |
2006.01509 | Marlin Benedikt Sch\"afer | Marlin B. Sch\"afer (1 and 2), Frank Ohme (1 and 2), Alexander H. Nitz
(1 and 2) ((1) Max-Planck-Institut f\"ur Gravitationsphysik
(Albert-Einstein-Institut), (2) Leibniz Universit\"at Hannover) | Detection of gravitational-wave signals from binary neutron star mergers
using machine learning | 14 pages, 6 figures, 1 table, supplemental materials at
https://github.com/gwastro/bns-machine-learning-search | Phys. Rev. D 102, 063015 (2020) | 10.1103/PhysRevD.102.063015 | null | astro-ph.HE astro-ph.IM cs.LG gr-qc | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As two neutron stars merge, they emit gravitational waves that can
potentially be detected by earth bound detectors. Matched-filtering based
algorithms have traditionally been used to extract quiet signals embedded in
noise. We introduce a novel neural-network based machine learning algorithm
that uses time series strain data from gravitational-wave detectors to detect
signals from non-spinning binary neutron star mergers. For the Advanced LIGO
design sensitivity, our network has an average sensitive distance of 130 Mpc at
a false-alarm rate of 10 per month. Compared to other state-of-the-art machine
learning algorithms, we find an improvement by a factor of 6 in sensitivity to
signals with signal-to-noise ratio below 25. However, this approach is not yet
competitive with traditional matched-filtering based methods. A conservative
estimate indicates that our algorithm introduces on average 10.2 s of latency
between signal arrival and generating an alert. We give an exact description of
our testing procedure, which can not only be applied to machine learning based
algorithms but all other search algorithms as well. We thereby improve the
ability to compare machine learning and classical searches.
| [{'version': 'v1', 'created': 'Tue, 2 Jun 2020 10:20:11 GMT'}, {'version': 'v2', 'created': 'Mon, 28 Sep 2020 12:52:49 GMT'}] | 2020-09-29 | [['Schäfer', 'Marlin B.', '', '1 and 2'], ['Ohme', 'Frank', '', '1 and 2'], ['Nitz', 'Alexander H.', '', '1 and 2']] |
1208.0285 | Mahashweta Das | Mahashweta Das, Saravanan Thirumuruganathan, Sihem Amer-Yahia, Gautam
Das, Cong Yu | Who Tags What? An Analysis Framework | VLDB2012 | Proceedings of the VLDB Endowment (PVLDB), Vol. 5, No. 11, pp.
1567-1578 (2012) | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The rise of Web 2.0 is signaled by sites such as Flickr, del.icio.us, and
YouTube, and social tagging is essential to their success. A typical tagging
action involves three components, user, item (e.g., photos in Flickr), and tags
(i.e., words or phrases). Analyzing how tags are assigned by certain users to
certain items has important implications in helping users search for desired
information. In this paper, we explore common analysis tasks and propose a dual
mining framework for social tagging behavior mining. This framework is centered
around two opposing measures, similarity and diversity, being applied to one or
more tagging components, and therefore enables a wide range of analysis
scenarios such as characterizing similar users tagging diverse items with
similar tags, or diverse users tagging similar items with diverse tags, etc. By
adopting different concrete measures for similarity and diversity in the
framework, we show that a wide range of concrete analysis problems can be
defined and they are NP-Complete in general. We design efficient algorithms for
solving many of those problems and demonstrate, through comprehensive
experiments over real data, that our algorithms significantly out-perform the
exact brute-force approach without compromising analysis result quality.
| [{'version': 'v1', 'created': 'Wed, 1 Aug 2012 17:20:05 GMT'}] | 2012-08-02 | [['Das', 'Mahashweta', ''], ['Thirumuruganathan', 'Saravanan', ''], ['Amer-Yahia', 'Sihem', ''], ['Das', 'Gautam', ''], ['Yu', 'Cong', '']] |
cond-mat/0602549 | M. T. Yamashita | M. T. Yamashita, Lauro Tomio, A. Delfino and T. Frederico | Four-boson scale near a Feshbach resonance | null | Europhys. Lett. 75, 555 (2006) | 10.1209/epl/i2006-10141-6 | null | cond-mat.soft physics.atom-ph | null | We show that an independent four-body momentum scale $\mu_{(4)}$ drives the
tetramer binding energy for fixed trimer energy (or three-body scale
$\mu_{(3)}$) and large scattering length ($a$). The three- and four-body forces
from the one-channel reduction of the atomic interaction near a Feshbach
resonance disentangle $\mu_{(4)}$ and $\mu_{(3)}$. The four-body independent
scale is also manifested through a family of Tjon-lines, with slope given by
$\mu_{(4)}/\mu_{(3)}$ for $a^{-1}=0$. There is the possibility of a new
renormalization group limit cycle due to the new scale.
| [{'version': 'v1', 'created': 'Thu, 23 Feb 2006 12:54:47 GMT'}, {'version': 'v2', 'created': 'Fri, 27 Oct 2006 13:39:22 GMT'}] | 2009-11-11 | [['Yamashita', 'M. T.', ''], ['Tomio', 'Lauro', ''], ['Delfino', 'A.', ''], ['Frederico', 'T.', '']] |
2208.03898 | Naihao Deng | Yulong Chen, Naihao Deng, Yang Liu, Yue Zhang | DialogSum Challenge: Results of the Dialogue Summarization Shared Task | INLG 2021 DialogSum Challenge Result Report. Link to this report on
INLG website: https://inlgmeeting.github.io/poster_paper43.html. Presentation
video on YouTube: https://www.youtube.com/watch?v=5Bk3tNr_1ng; on Bilibili:
https://www.bilibili.com/video/BV13e4y1h7eB?spm_id_from=444.41.list.card_archive.click | null | null | null | cs.CL | http://creativecommons.org/licenses/by-sa/4.0/ | We report the results of DialogSum Challenge, the shared task on summarizing
real-life scenario dialogues at INLG 2022. Four teams participate in this
shared task and three submit their system reports, exploring different methods
to improve the performance of dialogue summarization. Although there is a great
improvement over the baseline models regarding automatic evaluation metrics,
such as Rouge scores, we find that there is a salient gap between model
generated outputs and human annotated summaries by human evaluation from
multiple aspects. These findings demonstrate the difficulty of dialogue
summarization and suggest that more fine-grained evaluatuion metrics are in
need.
| [{'version': 'v1', 'created': 'Mon, 8 Aug 2022 03:39:42 GMT'}, {'version': 'v2', 'created': 'Tue, 9 Aug 2022 02:28:02 GMT'}, {'version': 'v3', 'created': 'Sat, 3 Sep 2022 05:08:20 GMT'}] | 2022-09-07 | [['Chen', 'Yulong', ''], ['Deng', 'Naihao', ''], ['Liu', 'Yang', ''], ['Zhang', 'Yue', '']] |
1910.06149 | Yujia Ding | Yujia Ding and Weiqing Gu | Accelerometer-Based Gait Segmentation: Simultaneously User and Adversary
Identification | null | null | null | null | eess.SP cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we introduce a new gait segmentation method based on
accelerometer data and develop a new distance function between two time series,
showing novel and effectiveness in simultaneously identifying user and
adversary. Comparing with the normally used Neural Network methods, our
approaches use geometric features to extract walking cycles more precisely and
employ a new similarity metric to conduct user-adversary identification. This
new technology for simultaneously identify user and adversary contributes to
cybersecurity beyond user-only identification. In particular, the new
technology is being applied to cell phone recorded walking data and performs an
accuracy of $98.79\%$ for 6 classes classification (user-adversary
identification) and $99.06\%$ for binary classification (user only
identification). In addition to walking signal, our approach works on walking
up, walking down and mixed walking signals. This technology is feasible for
both large and small data set, overcoming the current challenges facing to
Neural Networks such as tuning large number of hyper-parameters for large data
sets and lacking of training data for small data sets. In addition, the new
distance function developed here can be applied in any signal analysis.
| [{'version': 'v1', 'created': 'Fri, 11 Oct 2019 06:45:30 GMT'}] | 2019-10-15 | [['Ding', 'Yujia', ''], ['Gu', 'Weiqing', '']] |
End of preview. Expand
in Dataset Viewer.
This is the same datasets as in Kaggle (https://www.kaggle.com/datasets/Cornell-University/arxiv)
Only selected for CS category
- Downloads last month
- 0