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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1311.0388 | Tapomayukh Bhattacharjee | Tapomayukh Bhattacharjee, Yonghwan Oh, and Sang-Rok Oh | Non-linear Task-Space Disturbance Observer for Position Regulation of
Redundant Robot Arms against Perturbations in 3D Environments | This paper summarizes our work on the formulation of a Non-linear
Task-Space Disturbance Observer for Redundant Robot Arms. This work was done
at the Interaction and Robotics Research Center in Korea Institute of Science
and Technology (KIST), South-Korea during 2010-2011 | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many day-to-day activities require the dexterous manipulation of a redundant
humanoid arm in complex 3D environments. However, position regulation of such
robot arm systems becomes very difficult in presence of non-linear
uncertainties in the system. Also, perturbations exist due to various unwanted
interactions with obstacles for clumsy environments in which obstacle avoidance
is not possible, and this makes position regulation even more difficult. This
report proposes a non-linear task-space disturbance observer by virtue of which
position regulation of such robotic systems can be achieved in spite of such
perturbations and uncertainties. Simulations are conducted using a 7-DOF
redundant robot arm system to show the effectiveness of the proposed method.
These results are then compared with the case of a conventional mass-damper
based task-space disturbance observer to show the enhancement in performance
using the developed concept. This proposed method is then applied to a
controller which exhibits human-like motion characteristics for reaching a
target. Arbitrary perturbations in the form of interactions with obstacles are
introduced in its path. Results show that the robot end-effector successfully
continues to move in its path of a human-like quasi-straight trajectory even if
the joint trajectories deviated by a considerable amount due to the
perturbations. These results are also compared with that of the unperturbed
motion of the robot which further prove the significance of the developed
scheme.
| [{'version': 'v1', 'created': 'Sat, 2 Nov 2013 16:24:22 GMT'}] | 2013-11-05 | [['Bhattacharjee', 'Tapomayukh', ''], ['Oh', 'Yonghwan', ''], ['Oh', 'Sang-Rok', '']] |
1604.00764 | Prabath Abeysiriwardana | P. C. Abeysiriwardana, S. R. Kodituwakku | Evaluation of the use of web technology by government of Sri Lanka to
ensure food security for its citizens | International Conference of Sabaragamuwa University of Sri Lanka 2015
(ICSUSL 2015) | Procedia Food Science,Volume 6, 2016, Pages 82_91, International
Conference of Sabaragamuwa University of Sri Lanka 2015 (ICSUSL 2015) | 10.1016/j.profoo.2016.02.018 | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Web technology is one of the key areas in information and communication
technology to be used as a powerful tool in ensuring food security which is one
of the main issues in Sri Lanka. Web technology involves in communicating and
sharing resources in network of computers all over the world. Main focus of
food security is to ensure that all people have fair access to sufficient and
quality food without endangering the future supply of the same food. In this
context, web sites play a vital and major role in achieving food security in
Sri Lanka. In this case study, websites pertaining to Sri Lankan government and
link with food security were analyzed to find out their impact in achieving the
goals of food security using web technologies and how they are being involved
in ensuring food security in Sri Lanka. The other objective of this study is to
make the Sri Lankan government aware of present situation of those websites in
addressing food security related issues and how modern web technologies could
be effectively and efficiently used to address those issues. So, the relevant
websites were checked against several criteria and scores were used to assess
their capabilities to address the concerns of food security. It was found that
the amount of emphasis given by these websites to address the issues of food
security is not satisfactory. Further, it showed that if these web sites could
be improved further, they would generate a powerful impact on ensuring food
security in Sri Lanka.
| [{'version': 'v1', 'created': 'Mon, 4 Apr 2016 07:42:31 GMT'}] | 2016-04-05 | [['Abeysiriwardana', 'P. C.', ''], ['Kodituwakku', 'S. R.', '']] |
2012.02620 | Mojtaba Forghani | Mojtaba Forghani, Yizhou Qian, Jonghyun Lee, Matthew W. Farthing,
Tyler Hesser, Peter K. Kitanidis, and Eric F. Darve | Application of deep learning to large scale riverine flow velocity
estimation | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Fast and reliable prediction of riverine flow velocities is important in many
applications, including flood risk management. The shallow water equations
(SWEs) are commonly used for prediction of the flow velocities. However,
accurate and fast prediction with standard SWE solvers is challenging in many
cases. Traditional approaches are computationally expensive and require
high-resolution riverbed profile measurement ( bathymetry) for accurate
predictions. As a result, they are a poor fit in situations where they need to
be evaluated repetitively due, for example, to varying boundary condition (BC),
or when the bathymetry is not known with certainty. In this work, we propose a
two-stage process that tackles these issues. First, using the principal
component geostatistical approach (PCGA) we estimate the probability density
function of the bathymetry from flow velocity measurements, and then we use
multiple machine learning algorithms to obtain a fast solver of the SWEs, given
augmented realizations from the posterior bathymetry distribution and the
prescribed range of BCs. The first step allows us to predict flow velocities
without direct measurement of the bathymetry. Furthermore, the augmentation of
the distribution in the second stage allows incorporation of the additional
bathymetry information into the flow velocity prediction for improved accuracy
and generalization, even if the bathymetry changes over time. Here, we use
three solvers, referred to as PCA-DNN (principal component analysis-deep neural
network), SE (supervised encoder), and SVE (supervised variational encoder),
and validate them on a reach of the Savannah river near Augusta, GA. Our
results show that the fast solvers are capable of predicting flow velocities
with good accuracy, at a computational cost that is significantly lower than
the cost of solving the full boundary value problem with traditional methods.
| [{'version': 'v1', 'created': 'Fri, 4 Dec 2020 14:26:33 GMT'}] | 2020-12-07 | [['Forghani', 'Mojtaba', ''], ['Qian', 'Yizhou', ''], ['Lee', 'Jonghyun', ''], ['Farthing', 'Matthew W.', ''], ['Hesser', 'Tyler', ''], ['Kitanidis', 'Peter K.', ''], ['Darve', 'Eric F.', '']] |
1808.09403 | Francesco Evangelista | Jeffrey B. Schriber, Kevin P. Hannon, Francesco A. Evangelista | A Combined Selected Configuration Interaction and Many-Body Treatment of
Static and Dynamical Correlation in Oligoacenes | null | null | null | null | physics.chem-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We have combined our adaptive configuration interaction (ACI) [J.B. Schriber
and F.A. Evangelista, J. Chem. Phys. 144, 161106 (2016)] with a density-fitted
implementation of the second-order perturbative multireference driven
similarity renormalization group (DSRG-MRPT2) [K.P. Hannon, C. Li and F.A.
Evangelista J. Chem. Phys. 144, 204111 (2016)]. We use ACI reference wave
functions to recover static correlation for active spaces larger than the
conventional limit of 18 orbitals. The dynamical correlation is computed using
the DSRG-MRPT2 to yield a complete treatment of electron correlation. We apply
the resulting method, ACI-DSRG-MRPT2, to predict singlet-triplet gaps, metrics
of open-shell character, and spin-spin correlation functions for the oligoacene
series (2-7 rings). Our computations employ active spaces with as many as 30
electrons in 30 orbitals and up to 1350 basis functions, yielding gaps that are
in good agreement with available experimental results. Large bases and
reference relaxation lead to a significant reduction in the estimated radical
character of the oligoacenes with respect to previous valence-only treatments
of correlation effects.
| [{'version': 'v1', 'created': 'Tue, 28 Aug 2018 16:49:44 GMT'}] | 2018-08-29 | [['Schriber', 'Jeffrey B.', ''], ['Hannon', 'Kevin P.', ''], ['Evangelista', 'Francesco A.', '']] |
2102.08592 | Dmitriy Anistratov | Joseph M. Coale, Dmitriy Y. Anistratov | Reduced-Order Models for Thermal Radiative Transfer Based on
POD-Galerkin Method and Low-Order Quasidiffusion Equations | null | null | null | null | math.NA cs.NA physics.comp-ph | http://creativecommons.org/licenses/by/4.0/ | This paper presents a new technique for developing reduced-order models
(ROMs) for nonlinear radiative transfer problems in high-energy density
physics. The proper orthogonal decomposition (POD) of photon intensities is
applied to obtain global basis functions for the Galerkin projection
(POD-Galerkin) of the time-dependent multigroup Boltzmann transport equation
(BTE) for photons. The POD-Galerkin solution of the BTE is used to determine
the quasidiffusion (Eddington) factors that yield closures for the nonlinear
system of (i) multilevel low-order quasidiffusion (VEF) equations and (ii)
material energy balance equation. Numerical results are presented to
demonstrate accuracy of the ROMs obtained with different low-rank
approximations of intensities.
| [{'version': 'v1', 'created': 'Wed, 17 Feb 2021 05:58:55 GMT'}] | 2021-02-18 | [['Coale', 'Joseph M.', ''], ['Anistratov', 'Dmitriy Y.', '']] |
2203.11265 | Paolo Pistone | Melissa Antonelli, Ugo Dal Lago, Paolo Pistone | Curry and Howard Meet Borel | null | null | null | null | cs.LO math.LO | http://creativecommons.org/licenses/by/4.0/ | We show that an intuitionistic version of counting propositional logic
corresponds, in the sense of Curry and Howard, to an expressive type system for
the probabilistic event lambda-calculus, a vehicle calculus in which both
call-by-name and call-by-value evaluation of discrete randomized functional
programs can be simulated. Remarkably, proofs (respectively, types) do not only
guarantee that validity (respectively, termination) holds, but also reveal the
underlying probability. We finally show that by endowing the type system with
an intersection operator, one obtains a system precisely capturing the
probabilistic behavior of lambda-terms.
| [{'version': 'v1', 'created': 'Mon, 21 Mar 2022 18:48:49 GMT'}] | 2022-03-23 | [['Antonelli', 'Melissa', ''], ['Lago', 'Ugo Dal', ''], ['Pistone', 'Paolo', '']] |
1606.06524 | Zhongwen Wu | Z. W. Wu, A. V. Volotka, A. Surzhykov, C. Z. Dong, and S. Fritzsche | Level sequence and splitting identification of closely-spaced energy
levels by angle-resolved analysis of the fluorescence light | 9 pages, 7 figures | Physical Review A 93, 063413 (2016) | 10.1103/PhysRevA.93.063413 | null | physics.atom-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The angular distribution and linear polarization of the fluorescence light
following the resonant photoexcitation is investigated within the framework of
the density matrix and second-order perturbation theory. Emphasis has been
placed on "signatures" for determining the level sequence and splitting of
intermediate (partially) overlapping resonances, if analyzed as a function of
the photon energy of the incident light. Detailed computations within the
multiconfiguration Dirac-Fock method have been performed especially for the
$1s^{2}2s^{2}2p^{6}3s\;\, J_{i}=1/2 \,+\, \gamma_{1} \:\rightarrow\:
(1s^{2}2s2p^{6}3s)_{1}3p_{3/2}\;\, J=1/2, \, 3/2
\:\rightarrow\: 1s^{2}2s^{2}2p^{6}3s\;\, J_{f}=1/2 \,+\, \gamma_{2}$
photoexcitation and subsequent fluorescence emission of atomic sodium. A
remarkably strong dependence of the angular distribution and linear
polarization of the $\gamma_{2}$ fluorescence emission is found upon the level
sequence and splitting of the intermediate $(1s^{2}2s2p^{6}3s)_{1}3p_{3/2}\;\,
J=1/2, \, 3/2$ overlapping resonances owing to their finite lifetime
(linewidth). We therefore suggest that accurate measurements of the angular
distribution and linear polarization might help identify the sequence and small
splittings of closely-spaced energy levels, even if they can not be
spectroscopically resolved.
| [{'version': 'v1', 'created': 'Tue, 21 Jun 2016 11:44:40 GMT'}] | 2016-06-22 | [['Wu', 'Z. W.', ''], ['Volotka', 'A. V.', ''], ['Surzhykov', 'A.', ''], ['Dong', 'C. Z.', ''], ['Fritzsche', 'S.', '']] |
1502.05263 | Peter Gloor | Hanuma Teja Maddali, Peter A. Gloor, and Peter Margolis | Comparing Online Community Structure of Patients of Chronic Diseases | Proceedings of the 5th International Conference on Collaborative
Innovation Networks COINs15, Tokyo, Japan March 12-14, 2015 (arXiv:1502.01142 | null | null | coins15/2015/09 | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we compare the social network structure of people talking about
Crohn's disease, Cystic Fibrosis, and Type 1 diabetes on Facebook and Twitter.
We find that the Crohn's community's contributors are most emotional on
Facebook and Twitter and most negative on Twitter, while the T1D community's
communication network structure is most cohesive.
| [{'version': 'v1', 'created': 'Wed, 18 Feb 2015 15:04:51 GMT'}] | 2015-02-19 | [['Maddali', 'Hanuma Teja', ''], ['Gloor', 'Peter A.', ''], ['Margolis', 'Peter', '']] |
1805.01319 | Simon Collet | Simon Collet (IRIF, CNRS, UPD7), Amos Korman (IRIF, CNRS, UPD7) | Intense Competition can Drive Selfish Explorers to Optimize Coverage | null | SPAA, Jul 2018, Vienna, Austria. 2018 | null | null | cs.GT cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider a game-theoretic setting in which selfish individuals compete
over resources of varying quality. The motivating example is a group of animals
that disperse over patches of food of different abundances. In such scenarios,
individuals are biased towards selecting the higher quality patches, while, at
the same time, aiming to avoid costly collisions or overlaps. Our goal is to
investigate the impact of collision costs on the parallel coverage of resources
by the whole group. Consider M sites, where a site x has value f(x). We think
of f(x) as the reward associated with site x, and assume that if a single
individual visits x exclusively, it receives this exact reward. Typically, we
assume that if > 1 individuals visit x then each receives at most f(x). In
particular, when competition costs are high, each individual might receive an
amount strictly less than f(x), which could even be negative. Conversely,
modeling cooperation at a site, we also consider cases where each one gets more
than f(x). There are k identical players that compete over the rewards. They
independently act in parallel, in a one-shot scenario, each specifying a single
site to visit, without knowing which sites are explored by others. The group
performance is evaluated by the expected coverage, defined as the sum of f(x)
over all sites that are explored by at least one player. Since we assume that
players cannot coordinate before choosing their site we focus on symmetric
strategies. The main takeaway message of this paper is that the optimal
symmetric coverage is expected to emerge when collision costs are relatively
high, so that the following "Judgment of Solomon" type of rule holds: If a
single player explores a site x then it gains its full reward f(x), but if
several players explore it, then neither one receives any reward. Under this
policy, it turns out that there exists a unique symmetric Nash Equilibrium
strategy, which is, in fact, evolutionary stable. Moreover, this strategy
yields the best possible coverage among all symmetric strategies. Viewing the
coverage measure as the social welfare, this policy thus enjoys a (Symmetric)
Price of Anarchy of precisely 1, whereas, in fact, any other congestion policy
has a price strictly greater than 1. Our model falls within the scope of
mechanism design, and more precisely in the area of incentivizing exploration.
It finds relevance in evolutionary ecology, and further connects to studies on
Bayesian parallel search algorithms.
| [{'version': 'v1', 'created': 'Thu, 3 May 2018 14:18:11 GMT'}] | 2018-05-04 | [['Collet', 'Simon', '', 'IRIF, CNRS, UPD7'], ['Korman', 'Amos', '', 'IRIF, CNRS, UPD7']] |
2109.00899 | Xuan Li | Xuan Li, Liqiong Chang, Xue Liu | CE-Dedup: Cost-Effective Convolutional Neural Nets Training based on
Image Deduplication | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Attributed to the ever-increasing large image datasets, Convolutional Neural
Networks (CNNs) have become popular for vision-based tasks. It is generally
admirable to have larger-sized datasets for higher network training accuracies.
However, the impact of dataset quality has not to be involved. It is reasonable
to assume the near-duplicate images exist in the datasets. For instance, the
Street View House Numbers (SVHN) dataset having cropped house plate digits from
0 to 9 are likely to have repetitive digits from the same/similar house plates.
Redundant images may take up a certain portion of the dataset without
consciousness. While contributing little to no accuracy improvement for the
CNNs training, these duplicated images unnecessarily pose extra resource and
computation consumption. To this end, this paper proposes a framework to assess
the impact of the near-duplicate images on CNN training performance, called
CE-Dedup. Specifically, CE-Dedup associates a hashing-based image deduplication
approach with downstream CNNs-based image classification tasks. CE-Dedup
balances the tradeoff between a large deduplication ratio and a stable accuracy
by adjusting the deduplication threshold. The effectiveness of CE-Dedup is
validated through extensive experiments on well-known CNN benchmarks. On one
hand, while maintaining the same validation accuracy, CE-Dedup can reduce the
dataset size by 23%. On the other hand, when allowing a small validation
accuracy drop (by 5%), CE-Dedup can trim the dataset size by 75%.
| [{'version': 'v1', 'created': 'Mon, 23 Aug 2021 19:54:03 GMT'}] | 2021-09-03 | [['Li', 'Xuan', ''], ['Chang', 'Liqiong', ''], ['Liu', 'Xue', '']] |
2206.04101 | Zeyu Tang | Zeyu Tang, Jiji Zhang, Kun Zhang | What-Is and How-To for Fairness in Machine Learning: A Survey,
Reflection, and Perspective | null | null | null | null | cs.LG cs.CY | http://creativecommons.org/licenses/by/4.0/ | Algorithmic fairness has attracted increasing attention in the machine
learning community. Various definitions are proposed in the literature, but the
differences and connections among them are not clearly addressed. In this
paper, we review and reflect on various fairness notions previously proposed in
machine learning literature, and make an attempt to draw connections to
arguments in moral and political philosophy, especially theories of justice. We
also consider fairness inquiries from a dynamic perspective, and further
consider the long-term impact that is induced by current prediction and
decision. In light of the differences in the characterized fairness, we present
a flowchart that encompasses implicit assumptions and expected outcomes of
different types of fairness inquiries on the data generating process, on the
predicted outcome, and on the induced impact, respectively. This paper
demonstrates the importance of matching the mission (which kind of fairness one
would like to enforce) and the means (which spectrum of fairness analysis is of
interest, what is the appropriate analyzing scheme) to fulfill the intended
purpose.
| [{'version': 'v1', 'created': 'Wed, 8 Jun 2022 18:05:46 GMT'}] | 2022-06-10 | [['Tang', 'Zeyu', ''], ['Zhang', 'Jiji', ''], ['Zhang', 'Kun', '']] |
2111.14416 | Servio Paguada M.Sc. | Servio Paguada, Lejla Batina, Ileana Buhan, Igor Armendariz | Being Patient and Persistent: Optimizing An Early Stopping Strategy for
Deep Learning in Profiled Attacks | null | null | null | null | cs.CR cs.LG | http://creativecommons.org/licenses/by/4.0/ | The absence of an algorithm that effectively monitors deep learning models
used in side-channel attacks increases the difficulty of evaluation. If the
attack is unsuccessful, the question is if we are dealing with a resistant
implementation or a faulty model. We propose an early stopping algorithm that
reliably recognizes the model's optimal state during training. The novelty of
our solution is an efficient implementation of guessing entropy estimation.
Additionally, we formalize two conditions, persistence and patience, for a deep
learning model to be optimal. As a result, the model converges with fewer
traces.
| [{'version': 'v1', 'created': 'Mon, 29 Nov 2021 09:54:45 GMT'}] | 2021-11-30 | [['Paguada', 'Servio', ''], ['Batina', 'Lejla', ''], ['Buhan', 'Ileana', ''], ['Armendariz', 'Igor', '']] |
1101.4203 | Philippe Grenier | ATLAS 3D Collaboration: P. Grenier, G. Alimonti, M. Barbero, R. Bates,
E. Bolle, M. Borri, M. Boscardin, C. Buttar, M. Capua, M. Cavalli-Sforza, M.
Cobal, A. Cristofoli, G-F. Dalla Betta, G. Darbo, C. Da Vi\`a, E. Devetak, B.
DeWilde, B. Di Girolamo, D. Dobos, K. Einsweiler, D. Esseni, S. Fazio, C.
Fleta, J. Freestone, C. Gallrapp, M. Garcia-Sciveres, G. Gariano, C. Gemme,
M-P. Giordani, H. Gjersdal, S. Grinstein, T. Hansen, T-E. Hansen, P. Hansson,
J. Hasi, K. Helle, M. Hoeferkamp, F. H\"ugging, P. Jackson, K. Jakobs, J.
Kalliopuska, M. Karagounis, C. Kenney, M. K\"ohler, M. Kocian, A. Kok, S.
Kolya, I. Korokolov, V. Kostyukhin, H. Kr\"uger, A. La Rosa, C. H. Lai, N.
Lietaer, M. Lozano, A. Mastroberardino, A. Micelli, C. Nellist, A. Oja, V.
Oshea, C. Padilla, P. Palestri, S. Parker, U. Parzefall, J. Pater, G.
Pellegrini, H. Pernegger, C. Piemonte, S. Pospisil, M. Povoli, S. Roe, O.
Rohne, S. Ronchin, A. Rovani, E. Ruscino, H. Sandaker, S. Seidel, L. Selmi,
D. Silverstein, K. Sj{\o}b{\ae}k, T. Slavicek, S. Stapnes, B. Stugu, J.
Stupak, D. Su, G. Susinno, R. Thompson, J-W. Tsung, D. Tsybychev, S.J. Watts,
N. Wermes, C. Young, N. Zorzi | Test Beam Results of 3D Silicon Pixel Sensors for the ATLAS upgrade | null | Nucl.Instrum.Meth.A638:33-40,2011 | 10.1016/j.nima.2011.01.181 | null | physics.ins-det | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Results on beam tests of 3D silicon pixel sensors aimed at the ATLAS
Insertable-B-Layer and High Luminosity LHC (HL-LHC)) upgrades are presented.
Measurements include charge collection, tracking efficiency and charge sharing
between pixel cells, as a function of track incident angle, and were performed
with and without a 1.6 T magnetic field oriented as the ATLAS Inner Detector
solenoid field. Sensors were bump bonded to the front-end chip currently used
in the ATLAS pixel detector. Full 3D sensors, with electrodes penetrating
through the entire wafer thickness and active edge, and double-sided 3D sensors
with partially overlapping bias and read-out electrodes were tested and showed
comparable performance.
| [{'version': 'v1', 'created': 'Fri, 21 Jan 2011 18:42:10 GMT'}] | 2016-08-14 | [['ATLAS 3D Collaboration', '', ''], ['Grenier', 'P.', ''], ['Alimonti', 'G.', ''], ['Barbero', 'M.', ''], ['Bates', 'R.', ''], ['Bolle', 'E.', ''], ['Borri', 'M.', ''], ['Boscardin', 'M.', ''], ['Buttar', 'C.', ''], ['Capua', 'M.', ''], ['Cavalli-Sforza', 'M.', ''], ['Cobal', 'M.', ''], ['Cristofoli', 'A.', ''], ['Betta', 'G-F. Dalla', ''], ['Darbo', 'G.', ''], ['Da Vià', 'C.', ''], ['Devetak', 'E.', ''], ['DeWilde', 'B.', ''], ['Di Girolamo', 'B.', ''], ['Dobos', 'D.', ''], ['Einsweiler', 'K.', ''], ['Esseni', 'D.', ''], ['Fazio', 'S.', ''], ['Fleta', 'C.', ''], ['Freestone', 'J.', ''], ['Gallrapp', 'C.', ''], ['Garcia-Sciveres', 'M.', ''], ['Gariano', 'G.', ''], ['Gemme', 'C.', ''], ['Giordani', 'M-P.', ''], ['Gjersdal', 'H.', ''], ['Grinstein', 'S.', ''], ['Hansen', 'T.', ''], ['Hansen', 'T-E.', ''], ['Hansson', 'P.', ''], ['Hasi', 'J.', ''], ['Helle', 'K.', ''], ['Hoeferkamp', 'M.', ''], ['Hügging', 'F.', ''], ['Jackson', 'P.', ''], ['Jakobs', 'K.', ''], ['Kalliopuska', 'J.', ''], ['Karagounis', 'M.', ''], ['Kenney', 'C.', ''], ['Köhler', 'M.', ''], ['Kocian', 'M.', ''], ['Kok', 'A.', ''], ['Kolya', 'S.', ''], ['Korokolov', 'I.', ''], ['Kostyukhin', 'V.', ''], ['Krüger', 'H.', ''], ['La Rosa', 'A.', ''], ['Lai', 'C. H.', ''], ['Lietaer', 'N.', ''], ['Lozano', 'M.', ''], ['Mastroberardino', 'A.', ''], ['Micelli', 'A.', ''], ['Nellist', 'C.', ''], ['Oja', 'A.', ''], ['Oshea', 'V.', ''], ['Padilla', 'C.', ''], ['Palestri', 'P.', ''], ['Parker', 'S.', ''], ['Parzefall', 'U.', ''], ['Pater', 'J.', ''], ['Pellegrini', 'G.', ''], ['Pernegger', 'H.', ''], ['Piemonte', 'C.', ''], ['Pospisil', 'S.', ''], ['Povoli', 'M.', ''], ['Roe', 'S.', ''], ['Rohne', 'O.', ''], ['Ronchin', 'S.', ''], ['Rovani', 'A.', ''], ['Ruscino', 'E.', ''], ['Sandaker', 'H.', ''], ['Seidel', 'S.', ''], ['Selmi', 'L.', ''], ['Silverstein', 'D.', ''], ['Sjøbæk', 'K.', ''], ['Slavicek', 'T.', ''], ['Stapnes', 'S.', ''], ['Stugu', 'B.', ''], ['Stupak', 'J.', ''], ['Su', 'D.', ''], ['Susinno', 'G.', ''], ['Thompson', 'R.', ''], ['Tsung', 'J-W.', ''], ['Tsybychev', 'D.', ''], ['Watts', 'S. J.', ''], ['Wermes', 'N.', ''], ['Young', 'C.', ''], ['Zorzi', 'N.', '']] |
2009.02325 | Timoteo Carletti | Timoteo Carletti and Duccio Fanelli and Alessio Guarino | How to fairly share a watermelon | corrected version | null | 10.1088/1361-6552/abc4dc | null | physics.ed-ph physics.pop-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Geometry, calculus and in particular integrals, are too often seen by young
students as technical tools with no link to the reality. This fact generates
into the students a loss of interest with a consequent removal of motivation in
the study of such topics and more widely in pursuing scientific curricula. With
this note we put to the fore a simple example of practical interest where the
above concepts prove central; our aim is thus to motivate students and to
reverse the dropout trend by proposing an introduction to the theory starting
from practical applications. More precisely, we will show how using a mixture
of geometry, calculus and integrals one can easily share a watermelon into
regular slices with equal volume.
| [{'version': 'v1', 'created': 'Mon, 7 Sep 2020 09:56:16 GMT'}, {'version': 'v2', 'created': 'Wed, 30 Sep 2020 21:46:01 GMT'}] | 2020-12-30 | [['Carletti', 'Timoteo', ''], ['Fanelli', 'Duccio', ''], ['Guarino', 'Alessio', '']] |
1807.00198 | Sathish Natarajan | Jitendar K Tiwari, Ajay Mandal, N Sathish, Venkat A N Ch, A K
Srivastava | Graphene platelets reinforced aluminum matrix composite with enhanced
strength by hot accumulative roll bonding | 23 pages, 7 figures, Full article | null | null | null | physics.app-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Accumulative Roll Bonding(ARB) process was used to develop few-layer graphene
nano platelets reinforced aluminum matrix (GNPs/Al) composite in the form of
sheets. Annealed Al sheets were ARB processed up to 6 pass along with coating
of graphene between stacked sheets in first and second pass. Another set was
prepared with same process parameter in the absence of graphene coating.
Properties of these two set of samples were analyzed on the basis of film
theory of ARB process which enables micro-level mixing of material on stacked
layer interface. Hence the problem of graphene agglomeration was overcome
through our process. The Raman spectra at the cross-section was taken which not
only show the strong interaction of GNPs with Al matrix due to increased D and
D' band but also the graphene quality enhancement on the basis of single
symmetric 2D band. Samples were then subjected to universal testing machine
(UTM) and Vickers microhardness tester. Results showed up to ~73% increment in
yield strength and ~27% increment in hardness of GNPs/Al matrix composite.
Fracture surface of tensile specimen was further examined under SEM to
understand the fracture mechanics at higher passes, which elucidate elongation
variation and delamination behavior of stacked sheets. Deep elongated dimples
with the smoothed surface in GNPs/Al composite are the cause of reduced
elongation. But the final composite was having improved strength with
appreciable ductility. The improvement was further justified by increment in
dislocations, calculated using Williamson-Hall plot on X-ray diffraction (XRD)
data. All results signify the effectiveness of the proposed technique for the
development of GNPs/Al composite.
| [{'version': 'v1', 'created': 'Sat, 30 Jun 2018 16:36:44 GMT'}] | 2018-07-03 | [['Tiwari', 'Jitendar K', ''], ['Mandal', 'Ajay', ''], ['Sathish', 'N', ''], ['Ch', 'Venkat A N', ''], ['Srivastava', 'A K', '']] |
1706.08100 | Fabio Patrizi | Ronen Brafman, Giuseppe De Giacomo, Fabio Patrizi | Specifying Non-Markovian Rewards in MDPs Using LDL on Finite Traces
(Preliminary Version) | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In Markov Decision Processes (MDPs), the reward obtained in a state depends
on the properties of the last state and action. This state dependency makes it
difficult to reward more interesting long-term behaviors, such as always
closing a door after it has been opened, or providing coffee only following a
request. Extending MDPs to handle such non-Markovian reward function was the
subject of two previous lines of work, both using variants of LTL to specify
the reward function and then compiling the new model back into a Markovian
model. Building upon recent progress in the theories of temporal logics over
finite traces, we adopt LDLf for specifying non-Markovian rewards and provide
an elegant automata construction for building a Markovian model, which extends
that of previous work and offers strong minimality and compositionality
guarantees.
| [{'version': 'v1', 'created': 'Sun, 25 Jun 2017 13:37:00 GMT'}] | 2017-06-27 | [['Brafman', 'Ronen', ''], ['De Giacomo', 'Giuseppe', ''], ['Patrizi', 'Fabio', '']] |
1807.02851 | Francisco Barranco | Francisco Barranco, Cornelia Fermuller, Eduardo Ros | Real-time clustering and multi-target tracking using event-based sensors | Conference paper. Accepted for IROS 2018 | null | null | null | cs.RO cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Clustering is crucial for many computer vision applications such as robust
tracking, object detection and segmentation. This work presents a real-time
clustering technique that takes advantage of the unique properties of
event-based vision sensors. Since event-based sensors trigger events only when
the intensity changes, the data is sparse, with low redundancy. Thus, our
approach redefines the well-known mean-shift clustering method using
asynchronous events instead of conventional frames. The potential of our
approach is demonstrated in a multi-target tracking application using Kalman
filters to smooth the trajectories. We evaluated our method on an existing
dataset with patterns of different shapes and speeds, and a new dataset that we
collected. The sensor was attached to the Baxter robot in an eye-in-hand setup
monitoring real-world objects in an action manipulation task. Clustering
accuracy achieved an F-measure of 0.95, reducing the computational cost by 88%
compared to the frame-based method. The average error for tracking was 2.5
pixels and the clustering achieved a consistent number of clusters along time.
| [{'version': 'v1', 'created': 'Sun, 8 Jul 2018 16:43:32 GMT'}] | 2018-07-11 | [['Barranco', 'Francisco', ''], ['Fermuller', 'Cornelia', ''], ['Ros', 'Eduardo', '']] |
2010.02417 | Ankit Pal | Ankit Pal, Malaikannan Sankarasubbu | Pay Attention to the cough: Early Diagnosis of COVID-19 using
Interpretable Symptoms Embeddings with Cough Sound Signal Processing | Preprint Version | null | null | null | cs.LG cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | COVID-19 (coronavirus disease 2019) pandemic caused by SARS-CoV-2 has led to
a treacherous and devastating catastrophe for humanity. At the time of writing,
no specific antivirus drugs or vaccines are recommended to control infection
transmission and spread. The current diagnosis of COVID-19 is done by
Reverse-Transcription Polymer Chain Reaction (RT-PCR) testing. However, this
method is expensive, time-consuming, and not easily available in straitened
regions. An interpretable and COVID-19 diagnosis AI framework is devised and
developed based on the cough sounds features and symptoms metadata to overcome
these limitations. The proposed framework's performance was evaluated using a
medical dataset containing Symptoms and Demographic data of 30000 audio
segments, 328 cough sounds from 150 patients with four cough classes (
COVID-19, Asthma, Bronchitis, and Healthy). Experiments' results show that the
model captures the better and robust feature embedding to distinguish between
COVID-19 patient coughs and several types of non-COVID-19 coughs with higher
specificity and accuracy of 95.04 $\pm$ 0.18% and 96.83$\pm$ 0.18%
respectively, all the while maintaining interpretability.
| [{'version': 'v1', 'created': 'Tue, 6 Oct 2020 01:22:50 GMT'}, {'version': 'v2', 'created': 'Mon, 12 Oct 2020 01:41:31 GMT'}] | 2020-10-13 | [['Pal', 'Ankit', ''], ['Sankarasubbu', 'Malaikannan', '']] |
1912.09571 | Samuel Alexander | Samuel Allen Alexander | Measuring the intelligence of an idealized mechanical knowing agent | 17 pages, CIFMA 2019 | null | null | null | cs.AI cs.LO math.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We define a notion of the intelligence level of an idealized mechanical
knowing agent. This is motivated by efforts within artificial intelligence
research to define real-number intelligence levels of complicated intelligent
systems. Our agents are more idealized, which allows us to define a much
simpler measure of intelligence level for them. In short, we define the
intelligence level of a mechanical knowing agent to be the supremum of the
computable ordinals that have codes the agent knows to be codes of computable
ordinals. We prove that if one agent knows certain things about another agent,
then the former necessarily has a higher intelligence level than the latter.
This allows our intelligence notion to serve as a stepping stone to obtain
results which, by themselves, are not stated in terms of our intelligence
notion (results of potential interest even to readers totally skeptical that
our notion correctly captures intelligence). As an application, we argue that
these results comprise evidence against the possibility of intelligence
explosion (that is, the notion that sufficiently intelligent machines will
eventually be capable of designing even more intelligent machines, which can
then design even more intelligent machines, and so on).
| [{'version': 'v1', 'created': 'Tue, 3 Dec 2019 02:03:00 GMT'}] | 2019-12-23 | [['Alexander', 'Samuel Allen', '']] |
1711.07277 | Mudasar Bacha | Mudasar Bacha and Bruno Clerckx | Backscatter Communications for the Internet of Things: A Stochastic
Geometry Approach | This work has been submitted for a possible journal publication | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Motivated by the recent advances in the Internet of Things (IoT) and in
Wireless Power Transfer (WPT), we study a network architecture that consists of
power beacons (PBs) and passive backscatter nodes (BNs). The PBs transmit a
sinusoidal continuous wave (CW) and the BNs reflect back a portion of this
signal while harvesting the remaining part. A BN harvests energy from multiple
nearby PBs and modulates its information bits on the composite CW through
backscatter modulation. The analysis poses real challenges due to the double
fading channel, and its dependence on the PPPs of both the BNs and PBs.
However, with the help of stochastic geometry, we derive the coverage
probability and the capacity of the network in tractable and easily computable
expressions, which depend on different system parameters. We observe that the
coverage probability decreases with an increase in the density of the BNs,
while the capacity of the network improves. We further compare the performance
of this network with a regular powered network in which the BNs have a reliable
power source and show that for a very high density of the PBs, the coverage
probability of the former network approaches that of the regular powered
network.
| [{'version': 'v1', 'created': 'Mon, 20 Nov 2017 12:12:45 GMT'}, {'version': 'v2', 'created': 'Tue, 17 Apr 2018 10:56:09 GMT'}] | 2018-04-18 | [['Bacha', 'Mudasar', ''], ['Clerckx', 'Bruno', '']] |
1306.5845 | Alexandr V. Kobelev | A.A. Bedulina, and A.V. Kobelev | Nonmonotonic Relaxation as a Result of Spatial Heterogeneity in the
Model of In-series Blocks Chain | 24 pages, 19 figures, 26 citations | null | null | null | nlin.AO cond-mat.soft physics.bio-ph physics.comp-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently the materials possessing structure of molecular and supramolecular
matrix are more and more actively studied. They are relative to many polymeric
materials of a technological origin, such as rubber, and living biological
tissues. Processes of mechanical deformation of these continuous media have
peculiarities connected, first, with accounting for internal friction and
dissipation of energy, and secondly, with nonlinearity of their elastic and
viscous properties, that is with violation of Hook and Newtons laws.
Traditional approaches to mechanics of viscoelastic bodies sometimes are
excessively difficult, and more evident and available representations are
necessary. The invaluable role in studying of the operating processes
mechanisms of elastic deformation and motility of biological materials is
played by the mathematical modeling. New effect obtained by means of computer
experiment of nonmonotonic relaxation of deformation in heterogeneous media is
considered in the present work. Rheological properties of described media are
governed by the differential equations of the first order on time (the
evolution equations), as well as a huge variety of other physical processes.
The physical phenomena in nonlinear systems with dissipation have a big
community, including such it would seem far areas, as dynamics of magnetization
in ferrite. Therefore the problem of studying new effects of viscous friction
in the conditions of nonlinearity and heterogeneity, is very actual as in
respect of fundamental research nonlinear and non-uniform environments, and in
many areas of materials science, design of new materials, engineering of
biological substitutes of living tissues and development of the micromagnetic
devices using essentially new opportunities.
| [{'version': 'v1', 'created': 'Tue, 25 Jun 2013 05:04:23 GMT'}, {'version': 'v2', 'created': 'Wed, 26 Jun 2013 10:02:34 GMT'}] | 2013-06-27 | [['Bedulina', 'A. A.', ''], ['Kobelev', 'A. V.', '']] |
2104.10963 | Yudong Lu | Yudong Lu, Yi Xu, Xu Ouyang, Mingcong Xian, Yaoyu Cao, Kai Chen, and
Xiangping Li | Cylindrical vector beams reveal radiationless anapole condition in a
resonant state | 11 pages, 5figures | Opto-Electron Adv 5, 210014 (2022) | 10.29026/oea.2022.210014 | null | physics.optics | http://creativecommons.org/licenses/by/4.0/ | Nonscattering optical anapole condition is corresponding to the excitation of
radiationless field distributions in open resonators, which offers new degrees
of freedom for tailoring light-matter interaction. Conventional mechanisms for
achieving such a condition relies on sophisticated manipulation of
electromagnetic multipolar moments of all orders to guarantee superpositions of
vanished moment strengths at the same wavelength. In contrast, here we report
on the excitation of optical radiationless anapole hidden in a resonant state
of a Si nanoparticle utilizing tightly focused radially polarized (RP) beam.
The coexistence of magnetic resonant state and anapole condition at the same
wavelength further enables the triggering of resonant state by tightly focused
azimuthally polarized (AP) beam whose corresponding electric multipole
coefficient could be zero. As a result, high contrast inter-transition between
radiationless anapole condition and ideal magnetic resonant scattering can be
achieved experimentally in visible spectrum. The proposed mechanism is general
which can be realized in different types of nanostructures. Our results
showcase that the unique combination of structured light and structured Mie
resonances could provide new degrees of freedom for tailoring light-matter
interaction, which might shed new light on functional meta-optics.
| [{'version': 'v1', 'created': 'Thu, 22 Apr 2021 09:47:34 GMT'}] | 2022-08-11 | [['Lu', 'Yudong', ''], ['Xu', 'Yi', ''], ['Ouyang', 'Xu', ''], ['Xian', 'Mingcong', ''], ['Cao', 'Yaoyu', ''], ['Chen', 'Kai', ''], ['Li', 'Xiangping', '']] |
2208.04691 | Ricardo Gallego Torrom\'e | Ricardo Gallego Torrom\'e | Enhancement in the mean square range delay accuracy by means of multiple
entangled photon states quantum illumination | 5 pages, 1 figure; minor corrections | null | null | null | quant-ph physics.app-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently it has been discussed how quantum illumination can be used to
increase the mean value range delay [1], that happens in the domain of SNR
compatible with current radar systems. However, from side of practical
applications, the advantage described in [1] requires of a large integration
time. In this letter it is shown how multiple entangled photon quantum
illumination helps to reduce the integration time when evaluating range delay.
For easiness, the analysis is conveyed in the setting of three entangled photon
states discrete quantum illumination models, but it is argued that our result
can be extended to quantum illumination continuous protocols.
| [{'version': 'v1', 'created': 'Sat, 30 Jul 2022 07:54:16 GMT'}, {'version': 'v2', 'created': 'Fri, 28 Oct 2022 14:25:11 GMT'}] | 2022-10-31 | [['Torromé', 'Ricardo Gallego', '']] |
1308.1326 | Thomas Akin | Sharon A. Kennedy, G. W. Biedermann, J. Tom Farrar, T. G. Akin, S.
Krzyzewski, E. R. I. Abraham | Confinement of ultracold atoms in a Laguerre-Gaussian laser beam created
with diffractive optics | null | null | 10.1016/j.optcom.2014.01.084 | null | physics.atom-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We report 2D confinement of Rb 87 atoms in a Laguerre-Gaussian laser beam.
Changing of the sign of the detuning from the atomic resonance dramatically
alters the geometry of the confinement. With the laser detuned to the blue, the
atoms are confined to the dark, central node of the Laguerre-Gaussian laser
mode. This trapping method leads to low ac Stark shifts to the atomic levels.
Alternatively, by detuning the laser to the red of the resonance, we confine
atoms to the high intensity outer ring in a multiply-connected, toroidal
configuration. We model the confined atoms to determine azimuthal intensity
variations of the trapping laser, caused by slight misalignments of the
Laguerre-Gaussian mode generating optics.
| [{'version': 'v1', 'created': 'Tue, 6 Aug 2013 16:13:50 GMT'}] | 2014-09-12 | [['Kennedy', 'Sharon A.', ''], ['Biedermann', 'G. W.', ''], ['Farrar', 'J. Tom', ''], ['Akin', 'T. G.', ''], ['Krzyzewski', 'S.', ''], ['Abraham', 'E. R. I.', '']] |
1612.03062 | Tilman Sauer | Tilman Sauer | A Look Back at the Ehrenfest Classification. Translation and Commentary
of Ehrenfest's 1933 paper introducing the notion of phase transitions of
different order | 13pp | null | 10.1140/epjst/e2016-60344-y | null | physics.hist-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A translation of Paul Ehrenfest's 1933 paper, entitled "Phase transitions in
the usual and generalized sense, classified according to the singularities of
the thermodynamic potential" is presented. Some historical commentary about the
paper's context is also given.
| [{'version': 'v1', 'created': 'Fri, 9 Dec 2016 15:37:35 GMT'}] | 2017-04-26 | [['Sauer', 'Tilman', '']] |
2103.07977 | Raveesh Garg | Raveesh Garg, Eric Qin, Francisco Mu\~noz-Mart\'inez, Robert Guirado,
Akshay Jain, Sergi Abadal, Jos\'e L. Abell\'an, Manuel E. Acacio, Eduard
Alarc\'on, Sivasankaran Rajamanickam, Tushar Krishna | Understanding the Design-Space of Sparse/Dense Multiphase GNN dataflows
on Spatial Accelerators | Accepted for publication at the 36th IEEE International Parallel &
Distributed Processing Symposium (IPDPS 2022) | null | null | null | cs.DC cs.AR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Graph Neural Networks (GNNs) have garnered a lot of recent interest because
of their success in learning representations from graph-structured data across
several critical applications in cloud and HPC. Owing to their unique compute
and memory characteristics that come from an interplay between dense and sparse
phases of computations, the emergence of reconfigurable dataflow (aka spatial)
accelerators offers promise for acceleration by mapping optimized dataflows
(i.e., computation order and parallelism) for both phases. The goal of this
work is to characterize and understand the design-space of dataflow choices for
running GNNs on spatial accelerators in order for mappers or design-space
exploration tools to optimize the dataflow based on the workload. Specifically,
we propose a taxonomy to describe all possible choices for mapping the dense
and sparse phases of GNN inference, spatially and temporally over a spatial
accelerator, capturing both the intra-phase dataflow and the inter-phase
(pipelined) dataflow. Using this taxonomy, we do deep-dives into the cost and
benefits of several dataflows and perform case studies on implications of
hardware parameters for dataflows and value of flexibility to support pipelined
execution.
| [{'version': 'v1', 'created': 'Sun, 14 Mar 2021 17:14:13 GMT'}, {'version': 'v2', 'created': 'Fri, 24 Sep 2021 12:29:30 GMT'}, {'version': 'v3', 'created': 'Mon, 7 Mar 2022 01:17:27 GMT'}] | 2022-03-08 | [['Garg', 'Raveesh', ''], ['Qin', 'Eric', ''], ['Muñoz-Martínez', 'Francisco', ''], ['Guirado', 'Robert', ''], ['Jain', 'Akshay', ''], ['Abadal', 'Sergi', ''], ['Abellán', 'José L.', ''], ['Acacio', 'Manuel E.', ''], ['Alarcón', 'Eduard', ''], ['Rajamanickam', 'Sivasankaran', ''], ['Krishna', 'Tushar', '']] |
2106.06395 | Yuxing Bai | Xiaolei Hao, Yuxing Bai, Chan Li, Jingyu Zhang, Weidong Li, Weifeng
Yang, MingQing Liu and Jing Chen | Recollision of excited electron in below-threshold nonsequential double
ionization | null | null | null | null | physics.atom-ph physics.optics | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Consensus has been reached that recollision, as the most important
post-tunneling process, is responsible for nonsequential double ionization
process in intense infrared laser field, however, its effect has been
restricted to interaction between the first ionized electron and the residual
univalent ion so far. Here we identify the key role of recollision between the
second ionized electron and the divalent ion in the below-threshold
nonsequential double ionization process by introducing a Coulomb-corrected
quantum-trajectories method, which enables us to well reproduce the
experimentally observed cross-shaped and anti-correlated patterns in correlated
two-electron momentum distributions, and also the transition between these two
patterns. Being significantly enhanced relatively by the recapture process,
recolliding trajectories of the second electron excited by the first- or
third-return recolliding trajectories of the first electron produce the
cross-shaped or anti-correlated distributions, respectively. And the transition
is induced by the increasing contribution of the third return with increasing
pulse duration. Our work provides new insight into atomic ionization dynamics
and paves the new way to imaging of ultrafast dynamics of atoms and molecules
in intense laser field.
| [{'version': 'v1', 'created': 'Fri, 11 Jun 2021 13:53:52 GMT'}] | 2021-06-14 | [['Hao', 'Xiaolei', ''], ['Bai', 'Yuxing', ''], ['Li', 'Chan', ''], ['Zhang', 'Jingyu', ''], ['Li', 'Weidong', ''], ['Yang', 'Weifeng', ''], ['Liu', 'MingQing', ''], ['Chen', 'Jing', '']] |
2012.00352 | Kai Niklas Hansmann | Kai Niklas Hansmann and Reinhold Walser | Stochastic Simulation of Emission Spectra and Classical Photon
Statistics of Quantum Dot Superluminescent Diodes | 10 pages, 5 figures | Journal of Modern Physics, 12, 22-34 (2021) | 10.4236/jmp.2021.121003 | null | physics.optics | http://creativecommons.org/licenses/by/4.0/ | We present a stochastic procedure to investigate the correlation spectra of
quantum dot superluminescent diodes. The classical electric field of a diode is
formed by a polychromatic superposition of many independent stochastic
oscillators. Assuming fields with individual carrier frequencies, Lorentzian
linewidths and amplitudes we can form any relevant experimental spectrum using
a least square fit. This is illustrated for Gaussian and Lorentzian spectra,
Voigt profiles and box shapes. Eventually, the procedure is applied to an
experimental spectrum of a quantum dot superluminescent diode which determines
the first- and second-order temporal correlation functions of the emission. We
find good agreement with the experimental data and a quantized treatment. Thus,
a stochastic field represents broadband light emitted by quantum dot
superluminescent diodes.
| [{'version': 'v1', 'created': 'Tue, 1 Dec 2020 09:27:54 GMT'}] | 2021-01-19 | [['Hansmann', 'Kai Niklas', ''], ['Walser', 'Reinhold', '']] |
cond-mat/0406137 | Andreea Munteanu | Ricard V. Sole and Andreea Munteanu | The large-scale organization of chemical reaction networks in
astrophysics | 7 pages, 3 figures; submitted to Europhysics Letters | null | 10.1209/epl/i2004-10241-3 | null | cond-mat.dis-nn physics.ao-ph | null | The large-scale organization of complex networks, both natural and
artificial, has shown the existence of highly heterogeneous patterns of
organization. Such patterns typically involve scale-free degree distributions
and small world, modular architectures. One example is provided by chemical
reaction networks, such as the metabolic pathways. The chemical reactions of
the Earth's atmosphere have also been shown to give rise to a scale-free
network. Here we present novel data analysis on the structure of several
astrophysical networks including the chemistry of the planetary atmospheres and
the interstellar medium. Our work reveals that Earth's atmosphere displays a
hierarchical organization, close to the one observed in cellular webs. Instead,
the other astrophysical reaction networks reveal a much simpler pattern
consistent with an equilibrium state. The implications for large-scale
regulation of the planetary dynamics are outlined.
| [{'version': 'v1', 'created': 'Sat, 5 Jun 2004 15:52:40 GMT'}] | 2009-11-10 | [['Sole', 'Ricard V.', ''], ['Munteanu', 'Andreea', '']] |
2005.02783 | Johno van IJsseldijk | Johno van IJsseldijk and Kees Wapenaar | Adaptation of the iterative Marchenko scheme for imperfectly sampled
data | arXiv admin note: text overlap with arXiv:2003.10802 | Geophysical Journal International, Volume 224, Issue 1, January
2021, Pages 326 336 | 10.1093/gji/ggaa463 | null | physics.geo-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Marchenko method retrieves the responses to virtual sources in the
Earth's subsurface from reflection data at the surface, accounting for all
orders of multiple reflections. The method is based on two integral
representations for focusing- and Green's functions. In discretized form, these
integrals are represented by finite summations over the acquisition geometry.
Consequently, the method requires ideal geometries of regularly sampled and
co-located sources and receivers. Recently new representations were derived,
which handle imperfectly sampled data. These new representations use
point-spread functions (PSFs) that reconstruct results as if they were acquired
using a perfect geometry. Here, the iterative Marchenko scheme is adapted,
using these new representations, to account for imperfect sampling. This new
methodology is tested on a 2D numerical example. The results show clear
improvement between the proposed scheme and the standard iterative scheme. By
removing the requirement for perfect geometries, the Marchenko method can be
more widely applied to field data.
| [{'version': 'v1', 'created': 'Wed, 22 Apr 2020 08:47:58 GMT'}, {'version': 'v2', 'created': 'Tue, 24 Nov 2020 08:45:35 GMT'}] | 2020-11-25 | [['van IJsseldijk', 'Johno', ''], ['Wapenaar', 'Kees', '']] |
2205.01393 | Zhicheng Zhang | Zhicheng Zhang, Sha Wang, and Jun Wang | Noise-like Pulses from an All-Normal-Dispersion Fiber Laser with
Weakened Spectrum Filtering | The description in the text is not very appropriate and needs to be
modified | null | null | null | physics.optics nlin.PS | http://creativecommons.org/licenses/by/4.0/ | Noise-like pulses (NLP) are extremely sought after in many fields. Here, we
experimentally and numerically investigated the generation of noise-like pulses
in an all-normal-dispersion fiber laser with weak spectrum filtering. With the
insertion of the grating as a tunable spectrum filter, the laser operates at a
stable dissipative soliton state with a 3.84 ps duration. Replacing the grating
with a mirror, NLPs with double-scale intensity autocorrelation trace is
ultimately attained. Numerical simulations are performed in detail and
demonstrated that with the absence of a spectrum filter, the stable state
cannot be established but form the random pulse cluster. The random pulse
cluster achieves dynamic stability with suitable feedback, and the NLP is
ultimately generated. The NLP here is directly evolved by the initial noise,
and no other states occur during its evolution. These explorations could deepen
the understanding of NLP and enrich the complex dynamics of the ANDi ultrafast
fiber laser.
| [{'version': 'v1', 'created': 'Tue, 3 May 2022 09:49:51 GMT'}, {'version': 'v2', 'created': 'Mon, 30 May 2022 04:10:38 GMT'}] | 2022-05-31 | [['Zhang', 'Zhicheng', ''], ['Wang', 'Sha', ''], ['Wang', 'Jun', '']] |
1107.3490 | Michael Bachmann | Jonathan Gro{\ss}, Wolfhard Janke, and Michael Bachmann | Massively parallelized replica-exchange simulations of polymers on GPUs | 8 pages, 9 figures, 2 tables | Comp. Phys. Commun. 182, 1638-1644 (2011) | 10.1016/j.cpc.2011.04.012 | null | physics.comp-ph cond-mat.stat-mech q-bio.BM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We discuss the advantages of parallelization by multithreading on graphics
processing units (GPUs) for parallel tempering Monte Carlo computer simulations
of an exemplified bead-spring model for homopolymers. Since the sampling of a
large ensemble of conformations is a prerequisite for the precise estimation of
statistical quantities such as typical indicators for conformational
transitions like the peak structure of the specific heat, the advantage of a
strong increase in performance of Monte Carlo simulations cannot be
overestimated. Employing multithreading and utilizing the massive power of the
large number of cores on GPUs, being available in modern but standard graphics
cards, we find a rapid increase in efficiency when porting parts of the code
from the central processing unit (CPU) to the GPU.
| [{'version': 'v1', 'created': 'Mon, 18 Jul 2011 16:10:52 GMT'}] | 2015-05-28 | [['Groß', 'Jonathan', ''], ['Janke', 'Wolfhard', ''], ['Bachmann', 'Michael', '']] |
quant-ph/0412112 | Fabian Brau | Mary Alberg, Michel Bawin and Fabian Brau | Renormalization of the singular attractive $1/r^4$ potential | 8 pages | Phys. Rev. A 71, 022108 (2005) | 10.1103/PhysRevA.71.022108 | null | quant-ph math-ph math.MP physics.atm-clus | null | We study the radial Schr\"odinger equation for a particle of mass $m$ in the
field of a singular attractive $g^2/{r^4}$ potential with particular emphasis
on the bound states problem. Using the regularization method of Beane
\textit{et al.}, we solve analytically the corresponding ``renormalization
group flow" equation. We find in agreement with previous studies that its
solution exhibits a limit cycle behavior and has infinitely many branches. We
show that a continuous choice for the solution corresponds to a given fixed
number of bound states and to low energy phase shifts that vary continuously
with energy. We study in detail the connection between this regularization
method and a conventional method modifying the short range part of the
potential with an infinitely repulsive hard core. We show that both methods
yield bound states results in close agreement even though the regularization
method of Beane \textit{et al.} does not include explicitly any new scale in
the problem. We further illustrate the use of the regularization method in the
computation of electron bound states in the field of neutral polarizable
molecules without dipole moment. We find the binding energy of s-wave
polarization bound electrons in the field of C$_{60}$ molecules to be 17 meV
for a scattering length corresponding to a hard core radius of the size of the
molecule radius ($\sim 3.37$ \AA). This result can be further compared with
recent two-parameter fits using the Lennard-Jones potential yielding binding
energies ranging from 3 to 25 meV.
| [{'version': 'v1', 'created': 'Tue, 14 Dec 2004 12:45:56 GMT'}] | 2007-05-23 | [['Alberg', 'Mary', ''], ['Bawin', 'Michel', ''], ['Brau', 'Fabian', '']] |
1003.3743 | Laurent Labonte | Laurent Labont\'e (LPMC), Vipul Rastogi, A. Kumar, Bernard Dussardier
(LPMC), G\'erard Monnom (LPMC) | Birefringence analysis of multilayer leaky cladding optical fibre | 18 pages | Journal of Optics (2010) J. Opt. 12 (2010) 065705 (4pp) | 10.1088/2040-8978/12/6/065705 | null | physics.optics | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We analyse a multilayer leaky cladding (MLC) fibre using the finite element
method and study the effect of the MLC on the bending loss and birefringence of
two types of structures: (i) a circular core large-mode-area structure and (ii)
an elliptical-small-core structure. In a large-mode-area structure, we verify
that the multilayer leaky cladding strongly discriminates against higher order
modes to achieve single-mode operation, the fibre shows negligible
birefringence, and the bending loss of the fibre is low for bending radii
larger than 10 cm. In the elliptical-small-core structure we show that the MLC
reduces the birefringence of the fibre. This prevents the structure from
becoming birefringent in case of any departures from circular geometry. The
study should be useful in the designs of MLC fibres for various applications
including high power amplifiers, gain flattening of fibre amplifiers and
dispersion compensation.
| [{'version': 'v1', 'created': 'Fri, 19 Mar 2010 08:41:07 GMT'}, {'version': 'v2', 'created': 'Sat, 14 Aug 2010 20:22:22 GMT'}] | 2015-05-18 | [['Labonté', 'Laurent', '', 'LPMC'], ['Rastogi', 'Vipul', '', 'LPMC'], ['Kumar', 'A.', '', 'LPMC'], ['Dussardier', 'Bernard', '', 'LPMC'], ['Monnom', 'Gérard', '', 'LPMC']] |
1909.09393 | Ryoma Sin'ya | Ryoma Sin'ya | Simple proof of Parikh's theorem a la Takahashi | null | null | null | null | cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this report we describe a simple proof of Parikh's theorem a la Takahashi,
based on a decomposition of derivation trees. The idea of decomposition is
appeared in her master's thesis written in 1970.
| [{'version': 'v1', 'created': 'Fri, 20 Sep 2019 09:50:37 GMT'}] | 2019-09-23 | [["Sin'ya", 'Ryoma', '']] |
1005.5585 | Miao Rongxin | Rong-Xin Miao, Rui Zheng and Miao Li | Metamaterials Mimicking Dynamic Spacetime, D-brane and Noncommutativity
in String Theory | 15 pages, 2 figures | Phys.Lett.B696:550-555,2011 | 10.1016/j.physletb.2011.01.016 | USTC-ICTS-10-24 | physics.optics cond-mat.mtrl-sci hep-th | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose an executable scheme to mimic the expanding cosmos in 1+2
dimensions in laboratory. Furthermore, we develop a general procedure to use
nonlinear metamaterials to mimic D-brane and noncommutativity in string theory.
| [{'version': 'v1', 'created': 'Mon, 31 May 2010 04:55:47 GMT'}, {'version': 'v2', 'created': 'Thu, 3 Feb 2011 08:42:42 GMT'}] | 2011-03-04 | [['Miao', 'Rong-Xin', ''], ['Zheng', 'Rui', ''], ['Li', 'Miao', '']] |
0909.4789 | Michael J. Kurtz | Michael J. Kurtz, Guenther Eichhorn, Alberto Accomazzi, Carolyn S.
Grant, Markus Demleitner, Stephen S. Murray, Nathalie Martimbeau, Barbara
Elwell | The Bibliometric Properties of Article Readership Information | ADS bibcode: 2005JASIS..56..111K This is the second paper (the first
is Worldwide Use and Impact of the NASA Astrophysics Data System Digital
Library) from the original article The NASA Astrophysics Data System:
Sociology, Bibliometrics, and Impact, which went on-line in the summer of
2003 | The Journal of the American Society for Information Science and
Technology, Vol. 56, p. 111 (2005) | 10.1002/asi.20096 | null | cs.DL physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The NASA Astrophysics Data System (ADS), along with astronomy's journals and
data centers (a collaboration dubbed URANIA), has developed a distributed
on-line digital library which has become the dominant means by which
astronomers search, access and read their technical literature. Digital
libraries such as the NASA Astrophysics Data System permit the easy
accumulation of a new type of bibliometric measure, the number of electronic
accesses (``reads'') of individual articles. We explore various aspects of this
new measure. We examine the obsolescence function as measured by actual reads,
and show that it can be well fit by the sum of four exponentials with very
different time constants. We compare the obsolescence function as measured by
readership with the obsolescence function as measured by citations. We find
that the citation function is proportional to the sum of two of the components
of the readership function. This proves that the normative theory of citation
is true in the mean. We further examine in detail the similarities and
differences between the citation rate, the readership rate and the total
citations for individual articles, and discuss some of the causes. Using the
number of reads as a bibliometric measure for individuals, we introduce the
read-cite diagram to provide a two-dimensional view of an individual's
scientific productivity. We develop a simple model to account for an
individual's reads and cites and use it to show that the position of a person
in the read-cite diagram is a function of age, innate productivity, and work
history. We show the age biases of both reads and cites, and develop two new
bibliometric measures which have substantially less age bias than citations
| [{'version': 'v1', 'created': 'Fri, 25 Sep 2009 20:29:52 GMT'}] | 2009-09-30 | [['Kurtz', 'Michael J.', ''], ['Eichhorn', 'Guenther', ''], ['Accomazzi', 'Alberto', ''], ['Grant', 'Carolyn S.', ''], ['Demleitner', 'Markus', ''], ['Murray', 'Stephen S.', ''], ['Martimbeau', 'Nathalie', ''], ['Elwell', 'Barbara', '']] |
2202.04868 | Zehao Dou | Zehao Dou, Jakub Grudzien Kuba, Yaodong Yang | Understanding Value Decomposition Algorithms in Deep Cooperative
Multi-Agent Reinforcement Learning | 37 pages | null | null | null | cs.LG cs.AI stat.ML | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Value function decomposition is becoming a popular rule of thumb for scaling
up multi-agent reinforcement learning (MARL) in cooperative games. For such a
decomposition rule to hold, the assumption of the individual-global max (IGM)
principle must be made; that is, the local maxima on the decomposed value
function per every agent must amount to the global maximum on the joint value
function. This principle, however, does not have to hold in general. As a
result, the applicability of value decomposition algorithms is concealed and
their corresponding convergence properties remain unknown. In this paper, we
make the first effort to answer these questions. Specifically, we introduce the
set of cooperative games in which the value decomposition methods find their
validity, which is referred as decomposable games. In decomposable games, we
theoretically prove that applying the multi-agent fitted Q-Iteration algorithm
(MA-FQI) will lead to an optimal Q-function. In non-decomposable games, the
estimated Q-function by MA-FQI can still converge to the optimum under the
circumstance that the Q-function needs projecting into the decomposable
function space at each iteration. In both settings, we consider value function
representations by practical deep neural networks and derive their
corresponding convergence rates. To summarize, our results, for the first time,
offer theoretical insights for MARL practitioners in terms of when value
decomposition algorithms converge and why they perform well.
| [{'version': 'v1', 'created': 'Thu, 10 Feb 2022 06:59:08 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Feb 2022 03:17:57 GMT'}] | 2022-02-17 | [['Dou', 'Zehao', ''], ['Kuba', 'Jakub Grudzien', ''], ['Yang', 'Yaodong', '']] |
2109.08231 | Adarsh Kosta | Adarsh Kumar Kosta, Malik Aqeel Anwar, Priyadarshini Panda, Arijit
Raychowdhury, and Kaushik Roy | RAPID-RL: A Reconfigurable Architecture with Preemptive-Exits for
Efficient Deep-Reinforcement Learning | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Present-day Deep Reinforcement Learning (RL) systems show great promise
towards building intelligent agents surpassing human-level performance.
However, the computational complexity associated with the underlying deep
neural networks (DNNs) leads to power-hungry implementations. This makes deep
RL systems unsuitable for deployment on resource-constrained edge devices. To
address this challenge, we propose a reconfigurable architecture with
preemptive exits for efficient deep RL (RAPID-RL). RAPID-RL enables conditional
activation of DNN layers based on the difficulty level of inputs. This allows
to dynamically adjust the compute effort during inference while maintaining
competitive performance. We achieve this by augmenting a deep Q-network (DQN)
with side-branches capable of generating intermediate predictions along with an
associated confidence score. We also propose a novel training methodology for
learning the actions and branch confidence scores in a dynamic RL setting. Our
experiments evaluate the proposed framework for Atari 2600 gaming tasks and a
realistic Drone navigation task on an open-source drone simulator (PEDRA). We
show that RAPID-RL incurs 0.34x (0.25x) number of operations (OPS) while
maintaining performance above 0.88x (0.91x) on Atari (Drone navigation) tasks,
compared to a baseline-DQN without any side-branches. The reduction in OPS
leads to fast and efficient inference, proving to be highly beneficial for the
resource-constrained edge where making quick decisions with minimal compute is
essential.
| [{'version': 'v1', 'created': 'Thu, 16 Sep 2021 21:30:40 GMT'}] | 2021-09-20 | [['Kosta', 'Adarsh Kumar', ''], ['Anwar', 'Malik Aqeel', ''], ['Panda', 'Priyadarshini', ''], ['Raychowdhury', 'Arijit', ''], ['Roy', 'Kaushik', '']] |
2111.06076 | Yoshio Torii | Takumi Sato, Yusuke Hayakawa, Naohiro Okamoto, Yusuke Shimomura,
Takatoshi Aoki, Yoshio Torii | Birefringent atomic vapor laser lock in a hollow cathode lamp | null | J. Opt. Soc. Am. B 39, 155-159 (2022) | 10.1364/JOSAB.442465 | null | physics.atom-ph | http://creativecommons.org/licenses/by-nc-nd/4.0/ | We report a robust method of stabilizing a laser to the frequency of an
atomic transition using a hollow cathode lamp. In contrast to the standard
dichroic atomic vapor laser lock (DAVLL) method, which uses dichroism induced
by a longitudinal magnetic field, we employ birefringence induced by a
transversal magnetic field. We applied this method to the $(5s^2)\ {}^{1}S_{0}
- (5s5p)\ {}^{1}P_{1}$ transition (461 nm) of Sr. Although the hollow cathode
is made of ferromagnetic material, we successfully applied a magnetic field of
sufficient strength to obtain an error signal with a theoretical maximum slope.
This method may be applied to other hollow cathode lamps of different atomic
species.
| [{'version': 'v1', 'created': 'Thu, 11 Nov 2021 06:59:04 GMT'}] | 2021-12-14 | [['Sato', 'Takumi', ''], ['Hayakawa', 'Yusuke', ''], ['Okamoto', 'Naohiro', ''], ['Shimomura', 'Yusuke', ''], ['Aoki', 'Takatoshi', ''], ['Torii', 'Yoshio', '']] |
2203.15501 | Yogachandran Rahulamathavan | Madushi H. Pathmaperuma and Yogachandran Rahulamathavan and Safak
Dogan and Ahmet M. Kondoz, and Rongxing Lu | Deep Learning for Encrypted Traffic Classification and Unknown Data
Detection | null | null | null | null | cs.CR cs.AI cs.LG cs.NI | http://creativecommons.org/licenses/by-sa/4.0/ | Despite the widespread use of encryption techniques to provide
confidentiality over Internet communications, mobile device users are still
susceptible to privacy and security risks. In this paper, a new Deep Neural
Network (DNN) based user activity detection framework is proposed to identify
fine grained user activities performed on mobile applications (known as in-app
activities) from a sniffed encrypted Internet traffic stream. One of the
challenges is that there are countless applications, and it is practically
impossible to collect and train a DNN model using all possible data from them.
Therefore, in this work we exploit the probability distribution of DNN output
layer to filter the data from applications that are not considered during the
model training (i.e., unknown data). The proposed framework uses a time window
based approach to divide the traffic flow of an activity into segments, so that
in-app activities can be identified just by observing only a fraction of the
activity related traffic. Our tests have shown that the DNN based framework has
demonstrated an accuracy of 90% or above in identifying previously trained
in-app activities and an average accuracy of 79% in identifying previously
untrained in-app activity traffic as unknown data when this framework is
employed.
| [{'version': 'v1', 'created': 'Fri, 25 Mar 2022 10:55:18 GMT'}] | 2022-03-30 | [['Pathmaperuma', 'Madushi H.', ''], ['Rahulamathavan', 'Yogachandran', ''], ['Dogan', 'Safak', ''], ['Kondoz', 'Ahmet M.', ''], ['Lu', 'Rongxing', '']] |
1404.6125 | Cheng Yaping | Yaping Cheng, Sen Qian, Zhe Ning, Jingkai Xia, Wenwen Wang, Yifang
Wang, Jun Cao, Xiaoshan Jiang, Zheng Wang, Xiaonan Li, Ming Qi, Yuekun Heng,
Shulin Liu, Xiangcui Lei, Zhi Wu | The high-speed after pulse measurement system for PMT | null | null | null | null | physics.ins-det hep-ex | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A system employing a desktop FADC has been developed to investigate the
features of 8 inches Hamamatsu PMT. The system stands out for its high-speed
and informative results as a consequence of adopting fast waveform sampling
technology. Recording full waveforms allows us to perform digital signal
processing, pulse shape analysis, and precision timing extraction. High
precision after pulse time and charge distribution characteristics are
presented in this manuscript. Other photomultipliers characteristics, such as
dark rate and transit time spread, can also be obtained by exploiting waveform
analysis using this system.
| [{'version': 'v1', 'created': 'Thu, 24 Apr 2014 14:08:42 GMT'}] | 2014-04-25 | [['Cheng', 'Yaping', ''], ['Qian', 'Sen', ''], ['Ning', 'Zhe', ''], ['Xia', 'Jingkai', ''], ['Wang', 'Wenwen', ''], ['Wang', 'Yifang', ''], ['Cao', 'Jun', ''], ['Jiang', 'Xiaoshan', ''], ['Wang', 'Zheng', ''], ['Li', 'Xiaonan', ''], ['Qi', 'Ming', ''], ['Heng', 'Yuekun', ''], ['Liu', 'Shulin', ''], ['Lei', 'Xiangcui', ''], ['Wu', 'Zhi', '']] |
0902.3115 | Jacques Vincent | V. Jacques, B. Hingant, A. Allafort, M. Pigeard and J.-F. Roch | Non-linear spectroscopy of rubidium: An undergraduate experiment | 16 pages, 8 figures | null | 10.1088/0143-0807/30/5/001 | null | physics.ed-ph physics.atom-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we describe two complementary non-linear spectroscopy methods
which both allow to achieve Doppler-free spectra of atomic gases. First,
saturated absorption spectroscopy is used to investigate the structure of the
$5{\rm S}_{1/2}\to 5{\rm P}_{3/2}$ transition in rubidium. Using a slightly
modified experimental setup, Doppler-free two-photon absorption spectroscopy is
then performed on the $5{\rm S}_{1/2}\to 5{\rm D}_{5/2}$ transition in
rubidium, leading to accurate measurements of the hyperfine structure of the
$5{\rm D}_{5/2}$ energy level. In addition, electric dipole selection rules of
the two-photon transition are investigated, first by modifying the polarization
of the excitation laser, and then by measuring two-photon absorption spectra
when a magnetic field is applied close to the rubidium vapor. All experiments
are performed with the same grating-feedback laser diode, providing an
opportunity to compare different high resolution spectroscopy methods using a
single experimental setup. Such experiments may acquaint students with quantum
mechanics selection rules, atomic spectra and Zeeman effect.
| [{'version': 'v1', 'created': 'Wed, 18 Feb 2009 12:31:59 GMT'}] | 2015-05-13 | [['Jacques', 'V.', ''], ['Hingant', 'B.', ''], ['Allafort', 'A.', ''], ['Pigeard', 'M.', ''], ['Roch', 'J. -F.', '']] |
1509.07671 | Sathyanarayana Paladugu | Domenico Alj, Sathyanarayana Paladugu, Giovanni Volpe, Roberto Caputo
and Cesare Umeton | Polar POLICRYPS Diffractive Structures Generate Cylindrical Vector Beams | 4 pages, 5 figures | null | null | null | physics.optics cond-mat.soft | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Local shaping of the polarization state of a light beam is appealing for a
number of applications. This can be achieved by employing devices containing
birefringent materials. In this article, we present one such device that
permits one to convert a uniformly circularly polarized beam into a cylindrical
vector beam (CVB). This device has been fabricated by exploiting the POLICRYPS
photocuring technique. It is a liquid-crystal-based optical diffraction grating
featuring polar symmetry of the director alignment. We have characterized the
resulting CVB profile and polarization for the cases of left and right
circularly polarized incoming beams.
| [{'version': 'v1', 'created': 'Fri, 25 Sep 2015 10:57:33 GMT'}] | 2015-09-28 | [['Alj', 'Domenico', ''], ['Paladugu', 'Sathyanarayana', ''], ['Volpe', 'Giovanni', ''], ['Caputo', 'Roberto', ''], ['Umeton', 'Cesare', '']] |
1704.08760 | Srinivasan Iyer | Srinivasan Iyer, Ioannis Konstas, Alvin Cheung, Jayant Krishnamurthy,
Luke Zettlemoyer | Learning a Neural Semantic Parser from User Feedback | Accepted at ACL 2017 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present an approach to rapidly and easily build natural language
interfaces to databases for new domains, whose performance improves over time
based on user feedback, and requires minimal intervention. To achieve this, we
adapt neural sequence models to map utterances directly to SQL with its full
expressivity, bypassing any intermediate meaning representations. These models
are immediately deployed online to solicit feedback from real users to flag
incorrect queries. Finally, the popularity of SQL facilitates gathering
annotations for incorrect predictions using the crowd, which is directly used
to improve our models. This complete feedback loop, without intermediate
representations or database specific engineering, opens up new ways of building
high quality semantic parsers. Experiments suggest that this approach can be
deployed quickly for any new target domain, as we show by learning a semantic
parser for an online academic database from scratch.
| [{'version': 'v1', 'created': 'Thu, 27 Apr 2017 22:05:06 GMT'}] | 2017-05-01 | [['Iyer', 'Srinivasan', ''], ['Konstas', 'Ioannis', ''], ['Cheung', 'Alvin', ''], ['Krishnamurthy', 'Jayant', ''], ['Zettlemoyer', 'Luke', '']] |
1711.11245 | Alexei Cheviakov | Ryan J. Thiessen and Alexei F. Cheviakov | Nonlinear Dynamics of a Viscous Bubbly Fluid | null | null | null | null | physics.flu-dyn math-ph math.MP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A physical model of a three-dimensional flow of a viscous bubbly fluid in an
intermediate regime between bubble formation and breakage is presented. The
model is based on mechanics and thermodynamics of a single bubble coupled to
the dynamics of a viscous fluid as a whole, and takes into account multiple
physical effects, including gravity, viscosity, and surface tension.
Dimensionless versions of the resulting nonlinear model are obtained, and
values of dimensionless parameters are estimated for typical magma flows in
horizontal subaerial lava fields and vertical volcanic conduits.
Exact solutions of the resulting system of nonlinear equations corresponding
to equilibrium flows and traveling waves are analyzed in the one-dimensional
setting. Generalized Su-Gardner-type perturbation analysis is employed to study
approximate solutions of the model in the long-wave ansatz. Simplified
nonlinear partial differential equations (PDE) satisfied by the leading terms
of the perturbation solutions are systematically derived. It is shown that for
specific classes of perturbations, approximate solutions of the bubbly fluid
model arise from solutions of the classical diffusion, Burgers,
variable-coefficient Burgers, and Korteweg-de Vries equations.
| [{'version': 'v1', 'created': 'Thu, 30 Nov 2017 05:49:35 GMT'}, {'version': 'v2', 'created': 'Wed, 5 Sep 2018 21:53:32 GMT'}, {'version': 'v3', 'created': 'Sat, 5 Jan 2019 05:30:22 GMT'}] | 2019-01-08 | [['Thiessen', 'Ryan J.', ''], ['Cheviakov', 'Alexei F.', '']] |
1810.02180 | Idan Attias | Idan Attias, Aryeh Kontorovich, Yishay Mansour | Improved Generalization Bounds for Adversarially Robust Learning | JMLR camera ready | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider a model of robust learning in an adversarial environment. The
learner gets uncorrupted training data with access to possible corruptions that
may be affected by the adversary during testing. The learner's goal is to build
a robust classifier, which will be tested on future adversarial examples. The
adversary is limited to $k$ possible corruptions for each input. We model the
learner-adversary interaction as a zero-sum game. This model is closely related
to the adversarial examples model of Schmidt et al. (2018); Madry et al.
(2017).
Our main results consist of generalization bounds for the binary and
multiclass classification, as well as the real-valued case (regression). For
the binary classification setting, we both tighten the generalization bound of
Feige et al. (2015), and are also able to handle infinite hypothesis classes.
The sample complexity is improved from
$O(\frac{1}{\epsilon^4}\log(\frac{|H|}{\delta}))$ to
$O\big(\frac{1}{\epsilon^2}(kVC(H)\log^{\frac{3}{2}+\alpha}(kVC(H))+\log(\frac{1}{\delta})\big)$
for any $\alpha > 0$. Additionally, we extend the algorithm and generalization
bound from the binary to the multiclass and real-valued cases. Along the way,
we obtain results on fat-shattering dimension and Rademacher complexity of
$k$-fold maxima over function classes; these may be of independent interest.
For binary classification, the algorithm of Feige et al. (2015) uses a regret
minimization algorithm and an ERM oracle as a black box; we adapt it for the
multiclass and regression settings. The algorithm provides us with near-optimal
policies for the players on a given training sample.
| [{'version': 'v1', 'created': 'Thu, 4 Oct 2018 12:53:41 GMT'}, {'version': 'v2', 'created': 'Sat, 2 Mar 2019 12:29:30 GMT'}, {'version': 'v3', 'created': 'Sun, 29 Nov 2020 12:08:06 GMT'}, {'version': 'v4', 'created': 'Mon, 22 Feb 2021 22:28:57 GMT'}, {'version': 'v5', 'created': 'Fri, 1 Jul 2022 13:27:13 GMT'}] | 2022-07-04 | [['Attias', 'Idan', ''], ['Kontorovich', 'Aryeh', ''], ['Mansour', 'Yishay', '']] |
2301.11560 | Haiyan Zhao | Haiyan Zhao, Tianyi Zhou, Guodong Long, Jing Jiang, Chengqi Zhang | Voting from Nearest Tasks: Meta-Vote Pruning of Pre-trained Models for
Downstream Tasks | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As a few large-scale pre-trained models become the major choices of various
applications, new challenges arise for model pruning, e.g., can we avoid
pruning the same model from scratch for every downstream task? How to reuse the
pruning results of previous tasks to accelerate the pruning for a new task? To
address these challenges, we create a small model for a new task from the
pruned models of similar tasks. We show that a few fine-tuning steps on this
model suffice to produce a promising pruned-model for the new task. We study
this ''meta-pruning'' from nearest tasks on two major classes of pre-trained
models, convolutional neural network (CNN) and vision transformer (ViT), under
a limited budget of pruning iterations. Our study begins by investigating the
overlap of pruned models for similar tasks and how the overlap changes over
different layers and blocks. Inspired by these discoveries, we develop a simple
but effective ''Meta-Vote Pruning (MVP)'' method that significantly reduces the
pruning iterations for a new task by initializing a sub-network from the pruned
models of its nearest tasks. In experiments, we demonstrate MVP's advantages in
accuracy, efficiency, and generalization through extensive empirical studies
and comparisons with popular pruning methods over several datasets.
| [{'version': 'v1', 'created': 'Fri, 27 Jan 2023 06:49:47 GMT'}] | 2023-01-30 | [['Zhao', 'Haiyan', ''], ['Zhou', 'Tianyi', ''], ['Long', 'Guodong', ''], ['Jiang', 'Jing', ''], ['Zhang', 'Chengqi', '']] |
2108.04425 | Sergey Kruk | Sergey Kruk, Lei Wang, Basudeb Sain, Zhaogang Dong, Joel Yang, Thomas
Zentgraf, Yuri Kivshar | Asymmetric parametric generation of images with nonlinear dielectric
metasurfaces | Nat. Photon. (2022) | null | 10.1038/s41566-022-01018-7 | null | physics.optics | http://creativecommons.org/licenses/by/4.0/ | Subwavelength dielectric resonators assembled into metasurfaces have become a
versatile tool for miniaturising optical components approaching the nanoscale.
An important class of metasurface functionalities is associated with asymmetry
in both generation and transmission of light with respect to reversals of the
positions of emitters and receivers. Nonlinear light-matter interaction in
metasurfaces offers a promising pathway towards miniaturisation of the
asymmetric control of light. Here we demonstrate asymmetric parametric
generation of light in nonlinear metasurfaces. We assemble dissimilar nonlinear
dielectric resonators into translucent metasurfaces that produce images in the
visible spectral range being illuminated by infrared radiation. By design, the
metasurfaces produce different and completely independent images for the
reversed direction of illumination, that is when the positions of the infrared
emitter and the visible light receiver are exchanged. Nonlinearity-enabled
asymmetric control of light by subwavelength resonators paves the way towards
novel nanophotonic components via dense integration of large quantities of
nonlinear resonators into compact metasurface designs.
| [{'version': 'v1', 'created': 'Tue, 10 Aug 2021 03:15:58 GMT'}, {'version': 'v2', 'created': 'Wed, 18 Aug 2021 01:35:15 GMT'}, {'version': 'v3', 'created': 'Wed, 22 Jun 2022 02:23:55 GMT'}, {'version': 'v4', 'created': 'Wed, 21 Dec 2022 01:48:40 GMT'}] | 2022-12-22 | [['Kruk', 'Sergey', ''], ['Wang', 'Lei', ''], ['Sain', 'Basudeb', ''], ['Dong', 'Zhaogang', ''], ['Yang', 'Joel', ''], ['Zentgraf', 'Thomas', ''], ['Kivshar', 'Yuri', '']] |
gr-qc/0304024 | David R. Fiske | David R. Fiske (University of Maryland) | Toward Making the Constraint Hypersurface an Attractor in Free Evolution | 6 pages, 3 figures, 1 table. Uses REVTeX4 | Phys.Rev. D69 (2004) 047501 | 10.1103/PhysRevD.69.047501 | null | gr-qc physics.comp-ph | null | There is an abundance of empirical evidence in the numerical relativity
literature that the form in which the Einstein evolution equations are written
plays a significant role in the lifetime of numerical simulations. This paper
attempts to present a consistent framework for modifying any system of
evolution equations by adding terms that push the evolution toward the
constraint hypersurface. The method is, in principle, applicable to any system
of partial differential equations which can be divided into evolution equations
and constraints, although it is only demonstrated here through an application
to the Maxwell equations.
| [{'version': 'v1', 'created': 'Fri, 4 Apr 2003 20:57:26 GMT'}] | 2009-11-10 | [['Fiske', 'David R.', '', 'University of Maryland']] |
1606.08866 | Terence Parr | Terence Parr and Jurgin Vinju | Technical Report: Towards a Universal Code Formatter through Machine
Learning | null | null | null | null | cs.PL cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | There are many declarative frameworks that allow us to implement code
formatters relatively easily for any specific language, but constructing them
is cumbersome. The first problem is that "everybody" wants to format their code
differently, leading to either many formatter variants or a ridiculous number
of configuration options. Second, the size of each implementation scales with a
language's grammar size, leading to hundreds of rules.
In this paper, we solve the formatter construction problem using a novel
approach, one that automatically derives formatters for any given language
without intervention from a language expert. We introduce a code formatter
called CodeBuff that uses machine learning to abstract formatting rules from a
representative corpus, using a carefully designed feature set. Our experiments
on Java, SQL, and ANTLR grammars show that CodeBuff is efficient, has excellent
accuracy, and is grammar invariant for a given language. It also generalizes to
a 4th language tested during manuscript preparation.
| [{'version': 'v1', 'created': 'Tue, 28 Jun 2016 20:04:07 GMT'}] | 2016-06-30 | [['Parr', 'Terence', ''], ['Vinju', 'Jurgin', '']] |
2110.10065 | Jeremy Vachier | Jeremy Vachier and John S. Wettlaufer | Premelting controlled active matter in ice | null | null | 10.1103/PhysRevE.105.024601 | null | cond-mat.soft physics.bio-ph | http://creativecommons.org/licenses/by/4.0/ | Self-propelled particles can undergo complex dynamics due to a range of bulk
and surface interactions. When a particle is embedded in a host solid near its
bulk melting temperature, the latter may melt at the surface of the former in a
process known as interfacial premelting. The thickness of the melt film depends
on the temperature, impurities, material properties and geometry. A temperature
gradient is accompanied by a thermomolecular pressure gradient that drives the
interfacial liquid from high to low temperatures and hence the particle from
low to high temperatures, in a process called thermal regelation. When the host
material is ice and the embedded particle is a biological entity, one has a
particularly novel form of active matter, which addresses interplay between a
wide range of problems, from extremophiles of both terrestrial and
exobiological relevance to ecological dynamics in Earth's cryosphere. Of basic
importance in all such settings is the combined influence of biological
activity and thermal regelation in controlling the redistribution of
bioparticles. Therefore, we re-cast this class of regelation phenomena in the
stochastic framework of active Ornstein-Uhlenbeck dynamics and make predictions
relevant to this and related problems of interest in biological and geophysical
problems. We examine how thermal regelation compromises paleoclimate studies in
the context of ice core dating and we find that the activity influences
particle dynamics during thermal regelation by enhancing the effective
diffusion coefficient. Therefore, accurate dating relies on a quantitative
treatment of both effects.
| [{'version': 'v1', 'created': 'Tue, 19 Oct 2021 15:45:37 GMT'}, {'version': 'v2', 'created': 'Sun, 5 Dec 2021 15:10:10 GMT'}, {'version': 'v3', 'created': 'Mon, 17 Jan 2022 08:07:53 GMT'}] | 2022-02-16 | [['Vachier', 'Jeremy', ''], ['Wettlaufer', 'John S.', '']] |
1803.09941 | Zhaosong Lu | Zhaosong Lu and Zirui Zhou | Iteration complexity of first-order augmented Lagrangian methods for
convex conic programming | accepted by SIAM Journal on Optimization | null | null | null | math.OC cs.CC cs.NA math.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we consider a class of convex conic programming. In particular,
we first propose an inexact augmented Lagrangian (I-AL) method that resembles
the classical I-AL method for solving this problem, in which the augmented
Lagrangian subproblems are solved approximately by a variant of Nesterov's
optimal first-order method. We show that the total number of first-order
iterations of the proposed I-AL method for finding an $\epsilon$-KKT solution
is at most $\mathcal{O}(\epsilon^{-7/4})$. We then propose an adaptively
regularized I-AL method and show that it achieves a first-order iteration
complexity $\mathcal{O}(\epsilon^{-1}\log\epsilon^{-1})$, which significantly
improves existing complexity bounds achieved by first-order I-AL methods for
finding an $\epsilon$-KKT solution. Our complexity analysis of the I-AL methods
is based on a sharp analysis of inexact proximal point algorithm (PPA) and the
connection between the I-AL methods and inexact PPA. It is vastly different
from existing complexity analyses of the first-order I-AL methods in the
literature, which typically regard the I-AL methods as an inexact dual gradient
method.
| [{'version': 'v1', 'created': 'Tue, 27 Mar 2018 07:48:55 GMT'}, {'version': 'v2', 'created': 'Mon, 20 Jan 2020 03:51:08 GMT'}, {'version': 'v3', 'created': 'Wed, 1 Jun 2022 21:30:59 GMT'}, {'version': 'v4', 'created': 'Tue, 11 Oct 2022 17:26:43 GMT'}, {'version': 'v5', 'created': 'Sat, 19 Nov 2022 23:45:34 GMT'}] | 2022-11-22 | [['Lu', 'Zhaosong', ''], ['Zhou', 'Zirui', '']] |
1310.3135 | Julia-Maria Osinga | J.-M. Osinga, I. Ambro\v{z}ov\'a, K. Pachnerov\'a Brabcov\'a, M. S.
Akselrod, O. J\"akel, M. Dav\'idkov\'a, S. Greilich | Single track coincidence measurements of fluorescent and plastic nuclear
track detectors in therapeutic carbon beams | 14 pages, 8 figures, 2 tables | Journal of Instrumentation, Vol. 9 (2014), P04013 | 10.1088/1748-0221/9/04/P04013 | null | physics.med-ph physics.ins-det | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we present a method for single track coincidence measurements
using two different track detector materials. We employed plastic and
fluorescent nuclear track detectors (PNTDs and FNTDs) in the entrance channel
of a monoenergetic carbon ion beam covering the therapeutically useful energy
range from 80 to 425 MeV/u. About 99 % of all primary particle tracks detected
by both detectors were successfully matched, while 1 % of the particles were
only detected by the FNTDs because of their superior spatial resolution. We
conclude that both PNTDs and FNTDs are suitable for clinical carbon beam
dosimetry with a detection efficiency of at least 98.82 % and 99.83 %
respectively, if irradiations are performed with low fluence in the entrance
channel of the ion beam. The investigated method can be adapted to other
nuclear track detectors and offers the possibility to characterize new track
detector materials against well-known detectors. Further, by combining two
detectors with a restricted working range in the presented way a
hybrid-detector system can be created with an extended and optimized working
range.
| [{'version': 'v1', 'created': 'Fri, 11 Oct 2013 14:12:07 GMT'}, {'version': 'v2', 'created': 'Fri, 24 Jan 2014 09:07:27 GMT'}] | 2014-07-08 | [['Osinga', 'J. -M.', ''], ['Ambrožová', 'I.', ''], ['Brabcová', 'K. Pachnerová', ''], ['Akselrod', 'M. S.', ''], ['Jäkel', 'O.', ''], ['Davídková', 'M.', ''], ['Greilich', 'S.', '']] |
2001.02081 | Henry Hess | Henry Hess | Beyond Boltzmann: The Potential Energy Distribution of Objects in the
Atmosphere | 2 pages, 1 figure | null | null | null | physics.pop-ph astro-ph.EP cond-mat.stat-mech | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Estimates of the number and potential energy of molecules, aerosols, cloud
droplets, insects, birds, planes and satellites in the atmosphere yield a
distribution which is for potential energies below 10^2 kBT described by the
Boltzmann distribution, but for the range from 10^2 kBT to 10^33 kBT by a power
law with an exponent of approximately -1. An explanation for this surprising
behavior is not found.
| [{'version': 'v1', 'created': 'Wed, 1 Jan 2020 04:47:32 GMT'}] | 2020-01-08 | [['Hess', 'Henry', '']] |
1507.00287 | Hadi Ghauch | Hadi Ghauch, Taejoon Kim, Mats Bengtsson, Mikael Skoglund | Subspace Estimation and Decomposition for Large Millimeter-Wave MIMO
systems | journal, 13 pages | null | 10.1109/JSTSP.2016.2538178 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Channel estimation and precoding in hybrid analog-digital millimeter-wave
(mmWave) MIMO systems is a fundamental problem that has yet to be addressed,
before any of the promised gains can be harnessed. For that matter, we propose
a method (based on the well-known Arnoldi iteration) exploiting channel
reciprocity in TDD systems and the sparsity of the channel's eigenmodes, to
estimate the right (resp. left) singular subspaces of the channel, at the BS
(resp. MS). We first describe the algorithm in the context of conventional MIMO
systems, and derive bounds on the estimation error in the presence of
distortions at both BS and MS. We later identify obstacles that hinder the
application of such an algorithm to the hybrid analog-digital architecture, and
address them individually. In view of fulfilling the constraints imposed by the
hybrid analog-digital architecture, we further propose an iterative algorithm
for subspace decomposition, whereby the above estimated subspaces, are
approximated by a cascade of analog and digital precoder / combiner. Finally,
we evaluate the performance of our scheme against the perfect CSI, fully
digital case (i.e., an equivalent conventional MIMO system), and conclude that
similar performance can be achieved, especially at medium-to-high SNR (where
the performance gap is less than 5%), however, with a drastically lower number
of RF chains (4 to 8 times less).
| [{'version': 'v1', 'created': 'Wed, 1 Jul 2015 16:54:00 GMT'}, {'version': 'v2', 'created': 'Mon, 27 Jun 2016 18:11:54 GMT'}] | 2016-06-28 | [['Ghauch', 'Hadi', ''], ['Kim', 'Taejoon', ''], ['Bengtsson', 'Mats', ''], ['Skoglund', 'Mikael', '']] |
1806.05324 | Laura Felline | Laura Felline | It's a Matter of Principle. Scientific Explanation in
Information-Theoretic Reconstructions of Quantum Theory | null | Dialectica, 70(4), 549-575 (2016) | null | null | quant-ph physics.hist-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The aim of this paper is to explore the ways in which Axiomatic
Reconstructions of Quantum Theory in terms of Information-Theoretic principles
(ARQITs) can contribute to explaining and understanding quantum phenomena, as
well as to study their explanatory limitations. This is achieved in part by
offering an account of the kind of explanation that axiomatic reconstructions
of quantum theory provide, and re-evaluating the epistemic status of the
program in light of this explanation. As illustrative cases studies, I take
Clifton's, Bub's and Halvorson's characterization theorem and Popescu's and
Rohrlich's toy models, and their explanatory contribution with respect to
quantum non-locality. On the one hand, I argue that ARQITs can aspire to
provide genuine explanations of (some aspects of) quantum non-locality. On the
other hand, I argue that such explanations cannot rule out a mechanical quantum
theory.
| [{'version': 'v1', 'created': 'Wed, 13 Jun 2018 15:40:01 GMT'}] | 2018-06-15 | [['Felline', 'Laura', '']] |
2006.06553 | Anna Yanchenko | Anna K. Yanchenko and Sayan Mukherjee | Stanza: A Nonlinear State Space Model for Probabilistic Inference in
Non-Stationary Time Series | null | null | null | null | stat.ML cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Time series with long-term structure arise in a variety of contexts and
capturing this temporal structure is a critical challenge in time series
analysis for both inference and forecasting settings. Traditionally, state
space models have been successful in providing uncertainty estimates of
trajectories in the latent space. More recently, deep learning, attention-based
approaches have achieved state of the art performance for sequence modeling,
though often require large amounts of data and parameters to do so. We propose
Stanza, a nonlinear, non-stationary state space model as an intermediate
approach to fill the gap between traditional models and modern deep learning
approaches for complex time series. Stanza strikes a balance between
competitive forecasting accuracy and probabilistic, interpretable inference for
highly structured time series. In particular, Stanza achieves forecasting
accuracy competitive with deep LSTMs on real-world datasets, especially for
multi-step ahead forecasting.
| [{'version': 'v1', 'created': 'Thu, 11 Jun 2020 16:06:35 GMT'}] | 2020-06-12 | [['Yanchenko', 'Anna K.', ''], ['Mukherjee', 'Sayan', '']] |
2104.14108 | Zi-Chao Gao | Zi-Chao Gao, Chao-Hai Du, Fan-Hong Li, Si-Qi Li, and Pu-Kun Liu | Forward Wave Amplification Enhanced Radiation in a 1 THz Harmonic
Gyrotron | null | null | null | null | physics.plasm-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Among the most promising terahertz (THz) radiation devices, gyrotrons can
generate powerful THz-wave radiation in an open resonant structure.
Unfortunately, such an oscillation using high-Q axial mode has been
theoretically and experimentally demonstrated to suffer from strong ohmic
losses. In this paper, a solution to such a challenging problem is to include a
narrow belt of lossy section in the interaction circuit to stably constitute
the traveling wave interaction (high-order-axial-mode, HOAM), and employ a
down-tapered magnetic field to amplify the forward-wave component. A scheme
based on the traveling-wave interaction concept is proposed to strengthen
electron beam-wave interaction efficiency and simultaneously reduce the ohmic
loss in a 1-THz third harmonic gyrotron, which is promising for further
advancement of high-power continuous-wave operation.
| [{'version': 'v1', 'created': 'Thu, 29 Apr 2021 04:59:18 GMT'}] | 2021-04-30 | [['Gao', 'Zi-Chao', ''], ['Du', 'Chao-Hai', ''], ['Li', 'Fan-Hong', ''], ['Li', 'Si-Qi', ''], ['Liu', 'Pu-Kun', '']] |
0912.3627 | Andrey Voronenko A. | Andrey A. Voronenko | New Learning and Testing Problems for Read-Once Functions | null | null | null | null | cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the paper, we consider several types of queries for classical and new
problems of learning and testing read-once functions. In several cases, the
border between polynomial and exponential complexities is obtained.
| [{'version': 'v1', 'created': 'Fri, 18 Dec 2009 09:58:55 GMT'}] | 2009-12-21 | [['Voronenko', 'Andrey A.', '']] |
1602.06080 | Fengjiao Luo | F. J. Luo, Y. K. Heng, Z. M. Wang, P. L. Wang, Z. H. Qin, M. H. Xu, D.
H. Liao, H. Q. Zhang, X. C. Lei, S. Qian, S. L. Liu, Y. B. Chen, Y. F. Wang | PMT overshoot study for JUNO prototype detector | 6 pages, 11 figures | null | 10.1088/1674-1137/40/9/096002 | null | physics.ins-det hep-ex | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The quality of PMT signal is one of the key items for a large and high
precision neutrino experiment, like Daya Bay, JUNO, while most of the
experiments are affected by the PMT signal overshoot from its positive
HV-single cable scheme. For JUNO prototype detector, we have a detailed study
on the PMT overshoot and successfully reduced the ratio of overshoot amplitude
to signal to ~1% from previous typical ~10%, with no affection to PMT other
parameters. Furthermore, we calculated that the overshoot is a result of
discharging of capacitors in the HV-signal splitter and the PMT voltage
divider. The study result is extremely important for JUNO and other similar
experiments.
| [{'version': 'v1', 'created': 'Fri, 19 Feb 2016 09:10:35 GMT'}, {'version': 'v2', 'created': 'Wed, 11 May 2016 09:22:00 GMT'}] | 2016-09-21 | [['Luo', 'F. J.', ''], ['Heng', 'Y. K.', ''], ['Wang', 'Z. M.', ''], ['Wang', 'P. L.', ''], ['Qin', 'Z. H.', ''], ['Xu', 'M. H.', ''], ['Liao', 'D. H.', ''], ['Zhang', 'H. Q.', ''], ['Lei', 'X. C.', ''], ['Qian', 'S.', ''], ['Liu', 'S. L.', ''], ['Chen', 'Y. B.', ''], ['Wang', 'Y. F.', '']] |
1408.2352 | David Chappell | David J. Chappell and Gregor Tanner | A boundary integral formalism for stochastic ray tracing in billiards | 27 pages, 6 figures, submitted to Chaos | null | 10.1063/1.4903064 | null | nlin.CD math.DS physics.comp-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Determining the flow of rays or particles driven by a force or velocity field
is fundamental to modelling many physical processes, including weather
forecasting and the simulation of molecular dynamics. High frequency wave
energy distributions can also be approximated using flow or transport
equations. Applications arise in underwater and room acoustics,
vibro-acoustics, seismology, electromagnetics, quantum mechanics and in
producing computer generated imagery. In many practical applications, the
driving field is not known exactly and the dynamics are determined only up to a
degree of uncertainty. This paper presents a boundary integral framework for
propagating flows including uncertainties, which is shown to systematically
interpolate between a deterministic and a completely random description of the
trajectory propagation. A simple but efficient discretisation approach is
applied to model uncertain billiard dynamics in an integrable rectangular
domain.
| [{'version': 'v1', 'created': 'Mon, 11 Aug 2014 08:50:15 GMT'}, {'version': 'v2', 'created': 'Thu, 6 Nov 2014 18:25:37 GMT'}] | 2015-06-22 | [['Chappell', 'David J.', ''], ['Tanner', 'Gregor', '']] |
1905.02082 | Emanuele Palazzolo | Emanuele Palazzolo, Jens Behley, Philipp Lottes, Philippe Gigu\`ere,
Cyrill Stachniss | ReFusion: 3D Reconstruction in Dynamic Environments for RGB-D Cameras
Exploiting Residuals | Accepted at the IEEE/RSJ Int. Conf. on Intelligent Robots and Systems
(IROS) 2019. See teaser video at https://www.youtube.com/watch?v=1P9ZfIS5-p4.
See open source code at https://github.com/PRBonn/refusion | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Mapping and localization are essential capabilities of robotic systems.
Although the majority of mapping systems focus on static environments, the
deployment in real-world situations requires them to handle dynamic objects. In
this paper, we propose an approach for an RGB-D sensor that is able to
consistently map scenes containing multiple dynamic elements. For localization
and mapping, we employ an efficient direct tracking on the truncated signed
distance function (TSDF) and leverage color information encoded in the TSDF to
estimate the pose of the sensor. The TSDF is efficiently represented using
voxel hashing, with most computations parallelized on a GPU. For detecting
dynamics, we exploit the residuals obtained after an initial registration,
together with the explicit modeling of free space in the model. We evaluate our
approach on existing datasets, and provide a new dataset showing highly dynamic
scenes. These experiments show that our approach often surpass other
state-of-the-art dense SLAM methods. We make available our dataset with the
ground truth for both the trajectory of the RGB-D sensor obtained by a motion
capture system and the model of the static environment using a high-precision
terrestrial laser scanner. Finally, we release our approach as open source
code.
| [{'version': 'v1', 'created': 'Mon, 6 May 2019 15:05:47 GMT'}, {'version': 'v2', 'created': 'Mon, 20 May 2019 10:11:38 GMT'}, {'version': 'v3', 'created': 'Thu, 29 Aug 2019 03:17:13 GMT'}] | 2019-08-30 | [['Palazzolo', 'Emanuele', ''], ['Behley', 'Jens', ''], ['Lottes', 'Philipp', ''], ['Giguère', 'Philippe', ''], ['Stachniss', 'Cyrill', '']] |
1802.03704 | Zhipeng Xue | Zhipeng Xue, Xiaojun Yuan, Junjie Ma, and Yi Ma | TARM: A Turbo-type Algorithm for Affine Rank Minimization | 13pages, 16figues, conference version accepted by ICASSP 2018 | null | 10.1109/TSP.2019.2944740 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The affine rank minimization (ARM) problem arises in many real-world
applications. The goal is to recover a low-rank matrix from a small amount of
noisy affine measurements. The original problem is NP-hard, and so directly
solving the problem is computationally prohibitive. Approximate low-complexity
solutions for ARM have recently attracted much research interest. In this
paper, we design an iterative algorithm for ARM based on message passing
principles. The proposed algorithm is termed turbo-type ARM (TARM), as inspired
by the recently developed turbo compressed sensing algorithm for sparse signal
recovery. We show that, when the linear operator for measurement is
right-orthogonally invariant (ROIL), a scalar function called state evolution
can be established to accurately predict the behaviour of the TARM algorithm.
We also show that TARM converges much faster than the counterpart algorithms
for low-rank matrix recovery. We further extend the TARM algorithm for matrix
completion, where the measurement operator corresponds to a random selection
matrix. We show that, although the state evolution is not accurate for matrix
completion, the TARM algorithm with carefully tuned parameters still
significantly outperforms its counterparts.
| [{'version': 'v1', 'created': 'Sun, 11 Feb 2018 07:02:46 GMT'}] | 2020-01-08 | [['Xue', 'Zhipeng', ''], ['Yuan', 'Xiaojun', ''], ['Ma', 'Junjie', ''], ['Ma', 'Yi', '']] |
math-ph/0210018 | Igor Loutsenko | Igor Loutsenko | Integrable Dynamics of Charges Related to Bilinear Hypergeometric
Equation | 27 pages, Latex, A new corrected version of older submission | Commun.Math.Phys. 242 (2003) 251-275 | 10.1007/s00220-003-0944-z | SISSA PREPRINT 67/02 | math-ph hep-th math.DS math.MP nlin.SI physics.flu-dyn | null | A family of systems related to a linear and bilinear evolution of roots of
polynomials in the complex plane is considered. Restricted to the line, the
evolution induces dynamics of the Coulomb charges in external potentials, while
its fixed points correspond to equilibria of charges (or point vortices in
hydrodynamics) in the plane. The construction reveals a direct connection with
the theories of the Calogero-Moser systems and Lie-algebraic differential
operators. A study of the equilibrium configurations amounts in a construction
(bilinear hypergeometric equation) for which the classical orthogonal and the
Adler-Moser polynomials represent some particular cases
| [{'version': 'v1', 'created': 'Wed, 9 Oct 2002 16:58:12 GMT'}, {'version': 'v2', 'created': 'Fri, 11 Oct 2002 15:52:38 GMT'}, {'version': 'v3', 'created': 'Tue, 29 Oct 2002 11:23:22 GMT'}, {'version': 'v4', 'created': 'Tue, 5 Nov 2002 14:10:49 GMT'}] | 2009-11-07 | [['Loutsenko', 'Igor', '']] |
1406.4115 | Sabrina Camargo | Sabrina Camargo, Maik Riedl, Celia Anteneodo, Juergen Kurths, Thomas
Penzel, and Niels Wessel | Sleep apnea-hypopnea quantification by cardiovascular data analysis | null | null | 10.1371/journal.pone.0107581 | null | physics.med-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Sleep apnea is the most common sleep disturbance and it is an important risk
factor for cardiovascular disorders. Its detection relies on a polysomnography,
a combination of diverse exams.
In order to detect changes due to sleep disturbances such as sleep apnea
occurrences, without the need of combined recordings, we mainly analyze
systolic blood pressure signals (maximal blood pressure value of each beat to
beat interval). Nonstationarities in the data are uncovered by a segmentation
procedure, which provides local quantities that are correlated to
apnea-hypopnea events. Those quantities are the average length and average
variance of stationary patches. By comparing them to an apnea score previously
obtained by polysomnographic exams, we propose an apnea quantifier based on
blood pressure signal.
This furnishes an alternative procedure for the detection of apnea based on a
single time series, with an accuracy of 82%.
| [{'version': 'v1', 'created': 'Fri, 13 Jun 2014 15:38:28 GMT'}] | 2015-06-22 | [['Camargo', 'Sabrina', ''], ['Riedl', 'Maik', ''], ['Anteneodo', 'Celia', ''], ['Kurths', 'Juergen', ''], ['Penzel', 'Thomas', ''], ['Wessel', 'Niels', '']] |
2012.03919 | Shutang You | Shutang You | A Quantum Computing Framework for Complex System Reliability Assessment | 4 pages, 2 figures | null | null | null | eess.SY cs.SY | http://creativecommons.org/licenses/by-nc-sa/4.0/ | This paper proposed a framework based on quantum computing for reliability
assessment of complex systems. The 'Quantum Twin' concept was also proposed.
The framework can be used to accelerate the reliability assessment of
large-scale complex systems, which could take much computation time for
classical computers to achieve accurate results. Power system is used as an
example of complex systems to illustrate the framework.
| [{'version': 'v1', 'created': 'Mon, 7 Dec 2020 18:46:03 GMT'}, {'version': 'v2', 'created': 'Tue, 6 Apr 2021 17:25:07 GMT'}] | 2021-04-07 | [['You', 'Shutang', '']] |
1104.1533 | David Naccache | Byungchun Chung and Sandra Marcello and Amir-Pasha Mirbaha and David
Naccache and Karim Sabeg | Operand Folding Hardware Multipliers | null | null | null | null | cs.MS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper describes a new accumulate-and-add multiplication algorithm. The
method partitions one of the operands and re-combines the results of
computations done with each of the partitions. The resulting design turns-out
to be both compact and fast.
When the operands' bit-length $m$ is 1024, the new algorithm requires only
$0.194m+56$ additions (on average), this is about half the number of additions
required by the classical accumulate-and-add multiplication algorithm
($\frac{m}2$).
| [{'version': 'v1', 'created': 'Fri, 8 Apr 2011 09:40:04 GMT'}] | 2011-04-11 | [['Chung', 'Byungchun', ''], ['Marcello', 'Sandra', ''], ['Mirbaha', 'Amir-Pasha', ''], ['Naccache', 'David', ''], ['Sabeg', 'Karim', '']] |
1703.04704 | Florian Fr\"owis | Florian Fr\"owis, Peter C. Strassmann, Alexey Tiranov, Corentin Gut,
Jonathan Lavoie, Nicolas Brunner, F\'elix Bussi\`eres, Mikael Afzelius,
Nicolas Gisin | Experimental certification of millions of genuinely entangled atoms in a
solid | 11 pages incl. Methods and Suppl. Info., 4 figures, 1 table. v2:
close to published version. See also parallel submission by Zarkeshian et al
(1703.04709) | Nature Communications 8, Article number: 907 (2017) | 10.1038/s41467-017-00898-6 | null | quant-ph physics.atom-ph physics.optics | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Quantum theory predicts that entanglement can also persist in macroscopic
physical systems, albeit difficulties to demonstrate it experimentally remain.
Recently, significant progress has been achieved and genuine entanglement
between up to 2900 atoms was reported. Here we demonstrate 16 million genuinely
entangled atoms in a solid-state quantum memory prepared by the heralded
absorption of a single photon. We develop an entanglement witness for
quantifying the number of genuinely entangled particles based on the collective
effect of directed emission combined with the nonclassical nature of the
emitted light. The method is applicable to a wide range of physical systems and
is effective even in situations with significant losses. Our results clarify
the role of multipartite entanglement in ensemble-based quantum memories as a
necessary prerequisite to achieve a high single-photon process fidelity crucial
for future quantum networks. On a more fundamental level, our results reveal
the robustness of certain classes of multipartite entangled states, contrary
to, e.g., Schr\"odinger-cat states, and that the depth of entanglement can be
experimentally certified at unprecedented scales.
| [{'version': 'v1', 'created': 'Tue, 14 Mar 2017 20:27:12 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Oct 2017 13:12:52 GMT'}] | 2017-10-24 | [['Fröwis', 'Florian', ''], ['Strassmann', 'Peter C.', ''], ['Tiranov', 'Alexey', ''], ['Gut', 'Corentin', ''], ['Lavoie', 'Jonathan', ''], ['Brunner', 'Nicolas', ''], ['Bussières', 'Félix', ''], ['Afzelius', 'Mikael', ''], ['Gisin', 'Nicolas', '']] |
1611.02460 | Frederik Mallmann-Trenn | Varun Kanade, Frederik Mallmann-Trenn, Thomas Sauerwald | On coalescence time in graphs--When is coalescing as fast as meeting? | null | null | null | null | cs.DM math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Coalescing random walks is a fundamental stochastic process, where a set of
particles perform independent discrete-time random walks on an undirected
graph. Whenever two or more particles meet at a given node, they merge and
continue as a single random walk. The coalescence time is defined as the
expected time until only one particle remains, starting from one particle at
every node. Despite recent progress the coalescence time for graphs such as
binary trees, d-dimensional tori, hypercubes and more generally,
vertex-transitive graphs, remains unresolved. We provide a powerful toolkit
that results in tight bounds for various topologies including the
aforementioned ones. The meeting time is defined as the worst-case expected
time required for two random walks to arrive at the same node at the same time.
As a general result, we establish that for graphs whose meeting time is only
marginally larger than the mixing time (a factor of log^2 n), the coalescence
time of n random walks equals the meeting time up to constant factors. This
upper bound is complemented by the construction of a graph family demonstrating
that this result is the best possible up to constant factors. For
almost-regular graphs, we bound the coalescence time by the hitting time,
resolving the discrete-time variant of a conjecture by Aldous for this class of
graphs. Finally, we prove that for any graph the coalescence time is bounded by
O(n^3) (which is tight for the Barbell graph); surprisingly even such a basic
question about the coalescing time was not answered before this work. By
duality, our results give bounds on the voter model and therefore give bounds
on the consensus time in arbitrary undirected graphs. We also establish a new
bound on the hitting time and cover time of regular graphs, improving and
tightening previous results by Broder and Karlin, as well as those by Aldous
and Fill.
| [{'version': 'v1', 'created': 'Tue, 8 Nov 2016 10:05:53 GMT'}, {'version': 'v2', 'created': 'Fri, 7 Apr 2017 10:08:50 GMT'}, {'version': 'v3', 'created': 'Thu, 2 Aug 2018 19:05:38 GMT'}, {'version': 'v4', 'created': 'Thu, 1 Nov 2018 18:46:53 GMT'}] | 2018-11-05 | [['Kanade', 'Varun', ''], ['Mallmann-Trenn', 'Frederik', ''], ['Sauerwald', 'Thomas', '']] |
1205.1183 | Xiaohui Bei | Xiaohui Bei, Ning Chen, Shengyu Zhang | On the Complexity of Trial and Error | null | null | null | null | cs.CC cs.DS cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Motivated by certain applications from physics, biochemistry, economics, and
computer science, in which the objects under investigation are not accessible
because of various limitations, we propose a trial-and-error model to examine
algorithmic issues in such situations. Given a search problem with a hidden
input, we are asked to find a valid solution, to find which we can propose
candidate solutions (trials), and use observed violations (errors), to prepare
future proposals. In accordance with our motivating applications, we consider
the fairly broad class of constraint satisfaction problems, and assume that
errors are signaled by a verification oracle in the format of the index of a
violated constraint (with the content of the constraint still hidden).
Our discoveries are summarized as follows. On one hand, despite the seemingly
very little information provided by the verification oracle, efficient
algorithms do exist for a number of important problems. For the Nash, Core,
Stable Matching, and SAT problems, the unknown-input versions are as hard as
the corresponding known-input versions, up to a factor of polynomial. We
further give almost tight bounds on the latter two problems' trial
complexities. On the other hand, there are problems whose complexities are
substantially increased in the unknown-input model. In particular, no
time-efficient algorithms exist (under standard hardness assumptions) for Graph
Isomorphism and Group Isomorphism problems. The tools used to achieve these
results include order theory, strong ellipsoid method, and some non-standard
reductions.
Our model investigates the value of information, and our results demonstrate
that the lack of input information can introduce various levels of extra
difficulty. The model exhibits intimate connections with (and we hope can also
serve as a useful supplement to) certain existing learning and complexity
theories.
| [{'version': 'v1', 'created': 'Sun, 6 May 2012 06:03:27 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Apr 2013 05:39:19 GMT'}] | 2013-04-19 | [['Bei', 'Xiaohui', ''], ['Chen', 'Ning', ''], ['Zhang', 'Shengyu', '']] |
1206.6083 | Sergey Leble | Sergey Kshevetskii, Sergey Leble | Study of internal wave breaking dependence on stratification | 25 pages, 15 figures | null | null | null | math-ph math.DS math.MP nlin.CD physics.ao-ph physics.flu-dyn | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Mixing effect in a stratified fluid is considered and examined. Euler
equations for incompressible fluid stratified by a gravity field are applied to
state a mathematical problem and describe the effect. It is found out that a
system of Euler equations is not enough for a formulation of correct
generalized problem. Some complementary relations are suggested and justified.
A numerical method is developed and applied for study of processes of vortex
destruction and mixing progress in a stratified fluid. The dependence of vortex
destruction on a stratification scale is investigated numerically and it is
shown that the effect increases with the stratification scale. It is observed
that the effect of vortex destruction is absent when the fluid density is
constant. Some simple mathematical explanation of the effect is suggested.
| [{'version': 'v1', 'created': 'Tue, 26 Jun 2012 19:04:33 GMT'}] | 2012-06-27 | [['Kshevetskii', 'Sergey', ''], ['Leble', 'Sergey', '']] |
2012.08459 | Sophie Burkhardt | Sophie Burkhardt, Jannis Brugger, Nicolas Wagner, Zahra Ahmadi,
Kristian Kersting and Stefan Kramer | Rule Extraction from Binary Neural Networks with Convolutional Rules for
Model Validation | null | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Most deep neural networks are considered to be black boxes, meaning their
output is hard to interpret. In contrast, logical expressions are considered to
be more comprehensible since they use symbols that are semantically close to
natural language instead of distributed representations. However, for
high-dimensional input data such as images, the individual symbols, i.e.
pixels, are not easily interpretable. We introduce the concept of first-order
convolutional rules, which are logical rules that can be extracted using a
convolutional neural network (CNN), and whose complexity depends on the size of
the convolutional filter and not on the dimensionality of the input. Our
approach is based on rule extraction from binary neural networks with
stochastic local search. We show how to extract rules that are not necessarily
short, but characteristic of the input, and easy to visualize. Our experiments
show that the proposed approach is able to model the functionality of the
neural network while at the same time producing interpretable logical rules.
| [{'version': 'v1', 'created': 'Tue, 15 Dec 2020 17:55:53 GMT'}] | 2020-12-16 | [['Burkhardt', 'Sophie', ''], ['Brugger', 'Jannis', ''], ['Wagner', 'Nicolas', ''], ['Ahmadi', 'Zahra', ''], ['Kersting', 'Kristian', ''], ['Kramer', 'Stefan', '']] |
1710.01231 | Holger Cartarius | Holger Cartarius, Ziad H. Musslimani, Lukas Schwarz, G\"unter Wunner | Computing eigenfunctions and eigenvalues of boundary value problems with
the orthogonal spectral renormalization method | 11 pages, 8 figures, additional numerical examples | Phys. Rev. A 97, 032134 (2018) | 10.1103/PhysRevA.97.032134 | null | physics.comp-ph cond-mat.quant-gas quant-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The spectral renormalization method was introduced in 2005 as an effective
way to compute ground states of nonlinear Schr\"odinger and Gross-Pitaevskii
type equations. In this paper, we introduce an orthogonal spectral
renormalization (OSR) method to compute ground and excited states (and their
respective eigenvalues) of linear and nonlinear eigenvalue problems. The
implementation of the algorithm follows four simple steps: (i) reformulate the
underlying eigenvalue problem as a fixed point equation, (ii) introduce a
renormalization factor that controls the convergence properties of the
iteration, (iii) perform a Gram-Schmidt orthogonalization process in order to
prevent the iteration from converging to an unwanted mode; and (iv) compute the
solution sought using a fixed-point iteration. The advantages of the OSR scheme
over other known methods (such as Newton's and self-consistency) are: (i) it
allows the flexibility to choose large varieties of initial guesses without
diverging, (ii) easy to implement especially at higher dimensions and (iii) it
can easily handle problems with complex and random potentials. The OSR method
is implemented on benchmark Hermitian linear and nonlinear eigenvalue problems
as well as linear and nonlinear non-Hermitian $\mathcal{PT}$-symmetric models.
| [{'version': 'v1', 'created': 'Tue, 3 Oct 2017 15:57:52 GMT'}, {'version': 'v2', 'created': 'Fri, 30 Mar 2018 14:45:33 GMT'}] | 2018-04-02 | [['Cartarius', 'Holger', ''], ['Musslimani', 'Ziad H.', ''], ['Schwarz', 'Lukas', ''], ['Wunner', 'Günter', '']] |
0903.0069 | Pierre-Louis Cayrel | Pierre-Louis Cayrel, Philippe Gaborit, David Galindo and Marc Girault | Improved identity-based identification using correcting codes | 9 pages | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, a new identity-based identification scheme based on
error-correcting codes is proposed. Two well known code-based schemes are
combined : the signature scheme by Courtois, Finiasz and Sendrier and an
identification scheme by Stern. A proof of security for the scheme in the
Random Oracle Model is given.
| [{'version': 'v1', 'created': 'Sat, 28 Feb 2009 12:05:58 GMT'}] | 2009-03-03 | [['Cayrel', 'Pierre-Louis', ''], ['Gaborit', 'Philippe', ''], ['Galindo', 'David', ''], ['Girault', 'Marc', '']] |
1505.07432 | Zhengfeng Ji | Zhengfeng Ji | Classical Verification of Quantum Proofs | 36 pages, 8 figures | null | null | null | quant-ph cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a classical interactive protocol that verifies the validity of a
quantum witness state for the local Hamiltonian problem. It follows from this
protocol that approximating the non-local value of a multi-player one-round
game to inverse polynomial precision is QMA-hard. Our work makes an interesting
connection between the theory of QMA-completeness and Hamiltonian complexity on
one hand and the study of non-local games and Bell inequalities on the other.
| [{'version': 'v1', 'created': 'Wed, 27 May 2015 18:46:24 GMT'}] | 2015-05-28 | [['Ji', 'Zhengfeng', '']] |
1207.1791 | Franco Ruzzenenti | Franco Ruzzenenti and Francesco Picciolo and Riccardo Basosi and Diego
Garlaschelli | Spatial effects in real networks: measures, null models, and
applications | null | Physical Review E 86, 066110 (2012) | 10.1103/PhysRevE.86.066110 | null | physics.soc-ph cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Spatially embedded networks are shaped by a combination of purely topological
(space-independent) and space-dependent formation rules. While it is quite easy
to artificially generate networks where the relative importance of these two
factors can be varied arbitrarily, it is much more difficult to disentangle
these two architectural effects in real networks. Here we propose a solution to
the problem by introducing global and local measures of spatial effects that,
through a comparison with adequate null models, effectively filter out the
spurious contribution of non-spatial constraints. Our filtering allows us to
consistently compare different embedded networks or different historical
snapshots of the same network. As a challenging application we analyse the
World Trade Web, whose topology is expected to depend on geographic distances
but is also strongly determined by non-spatial constraints (degree sequence or
GDP). Remarkably, we are able to detect weak but significant spatial effects
both locally and globally in the network, showing that our method succeeds in
retrieving spatial information even when non-spatial factors dominate. We
finally relate our results to the economic literature on gravity models and
trade globalization.
| [{'version': 'v1', 'created': 'Sat, 7 Jul 2012 12:16:58 GMT'}, {'version': 'v2', 'created': 'Tue, 10 Jul 2012 09:24:01 GMT'}, {'version': 'v3', 'created': 'Mon, 16 Jul 2012 10:45:07 GMT'}, {'version': 'v4', 'created': 'Sat, 13 Oct 2012 13:29:15 GMT'}, {'version': 'v5', 'created': 'Tue, 27 Nov 2012 15:22:39 GMT'}] | 2013-09-10 | [['Ruzzenenti', 'Franco', ''], ['Picciolo', 'Francesco', ''], ['Basosi', 'Riccardo', ''], ['Garlaschelli', 'Diego', '']] |
2002.04175 | Sushmita Bhattacharya | Sushmita Bhattacharya, Sahil Badyal, Thomas Wheeler, Stephanie Gil,
Dimitri Bertsekas | Reinforcement Learning for POMDP: Partitioned Rollout and Policy
Iteration with Application to Autonomous Sequential Repair Problems | Total 9 pages, 9 figures, 1 table, submitted and accepted to be
published in IEEE RA-L 2020 | null | null | null | cs.RO cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we consider infinite horizon discounted dynamic programming
problems with finite state and control spaces, and partial state observations.
We discuss an algorithm that uses multistep lookahead, truncated rollout with a
known base policy, and a terminal cost function approximation. This algorithm
is also used for policy improvement in an approximate policy iteration scheme,
where successive policies are approximated by using a neural network
classifier. A novel feature of our approach is that it is well suited for
distributed computation through an extended belief space formulation and the
use of a partitioned architecture, which is trained with multiple neural
networks. We apply our methods in simulation to a class of sequential repair
problems where a robot inspects and repairs a pipeline with potentially several
rupture sites under partial information about the state of the pipeline.
| [{'version': 'v1', 'created': 'Tue, 11 Feb 2020 02:38:38 GMT'}] | 2020-02-12 | [['Bhattacharya', 'Sushmita', ''], ['Badyal', 'Sahil', ''], ['Wheeler', 'Thomas', ''], ['Gil', 'Stephanie', ''], ['Bertsekas', 'Dimitri', '']] |
1903.06374 | Yong Li | Xu Wang, Xinsheng Fang, Dongxing Mao, Yun Jing and Yong Li | Extremely asymmetrical acoustic metasurface mirror at the exceptional
point | 5 pages, 4 figures | Phys. Rev. Lett. 123, 214302 (2019) | 10.1103/PhysRevLett.123.214302 | null | physics.app-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Previous research has attempted to minimize the influence of loss in
reflection- and transmission-type acoustic metasurfaces. This letter shows
that, by treating the acoustic metasurface as a non-Hermitian system and by
harnessing loss, unconventional wave behaviors that do not exist in lossless
metasurfaces can be uncovered. Specifically, we theoretically and
experimentally demonstrate a non-Hermitian acoustic metasurface mirror
featuring extremely asymmetrical reflection at the exception point. As an
example, the metasurface mirror is designed to have high-efficiency
retro-reflection when the wave incidents from one side and complete absorption
when the wave incidents from the other side. This work marries conventional
gradient index metasurfaces with the exception point from non-Hermitian
systems, and paves the way for identifying new mechanisms and functionalities
for wave manipulation.
| [{'version': 'v1', 'created': 'Fri, 15 Mar 2019 05:44:45 GMT'}, {'version': 'v2', 'created': 'Thu, 21 Mar 2019 02:33:07 GMT'}] | 2019-11-27 | [['Wang', 'Xu', ''], ['Fang', 'Xinsheng', ''], ['Mao', 'Dongxing', ''], ['Jing', 'Yun', ''], ['Li', 'Yong', '']] |
2110.06640 | Max Fischer Mr | Christian von Koch, William Anz\'en, Max Fischer, Raazesh Sainudiin | Detecting Slag Formations with Deep Convolutional Neural Networks | 15 pages, 6 figures, to be published in the proceedings of DAGM
German Conference on Pattern Recognition 2021 | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We investigate the ability to detect slag formations in images from inside a
Grate-Kiln system furnace with two deep convolutional neural networks. The
conditions inside the furnace cause occasional obstructions of the camera view.
Our approach suggests dealing with this problem by introducing a convLSTM-layer
in the deep convolutional neural network. The results show that it is possible
to achieve sufficient performance to automate the decision of timely
countermeasures in the industrial operational setting. Furthermore, the
addition of the convLSTM-layer results in fewer outlying predictions and a
lower running variance of the fraction of detected slag in the image time
series.
| [{'version': 'v1', 'created': 'Wed, 13 Oct 2021 11:13:48 GMT'}] | 2021-10-14 | [['von Koch', 'Christian', ''], ['Anzén', 'William', ''], ['Fischer', 'Max', ''], ['Sainudiin', 'Raazesh', '']] |
1902.09576 | Yongqiang Wang | Yongqiang Wang | Privacy-Preserving Average Consensus via State Decomposition | accepted to IEEE Transactions on Automatic Control | null | null | null | math.OC cs.CR cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Average consensus underpins key functionalities of distributed systems
ranging from distributed information fusion, decision-making, distributed
optimization, to load balancing and decentralized control. Existing distributed
average consensus algorithms require each node to exchange and disclose state
information to its neighbors, which is undesirable in cases where the state is
private or contains sensitive information. In this paper, we propose a novel
approach that avoids disclosing individual state information in average
consensus by letting each node decompose its state into two sub-states. For
each node, one of the two sub-states involves in computation and inter-node
interactions as if it were the original state, while the other sub-state
interacts only with the first sub-state of the same node, being completely
invisible to other nodes. The initial values of the two sub-states are chosen
randomly but with their mean fixed to the initial value of the original state,
which is key to guarantee convergence to the desired consensus value. In direct
contrast to differential-privacy based privacy-preserving average-consensus
approaches which enable privacy by compromising accuracy in the consensus
value, the proposed approach can guarantee convergence to the \emph{exact}
desired value without any error. Not only is the proposed approach able to
prevent the disclosure of a node's initial state to honest-but-curious
neighbors, it can also provide protection against inference by external
eavesdroppers able to wiretap communication links. Numerical simulations
demonstrate the effectiveness of the approach and its advantages over
state-of-the-art counterparts.
| [{'version': 'v1', 'created': 'Mon, 25 Feb 2019 19:19:24 GMT'}, {'version': 'v2', 'created': 'Sat, 2 Mar 2019 15:06:17 GMT'}] | 2019-03-05 | [['Wang', 'Yongqiang', '']] |
1705.08723 | Mathieu Lorteau | Mathieu Lorteau (Chatillon), Marta De La Llave Plata (Chatillon),
Vincent Couaillier (Chatillon) | Turbulent jet simulation using high-order DG methods for aeroacoustics
analysis | null | null | null | null | physics.flu-dyn physics.class-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, a high-order discontinuous Galerkin (DG) method is used to
perform a large-eddy simulation (LES) of a subsonic isothermal jet at high
Reynolds number Re D = 10^6 on a fully un-structured mesh. Its radiated
acoustic field is computed using the Ffowcs Williams and Hawkings formulation.
In order to assess the accuracy of the DG method, the simulation results are
compared to experimental measurements and a reference simulation based on a
finite volume method. The comparisons are made on the flow quantities (mean,
rms and spectra) and pressure far field (rms and spectra).
| [{'version': 'v1', 'created': 'Tue, 23 May 2017 08:54:08 GMT'}] | 2017-05-25 | [['Lorteau', 'Mathieu', '', 'Chatillon'], ['Plata', 'Marta De La Llave', '', 'Chatillon'], ['Couaillier', 'Vincent', '', 'Chatillon']] |
2203.12196 | Daniel Tabas | Daniel Tabas and Baosen Zhang | Safe and Efficient Model Predictive Control Using Neural Networks: An
Interior Point Approach | To appear in the proceedings of the 2022 Conference on Decision and
Control (CDC) | null | null | null | eess.SY cs.SY | http://creativecommons.org/licenses/by/4.0/ | Model predictive control (MPC) provides a useful means for controlling
systems with constraints, but suffers from the computational burden of
repeatedly solving an optimization problem in real time. Offline (explicit)
solutions for MPC attempt to alleviate real time computational challenges using
either multiparametric programming or machine learning. The multiparametric
approaches are typically applied to linear or quadratic MPC problems, while
learning-based approaches can be more flexible and are less memory-intensive.
Existing learning-based approaches offer significant speedups, but the
challenge becomes ensuring constraint satisfaction while maintaining good
performance. In this paper, we provide a neural network parameterization of MPC
policies that explicitly encodes the constraints of the problem. By exploring
the interior of the MPC feasible set in an unsupervised learning paradigm, the
neural network finds better policies faster than projection-based methods and
exhibits substantially shorter solve times. We use the proposed policy to solve
a robust MPC problem, and demonstrate the performance and computational gains
on a standard test system.
| [{'version': 'v1', 'created': 'Wed, 23 Mar 2022 05:12:25 GMT'}, {'version': 'v2', 'created': 'Tue, 13 Sep 2022 07:36:49 GMT'}] | 2022-09-14 | [['Tabas', 'Daniel', ''], ['Zhang', 'Baosen', '']] |
2204.08481 | Pouria Khalaj | Ali Rostami Shirazi, Hosein Haghi, Pouria Khalaj, Ahmad Farhani Asl,
Akram Hasani Zonoozi | The Escape of Globular Clusters from the Satellite Dwarf Galaxies of the
Milky Way | 16 pages, 7 figures (including 1 in the appendix), 6 tables
(including 2 in the appendix). Accepted for publication in MNRAS | null | 10.1093/mnras/stac1070 | null | astro-ph.GA physics.comp-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Using numerical simulations, we have studied the escape of globular clusters
(GCs) from the satellite dwarf spheroidal galaxies (dSphs) of the Milky Way
(MW). We start by following the orbits of a large sample of GCs around dSphs in
the presence of the MW potential field. We then obtain the fraction of GCs
leaving their host dSphs within a Hubble Time. We model dSphs by a Hernquist
density profile with masses between $10^7\,\mathrm{M}_{\odot}$ and $7\times
10^9\,\mathrm{M}_{\odot}$. All dSphs lie on the Galactic disc plane, but they
have different orbital eccentricities and apogalactic distances. We compute the
escape fraction of GCs from 13 of the most massive dSphs of the MW, using their
realistic orbits around the MW (as determined by Gaia). The escape fraction of
GCs from 13 dSphs is in the range $12\%$ to $93\%$. The average escape time of
GCs from these dSphs was less than 8 $\,\mathrm{Gyrs}$, indicating that the
escape process of GCs from dSphs was over. We then adopt a set of
observationally-constrained density profiles for specific case of the Fornax
dSph. According to our results, the escape fraction of GCs shows a negative
correlation with both the mass and the apogalactic distance of the dSphs, as
well as a positive correlation with the orbital eccentricity of dSphs. In
particular, we find that the escape fraction of GCs from the Fornax dSph is
between $13\%$ and $38\%$. Finally, we observe that when GCs leave their host
dSphs, their final orbit around the MW does not differ much from their host
dSphs.
| [{'version': 'v1', 'created': 'Mon, 18 Apr 2022 18:00:00 GMT'}] | 2022-04-26 | [['Shirazi', 'Ali Rostami', ''], ['Haghi', 'Hosein', ''], ['Khalaj', 'Pouria', ''], ['Asl', 'Ahmad Farhani', ''], ['Zonoozi', 'Akram Hasani', '']] |
2202.09433 | Mengyuan Li | Mengyuan Li, Ann Franchesca Laguna, Dayane Reis, Xunzhao Yin, Michael
Niemier, and Xiaobo Sharon Hu | iMARS: An In-Memory-Computing Architecture for Recommendation Systems | Accepted by 59th Design Automation Conference (DAC) | null | null | null | cs.AR | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Recommendation systems (RecSys) suggest items to users by predicting their
preferences based on historical data. Typical RecSys handle large embedding
tables and many embedding table related operations. The memory size and
bandwidth of the conventional computer architecture restrict the performance of
RecSys. This work proposes an in-memory-computing (IMC) architecture (iMARS)
for accelerating the filtering and ranking stages of deep neural network-based
RecSys. iMARS leverages IMC-friendly embedding tables implemented inside a
ferroelectric FET based IMC fabric. Circuit-level and system-level evaluation
show that \fw achieves 16.8x (713x) end-to-end latency (energy) improvement
compared to the GPU counterpart for the MovieLens dataset.
| [{'version': 'v1', 'created': 'Fri, 18 Feb 2022 21:21:37 GMT'}] | 2022-02-22 | [['Li', 'Mengyuan', ''], ['Laguna', 'Ann Franchesca', ''], ['Reis', 'Dayane', ''], ['Yin', 'Xunzhao', ''], ['Niemier', 'Michael', ''], ['Hu', 'Xiaobo Sharon', '']] |
1812.09912 | Wonwoong Cho | Wonwoong Cho, Sungha Choi, David Keetae Park, Inkyu Shin, Jaegul Choo | Image-to-Image Translation via Group-wise Deep Whitening-and-Coloring
Transformation | CVPR 2019 (oral) | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently, unsupervised exemplar-based image-to-image translation, conditioned
on a given exemplar without the paired data, has accomplished substantial
advancements. In order to transfer the information from an exemplar to an input
image, existing methods often use a normalization technique, e.g., adaptive
instance normalization, that controls the channel-wise statistics of an input
activation map at a particular layer, such as the mean and the variance.
Meanwhile, style transfer approaches similar task to image translation by
nature, demonstrated superior performance by using the higher-order statistics
such as covariance among channels in representing a style. In detail, it works
via whitening (given a zero-mean input feature, transforming its covariance
matrix into the identity). followed by coloring (changing the covariance matrix
of the whitened feature to those of the style feature). However, applying this
approach in image translation is computationally intensive and error-prone due
to the expensive time complexity and its non-trivial backpropagation. In
response, this paper proposes an end-to-end approach tailored for image
translation that efficiently approximates this transformation with our novel
regularization methods. We further extend our approach to a group-wise form for
memory and time efficiency as well as image quality. Extensive qualitative and
quantitative experiments demonstrate that our proposed method is fast, both in
training and inference, and highly effective in reflecting the style of an
exemplar. Finally, our code is available at
https://github.com/WonwoongCho/GDWCT.
| [{'version': 'v1', 'created': 'Mon, 24 Dec 2018 13:03:24 GMT'}, {'version': 'v2', 'created': 'Sun, 9 Jun 2019 08:58:05 GMT'}] | 2019-06-11 | [['Cho', 'Wonwoong', ''], ['Choi', 'Sungha', ''], ['Park', 'David Keetae', ''], ['Shin', 'Inkyu', ''], ['Choo', 'Jaegul', '']] |
1306.0125 | Jacob Whitehill | Jacob Whitehill | Understanding ACT-R - an Outsider's Perspective | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The ACT-R theory of cognition developed by John Anderson and colleagues
endeavors to explain how humans recall chunks of information and how they solve
problems. ACT-R also serves as a theoretical basis for "cognitive tutors",
i.e., automatic tutoring systems that help students learn mathematics, computer
programming, and other subjects. The official ACT-R definition is distributed
across a large body of literature spanning many articles and monographs, and
hence it is difficult for an "outsider" to learn the most important aspects of
the theory. This paper aims to provide a tutorial to the core components of the
ACT-R theory.
| [{'version': 'v1', 'created': 'Sat, 1 Jun 2013 15:48:58 GMT'}] | 2013-06-04 | [['Whitehill', 'Jacob', '']] |
1802.06963 | Karim Said Barsim | Karim Said Barsim, Lukas Mauch, Bin Yang | Neural Network Ensembles to Real-time Identification of Plug-level
Appliance Measurements | NILM Workshop 2016 | null | null | ID09 | cs.LG cs.AI eess.SP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The problem of identifying end-use electrical appliances from their
individual consumption profiles, known as the appliance identification problem,
is a primary stage in both Non-Intrusive Load Monitoring (NILM) and automated
plug-wise metering. Therefore, appliance identification has received dedicated
studies with various electric appliance signatures, classification models, and
evaluation datasets. In this paper, we propose a neural network ensembles
approach to address this problem using high resolution measurements. The models
are trained on the raw current and voltage waveforms, and thus, eliminating the
need for well engineered appliance signatures. We evaluate the proposed model
on a publicly available appliance dataset from 55 residential buildings, 11
appliance categories, and over 1000 measurements. We further study the
stability of the trained models with respect to training dataset, sampling
frequency, and variations in the steady-state operation of appliances.
| [{'version': 'v1', 'created': 'Tue, 20 Feb 2018 04:32:35 GMT'}] | 2018-02-21 | [['Barsim', 'Karim Said', ''], ['Mauch', 'Lukas', ''], ['Yang', 'Bin', '']] |
2211.17169 | Martin Bullinger | Niclas Boehmer and Martin Bullinger and Anna Maria Kerkmann | Causes of Stability in Dynamic Coalition Formation | Appears in the 37th AAAI Conference on Artificial Intelligence
(AAAI), 2023 | null | null | null | cs.GT | http://creativecommons.org/licenses/by/4.0/ | We study the formation of stable outcomes via simple dynamics in cardinal
hedonic games, where the utilities of agents change over time depending on the
history of the coalition formation process. Specifically, we analyze situations
where members of a coalition decrease their utility for a leaving agent
(resent) or increase their utility for a joining agent (appreciation). We show
that in contrast to classical dynamics, for resentful or appreciative agents,
dynamics are guaranteed to converge under mild conditions for various stability
concepts. Thereby, we establish that both resent and appreciation are strong
stability-driving forces.
| [{'version': 'v1', 'created': 'Wed, 30 Nov 2022 17:05:55 GMT'}] | 2022-12-01 | [['Boehmer', 'Niclas', ''], ['Bullinger', 'Martin', ''], ['Kerkmann', 'Anna Maria', '']] |
2203.16517 | Sumitra Malagi Ms. | Hari Chandana Kuchibhotla, Sumitra S Malagi, Shivam Chandhok, Vineeth
N Balasubramanian | Unseen Classes at a Later Time? No Problem | To appear in CVPR 2022. Code is available @
(https://github.com/sumitramalagi/Unseen-classes-at-a-later-time) | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Recent progress towards learning from limited supervision has encouraged
efforts towards designing models that can recognize novel classes at test time
(generalized zero-shot learning or GZSL). GZSL approaches assume knowledge of
all classes, with or without labeled data, beforehand. However, practical
scenarios demand models that are adaptable and can handle dynamic addition of
new seen and unseen classes on the fly (that is continual generalized zero-shot
learning or CGZSL). One solution is to sequentially retrain and reuse
conventional GZSL methods, however, such an approach suffers from catastrophic
forgetting leading to suboptimal generalization performance. A few recent
efforts towards tackling CGZSL have been limited by difference in settings,
practicality, data splits and protocols followed-inhibiting fair comparison and
a clear direction forward. Motivated from these observations, in this work, we
firstly consolidate the different CGZSL setting variants and propose a new
Online-CGZSL setting which is more practical and flexible. Secondly, we
introduce a unified feature-generative framework for CGZSL that leverages
bi-directional incremental alignment to dynamically adapt to addition of new
classes, with or without labeled data, that arrive over time in any of these
CGZSL settings. Our comprehensive experiments and analysis on five benchmark
datasets and comparison with baselines show that our approach consistently
outperforms existing methods, especially on the more practical Online setting.
| [{'version': 'v1', 'created': 'Wed, 30 Mar 2022 17:52:16 GMT'}] | 2022-03-31 | [['Kuchibhotla', 'Hari Chandana', ''], ['Malagi', 'Sumitra S', ''], ['Chandhok', 'Shivam', ''], ['Balasubramanian', 'Vineeth N', '']] |
1811.03457 | Lukas Burkhalter | Lukas Burkhalter, Anwar Hithnawi, Alexander Viand, Hossein Shafagh,
Sylvia Ratnasamy | TimeCrypt: Encrypted Data Stream Processing at Scale with Cryptographic
Access Control | null | null | null | null | cs.CR | http://creativecommons.org/licenses/by/4.0/ | A growing number of devices and services collect detailed time series data
that is stored in the cloud. Protecting the confidentiality of this vast and
continuously generated data is an acute need for many applications in this
space. At the same time, we must preserve the utility of this data by enabling
authorized services to securely and selectively access and run analytics. This
paper presents TimeCrypt, a system that provides scalable and real-time
analytics over large volumes of encrypted time series data. TimeCrypt allows
users to define expressive data access and privacy policies and enforces it
cryptographically via encryption. In TimeCrypt, data is encrypted end-to-end,
and authorized parties can only decrypt and verify queries within their
authorized access scope. Our evaluation of TimeCrypt shows that its memory
overhead and performance are competitive and close to operating on data in the
clear.
| [{'version': 'v1', 'created': 'Thu, 8 Nov 2018 14:41:28 GMT'}, {'version': 'v2', 'created': 'Fri, 13 Mar 2020 17:11:41 GMT'}] | 2020-03-16 | [['Burkhalter', 'Lukas', ''], ['Hithnawi', 'Anwar', ''], ['Viand', 'Alexander', ''], ['Shafagh', 'Hossein', ''], ['Ratnasamy', 'Sylvia', '']] |
2202.00892 | Ivan Bajic | Takehiro Tanaka, Alon Harell, Ivan V. Baji\'c | Does Video Compression Impact Tracking Accuracy? | 5 pages, 6 figures, 3 tables, IEEE International Symposium on
Circuits and Systems (ISCAS) 2022 | null | null | null | cs.CV eess.IV | http://creativecommons.org/licenses/by/4.0/ | Everyone "knows" that compressing a video will degrade the accuracy of object
tracking. Yet, a literature search on this topic reveals that there is very
little documented evidence for this presumed fact. Part of the reason is that,
until recently, there were no object tracking datasets for uncompressed video,
which made studying the effects of compression on tracking accuracy difficult.
In this paper, using a recently published dataset that contains tracking
annotations for uncompressed videos, we examined the degradation of tracking
accuracy due to video compression using rigorous statistical methods.
Specifically, we examined the impact of quantization parameter (QP) and motion
search range (MSR) on Multiple Object Tracking Accuracy (MOTA). The results
show that QP impacts MOTA at the 95% confidence level, while there is
insufficient evidence to claim that MSR impacts MOTA. Moreover, regression
analysis allows us to derive a quantitative relationship between MOTA and QP
for the specific tracker used in the experiments.
| [{'version': 'v1', 'created': 'Wed, 2 Feb 2022 06:43:29 GMT'}] | 2022-02-03 | [['Tanaka', 'Takehiro', ''], ['Harell', 'Alon', ''], ['Bajić', 'Ivan V.', '']] |
physics/0306103 | Stefano Bagnasco | S. Bagnasco, R. Barbera, P. Buncic, F. Carminati, P. Cerello, P. Saiz | AliEn - EDG Interoperability in ALICE | Talk from the 2003 Computing in High Energy and Nuclear Physics
(CHEP03), La Jolla, Ca, USA, March 2003,4 pages, PDF, 2 figures. PSN TUCP005 | null | null | null | physics.comp-ph | null | AliEn (ALICE Environment) is a GRID-like system for large scale job
submission and distributed data management developed and used in the context of
ALICE, the CERN LHC heavy-ion experiment. With the aim of exploiting upcoming
Grid resources to run AliEn-managed jobs and store the produced data, the
problem of AliEn-EDG interoperability was addressed and an in-terface was
designed. One or more EDG (European Data Grid) User Interface machines run the
AliEn software suite (Cluster Monitor, Storage Element and Computing Element),
and act as interface nodes between the systems. An EDG Resource Broker is seen
by the AliEn server as a single Computing Element, while the EDG storage is
seen by AliEn as a single, large Storage Element; files produced in EDG sites
are registered in both the EDG Replica Catalogue and in the AliEn Data
Catalogue, thus ensuring accessibility from both worlds. In fact, both
registrations are required: the AliEn one is used for the data management, the
EDG one to guarantee the integrity and access to EDG produced data. A prototype
interface has been successfully deployed using the ALICE AliEn Server and the
EDG and DataTAG Testbeds.
| [{'version': 'v1', 'created': 'Fri, 13 Jun 2003 13:00:41 GMT'}] | 2007-05-23 | [['Bagnasco', 'S.', ''], ['Barbera', 'R.', ''], ['Buncic', 'P.', ''], ['Carminati', 'F.', ''], ['Cerello', 'P.', ''], ['Saiz', 'P.', '']] |
2204.04142 | Rongjun Qin | Shuang Song and Rongjun Qin | A Novel Intrinsic Image Decomposition Method to Recover Albedo for
Aerial Images in Photogrammetry Processing | to be published in ISPRS Congress 2022 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recovering surface albedos from photogrammetric images for realistic
rendering and synthetic environments can greatly facilitate its downstream
applications in VR/AR/MR and digital twins. The textured 3D models from
standard photogrammetric pipelines are suboptimal to these applications because
these textures are directly derived from images, which intrinsically embedded
the spatially and temporally variant environmental lighting information, such
as the sun illumination, direction, causing different looks of the surface,
making such models less realistic when used in 3D rendering under synthetic
lightings. On the other hand, since albedo images are less variable by
environmental lighting, it can, in turn, benefit basic photogrammetric
processing. In this paper, we attack the problem of albedo recovery for aerial
images for the photogrammetric process and demonstrate the benefit of albedo
recovery for photogrammetry data processing through enhanced feature matching
and dense matching. To this end, we proposed an image formation model with
respect to outdoor aerial imagery under natural illumination conditions; we
then, derived the inverse model to estimate the albedo by utilizing the typical
photogrammetric products as an initial approximation of the geometry. The
estimated albedo images are tested in intrinsic image decomposition,
relighting, feature matching, and dense matching/point cloud generation
results. Both synthetic and real-world experiments have demonstrated that our
method outperforms existing methods and can enhance photogrammetric processing.
| [{'version': 'v1', 'created': 'Fri, 8 Apr 2022 15:50:52 GMT'}] | 2022-04-11 | [['Song', 'Shuang', ''], ['Qin', 'Rongjun', '']] |
astro-ph/0109545 | Beata Malec | Marek Biesiada, Beata Malec (Institute of Physics, University of
Silesia) | White dwarf cooling and large extra dimensions | 9 pages,LaTeX, new references added. Phys. Rev. D in press | Phys.Rev. D65 (2002) 043008 | 10.1103/PhysRevD.65.043008 | null | astro-ph hep-ph physics.space-ph | null | Theories of fundamental interactions with large extra dimensions have
recently become very popular. Astrophysical bounds from the Sun, red-giants and
SN1987a have already been derived by other authors for the theory proposed by
Arkani-Hamed, Dimopoulos and Dvali. In this paper we consider G117-B15A
pulsating white dwarf (ZZ Ceti star) for which the secular rate at which the
period of its fundamental mode increases has been accurately measured and
claimed that this mode of G117-B15A is perhaps the most stable oscillation ever
recorded in the optical band. Because an additional channel of energy loss
(Kaluza-Klein gravitons) would speed up the cooling rate, one is able to use
the aforementioned stability to derive a bound on theories with large extra
dimensions. Within the framework of the theory with large extra dimensions
proposed by Arkani-Hamed, Dimopoulos and Dvali we find the lower bound on
string comapctification scale which is more stringent than solar or red-giant
bounds.
| [{'version': 'v1', 'created': 'Fri, 28 Sep 2001 09:58:35 GMT'}, {'version': 'v2', 'created': 'Tue, 18 Dec 2001 09:48:31 GMT'}] | 2009-11-07 | [['Biesiada', 'Marek', '', 'Institute of Physics, University of\n Silesia'], ['Malec', 'Beata', '', 'Institute of Physics, University of\n Silesia']] |
1507.04668 | Jiehang Zhang | J. Zhang, M. Tandecki. R. Collister, S. Aubin, J. A. Behr, E. Gomez,
G. Gwinner, L. A. Orozco, M. R. Pearson, and G. D. Sprouse | Hyperfine anomalies in Fr: boundaries of the spherical single particle
model | null | null | null | null | physics.atom-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We have measured the hyperfine splitting of the $7P_{1/2}$ state at the 100
ppm level in Fr isotopes ($^{206g,206m, 207, 209, 213, 221}$Fr) near the closed
neutron shell ($N$ = 126 in $^{213}$Fr). The measurements in five isotopes and
a nuclear isomeric state of francium, combined with previous determinations of
the $7S_{1/2}$ splittings, reveal the spatial distribution of the nuclear
magnetization, i.e. the Bohr-Weisskopf effect. We compare our results with a
simple shell model consisting of unpaired single valence nucleons orbiting a
spherical nucleus, and find good agreement over a range of neutron-deficient
isotopes ($^{207-213}$Fr). Also, we find near-constant proton anomalies for
several even-$ N$ isotopes. This identifies a set of Fr isotopes whose nuclear
structure can be understood well enough for the extraction of weak interaction
parameters from parity non-conservation studies.
| [{'version': 'v1', 'created': 'Thu, 16 Jul 2015 17:44:13 GMT'}] | 2015-07-17 | [['Zhang', 'J.', ''], ['Collister', 'M. Tandecki. R.', ''], ['Aubin', 'S.', ''], ['Behr', 'J. A.', ''], ['Gomez', 'E.', ''], ['Gwinner', 'G.', ''], ['Orozco', 'L. A.', ''], ['Pearson', 'M. R.', ''], ['Sprouse', 'G. D.', '']] |
1905.13291 | Karthikeyan Natesan Ramamurthy | Min-hwan Oh and Peder Olsen and Karthikeyan Natesan Ramamurthy | Counting and Segmenting Sorghum Heads | 23 pages, 23 figures, 5 tables | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Phenotyping is the process of measuring an organism's observable traits.
Manual phenotyping of crops is a labor-intensive, time-consuming, costly, and
error prone process. Accurate, automated, high-throughput phenotyping can
relieve a huge burden in the crop breeding pipeline. In this paper, we propose
a scalable, high-throughput approach to automatically count and segment
panicles (heads), a key phenotype, from aerial sorghum crop imagery. Our
counting approach uses the image density map obtained from dot or region
annotation as the target with a novel deep convolutional neural network
architecture. We also propose a novel instance segmentation algorithm using the
estimated density map, to identify the individual panicles in the presence of
occlusion. With real Sorghum aerial images, we obtain a mean absolute error
(MAE) of 1.06 for counting which is better than using well-known crowd counting
approaches such as CCNN, MCNN and CSRNet models. The instance segmentation
model also produces respectable results which will be ultimately useful in
reducing the manual annotation workload for future data.
| [{'version': 'v1', 'created': 'Thu, 30 May 2019 20:27:26 GMT'}] | 2019-06-03 | [['Oh', 'Min-hwan', ''], ['Olsen', 'Peder', ''], ['Ramamurthy', 'Karthikeyan Natesan', '']] |
1703.04060 | Derrick Wing Kwan Ng | Lou Zhao, Derrick Wing Kwan Ng, and Jinhong Yuan | Multi-user Precoding and Channel Estimation for Hybrid Millimeter Wave
Systems | 15 pages, accepted for publication, JSAC 2017 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we develop a low-complexity channel estimation for hybrid
millimeter wave (mmWave) systems, where the number of radio frequency (RF)
chains is much less than the number of antennas equipped at each transceiver.
The proposed mmWave channel estimation algorithm first exploits multiple
frequency tones to estimate the strongest angle-of-arrivals (AoAs) at both base
station (BS) and user sides for the design of analog beamforming matrices. Then
all the users transmit orthogonal pilot symbols to the BS along the directions
of the estimated strongest AoAs in order to estimate the channel. The estimated
channel will be adopted to design the digital zero-forcing (ZF) precoder at the
BS for the multi-user downlink transmission. The proposed channel estimation
algorithm is applicable to both nonsparse and sparse mmWave channel
environments. Furthermore, we derive a tight achievable rate upper bound of the
digital ZF precoding with the proposed channel estimation algorithm scheme. Our
analytical and simulation results show that the proposed scheme obtains a
considerable achievable rate of fully digital systems, where the number of RF
chains equipped at each transceiver is equal to the number of antennas.
Besides, by taking into account the effect of various types of errors, i.e.,
random phase errors, transceiver analog beamforming errors, and equivalent
channel estimation errors, we derive a closed-form approximation for the
achievable rate of the considered scheme. We illustrate the robustness of the
proposed channel estimation and multi-user downlink precoding scheme against
the system imperfection.
| [{'version': 'v1', 'created': 'Sun, 12 Mar 2017 02:27:20 GMT'}] | 2017-03-14 | [['Zhao', 'Lou', ''], ['Ng', 'Derrick Wing Kwan', ''], ['Yuan', 'Jinhong', '']] |
1706.06972 | Quanming Yao | Yaqing Wang, Quanming Yao, James T. Kwok, Lionel M. Ni | Scalable Online Convolutional Sparse Coding | null | null | 10.1109/TIP.2018.2842152 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Convolutional sparse coding (CSC) improves sparse coding by learning a
shift-invariant dictionary from the data. However, existing CSC algorithms
operate in the batch mode and are expensive, in terms of both space and time,
on large datasets. In this paper, we alleviate these problems by using online
learning. The key is a reformulation of the CSC objective so that convolution
can be handled easily in the frequency domain and much smaller history matrices
are needed. We use the alternating direction method of multipliers (ADMM) to
solve the resulting optimization problem and the ADMM subproblems have
efficient closed-form solutions. Theoretical analysis shows that the learned
dictionary converges to a stationary point of the optimization problem.
Extensive experiments show that convergence of the proposed method is much
faster and its reconstruction performance is also better. Moreover, while
existing CSC algorithms can only run on a small number of images, the proposed
method can handle at least ten times more images.
| [{'version': 'v1', 'created': 'Wed, 21 Jun 2017 15:50:12 GMT'}, {'version': 'v2', 'created': 'Thu, 19 Oct 2017 16:01:12 GMT'}, {'version': 'v3', 'created': 'Thu, 2 Nov 2017 15:55:05 GMT'}] | 2018-08-01 | [['Wang', 'Yaqing', ''], ['Yao', 'Quanming', ''], ['Kwok', 'James T.', ''], ['Ni', 'Lionel M.', '']] |
2210.03248 | Andrew Giuliani | Andrew Giuliani, Florian Wechsung, Antoine Cerfon, Matt Landreman,
Georg Stadler | Direct stellarator coil optimization for nested magnetic surfaces with
precise quasi-symmetry | null | null | null | null | physics.plasm-ph math.OC | http://creativecommons.org/licenses/by/4.0/ | We present a robust optimization algorithm for the design of electromagnetic
coils that generate vacuum magnetic fields with nested flux surfaces and
precise quasi-symmetry. The method is based on a bilevel optimization problem,
where the outer coil optimization is constrained by a set of inner
least-squares optimization problems whose solutions describe magnetic surfaces.
The outer optimization objective targets coils that generate a field with
nested magnetic surfaces and good quasi-symmetry. The inner optimization
problems identify magnetic surfaces when they exist, and approximate surfaces
in the presence of magnetic islands or chaos. We show that this formulation can
be used to heal islands and chaos, thus producing coils that result in magnetic
fields with precise quasi-symmetry. We show that the method can be initialized
with coils from the traditional two stage coil design process, as well as coils
from a near axis expansion optimization. We present a numerical example where
island chains are healed and quasi-symmetry is optimized up to surfaces with
aspect ratio 6. Another numerical example illustrates that the aspect ratio of
nested flux surfaces with optimized quasi-symmetry can be decreased from 6 to
approximately 4. The last example shows that our approach is robust and a
cold-start using coils from a near-axis expansion optimization.
| [{'version': 'v1', 'created': 'Thu, 6 Oct 2022 23:20:20 GMT'}, {'version': 'v2', 'created': 'Sat, 14 Jan 2023 20:43:46 GMT'}, {'version': 'v3', 'created': 'Mon, 13 Mar 2023 23:22:52 GMT'}] | 2023-03-15 | [['Giuliani', 'Andrew', ''], ['Wechsung', 'Florian', ''], ['Cerfon', 'Antoine', ''], ['Landreman', 'Matt', ''], ['Stadler', 'Georg', '']] |
Subsets and Splits