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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2211.03756 | Momiao Xiong | Kai Zhang, Shan Liu, and Momiao Xiong | Changes from Classical Statistics to Modern Statistics and Data Science | 37 pages | null | null | null | stat.ME cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A coordinate system is a foundation for every quantitative science,
engineering, and medicine. Classical physics and statistics are based on the
Cartesian coordinate system. The classical probability and hypothesis testing
theory can only be applied to Euclidean data. However, modern data in the real
world are from natural language processing, mathematical formulas, social
networks, transportation and sensor networks, computer visions, automations,
and biomedical measurements. The Euclidean assumption is not appropriate for
non Euclidean data. This perspective addresses the urgent need to overcome
those fundamental limitations and encourages extensions of classical
probability theory and hypothesis testing , diffusion models and stochastic
differential equations from Euclidean space to non Euclidean space. Artificial
intelligence such as natural language processing, computer vision, graphical
neural networks, manifold regression and inference theory, manifold learning,
graph neural networks, compositional diffusion models for automatically
compositional generations of concepts and demystifying machine learning
systems, has been rapidly developed. Differential manifold theory is the
mathematic foundations of deep learning and data science as well. We urgently
need to shift the paradigm for data analysis from the classical Euclidean data
analysis to both Euclidean and non Euclidean data analysis and develop more and
more innovative methods for describing, estimating and inferring non Euclidean
geometries of modern real datasets. A general framework for integrated analysis
of both Euclidean and non Euclidean data, composite AI, decision intelligence
and edge AI provide powerful innovative ideas and strategies for fundamentally
advancing AI. We are expected to marry statistics with AI, develop a unified
theory of modern statistics and drive next generation of AI and data science.
| [{'version': 'v1', 'created': 'Sun, 30 Oct 2022 21:35:53 GMT'}] | 2022-11-08 | [['Zhang', 'Kai', ''], ['Liu', 'Shan', ''], ['Xiong', 'Momiao', '']] |
2104.14418 | Haoguang Yang | Haoguang Yang, Mythra V. Balakuntala, Abigayle E. Moser, Jhon J.
Qui\~nones, Ali Doosttalab, Antonio Esquivel-Puentes, Tanya Purwar, Luciano
Castillo, Nina Mahmoudian, Richard M. Voyles | Enhancing Safety of Students with Mobile Air Filtration during School
Reopening from COVID-19 | Manuscript accepted by 2021 IEEE International Conference on Robotics
and Automation (ICRA) | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The paper discusses how robots enable occupant-safe continuous protection for
students when schools reopen. Conventionally, fixed air filters are not used as
a key pandemic prevention method for public indoor spaces because they are
unable to trap the airborne pathogens in time in the entire room. However, by
combining the mobility of a robot with air filtration, the efficacy of cleaning
up the air around multiple people is largely increased. A disinfection co-robot
prototype is thus developed to provide continuous and occupant-friendly
protection to people gathering indoors, specifically for students in a
classroom scenario. In a static classroom with students sitting in a grid
pattern, the mobile robot is able to serve up to 14 students per cycle while
reducing the worst-case pathogen dosage by 20%, and with higher robustness
compared to a static filter. The extent of robot protection is optimized by
tuning the passing distance and speed, such that a robot is able to serve more
people given a threshold of worst-case dosage a person can receive.
| [{'version': 'v1', 'created': 'Thu, 29 Apr 2021 15:31:56 GMT'}] | 2021-04-30 | [['Yang', 'Haoguang', ''], ['Balakuntala', 'Mythra V.', ''], ['Moser', 'Abigayle E.', ''], ['Quiñones', 'Jhon J.', ''], ['Doosttalab', 'Ali', ''], ['Esquivel-Puentes', 'Antonio', ''], ['Purwar', 'Tanya', ''], ['Castillo', 'Luciano', ''], ['Mahmoudian', 'Nina', ''], ['Voyles', 'Richard M.', '']] |
2010.08292 | Laura M. Castro | Laura M. Castro | It was never about the language: paradigm impact on software design
decisions | 4th Computational Methods in Systems and Software (2020) | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Programming languages development has intensified in recent years. New ones
are created; new features, often cross-paradigm, are featured in old ones. This
new programming landscape makes language selection a more complex decision,
both from the companies points of view (technical, recruiting) and from the
developers point of view (career development). In this paper, however, we argue
that programming languages have a secondary role in software development design
decisions. We illustrate, based on a practical example, how the main influencer
are higher-level traits: those traditionally assigned with programming
paradigms. Following this renovated perspective, concerns about language choice
are shifted for all parties. Beyond particular syntax, grammar, execution model
or code organization, the main consequence of the predominance of one paradigm
or another in the mind of the developer is the way solutions are designed.
| [{'version': 'v1', 'created': 'Fri, 16 Oct 2020 10:30:58 GMT'}] | 2020-10-19 | [['Castro', 'Laura M.', '']] |
2211.10819 | Rosa M Badia | Riccardo Cantini, Fabrizio Marozzo, Alessio Orsino, Domenico Talia,
Paolo Trunfio, Rosa M. Badia, Jorge Ejarque, Fernando Vazquez | Block size estimation for data partitioning in HPC applications using
machine learning techniques | null | null | null | null | cs.DC cs.AI | http://creativecommons.org/licenses/by/4.0/ | The extensive use of HPC infrastructures and frameworks for running
data-intensive applications has led to a growing interest in data partitioning
techniques and strategies. In fact, finding an effective partitioning, i.e. a
suitable size for data blocks, is a key strategy to speed-up parallel
data-intensive applications and increase scalability. This paper describes a
methodology for data block size estimation in HPC applications, which relies on
supervised machine learning techniques. The implementation of the proposed
methodology was evaluated using as a testbed dislib, a distributed computing
library highly focused on machine learning algorithms built on top of the
PyCOMPSs framework. We assessed the effectiveness of our solution through an
extensive experimental evaluation considering different algorithms, datasets,
and infrastructures, including the MareNostrum 4 supercomputer. The results we
obtained show that the methodology is able to efficiently determine a suitable
way to split a given dataset, thus enabling the efficient execution of
data-parallel applications in high performance environments.
| [{'version': 'v1', 'created': 'Sat, 19 Nov 2022 23:04:14 GMT'}] | 2022-11-22 | [['Cantini', 'Riccardo', ''], ['Marozzo', 'Fabrizio', ''], ['Orsino', 'Alessio', ''], ['Talia', 'Domenico', ''], ['Trunfio', 'Paolo', ''], ['Badia', 'Rosa M.', ''], ['Ejarque', 'Jorge', ''], ['Vazquez', 'Fernando', '']] |
1708.03027 | Rongrong Zhang | Rongrong Zhang, Wei Deng, Michael Yu Zhu | Using Deep Neural Networks to Automate Large Scale Statistical Analysis
for Big Data Applications | null | null | null | null | stat.ML cs.LG stat.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Statistical analysis (SA) is a complex process to deduce population
properties from analysis of data. It usually takes a well-trained analyst to
successfully perform SA, and it becomes extremely challenging to apply SA to
big data applications. We propose to use deep neural networks to automate the
SA process. In particular, we propose to construct convolutional neural
networks (CNNs) to perform automatic model selection and parameter estimation,
two most important SA tasks. We refer to the resulting CNNs as the neural model
selector and the neural model estimator, respectively, which can be properly
trained using labeled data systematically generated from candidate models.
Simulation study shows that both the selector and estimator demonstrate
excellent performances. The idea and proposed framework can be further extended
to automate the entire SA process and have the potential to revolutionize how
SA is performed in big data analytics.
| [{'version': 'v1', 'created': 'Wed, 9 Aug 2017 22:34:36 GMT'}] | 2017-08-11 | [['Zhang', 'Rongrong', ''], ['Deng', 'Wei', ''], ['Zhu', 'Michael Yu', '']] |
2204.04316 | Ayan Banerjee | Sauvik Roy, Nirmalya Ghosh, Ayan Banerjee, Subhasish Dutta Gupta | Manipulating the transverse spin angular momentum and Belinfante
momentum of spin-polarized light by a tilted stratified medium in optical
tweezers | 10 pages, 10 figures | null | 10.1103/PhysRevA.105.063514 | null | physics.optics | http://creativecommons.org/licenses/by/4.0/ | In the recent past, optical tweezers incorporating a stratified medium have
been exploited to generate complex translational and rotational dynamics in
mesoscopic particles due to the coupling between the spin and orbital angular
momentum of the light, generated as a consequence of the tight focusing of
light by a high numerical aperture objective lens into the stratified medium.
Here, we consider an optical tweezers system with a tilted stratified medium
(direction of stratification at an angle with the axis of the incident beam),
and show that for input circularly polarized Gaussian beams, the resulting
spin-orbit interaction deeply influences the generation of transverse spin
angular momentum (TSAM) and Belinfante momentum of light, and allows additional
control on their magnitude. Importantly, the TSAM generated in our system
consists of both the orthogonal components, which is in sharp contrast to the
case of evanescent waves and surface plasmons, where only one of the TSAM
components are generated. The broken symmetry due to the tilt ensures that,
depending upon the helicity of the input beam, the magnitude of the mutually
orthogonal components of the TSAM depend entirely on the tilt angle. This may
prove to be an effective handle in exotic spin-controlled manipulation of
particles in experiments.
| [{'version': 'v1', 'created': 'Fri, 8 Apr 2022 22:22:49 GMT'}, {'version': 'v2', 'created': 'Tue, 12 Apr 2022 20:55:53 GMT'}] | 2022-07-13 | [['Roy', 'Sauvik', ''], ['Ghosh', 'Nirmalya', ''], ['Banerjee', 'Ayan', ''], ['Gupta', 'Subhasish Dutta', '']] |
2201.12346 | Ting Hu | Ting Hu | DiriNet: A network to estimate the spatial and spectral degradation
functions | null | null | null | null | cs.CV cs.AI cs.LG eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The spatial and spectral degradation functions are critical to hyper- and
multi-spectral image fusion. However, few work has been payed on the estimation
of the degradation functions. To learn the spatial response function and the
point spread function from the image pairs to be fused, we propose a Dirichlet
network, where both functions are properly constrained. Specifically, the
spatial response function is constrained with positivity, while the Dirichlet
distribution along with a total variation is imposed on the point spread
function. To the best of our knowledge, the neural netwrok and the Dirichlet
regularization are exclusively investigated, for the first time, to estimate
the degradation functions. Both image degradation and fusion experiments
demonstrate the effectiveness and superiority of the proposed Dirichlet
network.
| [{'version': 'v1', 'created': 'Thu, 27 Jan 2022 07:24:52 GMT'}] | 2022-02-01 | [['Hu', 'Ting', '']] |
2106.12709 | Ygor Sousa | Ygor C. N. Sousa, Hansenclever F. Bassani | Topological Semantic Mapping by Consolidation of Deep Visual Features | 8 pages, 4 figures | IEEE Robotics and Automation Letters, vol. 7, no. 2, pp.
4110-4117, April 2022 | 10.1109/LRA.2022.3149572 | null | cs.CV cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many works in the recent literature introduce semantic mapping methods that
use CNNs (Convolutional Neural Networks) to recognize semantic properties in
images. The types of properties (eg.: room size, place category, and objects)
and their classes (eg.: kitchen and bathroom, for place category) are usually
predefined and restricted to a specific task. Thus, all the visual data
acquired and processed during the construction of the maps are lost and only
the recognized semantic properties remain on the maps. In contrast, this work
introduces a topological semantic mapping method that uses deep visual features
extracted by a CNN (GoogLeNet), from 2D images captured in multiple views of
the environment as the robot operates, to create, through averages,
consolidated representations of the visual features acquired in the regions
covered by each topological node. These representations allow flexible
recognition of semantic properties of the regions and use in other visual
tasks. Experiments with a real-world indoor dataset showed that the method is
able to consolidate the visual features of regions and use them to recognize
objects and place categories as semantic properties, and to indicate the
topological location of images, with very promising results.
| [{'version': 'v1', 'created': 'Thu, 24 Jun 2021 01:10:03 GMT'}, {'version': 'v2', 'created': 'Mon, 6 Sep 2021 17:05:30 GMT'}, {'version': 'v3', 'created': 'Tue, 28 Dec 2021 19:16:11 GMT'}] | 2022-03-22 | [['Sousa', 'Ygor C. N.', ''], ['Bassani', 'Hansenclever F.', '']] |
2204.03748 | J\"org Rieckermann | Simon Mathis, Juan-Mario Gruber, Christian Ebi, Simon Bloem, J\"org
Rieckermann, Frank Blumensaat | Energy self-sufficient systems for monitoring sewer networks | To be published in proceedings of the conference "21. ITG/GMA-
Fachtagung Sensoren und Messsysteme 2022", 10.-11. Mai 2022, N\"urnberger
CongressCenter, Nuremberg, Germany, or IEEE explore | null | null | null | eess.SY cs.SY | http://creativecommons.org/licenses/by-sa/4.0/ | Underground infrastructure networks form the backbone of vital supply and
disposal systems. However, they are under-monitored in comparison to their
value. This is due, in large part, to the lack of energy supply for monitoring
and data transmission. In this paper, we investigate a novel, energy harvesting
system used to power underground sewer infrastructure monitoring networks. The
system collects the required energy from ambient sources, such as temperature
differences or residual light in sewer networks. A prototype was developed that
could use either a thermoelectric generator (TEG) or a solar cell to capture
the energy needed to acquire and transmit ultrasonic water level data via
LoRaWAN. Real-world field trials were satisfactory and showed the potential
power output, as well as, possibilities to improve the system. Using an
extrapolation model, we proved that the developed solution could work reliably
throughout the year.
| [{'version': 'v1', 'created': 'Thu, 7 Apr 2022 21:28:44 GMT'}] | 2022-04-11 | [['Mathis', 'Simon', ''], ['Gruber', 'Juan-Mario', ''], ['Ebi', 'Christian', ''], ['Bloem', 'Simon', ''], ['Rieckermann', 'Jörg', ''], ['Blumensaat', 'Frank', '']] |
2211.04738 | Tao Xiong | Guoliang Zhang and Hongqiang Zhu and Tao Xiong | Asymptotic preserving and uniformly unconditionally stable finite
difference schemes for kinetic transport equations | null | null | null | null | math.NA cs.NA | http://creativecommons.org/licenses/by/4.0/ | In this paper, uniformly unconditionally stable first and second order finite
difference schemes are developed for kinetic transport equations in the
diffusive scaling. We first derive an approximate evolution equation for the
macroscopic density, from the formal solution of the distribution function,
which is then discretized by following characteristics for the transport part
with a backward finite difference semi-Lagrangian approach, while the diffusive
part is discretized implicitly. After the macroscopic density is available, the
distribution function can be efficiently solved even with a fully implicit time
discretization, since all discrete velocities are decoupled, resulting in a
low-dimensional linear system from spatial discretizations at each discrete
velocity. Both first and second order discretizations in space and in time are
considered. The resulting schemes can be shown to be asymptotic preserving (AP)
in the diffusive limit. Uniformly unconditional stabilities are verified from a
Fourier analysis based on eigenvalues of corresponding amplification matrices.
Numerical experiments, including high dimensional problems, have demonstrated
the corresponding orders of accuracy both in space and in time, uniform
stability, AP property, and good performances of our proposed approach.
| [{'version': 'v1', 'created': 'Wed, 9 Nov 2022 08:25:27 GMT'}] | 2022-11-10 | [['Zhang', 'Guoliang', ''], ['Zhu', 'Hongqiang', ''], ['Xiong', 'Tao', '']] |
2009.05599 | Seyyed Mostafa Mousavi Janbeh Sarayi | Sina Eftekhar, Seyyed Mostafa Mousavi Janbeh Sarayi | Dynamic analysis of tapping-mode AFM with sidewall probe subjected to
effects of probe mass and sidewall extension | null | IEEE International Conference on Electrical, Electronics,
Computers, Communication, Mechanical and Computing (EECCMC)At (2018) | null | null | physics.app-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Atomic Force Microscopy with SideWall (AFM SW) is widely used for nano-scale
surface measurements at side surfaces. In the current study, by taking into
consideration the effects of sidewall beam and its probe, an analytical method
is developed to explore the dynamics of AFM-SW. The effect of probe mass,
sidewall extension length, and tip sample interactions on the resonance
frequencies and amplitude of Micro-Cantilever is widely investigated. The
obtained results of the analytical model demonstrate the significant effect of
these parameters on the dynamics of AFM-SW. To verify the accuracy of the
analytical model, the obtained results are compared against the simulation data
of previously published works and a good agreement is observed. Resonance
Frequency (RF) of cantilever clearly declines when the mass of probe is taken
to account, especially in higher RFs. Besides, probe effect on RF is higher
when sidewall beam is longer. Resonance frequency decreases when tip-sample
interaction or probe mass is high, yet the amount of reduction is intensified
when probe mass and interaction together are at higher point. An analytical
method is developed to explore the dynamics of Atomic Force Microscopy with
considering SideWall beam effects (AFM-SW). The effect of probe mass, sidewall
extension length, and tip sample interactions on vibration of micro-cantilever
is investigated. The obtained results are compared with previous literatures.
The results show that Resonance Frequency (RF) of cantilever declines when the
mass of probe is taken to account. Besides, probe effect on RF is higher when
sidewall beam is longer. Resonance frequency decreases when tip-sample
interaction or probe mass is high, yet the amount of reduction is intensified
when they are at higher point.
| [{'version': 'v1', 'created': 'Fri, 11 Sep 2020 18:25:48 GMT'}] | 2020-09-15 | [['Eftekhar', 'Sina', ''], ['Sarayi', 'Seyyed Mostafa Mousavi Janbeh', '']] |
2105.12459 | Tsuyoshi Yoneda | Tsuyoshi Yoneda, Susumu Goto and Tomonori Tsuruhashi | Mathematical reformulation of the Kolmogorov-Richardson energy cascade
in terms of vortex stretching | null | null | 10.1088/1361-6544/ac4b3b | null | physics.flu-dyn math.AP | http://creativecommons.org/licenses/by/4.0/ | In this paper, with the aid of direct numerical simulations (DNS) of forced
turbulence in a periodic domain, we mathematically reformulate the
Kolmogorov-Richardson energy cascade in terms of vortex stretching. By using
the description, we prove that if the Navier-Stokes flow satisfies a new
regularity criterion in terms of the enstrophy production rate, then the flow
does not blow up. Our DNS results seem to support this regularity criterion.
Next, we mathematically construct the hierarchy of tubular vortices, which is
statistically self-similar in the inertial range. Under the assumptions of the
scale-locally of the vortex stretching/compressing (i.e. energy cascade)
process and the statistical independence between vortices that are not directly
stretched or compressed, we can derive the $-5/3$ power law of the energy
spectrum of statistically stationary turbulence without directly using the
Kolmogorov hypotheses.
| [{'version': 'v1', 'created': 'Wed, 26 May 2021 10:36:47 GMT'}, {'version': 'v2', 'created': 'Wed, 8 Dec 2021 04:33:38 GMT'}] | 2022-02-16 | [['Yoneda', 'Tsuyoshi', ''], ['Goto', 'Susumu', ''], ['Tsuruhashi', 'Tomonori', '']] |
2012.05462 | Yujia Zheng | Yujia Zheng, Siyi Liu, Zekun Li, Shu Wu | Cold-start Sequential Recommendation via Meta Learner | Accepted at AAAI 2021 | null | null | null | cs.IR cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper explores meta-learning in sequential recommendation to alleviate
the item cold-start problem. Sequential recommendation aims to capture user's
dynamic preferences based on historical behavior sequences and acts as a key
component of most online recommendation scenarios. However, most previous
methods have trouble recommending cold-start items, which are prevalent in
those scenarios. As there is generally no side information in the setting of
sequential recommendation task, previous cold-start methods could not be
applied when only user-item interactions are available. Thus, we propose a
Meta-learning-based Cold-Start Sequential Recommendation Framework, namely
Mecos, to mitigate the item cold-start problem in sequential recommendation.
This task is non-trivial as it targets at an important problem in a novel and
challenging context. Mecos effectively extracts user preference from limited
interactions and learns to match the target cold-start item with the potential
user. Besides, our framework can be painlessly integrated with neural
network-based models. Extensive experiments conducted on three real-world
datasets verify the superiority of Mecos, with the average improvement up to
99%, 91%, and 70% in HR@10 over state-of-the-art baseline methods.
| [{'version': 'v1', 'created': 'Thu, 10 Dec 2020 05:23:13 GMT'}] | 2020-12-11 | [['Zheng', 'Yujia', ''], ['Liu', 'Siyi', ''], ['Li', 'Zekun', ''], ['Wu', 'Shu', '']] |
1109.0697 | Han-Xin Yang | Han-Xin Yang, Wen-Xu Wang, Zhi-Xi Wu, and Bing-Hong Wang | Traffic dynamics in scale-free networks with limited packet-delivering
capacity | null | Physica A 387 (2008) 6857-6862 | 10.1016/j.physa.2008.09.016 | null | cs.NI physics.soc-ph | http://creativecommons.org/licenses/by-nc-sa/3.0/ | We propose a limited packet-delivering capacity model for traffic dynamics in
scale-free networks. In this model, the total node's packet-delivering capacity
is fixed, and the allocation of packet-delivering capacity on node $i$ is
proportional to $k_{i}^{\phi}$, where $k_{i}$ is the degree of node $i$ and
$\phi$ is a adjustable parameter. We have applied this model on the shortest
path routing strategy as well as the local routing strategy, and found that
there exists an optimal value of parameter $\phi$ leading to the maximal
network capacity under both routing strategies. We provide some explanations
for the emergence of optimal $\phi$.
| [{'version': 'v1', 'created': 'Sun, 4 Sep 2011 11:35:03 GMT'}] | 2015-05-30 | [['Yang', 'Han-Xin', ''], ['Wang', 'Wen-Xu', ''], ['Wu', 'Zhi-Xi', ''], ['Wang', 'Bing-Hong', '']] |
2102.06981 | Jon-Lark Kim | Jon-Lark Kim, Dong Eun Ohk | DNA codes over two noncommutative rings of order four | 21 pages, 1st revision | null | null | null | cs.IT math.IT | http://creativecommons.org/licenses/by/4.0/ | In this paper, we describe a new type of DNA codes over two noncommutative
rings $E$ and $F$ of order four with characteristic 2. Our DNA codes are based
on quasi self-dual codes over $E$ and $F$. Using quasi self-duality, we can
describe fixed GC-content constraint weight distributions and
reverse-complement constraint minimum distributions of those codes.
| [{'version': 'v1', 'created': 'Sat, 13 Feb 2021 18:41:57 GMT'}, {'version': 'v2', 'created': 'Thu, 13 May 2021 19:33:45 GMT'}] | 2021-05-17 | [['Kim', 'Jon-Lark', ''], ['Ohk', 'Dong Eun', '']] |
0708.2717 | Alejandro Vaisman Prof. | Leticia Gomez, Bart Kuijpers, Alejandro Vaisman | Aggregation Languages for Moving Object and Places of Interest Data | 15 pages, 5 figures | null | null | null | cs.DB | null | We address aggregate queries over GIS data and moving object data, where
non-spatial data are stored in a data warehouse. We propose a formal data model
and query language to express complex aggregate queries. Next, we study the
compression of trajectory data, produced by moving objects, using the notions
of stops and moves. We show that stops and moves are expressible in our query
language and we consider a fragment of this language, consisting of regular
expressions to talk about temporally ordered sequences of stops and moves. This
fragment can be used to efficiently express data mining and pattern matching
tasks over trajectory data.
| [{'version': 'v1', 'created': 'Mon, 20 Aug 2007 20:08:53 GMT'}] | 2007-08-22 | [['Gomez', 'Leticia', ''], ['Kuijpers', 'Bart', ''], ['Vaisman', 'Alejandro', '']] |
1503.05692 | Bashir Sadiq Mr | B O. Sadiq, S.M. Sani and S. Garba | An approach to improving edge detection for facial and remotely sensed
images using vector order statistics | 9 pages, 11 figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents an improved edge detection algorithm for facial and
remotely sensed images using vector order statistics. The developed algorithm
processes colored images directly without been converted to gray scale. A
number of the existing algorithms converts the colored images into gray scale
before detection of edges. But this process leads to inaccurate precision of
recognized edges, thus producing false and broken edges in the output edge map.
Facial and remotely sensed images consist of curved edge lines which have to be
detected continuously to prevent broken edges. In order to deal with this, a
collection of pixel approach is introduced with a view to minimizing the false
and broken edges that exists in the generated output edge map of facial and
remotely sensed images.
| [{'version': 'v1', 'created': 'Thu, 19 Mar 2015 10:18:05 GMT'}] | 2015-03-20 | [['Sadiq', 'B O.', ''], ['Sani', 'S. M.', ''], ['Garba', 'S.', '']] |
2202.03505 | Steven Rogak | Thomas W. Bement, Ania Mitros, Rebecca Lau, Timothy A. Sipkens,
Jocelyn Songer, Heidi Alexander, Devon Ostrom, Hamed Nikookar and Steven. N.
Rogak | Filtration and breathability of nonwoven fabrics used in washable masks | 39 pages including supplemental information | null | null | null | physics.med-ph | http://creativecommons.org/licenses/by-nc-nd/4.0/ | This study explores nonwoven and woven fabrics to improve upon the
performance of the widespread all-cotton mask, and examines the effect of
layering, machine washing and drying on their filtration and breathability for
submicron and supermicron particles. Individual materials were evaluated for
their quality factor, Q, which combines filtration efficiency and
breathability. Filtration was tested against particles 0.5 to 5 micron
aerodynamic diameter. Nonwoven polyester and nonwoven polypropylene (craft
fabrics, medical masks, and medical wraps) showed higher quality factors than
woven materials (flannel cotton, Kona cotton, sateen cotton). Materials with
meltblown nonwoven polypropylene filtered best, especially against submicron
particles. Subsequently, we combined high performing fabrics into multi-layer
sets, evaluating the sets quality factors before and after our washing
protocol, which included machine washing, machine drying, and isopropanol soak.
Sets incorporating meltblown nonwoven polypropylene designed for filtration
(Filti and surgical mask) degraded significantly post-wash in the submicron
range where they excelled prior to washing (Q = 57 and 79 at 1 micron,
respectively, degraded to Q = 10 and 15 post-wash). Washing caused lesser
quality degradation in sets incorporating spunbond non-woven polypropylene or
medical wraps (Q = 12 to 24 pre-wash, Q = 8 to 10 post-wash). Post-wash quality
factors are similar for all multi-layer sets in this study, and higher than
Kona quilting cotton (Q = 6). Washed multi-layer sets filtered 12-42 percent of
0.5 micron, 27-76 percent of 1 micron, 58-96 percent of 2.8 micron, and 72-100
percent of 4.2 micron particles. The measured filtration and pressure drop of
both the homogeneous and heterogeneous multi-layer fabric combinations agreed
with the estimations from the layering model.
| [{'version': 'v1', 'created': 'Mon, 7 Feb 2022 20:41:03 GMT'}] | 2022-02-09 | [['Bement', 'Thomas W.', ''], ['Mitros', 'Ania', ''], ['Lau', 'Rebecca', ''], ['Sipkens', 'Timothy A.', ''], ['Songer', 'Jocelyn', ''], ['Alexander', 'Heidi', ''], ['Ostrom', 'Devon', ''], ['Nikookar', 'Hamed', ''], ['Rogak', 'Steven. N.', '']] |
2202.12210 | Casey King | Siduo Jiang, Cristopher Benge, William Casey King | BERTVision -- A Parameter-Efficient Approach for Question Answering | 7 pages, 11 with appendix | null | null | null | cs.CL cs.LG | http://creativecommons.org/licenses/by/4.0/ | We present a highly parameter efficient approach for Question Answering that
significantly reduces the need for extended BERT fine-tuning. Our method uses
information from the hidden state activations of each BERT transformer layer,
which is discarded during typical BERT inference. Our best model achieves
maximal BERT performance at a fraction of the training time and GPU or TPU
expense. Performance is further improved by ensembling our model with BERTs
predictions. Furthermore, we find that near optimal performance can be achieved
for QA span annotation using less training data. Our experiments show that this
approach works well not only for span annotation, but also for classification,
suggesting that it may be extensible to a wider range of tasks.
| [{'version': 'v1', 'created': 'Thu, 24 Feb 2022 17:16:25 GMT'}] | 2022-02-25 | [['Jiang', 'Siduo', ''], ['Benge', 'Cristopher', ''], ['King', 'William Casey', '']] |
2303.01242 | Tianyue Wu | Tianyue Wu and Fei Gao | Distributed Optimization in Sensor Network for Scalable Multi-Robot
Relative State Estimation | 8 pages, 3 figures, 2 tables | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper is dedicated to achieving scalable relative state estimation using
inter-robot Euclidean distance measurements. We consider equipping robots with
distance sensors and focus on the optimization problem underlying relative
state estimation in this setup. We reveal the commonality between this problem
and the coordinates realization problem of a sensor network. Based on this
insight, we propose an effective unconstrained optimization model to infer the
relative states among robots. To work on this model in a distributed manner, we
propose an efficient and scalable optimization algorithm with the classical
block coordinate descent method as its backbone. This algorithm exactly solves
each block update subproblem with a closed-form solution while ensuring
convergence. Our results pave the way for distance measurements-based relative
state estimation in large-scale multi-robot systems.
| [{'version': 'v1', 'created': 'Thu, 2 Mar 2023 13:32:16 GMT'}] | 2023-03-03 | [['Wu', 'Tianyue', ''], ['Gao', 'Fei', '']] |
2201.09355 | Malsha V Perera | Malsha V. Perera, Wele Gedara Chaminda Bandara, Jeya Maria Jose
Valanarasu, and Vishal M. Patel | Transformer-based SAR Image Despeckling | Submitted to International Geoscience and Remote Sensing Symposium
(IGARSS), 2022. Our code is available at
https://github.com/malshaV/sar_transformer | null | null | null | cs.CV eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Synthetic Aperture Radar (SAR) images are usually degraded by a
multiplicative noise known as speckle which makes processing and interpretation
of SAR images difficult. In this paper, we introduce a transformer-based
network for SAR image despeckling. The proposed despeckling network comprises
of a transformer-based encoder which allows the network to learn global
dependencies between different image regions - aiding in better despeckling.
The network is trained end-to-end with synthetically generated speckled images
using a composite loss function. Experiments show that the proposed method
achieves significant improvements over traditional and convolutional neural
network-based despeckling methods on both synthetic and real SAR images.
| [{'version': 'v1', 'created': 'Sun, 23 Jan 2022 20:09:01 GMT'}] | 2022-01-25 | [['Perera', 'Malsha V.', ''], ['Bandara', 'Wele Gedara Chaminda', ''], ['Valanarasu', 'Jeya Maria Jose', ''], ['Patel', 'Vishal M.', '']] |
1605.07850 | Francesco Scazza | G. Valtolina, F. Scazza, A. Amico, A. Burchianti, A. Recati, T. Enss,
M. Inguscio, M. Zaccanti and G. Roati | Exploring the ferromagnetic behaviour of a repulsive Fermi gas via spin
dynamics | 8 + 17 pages, 4 + 8 figures, 44 + 19 references | Nature Physics 13, 704-709 (2017) | 10.1038/nphys4108 | null | cond-mat.quant-gas physics.atom-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Ferromagnetism is a manifestation of strong repulsive interactions between
itinerant fermions in condensed matter. Whether short-ranged repulsion alone is
sufficient to stabilize ferromagnetic correlations in the absence of other
effects, like peculiar band dispersions or orbital couplings, is however
unclear. Here, we investigate ferromagnetism in the minimal framework of an
ultracold Fermi gas with short-range repulsive interactions tuned via a
Feshbach resonance. While fermion pairing characterises the ground state, our
experiments provide signatures suggestive of a metastable Stoner-like
ferromagnetic phase supported by strong repulsion in excited scattering states.
We probe the collective spin response of a two-spin mixture engineered in a
magnetic domain-wall-like configuration, and reveal a substantial increase of
spin susceptibility while approaching a critical repulsion strength. Beyond
this value, we observe the emergence of a time-window of domain immiscibility,
indicating the metastability of the initial ferromagnetic state. Our findings
establish an important connection between dynamical and equilibrium properties
of strongly-correlated Fermi gases, pointing to the existence of a
ferromagnetic instability.
| [{'version': 'v1', 'created': 'Wed, 25 May 2016 12:24:06 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Feb 2017 23:15:50 GMT'}] | 2017-07-07 | [['Valtolina', 'G.', ''], ['Scazza', 'F.', ''], ['Amico', 'A.', ''], ['Burchianti', 'A.', ''], ['Recati', 'A.', ''], ['Enss', 'T.', ''], ['Inguscio', 'M.', ''], ['Zaccanti', 'M.', ''], ['Roati', 'G.', '']] |
1902.05581 | Wenju Xu | Wenju Xu and Shawn Keshmiri and Guanghui Wang | Adversarially Approximated Autoencoder for Image Generation and
Manipulation | null | null | null | null | cs.LG cs.CV eess.IV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Regularized autoencoders learn the latent codes, a structure with the
regularization under the distribution, which enables them the capability to
infer the latent codes given observations and generate new samples given the
codes. However, they are sometimes ambiguous as they tend to produce
reconstructions that are not necessarily faithful reproduction of the inputs.
The main reason is to enforce the learned latent code distribution to match a
prior distribution while the true distribution remains unknown. To improve the
reconstruction quality and learn the latent space a manifold structure, this
work present a novel approach using the adversarially approximated autoencoder
(AAAE) to investigate the latent codes with adversarial approximation. Instead
of regularizing the latent codes by penalizing on the distance between the
distributions of the model and the target, AAAE learns the autoencoder flexibly
and approximates the latent space with a simpler generator. The ratio is
estimated using generative adversarial network (GAN) to enforce the similarity
of the distributions. Additionally, the image space is regularized with an
additional adversarial regularizer. The proposed approach unifies two deep
generative models for both latent space inference and diverse generation. The
learning scheme is realized without regularization on the latent codes, which
also encourages faithful reconstruction. Extensive validation experiments on
four real-world datasets demonstrate the superior performance of AAAE. In
comparison to the state-of-the-art approaches, AAAE generates samples with
better quality and shares the properties of regularized autoencoder with a nice
latent manifold structure.
| [{'version': 'v1', 'created': 'Thu, 14 Feb 2019 19:54:13 GMT'}] | 2019-02-18 | [['Xu', 'Wenju', ''], ['Keshmiri', 'Shawn', ''], ['Wang', 'Guanghui', '']] |
1002.2964 | Ping Xia | Ping Xia, Vikram Chandrasekhar, Jeffrey G. Andrews | Open vs Closed Access Femtocells in the Uplink | 21 pages, 8 figures, 2 tables, submitted to IEEE Trans. on Wireless
Communications | null | 10.1109/TWC.2010.101310.100231 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Femtocells are assuming an increasingly important role in the coverage and
capacity of cellular networks. In contrast to existing cellular systems,
femtocells are end-user deployed and controlled, randomly located, and rely on
third party backhaul (e.g. DSL or cable modem). Femtocells can be configured to
be either open access or closed access. Open access allows an arbitrary nearby
cellular user to use the femtocell, whereas closed access restricts the use of
the femtocell to users explicitly approved by the owner. Seemingly, the network
operator would prefer an open access deployment since this provides an
inexpensive way to expand their network capabilities, whereas the femtocell
owner would prefer closed access, in order to keep the femtocell's capacity and
backhaul to himself. We show mathematically and through simulations that the
reality is more complicated for both parties, and that the best approach
depends heavily on whether the multiple access scheme is orthogonal (TDMA or
OFDMA, per subband) or non-orthogonal (CDMA). In a TDMA/OFDMA network,
closed-access is typically preferable at high user densities, whereas in CDMA,
open access can provide gains of more than 200% for the home user by reducing
the near-far problem experienced by the femtocell. The results of this paper
suggest that the interests of the femtocell owner and the network operator are
more compatible than typically believed, and that CDMA femtocells should be
configured for open access whereas OFDMA or TDMA femtocells should adapt to the
cellular user density.
| [{'version': 'v1', 'created': 'Mon, 15 Feb 2010 22:01:32 GMT'}] | 2016-11-15 | [['Xia', 'Ping', ''], ['Chandrasekhar', 'Vikram', ''], ['Andrews', 'Jeffrey G.', '']] |
1911.10222 | Alexander Iomin | Alexander Iomin | From power law to Anderson localization in nonlinear Schr\"odinger
equation with nonlinear randomness | null | Physical Review E 100, 052123 (2019) | 10.1103/PhysRevE.100.052123 | null | cond-mat.dis-nn cond-mat.stat-mech nlin.CD physics.optics | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the propagation of coherent waves in a nonlinearly-induced random
potential, and find regimes of self-organized criticality and other regimes
where the nonlinear equivalent of Anderson localization prevails. The regime of
self-organized criticality leads to power-law decay of transport [Phys. Rev.
Lett. 121, 233901 (2018)], whereas the second regime exhibits exponential
decay.
| [{'version': 'v1', 'created': 'Fri, 22 Nov 2019 19:17:58 GMT'}] | 2019-11-26 | [['Iomin', 'Alexander', '']] |
0909.1977 | Fernando Alegre | Fernando Alegre, Eric Feron and Santosh Pande | Using Ellipsoidal Domains to Analyze Control Systems Software | 17 pages | null | null | null | cs.PL cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a methodology for the automatic verification of safety properties
of controllers based on dynamical systems, such as those typically used in
avionics. In particular, our focus is on proving stability properties of
software implementing linear and some non-linear controllers. We develop an
abstract interpretation framework that follows closely the Lyapunov methods
used in proofs at the model level and describe the corresponding abstract
domains, which for linear systems consist of ellipsoidal constraints. These
ellipsoidal domains provide abstractions for the values of state variables and
must be combined with other domains that model the remaining variables in a
program. Thus, the problem of automatically assigning the right type of
abstract domain to each variable arises. We provide an algorithm that solves
this classification problem in many practical cases and suggest how it could be
generalized to more complicated cases. We then find a fixpoint by solving a
matrix equation, which in the linear case is just the discrete Lyapunov
equation. Contrary to most cases in software analysis, this fixpoint cannot be
reached by the usual iterative method of propagating constraints until
saturation and so numerical methods become essential. Finally, we illustrate
our methodology with several examples.
| [{'version': 'v1', 'created': 'Thu, 10 Sep 2009 15:42:32 GMT'}] | 2009-09-11 | [['Alegre', 'Fernando', ''], ['Feron', 'Eric', ''], ['Pande', 'Santosh', '']] |
2005.12455 | Ali Eshragh | Ali Eshragh, Saed Alizamir, Peter Howley and Elizabeth Stojanovski | Modeling the Dynamics of the COVID-19 Population in Australia: A
Probabilistic Analysis | 25 pages, 7 figures, 3 tables | null | 10.1371/journal.pone.0240153 | null | stat.AP physics.soc-ph q-bio.PE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The novel Corona Virus COVID-19 arrived on Australian shores around 25
January 2020. This paper presents a novel method of dynamically modeling and
forecasting the COVID-19 pandemic in Australia with a high degree of accuracy
and in a timely manner using limited data; a valuable resource that can be used
to guide government decision-making on societal restrictions on a daily and/or
weekly basis. The "partially-observable stochastic process" used in this study
predicts not only the future actual values with extremely low error, but also
the percentage of unobserved COVID-19 cases in the population. The model can
further assist policy makers to assess the effectiveness of several possible
alternative scenarios in their decision-making processes.
| [{'version': 'v1', 'created': 'Tue, 26 May 2020 00:36:05 GMT'}] | 2021-01-27 | [['Eshragh', 'Ali', ''], ['Alizamir', 'Saed', ''], ['Howley', 'Peter', ''], ['Stojanovski', 'Elizabeth', '']] |
1901.11505 | Saipraneeth Gouravaraju | Saipraneeth Gouravaraju, Roger A. Sauer and Sachin Singh Gautam | Investigating the normal and tangential peeling behaviour of gecko
spatulae using a coupled adhesion-friction model | 30 pages, 20 figures | null | null | null | cond-mat.soft cs.CE physics.class-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The present work investigates the normal and tangential peeling behaviour of
a gecko spatula using a coupled adhesion-friction model. The objective is to
explain the strong attachment and easy detachment behaviour of the spatulae as
well as to understand the principles behind their optimum design. Using
nonlinear finite element computations, it is shown that during
tangentially-constrained peeling the partial sliding of the spatula pad near
the peeling front stretches the spatula, thus increasing the strain energy and
leading to high pull-off forces. The model is used to investigate the influence
of various parameters on the pull-off forces -- such as the peeling angle,
spatula shaft angle, strip thickness, and material stiffness. The model shows
that increasing the spatula pad thickness beyond a certain level does not lead
to a significant increase in the attachment forces. Further, the easy
detachment behaviour of geckos is studied under tangentially-free peeling
conditions. It is found that the spatulae readily detach from the substrate by
changing their shaft angle and eventually peel vertically like a tape. Since
the present computational model is not limited by the geometrical, kinematical,
and material restrictions of theoretical models, it can be employed to analyse
similar biological adhesive systems.
| [{'version': 'v1', 'created': 'Thu, 31 Jan 2019 18:08:40 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Feb 2019 14:43:27 GMT'}, {'version': 'v3', 'created': 'Fri, 5 Apr 2019 16:54:50 GMT'}, {'version': 'v4', 'created': 'Mon, 18 Nov 2019 07:54:46 GMT'}] | 2019-11-19 | [['Gouravaraju', 'Saipraneeth', ''], ['Sauer', 'Roger A.', ''], ['Gautam', 'Sachin Singh', '']] |
2209.04818 | Zhong-Jian Yang | Ma-Long Hu, Xiao-Jing Du, Lin Ma, Jun He and Zhong-Jian Yang | Strong Superradiance of Coherently Coupled Magnetic Dipole Emitters
Mediated by Whispering Gallery Modes of a Subwavelength All-Dielectric Cavity | 26 pages, 6 figures | null | 10.1103/PhysRevB.106.205420 | null | physics.optics | http://creativecommons.org/licenses/by/4.0/ | The interaction of magnetic dipole (MD) emitters and common photonic cavities
is usually weak, which is partially due to the low magnetic near field
enhancements of the cavities. Here, we show that whispering gallery modes
(WGMs) of a subwavelength dielectric cavity can not only greatly boost the
emission rate of a MD emitter but also bring efficient couplings between
coherent MD emitters. In a WGM cavity, the maximal emission rate ({\gamma}max)
of a single emitter occurs at an antinode of the field pattern. The emission of
the MD emitter can also be greatly affected by another coherent one depending
on the magnetic field response of the WGM. The maximal contribution can also
reach {\gamma}max. Notably, the cooperative emission rate of the coherent MD
emitters does not decay with distance in the considered range due to the
high-quality feature of a WGM. In contrast to the emission, the absorption of
an emitter is hardly affected by the coherent couplings between emitters
mediated by a WGM. The difference between the performances of emission and
absorption is highly related to the excitation behaviors of WGMs. Our results
are important for enhanced magnetic light-matter interactions.
| [{'version': 'v1', 'created': 'Sun, 11 Sep 2022 09:26:57 GMT'}, {'version': 'v2', 'created': 'Thu, 24 Nov 2022 03:11:17 GMT'}] | 2022-12-07 | [['Hu', 'Ma-Long', ''], ['Du', 'Xiao-Jing', ''], ['Ma', 'Lin', ''], ['He', 'Jun', ''], ['Yang', 'Zhong-Jian', '']] |
1608.06472 | Duggirala Ravi | Duggirala Meher Krishna and Duggirala Ravi | Multivariate Cryptography with Mappings of Discrete Logarithms and
Polynomials | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, algorithms for multivariate public key cryptography and
digital signature are described. Plain messages and encrypted messages are
arrays, consisting of elements from a fixed finite ring or field. The
encryption and decryption algorithms are based on multivariate mappings. The
security of the private key depends on the difficulty of solving a system of
parametric simultaneous multivariate equations involving polynomial or
exponential mappings. The method is a general purpose utility for most data
encryption, digital certificate or digital signature applications.
| [{'version': 'v1', 'created': 'Tue, 23 Aug 2016 11:37:16 GMT'}, {'version': 'v2', 'created': 'Wed, 24 Aug 2016 05:24:15 GMT'}, {'version': 'v3', 'created': 'Mon, 29 Aug 2016 10:59:17 GMT'}, {'version': 'v4', 'created': 'Sat, 3 Sep 2016 05:11:30 GMT'}, {'version': 'v5', 'created': 'Mon, 14 May 2018 05:23:41 GMT'}, {'version': 'v6', 'created': 'Thu, 19 Jul 2018 06:00:05 GMT'}, {'version': 'v7', 'created': 'Mon, 17 Sep 2018 12:32:03 GMT'}, {'version': 'v8', 'created': 'Sat, 22 Sep 2018 15:54:29 GMT'}] | 2018-09-25 | [['Krishna', 'Duggirala Meher', ''], ['Ravi', 'Duggirala', '']] |
1803.07256 | Sang-Yoon Kim | Sang-Yoon Kim and Woochang Lim | Burst Synchronization in A Scale-Free Neuronal Network with Inhibitory
Spike-Timing-Dependent Plasticity | arXiv admin note: substantial text overlap with arXiv:1708.04543,
arXiv:1801.01385 | null | null | null | q-bio.NC physics.bio-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We are concerned about burst synchronization (BS), related to neural
information processes in health and disease, in the Barab\'{a}si-Albert
scale-free network (SFN) composed of inhibitory bursting Hindmarsh-Rose
neurons. This inhibitory neuronal population has adaptive dynamic synaptic
strengths governed by the inhibitory spike-timing-dependent plasticity (iSTDP).
In previous works without considering iSTDP, BS was found to appear in a range
of noise intensities for fixed synaptic inhibition strengths. In contrast, in
our present work, we take into consideration iSTDP and investigate its effect
on BS by varying the noise intensity. Our new main result is to find occurrence
of a Matthew effect in inhibitory synaptic plasticity: good BS gets better via
LTD, while bad BS get worse via LTP. This kind of Matthew effect in inhibitory
synaptic plasticity is in contrast to that in excitatory synaptic plasticity
where good (bad) synchronization gets better (worse) via LTP (LTD). We note
that, due to inhibition, the roles of LTD and LTP in inhibitory synaptic
plasticity are reversed in comparison with those in excitatory synaptic
plasticity. Moreover, emergences of LTD and LTP of synaptic inhibition
strengths are intensively investigated via a microscopic method based on the
distributions of time delays between the pre- and the post-synaptic burst onset
times. Finally, in the presence of iSTDP we investigate the effects of network
architecture on BS by varying the symmetric attachment degree $l^*$ and the
asymmetry parameter $\Delta l$ in the SFN.
| [{'version': 'v1', 'created': 'Tue, 20 Mar 2018 04:52:01 GMT'}, {'version': 'v2', 'created': 'Wed, 21 Mar 2018 02:16:06 GMT'}, {'version': 'v3', 'created': 'Fri, 6 Apr 2018 05:23:12 GMT'}, {'version': 'v4', 'created': 'Mon, 20 Aug 2018 07:23:05 GMT'}] | 2018-08-21 | [['Kim', 'Sang-Yoon', ''], ['Lim', 'Woochang', '']] |
1712.07883 | Manoj Kumar Dasa | Manoj Kumar Dasa, Christos Markos, Christian Rosenberg Peteresen, Ole
Bang | High pulse energy supercontinuum laser for spectroscopic photoacoustic
imaging of lipids in the 1650-1850 nm window | 6 pages, 5 figures | null | null | null | physics.optics physics.bio-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Detection and identification of lipids are highly coveted for the
interrogation of chronic diseases such as atherosclerosis and myocardial
infarction. Intravascular photoacoustic imaging (IVPA) and deep tissue imaging
are modern techniques, which rely on complex near infrared (NIR) optical
parametric oscillators (OPOs) and other high-power solid-state laser systems
for the diagnosis, which in turn make the systems bulky and expensive. In this
work, we propose a cost-effective directly modulated high pulse energy
supercontinuum source (operating in kHz regime) based on a standard optical
fiber with pulse energy density as high as ~ 26 nJ/nm. We demonstrate how such
supercontinuum source combined with a tunable filter can be highly suitable for
vibration-based photoacoustic imaging and spectroscopy of lipids in the
molecular overtone band of lipids (1650-1850 nm). We show the successful
discrimination of two different lipids (cholesterol and lipid in adipose
tissue) and the photoacoustic cross-sectional scan of lipid-rich adipose tissue
at three different locations. The proposed high pulse energy supercontinuum
laser paves a new direction towards compact, broadband and cost-effective
source for multi-spectral spectroscopic photoacoustic imaging.
| [{'version': 'v1', 'created': 'Thu, 21 Dec 2017 11:35:53 GMT'}] | 2017-12-22 | [['Dasa', 'Manoj Kumar', ''], ['Markos', 'Christos', ''], ['Peteresen', 'Christian Rosenberg', ''], ['Bang', 'Ole', '']] |
1905.02899 | Yuma Kinoshita | Yuma Kinoshita and Hitoshi Kiya | Convolutional Neural Networks Considering Local and Global features for
Image Enhancement | To appear in Proc. ICIP2019. arXiv admin note: text overlap with
arXiv:1901.05686 | null | null | null | eess.IV cs.CV cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a novel convolutional neural network (CNN)
architecture considering both local and global features for image enhancement.
Most conventional image enhancement methods, including Retinex-based methods,
cannot restore lost pixel values caused by clipping and quantizing. CNN-based
methods have recently been proposed to solve the problem, but they still have a
limited performance due to network architectures not handling global features.
To handle both local and global features, the proposed architecture consists of
three networks: a local encoder, a global encoder, and a decoder. In addition,
high dynamic range (HDR) images are used for generating training data for our
networks. The use of HDR images makes it possible to train CNNs with
better-quality images than images directly captured with cameras. Experimental
results show that the proposed method can produce higher-quality images than
conventional image enhancement methods including CNN-based methods, in terms of
various objective quality metrics: TMQI, entropy, NIQE, and BRISQUE.
| [{'version': 'v1', 'created': 'Tue, 7 May 2019 08:20:30 GMT'}] | 2019-05-09 | [['Kinoshita', 'Yuma', ''], ['Kiya', 'Hitoshi', '']] |
1503.02053 | Suresh Tiwari dr | S. C. Tiwari | Lorentz covariance and gauge invariance in the proton spin problem | 8 pages | null | null | null | physics.gen-ph physics.hist-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this brief note insightful remarks are made on the controversy on the
decomposition of the proton spin into the spin and orbital angular momenta of
quarks and gluons. It is argued that the difference in the perception on the
nature of the problem is the main reason for the persistent disputes. There is
no decomposition that simultaneously satisfies the twin principles of manifest
Lorentz covariance and gauge invariance, and partial considerations hide likely
inconsistencies. It is suggested that field equations and matter (i. e.
electron in QED and quarks in QCD) equations must be analyzed afresh rather
than beginning with the expressions of total angular momentum; canonical or
otherwise.
| [{'version': 'v1', 'created': 'Mon, 1 Sep 2014 08:40:20 GMT'}] | 2015-03-09 | [['Tiwari', 'S. C.', '']] |
1001.5116 | V. A. Yerokhin | Krzysztof Pachucki and Vladimir A. Yerokhin | Fine structure of helium-like ions and determination of the fine
structure constant | 4 pages, 3 tables, with a typo in Eq. (9) corrected | Phys. Rev. Lett. 104, 070403 (2010) | 10.1103/PhysRevLett.104.070403 | null | physics.atom-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We report a calculation of the fine structure splitting in light helium-like
atoms, which accounts for all quantum electrodynamical effects up to order
\alpha^5 Ry. For the helium atom, we resolve the previously reported
disagreement between theory and experiment and determine the fine structure
constant with an accuracy of 31 ppb. The calculational results are extensively
checked by comparison with the experimental data for different nuclear charges
and by evaluation of the hydrogenic limit of individual corrections.
| [{'version': 'v1', 'created': 'Thu, 28 Jan 2010 07:43:43 GMT'}, {'version': 'v2', 'created': 'Sun, 31 Jan 2010 13:11:07 GMT'}] | 2015-05-18 | [['Pachucki', 'Krzysztof', ''], ['Yerokhin', 'Vladimir A.', '']] |
2107.09245 | Evgeny Manzhosov | Evgeny Manzhosov, Adam Hastings, Meghna Pancholi, Ryan Piersma,
Mohamed Tarek Ibn Ziad, Simha Sethumadhavan | Revisiting Residue Codes for Modern Memories | null | null | null | null | cs.AR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Residue codes have been traditionally used for compute error correction
rather than storage error correction. In this paper, we use these codes for
storage error correction with surprising results. We find that adapting residue
codes to modern memory systems offers a level of error correction comparable to
traditional schemes such as Reed-Solomon with fewer bits of storage. For
instance, our adaptation of residue code -- MUSE ECC -- can offer ChipKill
protection using approximately 30% fewer bits. We show that the storage gains
can be used to hold metadata needed for emerging security functionality such as
memory tagging or to provide better detection capabilities against Rowhammer
attacks. Our evaluation shows that memory tagging in a MUSE-enabled system
shows a 12% reduction in memory bandwidth utilization while providing the same
level of error correction as a traditional ECC baseline without a noticeable
loss of performance. Thus, our work demonstrates a new, flexible primitive for
co-designing reliability with security and performance.
| [{'version': 'v1', 'created': 'Tue, 20 Jul 2021 03:35:45 GMT'}, {'version': 'v2', 'created': 'Mon, 19 Dec 2022 14:27:45 GMT'}] | 2022-12-20 | [['Manzhosov', 'Evgeny', ''], ['Hastings', 'Adam', ''], ['Pancholi', 'Meghna', ''], ['Piersma', 'Ryan', ''], ['Ziad', 'Mohamed Tarek Ibn', ''], ['Sethumadhavan', 'Simha', '']] |
2203.11815 | Richard Lange | Richard D. Lange, David S. Rolnick, Konrad P. Kording | Clustering units in neural networks: upstream vs downstream information | 12 main text pages, 4 main figures, 5 supplemental figures. Will be
submitted to TMLR | TMLR June (2022) | null | null | cs.LG cs.NE stat.ML | http://creativecommons.org/licenses/by/4.0/ | It has been hypothesized that some form of "modular" structure in artificial
neural networks should be useful for learning, compositionality, and
generalization. However, defining and quantifying modularity remains an open
problem. We cast the problem of detecting functional modules into the problem
of detecting clusters of similar-functioning units. This begs the question of
what makes two units functionally similar. For this, we consider two broad
families of methods: those that define similarity based on how units respond to
structured variations in inputs ("upstream"), and those based on how variations
in hidden unit activations affect outputs ("downstream"). We conduct an
empirical study quantifying modularity of hidden layer representations of
simple feedforward, fully connected networks, across a range of
hyperparameters. For each model, we quantify pairwise associations between
hidden units in each layer using a variety of both upstream and downstream
measures, then cluster them by maximizing their "modularity score" using
established tools from network science. We find two surprising results: first,
dropout dramatically increased modularity, while other forms of weight
regularization had more modest effects. Second, although we observe that there
is usually good agreement about clusters within both upstream methods and
downstream methods, there is little agreement about the cluster assignments
across these two families of methods. This has important implications for
representation-learning, as it suggests that finding modular representations
that reflect structure in inputs (e.g. disentanglement) may be a distinct goal
from learning modular representations that reflect structure in outputs (e.g.
compositionality).
| [{'version': 'v1', 'created': 'Tue, 22 Mar 2022 15:35:10 GMT'}] | 2022-06-23 | [['Lange', 'Richard D.', ''], ['Rolnick', 'David S.', ''], ['Kording', 'Konrad P.', '']] |
1806.09814 | Chengwen Xing | Shiqi Gong, Shaodan Ma, Chengwen Xing and Guanghua Yang | Optimal Beamforming and Time Allocation for Partially Wireless Powered
Sensor Networks with Downlink SWIPT | 14 pages | null | 10.1109/TSP.2019.2912876 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Wireless powered sensor networks (WPSNs) have emerged as a key development
towards the future self-sustainable Internet of Things (IoT) networks. To
achieve a good balance between self-sustainability and reliability, partially
WPSNs with a mixed power solution are desirable for practical applications.
Specifically, most of the sensor nodes are wireless powered but the key sensor
node adopts traditional wire/battery power for reliability. As a result, this
paper mainly investigates optimal design for the partially WPSNs in which
simultaneous wireless information and power transfer (SWIPT) is adopted in the
downlink. Two scenarios with space division multiple access (SDMA) and time
division multiple access (TDMA) in the uplink are considered. For both the
SDMA-enabled and TDMA-enabled partially WPSNs, joint design of downlink
beamforming, uplink beamforming and time allocation is investigated to maximize
the uplink sum rate while guaranteeing the quality-of-service (i.e., satisfying
the downlink rate constraint) at the key sensor node. After analyzing the
feasibility of uplink sum rate maximization problems and the influence of the
downlink rate constraint, semi-closed-form optimal solutions for both
SDMA-enabled and TDMA-enabled WPSNs are proposed with guaranteed global
optimality. Complexity analysis is also provided to justify the advantage of
the proposed solutions in low complexity. The effectiveness and optimality of
the proposed optimal solutions are finally demonstrated by simulations.
| [{'version': 'v1', 'created': 'Tue, 26 Jun 2018 07:06:49 GMT'}] | 2019-05-22 | [['Gong', 'Shiqi', ''], ['Ma', 'Shaodan', ''], ['Xing', 'Chengwen', ''], ['Yang', 'Guanghua', '']] |
1009.5823 | Jean Minet | Jean Minet, Jean Taboury, Michel P\'ealat, Nicolas Roux, Jacques
Lonnoy, Yann Ferrec | Adaptive band selection snapshot multispectral imaging in the VIS/NIR
domain | null | Proc.SPIE Int.Soc.Opt.Eng.7835:78350W,2010 | 10.1117/12.864578 | null | physics.optics astro-ph.IM physics.data-an | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Hyperspectral imaging has proven its efficiency for target detection
applications but the acquisition mode and the data rate are major issues when
dealing with real-time detection applications. It can be useful to use snapshot
spectral imagers able to acquire all the spectral channels simultaneously on a
single image sensor. Such snapshot spectral imagers suffer from the lack of
spectral resolution. It is then mandatory to carefully select the spectral
content of the acquired image with respect to the proposed application. We
present a novel approach of hyperspectral band selection for target detection
which maximizes the contrast between the background and the target by proper
optimization of positions and linewidths of a limited number of filters. Based
on a set of tunable band-pass filters such as Fabry-Perot filters, the device
should be able to adapt itself to the current scene and the target looked for.
Simulations based on real hyperspectral images show that such snapshot imagers
could compete well against hyperspectral imagers in terms of detection
efficiency while allowing snapshot acquisition, and real-time detection.
| [{'version': 'v1', 'created': 'Wed, 29 Sep 2010 09:57:16 GMT'}] | 2015-03-17 | [['Minet', 'Jean', ''], ['Taboury', 'Jean', ''], ['Péalat', 'Michel', ''], ['Roux', 'Nicolas', ''], ['Lonnoy', 'Jacques', ''], ['Ferrec', 'Yann', '']] |
2004.03021 | Yaman Umuroglu | Yaman Umuroglu, Yash Akhauri, Nicholas J. Fraser, Michaela Blott | LogicNets: Co-Designed Neural Networks and Circuits for
Extreme-Throughput Applications | null | null | null | null | eess.SP cs.AR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deployment of deep neural networks for applications that require very high
throughput or extremely low latency is a severe computational challenge,
further exacerbated by inefficiencies in mapping the computation to hardware.
We present a novel method for designing neural network topologies that directly
map to a highly efficient FPGA implementation. By exploiting the equivalence of
artificial neurons with quantized inputs/outputs and truth tables, we can train
quantized neural networks that can be directly converted to a netlist of truth
tables, and subsequently deployed as a highly pipelinable, massively parallel
FPGA circuit. However, the neural network topology requires careful
consideration since the hardware cost of truth tables grows exponentially with
neuron fan-in. To obtain smaller networks where the whole netlist can be
placed-and-routed onto a single FPGA, we derive a fan-in driven hardware cost
model to guide topology design, and combine high sparsity with low-bit
activation quantization to limit the neuron fan-in. We evaluate our approach on
two tasks with very high intrinsic throughput requirements in high-energy
physics and network intrusion detection. We show that the combination of
sparsity and low-bit activation quantization results in high-speed circuits
with small logic depth and low LUT cost, demonstrating competitive accuracy
with less than 15 ns of inference latency and throughput in the hundreds of
millions of inferences per second.
| [{'version': 'v1', 'created': 'Mon, 6 Apr 2020 22:15:41 GMT'}] | 2020-04-08 | [['Umuroglu', 'Yaman', ''], ['Akhauri', 'Yash', ''], ['Fraser', 'Nicholas J.', ''], ['Blott', 'Michaela', '']] |
2206.00392 | Evan Crawford | Miroslav D. Filipovi\'c, Jeffrey L. Payne, Thomas Jarret, Nick F.H.
Tothill, Evan J. Crawford, Dejan Uro\v{s}evi\'c, Giuseppe Longo, Jordan D.
Collier, Patrick J. Kavanagh, Christopher Matthew and Miro Ili\'c | European historical evidence of the supernova of AD 1054 coins of
Constantine IX and SN 1054 | Accepted in European Journal of Science and Theology | null | null | null | physics.hist-ph astro-ph.HE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We investigate a possible depiction of the famous SN 1054 event in specially
minted coins produced in the Eastern Roman Empire in 1054 A.D. On these coins,
we investigate if the head of the Emperor, Constantine IX, might represent the
Sun with a bright 'star' on either side - Venus in the east and SN 1054 in the
west, perhaps also representing the newly split Christian churches. We explore
the idea that the eastern star represents the stable and well-known Venus and
the Eastern Orthodox Church, while the western star represents the short-lived
'new star' and the 'fading' Western Catholic church. We examined 36 coins of
this rare Constantine IX Class IV batch. While no exact date could be
associated to any of these coins, they most likely were minted during the last
six months of Constantine IX's rule in 1054. We hypothesise that the stance of
the church concerning the order of the Universe, as well as the chaos
surrounding the Great Schism, played a crucial role in stopping the official
reporting of an obvious event in the sky, yet a dangerous omen. A temporal
coincidence of all these events could be a reasonable explanation as well.
| [{'version': 'v1', 'created': 'Wed, 1 Jun 2022 10:59:44 GMT'}] | 2022-06-02 | [['Filipović', 'Miroslav D.', ''], ['Payne', 'Jeffrey L.', ''], ['Jarret', 'Thomas', ''], ['Tothill', 'Nick F. H.', ''], ['Crawford', 'Evan J.', ''], ['Urošević', 'Dejan', ''], ['Longo', 'Giuseppe', ''], ['Collier', 'Jordan D.', ''], ['Kavanagh', 'Patrick J.', ''], ['Matthew', 'Christopher', ''], ['Ilić', 'Miro', '']] |
2203.08209 | Ismail Alkhouri | Ismail R. Alkhouri, George K. Atia, Alvaro Velasquez | A Differentiable Approach to Combinatorial Optimization using Dataless
Neural Networks | null | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The success of machine learning solutions for reasoning about discrete
structures has brought attention to its adoption within combinatorial
optimization algorithms. Such approaches generally rely on supervised learning
by leveraging datasets of the combinatorial structures of interest drawn from
some distribution of problem instances. Reinforcement learning has also been
employed to find such structures. In this paper, we propose a radically
different approach in that no data is required for training the neural networks
that produce the solution. In particular, we reduce the combinatorial
optimization problem to a neural network and employ a dataless training scheme
to refine the parameters of the network such that those parameters yield the
structure of interest. We consider the combinatorial optimization problems of
finding maximum independent sets and maximum cliques in a graph. In principle,
since these problems belong to the NP-hard complexity class, our proposed
approach can be used to solve any other NP-hard problem. Additionally, we
propose a universal graph reduction procedure to handle large scale graphs. The
reduction exploits community detection for graph partitioning and is applicable
to any graph type and/or density. Experimental evaluation on both synthetic
graphs and real-world benchmarks demonstrates that our method performs on par
with or outperforms state-of-the-art heuristic, reinforcement learning, and
machine learning based methods without requiring any data.
| [{'version': 'v1', 'created': 'Tue, 15 Mar 2022 19:21:31 GMT'}] | 2022-03-17 | [['Alkhouri', 'Ismail R.', ''], ['Atia', 'George K.', ''], ['Velasquez', 'Alvaro', '']] |
1712.07121 | Thorsten Wissmann | Thomas Colcombet and Daniela Petri\c{s}an | Automata Minimization: a Functorial Approach | journal version of the CALCO 2017 paper arXiv:1711.03063 | Logical Methods in Computer Science, Volume 16, Issue 1 (March 23,
2020) lmcs:6213 | 10.23638/LMCS-16(1:32)2020 | null | cs.LO cs.FL | http://creativecommons.org/licenses/by/4.0/ | In this paper we regard languages and their acceptors - such as deterministic
or weighted automata, transducers, or monoids - as functors from input
categories that specify the type of the languages and of the machines to
categories that specify the type of outputs. Our results are as follows:
A) We provide sufficient conditions on the output category so that
minimization of the corresponding automata is guaranteed.
B) We show how to lift adjunctions between the categories for output values
to adjunctions between categories of automata.
C) We show how this framework can be instantiated to unify several phenomena
in automata theory, starting with determinization, minimization and syntactic
algebras. We provide explanations of Choffrut's minimization algorithm for
subsequential transducers and of Brzozowski's minimization algorithm in this
setting.
| [{'version': 'v1', 'created': 'Tue, 19 Dec 2017 17:39:30 GMT'}, {'version': 'v2', 'created': 'Fri, 13 Sep 2019 10:28:29 GMT'}, {'version': 'v3', 'created': 'Fri, 20 Mar 2020 14:54:59 GMT'}] | 2020-06-17 | [['Colcombet', 'Thomas', ''], ['Petrişan', 'Daniela', '']] |
1812.04048 | Xin Zhang | Xin Zhang, Jia Liu, Zhengyuan Zhu, Elizabeth S. Bentley | Compressed Distributed Gradient Descent: Communication-Efficient
Consensus over Networks | 11 pages, 11 figures, IEEE INFOCOM 2019 | null | null | null | cs.DC cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Network consensus optimization has received increasing attention in recent
years and has found important applications in many scientific and engineering
fields. To solve network consensus optimization problems, one of the most
well-known approaches is the distributed gradient descent method (DGD).
However, in networks with slow communication rates, DGD's performance is
unsatisfactory for solving high-dimensional network consensus problems due to
the communication bottleneck. This motivates us to design a
communication-efficient DGD-type algorithm based on compressed information
exchanges. Our contributions in this paper are three-fold: i) We develop a
communication-efficient algorithm called amplified-differential compression DGD
(ADC-DGD) and show that it converges under {\em any} unbiased compression
operator; ii) We rigorously prove the convergence performances of ADC-DGD and
show that they match with those of DGD without compression; iii) We reveal an
interesting phase transition phenomenon in the convergence speed of ADC-DGD.
Collectively, our findings advance the state-of-the-art of network consensus
optimization theory.
| [{'version': 'v1', 'created': 'Mon, 10 Dec 2018 19:37:26 GMT'}, {'version': 'v2', 'created': 'Sat, 26 Jan 2019 01:48:51 GMT'}, {'version': 'v3', 'created': 'Wed, 10 Apr 2019 22:11:08 GMT'}, {'version': 'v4', 'created': 'Sun, 21 Jul 2019 19:48:29 GMT'}, {'version': 'v5', 'created': 'Mon, 9 Sep 2019 00:47:44 GMT'}] | 2019-09-10 | [['Zhang', 'Xin', ''], ['Liu', 'Jia', ''], ['Zhu', 'Zhengyuan', ''], ['Bentley', 'Elizabeth S.', '']] |
2206.15398 | Yanqin Jiang | Yanqin Jiang, Li Zhang, Zhenwei Miao, Xiatian Zhu, Jin Gao, Weiming
Hu, Yu-Gang Jiang | PolarFormer: Multi-camera 3D Object Detection with Polar Transformer | Accepted to AAAI2023 | null | null | null | cs.CV cs.AI | http://creativecommons.org/licenses/by/4.0/ | 3D object detection in autonomous driving aims to reason "what" and "where"
the objects of interest present in a 3D world. Following the conventional
wisdom of previous 2D object detection, existing methods often adopt the
canonical Cartesian coordinate system with perpendicular axis. However, we
conjugate that this does not fit the nature of the ego car's perspective, as
each onboard camera perceives the world in shape of wedge intrinsic to the
imaging geometry with radical (non-perpendicular) axis. Hence, in this paper we
advocate the exploitation of the Polar coordinate system and propose a new
Polar Transformer (PolarFormer) for more accurate 3D object detection in the
bird's-eye-view (BEV) taking as input only multi-camera 2D images.
Specifically, we design a cross attention based Polar detection head without
restriction to the shape of input structure to deal with irregular Polar grids.
For tackling the unconstrained object scale variations along Polar's distance
dimension, we further introduce a multi-scalePolar representation learning
strategy. As a result, our model can make best use of the Polar representation
rasterized via attending to the corresponding image observation in a
sequence-to-sequence fashion subject to the geometric constraints. Thorough
experiments on the nuScenes dataset demonstrate that our PolarFormer
outperforms significantly state-of-the-art 3D object detection alternatives.
| [{'version': 'v1', 'created': 'Thu, 30 Jun 2022 16:32:48 GMT'}, {'version': 'v2', 'created': 'Fri, 1 Jul 2022 09:27:56 GMT'}, {'version': 'v3', 'created': 'Sun, 10 Jul 2022 11:49:53 GMT'}, {'version': 'v4', 'created': 'Tue, 12 Jul 2022 08:18:01 GMT'}, {'version': 'v5', 'created': 'Fri, 23 Dec 2022 08:45:37 GMT'}, {'version': 'v6', 'created': 'Mon, 16 Jan 2023 02:24:33 GMT'}] | 2023-01-18 | [['Jiang', 'Yanqin', ''], ['Zhang', 'Li', ''], ['Miao', 'Zhenwei', ''], ['Zhu', 'Xiatian', ''], ['Gao', 'Jin', ''], ['Hu', 'Weiming', ''], ['Jiang', 'Yu-Gang', '']] |
2208.07282 | Shahan Nercessian | Shahan Nercessian | Differentiable WORLD Synthesizer-based Neural Vocoder With Application
To End-To-End Audio Style Transfer | 12 pages, 4 figures | null | null | null | eess.AS cs.LG cs.SD | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a differentiable WORLD synthesizer and demonstrate
its use in end-to-end audio style transfer tasks such as (singing) voice
conversion and the DDSP timbre transfer task. Accordingly, our baseline
differentiable synthesizer has no model parameters, yet it yields adequate
synthesis quality. We can extend the baseline synthesizer by appending
lightweight black-box postnets which apply further processing to the baseline
output in order to improve fidelity. An alternative differentiable approach
considers extraction of the source excitation spectrum directly, which can
improve naturalness albeit for a narrower class of style transfer applications.
The acoustic feature parameterization used by our approaches has the added
benefit that it naturally disentangles pitch and timbral information so that
they can be modeled separately. Moreover, as there exists a robust means of
estimating these acoustic features from monophonic audio sources, it allows for
parameter loss terms to be added to an end-to-end objective function, which can
help convergence and/or further stabilize (adversarial) training.
| [{'version': 'v1', 'created': 'Mon, 15 Aug 2022 15:48:36 GMT'}, {'version': 'v2', 'created': 'Thu, 1 Sep 2022 00:35:02 GMT'}, {'version': 'v3', 'created': 'Thu, 13 Oct 2022 13:05:06 GMT'}] | 2022-10-14 | [['Nercessian', 'Shahan', '']] |
1811.08839 | Anuroop Sriram | Jure Zbontar, Florian Knoll, Anuroop Sriram, Tullie Murrell, Zhengnan
Huang, Matthew J. Muckley, Aaron Defazio, Ruben Stern, Patricia Johnson, Mary
Bruno, Marc Parente, Krzysztof J. Geras, Joe Katsnelson, Hersh Chandarana,
Zizhao Zhang, Michal Drozdzal, Adriana Romero, Michael Rabbat, Pascal
Vincent, Nafissa Yakubova, James Pinkerton, Duo Wang, Erich Owens, C.
Lawrence Zitnick, Michael P. Recht, Daniel K. Sodickson, Yvonne W. Lui | fastMRI: An Open Dataset and Benchmarks for Accelerated MRI | 35 pages, 10 figures | null | null | null | cs.CV cs.LG eess.SP physics.med-ph stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Accelerating Magnetic Resonance Imaging (MRI) by taking fewer measurements
has the potential to reduce medical costs, minimize stress to patients and make
MRI possible in applications where it is currently prohibitively slow or
expensive. We introduce the fastMRI dataset, a large-scale collection of both
raw MR measurements and clinical MR images, that can be used for training and
evaluation of machine-learning approaches to MR image reconstruction. By
introducing standardized evaluation criteria and a freely-accessible dataset,
our goal is to help the community make rapid advances in the state of the art
for MR image reconstruction. We also provide a self-contained introduction to
MRI for machine learning researchers with no medical imaging background.
| [{'version': 'v1', 'created': 'Wed, 21 Nov 2018 17:32:14 GMT'}, {'version': 'v2', 'created': 'Wed, 11 Dec 2019 10:31:39 GMT'}] | 2019-12-12 | [['Zbontar', 'Jure', ''], ['Knoll', 'Florian', ''], ['Sriram', 'Anuroop', ''], ['Murrell', 'Tullie', ''], ['Huang', 'Zhengnan', ''], ['Muckley', 'Matthew J.', ''], ['Defazio', 'Aaron', ''], ['Stern', 'Ruben', ''], ['Johnson', 'Patricia', ''], ['Bruno', 'Mary', ''], ['Parente', 'Marc', ''], ['Geras', 'Krzysztof J.', ''], ['Katsnelson', 'Joe', ''], ['Chandarana', 'Hersh', ''], ['Zhang', 'Zizhao', ''], ['Drozdzal', 'Michal', ''], ['Romero', 'Adriana', ''], ['Rabbat', 'Michael', ''], ['Vincent', 'Pascal', ''], ['Yakubova', 'Nafissa', ''], ['Pinkerton', 'James', ''], ['Wang', 'Duo', ''], ['Owens', 'Erich', ''], ['Zitnick', 'C. Lawrence', ''], ['Recht', 'Michael P.', ''], ['Sodickson', 'Daniel K.', ''], ['Lui', 'Yvonne W.', '']] |
1006.5884 | Rohini Godbole Professor | Rohini M. Godbole | The Heart of Matter | Article to appear in 'Flavours of Research ih Physics' to be brought
out by the Indian National Science Academy, Delhi, India | null | null | null | physics.pop-ph hep-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this article I trace the development of the human understanding of the
"Heart of Matter" from early concepts of "elements" (or alternatively
"Panchmahabhootas") to the current status of "quarks" and "leptons" as the
fundamental constituents of matter, interacting together via exchange of the
various force carrier particles called "gauge bosons" such as the photon,
W/Z-boson etc. I would like to show how our understanding of the fundamental
constituents of matter has gone hand in hand with our understanding of the
fundamental forces in nature. I will also outline how the knowledge of particle
physics at the "micro" scale of less than a Fermi(one millionth of a
nanometer), enables us to offer explanations of Cosmological observations at
the "macro" scale. Consequently these observations, may in turn, help us
address some very fundamental questions of the Physics at the "Heart of the
Matter".
| [{'version': 'v1', 'created': 'Wed, 30 Jun 2010 15:13:32 GMT'}] | 2010-07-01 | [['Godbole', 'Rohini M.', '']] |
1611.09624 | Jeferson J. Arenzon | Annette Cazaubiel, Alessandra F. L\"utz and Jeferson J. Arenzon | Spatial organization and cyclic dominance in asymmetric predator-prey
spatial games | Final published verson | J. Theor. Biol. 430 (2017) 45 | 10.1016/j.jtbi.2017.07.002 | null | q-bio.PE cond-mat.stat-mech physics.bio-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Predators may attack isolated or grouped prey in a cooperative, collective
way. Whether a gregarious behavior is advantageous to each species depends on
several conditions and game theory is a useful tool to deal with such a
problem. We here extend the Lett-Auger-Gaillard model [Theor. Pop. Biol. 65
(2004) 263] to spatially distributed populations and compare the resulting
behavior with their mean-field predictions for the coevolving densities of
predator and prey strategies. Besides its richer behavior in the presence of
spatial organization, we also show that the coexistence phase in which
collective and individual strategies for each group are present is stable
because of an effective, cyclic dominance mechanism similar to a well-studied
generalization of the Rock-Paper-Scissors game with four species, a further
example of how ubiquitous this coexistence mechanism is.
| [{'version': 'v1', 'created': 'Tue, 29 Nov 2016 13:31:54 GMT'}, {'version': 'v2', 'created': 'Tue, 11 Jul 2017 10:23:15 GMT'}] | 2017-07-12 | [['Cazaubiel', 'Annette', ''], ['Lütz', 'Alessandra F.', ''], ['Arenzon', 'Jeferson J.', '']] |
2102.00696 | Selim Furkan Tekin | Selim Furkan Tekin, Oguzhan Karaahmetoglu, Fatih Ilhan, Ismail Balaban
and Suleyman Serdar Kozat | Spatio-temporal Weather Forecasting and Attention Mechanism on
Convolutional LSTMs | null | null | null | null | cs.LG cs.AI cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Numerical weather forecasting on high-resolution physical models consume
hours of computations on supercomputers. Application of deep learning and
machine learning methods in forecasting revealed new solutions in this area. In
this paper, we forecast high-resolution numeric weather data using both input
weather data and observations by providing a novel deep learning architecture.
We formulate the problem as spatio-temporal prediction. Our model is composed
of Convolutional Long-short Term Memory, and Convolutional Neural Network units
with encoder-decoder structure. We enhance the short-long term performance and
interpretability with an attention and a context matcher mechanism. We perform
experiments on high-scale, real-life, benchmark numerical weather dataset, ERA5
hourly data on pressure levels, and forecast the temperature. The results show
significant improvements in capturing both spatial and temporal correlations
with attention matrices focusing on different parts of the input series. Our
model obtains the best validation and the best test score among the baseline
models, including ConvLSTM forecasting network and U-Net. We provide
qualitative and quantitative results and show that our model forecasts 10 time
steps with 3 hour frequency with an average of 2 degrees error. Our code and
the data are publicly available.
| [{'version': 'v1', 'created': 'Mon, 1 Feb 2021 08:30:42 GMT'}] | 2021-02-02 | [['Tekin', 'Selim Furkan', ''], ['Karaahmetoglu', 'Oguzhan', ''], ['Ilhan', 'Fatih', ''], ['Balaban', 'Ismail', ''], ['Kozat', 'Suleyman Serdar', '']] |
1812.00631 | Katharina Schneider | Katharina Schneider, Yannick Baumgartner, Simon H\"onl, Pol Welter,
Herwig Hahn, Dalziel J. Wilson, Lukas Czornomaz, Paul Seidler | Optomechanics with one-dimensional gallium phosphide photonic crystal
cavities | 11 pages, 13 figures | null | 10.1364/optica.6.000577 | null | physics.optics | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Gallium phosphide offers an attractive combination of a high refractive index
($n>3$ for vacuum wavelengths up to 4 {\mu}m) and a wide electronic bandgap
(2.26 eV), enabling optical cavities with small mode volumes and low two-photon
absorption at telecommunication wavelengths. Heating due to strongly confined
light fields is therefore greatly reduced. Here, we investigate the benefits of
these properties for cavity optomechanics. Utilizing a recently developed
fabrication scheme based on direct wafer bonding, we realize integrated
one-dimensional photonic crystal cavities made of gallium phosphide with
optical quality factors as high as $1.1\times10^5$. We optimize their design to
couple the optical eigenmode at $\approx 200$ THz via radiation pressure to a
co-localized mechanical mode with a frequency of 3 GHz, yielding
sideband-resolved devices. The high vacuum optomechanical coupling rate
($g_0=2\pi\times 400$ kHz) permits amplification of the mechanical mode into
the so-called mechanical lasing regime with input power as low as $\approx 20$
{\mu}W. The observation of mechanical lasing implies a multiphoton
cooperativity of $C>1$, an important threshold for the realization of quantum
state transfer protocols. Because of the reduced thermo-optic resonance shift,
optomechanically induced transparency can be detected at room temperature in
addition to the normally observed optomechanically induced absorption.
| [{'version': 'v1', 'created': 'Mon, 3 Dec 2018 09:45:07 GMT'}] | 2020-01-07 | [['Schneider', 'Katharina', ''], ['Baumgartner', 'Yannick', ''], ['Hönl', 'Simon', ''], ['Welter', 'Pol', ''], ['Hahn', 'Herwig', ''], ['Wilson', 'Dalziel J.', ''], ['Czornomaz', 'Lukas', ''], ['Seidler', 'Paul', '']] |
1207.3391 | Petr Sulc | Petr \v{S}ulc, Flavio Romano, Thomas E. Ouldridge, Lorenzo Rovigatti,
Jonathan P. K. Doye, Ard A. Louis | Sequence-dependent thermodynamics of a coarse-grained DNA model | 15 pages | J. Chem. Phys. 137, 135101 (2012) | 10.1063/1.4754132 | null | physics.bio-ph cond-mat.soft physics.chem-ph q-bio.BM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce a sequence-dependent parametrization for a coarse-grained DNA
model [T. E. Ouldridge, A. A. Louis, and J. P. K. Doye, J. Chem. Phys. 134,
085101 (2011)] originally designed to reproduce the properties of DNA molecules
with average sequences. The new parametrization introduces sequence-dependent
stacking and base-pairing interaction strengths chosen to reproduce the melting
temperatures of short duplexes. By developing a histogram reweighting
technique, we are able to fit our parameters to the melting temperatures of
thousands of sequences. To demonstrate the flexibility of the model, we study
the effects of sequence on: (a) the heterogeneous stacking transition of single
strands, (b) the tendency of a duplex to fray at its melting point, (c) the
effects of stacking strength in the loop on the melting temperature of
hairpins, (d) the force-extension properties of single strands and (e) the
structure of a kissing-loop complex. Where possible we compare our results with
experimental data and find a good agreement. A simulation code called oxDNA,
implementing our model, is available as free software.
| [{'version': 'v1', 'created': 'Sat, 14 Jul 2012 05:06:15 GMT'}] | 2012-10-05 | [['Šulc', 'Petr', ''], ['Romano', 'Flavio', ''], ['Ouldridge', 'Thomas E.', ''], ['Rovigatti', 'Lorenzo', ''], ['Doye', 'Jonathan P. K.', ''], ['Louis', 'Ard A.', '']] |
2106.08247 | Sikai Zhang | Sikai Zhang, Tingna Wang, Keith Worden, Elizabeth J. Cross | Canonical-Correlation-Based Fast Feature Selection | null | null | null | null | stat.ML cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | This paper proposes a canonical-correlation-based filter method for feature
selection. The sum of squared canonical correlation coefficients is adopted as
the feature ranking criterion. The proposed method boosts the computational
speed of the ranking criterion in greedy search. The supporting theorems
developed for the feature selection method are fundamental to the understanding
of the canonical correlation analysis. In empirical studies, a synthetic
dataset is used to demonstrate the speed advantage of the proposed method, and
eight real datasets are applied to show the effectiveness of the proposed
feature ranking criterion in both classification and regression. The results
show that the proposed method is considerably faster than the definition-based
method, and the proposed ranking criterion is competitive compared with the
seven mutual-information-based criteria.
| [{'version': 'v1', 'created': 'Tue, 15 Jun 2021 15:55:17 GMT'}] | 2021-06-16 | [['Zhang', 'Sikai', ''], ['Wang', 'Tingna', ''], ['Worden', 'Keith', ''], ['Cross', 'Elizabeth J.', '']] |
2004.12064 | Di Zhuang | Di Zhuang, Keyu Chen, J. Morris Chang | CS-AF: A Cost-sensitive Multi-classifier Active Fusion Framework for
Skin Lesion Classification | 16 pages, 8 figures, 2 table | null | null | null | cs.CV cs.LG eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Convolutional neural networks (CNNs) have achieved the state-of-the-art
performance in skin lesion analysis. Compared with single CNN classifier,
combining the results of multiple classifiers via fusion approaches shows to be
more effective and robust. Since the skin lesion datasets are usually limited
and statistically biased, while designing an effective fusion approach, it is
important to consider not only the performance of each classifier on the
training/validation dataset, but also the relative discriminative power (e.g.,
confidence) of each classifier regarding an individual sample in the testing
phase, which calls for an active fusion approach. Furthermore, in skin lesion
analysis, the data of certain classes (e.g., the benign lesions) is usually
abundant making them an over-represented majority, while the data of some other
classes (e.g., the cancerous lesions) is deficient, making them an
underrepresented minority. It is more crucial to precisely identify the samples
from an underrepresented (i.e., in terms of the amount of data) but more
important minority class (e.g., certain cancerous lesion). In other words,
misclassifying a more severe lesion to a benign or less severe lesion should
have relative more cost (e.g., money, time and even lives). To address such
challenges, we present CS-AF, a cost-sensitive multi-classifier active fusion
framework for skin lesion classification. In the experimental evaluation, we
prepared 96 base classifiers (of 12 CNN architectures) on the ISIC research
datasets. Our experimental results show that our framework consistently
outperforms the static fusion competitors.
| [{'version': 'v1', 'created': 'Sat, 25 Apr 2020 05:48:14 GMT'}, {'version': 'v2', 'created': 'Wed, 9 Sep 2020 04:37:03 GMT'}] | 2020-09-10 | [['Zhuang', 'Di', ''], ['Chen', 'Keyu', ''], ['Chang', 'J. Morris', '']] |
1305.7341 | Stefano De Leo | Silvania A. Carvalho and Stefano De Leo | Light transmission through a triangular air gap | 16 pages, 7 figures | Journal of Modern Optics 60, 437-443 (2013) | 10.1080/09500340.2013.783637 | null | physics.optics quant-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Due to the recent interest in studying propagation of light through
triangular air gaps, we calculate, by using the analogy between optics and
quantum mechanics and the multiple step technique, the transmissivity through a
triangular air gap surrounded by an homogeneous dielectric medium. The new
formula is then compared with the formula used in literature. Starting from the
qualitative and quantitative differences between these formulas, we propose
optical experiments to test our theoretical results.
| [{'version': 'v1', 'created': 'Fri, 31 May 2013 09:49:29 GMT'}] | 2016-06-29 | [['Carvalho', 'Silvania A.', ''], ['De Leo', 'Stefano', '']] |
cs/0501027 | Evan Greenberg | Evan P. Greenberg, David R. Cheriton | Enforcing Bulk Mail Classification | 6 pages, changed spin on paper, added new idea (explicit tagging as a
feature) | null | null | null | cs.NI | null | Spam costs US corporations upwards of $8.9 billion a year, and comprises as
much as 40% of all email received. Solutions exist to reduce the amount of spam
seen by end users, but cannot withstand sophisticated attacks. Worse yet, many
will occasionally misclassify and silently drop legitimate email. Spammers take
advantage of the near-zero cost of sending email to flood the network, knowing
that success even a tiny fraction of the time means a profit. End users,
however, have proven unwilling to pay money to send email to friends and
family.
We show that it is feasible to extend the existing mail system to reduce the
amount of unwanted email, without misclassifying email, and without charging
well-behaved users. We require that bulk email senders accurately classify each
email message they send as an advertisement with an area of interest or else be
charged a small negative incentive per message delivered. Recipients are able
to filter out email outside their scope of interest, while senders are able to
focus their sendings to the appropriate audience.
| [{'version': 'v1', 'created': 'Thu, 13 Jan 2005 23:37:10 GMT'}, {'version': 'v2', 'created': 'Thu, 19 May 2005 21:22:24 GMT'}] | 2007-05-23 | [['Greenberg', 'Evan P.', ''], ['Cheriton', 'David R.', '']] |
1801.07395 | Sheng Zhang | Sheng Zhang, Yan-Qing Chenq, and Wei-Qi Qian | On the Computation of Optimal Control Problems with Terminal Inequality
Constraint via Variation Evolution | arXiv admin note: substantial text overlap with arXiv:1801.01383,
arXiv:1712.09702, arXiv:1709.02242 | null | null | null | cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Studies regarding the computation of Optimal Control Problems (OCPs) with
terminal inequality constraint, under the frame of the Variation Evolving
Method (VEM), are carried out. The attributes of equality constraints and
inequality constraints in the generalized optimization problem is traversed,
and the intrinsic relations to the multipliers are uncovered. Upon these
preliminaries, the right Evolution Partial Differential Equation (EPDE) is
derived, and the costate-free optimality conditions are established. Besides
the analytic expression for the costates in the classic treatment, they also
reveal the analytic relations between the states, the controls and the
(Lagrange and KKT) multipliers, which adjoin the terminal (equality and
inequality) constraints. Moreover, in solving the transformed Initial-value
Problems (IVPs) with common Ordinary Differential Equation (ODE) integration
methods, the numerical soft barrier is proposed to eliminate the numerical
error resulting from the suddenly triggered inequality constraint and it is
shown to be effective.
| [{'version': 'v1', 'created': 'Sun, 21 Jan 2018 00:08:16 GMT'}] | 2018-01-24 | [['Zhang', 'Sheng', ''], ['Chenq', 'Yan-Qing', ''], ['Qian', 'Wei-Qi', '']] |
1604.02804 | Zhengfeng Ji | Anne Broadbent, Zhengfeng Ji, Fang Song, John Watrous | Zero-knowledge proof systems for QMA | 37 pages | Proceedings of the 2016 IEEE 57th Annual Symposium on Foundations
of Computer Science (FOCS 2016) pp.31-40 | 10.1109/FOCS.2016.13 | null | quant-ph cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Prior work has established that all problems in NP admit classical
zero-knowledge proof systems, and under reasonable hardness assumptions for
quantum computations, these proof systems can be made secure against quantum
attacks. We prove a result representing a further quantum generalization of
this fact, which is that every problem in the complexity class QMA has a
quantum zero-knowledge proof system. More specifically, assuming the existence
of an unconditionally binding and quantum computationally concealing commitment
scheme, we prove that every problem in the complexity class QMA has a quantum
interactive proof system that is zero-knowledge with respect to efficient
quantum computations.
Our QMA proof system is sound against arbitrary quantum provers, but only
requires an honest prover to perform polynomial-time quantum computations,
provided that it holds a quantum witness for a given instance of the QMA
problem under consideration. The proof system relies on a new variant of the
QMA-complete local Hamiltonian problem in which the local terms are described
by Clifford operations and standard basis measurements. We believe that the
QMA-completeness of this problem may have other uses in quantum complexity.
| [{'version': 'v1', 'created': 'Mon, 11 Apr 2016 06:21:36 GMT'}] | 2017-02-09 | [['Broadbent', 'Anne', ''], ['Ji', 'Zhengfeng', ''], ['Song', 'Fang', ''], ['Watrous', 'John', '']] |
1908.04018 | Dawei Li | Dawei Li, Yan Cao, Guoliang Shi, Xin Cai, Yang Chen, Sifan Wang, and
Siyuan Yan | An overlapping-free leaf segmentation method for plant point clouds | 24 Pages, 18 Figures, 7 Tables. Intends to submit to an open-access
journal | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Automatic leaf segmentation, as well as identification and classification
methods that built upon it, are able to provide immediate monitoring for plant
growth status to guarantee the output. Although 3D plant point clouds contain
abundant phenotypic features, plant leaves are usually distributed in clusters
and are sometimes seriously overlapped in the canopy. Therefore, it is still a
big challenge to automatically segment each individual leaf from a highly
crowded plant canopy in 3D for plant phenotyping purposes. In this work, we
propose an overlapping-free individual leaf segmentation method for plant point
clouds using the 3D filtering and facet region growing. In order to separate
leaves with different overlapping situations, we develop a new 3D joint
filtering operator, which integrates a Radius-based Outlier Filter (RBOF) and a
Surface Boundary Filter (SBF) to help to separate occluded leaves. By
introducing the facet over-segmentation and facet-based region growing, the
noise in segmentation is suppressed and labeled leaf centers can expand to
their whole leaves, respectively. Our method can work on point clouds generated
from three types of 3D imaging platforms, and also suitable for different kinds
of plant species. In experiments, it obtains a point-level cover rate of 97%
for Epipremnum aureum, 99% for Monstera deliciosa, 99% for Calathea makoyana,
and 87% for Hedera nepalensis sample plants. At the leaf level, our method
reaches an average Recall at 100.00%, a Precision at 99.33%, and an average
F-measure at 99.66%, respectively. The proposed method can also facilitate the
automatic traits estimation of each single leaf (such as the leaf area, length,
and width), which has potential to become a highly effective tool for plant
research and agricultural engineering.
| [{'version': 'v1', 'created': 'Mon, 12 Aug 2019 06:18:00 GMT'}] | 2019-08-13 | [['Li', 'Dawei', ''], ['Cao', 'Yan', ''], ['Shi', 'Guoliang', ''], ['Cai', 'Xin', ''], ['Chen', 'Yang', ''], ['Wang', 'Sifan', ''], ['Yan', 'Siyuan', '']] |
1801.09573 | Enkhtogtokh Togootogtokh | Enkhtogtokh Togootogtokh, Amarzaya Amartuvshin | Deep Learning Approach for Very Similar Objects Recognition Application
on Chihuahua and Muffin Problem | 8 pages,4 figures | null | null | null | cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | We address the problem to tackle the very similar objects like Chihuahua or
muffin problem to recognize at least in human vision level. Our regular deep
structured machine learning still does not solve it. We saw many times for
about year in our community the problem. Today we proposed the state-of-the-art
solution for it. Our approach is quite tricky to get the very high accuracy. We
propose the deep transfer learning method which could be tackled all this type
of problems not limited to just Chihuahua or muffin problem. It is the best
method to train with small data set not like require huge amount data.
| [{'version': 'v1', 'created': 'Mon, 29 Jan 2018 15:25:49 GMT'}] | 2018-01-30 | [['Togootogtokh', 'Enkhtogtokh', ''], ['Amartuvshin', 'Amarzaya', '']] |
1904.09877 | Giulio Cimini | Aurelio Patelli, Andrea Gabrielli, Giulio Cimini | Generalized Markov stability of network communities | null | Phys. Rev. E 101, 052301 (2020) | 10.1103/PhysRevE.101.052301 | null | physics.soc-ph cs.SI physics.data-an | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We address the problem of community detection in networks by introducing a
general definition of Markov stability, based on the difference between the
probability fluxes of a Markov chain on the network at different time scales.
The specific implementation of the quality function and the resulting optimal
community structure thus become dependent both on the type of Markov process
and on the specific Markov times considered. For instance, if we use a natural
Markov chain dynamics and discount its stationary distribution -- that is, we
take as reference process the dynamics at infinite time -- we obtain the
standard formulation of the Markov stability. Notably, the possibility to use
finite-time transition probabilities to define the reference process naturally
allows detecting communities at different resolutions, without the need to
consider a continuous-time Markov chain in the small time limit. The main
advantage of our general formulation of Markov stability based on dynamical
flows is that we work with lumped Markov chains on network partitions, having
the same stationary distribution of the original process. In this way the form
of the quality function becomes invariant under partitioning, leading to a
self-consistent definition of community structures at different aggregation
scales.
| [{'version': 'v1', 'created': 'Fri, 19 Apr 2019 14:17:12 GMT'}, {'version': 'v2', 'created': 'Tue, 24 Mar 2020 08:55:55 GMT'}] | 2020-05-05 | [['Patelli', 'Aurelio', ''], ['Gabrielli', 'Andrea', ''], ['Cimini', 'Giulio', '']] |
2107.10880 | Andres Fernandez Rodriguez | Andres Fernandez, Mark D. Plumbley | Using UMAP to Inspect Audio Data for Unsupervised Anomaly Detection
under Domain-Shift Conditions | Accepted at the DCASE2021 Workshop | null | null | null | cs.SD eess.AS stat.CO | http://creativecommons.org/licenses/by/4.0/ | The goal of Unsupervised Anomaly Detection (UAD) is to detect anomalous
signals under the condition that only non-anomalous (normal) data is available
beforehand. In UAD under Domain-Shift Conditions (UAD-S), data is further
exposed to contextual changes that are usually unknown beforehand. Motivated by
the difficulties encountered in the UAD-S task presented at the 2021 edition of
the Detection and Classification of Acoustic Scenes and Events (DCASE)
challenge, we visually inspect Uniform Manifold Approximations and Projections
(UMAPs) for log-STFT, log-mel and pretrained Look, Listen and Learn (L3)
representations of the DCASE UAD-S dataset. In our exploratory investigation,
we look for two qualities, Separability (SEP) and Discriminative Support
(DSUP), and formulate several hypotheses that could facilitate diagnosis and
developement of further representation and detection approaches. Particularly,
we hypothesize that input length and pretraining may regulate a relevant
tradeoff between SEP and DSUP. Our code as well as the resulting UMAPs and
plots are publicly available.
| [{'version': 'v1', 'created': 'Thu, 22 Jul 2021 18:28:27 GMT'}, {'version': 'v2', 'created': 'Fri, 15 Oct 2021 19:00:28 GMT'}] | 2021-10-19 | [['Fernandez', 'Andres', ''], ['Plumbley', 'Mark D.', '']] |
1812.10382 | Vinayak Sachidananda | Zi Yin, Vin Sachidananda, Balaji Prabhakar | The Global Anchor Method for Quantifying Linguistic Shifts and Domain
Adaptation | Accepted to NeuRIPS 2018 | null | null | null | cs.CL cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Language is dynamic, constantly evolving and adapting with respect to time,
domain or topic. The adaptability of language is an active research area, where
researchers discover social, cultural and domain-specific changes in language
using distributional tools such as word embeddings. In this paper, we introduce
the global anchor method for detecting corpus-level language shifts. We show
both theoretically and empirically that the global anchor method is equivalent
to the alignment method, a widely-used method for comparing word embeddings, in
terms of detecting corpus-level language shifts. Despite their equivalence in
terms of detection abilities, we demonstrate that the global anchor method is
superior in terms of applicability as it can compare embeddings of different
dimensionalities. Furthermore, the global anchor method has implementation and
parallelization advantages. We show that the global anchor method reveals fine
structures in the evolution of language and domain adaptation. When combined
with the graph Laplacian technique, the global anchor method recovers the
evolution trajectory and domain clustering of disparate text corpora.
| [{'version': 'v1', 'created': 'Wed, 12 Dec 2018 02:38:56 GMT'}] | 2018-12-27 | [['Yin', 'Zi', ''], ['Sachidananda', 'Vin', ''], ['Prabhakar', 'Balaji', '']] |
1501.01668 | Sanam Sadr | Sanam Sadr and Raviraj S. Adve | Handoff Rate and Coverage Analysis in Multi-tier Heterogeneous Networks | Accepted for publication in the IEEE Transactions on Wireless
Communications | null | null | null | cs.NI cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper analyzes the impact of user mobility in multi-tier heterogeneous
networks. We begin by obtaining the handoff rate for a mobile user in an
irregular cellular network with the access point locations modeled as a
homogeneous Poisson point process. The received signal-to-interference-ratio
(SIR) distribution along with a chosen SIR threshold is then used to obtain the
probability of coverage. To capture potential connection failures due to
mobility, we assume that a fraction of handoffs result in such failures.
Considering a multi-tier network with orthogonal spectrum allocation among
tiers and the maximum biased average received power as the tier association
metric, we derive the probability of coverage for two cases: 1) the user is
stationary (i.e., handoffs do not occur, or the system is not sensitive to
handoffs); 2) the user is mobile, and the system is sensitive to handoffs. We
derive the optimal bias factors to maximize the coverage. We show that when the
user is mobile, and the network is sensitive to handoffs, both the optimum tier
association and the probability of coverage depend on the user's speed; a
speed-dependent bias factor can then adjust the tier association to effectively
improve the coverage, and hence system performance, in a fully-loaded network.
| [{'version': 'v1', 'created': 'Wed, 7 Jan 2015 22:07:51 GMT'}] | 2015-01-09 | [['Sadr', 'Sanam', ''], ['Adve', 'Raviraj S.', '']] |
1803.07293 | Jianming Lv | Jianming Lv, Weihang Chen, Qing Li, Can Yang | Unsupervised Cross-dataset Person Re-identification by Transfer Learning
of Spatial-Temporal Patterns | Accepted by CVPR 2018 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Most of the proposed person re-identification algorithms conduct supervised
training and testing on single labeled datasets with small size, so directly
deploying these trained models to a large-scale real-world camera network may
lead to poor performance due to underfitting. It is challenging to
incrementally optimize the models by using the abundant unlabeled data
collected from the target domain. To address this challenge, we propose an
unsupervised incremental learning algorithm, TFusion, which is aided by the
transfer learning of the pedestrians' spatio-temporal patterns in the target
domain. Specifically, the algorithm firstly transfers the visual classifier
trained from small labeled source dataset to the unlabeled target dataset so as
to learn the pedestrians' spatial-temporal patterns. Secondly, a Bayesian
fusion model is proposed to combine the learned spatio-temporal patterns with
visual features to achieve a significantly improved classifier. Finally, we
propose a learning-to-rank based mutual promotion procedure to incrementally
optimize the classifiers based on the unlabeled data in the target domain.
Comprehensive experiments based on multiple real surveillance datasets are
conducted, and the results show that our algorithm gains significant
improvement compared with the state-of-art cross-dataset unsupervised person
re-identification algorithms.
| [{'version': 'v1', 'created': 'Tue, 20 Mar 2018 08:33:08 GMT'}] | 2018-03-21 | [['Lv', 'Jianming', ''], ['Chen', 'Weihang', ''], ['Li', 'Qing', ''], ['Yang', 'Can', '']] |
1802.09162 | Jiangzhi Chen | Jiangzhi Chen | From the seep to the surface: the ascent and dissolution of methane
bubbles in the ocean | 10 pages, 2 figures | null | null | null | physics.geo-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Methane, as a strong greenhouse gas, has 21-25 times the warming potential
per unit mass than carbon dioxide, and the methane from the oceans can
contribute to ~4% of the annual atmosphere methane budget. Large methane bubble
plumes have been observed in seep sites globally on shallow continental
shelves, and emerging industry of methane hydrates mining causes growing
environmental concern on possible disastrous blowout which destabilizes the
methane hydrate and releases huge amount of methane gas. To better estimate how
much methane in gaseous phase leaked from the seeps can reach the atmosphere, a
simplified model is developed to simulate the ascent of a methane bubble from a
shallow ocean methane seep, and the methane transfer with the surrounding
water. The breakup and coalescence of bubbles are neglected, and the bubble is
assumed to remain spherical following a vertical path during the whole rising
process. We calculated the survival distance of bubbles with varying initial
sizes and depths and the remaining percentage of methane reaching the sea
surface, and applied the results to the seep sites in the Shenhu area in the
South China Sea. The study can provide insight into the relative significance
of different water bodies in contributing to the atmosphere greenhouse gas.
| [{'version': 'v1', 'created': 'Mon, 26 Feb 2018 05:08:44 GMT'}] | 2018-02-27 | [['Chen', 'Jiangzhi', '']] |
1409.5241 | Basura Fernando | Basura Fernando, Amaury Habrard, Marc Sebban and Tinne Tuytelaars | Subspace Alignment For Domain Adaptation | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we introduce a new domain adaptation (DA) algorithm where the
source and target domains are represented by subspaces spanned by eigenvectors.
Our method seeks a domain invariant feature space by learning a mapping
function which aligns the source subspace with the target one. We show that the
solution of the corresponding optimization problem can be obtained in a simple
closed form, leading to an extremely fast algorithm. We present two approaches
to determine the only hyper-parameter in our method corresponding to the size
of the subspaces. In the first approach we tune the size of subspaces using a
theoretical bound on the stability of the obtained result. In the second
approach, we use maximum likelihood estimation to determine the subspace size,
which is particularly useful for high dimensional data. Apart from PCA, we
propose a subspace creation method that outperform partial least squares (PLS)
and linear discriminant analysis (LDA) in domain adaptation. We test our method
on various datasets and show that, despite its intrinsic simplicity, it
outperforms state of the art DA methods.
| [{'version': 'v1', 'created': 'Thu, 18 Sep 2014 09:57:41 GMT'}, {'version': 'v2', 'created': 'Thu, 23 Oct 2014 08:40:06 GMT'}] | 2014-10-24 | [['Fernando', 'Basura', ''], ['Habrard', 'Amaury', ''], ['Sebban', 'Marc', ''], ['Tuytelaars', 'Tinne', '']] |
1001.2805 | Mortuza Ali | Mortuza Ali and Margreta Kuijper | Source Coding With Side Information Using List Decoding | null | null | null | null | cs.IT math.IT | http://creativecommons.org/licenses/by-nc-sa/3.0/ | The problem of source coding with side information (SCSI) is closely related
to channel coding. Therefore, existing literature focuses on using the most
successful channel codes namely, LDPC codes, turbo codes, and their variants,
to solve this problem assuming classical unique decoding of the underlying
channel code. In this paper, in contrast to classical decoding, we have taken
the list decoding approach. We show that syndrome source coding using list
decoding can achieve the theoretical limit. We argue that, as opposed to
channel coding, the correct sequence from the list produced by the list decoder
can effectively be recovered in case of SCSI, since we are dealing with a
virtual noisy channel rather than a real noisy channel. Finally, we present a
guideline for designing constructive SCSI schemes using Reed Solomon code, BCH
code, and Reed-Muller code, which are the known list-decodable codes.
| [{'version': 'v1', 'created': 'Sat, 16 Jan 2010 04:59:23 GMT'}] | 2010-01-19 | [['Ali', 'Mortuza', ''], ['Kuijper', 'Margreta', '']] |
2103.00392 | Haidong Bian Dr | Haidong Bian, Tongyuan Chen, Zhixuan Chen, Zebiao Li, Peng Du, Binbin
Zhou, Xierong Zeng, Jiaoning Tang, Chen Liu | One-step synthesis of mesoporous Cobalt sulfides (CoSx) on the metal
substrate as an efficient bifunctional electrode for overall water splitting | 24 pages, 6 figures | null | null | null | physics.app-ph cond-mat.mtrl-sci | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Electrocatalysts based on transition metal sulfides are drawing accelerating
concerns in renewable energy research because of their intrinsically excellent
activities towards both hydrogen evolution reaction and oxygen evolution
reaction. To date, considerable efforts are made to improve the performance of
these catalysts, but ignoring the improper synthesis strategy would incur
additional cost to the catalyst. Herein, a convenient, one-step anodization
method is developed for fast construction of cobalt sulfides. Without any
high-temperature or long-time treatment, mesoporous CoSx is self-grown on the
metal substrate in minutes. As a result, as-anodic CoSx requires overpotentials
of 102 mV for HER and 284 mV for OER to achieve a current density of 10 mA m-2
in alkaline solution. Moreover, the tandem bifunctional as-anodic CoSx exhibits
a required cell voltage of 1.64 V for overall water splitting in alkaline
solution, exceeding most of the documented Co-based electrocatalysts.
| [{'version': 'v1', 'created': 'Sun, 28 Feb 2021 04:06:30 GMT'}] | 2021-03-02 | [['Bian', 'Haidong', ''], ['Chen', 'Tongyuan', ''], ['Chen', 'Zhixuan', ''], ['Li', 'Zebiao', ''], ['Du', 'Peng', ''], ['Zhou', 'Binbin', ''], ['Zeng', 'Xierong', ''], ['Tang', 'Jiaoning', ''], ['Liu', 'Chen', '']] |
2105.15065 | Amar Prakash Azad | Amar Prakash Azad, Supriyo Ghosh, Ajay Gupta, Harshit Kumar and
Prateeti Mohapatra | Picking Pearl From Seabed: Extracting Artefacts from Noisy Issue
Triaging Collaborative Conversations for Hybrid Cloud Services | null | null | null | null | cs.AI cs.CL | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Site Reliability Engineers (SREs) play a key role in issue identification and
resolution. After an issue is reported, SREs come together in a virtual room
(collaboration platform) to triage the issue. While doing so, they leave behind
a wealth of information which can be used later for triaging similar issues.
However, usability of the conversations offer challenges due to them being i)
noisy and ii) unlabelled. This paper presents a novel approach for issue
artefact extraction from the noisy conversations with minimal labelled data. We
propose a combination of unsupervised and supervised model with minimum human
intervention that leverages domain knowledge to predict artefacts for a small
amount of conversation data and use that for fine-tuning an already pretrained
language model for artefact prediction on a large amount of conversation data.
Experimental results on our dataset show that the proposed ensemble of
unsupervised and supervised model is better than using either one of them
individually.
| [{'version': 'v1', 'created': 'Mon, 31 May 2021 15:51:44 GMT'}] | 2021-06-01 | [['Azad', 'Amar Prakash', ''], ['Ghosh', 'Supriyo', ''], ['Gupta', 'Ajay', ''], ['Kumar', 'Harshit', ''], ['Mohapatra', 'Prateeti', '']] |
2209.08213 | Chenwei Shi | Qian Chen and Chenwei Shi and Yiyan Wang | Reasoning about Dependence, Preference and Coalitional Power | null | null | null | null | cs.GT econ.TH | http://creativecommons.org/licenses/by-nc-nd/4.0/ | This paper presents a logic of preference and functional dependence (LPFD)
and its hybrid extension (HLPFD), both of whose sound and strongly complete
axiomatization are provided. The decidability of LPFD is also proved. The
application of LPFD and HLPFD to modelling cooperative games in strategic and
coalitional forms is explored. The resulted framework provides a unified view
on Nash equilibrium, Pareto optimality and the core. The philosophical
relevance of these game-theoretical notions to discussions of collective agency
is made explicit. Some key connections with other logics are also revealed, for
example, the coalition logic, the logic functional dependence and the logic of
ceteris paribus preference.
| [{'version': 'v1', 'created': 'Sat, 17 Sep 2022 01:52:27 GMT'}] | 2022-09-20 | [['Chen', 'Qian', ''], ['Shi', 'Chenwei', ''], ['Wang', 'Yiyan', '']] |
1611.00028 | Zhengjun Cao | Zhengjun Cao and Lihua Liu | A Note On One Realization of a Scalable Shor Algorithm | 6 pages, two figures | null | null | null | quant-ph cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Very recently, Monz, et al. [arXiv:1507.08852] have reported the
demonstration of factoring 15 using a scalable Shor algorithm with an ion-trap
quantum computer. In this note, we remark that the report is somewhat
misleading because there are three flaws in the proposed circuit diagram of
Shor algorithm. We also remark that the principles behind the demonstration
have not been explained properly, including its correctness and complexity.
| [{'version': 'v1', 'created': 'Tue, 20 Oct 2015 02:04:42 GMT'}] | 2016-11-02 | [['Cao', 'Zhengjun', ''], ['Liu', 'Lihua', '']] |
1812.06961 | Simcha Srebnik | Israel Zadok, Dario R Dekel, and Simcha Srebnik | Unexpected water-hydroxide ion structure and diffusion behavior in low
hydration media | null | null | 10.1016/j.molliq.2020.113485 | null | cond-mat.soft physics.chem-ph | http://creativecommons.org/licenses/by/4.0/ | Hydroxide ion transport and structure in aqueous media is fundamental to many
chemical and biological processes. Research on hydroxide behavior has primarily
focused on a single fully solvated hydroxide, either as an isolated cluster or
in the bulk. This work presents the first computational study to consider a
medium of low hydration levels where the hydroxide ion is microsolvated. Under
such conditions, hydroxide ions are shown to be predominantly present as unique
water-bridged double-hydroxide charged clusters, distinct from previously
reported structures under hydrated conditions. Although layered double
hydroxides were reported in the crystalline state, this is the first time to be
seen in the disordered liquid state. These newly observed double-hydroxide
structures presumably disrupt the hydrogen bonded network required for
structural diffusion of hydroxide ions through water. These ion complexes have
a higher ionic strength which may explain the unexpected diffusion behavior in
comparison to the single hydroxide-water complex.
| [{'version': 'v1', 'created': 'Mon, 17 Dec 2018 18:59:09 GMT'}] | 2020-06-18 | [['Zadok', 'Israel', ''], ['Dekel', 'Dario R', ''], ['Srebnik', 'Simcha', '']] |
1411.7004 | Xianwen Wang | Xianwen Wang, Zhichao Fang and Yang Yang | Continuous, Dynamic and Comprehensive Article-Level Evaluation of
Scientific Literature | The interactive visualization is available at this URL:
http://xianwenwang.com/research/ale/ | null | null | null | cs.DL physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | It is time to make changes to the current research evaluation system, which
is built on the journal selection. In this study, we propose the idea of
continuous, dynamic and comprehensive article-level-evaluation based on
article-level-metrics. Different kinds of metrics are integrated into a
comprehensive indicator, which could quantify both the academic and societal
impact of the article. At different phases after the publication, the weights
of different metrics are dynamically adjusted to mediate the long term and
short term impact of the paper. Using the sample data, we make empirical study
of the article-level-evaluation method.
| [{'version': 'v1', 'created': 'Tue, 25 Nov 2014 20:20:35 GMT'}] | 2014-11-26 | [['Wang', 'Xianwen', ''], ['Fang', 'Zhichao', ''], ['Yang', 'Yang', '']] |
1711.09952 | \v{Z}iga Emer\v{s}i\v{c} | \v{Z}iga Emer\v{s}i\v{c} and Dejan \v{S}tepec and Vitomir \v{S}truc
and Peter Peer | Training Convolutional Neural Networks with Limited Training Data for
Ear Recognition in the Wild | null | null | 10.1109/FG.2017.123 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Identity recognition from ear images is an active field of research within
the biometric community. The ability to capture ear images from a distance and
in a covert manner makes ear recognition technology an appealing choice for
surveillance and security applications as well as related application domains.
In contrast to other biometric modalities, where large datasets captured in
uncontrolled settings are readily available, datasets of ear images are still
limited in size and mostly of laboratory-like quality. As a consequence, ear
recognition technology has not benefited yet from advances in deep learning and
convolutional neural networks (CNNs) and is still lacking behind other
modalities that experienced significant performance gains owing to deep
recognition technology. In this paper we address this problem and aim at
building a CNNbased ear recognition model. We explore different strategies
towards model training with limited amounts of training data and show that by
selecting an appropriate model architecture, using aggressive data augmentation
and selective learning on existing (pre-trained) models, we are able to learn
an effective CNN-based model using a little more than 1300 training images. The
result of our work is the first CNN-based approach to ear recognition that is
also made publicly available to the research community. With our model we are
able to improve on the rank one recognition rate of the previous
state-of-the-art by more than 25% on a challenging dataset of ear images
captured from the web (a.k.a. in the wild).
| [{'version': 'v1', 'created': 'Mon, 27 Nov 2017 19:51:06 GMT'}, {'version': 'v2', 'created': 'Fri, 1 Feb 2019 08:19:35 GMT'}] | 2019-02-04 | [['Emeršič', 'Žiga', ''], ['Štepec', 'Dejan', ''], ['Štruc', 'Vitomir', ''], ['Peer', 'Peter', '']] |
2007.10569 | Hashem Albhrani | Hashem Albhrani, Reetam Sen Biswas, and Anamitra Pal | Identification of Utility-Scale Renewable Energy Penetration Threshold
in a Dynamic Setting | Accepted for the 2020 52nd North American Power Symposium (NAPS) | null | null | null | eess.SY cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Integration of renewable energy resources with the electric grid is necessary
for a sustainable energy future. However, increased penetration of inverter
based resources (IBRs) reduce grid inertia, which might then compromise power
system reliability. Therefore, power utilities are often interested in
identifying the maximum IBR penetration limit for their system. The proposed
research presents a methodology to identify the IBR penetration threshold
beyond which voltage, frequency, and tie-line limits will be exceeded. The
sensitivity of the IBR penetration threshold to momentary cessation due to low
voltages, transmission versus distribution connected solar generation, and
stalling of induction motors are also analyzed. Dynamic simulation studies
conducted on a 24,000-bus model of the Western Interconnection (WI) demonstrate
the practicality of the proposed approach.
| [{'version': 'v1', 'created': 'Tue, 21 Jul 2020 02:39:14 GMT'}, {'version': 'v2', 'created': 'Wed, 29 Jul 2020 18:57:05 GMT'}, {'version': 'v3', 'created': 'Sun, 16 Aug 2020 23:32:10 GMT'}] | 2020-08-18 | [['Albhrani', 'Hashem', ''], ['Biswas', 'Reetam Sen', ''], ['Pal', 'Anamitra', '']] |
2102.09797 | Xingxing Zhang | Xinru Wang, Liang Xia, Chris Bales, Xingxing Zhang, Benedetta
Copertaro, Song Pan, Jinshun Wu | A systematic review of recent air source heat pump (ASHP) systems
assisted by solar thermal, photovoltaic and photovoltaic/thermal sources | null | Renewable Energy 146 (2020) 2472-2487 | 10.1016/j.renene.2019.08.096 | null | eess.SY cs.SY | http://creativecommons.org/licenses/by-nc-nd/4.0/ | The air source heat pump (ASHP) systems assisted by solar energy have drawn
great attentions, owing to their great feasibility in buildings for space
heating/cooling and hot water purposes. However, there are a variety of
configurations, parameters and performance criteria of solar assisted ASHP
systems, leading to a major inconsistency that increase the degree of
complexity to compare and implement different systems. A comparative literature
review is lacking, with the aim to evaluate the performance of various ASHP
systems from three main solar sources, such as solar thermal (ST), photovoltaic
(PV) and hybrid photovoltaic/thermal (PV/T). This paper thus conducts a
systematic review of the prevailing solar assisted ASHP systems, including
their boundary conditions, system configurations, performance indicators,
research methodologies and system performance. The comparison result indicates
that PV-ASHP system has the best techno-economic performance, which performs
best in average with coefficient of performance (COP) of around 3.75, but with
moderate cost and payback time. While ST-ASHP and PV/T-ASHP systems have lower
performance with mean COP of 2.90 and 3.03, respectively. Moreover, PV/T-ASHP
system has the highest cost and longest payback time, while ST-ASHP has the
lowest ones. Future research are discussed from aspects of methodologies,
system optimization and standard evaluation.
| [{'version': 'v1', 'created': 'Fri, 19 Feb 2021 08:28:14 GMT'}] | 2021-02-22 | [['Wang', 'Xinru', ''], ['Xia', 'Liang', ''], ['Bales', 'Chris', ''], ['Zhang', 'Xingxing', ''], ['Copertaro', 'Benedetta', ''], ['Pan', 'Song', ''], ['Wu', 'Jinshun', '']] |
1702.08017 | Borja Balle | Borja Balle, Pascale Gourdeau, Prakash Panangaden | Bisimulation Metrics for Weighted Automata | null | null | null | null | cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We develop a new bisimulation (pseudo)metric for weighted finite automata
(WFA) that generalizes Boreale's linear bisimulation relation. Our metrics are
induced by seminorms on the state space of WFA. Our development is based on
spectral properties of sets of linear operators. In particular, the joint
spectral radius of the transition matrices of WFA plays a central role. We also
study continuity properties of the bisimulation pseudometric, establish an
undecidability result for computing the metric, and give a preliminary account
of applications to spectral learning of weighted automata.
| [{'version': 'v1', 'created': 'Sun, 26 Feb 2017 10:31:28 GMT'}, {'version': 'v2', 'created': 'Sun, 14 May 2017 07:53:06 GMT'}] | 2017-05-16 | [['Balle', 'Borja', ''], ['Gourdeau', 'Pascale', ''], ['Panangaden', 'Prakash', '']] |
2107.04640 | Erika Garutti | I. Zoi, A. Ebrahimi, F. Feindt, E. Garutti, P. Gunnellini, A.
Hinzmann, C. Niemeyer, D. Pitzl, J. Schwandt, G. Steinbr\"uck | Position resolution with 25 um pitch pixel sensors before and after
irradiation | null | null | 10.1016/j.nima.2021.165933 | null | physics.ins-det | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Pixelated silicon detectors are state-of-the-art technology to achieve
precise tracking and vertexing at collider experiments, designed to accurately
measure the hit position of incoming particles in high rate and radiation
environments. The detector requirements become extremely demanding for
operation at the High-Luminosity LHC, where up to 200 interactions will overlap
in the same bunch crossing on top of the process of interest. Additionally,
fluences up to 2.3 10^16 cm^-2 1 MeV neutron equivalent at 3.0 cm distance from
the beam are expected for an integrated luminosity of 3000 fb^-1. In the last
decades, the pixel pitch has constantly been reduced to cope with the
experiment's needs of achieving higher position resolution and maintaining low
pixel occupancy per channel. The spatial resolution improves with a decreased
pixel size but it degrades with radiation damage. Therefore, prototype sensor
modules for the upgrade of the experiments at the HL-LHC need to be tested
after being irradiated. This paper describes position resolution measurements
on planar prototype sensors with 100x25 um^2 pixels for the CMS Phase-2
Upgrade. It reviews the dependence of the position resolution on the relative
inclination angle between the incoming particle trajectory and the sensor, the
charge threshold applied by the readout chip, and the bias voltage. A precision
setup with three parallel planes of sensors has been used to investigate the
performance of sensors irradiated to fluences up to F_eq = 3.6 10^15 cm-2. The
measurements were performed with a 5 GeV electron beam. A spatial resolution of
3.2 +\- 0.1 um is found for non-irradiated sensors, at the optimal angle for
charge sharing. The resolution is 5.0 +/- 0.2 um for a proton-irradiated sensor
at F_eq = 2.1 10^15 cm-2 and a neutron-irradiated sensor at F_eq = 3.6 10^15
cm^-2.
| [{'version': 'v1', 'created': 'Fri, 9 Jul 2021 19:28:12 GMT'}] | 2021-12-08 | [['Zoi', 'I.', ''], ['Ebrahimi', 'A.', ''], ['Feindt', 'F.', ''], ['Garutti', 'E.', ''], ['Gunnellini', 'P.', ''], ['Hinzmann', 'A.', ''], ['Niemeyer', 'C.', ''], ['Pitzl', 'D.', ''], ['Schwandt', 'J.', ''], ['Steinbrück', 'G.', '']] |
2204.04638 | Roozbeh Rajabi | Seyed Hossein Mosavi Azarang, Roozbeh Rajabi, Hadi Zayyani, Amin
Zehtabian | Spectral Unmixing of Hyperspectral Images Based on Block Sparse
Structure | 25 pages, 8 figures, 2 tables, accepted for publication in journal | null | null | null | eess.IV cs.CV | http://creativecommons.org/licenses/by/4.0/ | Spectral unmixing (SU) of hyperspectral images (HSIs) is one of the important
areas in remote sensing (RS) that needs to be carefully addressed in different
RS applications. Despite the high spectral resolution of the hyperspectral
data, the relatively low spatial resolution of the sensors may lead to mixture
of different pure materials within the image pixels. In this case, the spectrum
of a given pixel recorded by the sensor can be a combination of multiple
spectra each belonging to a unique material in that pixel. Spectral unmixing is
then used as a technique to extract the spectral characteristics of the
different materials within the mixed pixels and to recover the spectrum of each
pure spectral signature, called endmember. Block-sparsity exists in
hyperspectral images as a result of spectral similarity between neighboring
pixels. In block-sparse signals, the nonzero samples occur in clusters and the
pattern of the clusters is often supposed to be unavailable as prior
information. This paper presents an innovative spectral unmixing approach for
HSIs based on block-sparse structure. Hyperspectral unmixing problem is solved
using pattern coupled sparse Bayesian learning strategy (PCSBL). To evaluate
the performance of the proposed SU algorithm, it is tested on both synthetic
and real hyperspectral data and the quantitative results are compared to those
of other state-of-the-art methods in terms of abundance angle distance and mean
squared error. The achieved results show the superiority of the proposed
algorithm over the other competing methods by a significant margin.
| [{'version': 'v1', 'created': 'Sun, 10 Apr 2022 09:37:41 GMT'}, {'version': 'v2', 'created': 'Fri, 17 Feb 2023 09:24:56 GMT'}] | 2023-02-20 | [['Azarang', 'Seyed Hossein Mosavi', ''], ['Rajabi', 'Roozbeh', ''], ['Zayyani', 'Hadi', ''], ['Zehtabian', 'Amin', '']] |
2010.14805 | Keunwoo Choi Mr | Qiuqiang Kong, Keunwoo Choi, Yuxuan Wang | Large-Scale MIDI-based Composer Classification | null | null | null | null | cs.SD cs.CV cs.MM eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Music classification is a task to classify a music piece into labels such as
genres or composers. We propose large-scale MIDI based composer classification
systems using GiantMIDI-Piano, a transcription-based dataset. We propose to use
piano rolls, onset rolls, and velocity rolls as input representations and use
deep neural networks as classifiers. To our knowledge, we are the first to
investigate the composer classification problem with up to 100 composers. By
using convolutional recurrent neural networks as models, our MIDI based
composer classification system achieves a 10-composer and a 100-composer
classification accuracies of 0.648 and 0.385 (evaluated on 30-second clips) and
0.739 and 0.489 (evaluated on music pieces), respectively. Our MIDI based
composer system outperforms several audio-based baseline classification
systems, indicating the effectiveness of using compact MIDI representations for
composer classification.
| [{'version': 'v1', 'created': 'Wed, 28 Oct 2020 08:07:55 GMT'}] | 2020-10-29 | [['Kong', 'Qiuqiang', ''], ['Choi', 'Keunwoo', ''], ['Wang', 'Yuxuan', '']] |
1812.07693 | Aram Davtyan | Aram Davtyan and Anatoly B. Kolomeisky | Theoretical Insights into Mechanisms of Stochastic Gating in
Channel-Facilitated Molecular Transport | null | null | null | null | physics.chem-ph physics.bio-ph q-bio.SC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Molecular motion through pores plays a crucial role in various natural and
industrial processes. One of the most fascinating features of biological
channel-facilitated transport is a stochastic gating process, when the channels
dynamically fluctuate between several conformations during the translocation.
Although this phenomenon has been intensively investigated, many properties of
translocation in dynamically changing environment remain not well understood
microscopically. We developed a discrete-state stochastic framework to analyze
the molecular mechanisms of transport processes with stochastic gating by
explicitly calculating molecular fluxes through the pores. Two scenarios are
specifically investigated: 1) symmetry preserving stochastic gating with
free-energy changes, and 2) stochastic gating with symmetry changes but without
modifications in the overall particle-pore interactions. It is found that
stochastic gating can both accelerate or slow down the molecular translocation
depending on the specific parameters of the system. We argue that biological
systems might optimize their performance by utilizing conformational
fluctuations of channels. Our theoretical analysis clarifies physical-chemical
aspects of the molecular mechanisms of transport with stochastic gating.
| [{'version': 'v1', 'created': 'Tue, 18 Dec 2018 23:26:06 GMT'}] | 2018-12-20 | [['Davtyan', 'Aram', ''], ['Kolomeisky', 'Anatoly B.', '']] |
1909.09340 | Pooja Munjal | Pooja Munjal and Kamal P. Singh (Department of Physical Sciences,
IISER Mohali) | A single-lens universal interferometer: Towards a class of frugal
optical devices | This article may be downloaded for personal use only. Any other use
requires prior permission of the author and AIP Publishing. This article
appeared in (P. Munjal & K. P. Singh, Appl. Phys. Lett., 115(11), 111102,
(2019) (https://doi.org/10.1063/1.5108587)) | Applied Physics Letters, 115(11), 111102, (2019) | 10.1063/1.5108587 | null | physics.optics physics.app-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The application of precision interferometers is generally restricted to
expensive and smooth high-quality surfaces. Here, we offer a route to ultimate
miniaturization of interferometer by integrating beam splitter, reference
mirror and light collector into a single optical element, an interference lens
(iLens), which produces stable high-contrast fringes from in situ surface of
paper, wood, plastic, rubber, unpolished metal, human skin, etc. A
self-referencing real-time precision of sub-20 picometer (~ lambda/30000) is
demonstrated with simple intensity detection under ambient conditions. The
principle of iLens interferometry has been exploited to build a variety of
compact devices, such as a paper-based optical pico-balance, having 1000 times
higher sensitivity and speed, when compared with a high-end seven-digit
electronic balance. Furthermore, we used cloth, paper, polymer-films to readily
construct broadband acoustic sensors possessing matched or higher sensitivity
when compared with piezo and electromagnetic sensors. Our work opens path for
affordable yet ultra-precise frugal photonic devices and universal
micro-interferometers for imaging.
| [{'version': 'v1', 'created': 'Fri, 20 Sep 2019 06:31:37 GMT'}] | 2019-09-23 | [['Munjal', 'Pooja', '', 'Department of Physical Sciences,\n IISER Mohali'], ['Singh', 'Kamal P.', '', 'Department of Physical Sciences,\n IISER Mohali']] |
1602.00370 | Jian Tang | Jian Tang, Jingzhou Liu, Ming Zhang and Qiaozhu Mei | Visualizing Large-scale and High-dimensional Data | WWW 2016 | null | 10.1145/2872427.2883041 | null | cs.LG cs.HC | http://creativecommons.org/licenses/by-nc-sa/4.0/ | We study the problem of visualizing large-scale and high-dimensional data in
a low-dimensional (typically 2D or 3D) space. Much success has been reported
recently by techniques that first compute a similarity structure of the data
points and then project them into a low-dimensional space with the structure
preserved. These two steps suffer from considerable computational costs,
preventing the state-of-the-art methods such as the t-SNE from scaling to
large-scale and high-dimensional data (e.g., millions of data points and
hundreds of dimensions). We propose the LargeVis, a technique that first
constructs an accurately approximated K-nearest neighbor graph from the data
and then layouts the graph in the low-dimensional space. Comparing to t-SNE,
LargeVis significantly reduces the computational cost of the graph construction
step and employs a principled probabilistic model for the visualization step,
the objective of which can be effectively optimized through asynchronous
stochastic gradient descent with a linear time complexity. The whole procedure
thus easily scales to millions of high-dimensional data points. Experimental
results on real-world data sets demonstrate that the LargeVis outperforms the
state-of-the-art methods in both efficiency and effectiveness. The
hyper-parameters of LargeVis are also much more stable over different data
sets.
| [{'version': 'v1', 'created': 'Mon, 1 Feb 2016 03:01:33 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Apr 2016 03:59:57 GMT'}] | 2016-04-06 | [['Tang', 'Jian', ''], ['Liu', 'Jingzhou', ''], ['Zhang', 'Ming', ''], ['Mei', 'Qiaozhu', '']] |
physics/0212092 | Hitoshi Kitada | Hitoshi Kitada (University of Tokyo) | Inconsistent Universe | 6 pages | null | null | KIMS-2002-12-23 | physics.gen-ph | null | Physics is introduced as a semantics of a formal set theory.
| [{'version': 'v1', 'created': 'Tue, 24 Dec 2002 16:00:24 GMT'}] | 2007-05-23 | [['Kitada', 'Hitoshi', '', 'University of Tokyo']] |
1610.06409 | Pierre Vial | Pierre Vial | Infinitary Intersection Types as Sequences: a New Answer to Klop's
Question | 32 pages | null | null | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We provide a type-theoretical characterization of weakly-normalizing terms in
an infinitary lambda-calculus. We adapt for this purpose the standard
quantitative (with non-idempotent intersections) type assignment system of the
lambda-calculus to our infinite calculus. Our work provides a new answer to
Klop's HHN-problem, namely, finding out if there is a type system
characterizing the hereditary head-normalizing (HHN) lambda-terms. Tatsuta
showed that HHN could not be characterized by a finite type system. We prove
that an infinitary type system endowed with a validity condition called
approximability can achieve it.
| [{'version': 'v1', 'created': 'Thu, 20 Oct 2016 13:40:58 GMT'}] | 2016-10-21 | [['Vial', 'Pierre', '']] |
1912.07088 | Alejandro Sevilla | Alejandro Sevilla and Carlos Mart\'inez-Baz\'an | Vortex shedding in high-Reynolds-number axisymmetric bluff-body wakes:
local linear instability and global bleed control | 14 pages, 13 figures | Physics of Fluids 16, 3460 (2004) | 10.1063/1.1773071 | null | physics.flu-dyn | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the large-scale helical vortex shedding regime in the wake of an
axisymmetric body with a blunt trailing edge at high Reynolds numbers, both
experimentally and by means of local, linear, spatiotemporal stability
analysis. In the instability analysis we take into account the detailed
downstream evolution of the basic flow behind the body base. The study confirms
the existence of a finite region of absolute instability for the first
azimuthal number in the near field of the wake. Such instability is believed to
trigger the large scale helical vortex shedding downstream of the recirculating
zone. Inhibition of vortex shedding is examined by blowing a given flow rate of
fluid through the base of the slender body. The extent of the locally absolute
region of the flow is calculated as a function of the bleed coefficient,
$C_b=q_b/(\pi R^2u_\infty)$, where $q_b$ is the bleed flow rate, $R$ is the
radius of the base and $u_\infty$ is the incident free-stream velocity. It is
shown that the basic flow becomes convectively unstable everywhere for a
critical value of the bleed coefficient of $C_b^*\sim 0.13$, such that no
self-excited regime is expected for $C_b>C_b^*$. In addition, we report
experimental results of flow visualizations and hot-wire measurements for
increasing values of the bleed coefficient. When a sufficient amount of base
bleed is applied, flow visualizations indicate that vortex shedding is
suppressed and that the mean flow becomes axisymmetric. The critical bleed
coefficient predicted by linear instability analysis is shown to fall within
the experimental values in the range of Reynolds numbers analyzed here.
| [{'version': 'v1', 'created': 'Sun, 15 Dec 2019 18:41:40 GMT'}] | 2019-12-17 | [['Sevilla', 'Alejandro', ''], ['Martínez-Bazán', 'Carlos', '']] |
1707.00621 | Marcos Zampieri | Alina Maria Ciobanu, Marcos Zampieri, Shervin Malmasi, Liviu P. Dinu | Including Dialects and Language Varieties in Author Profiling | Proceedings of PAN at CLEF 2017 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a computational approach to author profiling taking
gender and language variety into account. We apply an ensemble system with the
output of multiple linear SVM classifiers trained on character and word
$n$-grams. We evaluate the system using the dataset provided by the organizers
of the 2017 PAN lab on author profiling. Our approach achieved 75% average
accuracy on gender identification on tweets written in four languages and 97%
accuracy on language variety identification for Portuguese.
| [{'version': 'v1', 'created': 'Mon, 3 Jul 2017 16:06:16 GMT'}] | 2017-07-04 | [['Ciobanu', 'Alina Maria', ''], ['Zampieri', 'Marcos', ''], ['Malmasi', 'Shervin', ''], ['Dinu', 'Liviu P.', '']] |
1907.11072 | Ningren Han | Ningren Han, Gavin N. West, Amir H. Atabaki, David Burghoff, and
Rajeev J. Ram | Compact and high-precision wavemeters using the Talbot effect and signal
processing | null | null | 10.1364/OL.44.004187 | null | physics.ins-det physics.optics | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Precise knowledge of a laser's wavelength is crucial for applications from
spectroscopy to telecommunications. Here we present a wavemeter which operates
on the Talbot effect. Tone parameter extraction algorithms are used to retrieve
the frequency of the periodic signal obtained in the sampled Talbot
interferogram. Theoretical performance analysis based on the Cram\'er-Rao lower
bound (CRLB) as well as experimental results are presented and discussed. With
this scheme, we experimentally demonstrate a compact and high-precision
wavemeter with below 10 pm single-shot estimation uncertainty under the
3-$\sigma$ criterion around 780 nm.
| [{'version': 'v1', 'created': 'Sun, 21 Jul 2019 20:16:06 GMT'}] | 2019-10-02 | [['Han', 'Ningren', ''], ['West', 'Gavin N.', ''], ['Atabaki', 'Amir H.', ''], ['Burghoff', 'David', ''], ['Ram', 'Rajeev J.', '']] |
2212.08416 | Francesco Conte | Anna Rita Di Fazio, Arturo Losi, Mario Russo, Filippo Cacace,
Francesco Conte, Giulio Iannello, Gianluca Natrella, Matteo Saviozzi | Methods and Tools for the Management of Renewable Energy Communities:
the ComER project | null | null | 10.23919/AEIT56783.2022.9951776 | null | eess.SY cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Renewable Energy Communities (RECs) have been officially introduced into the
European legislation through the Clean Energy for all Europeans package. A REC
is defined as an association of citizens, commercial activities, enterprises,
and local authorities that own small-scale power plants based on Renewable
Energy Sources (RESs). The community has the objective of maximizing the share
of renewable energy, i.e. the self-consumption of the energy generated by the
community RES power plants and to generally optimize the use of electrical
energy. This paper describes the ComER project, developed by the University of
Cassino and the Campus Bio-Medico University of Rome. The project focuses on
the main technical problems to face for the realization of a REC. The principal
objective is to develop methods and tools necessary for the management and
control of RECs. In particular, this paper describes the rules established for
RECs in the Italian legislations, the organization of the ComER project, the
adopted solutions and the first obtained results.
| [{'version': 'v1', 'created': 'Fri, 16 Dec 2022 11:30:23 GMT'}] | 2022-12-19 | [['Di Fazio', 'Anna Rita', ''], ['Losi', 'Arturo', ''], ['Russo', 'Mario', ''], ['Cacace', 'Filippo', ''], ['Conte', 'Francesco', ''], ['Iannello', 'Giulio', ''], ['Natrella', 'Gianluca', ''], ['Saviozzi', 'Matteo', '']] |
2303.04300 | Robert McLachlan | Robert I McLachlan, David I McLaren, and G R W Quispel | Birational maps from polarization and the preservation of measure and
integrals | null | null | null | null | math.DS cs.NA math.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The main result of this paper is the discretization of Hamiltonian systems of
the form $\ddot x = -K \nabla W(x)$, where $K$ is a constant symmetric matrix
and $W\colon\mathbb{R}^n\to \mathbb{R}$ is a polynomial of degree $d\le 4$ in
any number of variables $n$. The discretization uses the method of polarization
and preserves both the energy and the invariant measure of the differential
equation, as well as the dimension of the phase space. This generalises earlier
work for discretizations of first order systems with $d=3$, and of second order
systems with $d=4$ and $n=1$.
| [{'version': 'v1', 'created': 'Wed, 8 Mar 2023 00:38:44 GMT'}] | 2023-03-09 | [['McLachlan', 'Robert I', ''], ['McLaren', 'David I', ''], ['Quispel', 'G R W', '']] |
1906.05034 | Sathoshi Tomioka | Satoshi Tomioka, Shusuke Nishiyama, Yutaka Matsumoto, Naoki Miyamoto | Desingularization of matrix equations employing hypersingular integrals
in boundary element methods using double nodes | 14 pages, 10 figures, accepted manuscript submitted to Engineering
Analysis with Boundary Element | Engineering Analysis with Boundarry Elements, 106, pp 493-504
(2019) | 10.1016/j.enganabound.2019.06.003 | null | math.NA cs.NA math.AP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In boundary element methods, the method of using double nodes at corners is a
useful approach to uniquely define the normal direction of boundary elements.
However, matrix equations constructed by conventional boundary integral
equations (CBIE) become singular under certain combinations of double node
boundary conditions. In this paper, we analyze the singular conditions of the
CBIE formulation for cases where the boundary conditions at the double node are
imposed by combinations of Dirichlet, Neumann, Robin, and interface conditions.
To address this singularity we propose the use of hypersingular integral
equations (HBIE) for wave propagation problems that obey Helmholtz equation. To
demonstrate the applicability of HBIE, we compare three types of simultaneous
equations: (i) CBIE, (ii) partial-HBIE in which HBIE is only applied to the
double nodes at corners while CBIE is applied to the other nodes, and (iii)
full-HBIE in which HBIE is applied to all nodes. Based on our numerical
results, we observe the following results. The singularity of the matrix
equations for problems with any combination of boundary conditions can be
resolved by both full-HBIE and partial-HBIE, and partial-HBIE exhibits better
accuracy than full-HBIE. Furthermore, the computational cost of partial-HBIE is
smaller than that of full-HBIE.
| [{'version': 'v1', 'created': 'Wed, 12 Jun 2019 09:44:48 GMT'}, {'version': 'v2', 'created': 'Tue, 18 Jun 2019 01:30:57 GMT'}] | 2019-06-27 | [['Tomioka', 'Satoshi', ''], ['Nishiyama', 'Shusuke', ''], ['Matsumoto', 'Yutaka', ''], ['Miyamoto', 'Naoki', '']] |
2105.02091 | Avijit Ghosh | Avijit Ghosh, Ritam Dutt, Christo Wilson | When Fair Ranking Meets Uncertain Inference | Accepted as full paper at SIGIR 2021 | null | 10.1145/3404835.3462850 | null | cs.IR cs.CY cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Existing fair ranking systems, especially those designed to be
demographically fair, assume that accurate demographic information about
individuals is available to the ranking algorithm. In practice, however, this
assumption may not hold -- in real-world contexts like ranking job applicants
or credit seekers, social and legal barriers may prevent algorithm operators
from collecting peoples' demographic information. In these cases, algorithm
operators may attempt to infer peoples' demographics and then supply these
inferences as inputs to the ranking algorithm.
In this study, we investigate how uncertainty and errors in demographic
inference impact the fairness offered by fair ranking algorithms. Using
simulations and three case studies with real datasets, we show how demographic
inferences drawn from real systems can lead to unfair rankings. Our results
suggest that developers should not use inferred demographic data as input to
fair ranking algorithms, unless the inferences are extremely accurate.
| [{'version': 'v1', 'created': 'Wed, 5 May 2021 14:40:07 GMT'}, {'version': 'v2', 'created': 'Wed, 4 May 2022 21:00:47 GMT'}] | 2022-05-06 | [['Ghosh', 'Avijit', ''], ['Dutt', 'Ritam', ''], ['Wilson', 'Christo', '']] |
2010.08062 | Przemyslaw Musialski | Stefan Pillwein, Johanna K\"ubert, Florian Rist, Przemyslaw Musialski | Design and Fabrication of Elastic Geodesic Grid Structures | 11 pages, 15 figures | null | 10.1145/3424630.3425412 | null | cs.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Elastic geodesic grids (EGG) are lightweight structures that can be easily
deployed to approximate designer provided free-form surfaces. In the initial
configuration the grids are perfectly flat, during deployment, though,
curvature is induced to the structure, as grid elements bend and twist. Their
layout is found geometrically, it is based on networks of geodesic curves on
free-form design-surfaces. Generating a layout with this approach encodes an
elasto-kinematic mechanism to the grid that creates the curved shape during
deployment. In the final state the grid can be fixed to supports and serve for
all kinds of purposes like free-form sub-structures, paneling, sun and rain
protectors, pavilions, etc. However, so far these structures have only been
investigated using small-scale desktop models. We investigate the scalability
of such structures, presenting a medium sized model. It was designed by an
architecture student without expert knowledge on elastic structures or
differential geometry, just using the elastic geodesic grids design-pipeline.
We further present a fabrication-process for EGG-models. They can be built
quickly and with a small budget.
| [{'version': 'v1', 'created': 'Thu, 15 Oct 2020 23:10:08 GMT'}] | 2020-10-23 | [['Pillwein', 'Stefan', ''], ['Kübert', 'Johanna', ''], ['Rist', 'Florian', ''], ['Musialski', 'Przemyslaw', '']] |
1301.0565 | Byron E Dom | Byron E Dom | An Information-Theoretic External Cluster-Validity Measure | Appears in Proceedings of the Eighteenth Conference on Uncertainty in
Artificial Intelligence (UAI2002) | null | null | UAI-P-2002-PG-137-145 | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we propose a measure of clustering quality or accuracy that is
appropriate in situations where it is desirable to evaluate a clustering
algorithm by somehow comparing the clusters it produces with ``ground truth'
consisting of classes assigned to the patterns by manual means or some other
means in whose veracity there is confidence. Such measures are refered to as
``external'. Our measure also has the characteristic of allowing clusterings
with different numbers of clusters to be compared in a quantitative and
principled way. Our evaluation scheme quantitatively measures how useful the
cluster labels of the patterns are as predictors of their class labels. In
cases where all clusterings to be compared have the same number of clusters,
the measure is equivalent to the mutual information between the cluster labels
and the class labels. In cases where the numbers of clusters are different,
however, it computes the reduction in the number of bits that would be required
to encode (compress) the class labels if both the encoder and decoder have free
acccess to the cluster labels. To achieve this encoding the estimated
conditional probabilities of the class labels given the cluster labels must
also be encoded. These estimated probabilities can be seen as a model for the
class labels and their associated code length as a model cost.
| [{'version': 'v1', 'created': 'Wed, 12 Dec 2012 15:56:02 GMT'}] | 2013-01-07 | [['Dom', 'Byron E', '']] |
1112.4191 | Derek Flood | Derek Flood, Rachel Harrison, Kevin McDaid | Spreadsheets on the Move: An Evaluation of Mobile Spreadsheets | 12 Pages, 7 Tables, 1 Colour Figure; Proc. European Spreadsheet Risks
Int. Grp. (EuSpRIG) 2011 ISBN 978-0-9566256-9-4 | null | null | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The power of mobile devices has increased dramatically in the last few years.
These devices are becoming more sophisticated allowing users to accomplish a
wide variety of tasks while on the move. The increasingly mobile nature of
business has meant that more users will need access to spreadsheets while away
from their desktop and laptop computers. Existing mobile applications suffer
from a number of usability issues that make using spreadsheets in this way more
difficult. This work represents the first evaluation of mobile spreadsheet
applications. Through a pilot survey the needs and experiences of experienced
spreadsheet users was examined. The range of spreadsheet apps available for the
iOS platform was also evaluated in light of these users' needs.
| [{'version': 'v1', 'created': 'Sun, 18 Dec 2011 21:30:26 GMT'}] | 2011-12-20 | [['Flood', 'Derek', ''], ['Harrison', 'Rachel', ''], ['McDaid', 'Kevin', '']] |
2303.07154 | YunDa Tsai | Yun-Da Tsai, Tzu-Hsien Tsai, Shou-De Lin | Differential Good Arm Identification | null | null | null | null | cs.LG stat.ML | http://creativecommons.org/licenses/by/4.0/ | This paper targets a variant of the stochastic multi-armed bandit problem
called good arm identification (GAI). GAI is a pure-exploration bandit problem
with the goal to output as many good arms using as few samples as possible,
where a good arm is defined as an arm whose expected reward is greater than a
given threshold. In this work, we propose DGAI - a differentiable good arm
identification algorithm to improve the sample complexity of the
state-of-the-art HDoC algorithm in a data-driven fashion. We also showed that
the DGAI can further boost the performance of a general multi-arm bandit (MAB)
problem given a threshold as a prior knowledge to the arm set. Extensive
experiments confirm that our algorithm outperform the baseline algorithms
significantly in both synthetic and real world datasets for both GAI and MAB
tasks.
| [{'version': 'v1', 'created': 'Mon, 13 Mar 2023 14:28:21 GMT'}] | 2023-03-14 | [['Tsai', 'Yun-Da', ''], ['Tsai', 'Tzu-Hsien', ''], ['Lin', 'Shou-De', '']] |
1810.04389 | Zhenglu Duan | Yuyi Yan, Yanbei Cheng, Shengguo Guan, Danying Yu, and Zhenglu Duan | Pulse-regulated single-photon generation via quantum interference in a
$\chi^{(2)}$ nonlinear nanocavity | 4 pages,3figures | Optics Letters Vol. 43, Issue 20, pp. 5086-5089 (2018) | 10.1364/OL.43.005086 | null | quant-ph physics.optics | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A scalable on-chip single-photon source at telecommunications wavelengths is
an essential component of quantum communication networks. In this work, we
numerically construct a pulse-regulated single-photon source based on an
optical parametric amplifier in a nanocavity. Under the condition of pulsed
excitation, we study the photon statistics of the source using the Monte Carlo
wave-function method. The results show that there exits an optimum excitation
pulse width for generating high-purity single photons, while the source
brightness increases monotonically with increasing excitation pulse width. More
importantly, our system can be operated resonantly and we show that in this
case the oscillations in $g^{(2)}(0)$ is completely suppressed.
| [{'version': 'v1', 'created': 'Wed, 10 Oct 2018 06:46:32 GMT'}] | 2018-11-14 | [['Yan', 'Yuyi', ''], ['Cheng', 'Yanbei', ''], ['Guan', 'Shengguo', ''], ['Yu', 'Danying', ''], ['Duan', 'Zhenglu', '']] |
1608.05179 | Wei Ma | Wei Ma and Xun Liu | Improving the Efficiency of DAMAS for Sound Source Localization via
Wavelet Compression Computational Grid | 15 pages, 6 figures, 2 tables, 23 conferences | null | 10.1016/j.jsv.2017.02.005 | null | cs.SD | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Phased microphone arrays are used widely in the applications for acoustic
source localization. Deconvolution approaches such as DAMAS successfully
overcome the spatial resolution limit of the conventional delay-and-sum (DAS)
beamforming method. However deconvolution approaches require high computational
effort compared to conventional DAS beamforming method. This paper presents a
novel method that serves to improve the efficiency of DAMAS via wavelet
compression computational grid rather than via optimizing DAMAS algorithm. In
this method, the efficiency of DAMAS increases with compression ratio. This
method can thus save lots of run time in industrial applications for sound
source localization, particularly when sound sources are just located in a
small extent compared with scanning plane and a band of angular frequency needs
to be calculated. In addition, this method largely retains the spatial
resolution of DAMAS on original computational grid, although with a minor
deficiency that the occurrence probability of aliasing increasing slightly for
complicated sound source.
| [{'version': 'v1', 'created': 'Thu, 18 Aug 2016 05:16:38 GMT'}, {'version': 'v2', 'created': 'Mon, 29 Aug 2016 14:31:34 GMT'}] | 2017-02-14 | [['Ma', 'Wei', ''], ['Liu', 'Xun', '']] |
2106.02352 | Ilia Kamyshev | Ilia Kamyshev, Dmitrii Kriukov, Elena Gryazina | COLD: Concurrent Loads Disaggregator for Non-Intrusive Load Monitoring | null | null | null | null | eess.SP cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The modern artificial intelligence techniques show the outstanding
performances in the field of Non-Intrusive Load Monitoring (NILM). However, the
problem related to the identification of a large number of appliances working
simultaneously is underestimated. One of the reasons is the absence of a
specific data. In this research we propose the Synthesizer of Normalized
Signatures (SNS) algorithm to simulate the aggregated consumption with up to 10
concurrent loads. The results show that the synthetic data provides the models
with at least as a powerful identification accuracy as the real-world
measurements. We have developed the neural architecture named Concurrent Loads
Disaggregator (COLD) which is relatively simple and easy to understand in
comparison to the previous approaches. Our model allows identifying from 1 to
10 appliances working simultaneously with mean F1-score 78.95%. The source code
of the experiments performed is available at
https://github.com/arx7ti/cold-nilm.
| [{'version': 'v1', 'created': 'Fri, 4 Jun 2021 09:04:33 GMT'}] | 2021-06-07 | [['Kamyshev', 'Ilia', ''], ['Kriukov', 'Dmitrii', ''], ['Gryazina', 'Elena', '']] |
Subsets and Splits