id stringlengths 9 10 | submitter stringlengths 1 64 ⌀ | authors stringlengths 4 20.7k | title stringlengths 4 246 | comments stringlengths 1 523 ⌀ | journal-ref stringlengths 4 404 ⌀ | doi stringlengths 11 153 ⌀ | report-no stringlengths 2 254 ⌀ | categories stringlengths 5 98 | license stringclasses 9
values | orig_abstract stringlengths 14 3.35k | versions listlengths 1 60 | update_date stringlengths 10 10 | authors_parsed listlengths 1 1.35k | abstract stringlengths 11 3.34k |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1107.2336 | Nikolaos Nikolaidis | N. S. Nikolaidis, I. N. Nikolaidis and C. C. Tsouros | A Variation of the Box-Counting Algorithm Applied to Colour Images | 10 pages, 3 figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The box counting method for fractal dimension estimation had not been applied
to large or colour images thus far due to the processing time required. In this
letter we present a fast, easy to implement and very easily expandable to any
number of dimensions variation, the box merging method. It is applied here in
RGB ... | [
{
"created": "Tue, 12 Jul 2011 16:21:06 GMT",
"version": "v1"
}
] | 2011-07-13 | [
[
"Nikolaidis",
"N. S.",
""
],
[
"Nikolaidis",
"I. N.",
""
],
[
"Tsouros",
"C. C.",
""
]
] | The box counting method for fractal dimension estimation had not been applied to large or colour images thus far due to the processing time required. In this letter we present a fast, easy to implement and very easily expandable to any number of dimensions variation, the box merging method. It is applied here in RGB im... |
2402.16508 | Fan Jiang | Fan Jiang, Tom Drummond, Trevor Cohn | Pre-training Cross-lingual Open Domain Question Answering with
Large-scale Synthetic Supervision | null | null | null | null | cs.CL cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Cross-lingual open domain question answering (CLQA) is a complex problem,
comprising cross-lingual retrieval from a multilingual knowledge base, followed
by answer generation in the query language. Both steps are usually tackled by
separate models, requiring substantial annotated datasets, and typically
auxiliary res... | [
{
"created": "Mon, 26 Feb 2024 11:42:29 GMT",
"version": "v1"
},
{
"created": "Sun, 16 Jun 2024 08:18:25 GMT",
"version": "v2"
}
] | 2024-06-18 | [
[
"Jiang",
"Fan",
""
],
[
"Drummond",
"Tom",
""
],
[
"Cohn",
"Trevor",
""
]
] | Cross-lingual open domain question answering (CLQA) is a complex problem, comprising cross-lingual retrieval from a multilingual knowledge base, followed by answer generation in the query language. Both steps are usually tackled by separate models, requiring substantial annotated datasets, and typically auxiliary resou... |
1606.02033 | Mingquan Zhong | Mingquan Zhong, Suzhi Bi, and Xiaohui Lin | User Cooperation for Enhanced Throughput Fairness in Wireless Powered
Communication Networks | This paper has been accepted by the IEEE International Conference on
Telecommunications (ICT), Thessaloniki, Greece, May 16-18, 2016 | null | 10.1109/ICT.2016.7500446 | null | cs.IT cs.NI math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper studies a novel user cooperation method in a wireless powered
communication network (WPCN), where a pair of distributed terminal users first
harvest wireless energy broadcasted by one energy node (EN) and then use the
harvested energy to transmit information cooperatively to a destination node
(DN). In par... | [
{
"created": "Tue, 7 Jun 2016 06:03:45 GMT",
"version": "v1"
},
{
"created": "Fri, 28 Oct 2016 17:41:58 GMT",
"version": "v2"
}
] | 2016-11-18 | [
[
"Zhong",
"Mingquan",
""
],
[
"Bi",
"Suzhi",
""
],
[
"Lin",
"Xiaohui",
""
]
] | This paper studies a novel user cooperation method in a wireless powered communication network (WPCN), where a pair of distributed terminal users first harvest wireless energy broadcasted by one energy node (EN) and then use the harvested energy to transmit information cooperatively to a destination node (DN). In parti... |
2109.06873 | Ranganath Krishnan | Ranganath Krishnan, Nilesh Ahuja, Alok Sinha, Mahesh Subedar, Omesh
Tickoo, Ravi Iyer | Robust Contrastive Active Learning with Feature-guided Query Strategies | 20 pages with appendix. arXiv admin note: text overlap with
arXiv:2109.06321 | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce supervised contrastive active learning (SCAL) and propose
efficient query strategies in active learning based on the feature similarity
(featuresim) and principal component analysis based feature-reconstruction
error (fre) to select informative data samples with diverse feature
representations. We demons... | [
{
"created": "Mon, 13 Sep 2021 21:09:21 GMT",
"version": "v1"
},
{
"created": "Sun, 14 Aug 2022 19:39:03 GMT",
"version": "v2"
}
] | 2022-08-16 | [
[
"Krishnan",
"Ranganath",
""
],
[
"Ahuja",
"Nilesh",
""
],
[
"Sinha",
"Alok",
""
],
[
"Subedar",
"Mahesh",
""
],
[
"Tickoo",
"Omesh",
""
],
[
"Iyer",
"Ravi",
""
]
] | We introduce supervised contrastive active learning (SCAL) and propose efficient query strategies in active learning based on the feature similarity (featuresim) and principal component analysis based feature-reconstruction error (fre) to select informative data samples with diverse feature representations. We demonstr... |
2103.10277 | Sergio Martiradonna | Sergio Martiradonna, Andrea Abrardo, Marco Moretti, Giuseppe Piro,
Gennaro Boggia | Deep Reinforcement Learning-Aided RAN Slicing Enforcement for B5G
Latency Sensitive Services | null | null | null | null | cs.NI cs.AI cs.LG cs.PF | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The combination of cloud computing capabilities at the network edge and
artificial intelligence promise to turn future mobile networks into service-
and radio-aware entities, able to address the requirements of upcoming
latency-sensitive applications. In this context, a challenging research goal is
to exploit edge in... | [
{
"created": "Thu, 18 Mar 2021 14:18:34 GMT",
"version": "v1"
}
] | 2021-03-19 | [
[
"Martiradonna",
"Sergio",
""
],
[
"Abrardo",
"Andrea",
""
],
[
"Moretti",
"Marco",
""
],
[
"Piro",
"Giuseppe",
""
],
[
"Boggia",
"Gennaro",
""
]
] | The combination of cloud computing capabilities at the network edge and artificial intelligence promise to turn future mobile networks into service- and radio-aware entities, able to address the requirements of upcoming latency-sensitive applications. In this context, a challenging research goal is to exploit edge inte... |
2307.14446 | Reza Azad | Sanaz Karimijafarbigloo and Reza Azad and Dorit Merhof | Self-supervised Few-shot Learning for Semantic Segmentation: An
Annotation-free Approach | MICCAI 2023 workshop PRIME | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Few-shot semantic segmentation (FSS) offers immense potential in the field of
medical image analysis, enabling accurate object segmentation with limited
training data. However, existing FSS techniques heavily rely on annotated
semantic classes, rendering them unsuitable for medical images due to the
scarcity of annot... | [
{
"created": "Wed, 26 Jul 2023 18:33:30 GMT",
"version": "v1"
}
] | 2023-07-28 | [
[
"Karimijafarbigloo",
"Sanaz",
""
],
[
"Azad",
"Reza",
""
],
[
"Merhof",
"Dorit",
""
]
] | Few-shot semantic segmentation (FSS) offers immense potential in the field of medical image analysis, enabling accurate object segmentation with limited training data. However, existing FSS techniques heavily rely on annotated semantic classes, rendering them unsuitable for medical images due to the scarcity of annotat... |
1911.08793 | Neema Kachappilly Davis | Neema Davis, Gaurav Raina, Krishna Jagannathan | A Framework for End-to-End Deep Learning-Based Anomaly Detection in
Transportation Networks | Preprint submitted to Elsevier TRIP. arXiv admin note: text overlap
with arXiv:1909.06041 | null | null | null | cs.LG eess.SP stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We develop an end-to-end deep learning-based anomaly detection model for
temporal data in transportation networks. The proposed EVT-LSTM model is
derived from the popular LSTM (Long Short-Term Memory) network and adopts an
objective function that is based on fundamental results from EVT (Extreme Value
Theory). We com... | [
{
"created": "Wed, 20 Nov 2019 09:49:58 GMT",
"version": "v1"
}
] | 2019-11-21 | [
[
"Davis",
"Neema",
""
],
[
"Raina",
"Gaurav",
""
],
[
"Jagannathan",
"Krishna",
""
]
] | We develop an end-to-end deep learning-based anomaly detection model for temporal data in transportation networks. The proposed EVT-LSTM model is derived from the popular LSTM (Long Short-Term Memory) network and adopts an objective function that is based on fundamental results from EVT (Extreme Value Theory). We compa... |
1507.04603 | Xinyu Gao | Xinyu Gao, Linglong Dai, Chau Yuen, and Zhaocheng Wang | Turbo-Like Beamforming Based on Tabu Search Algorithm for
Millimeter-Wave Massive MIMO Systems | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For millimeter-wave (mmWave) massive MIMO systems, the codebook-based analog
beamforming (including transmit precoding and receive combining) is usually
used to compensate the severe attenuation of mmWave signals. However,
conventional beamforming schemes involve complicated search among pre-defined
codebooks to find... | [
{
"created": "Thu, 16 Jul 2015 14:47:35 GMT",
"version": "v1"
}
] | 2015-07-17 | [
[
"Gao",
"Xinyu",
""
],
[
"Dai",
"Linglong",
""
],
[
"Yuen",
"Chau",
""
],
[
"Wang",
"Zhaocheng",
""
]
] | For millimeter-wave (mmWave) massive MIMO systems, the codebook-based analog beamforming (including transmit precoding and receive combining) is usually used to compensate the severe attenuation of mmWave signals. However, conventional beamforming schemes involve complicated search among pre-defined codebooks to find o... |
1104.1506 | Jocelyne Troccaz | Michael Baumann (TIMC), Michel Bolla, Vincent Daanen, Jean-Luc
Descotes, Jean-Yves Giraud, Nikolai Hungr (TIMC), Antoine Leroy,
Jean-Alexandre Long, S\'ebastien Martin (TIMC), Jocelyne Troccaz (TIMC) | Prosper: image and robot-guided prostate brachytherapy | null | null | null | null | cs.RO physics.med-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Brachytherapy for localized prostate cancer consists in destroying cancer by
introducing iodine radioactive seeds into the gland through hollow needles. The
planning of the position of the seeds and their introduction into the prostate
is based on intra-operative ultrasound (US) imaging. We propose to optimize the
gl... | [
{
"created": "Fri, 8 Apr 2011 07:37:30 GMT",
"version": "v1"
}
] | 2011-04-11 | [
[
"Baumann",
"Michael",
"",
"TIMC"
],
[
"Bolla",
"Michel",
"",
"TIMC"
],
[
"Daanen",
"Vincent",
"",
"TIMC"
],
[
"Descotes",
"Jean-Luc",
"",
"TIMC"
],
[
"Giraud",
"Jean-Yves",
"",
"TIMC"
],
[
"Hungr",
"Nikolai... | Brachytherapy for localized prostate cancer consists in destroying cancer by introducing iodine radioactive seeds into the gland through hollow needles. The planning of the position of the seeds and their introduction into the prostate is based on intra-operative ultrasound (US) imaging. We propose to optimize the glob... |
1912.05571 | Iman Tabrizian | Saeedeh Parsaeefard, Iman Tabrizian, Alberto Leon Garcia | Representation of Federated Learning via Worst-Case Robust Optimization
Theory | null | null | null | null | cs.LG cs.DC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Federated learning (FL) is a distributed learning approach where a set of
end-user devices participate in the learning process by acting on their
isolated local data sets. Here, we process local data sets of users where
worst-case optimization theory is used to reformulate the FL problem where the
impact of local dat... | [
{
"created": "Wed, 11 Dec 2019 19:02:49 GMT",
"version": "v1"
}
] | 2019-12-13 | [
[
"Parsaeefard",
"Saeedeh",
""
],
[
"Tabrizian",
"Iman",
""
],
[
"Garcia",
"Alberto Leon",
""
]
] | Federated learning (FL) is a distributed learning approach where a set of end-user devices participate in the learning process by acting on their isolated local data sets. Here, we process local data sets of users where worst-case optimization theory is used to reformulate the FL problem where the impact of local data ... |
1904.11578 | Guo YuHu | Yuhu Guo, Han Xiao, Yidong Chen, Xiaodong Shi | Asynchronous "Events" are Better For Motion Estimation | Submitted at IJCAI 2019 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Event-based camera is a bio-inspired vision sensor that records intensity
changes (called event) asynchronously in each pixel. As an instance of
event-based camera, Dynamic and Active-pixel Vision Sensor (DAVIS) combines a
standard camera and an event-based camera. However, traditional models could
not deal with the ... | [
{
"created": "Wed, 24 Apr 2019 02:10:10 GMT",
"version": "v1"
}
] | 2019-04-29 | [
[
"Guo",
"Yuhu",
""
],
[
"Xiao",
"Han",
""
],
[
"Chen",
"Yidong",
""
],
[
"Shi",
"Xiaodong",
""
]
] | Event-based camera is a bio-inspired vision sensor that records intensity changes (called event) asynchronously in each pixel. As an instance of event-based camera, Dynamic and Active-pixel Vision Sensor (DAVIS) combines a standard camera and an event-based camera. However, traditional models could not deal with the ev... |
2107.14230 | Dongdong Chen | Shuquan Ye and Dongdong Chen and Songfang Han and Jing Liao | Learning with Noisy Labels for Robust Point Cloud Segmentation | Typos fixed. ICCV 2021 Oral, Relabeled ScanNetV2 and code are
available at https://shuquanye.com/PNAL_website/ | null | null | null | cs.CV cs.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Point cloud segmentation is a fundamental task in 3D. Despite recent progress
on point cloud segmentation with the power of deep networks, current deep
learning methods based on the clean label assumptions may fail with noisy
labels. Yet, object class labels are often mislabeled in real-world point cloud
datasets. In... | [
{
"created": "Thu, 29 Jul 2021 17:59:54 GMT",
"version": "v1"
},
{
"created": "Thu, 5 Aug 2021 17:59:08 GMT",
"version": "v2"
}
] | 2021-08-06 | [
[
"Ye",
"Shuquan",
""
],
[
"Chen",
"Dongdong",
""
],
[
"Han",
"Songfang",
""
],
[
"Liao",
"Jing",
""
]
] | Point cloud segmentation is a fundamental task in 3D. Despite recent progress on point cloud segmentation with the power of deep networks, current deep learning methods based on the clean label assumptions may fail with noisy labels. Yet, object class labels are often mislabeled in real-world point cloud datasets. In t... |
1703.02156 | Jiaming Song | Jiaming Song, Russell Stewart, Shengjia Zhao and Stefano Ermon | On the Limits of Learning Representations with Label-Based Supervision | Submitted to ICLR 2017 Workshop Track | null | null | null | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Advances in neural network based classifiers have transformed automatic
feature learning from a pipe dream of stronger AI to a routine and expected
property of practical systems. Since the emergence of AlexNet every winning
submission of the ImageNet challenge has employed end-to-end representation
learning, and due ... | [
{
"created": "Tue, 7 Mar 2017 00:09:31 GMT",
"version": "v1"
}
] | 2017-03-08 | [
[
"Song",
"Jiaming",
""
],
[
"Stewart",
"Russell",
""
],
[
"Zhao",
"Shengjia",
""
],
[
"Ermon",
"Stefano",
""
]
] | Advances in neural network based classifiers have transformed automatic feature learning from a pipe dream of stronger AI to a routine and expected property of practical systems. Since the emergence of AlexNet every winning submission of the ImageNet challenge has employed end-to-end representation learning, and due to... |
2212.04365 | Haifeng Li | Jiawei Zhu, Mei Hong, Ronghua Du, Haifeng Li | Alleviating neighbor bias: augmenting graph self-supervise learning with
structural equivalent positive samples | 8 pages, 5 figures, 8 tables | null | null | null | cs.LG cs.AI cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In recent years, using a self-supervised learning framework to learn the
general characteristics of graphs has been considered a promising paradigm for
graph representation learning. The core of self-supervised learning strategies
for graph neural networks lies in constructing suitable positive sample
selection strat... | [
{
"created": "Thu, 8 Dec 2022 16:04:06 GMT",
"version": "v1"
}
] | 2022-12-09 | [
[
"Zhu",
"Jiawei",
""
],
[
"Hong",
"Mei",
""
],
[
"Du",
"Ronghua",
""
],
[
"Li",
"Haifeng",
""
]
] | In recent years, using a self-supervised learning framework to learn the general characteristics of graphs has been considered a promising paradigm for graph representation learning. The core of self-supervised learning strategies for graph neural networks lies in constructing suitable positive sample selection strateg... |
2211.06233 | Matias Valdenegro-Toro | Levente Foldesi and Matias Valdenegro-Toro | Comparison of Uncertainty Quantification with Deep Learning in Time
Series Regression | 5 pages, with appendix. RobustSeq @ NeurIPS 2022 Camera Ready | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Increasingly high-stakes decisions are made using neural networks in order to
make predictions. Specifically, meteorologists and hedge funds apply these
techniques to time series data. When it comes to prediction, there are certain
limitations for machine learning models (such as lack of expressiveness,
vulnerability... | [
{
"created": "Fri, 11 Nov 2022 14:29:13 GMT",
"version": "v1"
}
] | 2022-11-14 | [
[
"Foldesi",
"Levente",
""
],
[
"Valdenegro-Toro",
"Matias",
""
]
] | Increasingly high-stakes decisions are made using neural networks in order to make predictions. Specifically, meteorologists and hedge funds apply these techniques to time series data. When it comes to prediction, there are certain limitations for machine learning models (such as lack of expressiveness, vulnerability o... |
2206.11795 | Bowen Baker | Bowen Baker, Ilge Akkaya, Peter Zhokhov, Joost Huizinga, Jie Tang,
Adrien Ecoffet, Brandon Houghton, Raul Sampedro, Jeff Clune | Video PreTraining (VPT): Learning to Act by Watching Unlabeled Online
Videos | null | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Pretraining on noisy, internet-scale datasets has been heavily studied as a
technique for training models with broad, general capabilities for text,
images, and other modalities. However, for many sequential decision domains
such as robotics, video games, and computer use, publicly available data does
not contain the... | [
{
"created": "Thu, 23 Jun 2022 16:01:11 GMT",
"version": "v1"
}
] | 2022-06-24 | [
[
"Baker",
"Bowen",
""
],
[
"Akkaya",
"Ilge",
""
],
[
"Zhokhov",
"Peter",
""
],
[
"Huizinga",
"Joost",
""
],
[
"Tang",
"Jie",
""
],
[
"Ecoffet",
"Adrien",
""
],
[
"Houghton",
"Brandon",
""
],
[
"Sampe... | Pretraining on noisy, internet-scale datasets has been heavily studied as a technique for training models with broad, general capabilities for text, images, and other modalities. However, for many sequential decision domains such as robotics, video games, and computer use, publicly available data does not contain the l... |
2006.15832 | Linshan Jiang | Linshan Jiang, Rui Tan, Arvind Easwaran | Resilience Bounds of Network Clock Synchronization with Fault Correction | null | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Internet of Things (IoT) will be a main data generation infrastructure
for achieving better system intelligence. This paper considers the design and
implementation of a practical privacy-preserving collaborative learning scheme,
in which a curious learning coordinator trains a better machine learning model
based ... | [
{
"created": "Mon, 29 Jun 2020 06:41:24 GMT",
"version": "v1"
}
] | 2020-06-30 | [
[
"Jiang",
"Linshan",
""
],
[
"Tan",
"Rui",
""
],
[
"Easwaran",
"Arvind",
""
]
] | The Internet of Things (IoT) will be a main data generation infrastructure for achieving better system intelligence. This paper considers the design and implementation of a practical privacy-preserving collaborative learning scheme, in which a curious learning coordinator trains a better machine learning model based on... |
1001.4411 | EPTCS | Igor Mozolevsky (University of Newcastle), John Fitzgerald (University
of Newcastle) | Common Representation of Information Flows for Dynamic Coalitions | null | EPTCS 16, 2010, pp. 15-25 | 10.4204/EPTCS.16.2 | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a formal foundation for reasoning about access control policies
within a Dynamic Coalition, defining an abstraction over existing access
control models and providing mechanisms for translation of those models into
information-flow domain. The abstracted information-flow domain model, called a
Common Repres... | [
{
"created": "Mon, 25 Jan 2010 12:44:06 GMT",
"version": "v1"
}
] | 2010-01-26 | [
[
"Mozolevsky",
"Igor",
"",
"University of Newcastle"
],
[
"Fitzgerald",
"John",
"",
"University\n of Newcastle"
]
] | We propose a formal foundation for reasoning about access control policies within a Dynamic Coalition, defining an abstraction over existing access control models and providing mechanisms for translation of those models into information-flow domain. The abstracted information-flow domain model, called a Common Represen... |
1903.12090 | Fabrizio Sebastiani | Alejandro Moreo Fern\'andez, Andrea Esuli, Fabrizio Sebastiani | Learning to Weight for Text Classification | To appear in IEEE Transactions on Knowledge and Data Engineering | Final version published in IEEE Transactions on Data and Knowledge
Engineering, 32(2):302-316, 2020 | null | null | cs.LG cs.IR stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In information retrieval (IR) and related tasks, term weighting approaches
typically consider the frequency of the term in the document and in the
collection in order to compute a score reflecting the importance of the term
for the document. In tasks characterized by the presence of training data (such
as text classi... | [
{
"created": "Thu, 28 Mar 2019 16:13:35 GMT",
"version": "v1"
}
] | 2021-09-22 | [
[
"Fernández",
"Alejandro Moreo",
""
],
[
"Esuli",
"Andrea",
""
],
[
"Sebastiani",
"Fabrizio",
""
]
] | In information retrieval (IR) and related tasks, term weighting approaches typically consider the frequency of the term in the document and in the collection in order to compute a score reflecting the importance of the term for the document. In tasks characterized by the presence of training data (such as text classifi... |
2007.03937 | Tommaso Cesari | Tommaso Cesari (TSE), Roberto Colomboni (IIT) | A Nearest Neighbor Characterization of Lebesgue Points in Metric Measure
Spaces | null | null | null | null | cs.LG math.PR stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The property of almost every point being a Lebesgue point has proven to be
crucial for the consistency of several classification algorithms based on
nearest neighbors. We characterize Lebesgue points in terms of a 1-Nearest
Neighbor regression algorithm for pointwise estimation, fleshing out the role
played by tie-br... | [
{
"created": "Wed, 8 Jul 2020 07:42:31 GMT",
"version": "v1"
},
{
"created": "Mon, 21 Sep 2020 10:13:43 GMT",
"version": "v2"
},
{
"created": "Fri, 11 Dec 2020 10:37:56 GMT",
"version": "v3"
},
{
"created": "Tue, 12 Jan 2021 15:15:27 GMT",
"version": "v4"
}
] | 2021-01-13 | [
[
"Cesari",
"Tommaso",
"",
"TSE"
],
[
"Colomboni",
"Roberto",
"",
"IIT"
]
] | The property of almost every point being a Lebesgue point has proven to be crucial for the consistency of several classification algorithms based on nearest neighbors. We characterize Lebesgue points in terms of a 1-Nearest Neighbor regression algorithm for pointwise estimation, fleshing out the role played by tie-brea... |
1402.2482 | Manuel Cebrian | Yury Kryvasheyeu, Haohui Chen, Esteban Moro, Pascal Van Hentenryck,
Manuel Cebrian | Performance of Social Network Sensors During Hurricane Sandy | null | null | 10.1371/journal.pone.0117288 | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Information flow during catastrophic events is a critical aspect of disaster
management. Modern communication platforms, in particular online social
networks, provide an opportunity to study such flow, and a mean to derive
early-warning sensors, improving emergency preparedness and response.
Performance of the social... | [
{
"created": "Tue, 11 Feb 2014 13:09:21 GMT",
"version": "v1"
},
{
"created": "Fri, 20 Jun 2014 15:21:55 GMT",
"version": "v2"
}
] | 2015-06-18 | [
[
"Kryvasheyeu",
"Yury",
""
],
[
"Chen",
"Haohui",
""
],
[
"Moro",
"Esteban",
""
],
[
"Van Hentenryck",
"Pascal",
""
],
[
"Cebrian",
"Manuel",
""
]
] | Information flow during catastrophic events is a critical aspect of disaster management. Modern communication platforms, in particular online social networks, provide an opportunity to study such flow, and a mean to derive early-warning sensors, improving emergency preparedness and response. Performance of the social n... |
2405.13268 | Haosen Ge | Haosen Ge, Hamsa Bastani, Osbert Bastani | Stochastic Online Conformal Prediction with Semi-Bandit Feedback | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Conformal prediction has emerged as an effective strategy for uncertainty
quantification by modifying a model to output sets of labels instead of a
single label. These prediction sets come with the guarantee that they contain
the true label with high probability. However, conformal prediction typically
requires a lar... | [
{
"created": "Wed, 22 May 2024 00:42:49 GMT",
"version": "v1"
}
] | 2024-05-24 | [
[
"Ge",
"Haosen",
""
],
[
"Bastani",
"Hamsa",
""
],
[
"Bastani",
"Osbert",
""
]
] | Conformal prediction has emerged as an effective strategy for uncertainty quantification by modifying a model to output sets of labels instead of a single label. These prediction sets come with the guarantee that they contain the true label with high probability. However, conformal prediction typically requires a large... |
2206.07099 | James Flamino | Omar Malik, James Flamino, Boleslaw K. Szymanski | Resource-Mediated Consensus Formation | 8 pages, 9 figures | Proc. SIGSIM-PADS'22: SIGSIM Conference on Principles of Advanced
Discrete Simulation, Atlanta, GA, USA, June 8-10, 2022, pp. 105-112, | 10.1145/3518997.3534959 | null | cs.MA cs.SI | http://creativecommons.org/licenses/by/4.0/ | In social sciences, simulating opinion dynamics to study the interplay
between homophily and influence, and the subsequent formation of echo chambers,
is of great importance. As such, in this paper we investigate echo chambers by
implementing a unique social game in which we spawn in a large number of
agents, each as... | [
{
"created": "Tue, 14 Jun 2022 18:36:22 GMT",
"version": "v1"
}
] | 2022-06-22 | [
[
"Malik",
"Omar",
""
],
[
"Flamino",
"James",
""
],
[
"Szymanski",
"Boleslaw K.",
""
]
] | In social sciences, simulating opinion dynamics to study the interplay between homophily and influence, and the subsequent formation of echo chambers, is of great importance. As such, in this paper we investigate echo chambers by implementing a unique social game in which we spawn in a large number of agents, each assi... |
1506.03710 | Ugo Dal Lago | Alberto Cappai, Ugo Dal Lago | On Equivalences, Metrics, and Polynomial Time (Long Version) | null | null | null | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Interactive behaviors are ubiquitous in modern cryptography, but are also
present in $\lambda$-calculi, in the form of higher-order constructions.
Traditionally, however, typed $\lambda$-calculi simply do not fit well into
cryptography, being both deterministic and too powerful as for the complexity
of functions they... | [
{
"created": "Thu, 11 Jun 2015 15:32:04 GMT",
"version": "v1"
}
] | 2015-06-12 | [
[
"Cappai",
"Alberto",
""
],
[
"Lago",
"Ugo Dal",
""
]
] | Interactive behaviors are ubiquitous in modern cryptography, but are also present in $\lambda$-calculi, in the form of higher-order constructions. Traditionally, however, typed $\lambda$-calculi simply do not fit well into cryptography, being both deterministic and too powerful as for the complexity of functions they c... |
2011.11744 | Anshuman Misra | Anshuman Misra and Ajay D. Kshemkalyani | The Bloom Clock for Causality Testing | null | null | 10.1007/978-3-030-65621-8_1 | null | cs.DC | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Testing for causality between events in distributed executions is a
fundamental problem. Vector clocks solve this problem but do not scale well.
The probabilistic Bloom clock can determine causality between events with lower
space, time, and message-space overhead than vector clock; however, predictions
suffer from f... | [
{
"created": "Mon, 23 Nov 2020 21:43:27 GMT",
"version": "v1"
}
] | 2021-06-21 | [
[
"Misra",
"Anshuman",
""
],
[
"Kshemkalyani",
"Ajay D.",
""
]
] | Testing for causality between events in distributed executions is a fundamental problem. Vector clocks solve this problem but do not scale well. The probabilistic Bloom clock can determine causality between events with lower space, time, and message-space overhead than vector clock; however, predictions suffer from fal... |
2401.13961 | Jia Wan | Jia Wan, Wanhua Li, Jason Ken Adhinarta, Atmadeep Banerjee, Evelina
Sjostedt, Jingpeng Wu, Jeff Lichtman, Hanspeter Pfister, Donglai Wei | TriSAM: Tri-Plane SAM for zero-shot cortical blood vessel segmentation
in VEM images | BvEM-Mouse can be visualized at: https://tinyurl.com/yc2s38x9 | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-nd/4.0/ | While imaging techniques at macro and mesoscales have garnered substantial
attention and resources, microscale Volume Electron Microscopy (vEM) imaging,
capable of revealing intricate vascular details, has lacked the necessary
benchmarking infrastructure. In this paper, we address a significant gap in
this field of n... | [
{
"created": "Thu, 25 Jan 2024 05:50:48 GMT",
"version": "v1"
},
{
"created": "Tue, 9 Apr 2024 08:07:48 GMT",
"version": "v2"
},
{
"created": "Tue, 18 Jun 2024 03:53:12 GMT",
"version": "v3"
},
{
"created": "Thu, 15 Aug 2024 09:23:00 GMT",
"version": "v4"
}
] | 2024-08-16 | [
[
"Wan",
"Jia",
""
],
[
"Li",
"Wanhua",
""
],
[
"Adhinarta",
"Jason Ken",
""
],
[
"Banerjee",
"Atmadeep",
""
],
[
"Sjostedt",
"Evelina",
""
],
[
"Wu",
"Jingpeng",
""
],
[
"Lichtman",
"Jeff",
""
],
[
"... | While imaging techniques at macro and mesoscales have garnered substantial attention and resources, microscale Volume Electron Microscopy (vEM) imaging, capable of revealing intricate vascular details, has lacked the necessary benchmarking infrastructure. In this paper, we address a significant gap in this field of neu... |
2307.09748 | Zijian Zhu | Feiran Hu, Peng Wang, Yangyang Li, Chenlong Duan, Zijian Zhu, Fei
Wang, Faen Zhang, Yong Li, Xiu-Shen Wei | Watch out Venomous Snake Species: A Solution to SnakeCLEF2023 | This work was the winner solution of the SnakeCLEF2023 challenge | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | The SnakeCLEF2023 competition aims to the development of advanced algorithms
for snake species identification through the analysis of images and
accompanying metadata. This paper presents a method leveraging utilization of
both images and metadata. Modern CNN models and strong data augmentation are
utilized to learn ... | [
{
"created": "Wed, 19 Jul 2023 04:59:58 GMT",
"version": "v1"
}
] | 2023-07-20 | [
[
"Hu",
"Feiran",
""
],
[
"Wang",
"Peng",
""
],
[
"Li",
"Yangyang",
""
],
[
"Duan",
"Chenlong",
""
],
[
"Zhu",
"Zijian",
""
],
[
"Wang",
"Fei",
""
],
[
"Zhang",
"Faen",
""
],
[
"Li",
"Yong",
"... | The SnakeCLEF2023 competition aims to the development of advanced algorithms for snake species identification through the analysis of images and accompanying metadata. This paper presents a method leveraging utilization of both images and metadata. Modern CNN models and strong data augmentation are utilized to learn be... |
1106.2312 | Rathipriya R | R.Rathipriya, Dr. K.Thangavel and J.Bagyamani | Evolutionary Biclustering of Clickstream Data | null | null | null | null | cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Biclustering is a two way clustering approach involving simultaneous
clustering along two dimensions of the data matrix. Finding biclusters of web
objects (i.e. web users and web pages) is an emerging topic in the context of
web usage mining. It overcomes the problem associated with traditional
clustering methods by ... | [
{
"created": "Sun, 12 Jun 2011 14:34:16 GMT",
"version": "v1"
}
] | 2011-06-14 | [
[
"Rathipriya",
"R.",
""
],
[
"Thangavel",
"Dr. K.",
""
],
[
"Bagyamani",
"J.",
""
]
] | Biclustering is a two way clustering approach involving simultaneous clustering along two dimensions of the data matrix. Finding biclusters of web objects (i.e. web users and web pages) is an emerging topic in the context of web usage mining. It overcomes the problem associated with traditional clustering methods by al... |
1805.07430 | Chen-Yu Wei | Haipeng Luo, Chen-Yu Wei, Kai Zheng | Efficient Online Portfolio with Logarithmic Regret | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the decades-old problem of online portfolio management and propose
the first algorithm with logarithmic regret that is not based on Cover's
Universal Portfolio algorithm and admits much faster implementation.
Specifically Universal Portfolio enjoys optimal regret $\mathcal{O}(N\ln T)$
for $N$ financial instr... | [
{
"created": "Fri, 18 May 2018 20:29:02 GMT",
"version": "v1"
},
{
"created": "Fri, 16 Nov 2018 00:39:47 GMT",
"version": "v2"
}
] | 2018-11-19 | [
[
"Luo",
"Haipeng",
""
],
[
"Wei",
"Chen-Yu",
""
],
[
"Zheng",
"Kai",
""
]
] | We study the decades-old problem of online portfolio management and propose the first algorithm with logarithmic regret that is not based on Cover's Universal Portfolio algorithm and admits much faster implementation. Specifically Universal Portfolio enjoys optimal regret $\mathcal{O}(N\ln T)$ for $N$ financial instrum... |
2110.03380 | You Jin Kim | You Jin Kim, Hee-Soo Heo, Jee-weon Jung, Youngki Kwon, Bong-Jin Lee,
Joon Son Chung | Advancing the dimensionality reduction of speaker embeddings for speaker
diarisation: disentangling noise and informing speech activity | This paper was submitted to ICASSP 2023 | null | null | null | cs.SD cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The objective of this work is to train noise-robust speaker embeddings
adapted for speaker diarisation. Speaker embeddings play a crucial role in the
performance of diarisation systems, but they often capture spurious information
such as noise, adversely affecting performance. Our previous work has proposed
an auto-e... | [
{
"created": "Thu, 7 Oct 2021 12:19:09 GMT",
"version": "v1"
},
{
"created": "Tue, 29 Mar 2022 09:40:45 GMT",
"version": "v2"
},
{
"created": "Thu, 3 Nov 2022 09:21:30 GMT",
"version": "v3"
}
] | 2022-11-04 | [
[
"Kim",
"You Jin",
""
],
[
"Heo",
"Hee-Soo",
""
],
[
"Jung",
"Jee-weon",
""
],
[
"Kwon",
"Youngki",
""
],
[
"Lee",
"Bong-Jin",
""
],
[
"Chung",
"Joon Son",
""
]
] | The objective of this work is to train noise-robust speaker embeddings adapted for speaker diarisation. Speaker embeddings play a crucial role in the performance of diarisation systems, but they often capture spurious information such as noise, adversely affecting performance. Our previous work has proposed an auto-enc... |
2311.15959 | Kaijun Tan | Kaijun Tan, Benzhe Dai, Jiakui Li, Wenyu Mao | CheapNET: Improving Light-weight speech enhancement network by projected
loss function | null | null | null | null | cs.SD cs.AI eess.AS | http://creativecommons.org/licenses/by/4.0/ | Noise suppression and echo cancellation are critical in speech enhancement
and essential for smart devices and real-time communication. Deployed in voice
processing front-ends and edge devices, these algorithms must ensure efficient
real-time inference with low computational demands. Traditional edge-based
noise supp... | [
{
"created": "Mon, 27 Nov 2023 16:03:42 GMT",
"version": "v1"
}
] | 2023-11-28 | [
[
"Tan",
"Kaijun",
""
],
[
"Dai",
"Benzhe",
""
],
[
"Li",
"Jiakui",
""
],
[
"Mao",
"Wenyu",
""
]
] | Noise suppression and echo cancellation are critical in speech enhancement and essential for smart devices and real-time communication. Deployed in voice processing front-ends and edge devices, these algorithms must ensure efficient real-time inference with low computational demands. Traditional edge-based noise suppre... |
1708.00636 | Jaesung Park | Jae Sung Park and Nam Ik Cho | Generation of High Dynamic Range Illumination from a Single Image for
the Enhancement of Undesirably Illuminated Images | null | null | null | null | cs.CV cs.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents an algorithm that enhances undesirably illuminated images
by generating and fusing multi-level illuminations from a single image.The
input image is first decomposed into illumination and reflectance components by
using an edge-preserving smoothing filter. Then the reflectance component is
scaled u... | [
{
"created": "Wed, 2 Aug 2017 08:14:18 GMT",
"version": "v1"
}
] | 2017-08-03 | [
[
"Park",
"Jae Sung",
""
],
[
"Cho",
"Nam Ik",
""
]
] | This paper presents an algorithm that enhances undesirably illuminated images by generating and fusing multi-level illuminations from a single image.The input image is first decomposed into illumination and reflectance components by using an edge-preserving smoothing filter. Then the reflectance component is scaled up ... |
1802.08402 | Shadrokh Samavi | Mojtaba Akbari, Majid Mohrekesh, S.M.Reza Soroushmehr, Nader Karimi,
Shadrokh Samavi, Kayvan Najarian | Adaptive specular reflection detection and inpainting in colonoscopy
video frames | 5 pages, 5 figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Colonoscopy video frames might be contaminated by bright spots with
unsaturated values known as specular reflection. Detection and removal of such
reflections could enhance the quality of colonoscopy images and facilitate
diagnosis procedure. In this paper we propose a novel two-phase method for this
purpose, consist... | [
{
"created": "Fri, 23 Feb 2018 06:25:21 GMT",
"version": "v1"
}
] | 2018-02-26 | [
[
"Akbari",
"Mojtaba",
""
],
[
"Mohrekesh",
"Majid",
""
],
[
"Soroushmehr",
"S. M. Reza",
""
],
[
"Karimi",
"Nader",
""
],
[
"Samavi",
"Shadrokh",
""
],
[
"Najarian",
"Kayvan",
""
]
] | Colonoscopy video frames might be contaminated by bright spots with unsaturated values known as specular reflection. Detection and removal of such reflections could enhance the quality of colonoscopy images and facilitate diagnosis procedure. In this paper we propose a novel two-phase method for this purpose, consistin... |
2207.11903 | Allen Liu | Allen Liu, Ankur Moitra | Minimax Rates for Robust Community Detection | To appear in FOCS 2022 | null | null | null | cs.DS cs.LG cs.SI math.PR stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we study the problem of community detection in the stochastic
block model with adversarial node corruptions. Our main result is an efficient
algorithm that can tolerate an $\epsilon$-fraction of corruptions and achieves
error $O(\epsilon) + e^{-\frac{C}{2} (1 \pm o(1))}$ where $C = (\sqrt{a} -
\sqrt{b})... | [
{
"created": "Mon, 25 Jul 2022 04:45:16 GMT",
"version": "v1"
}
] | 2022-07-26 | [
[
"Liu",
"Allen",
""
],
[
"Moitra",
"Ankur",
""
]
] | In this work, we study the problem of community detection in the stochastic block model with adversarial node corruptions. Our main result is an efficient algorithm that can tolerate an $\epsilon$-fraction of corruptions and achieves error $O(\epsilon) + e^{-\frac{C}{2} (1 \pm o(1))}$ where $C = (\sqrt{a} - \sqrt{b})^2... |
2407.21611 | Jiafeng Zhong | Jiafeng Zhong, Bin Li, Jiangyan Yi | Enhancing Partially Spoofed Audio Localization with Boundary-aware
Attention Mechanism | null | null | null | null | cs.SD cs.AI eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The task of partially spoofed audio localization aims to accurately determine
audio authenticity at a frame level. Although some works have achieved
encouraging results, utilizing boundary information within a single model
remains an unexplored research topic. In this work, we propose a novel method
called Boundary-a... | [
{
"created": "Wed, 31 Jul 2024 13:49:17 GMT",
"version": "v1"
}
] | 2024-08-01 | [
[
"Zhong",
"Jiafeng",
""
],
[
"Li",
"Bin",
""
],
[
"Yi",
"Jiangyan",
""
]
] | The task of partially spoofed audio localization aims to accurately determine audio authenticity at a frame level. Although some works have achieved encouraging results, utilizing boundary information within a single model remains an unexplored research topic. In this work, we propose a novel method called Boundary-awa... |
1912.05937 | Rahul Gopinath | Rahul Gopinath, Bj\"orn Mathis, Andreas Zeller | Inferring Input Grammars from Dynamic Control Flow | null | null | null | null | cs.SE cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A program is characterized by its input model, and a formal input model can
be of use in diverse areas including vulnerability analysis, reverse
engineering, fuzzing and software testing, clone detection and refactoring.
Unfortunately, input models for typical programs are often unavailable or out
of date. While ther... | [
{
"created": "Thu, 12 Dec 2019 13:35:09 GMT",
"version": "v1"
}
] | 2019-12-13 | [
[
"Gopinath",
"Rahul",
""
],
[
"Mathis",
"Björn",
""
],
[
"Zeller",
"Andreas",
""
]
] | A program is characterized by its input model, and a formal input model can be of use in diverse areas including vulnerability analysis, reverse engineering, fuzzing and software testing, clone detection and refactoring. Unfortunately, input models for typical programs are often unavailable or out of date. While there ... |
1905.10855 | Martin Sulzmann | Martin Sulzmann and Kai Stadtm\"uller | Data Race Prediction for Inaccurate Traces | 26 pages with appendix | null | null | null | cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Happens-before based data race prediction methods infer from a trace of
events a partial order to check if one event happens before another event. If
two two write events are unordered, they are in a race. We observe that common
tracing methods provide no guarantee that the trace order corresponds to an
actual progra... | [
{
"created": "Sun, 26 May 2019 18:51:24 GMT",
"version": "v1"
},
{
"created": "Sat, 26 Oct 2019 07:57:50 GMT",
"version": "v2"
}
] | 2019-10-29 | [
[
"Sulzmann",
"Martin",
""
],
[
"Stadtmüller",
"Kai",
""
]
] | Happens-before based data race prediction methods infer from a trace of events a partial order to check if one event happens before another event. If two two write events are unordered, they are in a race. We observe that common tracing methods provide no guarantee that the trace order corresponds to an actual program ... |
1104.0775 | Diora Jordan | Markus Wagner, Jareth Day, Diora Jordan, Trent Kroeger, Frank Neumann | Evolving Pacing Strategies for Team Pursuit Track Cycling | null | null | null | null | cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Team pursuit track cycling is a bicycle racing sport held on velodromes and
is part of the Summer Olympics. It involves the use of strategies to minimize
the overall time that a team of cyclists needs to complete a race. We present
an optimisation framework for team pursuit track cycling and show how to evolve
strate... | [
{
"created": "Tue, 5 Apr 2011 08:46:33 GMT",
"version": "v1"
},
{
"created": "Thu, 16 Jun 2011 05:42:09 GMT",
"version": "v2"
}
] | 2011-06-17 | [
[
"Wagner",
"Markus",
""
],
[
"Day",
"Jareth",
""
],
[
"Jordan",
"Diora",
""
],
[
"Kroeger",
"Trent",
""
],
[
"Neumann",
"Frank",
""
]
] | Team pursuit track cycling is a bicycle racing sport held on velodromes and is part of the Summer Olympics. It involves the use of strategies to minimize the overall time that a team of cyclists needs to complete a race. We present an optimisation framework for team pursuit track cycling and show how to evolve strategi... |
1805.08028 | Fuli Luo | Fuli Luo, Tianyu Liu, Qiaolin Xia, Baobao Chang and Zhifang Sui | Incorporating Glosses into Neural Word Sense Disambiguation | Accepted to ACL 2018 (long paper), added code link | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Word Sense Disambiguation (WSD) aims to identify the correct meaning of
polysemous words in the particular context. Lexical resources like WordNet
which are proved to be of great help for WSD in the knowledge-based methods.
However, previous neural networks for WSD always rely on massive labeled data
(context), ignor... | [
{
"created": "Mon, 21 May 2018 12:59:17 GMT",
"version": "v1"
},
{
"created": "Mon, 16 Jul 2018 14:58:30 GMT",
"version": "v2"
}
] | 2018-07-17 | [
[
"Luo",
"Fuli",
""
],
[
"Liu",
"Tianyu",
""
],
[
"Xia",
"Qiaolin",
""
],
[
"Chang",
"Baobao",
""
],
[
"Sui",
"Zhifang",
""
]
] | Word Sense Disambiguation (WSD) aims to identify the correct meaning of polysemous words in the particular context. Lexical resources like WordNet which are proved to be of great help for WSD in the knowledge-based methods. However, previous neural networks for WSD always rely on massive labeled data (context), ignorin... |
1901.10415 | Juncai He | Juncai He and Jinchao Xu | MgNet: A Unified Framework of Multigrid and Convolutional Neural Network | 30 pages | Sci. China Math. 62 (2019) 1331-1354 | 10.1007/s11425-019-9547-2 | null | cs.CV cs.LG math.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We develop a unified model, known as MgNet, that simultaneously recovers some
convolutional neural networks (CNN) for image classification and multigrid (MG)
methods for solving discretized partial differential equations (PDEs). This
model is based on close connections that we have observed and uncovered between
the ... | [
{
"created": "Tue, 29 Jan 2019 17:30:59 GMT",
"version": "v1"
},
{
"created": "Wed, 1 May 2019 20:49:32 GMT",
"version": "v2"
}
] | 2020-04-10 | [
[
"He",
"Juncai",
""
],
[
"Xu",
"Jinchao",
""
]
] | We develop a unified model, known as MgNet, that simultaneously recovers some convolutional neural networks (CNN) for image classification and multigrid (MG) methods for solving discretized partial differential equations (PDEs). This model is based on close connections that we have observed and uncovered between the CN... |
1811.03496 | Helge Spieker | Helge Spieker, Arnaud Gotlieb, Morten Mossige | Multi-Cycle Assignment Problems with Rotational Diversity | Extended journal version | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multi-cycle assignment problems address scenarios where a series of general
assignment problems has to be solved sequentially. Subsequent cycles can differ
from previous ones due to changing availability or creation of tasks and
agents, which makes an upfront static schedule infeasible and introduces
uncertainty in t... | [
{
"created": "Thu, 8 Nov 2018 15:39:35 GMT",
"version": "v1"
},
{
"created": "Thu, 19 Dec 2019 16:11:28 GMT",
"version": "v2"
}
] | 2019-12-20 | [
[
"Spieker",
"Helge",
""
],
[
"Gotlieb",
"Arnaud",
""
],
[
"Mossige",
"Morten",
""
]
] | Multi-cycle assignment problems address scenarios where a series of general assignment problems has to be solved sequentially. Subsequent cycles can differ from previous ones due to changing availability or creation of tasks and agents, which makes an upfront static schedule infeasible and introduces uncertainty in the... |
2406.11819 | Joseph Tung | Joseph Tung, Gene Chou, Ruojin Cai, Guandao Yang, Kai Zhang, Gordon
Wetzstein, Bharath Hariharan, Noah Snavely | MegaScenes: Scene-Level View Synthesis at Scale | Our project page is at https://megascenes.github.io | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Scene-level novel view synthesis (NVS) is fundamental to many vision and
graphics applications. Recently, pose-conditioned diffusion models have led to
significant progress by extracting 3D information from 2D foundation models,
but these methods are limited by the lack of scene-level training data. Common
dataset ch... | [
{
"created": "Mon, 17 Jun 2024 17:55:55 GMT",
"version": "v1"
}
] | 2024-06-18 | [
[
"Tung",
"Joseph",
""
],
[
"Chou",
"Gene",
""
],
[
"Cai",
"Ruojin",
""
],
[
"Yang",
"Guandao",
""
],
[
"Zhang",
"Kai",
""
],
[
"Wetzstein",
"Gordon",
""
],
[
"Hariharan",
"Bharath",
""
],
[
"Snavely"... | Scene-level novel view synthesis (NVS) is fundamental to many vision and graphics applications. Recently, pose-conditioned diffusion models have led to significant progress by extracting 3D information from 2D foundation models, but these methods are limited by the lack of scene-level training data. Common dataset choi... |
2008.02935 | EPTCS | Horatiu Cirstea (LORIA, CNRS & INRIA & Universit\'e de Lorraine),
Alexis Grall (LORIA, CNRS & INRIA & Universit\'e de Lorraine), Dominique
M\'ery (LORIA, CNRS & INRIA & Universit\'e de Lorraine) | Generating Distributed Programs from Event-B Models | In Proceedings VPT/HCVS 2020, arXiv:2008.02483 | EPTCS 320, 2020, pp. 110-124 | 10.4204/EPTCS.320.8 | null | cs.PL cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Distributed algorithms offer challenges in checking that they meet their
specifications. Verification techniques can be extended to deal with the
verification of safety properties of distributed algorithms. In this paper, we
present an approach for combining correct-by-construction approaches and
transformations of f... | [
{
"created": "Fri, 7 Aug 2020 01:23:53 GMT",
"version": "v1"
}
] | 2020-08-10 | [
[
"Cirstea",
"Horatiu",
"",
"LORIA, CNRS & INRIA & Université de Lorraine"
],
[
"Grall",
"Alexis",
"",
"LORIA, CNRS & INRIA & Université de Lorraine"
],
[
"Méry",
"Dominique",
"",
"LORIA, CNRS & INRIA & Université de Lorraine"
]
] | Distributed algorithms offer challenges in checking that they meet their specifications. Verification techniques can be extended to deal with the verification of safety properties of distributed algorithms. In this paper, we present an approach for combining correct-by-construction approaches and transformations of for... |
2111.05097 | Tarek Saier | Tarek Saier, Michael F\"arber, Tornike Tsereteli | Cross-Lingual Citations in English Papers: A Large-Scale Analysis of
Prevalence, Usage, and Impact | to be published in the International Journal on Digital Libraries | null | 10.1007/s00799-021-00312-z | null | cs.DL cs.IR cs.LG | http://creativecommons.org/licenses/by/4.0/ | Citation information in scholarly data is an important source of insight into
the reception of publications and the scholarly discourse. Outcomes of citation
analyses and the applicability of citation based machine learning approaches
heavily depend on the completeness of such data. One particular shortcoming of
scho... | [
{
"created": "Sun, 7 Nov 2021 15:34:02 GMT",
"version": "v1"
},
{
"created": "Wed, 10 Nov 2021 08:48:05 GMT",
"version": "v2"
}
] | 2022-01-12 | [
[
"Saier",
"Tarek",
""
],
[
"Färber",
"Michael",
""
],
[
"Tsereteli",
"Tornike",
""
]
] | Citation information in scholarly data is an important source of insight into the reception of publications and the scholarly discourse. Outcomes of citation analyses and the applicability of citation based machine learning approaches heavily depend on the completeness of such data. One particular shortcoming of schola... |
2302.09130 | Mary Schlembach | William H. Mischo, Mary C. Schlembach, Elisandro Cabada | Relationships between Journal Publication, Citation, and Usage Metrics
within a Carnegie R1 University Collection: A Correlation Analysis | 23 pages; 9 tables | College and Research Libraries, March 2024 | null | null | cs.DL | http://creativecommons.org/licenses/by/4.0/ | This study examines the correlational relationships between local journal
authorship, local and external citation counts, full-text downloads,
link-resolver clicks, and four global journal impact factor indices within an
all-disciplines journal collection of 12,200 titles and six subject subsets at
the University of ... | [
{
"created": "Fri, 17 Feb 2023 20:45:47 GMT",
"version": "v1"
}
] | 2023-02-21 | [
[
"Mischo",
"William H.",
""
],
[
"Schlembach",
"Mary C.",
""
],
[
"Cabada",
"Elisandro",
""
]
] | This study examines the correlational relationships between local journal authorship, local and external citation counts, full-text downloads, link-resolver clicks, and four global journal impact factor indices within an all-disciplines journal collection of 12,200 titles and six subject subsets at the University of Il... |
2402.12336 | Christian Schlarmann | Christian Schlarmann, Naman Deep Singh, Francesco Croce, Matthias Hein | Robust CLIP: Unsupervised Adversarial Fine-Tuning of Vision Embeddings
for Robust Large Vision-Language Models | ICML 2024 Oral | null | null | null | cs.LG cs.AI cs.CV stat.ML | http://creativecommons.org/licenses/by/4.0/ | Multi-modal foundation models like OpenFlamingo, LLaVA, and GPT-4 are
increasingly used for various real-world tasks. Prior work has shown that these
models are highly vulnerable to adversarial attacks on the vision modality.
These attacks can be leveraged to spread fake information or defraud users, and
thus pose a ... | [
{
"created": "Mon, 19 Feb 2024 18:09:48 GMT",
"version": "v1"
},
{
"created": "Wed, 5 Jun 2024 15:32:03 GMT",
"version": "v2"
}
] | 2024-06-06 | [
[
"Schlarmann",
"Christian",
""
],
[
"Singh",
"Naman Deep",
""
],
[
"Croce",
"Francesco",
""
],
[
"Hein",
"Matthias",
""
]
] | Multi-modal foundation models like OpenFlamingo, LLaVA, and GPT-4 are increasingly used for various real-world tasks. Prior work has shown that these models are highly vulnerable to adversarial attacks on the vision modality. These attacks can be leveraged to spread fake information or defraud users, and thus pose a si... |
2010.02305 | Jatin Ganhotra | Jatin Ganhotra, Haggai Roitman, Doron Cohen, Nathaniel Mills, Chulaka
Gunasekara, Yosi Mass, Sachindra Joshi, Luis Lastras and David Konopnicki | Conversational Document Prediction to Assist Customer Care Agents | EMNLP 2020. The released Twitter dataset is available at:
https://github.com/IBM/twitter-customer-care-document-prediction | null | null | null | cs.CL | http://creativecommons.org/licenses/by-nc-sa/4.0/ | A frequent pattern in customer care conversations is the agents responding
with appropriate webpage URLs that address users' needs. We study the task of
predicting the documents that customer care agents can use to facilitate users'
needs. We also introduce a new public dataset which supports the aforementioned
probl... | [
{
"created": "Mon, 5 Oct 2020 19:53:41 GMT",
"version": "v1"
}
] | 2020-10-07 | [
[
"Ganhotra",
"Jatin",
""
],
[
"Roitman",
"Haggai",
""
],
[
"Cohen",
"Doron",
""
],
[
"Mills",
"Nathaniel",
""
],
[
"Gunasekara",
"Chulaka",
""
],
[
"Mass",
"Yosi",
""
],
[
"Joshi",
"Sachindra",
""
],
[
... | A frequent pattern in customer care conversations is the agents responding with appropriate webpage URLs that address users' needs. We study the task of predicting the documents that customer care agents can use to facilitate users' needs. We also introduce a new public dataset which supports the aforementioned problem... |
1511.00661 | Stephen Chestnut | Vladimir Braverman, Stephen R. Chestnut, Nikita Ivkin, David P.
Woodruff | Beating CountSketch for Heavy Hitters in Insertion Streams | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Given a stream $p_1, \ldots, p_m$ of items from a universe $\mathcal{U}$,
which, without loss of generality we identify with the set of integers $\{1, 2,
\ldots, n\}$, we consider the problem of returning all $\ell_2$-heavy hitters,
i.e., those items $j$ for which $f_j \geq \epsilon \sqrt{F_2}$, where $f_j$ is
the nu... | [
{
"created": "Mon, 2 Nov 2015 20:03:39 GMT",
"version": "v1"
}
] | 2015-11-03 | [
[
"Braverman",
"Vladimir",
""
],
[
"Chestnut",
"Stephen R.",
""
],
[
"Ivkin",
"Nikita",
""
],
[
"Woodruff",
"David P.",
""
]
] | Given a stream $p_1, \ldots, p_m$ of items from a universe $\mathcal{U}$, which, without loss of generality we identify with the set of integers $\{1, 2, \ldots, n\}$, we consider the problem of returning all $\ell_2$-heavy hitters, i.e., those items $j$ for which $f_j \geq \epsilon \sqrt{F_2}$, where $f_j$ is the numb... |
1904.00205 | Taimoor Tariq Mr. | Taimoor Tariq, Juan Luis Gonzalez, Munchurl Kim | A HVS-inspired Attention to Improve Loss Metrics for CNN-based
Perception-Oriented Super-Resolution | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep Convolutional Neural Network (CNN) features have been demonstrated to be
effective perceptual quality features. The perceptual loss, based on feature
maps of pre-trained CNN's has proven to be remarkably effective for CNN based
perceptual image restoration problems. In this work, taking inspiration from
the the ... | [
{
"created": "Sat, 30 Mar 2019 12:14:50 GMT",
"version": "v1"
},
{
"created": "Sat, 27 Jul 2019 15:19:46 GMT",
"version": "v2"
}
] | 2019-07-30 | [
[
"Tariq",
"Taimoor",
""
],
[
"Gonzalez",
"Juan Luis",
""
],
[
"Kim",
"Munchurl",
""
]
] | Deep Convolutional Neural Network (CNN) features have been demonstrated to be effective perceptual quality features. The perceptual loss, based on feature maps of pre-trained CNN's has proven to be remarkably effective for CNN based perceptual image restoration problems. In this work, taking inspiration from the the Hu... |
1109.4433 | Johanne Cohen | Olivier Bournez, J\'er\'emie Chalopin, Johanne Cohen, Xavier Koegler,
Mikael Rabie | Asymetric Pavlovian Populations | null | null | null | null | cs.DC cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Population protocols have been introduced by Angluin et al. as a model of
networks consisting of very limited mobile agents that interact in pairs but
with no control over their own movement. A collection of anonymous agents,
modeled by finite automata, interact pairwise according to some rules that
update their stat... | [
{
"created": "Tue, 20 Sep 2011 21:17:02 GMT",
"version": "v1"
}
] | 2011-09-22 | [
[
"Bournez",
"Olivier",
""
],
[
"Chalopin",
"Jérémie",
""
],
[
"Cohen",
"Johanne",
""
],
[
"Koegler",
"Xavier",
""
],
[
"Rabie",
"Mikael",
""
]
] | Population protocols have been introduced by Angluin et al. as a model of networks consisting of very limited mobile agents that interact in pairs but with no control over their own movement. A collection of anonymous agents, modeled by finite automata, interact pairwise according to some rules that update their states... |
2004.01045 | Dongfang Zhao | Dongfang Zhao | Topological Properties of Multi-Party Blockchain Transactions | null | null | null | null | cs.CR cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The cross-blockchain transaction remains one of the most challenging problems
in blockchains. The root cause of the challenge lies in the nondeterministic
nature of blockchains: A $n$-party transaction across multiple blockchains
might be partially rolled back due to the potential forks in any of the
participating bl... | [
{
"created": "Wed, 1 Apr 2020 03:56:42 GMT",
"version": "v1"
},
{
"created": "Fri, 3 Apr 2020 19:07:06 GMT",
"version": "v2"
},
{
"created": "Thu, 16 Apr 2020 00:46:57 GMT",
"version": "v3"
}
] | 2020-04-17 | [
[
"Zhao",
"Dongfang",
""
]
] | The cross-blockchain transaction remains one of the most challenging problems in blockchains. The root cause of the challenge lies in the nondeterministic nature of blockchains: A $n$-party transaction across multiple blockchains might be partially rolled back due to the potential forks in any of the participating bloc... |
2207.10648 | Michael Desmond | Michael Desmond, Evelyn Duesterwald, Vatche Isahagian, Vinod Muthusamy | A No-Code Low-Code Paradigm for Authoring Business Automations Using
Natural Language | null | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | Most business process automation is still developed using traditional
automation technologies such as workflow engines. These systems provide domain
specific languages that require both business knowledge and programming skills
to effectively use. As such, business users often lack adequate programming
skills to full... | [
{
"created": "Fri, 15 Jul 2022 19:17:55 GMT",
"version": "v1"
}
] | 2022-07-22 | [
[
"Desmond",
"Michael",
""
],
[
"Duesterwald",
"Evelyn",
""
],
[
"Isahagian",
"Vatche",
""
],
[
"Muthusamy",
"Vinod",
""
]
] | Most business process automation is still developed using traditional automation technologies such as workflow engines. These systems provide domain specific languages that require both business knowledge and programming skills to effectively use. As such, business users often lack adequate programming skills to fully ... |
2112.00209 | Yuki Okamoto | Yuki Okamoto, Shota Horiguchi, Masaaki Yamamoto, Keisuke Imoto, Yohei
Kawaguchi | Environmental Sound Extraction Using Onomatopoeic Words | Accepted to ICASSP2022 | null | null | null | cs.SD cs.LG eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | An onomatopoeic word, which is a character sequence that phonetically
imitates a sound, is effective in expressing characteristics of sound such as
duration, pitch, and timbre. We propose an environmental-sound-extraction
method using onomatopoeic words to specify the target sound to be extracted. By
this method, we ... | [
{
"created": "Wed, 1 Dec 2021 01:18:06 GMT",
"version": "v1"
},
{
"created": "Thu, 2 Dec 2021 03:55:40 GMT",
"version": "v2"
},
{
"created": "Fri, 4 Feb 2022 10:27:02 GMT",
"version": "v3"
},
{
"created": "Thu, 17 Feb 2022 04:41:59 GMT",
"version": "v4"
}
] | 2022-02-18 | [
[
"Okamoto",
"Yuki",
""
],
[
"Horiguchi",
"Shota",
""
],
[
"Yamamoto",
"Masaaki",
""
],
[
"Imoto",
"Keisuke",
""
],
[
"Kawaguchi",
"Yohei",
""
]
] | An onomatopoeic word, which is a character sequence that phonetically imitates a sound, is effective in expressing characteristics of sound such as duration, pitch, and timbre. We propose an environmental-sound-extraction method using onomatopoeic words to specify the target sound to be extracted. By this method, we es... |
1908.07860 | Zhao Zhang | Zhao Zhang, Lei Wang, Sheng Li, Yang Wang, Zheng Zhang, Zhengjun Zha
and Meng Wang | Adaptive Structure-constrained Robust Latent Low-Rank Coding for Image
Recovery | Accepted by ICDM 2019 as a regular paper | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a robust representation learning model called
Adaptive Structure-constrained Low-Rank Coding (AS-LRC) for the latent
representation of data. To recover the underlying subspaces more accurately,
AS-LRC seamlessly integrates an adaptive weighting based block-diagonal
structure-constrained low-... | [
{
"created": "Wed, 21 Aug 2019 13:17:55 GMT",
"version": "v1"
},
{
"created": "Thu, 22 Aug 2019 02:28:14 GMT",
"version": "v2"
}
] | 2019-08-23 | [
[
"Zhang",
"Zhao",
""
],
[
"Wang",
"Lei",
""
],
[
"Li",
"Sheng",
""
],
[
"Wang",
"Yang",
""
],
[
"Zhang",
"Zheng",
""
],
[
"Zha",
"Zhengjun",
""
],
[
"Wang",
"Meng",
""
]
] | In this paper, we propose a robust representation learning model called Adaptive Structure-constrained Low-Rank Coding (AS-LRC) for the latent representation of data. To recover the underlying subspaces more accurately, AS-LRC seamlessly integrates an adaptive weighting based block-diagonal structure-constrained low-ra... |
2310.01405 | Andy Zou | Andy Zou, Long Phan, Sarah Chen, James Campbell, Phillip Guo, Richard
Ren, Alexander Pan, Xuwang Yin, Mantas Mazeika, Ann-Kathrin Dombrowski,
Shashwat Goel, Nathaniel Li, Michael J. Byun, Zifan Wang, Alex Mallen, Steven
Basart, Sanmi Koyejo, Dawn Song, Matt Fredrikson, J. Zico Kolter, Dan
Hendrycks | Representation Engineering: A Top-Down Approach to AI Transparency | Code is available at
https://github.com/andyzoujm/representation-engineering | null | null | null | cs.LG cs.AI cs.CL cs.CV cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we identify and characterize the emerging area of
representation engineering (RepE), an approach to enhancing the transparency of
AI systems that draws on insights from cognitive neuroscience. RepE places
population-level representations, rather than neurons or circuits, at the
center of analysis, equi... | [
{
"created": "Mon, 2 Oct 2023 17:59:07 GMT",
"version": "v1"
},
{
"created": "Tue, 3 Oct 2023 08:39:09 GMT",
"version": "v2"
},
{
"created": "Tue, 10 Oct 2023 08:00:53 GMT",
"version": "v3"
}
] | 2023-10-11 | [
[
"Zou",
"Andy",
""
],
[
"Phan",
"Long",
""
],
[
"Chen",
"Sarah",
""
],
[
"Campbell",
"James",
""
],
[
"Guo",
"Phillip",
""
],
[
"Ren",
"Richard",
""
],
[
"Pan",
"Alexander",
""
],
[
"Yin",
"Xuwan... | In this paper, we identify and characterize the emerging area of representation engineering (RepE), an approach to enhancing the transparency of AI systems that draws on insights from cognitive neuroscience. RepE places population-level representations, rather than neurons or circuits, at the center of analysis, equipp... |
2302.11732 | Mingke Yang | Mingke Yang and Yuming Zhou and Bixin Li and Yutian Tang | On Code Reuse from StackOverflow: An Exploratory Study on Jupyter
Notebook | null | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Jupyter Notebook is a popular tool among data analysts and scientists for
working with data. It provides a way to combine code, documentation, and
visualizations in a single, interactive environment, facilitating code reuse.
While code reuse can improve programming efficiency, it can also decrease
readability, securi... | [
{
"created": "Thu, 23 Feb 2023 01:47:53 GMT",
"version": "v1"
}
] | 2023-02-24 | [
[
"Yang",
"Mingke",
""
],
[
"Zhou",
"Yuming",
""
],
[
"Li",
"Bixin",
""
],
[
"Tang",
"Yutian",
""
]
] | Jupyter Notebook is a popular tool among data analysts and scientists for working with data. It provides a way to combine code, documentation, and visualizations in a single, interactive environment, facilitating code reuse. While code reuse can improve programming efficiency, it can also decrease readability, security... |
2312.04344 | Pengcheng Chen | Pengcheng Chen, Ziyan Huang, Zhongying Deng, Tianbin Li, Yanzhou Su,
Haoyu Wang, Jin Ye, Yu Qiao, Junjun He | Enhancing Medical Task Performance in GPT-4V: A Comprehensive Study on
Prompt Engineering Strategies | null | null | null | null | cs.CL cs.AI cs.CV cs.LG | http://creativecommons.org/licenses/by/4.0/ | OpenAI's latest large vision-language model (LVLM), GPT-4V(ision), has piqued
considerable interest for its potential in medical applications. Despite its
promise, recent studies and internal reviews highlight its underperformance in
specialized medical tasks. This paper explores the boundary of GPT-4V's
capabilities... | [
{
"created": "Thu, 7 Dec 2023 15:05:59 GMT",
"version": "v1"
},
{
"created": "Tue, 12 Dec 2023 06:37:53 GMT",
"version": "v2"
}
] | 2023-12-13 | [
[
"Chen",
"Pengcheng",
""
],
[
"Huang",
"Ziyan",
""
],
[
"Deng",
"Zhongying",
""
],
[
"Li",
"Tianbin",
""
],
[
"Su",
"Yanzhou",
""
],
[
"Wang",
"Haoyu",
""
],
[
"Ye",
"Jin",
""
],
[
"Qiao",
"Yu",
... | OpenAI's latest large vision-language model (LVLM), GPT-4V(ision), has piqued considerable interest for its potential in medical applications. Despite its promise, recent studies and internal reviews highlight its underperformance in specialized medical tasks. This paper explores the boundary of GPT-4V's capabilities i... |
2101.10729 | Hyoungsung Kim | Hyoungsung Kim, Jehyuk Jang, Sangjun Park, Heung-no Lee | Ethereum ECCPoW | It is under the review of IEEE Access | IEEE Access, vol. 9, pp. 135942-135952, 2021 | 10.1109/ACCESS.2021.3113522 | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The error-correction code based proof-of-work (ECCPoW) algorithm is based on
a low-density parity-check (LDPC) code. The ECCPoW is possible to impair ASIC
with its time-varying capability of the parameters of LDPC code. Previous
researches on the ECCPoW algorithm have presented its theory and implementation
on Bitcoi... | [
{
"created": "Tue, 26 Jan 2021 11:50:06 GMT",
"version": "v1"
}
] | 2022-08-10 | [
[
"Kim",
"Hyoungsung",
""
],
[
"Jang",
"Jehyuk",
""
],
[
"Park",
"Sangjun",
""
],
[
"Lee",
"Heung-no",
""
]
] | The error-correction code based proof-of-work (ECCPoW) algorithm is based on a low-density parity-check (LDPC) code. The ECCPoW is possible to impair ASIC with its time-varying capability of the parameters of LDPC code. Previous researches on the ECCPoW algorithm have presented its theory and implementation on Bitcoin.... |
cs/0304040 | Russell Impagliazzo | Russell Impagliazzo | Hardness as randomness: a survey of universal derandomization | null | Proceedings of the ICM, Beijing 2002, vol. 3, 659--672 | null | null | cs.CC | null | We survey recent developments in the study of probabilistic complexity
classes. While the evidence seems to support the conjecture that probabilism
can be deterministically simulated with relatively low overhead, i.e., that
$P=BPP$, it also indicates that this may be a difficult question to resolve. In
fact, proving ... | [
{
"created": "Mon, 28 Apr 2003 22:50:34 GMT",
"version": "v1"
}
] | 2008-12-15 | [
[
"Impagliazzo",
"Russell",
""
]
] | We survey recent developments in the study of probabilistic complexity classes. While the evidence seems to support the conjecture that probabilism can be deterministically simulated with relatively low overhead, i.e., that $P=BPP$, it also indicates that this may be a difficult question to resolve. In fact, proving th... |
1811.05669 | Luc Le Magoarou | Antoine Le Calvez (IRT b-com), Luc Le Magoarou (IRT b-com), St\'ephane
Paquelet (IRT b-com) | Massive MIMO channel estimation taking into account spherical waves | null | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Together with millimiter waves (mmWaves), massive multiple-input
multiple-output (MIMO) systems are key technological components of fifth
generation (5G) wireless communication systems. In such a context, geometric
considerations show that the largely adopted plane wave model (PWM) of the
channel potentially loses it... | [
{
"created": "Wed, 14 Nov 2018 07:33:17 GMT",
"version": "v1"
}
] | 2018-11-15 | [
[
"Calvez",
"Antoine Le",
"",
"IRT b-com"
],
[
"Magoarou",
"Luc Le",
"",
"IRT b-com"
],
[
"Paquelet",
"Stéphane",
"",
"IRT b-com"
]
] | Together with millimiter waves (mmWaves), massive multiple-input multiple-output (MIMO) systems are key technological components of fifth generation (5G) wireless communication systems. In such a context, geometric considerations show that the largely adopted plane wave model (PWM) of the channel potentially loses its ... |
cs/0202032 | Daniel Lehmann | Rica Gonen and Daniel Lehmann | Optimal Solutions for Multi-Unit Combinatorial Auctions: Branch and
Bound Heuristics | Presented at EC'00 | Second ACM Conference on Electronic Commerce (EC'00) Minneapolis,
Minnesota, October 2000, pp. 13-20 | null | null | cs.GT cs.AI | null | Finding optimal solutions for multi-unit combinatorial auctions is a hard
problem and finding approximations to the optimal solution is also hard. We
investigate the use of Branch-and-Bound techniques: they require both a way to
bound from above the value of the best allocation and a good criterion to
decide which bi... | [
{
"created": "Wed, 20 Feb 2002 14:38:39 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Gonen",
"Rica",
""
],
[
"Lehmann",
"Daniel",
""
]
] | Finding optimal solutions for multi-unit combinatorial auctions is a hard problem and finding approximations to the optimal solution is also hard. We investigate the use of Branch-and-Bound techniques: they require both a way to bound from above the value of the best allocation and a good criterion to decide which bids... |
1905.11544 | Naveed Akhtar Dr. | Naveed Akhtar, Mohammad A. A. K. Jalwana, Mohammed Bennamoun, Ajmal
Mian | Label Universal Targeted Attack | null | null | null | null | cs.CR cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce Label Universal Targeted Attack (LUTA) that makes a deep model
predict a label of attacker's choice for `any' sample of a given source class
with high probability. Our attack stochastically maximizes the log-probability
of the target label for the source class with first order gradient
optimization, whil... | [
{
"created": "Mon, 27 May 2019 23:53:00 GMT",
"version": "v1"
},
{
"created": "Sat, 1 Jun 2019 05:11:50 GMT",
"version": "v2"
}
] | 2019-06-04 | [
[
"Akhtar",
"Naveed",
""
],
[
"Jalwana",
"Mohammad A. A. K.",
""
],
[
"Bennamoun",
"Mohammed",
""
],
[
"Mian",
"Ajmal",
""
]
] | We introduce Label Universal Targeted Attack (LUTA) that makes a deep model predict a label of attacker's choice for `any' sample of a given source class with high probability. Our attack stochastically maximizes the log-probability of the target label for the source class with first order gradient optimization, while ... |
2401.04594 | Noam Zilberstein | Noam Zilberstein | A Relatively Complete Program Logic for Effectful Branching | null | null | null | null | cs.LO cs.PL | http://creativecommons.org/licenses/by/4.0/ | Starting with Hoare Logic over 50 years ago, numerous sound and relatively
complete program logics have been devised to reason about the diverse programs
encountered in the real world. This includes reasoning about computational
effects, particularly those effects that cause the program execution to branch
into multi... | [
{
"created": "Tue, 9 Jan 2024 14:55:54 GMT",
"version": "v1"
}
] | 2024-01-10 | [
[
"Zilberstein",
"Noam",
""
]
] | Starting with Hoare Logic over 50 years ago, numerous sound and relatively complete program logics have been devised to reason about the diverse programs encountered in the real world. This includes reasoning about computational effects, particularly those effects that cause the program execution to branch into multipl... |
1606.06854 | Xingyi Zhou | Xingyi Zhou, Qingfu Wan, Wei Zhang, Xiangyang Xue, Yichen Wei | Model-based Deep Hand Pose Estimation | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Previous learning based hand pose estimation methods does not fully exploit
the prior information in hand model geometry. Instead, they usually rely a
separate model fitting step to generate valid hand poses. Such a post
processing is inconvenient and sub-optimal. In this work, we propose a model
based deep learning ... | [
{
"created": "Wed, 22 Jun 2016 08:47:06 GMT",
"version": "v1"
}
] | 2016-06-23 | [
[
"Zhou",
"Xingyi",
""
],
[
"Wan",
"Qingfu",
""
],
[
"Zhang",
"Wei",
""
],
[
"Xue",
"Xiangyang",
""
],
[
"Wei",
"Yichen",
""
]
] | Previous learning based hand pose estimation methods does not fully exploit the prior information in hand model geometry. Instead, they usually rely a separate model fitting step to generate valid hand poses. Such a post processing is inconvenient and sub-optimal. In this work, we propose a model based deep learning ap... |
2210.09900 | Housheng Xie | Housheng Xie, Junhui Qiu, Yuan Dai, Yang Yang, Changcheng Xiang,
Yukuan Zhang | SA-DNet: A on-demand semantic object registration network adapting to
non-rigid deformation | 15 pages, 12 figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As an essential processing step before the fusing of infrared and visible
images, the performance of image registration determines whether the two images
can be fused at correct spatial position. In the actual scenario, the varied
imaging devices may lead to a change in perspective or time gap between shots,
making s... | [
{
"created": "Tue, 18 Oct 2022 14:41:28 GMT",
"version": "v1"
},
{
"created": "Wed, 26 Oct 2022 02:13:42 GMT",
"version": "v2"
}
] | 2022-10-27 | [
[
"Xie",
"Housheng",
""
],
[
"Qiu",
"Junhui",
""
],
[
"Dai",
"Yuan",
""
],
[
"Yang",
"Yang",
""
],
[
"Xiang",
"Changcheng",
""
],
[
"Zhang",
"Yukuan",
""
]
] | As an essential processing step before the fusing of infrared and visible images, the performance of image registration determines whether the two images can be fused at correct spatial position. In the actual scenario, the varied imaging devices may lead to a change in perspective or time gap between shots, making sig... |
2404.19117 | Sergi Liesegang | Sergi Liesegang and Stefano Buzzi | Coexistence of eMBB+ and mMTC+ in Uplink Cell-Free Massive MIMO Networks | This work has been submitted to IEEE for possible publication.
Copyright may be transferred without notice, after which this version may no
longer be accessible | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper tackles the problem of designing proper uplink multiple access
(MA) schemes for coexistence between enhanced mobile broadband+ (eMBB+) users
and massive machine-type communications+ (mMTC+) devices in a terminal-centric
cell-free massive MIMO system. Specifically, the use of a time-frequency
spreading tech... | [
{
"created": "Mon, 29 Apr 2024 21:32:30 GMT",
"version": "v1"
}
] | 2024-05-01 | [
[
"Liesegang",
"Sergi",
""
],
[
"Buzzi",
"Stefano",
""
]
] | This paper tackles the problem of designing proper uplink multiple access (MA) schemes for coexistence between enhanced mobile broadband+ (eMBB+) users and massive machine-type communications+ (mMTC+) devices in a terminal-centric cell-free massive MIMO system. Specifically, the use of a time-frequency spreading techni... |
2205.00861 | Vipin Singh Sehrawat | Vipin Singh Sehrawat, Foo Yee Yeo, Dmitriy Vassilyev | Star-specific Key-homomorphic PRFs from Learning with Linear Regression | This is the preprint of a paper published in IEEE Access, vol. 11,
pp. 73235-73267, 2023 | IEEE Access, vol. 11, pp. 73235-73267, 2023 | 10.1109/ACCESS.2023.3294844 | null | cs.CR cs.IT math.CO math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce a novel method to derandomize the learning with errors (LWE)
problem by generating deterministic yet sufficiently independent LWE instances
that are constructed by using linear regression models, which are generated via
(wireless) communication errors. We also introduce star-specific
key-homomorphic (SSK... | [
{
"created": "Mon, 2 May 2022 12:44:26 GMT",
"version": "v1"
},
{
"created": "Fri, 3 Mar 2023 01:21:15 GMT",
"version": "v2"
},
{
"created": "Fri, 28 Jul 2023 17:22:54 GMT",
"version": "v3"
}
] | 2023-07-31 | [
[
"Sehrawat",
"Vipin Singh",
""
],
[
"Yeo",
"Foo Yee",
""
],
[
"Vassilyev",
"Dmitriy",
""
]
] | We introduce a novel method to derandomize the learning with errors (LWE) problem by generating deterministic yet sufficiently independent LWE instances that are constructed by using linear regression models, which are generated via (wireless) communication errors. We also introduce star-specific key-homomorphic (SSKH)... |
2307.11550 | Arul Selvam Periyasamy | Arul Selvam Periyasamy, Arash Amini, Vladimir Tsaturyan, and Sven
Behnke | YOLOPose V2: Understanding and Improving Transformer-based 6D Pose
Estimation | Robotics and Autonomous Systems Journal, Elsevier, to appear 2023.
arXiv admin note: substantial text overlap with arXiv:2205.02536 | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | 6D object pose estimation is a crucial prerequisite for autonomous robot
manipulation applications. The state-of-the-art models for pose estimation are
convolutional neural network (CNN)-based. Lately, Transformers, an architecture
originally proposed for natural language processing, is achieving
state-of-the-art res... | [
{
"created": "Fri, 21 Jul 2023 12:53:54 GMT",
"version": "v1"
}
] | 2023-07-24 | [
[
"Periyasamy",
"Arul Selvam",
""
],
[
"Amini",
"Arash",
""
],
[
"Tsaturyan",
"Vladimir",
""
],
[
"Behnke",
"Sven",
""
]
] | 6D object pose estimation is a crucial prerequisite for autonomous robot manipulation applications. The state-of-the-art models for pose estimation are convolutional neural network (CNN)-based. Lately, Transformers, an architecture originally proposed for natural language processing, is achieving state-of-the-art resul... |
2403.09495 | Kevin Kraschewski | Kevin Kraschewski, Gregory P. Phlipot, Dennis M. Kochmann | A mixed-order quasicontinuum approach for beam-based architected
materials with application to fracture | null | null | null | null | cs.CE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Predicting the mechanics of large structural networks, such as beam-based
architected materials, requires a multiscale computational strategy that
preserves information about the discrete structure while being applicable to
large assemblies of struts. Especially the fracture properties of such beam
lattices necessita... | [
{
"created": "Thu, 14 Mar 2024 15:35:30 GMT",
"version": "v1"
}
] | 2024-03-15 | [
[
"Kraschewski",
"Kevin",
""
],
[
"Phlipot",
"Gregory P.",
""
],
[
"Kochmann",
"Dennis M.",
""
]
] | Predicting the mechanics of large structural networks, such as beam-based architected materials, requires a multiscale computational strategy that preserves information about the discrete structure while being applicable to large assemblies of struts. Especially the fracture properties of such beam lattices necessitate... |
2202.05965 | Haonan Wang | Haonan Wang, Ang Li, Ya-Feng Liu, Qibo Qin, Lingyang Song, and Yonghui
Li | Achievable Rate Maximization Pattern Design for Reconfigurable MIMO
Antenna Array | This work has been accepted by IEEE Transactions on Wireless
Communications | IEEE Transactions on Wireless Communications, 2023, (Early Access) | 10.1109/TWC.2023.3238069 | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Reconfigurable multiple-input multiple-output can provide performance gains
over traditional MIMO by reshaping the channels, i.e., introducing more channel
realizations. In this paper, we focus on the achievable rate maximization
pattern design for reconfigurable MIMO systems. Firstly, we introduce the
matrix represe... | [
{
"created": "Sat, 12 Feb 2022 03:27:56 GMT",
"version": "v1"
},
{
"created": "Mon, 13 Feb 2023 11:27:58 GMT",
"version": "v2"
}
] | 2023-02-14 | [
[
"Wang",
"Haonan",
""
],
[
"Li",
"Ang",
""
],
[
"Liu",
"Ya-Feng",
""
],
[
"Qin",
"Qibo",
""
],
[
"Song",
"Lingyang",
""
],
[
"Li",
"Yonghui",
""
]
] | Reconfigurable multiple-input multiple-output can provide performance gains over traditional MIMO by reshaping the channels, i.e., introducing more channel realizations. In this paper, we focus on the achievable rate maximization pattern design for reconfigurable MIMO systems. Firstly, we introduce the matrix represent... |
2202.02429 | Chelsea Sidrane | Chelsea Sidrane, Sydney Katz, Anthony Corso, Mykel J. Kochenderfer | Verifying Inverse Model Neural Networks | Reformatted and fixed typos | null | null | null | cs.LG cs.LO | http://creativecommons.org/licenses/by-sa/4.0/ | Inverse problems exist in a wide variety of physical domains from aerospace
engineering to medical imaging. The goal is to infer the underlying state from
a set of observations. When the forward model that produced the observations is
nonlinear and stochastic, solving the inverse problem is very challenging.
Neural n... | [
{
"created": "Fri, 4 Feb 2022 23:13:22 GMT",
"version": "v1"
},
{
"created": "Thu, 5 Jan 2023 00:53:35 GMT",
"version": "v2"
}
] | 2023-01-06 | [
[
"Sidrane",
"Chelsea",
""
],
[
"Katz",
"Sydney",
""
],
[
"Corso",
"Anthony",
""
],
[
"Kochenderfer",
"Mykel J.",
""
]
] | Inverse problems exist in a wide variety of physical domains from aerospace engineering to medical imaging. The goal is to infer the underlying state from a set of observations. When the forward model that produced the observations is nonlinear and stochastic, solving the inverse problem is very challenging. Neural net... |
1307.6923 | Rajib Rana | Rajib Rana, Mingrui Yang, Tim Wark, Chun Tung Chou, Wen Hu | A Deterministic Construction of Projection matrix for Adaptive
Trajectory Compression | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Compressive Sensing, which offers exact reconstruction of sparse signal from
a small number of measurements, has tremendous potential for trajectory
compression. In order to optimize the compression, trajectory compression
algorithms need to adapt compression ratio subject to the compressibility of
the trajectory. In... | [
{
"created": "Fri, 26 Jul 2013 04:59:26 GMT",
"version": "v1"
}
] | 2013-07-29 | [
[
"Rana",
"Rajib",
""
],
[
"Yang",
"Mingrui",
""
],
[
"Wark",
"Tim",
""
],
[
"Chou",
"Chun Tung",
""
],
[
"Hu",
"Wen",
""
]
] | Compressive Sensing, which offers exact reconstruction of sparse signal from a small number of measurements, has tremendous potential for trajectory compression. In order to optimize the compression, trajectory compression algorithms need to adapt compression ratio subject to the compressibility of the trajectory. Intu... |
2008.06805 | Michael Wehar | Andr\'as Z. Salamon and Michael Wehar | Superlinear Lower Bounds Based on ETH | Accepted at STACS 2022 | null | 10.4230/LIPIcs.STACS.2022.55 | null | cs.CC cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce techniques for proving superlinear conditional lower bounds for
polynomial time problems. In particular, we show that CircuitSAT for circuits
with m gates and log(m) inputs (denoted by log-CircuitSAT) is not decidable in
essentially-linear time unless the exponential time hypothesis (ETH) is false
and k-... | [
{
"created": "Sat, 15 Aug 2020 23:00:23 GMT",
"version": "v1"
},
{
"created": "Sun, 8 Nov 2020 23:25:24 GMT",
"version": "v2"
},
{
"created": "Tue, 10 Nov 2020 04:56:02 GMT",
"version": "v3"
},
{
"created": "Mon, 1 Mar 2021 01:11:24 GMT",
"version": "v4"
},
{
"cre... | 2022-05-18 | [
[
"Salamon",
"András Z.",
""
],
[
"Wehar",
"Michael",
""
]
] | We introduce techniques for proving superlinear conditional lower bounds for polynomial time problems. In particular, we show that CircuitSAT for circuits with m gates and log(m) inputs (denoted by log-CircuitSAT) is not decidable in essentially-linear time unless the exponential time hypothesis (ETH) is false and k-Cl... |
1712.05726 | Gourab Ghatak | Gourab Ghatak, Antonio De Domenico, and Marceau Coupechoux | Coverage Analysis and Load Balancing in HetNets with mmWave Multi-RAT
Small Cells | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We characterize a two tier heterogeneous network, consisting of classical
sub-6GHz macro cells, and multi Radio Access Technology (RAT) small cells able
to operate in sub-6GHz and millimeter-wave (mm-wave) bands. For optimizing
coverage and to balance loads, we propose a two-step mechanism based on two
biases for tun... | [
{
"created": "Fri, 15 Dec 2017 16:15:01 GMT",
"version": "v1"
}
] | 2017-12-18 | [
[
"Ghatak",
"Gourab",
""
],
[
"De Domenico",
"Antonio",
""
],
[
"Coupechoux",
"Marceau",
""
]
] | We characterize a two tier heterogeneous network, consisting of classical sub-6GHz macro cells, and multi Radio Access Technology (RAT) small cells able to operate in sub-6GHz and millimeter-wave (mm-wave) bands. For optimizing coverage and to balance loads, we propose a two-step mechanism based on two biases for tunin... |
1703.05305 | Ilya Dumer | Ilya Dumer and Kirill Shabunov | Soft decision decoding of Reed-Muller codes: recursive lists | null | IEEE Trans. Info. Theory, vol. 52, no. 3, pp. 1260-1266, 2006 | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recursive list decoding is considered for Reed-Muller (RM) codes. The
algorithm repeatedly relegates itself to the shorter RM codes by recalculating
the posterior probabilities of their symbols. Intermediate decodings are only
performed when these recalculations reach the trivial RM codes. In turn, the
updated lists ... | [
{
"created": "Tue, 14 Mar 2017 23:08:24 GMT",
"version": "v1"
}
] | 2017-03-17 | [
[
"Dumer",
"Ilya",
""
],
[
"Shabunov",
"Kirill",
""
]
] | Recursive list decoding is considered for Reed-Muller (RM) codes. The algorithm repeatedly relegates itself to the shorter RM codes by recalculating the posterior probabilities of their symbols. Intermediate decodings are only performed when these recalculations reach the trivial RM codes. In turn, the updated lists of... |
1505.02428 | Daniel Kulesz | Daniel Kulesz, Fabian Toth, Fabian Beck | Live Inspection of Spreadsheets | In Proceedings of the 2nd Workshop on Software Engineering Methods in
Spreadsheets (http://spreadsheetlab.org/sems15/) | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Existing approaches for detecting anomalies in spreadsheets can help to
discover faults, but they are often applied too late in the spreadsheet
lifecycle. By contrast, our approach detects anomalies immediately whenever
users change their spreadsheets. This live inspection approach has been
implemented as part of the... | [
{
"created": "Sun, 10 May 2015 19:56:14 GMT",
"version": "v1"
}
] | 2015-05-12 | [
[
"Kulesz",
"Daniel",
""
],
[
"Toth",
"Fabian",
""
],
[
"Beck",
"Fabian",
""
]
] | Existing approaches for detecting anomalies in spreadsheets can help to discover faults, but they are often applied too late in the spreadsheet lifecycle. By contrast, our approach detects anomalies immediately whenever users change their spreadsheets. This live inspection approach has been implemented as part of the S... |
2212.08729 | Jonathan Francis | Jonathan Francis, Bingqing Chen, Weiran Yao, Eric Nyberg, Jean Oh | Distribution-aware Goal Prediction and Conformant Model-based Planning
for Safe Autonomous Driving | Accepted: 1st Workshop on Safe Learning for Autonomous Driving, at
the International Conference on Machine Learning (ICML 2022); Best Paper
Award | null | null | null | cs.RO cs.AI cs.CV cs.LG cs.SY eess.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The feasibility of collecting a large amount of expert demonstrations has
inspired growing research interests in learning-to-drive settings, where models
learn by imitating the driving behaviour from experts. However, exclusively
relying on imitation can limit agents' generalisability to novel scenarios that
are outs... | [
{
"created": "Fri, 16 Dec 2022 21:51:51 GMT",
"version": "v1"
}
] | 2022-12-20 | [
[
"Francis",
"Jonathan",
""
],
[
"Chen",
"Bingqing",
""
],
[
"Yao",
"Weiran",
""
],
[
"Nyberg",
"Eric",
""
],
[
"Oh",
"Jean",
""
]
] | The feasibility of collecting a large amount of expert demonstrations has inspired growing research interests in learning-to-drive settings, where models learn by imitating the driving behaviour from experts. However, exclusively relying on imitation can limit agents' generalisability to novel scenarios that are outsid... |
2112.01713 | Yuhong Guo | Xuejun Han, Yuhong Guo | Contrastive Continual Learning with Feature Propagation | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Classical machine learners are designed only to tackle one task without
capability of adopting new emerging tasks or classes whereas such capacity is
more practical and human-like in the real world. To address this shortcoming,
continual machine learners are elaborated to commendably learn a stream of
tasks with doma... | [
{
"created": "Fri, 3 Dec 2021 04:55:28 GMT",
"version": "v1"
}
] | 2021-12-06 | [
[
"Han",
"Xuejun",
""
],
[
"Guo",
"Yuhong",
""
]
] | Classical machine learners are designed only to tackle one task without capability of adopting new emerging tasks or classes whereas such capacity is more practical and human-like in the real world. To address this shortcoming, continual machine learners are elaborated to commendably learn a stream of tasks with domain... |
1810.05617 | Philipp Allgeuer | Philipp Allgeuer and Sven Behnke | Bipedal Walking with Corrective Actions in the Tilt Phase Space | International Conference on Humanoid Robots (Humanoids), Beijing,
China, 2018 | International Conference on Humanoid Robots (Humanoids), Beijing,
China, 2018 | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many methods exist for a bipedal robot to keep its balance while walking. In
addition to step size and timing, other strategies are possible that influence
the stability of the robot without interfering with the target direction and
speed of locomotion. This paper introduces a multifaceted feedback controller
that us... | [
{
"created": "Fri, 12 Oct 2018 17:18:57 GMT",
"version": "v1"
}
] | 2018-10-15 | [
[
"Allgeuer",
"Philipp",
""
],
[
"Behnke",
"Sven",
""
]
] | Many methods exist for a bipedal robot to keep its balance while walking. In addition to step size and timing, other strategies are possible that influence the stability of the robot without interfering with the target direction and speed of locomotion. This paper introduces a multifaceted feedback controller that uses... |
1609.09656 | Yilong Yang | Yilong Yang | Automated Enterprise Applications Generation from Requirements Model | update version from 2016 | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Enterprise applications can be automatically generated from a sophisticated
OO design model based on model-driven approach. The design model contains
information about how to decompose the system into components, how to
encapsulate the system operations into classes, and how the objects of classes
collaborate to fulf... | [
{
"created": "Fri, 30 Sep 2016 09:53:22 GMT",
"version": "v1"
},
{
"created": "Sun, 16 Jan 2022 10:58:27 GMT",
"version": "v2"
},
{
"created": "Tue, 22 Mar 2022 17:28:44 GMT",
"version": "v3"
}
] | 2022-03-23 | [
[
"Yang",
"Yilong",
""
]
] | Enterprise applications can be automatically generated from a sophisticated OO design model based on model-driven approach. The design model contains information about how to decompose the system into components, how to encapsulate the system operations into classes, and how the objects of classes collaborate to fulfil... |
1803.01599 | Jogendra Nath Kundu | Jogendra Nath Kundu, Phani Krishna Uppala, Anuj Pahuja, R. Venkatesh
Babu | AdaDepth: Unsupervised Content Congruent Adaptation for Depth Estimation | CVPR 2018 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Supervised deep learning methods have shown promising results for the task of
monocular depth estimation; but acquiring ground truth is costly, and prone to
noise as well as inaccuracies. While synthetic datasets have been used to
circumvent above problems, the resultant models do not generalize well to
natural scene... | [
{
"created": "Mon, 5 Mar 2018 10:55:58 GMT",
"version": "v1"
},
{
"created": "Thu, 7 Jun 2018 11:06:01 GMT",
"version": "v2"
}
] | 2018-06-08 | [
[
"Kundu",
"Jogendra Nath",
""
],
[
"Uppala",
"Phani Krishna",
""
],
[
"Pahuja",
"Anuj",
""
],
[
"Babu",
"R. Venkatesh",
""
]
] | Supervised deep learning methods have shown promising results for the task of monocular depth estimation; but acquiring ground truth is costly, and prone to noise as well as inaccuracies. While synthetic datasets have been used to circumvent above problems, the resultant models do not generalize well to natural scenes ... |
1711.06729 | Laura Gwilliams | Laura Gwilliams, David Poeppel, Alec Marantz and Tal Linzen | Phonological (un)certainty weights lexical activation | 6 pages, 4 figures, accepted at: Cognitive Modeling and Computational
Linguistics (CMCL) 2018 | null | null | null | cs.CL | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Spoken word recognition involves at least two basic computations. First is
matching acoustic input to phonological categories (e.g. /b/, /p/, /d/). Second
is activating words consistent with those phonological categories. Here we test
the hypothesis that the listener's probability distribution over lexical items
is w... | [
{
"created": "Fri, 17 Nov 2017 21:17:20 GMT",
"version": "v1"
}
] | 2017-11-21 | [
[
"Gwilliams",
"Laura",
""
],
[
"Poeppel",
"David",
""
],
[
"Marantz",
"Alec",
""
],
[
"Linzen",
"Tal",
""
]
] | Spoken word recognition involves at least two basic computations. First is matching acoustic input to phonological categories (e.g. /b/, /p/, /d/). Second is activating words consistent with those phonological categories. Here we test the hypothesis that the listener's probability distribution over lexical items is wei... |
1909.13221 | Chao Wei | Chao Wei, Weiru Zhang, Shengjie Sun, Fei Li, Xiaonan Meng, Yi Hu and
Hao Wang | Optimal Delivery with Budget Constraint in E-Commerce Advertising | 13 pages, 5 figures | null | null | null | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Online advertising in E-commerce platforms provides sellers an opportunity to
achieve potential audiences with different target goals. Ad serving systems
(like display and search advertising systems) that assign ads to pages should
satisfy objectives such as plenty of audience for branding advertisers, clicks
or conv... | [
{
"created": "Sun, 29 Sep 2019 07:11:10 GMT",
"version": "v1"
},
{
"created": "Tue, 8 Oct 2019 12:52:24 GMT",
"version": "v2"
}
] | 2019-10-09 | [
[
"Wei",
"Chao",
""
],
[
"Zhang",
"Weiru",
""
],
[
"Sun",
"Shengjie",
""
],
[
"Li",
"Fei",
""
],
[
"Meng",
"Xiaonan",
""
],
[
"Hu",
"Yi",
""
],
[
"Wang",
"Hao",
""
]
] | Online advertising in E-commerce platforms provides sellers an opportunity to achieve potential audiences with different target goals. Ad serving systems (like display and search advertising systems) that assign ads to pages should satisfy objectives such as plenty of audience for branding advertisers, clicks or conver... |
2403.06319 | Hamid Mozaffari | Hamid Mozaffari, Sunav Choudhary, and Amir Houmansadr | Fake or Compromised? Making Sense of Malicious Clients in Federated
Learning | null | null | null | null | cs.LG cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Federated learning (FL) is a distributed machine learning paradigm that
enables training models on decentralized data. The field of FL security against
poisoning attacks is plagued with confusion due to the proliferation of
research that makes different assumptions about the capabilities of adversaries
and the advers... | [
{
"created": "Sun, 10 Mar 2024 21:37:21 GMT",
"version": "v1"
}
] | 2024-03-12 | [
[
"Mozaffari",
"Hamid",
""
],
[
"Choudhary",
"Sunav",
""
],
[
"Houmansadr",
"Amir",
""
]
] | Federated learning (FL) is a distributed machine learning paradigm that enables training models on decentralized data. The field of FL security against poisoning attacks is plagued with confusion due to the proliferation of research that makes different assumptions about the capabilities of adversaries and the adversar... |
2008.03959 | Nadav Merlis | Nadav Merlis, Shie Mannor | Lenient Regret for Multi-Armed Bandits | Accepted to AAAI2021 | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the Multi-Armed Bandit (MAB) problem, where an agent sequentially
chooses actions and observes rewards for the actions it took. While the
majority of algorithms try to minimize the regret, i.e., the cumulative
difference between the reward of the best action and the agent's action, this
criterion might le... | [
{
"created": "Mon, 10 Aug 2020 08:30:52 GMT",
"version": "v1"
},
{
"created": "Sun, 13 Sep 2020 07:45:54 GMT",
"version": "v2"
},
{
"created": "Wed, 16 Dec 2020 13:15:49 GMT",
"version": "v3"
},
{
"created": "Sun, 12 Sep 2021 12:22:50 GMT",
"version": "v4"
}
] | 2021-09-14 | [
[
"Merlis",
"Nadav",
""
],
[
"Mannor",
"Shie",
""
]
] | We consider the Multi-Armed Bandit (MAB) problem, where an agent sequentially chooses actions and observes rewards for the actions it took. While the majority of algorithms try to minimize the regret, i.e., the cumulative difference between the reward of the best action and the agent's action, this criterion might lead... |
2202.07464 | Ruoxi Chen | Haibo Jin, Ruoxi Chen, Haibin Zheng, Jinyin Chen, Yao Cheng, Yue Yu,
Xianglong Liu | Excitement Surfeited Turns to Errors: Deep Learning Testing Framework
Based on Excitable Neurons | 32 pages | null | null | null | cs.LG cs.AI cs.CR cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Despite impressive capabilities and outstanding performance, deep neural
networks (DNNs) have captured increasing public concern about their security
problems, due to their frequently occurred erroneous behaviors. Therefore, it
is necessary to conduct a systematical testing for DNNs before they are
deployed to real-w... | [
{
"created": "Sat, 12 Feb 2022 16:44:15 GMT",
"version": "v1"
},
{
"created": "Sun, 20 Nov 2022 14:50:45 GMT",
"version": "v2"
}
] | 2022-11-22 | [
[
"Jin",
"Haibo",
""
],
[
"Chen",
"Ruoxi",
""
],
[
"Zheng",
"Haibin",
""
],
[
"Chen",
"Jinyin",
""
],
[
"Cheng",
"Yao",
""
],
[
"Yu",
"Yue",
""
],
[
"Liu",
"Xianglong",
""
]
] | Despite impressive capabilities and outstanding performance, deep neural networks (DNNs) have captured increasing public concern about their security problems, due to their frequently occurred erroneous behaviors. Therefore, it is necessary to conduct a systematical testing for DNNs before they are deployed to real-wor... |
2406.03227 | Martin Langhammer | Martin Langhammer (1 and 2), George A. Constantinides (2) ((1) Intel
Corporation, (2) Imperial College London) | Soft GPGPU versus IP cores: Quantifying and Reducing the Performance Gap | null | null | null | null | cs.AR | http://creativecommons.org/licenses/by/4.0/ | eGPU, a recently-reported soft GPGPU for FPGAs, has demonstrated very high
clock frequencies (more than 750 MHz) and small footprint. This means that for
the first time, commercial soft processors may be competitive for the kind of
heavy numerical computations common in FPGA-based digital signal processing. In
this p... | [
{
"created": "Wed, 5 Jun 2024 13:04:25 GMT",
"version": "v1"
}
] | 2024-06-06 | [
[
"Langhammer",
"Martin",
"",
"1 and 2"
],
[
"Constantinides",
"George A.",
""
]
] | eGPU, a recently-reported soft GPGPU for FPGAs, has demonstrated very high clock frequencies (more than 750 MHz) and small footprint. This means that for the first time, commercial soft processors may be competitive for the kind of heavy numerical computations common in FPGA-based digital signal processing. In this pap... |
2211.11156 | Ankit Chakraborty | Ankit Chakraborty and Georg May | A Continuous $hp-$Mesh Model for Discontinuous Petrov-Galerkin Finite
Element Schemes with Optimal Test Functions | null | null | null | null | cs.CE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present an anisotropic $hp-$mesh adaptation strategy using a continuous
mesh model for discontinuous Petrov-Galerkin (DPG) finite element schemes with
optimal test functions, extending our previous work on $h-$adaptation. The
proposed strategy utilizes the inbuilt residual-based error estimator of the
DPG discreti... | [
{
"created": "Mon, 21 Nov 2022 02:51:16 GMT",
"version": "v1"
}
] | 2022-11-22 | [
[
"Chakraborty",
"Ankit",
""
],
[
"May",
"Georg",
""
]
] | We present an anisotropic $hp-$mesh adaptation strategy using a continuous mesh model for discontinuous Petrov-Galerkin (DPG) finite element schemes with optimal test functions, extending our previous work on $h-$adaptation. The proposed strategy utilizes the inbuilt residual-based error estimator of the DPG discretiza... |
1810.00462 | Longsheng Jiang | Longsheng Jiang, Yue Wang | A Human-Computer Interface Design for Quantitative Measure of Regret
Theory | 6 pages, 5 figures | null | null | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Regret theory is a theory that describes human decision-making under risk.
The key of obtaining a quantitative model of regret theory is to measure the
preference in humans' mind when they choose among a set of options. Unlike
physical quantities, measuring psychological preference is not procedure
invariant, i.e. th... | [
{
"created": "Sun, 30 Sep 2018 20:37:22 GMT",
"version": "v1"
}
] | 2018-10-02 | [
[
"Jiang",
"Longsheng",
""
],
[
"Wang",
"Yue",
""
]
] | Regret theory is a theory that describes human decision-making under risk. The key of obtaining a quantitative model of regret theory is to measure the preference in humans' mind when they choose among a set of options. Unlike physical quantities, measuring psychological preference is not procedure invariant, i.e. the ... |
1911.00988 | Bahador Saket | Bahador Saket, Subhajit Das, Bum Chul Kwon, Alex Endert | Geono-Cluster: Interactive Visual Cluster Analysis for Biologists | null | null | null | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Biologists often perform clustering analysis to derive meaningful patterns,
relationships, and structures from data instances and attributes. Though
clustering plays a pivotal role in biologists' data exploration, it takes
non-trivial efforts for biologists to find the best grouping in their data
using existing tools... | [
{
"created": "Sun, 3 Nov 2019 23:10:31 GMT",
"version": "v1"
}
] | 2019-11-05 | [
[
"Saket",
"Bahador",
""
],
[
"Das",
"Subhajit",
""
],
[
"Kwon",
"Bum Chul",
""
],
[
"Endert",
"Alex",
""
]
] | Biologists often perform clustering analysis to derive meaningful patterns, relationships, and structures from data instances and attributes. Though clustering plays a pivotal role in biologists' data exploration, it takes non-trivial efforts for biologists to find the best grouping in their data using existing tools. ... |
1810.03115 | Alexandre Quemy | Alexandre Quemy | European Court of Human Right Open Data project | Preprint submitted to Data Mining and Knowledge Discovery | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents thirteen datasets for binary, multiclass and multilabel
classification based on the European Court of Human Rights judgments since its
creation. The interest of such datasets is explained through the prism of the
researcher, the data scientist, the citizen and the legal practitioner.
Contrarily to... | [
{
"created": "Sun, 7 Oct 2018 09:36:27 GMT",
"version": "v1"
},
{
"created": "Mon, 4 Feb 2019 16:09:14 GMT",
"version": "v2"
}
] | 2019-02-05 | [
[
"Quemy",
"Alexandre",
""
]
] | This paper presents thirteen datasets for binary, multiclass and multilabel classification based on the European Court of Human Rights judgments since its creation. The interest of such datasets is explained through the prism of the researcher, the data scientist, the citizen and the legal practitioner. Contrarily to m... |
1205.6846 | Hassan Mansour | Hassan Mansour and Ozgur Yilmaz | Support driven reweighted $\ell_1$ minimization | Proc. of the IEEE International Conference on Acoustics, Speech, and
Signal Processing (ICASSP), March, 2012 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a support driven reweighted $\ell_1$ minimization
algorithm (SDRL1) that solves a sequence of weighted $\ell_1$ problems and
relies on the support estimate accuracy. Our SDRL1 algorithm is related to the
IRL1 algorithm proposed by Cand{\`e}s, Wakin, and Boyd. We demonstrate that it
is suffic... | [
{
"created": "Wed, 30 May 2012 22:16:18 GMT",
"version": "v1"
}
] | 2012-06-01 | [
[
"Mansour",
"Hassan",
""
],
[
"Yilmaz",
"Ozgur",
""
]
] | In this paper, we propose a support driven reweighted $\ell_1$ minimization algorithm (SDRL1) that solves a sequence of weighted $\ell_1$ problems and relies on the support estimate accuracy. Our SDRL1 algorithm is related to the IRL1 algorithm proposed by Cand{\`e}s, Wakin, and Boyd. We demonstrate that it is sufficie... |
1210.4145 | Sacha Sokoloski | Sacha Sokoloski | A Biologically Realistic Model of Saccadic Eye Control with
Probabilistic Population Codes | null | null | null | null | cs.NE q-bio.NC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The posterior parietal cortex is believed to direct eye movements, especially
in regards to target tracking tasks, and a number of debates exist over the
precise nature of the computations performed by the parietal cortex, with each
side supported by different sets of biological evidence. In this paper I will
present... | [
{
"created": "Mon, 15 Oct 2012 19:33:27 GMT",
"version": "v1"
}
] | 2012-10-16 | [
[
"Sokoloski",
"Sacha",
""
]
] | The posterior parietal cortex is believed to direct eye movements, especially in regards to target tracking tasks, and a number of debates exist over the precise nature of the computations performed by the parietal cortex, with each side supported by different sets of biological evidence. In this paper I will present m... |
2211.04086 | Anders Eklund | M{\aa}ns Larsson, Muhammad Usman Akbar, Anders Eklund | Does an ensemble of GANs lead to better performance when training
segmentation networks with synthetic images? | 5 pages, submitted to ISBI 2023 | null | null | null | cs.CV eess.IV | http://creativecommons.org/licenses/by/4.0/ | Large annotated datasets are required to train segmentation networks. In
medical imaging, it is often difficult, time consuming and expensive to create
such datasets, and it may also be difficult to share these datasets with other
researchers. Different AI models can today generate very realistic synthetic
images, wh... | [
{
"created": "Tue, 8 Nov 2022 08:35:15 GMT",
"version": "v1"
},
{
"created": "Sun, 12 Mar 2023 13:42:25 GMT",
"version": "v2"
}
] | 2023-03-14 | [
[
"Larsson",
"Måns",
""
],
[
"Akbar",
"Muhammad Usman",
""
],
[
"Eklund",
"Anders",
""
]
] | Large annotated datasets are required to train segmentation networks. In medical imaging, it is often difficult, time consuming and expensive to create such datasets, and it may also be difficult to share these datasets with other researchers. Different AI models can today generate very realistic synthetic images, whic... |
1807.02553 | Shi Li | Janardhan Kulkarni and Shi Li | Flow-time Optimization For Concurrent Open-Shop and Precedence
Constrained Scheduling Models | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Scheduling a set of jobs over a collection of machines is a fundamental
problem that needs to be solved millions of times a day in various computing
platforms: in operating systems, in large data clusters, and in data centers.
Along with makespan, flow-time, which measures the length of time a job spends
in a system ... | [
{
"created": "Fri, 6 Jul 2018 19:46:49 GMT",
"version": "v1"
}
] | 2018-07-10 | [
[
"Kulkarni",
"Janardhan",
""
],
[
"Li",
"Shi",
""
]
] | Scheduling a set of jobs over a collection of machines is a fundamental problem that needs to be solved millions of times a day in various computing platforms: in operating systems, in large data clusters, and in data centers. Along with makespan, flow-time, which measures the length of time a job spends in a system be... |
1911.02737 | Wei Zhang | Wei Zhang, Feifei Lin, Xiaodong Wang, Zhenshuang Liang, Zhen Huang | SubCharacter Chinese-English Neural Machine Translation with Wubi
encoding | 10 pages, 3 figures, 7 tables | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Neural machine translation (NMT) is one of the best methods for understanding
the differences in semantic rules between two languages. Especially for
Indo-European languages, subword-level models have achieved impressive results.
However, when the translation task involves Chinese, semantic granularity
remains at the... | [
{
"created": "Thu, 7 Nov 2019 03:13:26 GMT",
"version": "v1"
}
] | 2019-11-11 | [
[
"Zhang",
"Wei",
""
],
[
"Lin",
"Feifei",
""
],
[
"Wang",
"Xiaodong",
""
],
[
"Liang",
"Zhenshuang",
""
],
[
"Huang",
"Zhen",
""
]
] | Neural machine translation (NMT) is one of the best methods for understanding the differences in semantic rules between two languages. Especially for Indo-European languages, subword-level models have achieved impressive results. However, when the translation task involves Chinese, semantic granularity remains at the w... |
2005.02696 | Li Wang | Li Wang, Dawei Zhao, Tao Wu, Hao Fu, Zhiyu Wang, Liang Xiao, Xin Xu
and Bin Dai | Drosophila-Inspired 3D Moving Object Detection Based on Point Clouds | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 3D moving object detection is one of the most critical tasks in dynamic scene
analysis. In this paper, we propose a novel Drosophila-inspired 3D moving
object detection method using Lidar sensors. According to the theory of
elementary motion detector, we have developed a motion detector based on the
shallow visual ne... | [
{
"created": "Wed, 6 May 2020 10:04:23 GMT",
"version": "v1"
}
] | 2020-05-07 | [
[
"Wang",
"Li",
""
],
[
"Zhao",
"Dawei",
""
],
[
"Wu",
"Tao",
""
],
[
"Fu",
"Hao",
""
],
[
"Wang",
"Zhiyu",
""
],
[
"Xiao",
"Liang",
""
],
[
"Xu",
"Xin",
""
],
[
"Dai",
"Bin",
""
]
] | 3D moving object detection is one of the most critical tasks in dynamic scene analysis. In this paper, we propose a novel Drosophila-inspired 3D moving object detection method using Lidar sensors. According to the theory of elementary motion detector, we have developed a motion detector based on the shallow visual neur... |
2006.00030 | Onel Luis Alcaraz Lopez | Onel L. A. L\'opez and Nurul Huda Mahmood and Hirley Alves and Matti
Latva-aho | CSI-free vs CSI-based multi-antenna WET for massive low-power Internet
of Things | 16 pags, 11 figures, Accepted in IEEE TWC | null | null | null | cs.NI cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Wireless Energy Transfer (WET) is a promising solution for powering massive
Internet of Things deployments. An important question is whether the costly
Channel State Information (CSI) acquisition procedure is necessary for optimum
performance. In this paper, we shed some light into this matter by evaluating
CSI-based... | [
{
"created": "Fri, 29 May 2020 18:38:34 GMT",
"version": "v1"
},
{
"created": "Tue, 22 Dec 2020 09:29:08 GMT",
"version": "v2"
}
] | 2020-12-23 | [
[
"López",
"Onel L. A.",
""
],
[
"Mahmood",
"Nurul Huda",
""
],
[
"Alves",
"Hirley",
""
],
[
"Latva-aho",
"Matti",
""
]
] | Wireless Energy Transfer (WET) is a promising solution for powering massive Internet of Things deployments. An important question is whether the costly Channel State Information (CSI) acquisition procedure is necessary for optimum performance. In this paper, we shed some light into this matter by evaluating CSI-based a... |
1310.3607 | Albrecht Zimmermann | Albrecht Zimmermann, Sruthi Moorthy and Zifan Shi | Predicting college basketball match outcomes using machine learning
techniques: some results and lessons learned | null | null | null | null | cs.LG stat.AP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Most existing work on predicting NCAAB matches has been developed in a
statistical context. Trusting the capabilities of ML techniques, particularly
classification learners, to uncover the importance of features and learn their
relationships, we evaluated a number of different paradigms on this task. In
this paper, w... | [
{
"created": "Mon, 14 Oct 2013 09:42:54 GMT",
"version": "v1"
}
] | 2013-10-15 | [
[
"Zimmermann",
"Albrecht",
""
],
[
"Moorthy",
"Sruthi",
""
],
[
"Shi",
"Zifan",
""
]
] | Most existing work on predicting NCAAB matches has been developed in a statistical context. Trusting the capabilities of ML techniques, particularly classification learners, to uncover the importance of features and learn their relationships, we evaluated a number of different paradigms on this task. In this paper, we ... |
2404.04952 | Victor Kebande | Victor R. Kebande | The Impact of Virtual Laboratories on Active Learning and Engagement in
Cybersecurity Distance Education | 13 pages 4 figures | null | null | null | cs.CY | http://creativecommons.org/licenses/by/4.0/ | Virtual Laboratories (V Labs) have in the recent past become part and parcel
of remote teaching in practical hands-on approaches, particularly in
Cybersecurity distance courses. Their potential is meant to assist learners
with hands-on practical laboratory exercises irrespective of geographical
location. Nevertheless... | [
{
"created": "Sun, 7 Apr 2024 13:16:37 GMT",
"version": "v1"
}
] | 2024-04-09 | [
[
"Kebande",
"Victor R.",
""
]
] | Virtual Laboratories (V Labs) have in the recent past become part and parcel of remote teaching in practical hands-on approaches, particularly in Cybersecurity distance courses. Their potential is meant to assist learners with hands-on practical laboratory exercises irrespective of geographical location. Nevertheless, ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.