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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2403.09048 | Lei Wang | Lei Wang, Jieming Bian, Letian Zhang, Chen Chen, Jie Xu | Taming Cross-Domain Representation Variance in Federated Prototype
Learning with Heterogeneous Data Domains | 16 pages | null | null | null | cs.LG cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Federated learning (FL) allows collaborative machine learning training
without sharing private data. While most FL methods assume identical data
domains across clients, real-world scenarios often involve heterogeneous data
domains. Federated Prototype Learning (FedPL) addresses this issue, using mean
feature vectors ... | [
{
"created": "Thu, 14 Mar 2024 02:36:16 GMT",
"version": "v1"
}
] | 2024-03-15 | [
[
"Wang",
"Lei",
""
],
[
"Bian",
"Jieming",
""
],
[
"Zhang",
"Letian",
""
],
[
"Chen",
"Chen",
""
],
[
"Xu",
"Jie",
""
]
] | Federated learning (FL) allows collaborative machine learning training without sharing private data. While most FL methods assume identical data domains across clients, real-world scenarios often involve heterogeneous data domains. Federated Prototype Learning (FedPL) addresses this issue, using mean feature vectors as... |
1110.0791 | Sergey Bozhevolnyi I | Sergey I. Bozhevolnyi | Rapid, Impartial and Comprehensive (RIC) publishing: A new concept for
scientific journals | 6 pages, 2 figures, 4 references | null | null | null | cs.DL physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Publishing scientific journals governed by editors relying on anonymous peer
reviewing is slow (even one round of reviewing involves several communications
between authors, editor and reviewers), partial (arguments of authors can
hardly overrule those of reviewers) and not using all available scientific
material (eve... | [
{
"created": "Tue, 4 Oct 2011 18:51:53 GMT",
"version": "v1"
}
] | 2011-10-05 | [
[
"Bozhevolnyi",
"Sergey I.",
""
]
] | Publishing scientific journals governed by editors relying on anonymous peer reviewing is slow (even one round of reviewing involves several communications between authors, editor and reviewers), partial (arguments of authors can hardly overrule those of reviewers) and not using all available scientific material (even ... |
1608.08252 | Fabrizio Maria Maggi | Hoang Nguyen, Marlon Dumas, Marcello La Rosa, Fabrizio Maria Maggi,
Suriadi Suriadi | Business Process Deviance Mining: Review and Evaluation | null | null | null | null | cs.AI cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Business process deviance refers to the phenomenon whereby a subset of the
executions of a business process deviate, in a negative or positive way, with
respect to its expected or desirable outcomes. Deviant executions of a business
process include those that violate compliance rules, or executions that
undershoot or... | [
{
"created": "Mon, 29 Aug 2016 21:14:01 GMT",
"version": "v1"
}
] | 2016-08-31 | [
[
"Nguyen",
"Hoang",
""
],
[
"Dumas",
"Marlon",
""
],
[
"La Rosa",
"Marcello",
""
],
[
"Maggi",
"Fabrizio Maria",
""
],
[
"Suriadi",
"Suriadi",
""
]
] | Business process deviance refers to the phenomenon whereby a subset of the executions of a business process deviate, in a negative or positive way, with respect to its expected or desirable outcomes. Deviant executions of a business process include those that violate compliance rules, or executions that undershoot or e... |
1709.06308 | Tingting Qiao | Tingting Qiao, Jianfeng Dong, Duanqing Xu | Exploring Human-like Attention Supervision in Visual Question Answering | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Attention mechanisms have been widely applied in the Visual Question
Answering (VQA) task, as they help to focus on the area-of-interest of both
visual and textual information. To answer the questions correctly, the model
needs to selectively target different areas of an image, which suggests that an
attention-based ... | [
{
"created": "Tue, 19 Sep 2017 09:19:08 GMT",
"version": "v1"
}
] | 2017-09-20 | [
[
"Qiao",
"Tingting",
""
],
[
"Dong",
"Jianfeng",
""
],
[
"Xu",
"Duanqing",
""
]
] | Attention mechanisms have been widely applied in the Visual Question Answering (VQA) task, as they help to focus on the area-of-interest of both visual and textual information. To answer the questions correctly, the model needs to selectively target different areas of an image, which suggests that an attention-based mo... |
2401.17948 | Harvie Zhang | Harvie Zhang | HyperZ$\cdot$Z$\cdot$W Operator Connects Slow-Fast Networks for Full
Context Interaction | 10 pages, 6 figures, 5 tables | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | The self-attention mechanism utilizes large implicit weight matrices,
programmed through dot product-based activations with very few trainable
parameters, to enable long sequence modeling. In this paper, we investigate the
possibility of discarding residual learning by employing large implicit kernels
to achieve full... | [
{
"created": "Wed, 31 Jan 2024 15:57:21 GMT",
"version": "v1"
}
] | 2024-02-01 | [
[
"Zhang",
"Harvie",
""
]
] | The self-attention mechanism utilizes large implicit weight matrices, programmed through dot product-based activations with very few trainable parameters, to enable long sequence modeling. In this paper, we investigate the possibility of discarding residual learning by employing large implicit kernels to achieve full c... |
2207.13478 | Jiaping Yu | Jiaping Yu, Shang Gao, Rui Song, Zhiping Cai, Bin Xiao | Partial Selfish Mining for More Profits | null | null | null | null | cs.CR cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Mining attacks aim to gain an unfair share of extra rewards in the blockchain
mining. Selfish mining can preserve discovered blocks and strategically release
them, wasting honest miners' computing resources and getting higher profits.
Previous mining attacks either conceal the mined whole blocks (hiding or
discarding... | [
{
"created": "Wed, 27 Jul 2022 11:58:38 GMT",
"version": "v1"
},
{
"created": "Sat, 6 Apr 2024 14:00:20 GMT",
"version": "v2"
}
] | 2024-04-09 | [
[
"Yu",
"Jiaping",
""
],
[
"Gao",
"Shang",
""
],
[
"Song",
"Rui",
""
],
[
"Cai",
"Zhiping",
""
],
[
"Xiao",
"Bin",
""
]
] | Mining attacks aim to gain an unfair share of extra rewards in the blockchain mining. Selfish mining can preserve discovered blocks and strategically release them, wasting honest miners' computing resources and getting higher profits. Previous mining attacks either conceal the mined whole blocks (hiding or discarding),... |
2312.01721 | Moritz Lampert | Moritz Lampert, Ingo Scholtes | The Self-Loop Paradox: Investigating the Impact of Self-Loops on Graph
Neural Networks | Presented at the Second Learning on Graphs Conference (LoG 2023) as
extended abstract | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Many Graph Neural Networks (GNNs) add self-loops to a graph to include
feature information about a node itself at each layer. However, if the GNN
consists of more than one layer, this information can return to its origin via
cycles in the graph topology. Intuition suggests that this "backflow" of
information should b... | [
{
"created": "Mon, 4 Dec 2023 08:23:00 GMT",
"version": "v1"
}
] | 2023-12-05 | [
[
"Lampert",
"Moritz",
""
],
[
"Scholtes",
"Ingo",
""
]
] | Many Graph Neural Networks (GNNs) add self-loops to a graph to include feature information about a node itself at each layer. However, if the GNN consists of more than one layer, this information can return to its origin via cycles in the graph topology. Intuition suggests that this "backflow" of information should be ... |
2002.11903 | Youngbin Park | Taewon Kim, Yeseong Park, Youngbin Park and Il Hong Suh | Acceleration of Actor-Critic Deep Reinforcement Learning for Visual
Grasping in Clutter by State Representation Learning Based on Disentanglement
of a Raw Input Image | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For a robotic grasping task in which diverse unseen target objects exist in a
cluttered environment, some deep learning-based methods have achieved
state-of-the-art results using visual input directly. In contrast, actor-critic
deep reinforcement learning (RL) methods typically perform very poorly when
grasping diver... | [
{
"created": "Thu, 27 Feb 2020 03:58:51 GMT",
"version": "v1"
}
] | 2020-02-28 | [
[
"Kim",
"Taewon",
""
],
[
"Park",
"Yeseong",
""
],
[
"Park",
"Youngbin",
""
],
[
"Suh",
"Il Hong",
""
]
] | For a robotic grasping task in which diverse unseen target objects exist in a cluttered environment, some deep learning-based methods have achieved state-of-the-art results using visual input directly. In contrast, actor-critic deep reinforcement learning (RL) methods typically perform very poorly when grasping diverse... |
1304.7095 | Cong Ling | Shuiyin Liu, Cong Ling, Xiaofu Wu | Proximity Factors of Lattice Reduction-Aided Precoding for Multiantenna
Broadcast | ISIT 2012 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Lattice precoding is an effective strategy for multiantenna broadcast. In
this paper, we show that approximate lattice precoding in multiantenna
broadcast is a variant of the closest vector problem (CVP) known as $\eta$-CVP.
The proximity factors of lattice reduction-aided precoding are defined, and
their bounds are ... | [
{
"created": "Fri, 26 Apr 2013 08:47:37 GMT",
"version": "v1"
}
] | 2013-04-29 | [
[
"Liu",
"Shuiyin",
""
],
[
"Ling",
"Cong",
""
],
[
"Wu",
"Xiaofu",
""
]
] | Lattice precoding is an effective strategy for multiantenna broadcast. In this paper, we show that approximate lattice precoding in multiantenna broadcast is a variant of the closest vector problem (CVP) known as $\eta$-CVP. The proximity factors of lattice reduction-aided precoding are defined, and their bounds are de... |
2111.08165 | Michael Fitzke | Michael Fitzke, Conrad Stack, Andre Dourson, Rodrigo M. B. Santana,
Diane Wilson, Lisa Ziemer, Arjun Soin, Matthew P. Lungren, Paul Fisher, Mark
Parkinson | RapidRead: Global Deployment of State-of-the-art Radiology AI for a
Large Veterinary Teleradiology Practice | null | null | null | null | cs.LG cs.CV eess.IV | http://creativecommons.org/licenses/by-nc-nd/4.0/ | This work describes the development and real-world deployment of a deep
learning-based AI system for evaluating canine and feline radiographs across a
broad range of findings and abnormalities. We describe a new semi-supervised
learning approach that combines NLP-derived labels with self-supervised
training leveragin... | [
{
"created": "Tue, 9 Nov 2021 14:05:16 GMT",
"version": "v1"
}
] | 2021-11-17 | [
[
"Fitzke",
"Michael",
""
],
[
"Stack",
"Conrad",
""
],
[
"Dourson",
"Andre",
""
],
[
"Santana",
"Rodrigo M. B.",
""
],
[
"Wilson",
"Diane",
""
],
[
"Ziemer",
"Lisa",
""
],
[
"Soin",
"Arjun",
""
],
[
... | This work describes the development and real-world deployment of a deep learning-based AI system for evaluating canine and feline radiographs across a broad range of findings and abnormalities. We describe a new semi-supervised learning approach that combines NLP-derived labels with self-supervised training leveraging ... |
2403.20045 | Haoxiang Luo | Tianqi Jiang, Haoxiang Luo, Kun Yang, Gang Sun, Hongfang Yu, Qi Huang,
Athanasios V. Vasilakos | Blockchain for Energy Market: A Comprehensive Survey | null | null | null | null | cs.NI | http://creativecommons.org/publicdomain/zero/1.0/ | The energy market encompasses the behavior of energy supply and trading
within a platform system. By utilizing centralized or distributed trading,
energy can be effectively managed and distributed across different regions,
thereby achieving market equilibrium and satisfying both producers and
consumers. However, rece... | [
{
"created": "Fri, 29 Mar 2024 08:29:32 GMT",
"version": "v1"
},
{
"created": "Fri, 5 Apr 2024 05:37:43 GMT",
"version": "v2"
}
] | 2024-04-08 | [
[
"Jiang",
"Tianqi",
""
],
[
"Luo",
"Haoxiang",
""
],
[
"Yang",
"Kun",
""
],
[
"Sun",
"Gang",
""
],
[
"Yu",
"Hongfang",
""
],
[
"Huang",
"Qi",
""
],
[
"Vasilakos",
"Athanasios V.",
""
]
] | The energy market encompasses the behavior of energy supply and trading within a platform system. By utilizing centralized or distributed trading, energy can be effectively managed and distributed across different regions, thereby achieving market equilibrium and satisfying both producers and consumers. However, recent... |
1701.05581 | Diptesh Kanojia | Abhijit Mishra, Diptesh Kanojia, Seema Nagar, Kuntal Dey and Pushpak
Bhattacharyya | Leveraging Cognitive Features for Sentiment Analysis | The SIGNLL Conference on Computational Natural Language Learning
(CoNLL 2016) | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Sentiments expressed in user-generated short text and sentences are nuanced
by subtleties at lexical, syntactic, semantic and pragmatic levels. To address
this, we propose to augment traditional features used for sentiment analysis
and sarcasm detection, with cognitive features derived from the eye-movement
patterns ... | [
{
"created": "Thu, 19 Jan 2017 19:58:26 GMT",
"version": "v1"
}
] | 2017-01-23 | [
[
"Mishra",
"Abhijit",
""
],
[
"Kanojia",
"Diptesh",
""
],
[
"Nagar",
"Seema",
""
],
[
"Dey",
"Kuntal",
""
],
[
"Bhattacharyya",
"Pushpak",
""
]
] | Sentiments expressed in user-generated short text and sentences are nuanced by subtleties at lexical, syntactic, semantic and pragmatic levels. To address this, we propose to augment traditional features used for sentiment analysis and sarcasm detection, with cognitive features derived from the eye-movement patterns of... |
2305.04658 | Han Chen | Han Chen, Ziwen Zhao, Yuhua Li, Yixiong Zou, Ruixuan Li, Rui Zhang | CSGCL: Community-Strength-Enhanced Graph Contrastive Learning | Accepted to 23th International Joint Conferences on Artificial
Intelligence(IJCAI) | null | null | null | cs.SI cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Graph Contrastive Learning (GCL) is an effective way to learn generalized
graph representations in a self-supervised manner, and has grown rapidly in
recent years. However, the underlying community semantics has not been well
explored by most previous GCL methods. Research that attempts to leverage
communities in GCL... | [
{
"created": "Mon, 8 May 2023 12:21:24 GMT",
"version": "v1"
}
] | 2023-05-09 | [
[
"Chen",
"Han",
""
],
[
"Zhao",
"Ziwen",
""
],
[
"Li",
"Yuhua",
""
],
[
"Zou",
"Yixiong",
""
],
[
"Li",
"Ruixuan",
""
],
[
"Zhang",
"Rui",
""
]
] | Graph Contrastive Learning (GCL) is an effective way to learn generalized graph representations in a self-supervised manner, and has grown rapidly in recent years. However, the underlying community semantics has not been well explored by most previous GCL methods. Research that attempts to leverage communities in GCL r... |
1910.01805 | Alexander Jung | Alexander Jung | On the Duality between Network Flows and Network Lasso | networks, clustering, machine learning, optimization, duality, Lasso | null | 10.1109/LSP.2020.2998400 | null | cs.LG math.OC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many applications generate data with an intrinsic network structure such as
time series data, image data or social network data. The network Lasso (nLasso)
has been proposed recently as a method for joint clustering and optimization of
machine learning models for networked data. The nLasso extends the Lasso from
spar... | [
{
"created": "Fri, 4 Oct 2019 06:04:45 GMT",
"version": "v1"
},
{
"created": "Sat, 28 Mar 2020 07:16:30 GMT",
"version": "v2"
}
] | 2020-08-26 | [
[
"Jung",
"Alexander",
""
]
] | Many applications generate data with an intrinsic network structure such as time series data, image data or social network data. The network Lasso (nLasso) has been proposed recently as a method for joint clustering and optimization of machine learning models for networked data. The nLasso extends the Lasso from sparse... |
2306.05476 | Yu-Jen Chen | Yu-Jen Chen, Yiyu Shi, Tsung-Yi Ho | A Novel Confidence Induced Class Activation Mapping for MRI Brain Tumor
Segmentation | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Magnetic resonance imaging (MRI) is a commonly used technique for brain tumor
segmentation, which is critical for evaluating patients and planning treatment.
To make the labeling process less laborious and dependent on expertise,
weakly-supervised semantic segmentation (WSSS) methods using class activation
mapping (C... | [
{
"created": "Thu, 8 Jun 2023 18:01:08 GMT",
"version": "v1"
},
{
"created": "Mon, 26 Jun 2023 08:16:59 GMT",
"version": "v2"
},
{
"created": "Mon, 30 Oct 2023 06:45:01 GMT",
"version": "v3"
}
] | 2023-10-31 | [
[
"Chen",
"Yu-Jen",
""
],
[
"Shi",
"Yiyu",
""
],
[
"Ho",
"Tsung-Yi",
""
]
] | Magnetic resonance imaging (MRI) is a commonly used technique for brain tumor segmentation, which is critical for evaluating patients and planning treatment. To make the labeling process less laborious and dependent on expertise, weakly-supervised semantic segmentation (WSSS) methods using class activation mapping (CAM... |
1807.02189 | David Paulius | David Paulius, Ahmad Babaeian Jelodar and Yu Sun | Functional Object-Oriented Network: Construction & Expansion | 7 pages, 3 figures, presented at ICRA 2018 | ICRA 2018 Submission -- 7 pages | 10.1109/ICRA.2018.8460200 | null | cs.RO cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We build upon the functional object-oriented network (FOON), a structured
knowledge representation which is constructed from observations of human
activities and manipulations. A FOON can be used for representing object-motion
affordances. Knowledge retrieval through graph search allows us to obtain novel
manipulatio... | [
{
"created": "Thu, 5 Jul 2018 21:59:30 GMT",
"version": "v1"
},
{
"created": "Fri, 31 Jul 2020 04:28:52 GMT",
"version": "v2"
}
] | 2020-08-03 | [
[
"Paulius",
"David",
""
],
[
"Jelodar",
"Ahmad Babaeian",
""
],
[
"Sun",
"Yu",
""
]
] | We build upon the functional object-oriented network (FOON), a structured knowledge representation which is constructed from observations of human activities and manipulations. A FOON can be used for representing object-motion affordances. Knowledge retrieval through graph search allows us to obtain novel manipulation ... |
2403.16635 | Zihan Ding | Si Liu, Zihan Ding, Jiahui Fu, Hongyu Li, Siheng Chen, Shifeng Zhang,
Xu Zhou | V2X-PC: Vehicle-to-everything Collaborative Perception via Point Cluster | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The objective of the collaborative vehicle-to-everything perception task is
to enhance the individual vehicle's perception capability through message
communication among neighboring traffic agents. Previous methods focus on
achieving optimal performance within bandwidth limitations and typically adopt
BEV maps as the... | [
{
"created": "Mon, 25 Mar 2024 11:24:02 GMT",
"version": "v1"
}
] | 2024-03-26 | [
[
"Liu",
"Si",
""
],
[
"Ding",
"Zihan",
""
],
[
"Fu",
"Jiahui",
""
],
[
"Li",
"Hongyu",
""
],
[
"Chen",
"Siheng",
""
],
[
"Zhang",
"Shifeng",
""
],
[
"Zhou",
"Xu",
""
]
] | The objective of the collaborative vehicle-to-everything perception task is to enhance the individual vehicle's perception capability through message communication among neighboring traffic agents. Previous methods focus on achieving optimal performance within bandwidth limitations and typically adopt BEV maps as the b... |
2305.15932 | Jie He | Jie He and Simon Chi Lok U and V\'ictor Guti\'errez-Basulto and Jeff
Z. Pan | BUCA: A Binary Classification Approach to Unsupervised Commonsense
Question Answering | Accepted by ACL2023 | null | null | null | cs.CL | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Unsupervised commonsense reasoning (UCR) is becoming increasingly popular as
the construction of commonsense reasoning datasets is expensive, and they are
inevitably limited in their scope. A popular approach to UCR is to fine-tune
language models with external knowledge (e.g., knowledge graphs), but this
usually req... | [
{
"created": "Thu, 25 May 2023 10:59:47 GMT",
"version": "v1"
},
{
"created": "Wed, 7 Jun 2023 20:33:09 GMT",
"version": "v2"
}
] | 2023-06-09 | [
[
"He",
"Jie",
""
],
[
"U",
"Simon Chi Lok",
""
],
[
"Gutiérrez-Basulto",
"Víctor",
""
],
[
"Pan",
"Jeff Z.",
""
]
] | Unsupervised commonsense reasoning (UCR) is becoming increasingly popular as the construction of commonsense reasoning datasets is expensive, and they are inevitably limited in their scope. A popular approach to UCR is to fine-tune language models with external knowledge (e.g., knowledge graphs), but this usually requi... |
2211.09200 | Ma\"el Le Treust | Ma\"el Le Treust and Tobias Oechtering | Power-Estimation Trade-off of Vector-valued Witsenhausen Counterexample
with Causal Decoder | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The vector-valued extension of the famous Witsenhausen counterexample setup
is studied where the encoder, i.e. the first decision maker, non-causally knows
and encodes the i.i.d. state sequence and the decoder, i.e. the second decision
maker, causally estimates the interim state. The coding scheme is transferred
from... | [
{
"created": "Wed, 16 Nov 2022 20:40:36 GMT",
"version": "v1"
}
] | 2022-11-18 | [
[
"Treust",
"Maël Le",
""
],
[
"Oechtering",
"Tobias",
""
]
] | The vector-valued extension of the famous Witsenhausen counterexample setup is studied where the encoder, i.e. the first decision maker, non-causally knows and encodes the i.i.d. state sequence and the decoder, i.e. the second decision maker, causally estimates the interim state. The coding scheme is transferred from t... |
1603.00993 | Kanji Tanaka | Tanaka Kanji | Self-localization from Images with Small Overlap | 8 pages, 9 figures, Draft of a paper submitted to an International
Conference | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the recent success of visual features from deep convolutional neural
networks (DCNN) in visual robot self-localization, it has become important and
practical to address more general self-localization scenarios. In this paper,
we address the scenario of self-localization from images with small overlap. We
explici... | [
{
"created": "Thu, 3 Mar 2016 06:39:37 GMT",
"version": "v1"
}
] | 2016-03-04 | [
[
"Kanji",
"Tanaka",
""
]
] | With the recent success of visual features from deep convolutional neural networks (DCNN) in visual robot self-localization, it has become important and practical to address more general self-localization scenarios. In this paper, we address the scenario of self-localization from images with small overlap. We explicitl... |
1311.6676 | Alexandr Klimchik | Alexandr Klimchik (IRCCyN), Yier Wu (IRCCyN), Gabriel ABBA (LCFC),
Beno\^it Furet (IRCCyN), Anatol Pashkevich (IRCCyN) | Robust algorithm for calibration of robotic manipulator model | null | The IFAC Conference on Manufacturing Modeling, Management and
Control (MIM 2013), Saint Petersburg : Russian Federation (2013) | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The paper focuses on the robust identification of geometrical and
elastostatic parameters of robotic manipulator. The main attention is paid to
the efficiency improvement of the identification algorithm. To increase the
identification accuracy, it is proposed to apply the weighted least square
technique that employs ... | [
{
"created": "Tue, 26 Nov 2013 14:02:08 GMT",
"version": "v1"
}
] | 2013-11-27 | [
[
"Klimchik",
"Alexandr",
"",
"IRCCyN"
],
[
"Wu",
"Yier",
"",
"IRCCyN"
],
[
"ABBA",
"Gabriel",
"",
"LCFC"
],
[
"Furet",
"Benoît",
"",
"IRCCyN"
],
[
"Pashkevich",
"Anatol",
"",
"IRCCyN"
]
] | The paper focuses on the robust identification of geometrical and elastostatic parameters of robotic manipulator. The main attention is paid to the efficiency improvement of the identification algorithm. To increase the identification accuracy, it is proposed to apply the weighted least square technique that employs a ... |
2111.07549 | Zhu Li | Zhu Li, Yuqing Zhang, Mengxi Nie, Ming Yan, Mengnan He, Ruixiong
Zhang, Caixia Gong | Improving Prosody for Unseen Texts in Speech Synthesis by Utilizing
Linguistic Information and Noisy Data | null | null | null | null | cs.CL cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent advancements in end-to-end speech synthesis have made it possible to
generate highly natural speech. However, training these models typically
requires a large amount of high-fidelity speech data, and for unseen texts, the
prosody of synthesized speech is relatively unnatural. To address these issues,
we propos... | [
{
"created": "Mon, 15 Nov 2021 05:58:29 GMT",
"version": "v1"
}
] | 2021-11-16 | [
[
"Li",
"Zhu",
""
],
[
"Zhang",
"Yuqing",
""
],
[
"Nie",
"Mengxi",
""
],
[
"Yan",
"Ming",
""
],
[
"He",
"Mengnan",
""
],
[
"Zhang",
"Ruixiong",
""
],
[
"Gong",
"Caixia",
""
]
] | Recent advancements in end-to-end speech synthesis have made it possible to generate highly natural speech. However, training these models typically requires a large amount of high-fidelity speech data, and for unseen texts, the prosody of synthesized speech is relatively unnatural. To address these issues, we propose ... |
2107.08319 | Karishma Sharma | Karishma Sharma and Emilio Ferrara and Yan Liu | Characterizing Online Engagement with Disinformation and Conspiracies in
the 2020 U.S. Presidential Election | Accepted at ICWSM'22 | ICWSM 2022 | null | null | cs.SI cs.CY cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Identifying and characterizing disinformation in political discourse on
social media is critical to ensure the integrity of elections and democratic
processes around the world. Persistent manipulation of social media has
resulted in increased concerns regarding the 2020 U.S. Presidential Election,
due to its potentia... | [
{
"created": "Sat, 17 Jul 2021 22:11:13 GMT",
"version": "v1"
},
{
"created": "Wed, 20 Oct 2021 17:50:37 GMT",
"version": "v2"
}
] | 2021-10-22 | [
[
"Sharma",
"Karishma",
""
],
[
"Ferrara",
"Emilio",
""
],
[
"Liu",
"Yan",
""
]
] | Identifying and characterizing disinformation in political discourse on social media is critical to ensure the integrity of elections and democratic processes around the world. Persistent manipulation of social media has resulted in increased concerns regarding the 2020 U.S. Presidential Election, due to its potential ... |
2006.02379 | Juli\'an Tachella Dr | Juli\'an Tachella and Junqi Tang and Mike Davies | The Neural Tangent Link Between CNN Denoisers and Non-Local Filters | null | null | null | null | cs.CV eess.IV eess.SP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Convolutional Neural Networks (CNNs) are now a well-established tool for
solving computational imaging problems. Modern CNN-based algorithms obtain
state-of-the-art performance in diverse image restoration problems.
Furthermore, it has been recently shown that, despite being highly
overparameterized, networks trained... | [
{
"created": "Wed, 3 Jun 2020 16:50:54 GMT",
"version": "v1"
},
{
"created": "Thu, 4 Jun 2020 16:02:57 GMT",
"version": "v2"
},
{
"created": "Fri, 5 Jun 2020 16:41:44 GMT",
"version": "v3"
},
{
"created": "Mon, 16 Nov 2020 23:06:53 GMT",
"version": "v4"
}
] | 2020-11-18 | [
[
"Tachella",
"Julián",
""
],
[
"Tang",
"Junqi",
""
],
[
"Davies",
"Mike",
""
]
] | Convolutional Neural Networks (CNNs) are now a well-established tool for solving computational imaging problems. Modern CNN-based algorithms obtain state-of-the-art performance in diverse image restoration problems. Furthermore, it has been recently shown that, despite being highly overparameterized, networks trained w... |
2407.12465 | Vignesh V Menon | Vignesh V Menon and Adam Wieckowski and Christian Stoffers and Jens
Brandenburg and Christian Lehmann and Benjamin Bross and Thomas Schierl and
Detlev Marpe | Enhancing Film Grain Coding in VVC: Improving Encoding Quality and
Efficiency | Accepted at IBC'24 | null | null | null | cs.MM | http://creativecommons.org/licenses/by/4.0/ | This paper presents an in-depth analysis of film grain handling in
open-source implementations of the Versatile Video Coding (VVC) standard. We
focus on two key components: the Film Grain Analysis (FGA) module implemented
in VVenC and the Film Grain Synthesis (FGS) module implemented in VVdeC. We
describe the methodo... | [
{
"created": "Wed, 17 Jul 2024 10:34:49 GMT",
"version": "v1"
}
] | 2024-07-18 | [
[
"Menon",
"Vignesh V",
""
],
[
"Wieckowski",
"Adam",
""
],
[
"Stoffers",
"Christian",
""
],
[
"Brandenburg",
"Jens",
""
],
[
"Lehmann",
"Christian",
""
],
[
"Bross",
"Benjamin",
""
],
[
"Schierl",
"Thomas",
... | This paper presents an in-depth analysis of film grain handling in open-source implementations of the Versatile Video Coding (VVC) standard. We focus on two key components: the Film Grain Analysis (FGA) module implemented in VVenC and the Film Grain Synthesis (FGS) module implemented in VVdeC. We describe the methodolo... |
1601.03976 | Eduardo Martins Hargreaves | Eduardo Hargreaves, Paulo H De Aguiar Rodrigues and Daniel S.
Menasch\'e | Modeling and Analysis of Converged Network-Cloud Services | XIII Workshop em Clouds e Aplica\c{c}\~oes (WCGA2015) | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Networks connecting distributed cloud services through multiple data centers
are called cloud networks. These types of networks play a crucial role in cloud
computing and a holistic performance evaluation is essential before planning a
converged network-cloud environment. We analyze a specific case where some
resourc... | [
{
"created": "Fri, 15 Jan 2016 15:57:04 GMT",
"version": "v1"
}
] | 2018-07-24 | [
[
"Hargreaves",
"Eduardo",
""
],
[
"Rodrigues",
"Paulo H De Aguiar",
""
],
[
"Menasché",
"Daniel S.",
""
]
] | Networks connecting distributed cloud services through multiple data centers are called cloud networks. These types of networks play a crucial role in cloud computing and a holistic performance evaluation is essential before planning a converged network-cloud environment. We analyze a specific case where some resources... |
2304.10254 | Xu Zhang Zhang | Xu Zhang, Xinzheng Niu, Philippe Fournier-Viger, Xudong Dai | Image-text Retrieval via Preserving Main Semantics of Vision | 6 pages, 3 figures, accepted by ICME2023 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Image-text retrieval is one of the major tasks of cross-modal retrieval.
Several approaches for this task map images and texts into a common space to
create correspondences between the two modalities. However, due to the content
(semantics) richness of an image, redundant secondary information in an image
may cause f... | [
{
"created": "Thu, 20 Apr 2023 12:23:29 GMT",
"version": "v1"
},
{
"created": "Fri, 28 Apr 2023 08:09:54 GMT",
"version": "v2"
}
] | 2023-05-01 | [
[
"Zhang",
"Xu",
""
],
[
"Niu",
"Xinzheng",
""
],
[
"Fournier-Viger",
"Philippe",
""
],
[
"Dai",
"Xudong",
""
]
] | Image-text retrieval is one of the major tasks of cross-modal retrieval. Several approaches for this task map images and texts into a common space to create correspondences between the two modalities. However, due to the content (semantics) richness of an image, redundant secondary information in an image may cause fal... |
2112.08348 | Daniel Khashabi Mr. | Daniel Khashabi, Shane Lyu, Sewon Min, Lianhui Qin, Kyle Richardson,
Sean Welleck, Hannaneh Hajishirzi, Tushar Khot, Ashish Sabharwal, Sameer
Singh, Yejin Choi | Prompt Waywardness: The Curious Case of Discretized Interpretation of
Continuous Prompts | NAACL 2022 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Fine-tuning continuous prompts for target tasks has recently emerged as a
compact alternative to full model fine-tuning. Motivated by these promising
results, we investigate the feasibility of extracting a discrete (textual)
interpretation of continuous prompts that is faithful to the problem they
solve. In practice,... | [
{
"created": "Wed, 15 Dec 2021 18:55:05 GMT",
"version": "v1"
},
{
"created": "Wed, 4 May 2022 04:28:12 GMT",
"version": "v2"
}
] | 2022-05-05 | [
[
"Khashabi",
"Daniel",
""
],
[
"Lyu",
"Shane",
""
],
[
"Min",
"Sewon",
""
],
[
"Qin",
"Lianhui",
""
],
[
"Richardson",
"Kyle",
""
],
[
"Welleck",
"Sean",
""
],
[
"Hajishirzi",
"Hannaneh",
""
],
[
"Kh... | Fine-tuning continuous prompts for target tasks has recently emerged as a compact alternative to full model fine-tuning. Motivated by these promising results, we investigate the feasibility of extracting a discrete (textual) interpretation of continuous prompts that is faithful to the problem they solve. In practice, w... |
2406.18032 | Bernie Gao | Xiao Yan, Bernie Gao | A Communication Satellite Servises Based Decentralized Network Protocol | null | null | null | null | cs.CR cs.DC cs.NI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | In this paper, we present a decentralized network protocol, Space Network
Protocol, based on Communication Satellite Services. The protocol outlines a
method for distributing information about the status of satellite communication
services across the entire blockchain network, facilitating fairness and
transparency i... | [
{
"created": "Wed, 26 Jun 2024 03:01:40 GMT",
"version": "v1"
}
] | 2024-06-27 | [
[
"Yan",
"Xiao",
""
],
[
"Gao",
"Bernie",
""
]
] | In this paper, we present a decentralized network protocol, Space Network Protocol, based on Communication Satellite Services. The protocol outlines a method for distributing information about the status of satellite communication services across the entire blockchain network, facilitating fairness and transparency in ... |
2403.07290 | Runmin Cong | Runmin Cong, Ronghui Sheng, Hao Wu, Yulan Guo, Yunchao Wei, Wangmeng
Zuo, Yao Zhao, and Sam Kwong | Learning Hierarchical Color Guidance for Depth Map Super-Resolution | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Color information is the most commonly used prior knowledge for depth map
super-resolution (DSR), which can provide high-frequency boundary guidance for
detail restoration. However, its role and functionality in DSR have not been
fully developed. In this paper, we rethink the utilization of color information
and prop... | [
{
"created": "Tue, 12 Mar 2024 03:44:46 GMT",
"version": "v1"
}
] | 2024-03-13 | [
[
"Cong",
"Runmin",
""
],
[
"Sheng",
"Ronghui",
""
],
[
"Wu",
"Hao",
""
],
[
"Guo",
"Yulan",
""
],
[
"Wei",
"Yunchao",
""
],
[
"Zuo",
"Wangmeng",
""
],
[
"Zhao",
"Yao",
""
],
[
"Kwong",
"Sam",
... | Color information is the most commonly used prior knowledge for depth map super-resolution (DSR), which can provide high-frequency boundary guidance for detail restoration. However, its role and functionality in DSR have not been fully developed. In this paper, we rethink the utilization of color information and propos... |
2305.00131 | Rajshekhar Das | Rajshekhar Das, Jonathan Francis, Sanket Vaibhav Mehta, Jean Oh, Emma
Strubell, Jose Moura | Regularizing Self-training for Unsupervised Domain Adaptation via
Structural Constraints | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Self-training based on pseudo-labels has emerged as a dominant approach for
addressing conditional distribution shifts in unsupervised domain adaptation
(UDA) for semantic segmentation problems. A notable drawback, however, is that
this family of approaches is susceptible to erroneous pseudo labels that arise
from co... | [
{
"created": "Sat, 29 Apr 2023 00:12:26 GMT",
"version": "v1"
}
] | 2023-05-02 | [
[
"Das",
"Rajshekhar",
""
],
[
"Francis",
"Jonathan",
""
],
[
"Mehta",
"Sanket Vaibhav",
""
],
[
"Oh",
"Jean",
""
],
[
"Strubell",
"Emma",
""
],
[
"Moura",
"Jose",
""
]
] | Self-training based on pseudo-labels has emerged as a dominant approach for addressing conditional distribution shifts in unsupervised domain adaptation (UDA) for semantic segmentation problems. A notable drawback, however, is that this family of approaches is susceptible to erroneous pseudo labels that arise from conf... |
2406.05395 | Vahid MohammadZadeh Eivaghi | Vahid MohammadZadeh Eivaghi, Mahdi Aliyari Shoorehdeli | Dynamic importance learning using fisher information gain for nonlinear
system identification | null | null | null | null | cs.LG cs.SY eess.SY | http://creativecommons.org/licenses/by-sa/4.0/ | The Fisher Information Matrix (FIM) provides a way for quantifying the
information content of an observable random variable concerning unknown
parameters within a model that characterizes the variable. When parameters in a
model are directly linked to individual features, the diagonal elements of the
FIM can signify ... | [
{
"created": "Sat, 8 Jun 2024 08:12:41 GMT",
"version": "v1"
}
] | 2024-06-11 | [
[
"Eivaghi",
"Vahid MohammadZadeh",
""
],
[
"Shoorehdeli",
"Mahdi Aliyari",
""
]
] | The Fisher Information Matrix (FIM) provides a way for quantifying the information content of an observable random variable concerning unknown parameters within a model that characterizes the variable. When parameters in a model are directly linked to individual features, the diagonal elements of the FIM can signify th... |
1802.02663 | Sridhar Chimalakonda | Sridhar Chimalakonda, Kesav V. Nori | A Patterns Based Approach for Design of Educational Technologies | Preprint Submitted to Educational Technology Research and Development
Journal, Springer | null | null | null | cs.SE cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Instructional design is a fundamental base for educational technologies as it
lays the foundation to facilitate learning and teaching based on pedagogical
underpinnings. However, most of the educational technologies today face two
core challenges in this context: (i) lack of instructional design as a basis
(ii) lack ... | [
{
"created": "Wed, 7 Feb 2018 22:41:54 GMT",
"version": "v1"
}
] | 2018-02-09 | [
[
"Chimalakonda",
"Sridhar",
""
],
[
"Nori",
"Kesav V.",
""
]
] | Instructional design is a fundamental base for educational technologies as it lays the foundation to facilitate learning and teaching based on pedagogical underpinnings. However, most of the educational technologies today face two core challenges in this context: (i) lack of instructional design as a basis (ii) lack of... |
2402.12545 | Danna Zheng | Danna Zheng, Danyang Liu, Mirella Lapata, Jeff Z. Pan | TrustScore: Reference-Free Evaluation of LLM Response Trustworthiness | null | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Large Language Models (LLMs) have demonstrated impressive capabilities across
various domains, prompting a surge in their practical applications. However,
concerns have arisen regarding the trustworthiness of LLMs outputs,
particularly in closed-book question-answering tasks, where non-experts may
struggle to identif... | [
{
"created": "Mon, 19 Feb 2024 21:12:14 GMT",
"version": "v1"
},
{
"created": "Mon, 6 May 2024 22:02:10 GMT",
"version": "v2"
}
] | 2024-05-08 | [
[
"Zheng",
"Danna",
""
],
[
"Liu",
"Danyang",
""
],
[
"Lapata",
"Mirella",
""
],
[
"Pan",
"Jeff Z.",
""
]
] | Large Language Models (LLMs) have demonstrated impressive capabilities across various domains, prompting a surge in their practical applications. However, concerns have arisen regarding the trustworthiness of LLMs outputs, particularly in closed-book question-answering tasks, where non-experts may struggle to identify ... |
1610.09256 | Amir H Jafari | Amir H. Jafari, Ming Ding, David Lopez-Perez, Jie Zhang | Performance Impact of LOS and NLOS Transmissions in Dense Cellular
Networks under Rician Fading | 24 pages, 3 figures. Submitted to IEEE Transactions on Wireless
Communications | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we analyse the performance of dense small cell network (SCNs).
We derive analytical expressions for both their coverage probability and their
area spectral efficiency (ASE) using a path loss model that considers both
line-of-sight (LOS) and non-LOS (NLOS) components. Due to the close proximity
of small... | [
{
"created": "Fri, 28 Oct 2016 15:07:21 GMT",
"version": "v1"
}
] | 2016-10-31 | [
[
"Jafari",
"Amir H.",
""
],
[
"Ding",
"Ming",
""
],
[
"Lopez-Perez",
"David",
""
],
[
"Zhang",
"Jie",
""
]
] | In this paper, we analyse the performance of dense small cell network (SCNs). We derive analytical expressions for both their coverage probability and their area spectral efficiency (ASE) using a path loss model that considers both line-of-sight (LOS) and non-LOS (NLOS) components. Due to the close proximity of small c... |
1705.06002 | Aubrey Alston | Aubrey Alston | Attribute-based Encryption for Attribute-based Authentication,
Authorization, Storage, and Transmission in Distributed Storage Systems | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Attribute-based encryption is a form of encryption which offers the capacity
to encrypt data such that it is only accessible to individuals holding a
satisfactory configuration of attributes. As cloud and distributed computing
become more pervasive in both private and public spheres, attribute-based
encryption holds ... | [
{
"created": "Wed, 17 May 2017 04:23:45 GMT",
"version": "v1"
}
] | 2017-05-18 | [
[
"Alston",
"Aubrey",
""
]
] | Attribute-based encryption is a form of encryption which offers the capacity to encrypt data such that it is only accessible to individuals holding a satisfactory configuration of attributes. As cloud and distributed computing become more pervasive in both private and public spheres, attribute-based encryption holds po... |
2203.10133 | Peter West | Peter West, Chris Quirk, Michel Galley, Yejin Choi | Probing Factually Grounded Content Transfer with Factual Ablation | null | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | Despite recent success, large neural models often generate factually
incorrect text. Compounding this is the lack of a standard automatic evaluation
for factuality--it cannot be meaningfully improved if it cannot be measured.
Grounded generation promises a path to solving both of these problems: models
draw on a reli... | [
{
"created": "Fri, 18 Mar 2022 19:18:54 GMT",
"version": "v1"
},
{
"created": "Tue, 29 Mar 2022 00:08:38 GMT",
"version": "v2"
}
] | 2022-03-30 | [
[
"West",
"Peter",
""
],
[
"Quirk",
"Chris",
""
],
[
"Galley",
"Michel",
""
],
[
"Choi",
"Yejin",
""
]
] | Despite recent success, large neural models often generate factually incorrect text. Compounding this is the lack of a standard automatic evaluation for factuality--it cannot be meaningfully improved if it cannot be measured. Grounded generation promises a path to solving both of these problems: models draw on a reliab... |
2205.15523 | Jeremiah Deng | Jinyong Hou, Jeremiah D. Deng, Stephen Cranefield, Xuejie Din | Variational Transfer Learning using Cross-Domain Latent Modulation | Under review. Extended version of a previous WACV paper
(arXiv:2012.11727). 13 pages, 8 figures | null | null | null | cs.LG cs.AI cs.CV | http://creativecommons.org/licenses/by/4.0/ | To successfully apply trained neural network models to new domains, powerful
transfer learning solutions are essential. We propose to introduce a novel
cross-domain latent modulation mechanism to a variational autoencoder framework
so as to achieve effective transfer learning. Our key idea is to procure deep
represen... | [
{
"created": "Tue, 31 May 2022 03:47:08 GMT",
"version": "v1"
},
{
"created": "Wed, 31 Jan 2024 05:30:22 GMT",
"version": "v2"
}
] | 2024-02-01 | [
[
"Hou",
"Jinyong",
""
],
[
"Deng",
"Jeremiah D.",
""
],
[
"Cranefield",
"Stephen",
""
],
[
"Din",
"Xuejie",
""
]
] | To successfully apply trained neural network models to new domains, powerful transfer learning solutions are essential. We propose to introduce a novel cross-domain latent modulation mechanism to a variational autoencoder framework so as to achieve effective transfer learning. Our key idea is to procure deep representa... |
1902.10785 | Ruizhi Liao | Ruizhi Liao, Jonathan Rubin, Grace Lam, Seth Berkowitz, Sandeep Dalal,
William Wells, Steven Horng, Polina Golland | Semi-supervised Learning for Quantification of Pulmonary Edema in Chest
X-Ray Images | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose and demonstrate machine learning algorithms to assess the severity
of pulmonary edema in chest x-ray images of congestive heart failure patients.
Accurate assessment of pulmonary edema in heart failure is critical when making
treatment and disposition decisions. Our work is grounded in a large-scale
clinic... | [
{
"created": "Wed, 27 Feb 2019 21:03:40 GMT",
"version": "v1"
},
{
"created": "Thu, 4 Apr 2019 14:27:07 GMT",
"version": "v2"
},
{
"created": "Wed, 10 Apr 2019 01:47:21 GMT",
"version": "v3"
}
] | 2019-04-11 | [
[
"Liao",
"Ruizhi",
""
],
[
"Rubin",
"Jonathan",
""
],
[
"Lam",
"Grace",
""
],
[
"Berkowitz",
"Seth",
""
],
[
"Dalal",
"Sandeep",
""
],
[
"Wells",
"William",
""
],
[
"Horng",
"Steven",
""
],
[
"Gollan... | We propose and demonstrate machine learning algorithms to assess the severity of pulmonary edema in chest x-ray images of congestive heart failure patients. Accurate assessment of pulmonary edema in heart failure is critical when making treatment and disposition decisions. Our work is grounded in a large-scale clinical... |
2011.04446 | Tanvirul Alam | Tanvirul Alam, Akib Khan and Firoj Alam | Bangla Text Classification using Transformers | null | null | null | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Text classification has been one of the earliest problems in NLP. Over time
the scope of application areas has broadened and the difficulty of dealing with
new areas (e.g., noisy social media content) has increased. The problem-solving
strategy switched from classical machine learning to deep learning algorithms.
One... | [
{
"created": "Mon, 9 Nov 2020 14:12:07 GMT",
"version": "v1"
}
] | 2020-11-10 | [
[
"Alam",
"Tanvirul",
""
],
[
"Khan",
"Akib",
""
],
[
"Alam",
"Firoj",
""
]
] | Text classification has been one of the earliest problems in NLP. Over time the scope of application areas has broadened and the difficulty of dealing with new areas (e.g., noisy social media content) has increased. The problem-solving strategy switched from classical machine learning to deep learning algorithms. One o... |
1902.03782 | Jianxin Lin | Jianxin Lin, Zhibo Chen, Yingce Xia, Sen Liu, Tao Qin, Jiebo Luo | Exploring Explicit Domain Supervision for Latent Space Disentanglement
in Unpaired Image-to-Image Translation | Accepted by IEEE Transaction on Pattern Analysis and Machine
Intelligence (TPAMI).13 pages, 11 figures, 7 Tables | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Image-to-image translation tasks have been widely investigated with
Generative Adversarial Networks (GANs). However, existing approaches are mostly
designed in an unsupervised manner while little attention has been paid to
domain information within unpaired data. In this paper, we treat domain
information as explicit... | [
{
"created": "Mon, 11 Feb 2019 09:07:30 GMT",
"version": "v1"
},
{
"created": "Tue, 26 Mar 2019 03:22:18 GMT",
"version": "v2"
},
{
"created": "Tue, 1 Oct 2019 02:54:46 GMT",
"version": "v3"
},
{
"created": "Tue, 22 Oct 2019 08:24:52 GMT",
"version": "v4"
}
] | 2019-10-23 | [
[
"Lin",
"Jianxin",
""
],
[
"Chen",
"Zhibo",
""
],
[
"Xia",
"Yingce",
""
],
[
"Liu",
"Sen",
""
],
[
"Qin",
"Tao",
""
],
[
"Luo",
"Jiebo",
""
]
] | Image-to-image translation tasks have been widely investigated with Generative Adversarial Networks (GANs). However, existing approaches are mostly designed in an unsupervised manner while little attention has been paid to domain information within unpaired data. In this paper, we treat domain information as explicit s... |
2203.09596 | Miroslav Bures | Vaclav Rechtberger, Miroslav Bures, Bestoun S. Ahmed, Youcef Belkhier,
Jiri Nema, Hynek Schvach | Prioritized Variable-length Test Cases Generation for Finite State
Machines | Paper accepted at the ITEQS workshop of the 15th IEEE International
Conference on Software Testing, Verification and Validation (ICST) 2022
conference, April 4 - 13, 2022, https://icst2022.vrain.upv.es/. New version -
correction of typo in captions of Table III | null | null | null | cs.SE cs.AI cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Model-based Testing (MBT) is an effective approach for testing when parts of
a system-under-test have the characteristics of a finite state machine (FSM).
Despite various strategies in the literature on this topic, little work exists
to handle special testing situations. More specifically, when concurrently: (1)
the ... | [
{
"created": "Thu, 17 Mar 2022 20:16:45 GMT",
"version": "v1"
},
{
"created": "Sun, 3 Apr 2022 08:34:34 GMT",
"version": "v2"
}
] | 2022-04-05 | [
[
"Rechtberger",
"Vaclav",
""
],
[
"Bures",
"Miroslav",
""
],
[
"Ahmed",
"Bestoun S.",
""
],
[
"Belkhier",
"Youcef",
""
],
[
"Nema",
"Jiri",
""
],
[
"Schvach",
"Hynek",
""
]
] | Model-based Testing (MBT) is an effective approach for testing when parts of a system-under-test have the characteristics of a finite state machine (FSM). Despite various strategies in the literature on this topic, little work exists to handle special testing situations. More specifically, when concurrently: (1) the te... |
2312.10440 | Rhea Sukthanker | Rhea Sanjay Sukthanker, Arjun Krishnakumar, Mahmoud Safari, Frank
Hutter | Weight-Entanglement Meets Gradient-Based Neural Architecture Search | null | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Weight sharing is a fundamental concept in neural architecture search (NAS),
enabling gradient-based methods to explore cell-based architecture spaces
significantly faster than traditional blackbox approaches. In parallel, weight
\emph{entanglement} has emerged as a technique for intricate parameter sharing
among arc... | [
{
"created": "Sat, 16 Dec 2023 13:15:44 GMT",
"version": "v1"
}
] | 2023-12-19 | [
[
"Sukthanker",
"Rhea Sanjay",
""
],
[
"Krishnakumar",
"Arjun",
""
],
[
"Safari",
"Mahmoud",
""
],
[
"Hutter",
"Frank",
""
]
] | Weight sharing is a fundamental concept in neural architecture search (NAS), enabling gradient-based methods to explore cell-based architecture spaces significantly faster than traditional blackbox approaches. In parallel, weight \emph{entanglement} has emerged as a technique for intricate parameter sharing among archi... |
2202.00717 | Tsung-Wei Huang | Cheng-Hsiang Chiu, Tsung-Wei Huang, Zizheng Guo, and Yibo Lin | Pipeflow: An Efficient Task-Parallel Pipeline Programming Framework
using Modern C++ | null | null | null | null | cs.DC | http://creativecommons.org/licenses/by/4.0/ | Pipeline is a fundamental parallel programming pattern. Mainstream pipeline
programming frameworks count on data abstractions to perform pipeline
scheduling. This design is convenient for data-centric pipeline applications
but inefficient for algorithms that only exploit task parallelism in pipeline.
As a result, we ... | [
{
"created": "Tue, 1 Feb 2022 19:16:16 GMT",
"version": "v1"
}
] | 2022-02-03 | [
[
"Chiu",
"Cheng-Hsiang",
""
],
[
"Huang",
"Tsung-Wei",
""
],
[
"Guo",
"Zizheng",
""
],
[
"Lin",
"Yibo",
""
]
] | Pipeline is a fundamental parallel programming pattern. Mainstream pipeline programming frameworks count on data abstractions to perform pipeline scheduling. This design is convenient for data-centric pipeline applications but inefficient for algorithms that only exploit task parallelism in pipeline. As a result, we in... |
2104.06773 | Nermin Samet | Nermin Samet, Samet Hicsonmez, Emre Akbas | HoughNet: Integrating near and long-range evidence for visual detection | accepted to the IEEE Transactions on Pattern Analysis and Machine
Intelligence (TPAMI). arXiv admin note: substantial text overlap with
arXiv:2007.02355 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents HoughNet, a one-stage, anchor-free, voting-based,
bottom-up object detection method. Inspired by the Generalized Hough Transform,
HoughNet determines the presence of an object at a certain location by the sum
of the votes cast on that location. Votes are collected from both near and
long-distance ... | [
{
"created": "Wed, 14 Apr 2021 11:05:29 GMT",
"version": "v1"
},
{
"created": "Wed, 17 Aug 2022 14:58:51 GMT",
"version": "v2"
}
] | 2022-08-19 | [
[
"Samet",
"Nermin",
""
],
[
"Hicsonmez",
"Samet",
""
],
[
"Akbas",
"Emre",
""
]
] | This paper presents HoughNet, a one-stage, anchor-free, voting-based, bottom-up object detection method. Inspired by the Generalized Hough Transform, HoughNet determines the presence of an object at a certain location by the sum of the votes cast on that location. Votes are collected from both near and long-distance lo... |
1706.08461 | Lorenzo Sabattini | Lorenzo Sabattini, Valeria Villani, Julia N. Czerniak, Alexander
Mertens, Cesare Fantuzzi | Methodological Approach for the Design of a Complex Inclusive
Human-Machine System | Proceedings of the IEEE Conference on Automation Science and
Engineering (CASE) 2017 | null | null | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Modern industrial automatic machines and robotic cells are equipped with
highly complex human-machine interfaces (HMIs) that often prevent human
operators from an effective use of the automatic systems. In particular, this
applies to vulnerable users, such as those with low experience or education
level, the elderly ... | [
{
"created": "Mon, 26 Jun 2017 16:30:20 GMT",
"version": "v1"
}
] | 2017-06-27 | [
[
"Sabattini",
"Lorenzo",
""
],
[
"Villani",
"Valeria",
""
],
[
"Czerniak",
"Julia N.",
""
],
[
"Mertens",
"Alexander",
""
],
[
"Fantuzzi",
"Cesare",
""
]
] | Modern industrial automatic machines and robotic cells are equipped with highly complex human-machine interfaces (HMIs) that often prevent human operators from an effective use of the automatic systems. In particular, this applies to vulnerable users, such as those with low experience or education level, the elderly an... |
2111.08164 | Dongran Yu | Dongran Yu, Bo Yang, Dayou Liu, Hui Wang and Shirui Pan | A Survey on Neural-symbolic Learning Systems | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In recent years, neural systems have demonstrated highly effective learning
ability and superior perception intelligence. However, they have been found to
lack effective reasoning and cognitive ability. On the other hand, symbolic
systems exhibit exceptional cognitive intelligence but suffer from poor
learning capabi... | [
{
"created": "Wed, 10 Nov 2021 06:26:40 GMT",
"version": "v1"
},
{
"created": "Sun, 20 Nov 2022 12:01:10 GMT",
"version": "v2"
},
{
"created": "Sun, 25 Jun 2023 01:20:49 GMT",
"version": "v3"
}
] | 2023-06-27 | [
[
"Yu",
"Dongran",
""
],
[
"Yang",
"Bo",
""
],
[
"Liu",
"Dayou",
""
],
[
"Wang",
"Hui",
""
],
[
"Pan",
"Shirui",
""
]
] | In recent years, neural systems have demonstrated highly effective learning ability and superior perception intelligence. However, they have been found to lack effective reasoning and cognitive ability. On the other hand, symbolic systems exhibit exceptional cognitive intelligence but suffer from poor learning capabili... |
1305.7332 | Jan Kr\v{c}\'al | Holger Hermanns, Jan Kr\v{c}\'al, Jan K\v{r}et\'insk\'y | Compositional Verification and Optimization of Interactive Markov Chains | null | null | 10.1007/978-3-642-40184-8_26 | null | cs.LO cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Interactive Markov chains (IMC) are compositional behavioural models
extending labelled transition systems and continuous-time Markov chains. We
provide a framework and algorithms for compositional verification and
optimization of IMC with respect to time-bounded properties. Firstly, we give a
specification formalism... | [
{
"created": "Fri, 31 May 2013 09:18:14 GMT",
"version": "v1"
},
{
"created": "Fri, 7 Jun 2013 09:06:50 GMT",
"version": "v2"
},
{
"created": "Wed, 4 Dec 2013 11:24:55 GMT",
"version": "v3"
}
] | 2013-12-05 | [
[
"Hermanns",
"Holger",
""
],
[
"Krčál",
"Jan",
""
],
[
"Křetínský",
"Jan",
""
]
] | Interactive Markov chains (IMC) are compositional behavioural models extending labelled transition systems and continuous-time Markov chains. We provide a framework and algorithms for compositional verification and optimization of IMC with respect to time-bounded properties. Firstly, we give a specification formalism f... |
2002.06712 | Hossein Boomari | Hossein Boomari Soheila Farokhi | Computing Boundary Cycle of a Pseudo-Triangle Polygon from its
Visibility Graph | null | null | null | null | cs.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Visibility graph of a simple polygon is a graph with the same vertex set in
which there is an edge between a pair of vertices if and only if the segment
through them lies completely inside the polygon. Each pair of adjacent vertices
on the boundary of the polygon are assumed to be visible. Therefore, the
visibility g... | [
{
"created": "Sun, 16 Feb 2020 23:42:08 GMT",
"version": "v1"
}
] | 2020-02-18 | [
[
"Farokhi",
"Hossein Boomari Soheila",
""
]
] | Visibility graph of a simple polygon is a graph with the same vertex set in which there is an edge between a pair of vertices if and only if the segment through them lies completely inside the polygon. Each pair of adjacent vertices on the boundary of the polygon are assumed to be visible. Therefore, the visibility gra... |
2312.06336 | Mohamed Manzour | M. Manzour, A. Ballardini, R. Izquierdo, M. A. Sotelo | Vehicle Lane Change Prediction based on Knowledge Graph Embeddings and
Bayesian Inference | null | null | null | null | cs.LG cs.AI cs.NE | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Prediction of vehicle lane change maneuvers has gained a lot of momentum in
the last few years. Some recent works focus on predicting a vehicle's intention
by predicting its trajectory first. This is not enough, as it ignores the
context of the scene and the state of the surrounding vehicles (as they might
be risky t... | [
{
"created": "Mon, 11 Dec 2023 12:33:44 GMT",
"version": "v1"
}
] | 2023-12-12 | [
[
"Manzour",
"M.",
""
],
[
"Ballardini",
"A.",
""
],
[
"Izquierdo",
"R.",
""
],
[
"Sotelo",
"M. A.",
""
]
] | Prediction of vehicle lane change maneuvers has gained a lot of momentum in the last few years. Some recent works focus on predicting a vehicle's intention by predicting its trajectory first. This is not enough, as it ignores the context of the scene and the state of the surrounding vehicles (as they might be risky to ... |
1208.5933 | Stephan Merz | Denis Cousineau and Damien Doligez and Leslie Lamport and Stephan Merz
and Daniel Ricketts and Hern\'an Vanzetto | TLA+ Proofs | A shorter version of this article appeared in the proceedings of the
conference Formal Methods 2012 (FM 2012, Paris, France, Springer LNCS 7436,
pp. 147-154) | null | null | null | cs.SE cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | TLA+ is a specification language based on standard set theory and temporal
logic that has constructs for hierarchical proofs. We describe how to write
TLA+ proofs and check them with TLAPS, the TLA+ Proof System. We use Peterson's
mutual exclusion algorithm as a simple example to describe the features of
TLAPS and sh... | [
{
"created": "Wed, 29 Aug 2012 14:44:39 GMT",
"version": "v1"
}
] | 2012-08-30 | [
[
"Cousineau",
"Denis",
""
],
[
"Doligez",
"Damien",
""
],
[
"Lamport",
"Leslie",
""
],
[
"Merz",
"Stephan",
""
],
[
"Ricketts",
"Daniel",
""
],
[
"Vanzetto",
"Hernán",
""
]
] | TLA+ is a specification language based on standard set theory and temporal logic that has constructs for hierarchical proofs. We describe how to write TLA+ proofs and check them with TLAPS, the TLA+ Proof System. We use Peterson's mutual exclusion algorithm as a simple example to describe the features of TLAPS and show... |
1706.04719 | Yiqing Guo | Yiqing Guo, Xiuping Jia, and David Paull | Effective Sequential Classifier Training for SVM-based Multitemporal
Remote Sensing Image Classification | null | null | 10.1109/TIP.2018.2808767 | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The explosive availability of remote sensing images has challenged supervised
classification algorithms such as Support Vector Machines (SVM), as training
samples tend to be highly limited due to the expensive and laborious task of
ground truthing. The temporal correlation and spectral similarity between
multitempora... | [
{
"created": "Thu, 15 Jun 2017 02:01:44 GMT",
"version": "v1"
},
{
"created": "Wed, 17 Jan 2018 02:24:47 GMT",
"version": "v2"
}
] | 2018-07-17 | [
[
"Guo",
"Yiqing",
""
],
[
"Jia",
"Xiuping",
""
],
[
"Paull",
"David",
""
]
] | The explosive availability of remote sensing images has challenged supervised classification algorithms such as Support Vector Machines (SVM), as training samples tend to be highly limited due to the expensive and laborious task of ground truthing. The temporal correlation and spectral similarity between multitemporal ... |
1809.00800 | Sho Yokoi | Sho Yokoi, Sosuke Kobayashi, Kenji Fukumizu, Jun Suzuki, Kentaro Inui | Pointwise HSIC: A Linear-Time Kernelized Co-occurrence Norm for Sparse
Linguistic Expressions | Accepted by EMNLP 2018 | EMNLP 2018 | 10.18653/v1/D18-1203 | null | cs.CL stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a new kernel-based co-occurrence measure that can
be applied to sparse linguistic expressions (e.g., sentences) with a very short
learning time, as an alternative to pointwise mutual information (PMI). As well
as deriving PMI from mutual information, we derive this new measure from the
Hilbe... | [
{
"created": "Tue, 4 Sep 2018 05:33:00 GMT",
"version": "v1"
}
] | 2020-10-13 | [
[
"Yokoi",
"Sho",
""
],
[
"Kobayashi",
"Sosuke",
""
],
[
"Fukumizu",
"Kenji",
""
],
[
"Suzuki",
"Jun",
""
],
[
"Inui",
"Kentaro",
""
]
] | In this paper, we propose a new kernel-based co-occurrence measure that can be applied to sparse linguistic expressions (e.g., sentences) with a very short learning time, as an alternative to pointwise mutual information (PMI). As well as deriving PMI from mutual information, we derive this new measure from the Hilbert... |
2407.15283 | Sheila Schoepp | Sheila Schoepp, Mehran Taghian, Shotaro Miwa, Yoshihiro Mitsuka,
Shadan Golestan, Osmar Za\"iane | Enhancing Hardware Fault Tolerance in Machines with Reinforcement
Learning Policy Gradient Algorithms | null | null | null | null | cs.LG cs.AI cs.RO | http://creativecommons.org/licenses/by/4.0/ | Industry is rapidly moving towards fully autonomous and interconnected
systems that can detect and adapt to changing conditions, including machine
hardware faults. Traditional methods for adding hardware fault tolerance to
machines involve duplicating components and algorithmically reconfiguring a
machine's processes... | [
{
"created": "Sun, 21 Jul 2024 22:24:16 GMT",
"version": "v1"
}
] | 2024-07-23 | [
[
"Schoepp",
"Sheila",
""
],
[
"Taghian",
"Mehran",
""
],
[
"Miwa",
"Shotaro",
""
],
[
"Mitsuka",
"Yoshihiro",
""
],
[
"Golestan",
"Shadan",
""
],
[
"Zaïane",
"Osmar",
""
]
] | Industry is rapidly moving towards fully autonomous and interconnected systems that can detect and adapt to changing conditions, including machine hardware faults. Traditional methods for adding hardware fault tolerance to machines involve duplicating components and algorithmically reconfiguring a machine's processes w... |
1709.01008 | Raphael Toledo | Raphael R. Toledo, George Danezis, Isao Echizen | Mix-ORAM: Using delegate shuffles | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Oblivious RAM (ORAM) is a key technology for providing private storage and
querying on untrusted machines but is commonly seen as impractical due to the
high overhead of the re-randomization, called the eviction, the client incurs.
We propose in this work to securely delegate the eviction to semi-trusted third
partie... | [
{
"created": "Mon, 4 Sep 2017 15:45:41 GMT",
"version": "v1"
}
] | 2017-09-05 | [
[
"Toledo",
"Raphael R.",
""
],
[
"Danezis",
"George",
""
],
[
"Echizen",
"Isao",
""
]
] | Oblivious RAM (ORAM) is a key technology for providing private storage and querying on untrusted machines but is commonly seen as impractical due to the high overhead of the re-randomization, called the eviction, the client incurs. We propose in this work to securely delegate the eviction to semi-trusted third parties ... |
1911.07608 | Ali Asgher Mansoor Habiby | Ali Asgher Mansoor Habiby and Ahamed Thoppu | Application of Reinforcement Learning for 5G Scheduling Parameter
Optimization | 7 pages, 11 figures. Complete experiment conducted on a Live 5G
Network and live 5G site | null | null | null | cs.NI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | RF Network parametric optimization requires a wealth of experience and
knowledge to achieve the optimal balance between coverage, capacity, system
efficiency and customer experience from the telecom sites serving the users.
With 5G, the complications of Air interface scheduling have increased due to
the usage of mass... | [
{
"created": "Mon, 21 Oct 2019 16:05:53 GMT",
"version": "v1"
}
] | 2019-11-19 | [
[
"Habiby",
"Ali Asgher Mansoor",
""
],
[
"Thoppu",
"Ahamed",
""
]
] | RF Network parametric optimization requires a wealth of experience and knowledge to achieve the optimal balance between coverage, capacity, system efficiency and customer experience from the telecom sites serving the users. With 5G, the complications of Air interface scheduling have increased due to the usage of massiv... |
2011.13336 | Xidong Mu | Yuanwei Liu and Xidong Mu and Xiao Liu and Marco Di Renzo and Zhiguo
Ding and Robert Schober | Reconfigurable Intelligent Surface (RIS) Aided Multi-User Networks:
Interplay Between NOMA and RIS | 14 pages, 5 figures, 1 table | in IEEE Wireless Communications, vol. 29, no. 2, pp. 169-176,
April 2022 | 10.1109/MWC.102.2100363 | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This article focuses on the exploitation of reconfigurable intelligent
surfaces (RISs) in multi-user networks employing orthogonal multiple access
(OMA) or non-orthogonal multiple access (NOMA), with an emphasis on
investigating the interplay between NOMA and RIS. Depending on whether the RIS
reflection coefficients ... | [
{
"created": "Thu, 26 Nov 2020 15:05:16 GMT",
"version": "v1"
},
{
"created": "Tue, 5 Oct 2021 21:22:02 GMT",
"version": "v2"
}
] | 2022-09-14 | [
[
"Liu",
"Yuanwei",
""
],
[
"Mu",
"Xidong",
""
],
[
"Liu",
"Xiao",
""
],
[
"Di Renzo",
"Marco",
""
],
[
"Ding",
"Zhiguo",
""
],
[
"Schober",
"Robert",
""
]
] | This article focuses on the exploitation of reconfigurable intelligent surfaces (RISs) in multi-user networks employing orthogonal multiple access (OMA) or non-orthogonal multiple access (NOMA), with an emphasis on investigating the interplay between NOMA and RIS. Depending on whether the RIS reflection coefficients ca... |
1605.05546 | Bodhayan Roy | Ajit Arvind Diwan and Bodhayan Roy | Partitions of planar point sets into polygons | null | null | null | null | cs.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we characterize planar point sets that can be partitioned into
disjoint polygons of arbitrarily specified sizes. We provide an algorithm to
construct such a partition, if it exists, in polynomial time. We show that this
problem is equivalent to finding a specified $2$-factor in the visibility graph
of ... | [
{
"created": "Wed, 18 May 2016 12:21:39 GMT",
"version": "v1"
}
] | 2016-05-19 | [
[
"Diwan",
"Ajit Arvind",
""
],
[
"Roy",
"Bodhayan",
""
]
] | In this paper, we characterize planar point sets that can be partitioned into disjoint polygons of arbitrarily specified sizes. We provide an algorithm to construct such a partition, if it exists, in polynomial time. We show that this problem is equivalent to finding a specified $2$-factor in the visibility graph of th... |
2305.13653 | Yang Bai | Yang Bai, Min Cao, Daming Gao, Ziqiang Cao, Chen Chen, Zhenfeng Fan,
Liqiang Nie, Min Zhang | RaSa: Relation and Sensitivity Aware Representation Learning for
Text-based Person Search | Accepted by IJCAI 2023. Code is available at
https://github.com/Flame-Chasers/RaSa | null | 10.24963/ijcai.2023/62 | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Text-based person search aims to retrieve the specified person images given a
textual description. The key to tackling such a challenging task is to learn
powerful multi-modal representations. Towards this, we propose a Relation and
Sensitivity aware representation learning method (RaSa), including two novel
tasks: R... | [
{
"created": "Tue, 23 May 2023 03:53:57 GMT",
"version": "v1"
}
] | 2023-12-04 | [
[
"Bai",
"Yang",
""
],
[
"Cao",
"Min",
""
],
[
"Gao",
"Daming",
""
],
[
"Cao",
"Ziqiang",
""
],
[
"Chen",
"Chen",
""
],
[
"Fan",
"Zhenfeng",
""
],
[
"Nie",
"Liqiang",
""
],
[
"Zhang",
"Min",
"... | Text-based person search aims to retrieve the specified person images given a textual description. The key to tackling such a challenging task is to learn powerful multi-modal representations. Towards this, we propose a Relation and Sensitivity aware representation learning method (RaSa), including two novel tasks: Rel... |
1903.03698 | Vitchyr H. Pong | Vitchyr H. Pong, Murtaza Dalal, Steven Lin, Ashvin Nair, Shikhar Bahl,
Sergey Levine | Skew-Fit: State-Covering Self-Supervised Reinforcement Learning | ICML 2020. 8 pages, 8 figures; 9 pages appendix (6 additional
figures) | null | null | null | cs.LG cs.AI cs.RO stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Autonomous agents that must exhibit flexible and broad capabilities will need
to be equipped with large repertoires of skills. Defining each skill with a
manually-designed reward function limits this repertoire and imposes a manual
engineering burden. Self-supervised agents that set their own goals can
automate this ... | [
{
"created": "Fri, 8 Mar 2019 23:32:17 GMT",
"version": "v1"
},
{
"created": "Fri, 31 May 2019 15:30:20 GMT",
"version": "v2"
},
{
"created": "Sun, 9 Feb 2020 20:24:12 GMT",
"version": "v3"
},
{
"created": "Tue, 4 Aug 2020 04:07:27 GMT",
"version": "v4"
}
] | 2020-08-05 | [
[
"Pong",
"Vitchyr H.",
""
],
[
"Dalal",
"Murtaza",
""
],
[
"Lin",
"Steven",
""
],
[
"Nair",
"Ashvin",
""
],
[
"Bahl",
"Shikhar",
""
],
[
"Levine",
"Sergey",
""
]
] | Autonomous agents that must exhibit flexible and broad capabilities will need to be equipped with large repertoires of skills. Defining each skill with a manually-designed reward function limits this repertoire and imposes a manual engineering burden. Self-supervised agents that set their own goals can automate this pr... |
1112.0805 | Shiqiang Wang Mr. | Shiqiang Wang, Qingyang Song, Lei Guo, Abbas Jamalipour | Constellation Mapping for Physical-Layer Network Coding with M-QAM
Modulation | Final version at IEEE GLOBECOM 2012 | IEEE Global Communications Conference (GLOBECOM) 2012, pp.
4429-4434 | 10.1109/GLOCOM.2012.6503815 | null | cs.IT cs.NI cs.SY math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The denoise-and-forward (DNF) method of physical-layer network coding (PNC)
is a promising approach for wireless relaying networks. In this paper, we
consider DNF-based PNC with M-ary quadrature amplitude modulation (M-QAM) and
propose a mapping scheme that maps the superposed M-QAM signal to coded
symbols. The mappi... | [
{
"created": "Sun, 4 Dec 2011 22:53:46 GMT",
"version": "v1"
},
{
"created": "Sat, 11 May 2013 19:51:23 GMT",
"version": "v2"
}
] | 2013-05-14 | [
[
"Wang",
"Shiqiang",
""
],
[
"Song",
"Qingyang",
""
],
[
"Guo",
"Lei",
""
],
[
"Jamalipour",
"Abbas",
""
]
] | The denoise-and-forward (DNF) method of physical-layer network coding (PNC) is a promising approach for wireless relaying networks. In this paper, we consider DNF-based PNC with M-ary quadrature amplitude modulation (M-QAM) and propose a mapping scheme that maps the superposed M-QAM signal to coded symbols. The mapping... |
1409.1533 | Mizuki Oka | Mizuki Oka and Hirotake Abe and Takashi Ikegami | Dynamic Homeostasis in Packet Switching Networks | 18 pages | null | null | null | cs.NI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this study, we investigate the adaptation and robustness of a packet
switching network (PSN), the fundamental architecture of the Internet. We claim
that the adaptation introduced by a transmission control protocol (TCP)
congestion control mechanism is interpretable as the self-organization of
multiple attractors ... | [
{
"created": "Wed, 3 Sep 2014 00:36:32 GMT",
"version": "v1"
}
] | 2014-09-05 | [
[
"Oka",
"Mizuki",
""
],
[
"Abe",
"Hirotake",
""
],
[
"Ikegami",
"Takashi",
""
]
] | In this study, we investigate the adaptation and robustness of a packet switching network (PSN), the fundamental architecture of the Internet. We claim that the adaptation introduced by a transmission control protocol (TCP) congestion control mechanism is interpretable as the self-organization of multiple attractors an... |
2111.09248 | Joaquin Delgado Fernandez | Joaquin Delgado Fernandez, Sergio Potenciano Menci, Charles Lee,
Gilbert Fridgen | Privacy-preserving Federated Learning for Residential Short Term Load
Forecasting | null | null | 10.1016/j.apenergy.2022.119915 | Applied Energy Volume 326, 15 November 2022, 119915 | cs.LG cs.AI cs.SY eess.SY | http://creativecommons.org/licenses/by-nc-nd/4.0/ | With high levels of intermittent power generation and dynamic demand
patterns, accurate forecasts for residential loads have become essential. Smart
meters can play an important role when making these forecasts as they provide
detailed load data. However, using smart meter data for load forecasting is
challenging due... | [
{
"created": "Wed, 17 Nov 2021 17:27:59 GMT",
"version": "v1"
},
{
"created": "Fri, 10 Dec 2021 10:18:10 GMT",
"version": "v2"
},
{
"created": "Fri, 16 Sep 2022 10:10:37 GMT",
"version": "v3"
},
{
"created": "Mon, 19 Sep 2022 09:00:42 GMT",
"version": "v4"
}
] | 2022-09-20 | [
[
"Fernandez",
"Joaquin Delgado",
""
],
[
"Menci",
"Sergio Potenciano",
""
],
[
"Lee",
"Charles",
""
],
[
"Fridgen",
"Gilbert",
""
]
] | With high levels of intermittent power generation and dynamic demand patterns, accurate forecasts for residential loads have become essential. Smart meters can play an important role when making these forecasts as they provide detailed load data. However, using smart meter data for load forecasting is challenging due t... |
1812.07989 | Xiaodan Zhang | Xiaodan Zhang, Xinbo Gao, Wen Lu, and Lihuo He | A Gated Peripheral-Foveal Convolutional Neural Network for Unified Image
Aesthetic Prediction | Add more experiments | null | null | null | cs.CV eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Learning fine-grained details is a key issue in image aesthetic assessment.
Most of the previous methods extract the fine-grained details via random
cropping strategy, which may undermine the integrity of semantic information.
Extensive studies show that humans perceive fine-grained details with a mixture
of foveal v... | [
{
"created": "Wed, 19 Dec 2018 14:57:06 GMT",
"version": "v1"
},
{
"created": "Wed, 26 Jun 2019 08:04:30 GMT",
"version": "v2"
}
] | 2019-06-27 | [
[
"Zhang",
"Xiaodan",
""
],
[
"Gao",
"Xinbo",
""
],
[
"Lu",
"Wen",
""
],
[
"He",
"Lihuo",
""
]
] | Learning fine-grained details is a key issue in image aesthetic assessment. Most of the previous methods extract the fine-grained details via random cropping strategy, which may undermine the integrity of semantic information. Extensive studies show that humans perceive fine-grained details with a mixture of foveal vis... |
2403.12273 | Linus Nwankwo | Linus Nwankwo and Elmar Rueckert | Multimodal Human-Autonomous Agents Interaction Using Pre-Trained
Language and Visual Foundation Models | null | null | null | null | cs.RO | http://creativecommons.org/licenses/by/4.0/ | In this paper, we extended the method proposed in [17] to enable humans to
interact naturally with autonomous agents through vocal and textual
conversations. Our extended method exploits the inherent capabilities of
pre-trained large language models (LLMs), multimodal visual language models
(VLMs), and speech recogni... | [
{
"created": "Mon, 18 Mar 2024 21:41:09 GMT",
"version": "v1"
}
] | 2024-03-20 | [
[
"Nwankwo",
"Linus",
""
],
[
"Rueckert",
"Elmar",
""
]
] | In this paper, we extended the method proposed in [17] to enable humans to interact naturally with autonomous agents through vocal and textual conversations. Our extended method exploits the inherent capabilities of pre-trained large language models (LLMs), multimodal visual language models (VLMs), and speech recogniti... |
1406.4077 | Ma\"el Le Treust | Ma\"el Le Treust | Joint Empirical Coordination of Source and Channel | accepted to IEEE Trans. on IT | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In a decentralized and self-configuring network, the communication devices
are considered as autonomous decision-makers that sense their environment and
that implement optimal transmission schemes. It is essential that these
autonomous devices cooperate and coordinate their actions, to ensure the
reliability of the t... | [
{
"created": "Mon, 16 Jun 2014 17:29:56 GMT",
"version": "v1"
},
{
"created": "Wed, 18 Jun 2014 07:37:01 GMT",
"version": "v2"
},
{
"created": "Fri, 2 Jun 2017 09:15:32 GMT",
"version": "v3"
}
] | 2017-06-05 | [
[
"Treust",
"Maël Le",
""
]
] | In a decentralized and self-configuring network, the communication devices are considered as autonomous decision-makers that sense their environment and that implement optimal transmission schemes. It is essential that these autonomous devices cooperate and coordinate their actions, to ensure the reliability of the tra... |
1612.02900 | Tarik Kazaz | Tarik Kazaz, Xianjun Jiao, Merima Kulin, Ingrid Moerman | Demo: WiSCoP - Wireless Sensor Communication Prototyping Platform | 2 pages, 2 figures, to be published in the EWSN'17 Proceedings of the
2017 International Conference on Embedded Wireless Systems and Networks,
Uppsala, Sweden - February 20-22, 2017 | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | To enhance system performance of future heterogeneous wireless networks the
co-design of PHY, MAC, and higher layer protocols is inevitable. In this work,
we present WiSCoP - a novel embedded platform for experimentation, prototyping
and implementation of integrated cross-layer network design approaches. WiSCoP
is bu... | [
{
"created": "Fri, 9 Dec 2016 03:44:14 GMT",
"version": "v1"
},
{
"created": "Thu, 5 Jan 2017 15:27:58 GMT",
"version": "v2"
}
] | 2017-01-06 | [
[
"Kazaz",
"Tarik",
""
],
[
"Jiao",
"Xianjun",
""
],
[
"Kulin",
"Merima",
""
],
[
"Moerman",
"Ingrid",
""
]
] | To enhance system performance of future heterogeneous wireless networks the co-design of PHY, MAC, and higher layer protocols is inevitable. In this work, we present WiSCoP - a novel embedded platform for experimentation, prototyping and implementation of integrated cross-layer network design approaches. WiSCoP is buil... |
2403.01059 | Ryan Gardner | Noah Ford, Ryan W. Gardner, Austin Juhl, and Nathan Larson | Continuous Mean-Zero Disagreement-Regularized Imitation Learning
(CMZ-DRIL) | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Machine-learning paradigms such as imitation learning and reinforcement
learning can generate highly performant agents in a variety of complex
environments. However, commonly used methods require large quantities of data
and/or a known reward function. This paper presents a method called Continuous
Mean-Zero Disagree... | [
{
"created": "Sat, 2 Mar 2024 01:40:37 GMT",
"version": "v1"
}
] | 2024-03-05 | [
[
"Ford",
"Noah",
""
],
[
"Gardner",
"Ryan W.",
""
],
[
"Juhl",
"Austin",
""
],
[
"Larson",
"Nathan",
""
]
] | Machine-learning paradigms such as imitation learning and reinforcement learning can generate highly performant agents in a variety of complex environments. However, commonly used methods require large quantities of data and/or a known reward function. This paper presents a method called Continuous Mean-Zero Disagreeme... |
cs/0506049 | Bernard Jacquemin | Caroline Brun (XRCE), Bernard Jacquemin (ISC, XRCE), Fr\'ed\'erique
Segond (XRCE) | Exploitation de dictionnaires \'{e}lectroniques pour la
d\'{e}sambigu\"{i}sation s\'{e}mantique lexicale | 25 pp | Traitement Automatique des Langues (TAL) 42, no. 3 (2001) pp.
667-690 | null | null | cs.DL | null | This paper presents a lexical disambiguation system, initially developed for
English and now adapted to French. This system associates a word with its
meaning in a given context using electronic dictionaries as semantically
annotated corpora in order to extract semantic disambiguation rules. We
describe the rule extr... | [
{
"created": "Sun, 12 Jun 2005 16:48:33 GMT",
"version": "v1"
}
] | 2016-08-16 | [
[
"Brun",
"Caroline",
"",
"XRCE"
],
[
"Jacquemin",
"Bernard",
"",
"ISC, XRCE"
],
[
"Segond",
"Frédérique",
"",
"XRCE"
]
] | This paper presents a lexical disambiguation system, initially developed for English and now adapted to French. This system associates a word with its meaning in a given context using electronic dictionaries as semantically annotated corpora in order to extract semantic disambiguation rules. We describe the rule extrac... |
1303.1285 | Animesh Kumar | Animesh Kumar | Bandlimited Signal Reconstruction From the Distribution of Unknown
Sampling Locations | Submitted to SampTA 2013 workshop | null | 10.1109/TSP.2015.2394248 | null | cs.IT math.IT math.ST stat.TH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the reconstruction of bandlimited fields from samples taken at
unknown but statistically distributed sampling locations. The setup is
motivated by distributed sampling where precise knowledge of sensor locations
can be difficult.
Periodic one-dimensional bandlimited fields are considered for sampling.
Perf... | [
{
"created": "Wed, 6 Mar 2013 09:39:09 GMT",
"version": "v1"
}
] | 2017-07-12 | [
[
"Kumar",
"Animesh",
""
]
] | We study the reconstruction of bandlimited fields from samples taken at unknown but statistically distributed sampling locations. The setup is motivated by distributed sampling where precise knowledge of sensor locations can be difficult. Periodic one-dimensional bandlimited fields are considered for sampling. Perfect ... |
1909.05042 | Seyedrebvar Hosseini | Seyedrebvar Hosseini, Burak Turhan | Iterative versus Exhaustive Data Selection for Cross Project Defect
Prediction: An Extended Replication Study | Conducting a major revision based on the feedback from the Empirical
Software Engineering Journal | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Context: The effectiveness of data selection approaches in improving the
performance of cross project defect prediction(CPDP) has been shown in multiple
previous studies. Beside that, replication studies play an important role in
the support of any valid study. Repeating a study using the same or different
subjects c... | [
{
"created": "Wed, 11 Sep 2019 13:32:09 GMT",
"version": "v1"
},
{
"created": "Tue, 21 Apr 2020 09:49:36 GMT",
"version": "v2"
}
] | 2020-04-22 | [
[
"Hosseini",
"Seyedrebvar",
""
],
[
"Turhan",
"Burak",
""
]
] | Context: The effectiveness of data selection approaches in improving the performance of cross project defect prediction(CPDP) has been shown in multiple previous studies. Beside that, replication studies play an important role in the support of any valid study. Repeating a study using the same or different subjects can... |
1309.7145 | Pierre Flener | Nicolas Beldiceanu, Pierre Flener, Justin Pearson, Pascal Van
Hentenryck | Propagating Regular Counting Constraints | Includes a SICStus Prolog source file with the propagator | null | null | null | cs.AI cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Constraints over finite sequences of variables are ubiquitous in sequencing
and timetabling. Moreover, the wide variety of such constraints in practical
applications led to general modelling techniques and generic propagation
algorithms, often based on deterministic finite automata (DFA) and their
extensions. We cons... | [
{
"created": "Fri, 27 Sep 2013 08:23:52 GMT",
"version": "v1"
}
] | 2013-09-30 | [
[
"Beldiceanu",
"Nicolas",
""
],
[
"Flener",
"Pierre",
""
],
[
"Pearson",
"Justin",
""
],
[
"Van Hentenryck",
"Pascal",
""
]
] | Constraints over finite sequences of variables are ubiquitous in sequencing and timetabling. Moreover, the wide variety of such constraints in practical applications led to general modelling techniques and generic propagation algorithms, often based on deterministic finite automata (DFA) and their extensions. We consid... |
2310.02046 | Michel Nass | Michel Nass, Emil Alegroth, Robert Feldt | Improving web element localization by using a large language model | null | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Web-based test automation heavily relies on accurately finding web elements.
Traditional methods compare attributes but don't grasp the context and meaning
of elements and words. The emergence of Large Language Models (LLMs) like
GPT-4, which can show human-like reasoning abilities on some tasks, offers new
opportuni... | [
{
"created": "Tue, 3 Oct 2023 13:39:22 GMT",
"version": "v1"
}
] | 2023-10-04 | [
[
"Nass",
"Michel",
""
],
[
"Alegroth",
"Emil",
""
],
[
"Feldt",
"Robert",
""
]
] | Web-based test automation heavily relies on accurately finding web elements. Traditional methods compare attributes but don't grasp the context and meaning of elements and words. The emergence of Large Language Models (LLMs) like GPT-4, which can show human-like reasoning abilities on some tasks, offers new opportuniti... |
1901.05344 | Georg Hager | Francesco Cremonesi, Georg Hager, Gerhard Wellein, Felix Sch\"urmann | Analytic Performance Modeling and Analysis of Detailed Neuron
Simulations | 18 pages, 6 figures, 15 tables | null | 10.1177/1094342020912528 | null | cs.PF cs.CE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Big science initiatives are trying to reconstruct and model the brain by
attempting to simulate brain tissue at larger scales and with increasingly more
biological detail than previously thought possible. The exponential growth of
parallel computer performance has been supporting these developments, and at
the same t... | [
{
"created": "Wed, 16 Jan 2019 15:28:06 GMT",
"version": "v1"
}
] | 2020-06-25 | [
[
"Cremonesi",
"Francesco",
""
],
[
"Hager",
"Georg",
""
],
[
"Wellein",
"Gerhard",
""
],
[
"Schürmann",
"Felix",
""
]
] | Big science initiatives are trying to reconstruct and model the brain by attempting to simulate brain tissue at larger scales and with increasingly more biological detail than previously thought possible. The exponential growth of parallel computer performance has been supporting these developments, and at the same tim... |
1111.1093 | Sabu Thampi m | Sabu M. Thampi, Ann Jisma Jacob | Securing Biometric Images using Reversible Watermarking | 8 pages, 7 figures | International Journal of Image Processing (IJIP), Volume:
5,Issue:4, September/October 2011 | null | null | cs.CV cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Biometric security is a fast growing area. Protecting biometric data is very
important since it can be misused by attackers. In order to increase security
of biometric data there are different methods in which watermarking is widely
accepted. A more acceptable, new important development in this area is
reversible wat... | [
{
"created": "Fri, 4 Nov 2011 10:50:45 GMT",
"version": "v1"
}
] | 2011-11-07 | [
[
"Thampi",
"Sabu M.",
""
],
[
"Jacob",
"Ann Jisma",
""
]
] | Biometric security is a fast growing area. Protecting biometric data is very important since it can be misused by attackers. In order to increase security of biometric data there are different methods in which watermarking is widely accepted. A more acceptable, new important development in this area is reversible water... |
1807.08512 | Muhammad Kamran Janjua | Alessandro Calefati, Muhammad Kamran Janjua, Shah Nawaz, Ignazio Gallo | Git Loss for Deep Face Recognition | 12 pages. Accepted at BMVC2018 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Convolutional Neural Networks (CNNs) have been widely used in computer vision
tasks, such as face recognition and verification, and have achieved
state-of-the-art results due to their ability to capture discriminative deep
features. Conventionally, CNNs have been trained with softmax as supervision
signal to penalize... | [
{
"created": "Mon, 23 Jul 2018 10:20:29 GMT",
"version": "v1"
},
{
"created": "Tue, 24 Jul 2018 14:31:38 GMT",
"version": "v2"
},
{
"created": "Thu, 26 Jul 2018 10:21:28 GMT",
"version": "v3"
},
{
"created": "Sat, 28 Jul 2018 17:29:04 GMT",
"version": "v4"
}
] | 2018-07-31 | [
[
"Calefati",
"Alessandro",
""
],
[
"Janjua",
"Muhammad Kamran",
""
],
[
"Nawaz",
"Shah",
""
],
[
"Gallo",
"Ignazio",
""
]
] | Convolutional Neural Networks (CNNs) have been widely used in computer vision tasks, such as face recognition and verification, and have achieved state-of-the-art results due to their ability to capture discriminative deep features. Conventionally, CNNs have been trained with softmax as supervision signal to penalize t... |
1402.3547 | Meirav Zehavi | Hadas Shachnai, Meirav Zehavi | Representative Families: A Unified Tradeoff-Based Approach | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Let $M=(E,{\cal I})$ be a matroid, and let $\cal S$ be a family of subsets of
size $p$ of $E$. A subfamily $\widehat{\cal S}\subseteq{\cal S}$ represents
${\cal S}$ if for every pair of sets $X\in{\cal S}$ and $Y\subseteq E\setminus
X$ such that $X\cup Y\in{\cal I}$, there is a set $\widehat{X}\in\widehat{\cal
S}$ di... | [
{
"created": "Fri, 14 Feb 2014 18:32:15 GMT",
"version": "v1"
},
{
"created": "Sat, 19 Apr 2014 17:46:10 GMT",
"version": "v2"
}
] | 2014-04-22 | [
[
"Shachnai",
"Hadas",
""
],
[
"Zehavi",
"Meirav",
""
]
] | Let $M=(E,{\cal I})$ be a matroid, and let $\cal S$ be a family of subsets of size $p$ of $E$. A subfamily $\widehat{\cal S}\subseteq{\cal S}$ represents ${\cal S}$ if for every pair of sets $X\in{\cal S}$ and $Y\subseteq E\setminus X$ such that $X\cup Y\in{\cal I}$, there is a set $\widehat{X}\in\widehat{\cal S}$ disj... |
1803.09867 | Liang Lin | Keze Wang and Xiaopeng Yan and Dongyu Zhang and Lei Zhang and Liang
Lin | Towards Human-Machine Cooperation: Self-supervised Sample Mining for
Object Detection | We enabled to mine from unlabeled or partially labeled data to boost
object detection (Accepted by CVPR 2018) The source code is available at
http://kezewang.com/codes/SSM_CVPR.zip | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Though quite challenging, leveraging large-scale unlabeled or partially
labeled images in a cost-effective way has increasingly attracted interests for
its great importance to computer vision. To tackle this problem, many Active
Learning (AL) methods have been developed. However, these methods mainly define
their sam... | [
{
"created": "Tue, 27 Mar 2018 03:06:51 GMT",
"version": "v1"
},
{
"created": "Thu, 24 May 2018 11:59:38 GMT",
"version": "v2"
}
] | 2018-05-25 | [
[
"Wang",
"Keze",
""
],
[
"Yan",
"Xiaopeng",
""
],
[
"Zhang",
"Dongyu",
""
],
[
"Zhang",
"Lei",
""
],
[
"Lin",
"Liang",
""
]
] | Though quite challenging, leveraging large-scale unlabeled or partially labeled images in a cost-effective way has increasingly attracted interests for its great importance to computer vision. To tackle this problem, many Active Learning (AL) methods have been developed. However, these methods mainly define their sampl... |
1801.01715 | Luca Baldesi | Luca Baldesi and Athina Markopoulou and Carter T. Butts | Spectral Graph Forge: Graph Generation Targeting Modularity | null | null | null | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Community structure is an important property that captures inhomogeneities
common in large networks, and modularity is one of the most widely used metrics
for such community structure. In this paper, we introduce a principled
methodology, the Spectral Graph Forge, for generating random graphs that
preserves community... | [
{
"created": "Fri, 5 Jan 2018 11:11:20 GMT",
"version": "v1"
}
] | 2018-01-08 | [
[
"Baldesi",
"Luca",
""
],
[
"Markopoulou",
"Athina",
""
],
[
"Butts",
"Carter T.",
""
]
] | Community structure is an important property that captures inhomogeneities common in large networks, and modularity is one of the most widely used metrics for such community structure. In this paper, we introduce a principled methodology, the Spectral Graph Forge, for generating random graphs that preserves community s... |
2403.18845 | Abdelghani MADDI | Abdelghani Maddi (GEMASS), Luis Miotti (CEPN) | On The Peer Review Reports: Does Size Matter? | arXiv admin note: substantial text overlap with arXiv:2309.02000 | Scientometrics (2024) | 10.1007/s11192-024-04977-6 | null | cs.DL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Amidst the ever-expanding realm of scientific production and the
proliferation of predatory journals, the focus on peer review remains paramount
for scientometricians and sociologists of science. Despite this attention,
there is a notable scarcity of empirical investigations into the tangible
impact of peer review on... | [
{
"created": "Thu, 7 Mar 2024 08:54:26 GMT",
"version": "v1"
}
] | 2024-03-29 | [
[
"Maddi",
"Abdelghani",
"",
"GEMASS"
],
[
"Miotti",
"Luis",
"",
"CEPN"
]
] | Amidst the ever-expanding realm of scientific production and the proliferation of predatory journals, the focus on peer review remains paramount for scientometricians and sociologists of science. Despite this attention, there is a notable scarcity of empirical investigations into the tangible impact of peer review on p... |
1708.09221 | Jonathan Klawitter | Jonathan Klawitter, Tamara Mchedlidze, Martin N\"ollenburg | Experimental Evaluation of Book Drawing Algorithms | Appears in the Proceedings of the 25th International Symposium on
Graph Drawing and Network Visualization (GD 2017) | null | null | null | cs.DS cs.CG cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A $k$-page book drawing of a graph $G=(V,E)$ consists of a linear ordering of
its vertices along a spine and an assignment of each edge to one of the $k$
pages, which are half-planes bounded by the spine. In a book drawing, two edges
cross if and only if they are assigned to the same page and their vertices
alternate... | [
{
"created": "Wed, 30 Aug 2017 11:35:20 GMT",
"version": "v1"
}
] | 2017-08-31 | [
[
"Klawitter",
"Jonathan",
""
],
[
"Mchedlidze",
"Tamara",
""
],
[
"Nöllenburg",
"Martin",
""
]
] | A $k$-page book drawing of a graph $G=(V,E)$ consists of a linear ordering of its vertices along a spine and an assignment of each edge to one of the $k$ pages, which are half-planes bounded by the spine. In a book drawing, two edges cross if and only if they are assigned to the same page and their vertices alternate a... |
2011.08733 | Amruta Yelamanchili | Jagriti Agrawal and Amruta Yelamanchili and Steve Chien | Using Explainable Scheduling for the Mars 2020 Rover Mission | Submitted to the International Workshop of Explainable AI Planning
(XAIP) at the International Conference on Automated Planning and Scheduling
(ICAPS) 2020 | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Understanding the reasoning behind the behavior of an automated scheduling
system is essential to ensure that it will be trusted and consequently used to
its full capabilities in critical applications. In cases where a scheduler
schedules activities in an invalid location, it is usually easy for the user to
infer the... | [
{
"created": "Tue, 17 Nov 2020 16:10:49 GMT",
"version": "v1"
}
] | 2020-11-18 | [
[
"Agrawal",
"Jagriti",
""
],
[
"Yelamanchili",
"Amruta",
""
],
[
"Chien",
"Steve",
""
]
] | Understanding the reasoning behind the behavior of an automated scheduling system is essential to ensure that it will be trusted and consequently used to its full capabilities in critical applications. In cases where a scheduler schedules activities in an invalid location, it is usually easy for the user to infer the m... |
2111.11103 | Florian Fervers | Florian Fervers, Timo Breuer, Gregor Stachowiak, Sebastian Bullinger,
Christoph Bodensteiner, Michael Arens | Improving Semantic Image Segmentation via Label Fusion in Semantically
Textured Meshes | null | null | 10.5220/0010841800003124 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Models for semantic segmentation require a large amount of hand-labeled
training data which is costly and time-consuming to produce. For this purpose,
we present a label fusion framework that is capable of improving semantic pixel
labels of video sequences in an unsupervised manner. We make use of a 3D mesh
represent... | [
{
"created": "Mon, 22 Nov 2021 10:47:32 GMT",
"version": "v1"
}
] | 2022-02-25 | [
[
"Fervers",
"Florian",
""
],
[
"Breuer",
"Timo",
""
],
[
"Stachowiak",
"Gregor",
""
],
[
"Bullinger",
"Sebastian",
""
],
[
"Bodensteiner",
"Christoph",
""
],
[
"Arens",
"Michael",
""
]
] | Models for semantic segmentation require a large amount of hand-labeled training data which is costly and time-consuming to produce. For this purpose, we present a label fusion framework that is capable of improving semantic pixel labels of video sequences in an unsupervised manner. We make use of a 3D mesh representat... |
1910.08753 | Zhenzhong Wang | Zhenzhong Wang, Min Jiang, Xing Gao, Liang Feng, Weizhen Hu, Kay Chen
Tan | Evolutionary Dynamic Multi-objective Optimization Via Regression
Transfer Learning | null | null | null | null | cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Dynamic multi-objective optimization problems (DMOPs) remain a challenge to
be settled, because of conflicting objective functions change over time. In
recent years, transfer learning has been proven to be a kind of effective
approach in solving DMOPs. In this paper, a novel transfer learning based
dynamic multi-obje... | [
{
"created": "Sat, 19 Oct 2019 11:29:52 GMT",
"version": "v1"
},
{
"created": "Tue, 22 Oct 2019 04:35:43 GMT",
"version": "v2"
}
] | 2019-10-23 | [
[
"Wang",
"Zhenzhong",
""
],
[
"Jiang",
"Min",
""
],
[
"Gao",
"Xing",
""
],
[
"Feng",
"Liang",
""
],
[
"Hu",
"Weizhen",
""
],
[
"Tan",
"Kay Chen",
""
]
] | Dynamic multi-objective optimization problems (DMOPs) remain a challenge to be settled, because of conflicting objective functions change over time. In recent years, transfer learning has been proven to be a kind of effective approach in solving DMOPs. In this paper, a novel transfer learning based dynamic multi-object... |
2306.10944 | Dong Xing | Dong Xing, Pengjie Gu, Qian Zheng, Xinrun Wang, Shanqi Liu, Longtao
Zheng, Bo An, Gang Pan | Controlling Type Confounding in Ad Hoc Teamwork with Instance-wise
Teammate Feedback Rectification | Accepted by ICML 2023 | null | null | null | cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Ad hoc teamwork requires an agent to cooperate with unknown teammates without
prior coordination. Many works propose to abstract teammate instances into
high-level representation of types and then pre-train the best response for
each type. However, most of them do not consider the distribution of teammate
instances w... | [
{
"created": "Mon, 19 Jun 2023 14:03:39 GMT",
"version": "v1"
}
] | 2023-06-21 | [
[
"Xing",
"Dong",
""
],
[
"Gu",
"Pengjie",
""
],
[
"Zheng",
"Qian",
""
],
[
"Wang",
"Xinrun",
""
],
[
"Liu",
"Shanqi",
""
],
[
"Zheng",
"Longtao",
""
],
[
"An",
"Bo",
""
],
[
"Pan",
"Gang",
""... | Ad hoc teamwork requires an agent to cooperate with unknown teammates without prior coordination. Many works propose to abstract teammate instances into high-level representation of types and then pre-train the best response for each type. However, most of them do not consider the distribution of teammate instances wit... |
1805.09786 | \c{C}a\u{g}lar G\"ul\c{c}ehre | Caglar Gulcehre, Misha Denil, Mateusz Malinowski, Ali Razavi, Razvan
Pascanu, Karl Moritz Hermann, Peter Battaglia, Victor Bapst, David Raposo,
Adam Santoro, Nando de Freitas | Hyperbolic Attention Networks | null | null | null | null | cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce hyperbolic attention networks to endow neural networks with
enough capacity to match the complexity of data with hierarchical and power-law
structure. A few recent approaches have successfully demonstrated the benefits
of imposing hyperbolic geometry on the parameters of shallow networks. We
extend this ... | [
{
"created": "Thu, 24 May 2018 17:11:35 GMT",
"version": "v1"
}
] | 2018-05-25 | [
[
"Gulcehre",
"Caglar",
""
],
[
"Denil",
"Misha",
""
],
[
"Malinowski",
"Mateusz",
""
],
[
"Razavi",
"Ali",
""
],
[
"Pascanu",
"Razvan",
""
],
[
"Hermann",
"Karl Moritz",
""
],
[
"Battaglia",
"Peter",
""
],... | We introduce hyperbolic attention networks to endow neural networks with enough capacity to match the complexity of data with hierarchical and power-law structure. A few recent approaches have successfully demonstrated the benefits of imposing hyperbolic geometry on the parameters of shallow networks. We extend this li... |
1806.03743 | Sabrina Mielke | Ryan Cotterell, Sabrina J. Mielke, Jason Eisner, Brian Roark | Are All Languages Equally Hard to Language-Model? | Published at NAACL 2018 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For general modeling methods applied to diverse languages, a natural question
is: how well should we expect our models to work on languages with differing
typological profiles? In this work, we develop an evaluation framework for fair
cross-linguistic comparison of language models, using translated text so that
all m... | [
{
"created": "Sun, 10 Jun 2018 23:24:33 GMT",
"version": "v1"
},
{
"created": "Tue, 25 Feb 2020 18:30:29 GMT",
"version": "v2"
}
] | 2020-02-26 | [
[
"Cotterell",
"Ryan",
""
],
[
"Mielke",
"Sabrina J.",
""
],
[
"Eisner",
"Jason",
""
],
[
"Roark",
"Brian",
""
]
] | For general modeling methods applied to diverse languages, a natural question is: how well should we expect our models to work on languages with differing typological profiles? In this work, we develop an evaluation framework for fair cross-linguistic comparison of language models, using translated text so that all mod... |
1802.06894 | Kejun Huang | Kejun Huang, Xiao Fu, Nicholas D. Sidiropoulos | Learning Hidden Markov Models from Pairwise Co-occurrences with
Application to Topic Modeling | ICML 2018 | null | null | null | cs.CL cs.LG eess.SP stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a new algorithm for identifying the transition and emission
probabilities of a hidden Markov model (HMM) from the emitted data.
Expectation-maximization becomes computationally prohibitive for long
observation records, which are often required for identification. The new
algorithm is particularly suitable ... | [
{
"created": "Mon, 19 Feb 2018 22:33:56 GMT",
"version": "v1"
},
{
"created": "Mon, 18 Jun 2018 21:15:46 GMT",
"version": "v2"
}
] | 2018-06-20 | [
[
"Huang",
"Kejun",
""
],
[
"Fu",
"Xiao",
""
],
[
"Sidiropoulos",
"Nicholas D.",
""
]
] | We present a new algorithm for identifying the transition and emission probabilities of a hidden Markov model (HMM) from the emitted data. Expectation-maximization becomes computationally prohibitive for long observation records, which are often required for identification. The new algorithm is particularly suitable fo... |
2102.05007 | Matan Eyal | Matan Eyal, Asaf Amrami, Hillel Taub-Tabib, Yoav Goldberg | Bootstrapping Relation Extractors using Syntactic Search by Examples | EACL 2021 | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | The advent of neural-networks in NLP brought with it substantial improvements
in supervised relation extraction. However, obtaining a sufficient quantity of
training data remains a key challenge. In this work we propose a process for
bootstrapping training datasets which can be performed quickly by
non-NLP-experts. W... | [
{
"created": "Tue, 9 Feb 2021 18:17:59 GMT",
"version": "v1"
}
] | 2021-02-10 | [
[
"Eyal",
"Matan",
""
],
[
"Amrami",
"Asaf",
""
],
[
"Taub-Tabib",
"Hillel",
""
],
[
"Goldberg",
"Yoav",
""
]
] | The advent of neural-networks in NLP brought with it substantial improvements in supervised relation extraction. However, obtaining a sufficient quantity of training data remains a key challenge. In this work we propose a process for bootstrapping training datasets which can be performed quickly by non-NLP-experts. We ... |
2306.14790 | Tianchen Yang | Tianchen Yang, Qifan Zhang, Zhaoyang Sun, and Yubo Hou | Automatic Assessment of Divergent Thinking in Chinese Language with
TransDis: A Transformer-Based Language Model Approach | null | null | 10.3758/s13428-023-02313-z | null | cs.CL stat.AP | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Language models have been increasingly popular for automatic creativity
assessment, generating semantic distances to objectively measure the quality of
creative ideas. However, there is currently a lack of an automatic assessment
system for evaluating creative ideas in the Chinese language. To address this
gap, we de... | [
{
"created": "Mon, 26 Jun 2023 15:48:05 GMT",
"version": "v1"
},
{
"created": "Thu, 19 Oct 2023 00:55:28 GMT",
"version": "v2"
},
{
"created": "Sun, 24 Dec 2023 15:08:59 GMT",
"version": "v3"
}
] | 2023-12-27 | [
[
"Yang",
"Tianchen",
""
],
[
"Zhang",
"Qifan",
""
],
[
"Sun",
"Zhaoyang",
""
],
[
"Hou",
"Yubo",
""
]
] | Language models have been increasingly popular for automatic creativity assessment, generating semantic distances to objectively measure the quality of creative ideas. However, there is currently a lack of an automatic assessment system for evaluating creative ideas in the Chinese language. To address this gap, we deve... |
1107.4893 | Zeev Nutov | Nachshon Cohen and Zeev Nutov | Approximating minimum-power edge-multicovers | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Given a graph with edge costs, the {\em power} of a node is themaximum cost
of an edge incident to it, and the power of a graph is the sum of the powers of
its nodes. Motivated by applications in wireless networks, we consider the
following fundamental problem in wireless network design. Given a graph
$G=(V,E)$ with ... | [
{
"created": "Mon, 25 Jul 2011 11:07:16 GMT",
"version": "v1"
}
] | 2011-07-26 | [
[
"Cohen",
"Nachshon",
""
],
[
"Nutov",
"Zeev",
""
]
] | Given a graph with edge costs, the {\em power} of a node is themaximum cost of an edge incident to it, and the power of a graph is the sum of the powers of its nodes. Motivated by applications in wireless networks, we consider the following fundamental problem in wireless network design. Given a graph $G=(V,E)$ with ed... |
1602.08132 | Zhenhao Ge | Zhenhao Ge, Sudhendu R. Sharma, Mark J. T. Smith | Adaptive Frequency Cepstral Coefficients for Word Mispronunciation
Detection | 4th International Congress on Image and Signal Processing (CISP) 2011 | null | 10.1109/CISP.2011.6100685 | null | cs.SD cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Systems based on automatic speech recognition (ASR) technology can provide
important functionality in computer assisted language learning applications.
This is a young but growing area of research motivated by the large number of
students studying foreign languages. Here we propose a Hidden Markov Model
(HMM)-based m... | [
{
"created": "Thu, 25 Feb 2016 22:17:31 GMT",
"version": "v1"
}
] | 2016-02-29 | [
[
"Ge",
"Zhenhao",
""
],
[
"Sharma",
"Sudhendu R.",
""
],
[
"Smith",
"Mark J. T.",
""
]
] | Systems based on automatic speech recognition (ASR) technology can provide important functionality in computer assisted language learning applications. This is a young but growing area of research motivated by the large number of students studying foreign languages. Here we propose a Hidden Markov Model (HMM)-based met... |
2205.12850 | Alexander Lindermayr | Giulia Bernardini, Alexander Lindermayr, Alberto Marchetti-Spaccamela,
Nicole Megow, Leen Stougie, Michelle Sweering | A Universal Error Measure for Input Predictions Applied to Online Graph
Problems | To appear in NeurIPS 2022 | null | null | null | cs.DS cs.LG | http://creativecommons.org/licenses/by/4.0/ | We introduce a novel measure for quantifying the error in input predictions.
The error is based on a minimum-cost hyperedge cover in a suitably defined
hypergraph and provides a general template which we apply to online graph
problems. The measure captures errors due to absent predicted requests as well
as unpredicte... | [
{
"created": "Wed, 25 May 2022 15:24:03 GMT",
"version": "v1"
},
{
"created": "Mon, 10 Oct 2022 06:53:25 GMT",
"version": "v2"
}
] | 2022-10-11 | [
[
"Bernardini",
"Giulia",
""
],
[
"Lindermayr",
"Alexander",
""
],
[
"Marchetti-Spaccamela",
"Alberto",
""
],
[
"Megow",
"Nicole",
""
],
[
"Stougie",
"Leen",
""
],
[
"Sweering",
"Michelle",
""
]
] | We introduce a novel measure for quantifying the error in input predictions. The error is based on a minimum-cost hyperedge cover in a suitably defined hypergraph and provides a general template which we apply to online graph problems. The measure captures errors due to absent predicted requests as well as unpredicted ... |
1907.09578 | Andrey Zhmoginov | Andrey Zhmoginov, Ian Fischer, Mark Sandler | Information-Bottleneck Approach to Salient Region Discovery | null | null | null | null | cs.CV cs.IT cs.LG math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a new method for learning image attention masks in a
semi-supervised setting based on the Information Bottleneck principle. Provided
with a set of labeled images, the mask generation model is minimizing mutual
information between the input and the masked image while maximizing the mutual
information betwee... | [
{
"created": "Mon, 22 Jul 2019 21:13:30 GMT",
"version": "v1"
},
{
"created": "Fri, 14 Feb 2020 22:14:54 GMT",
"version": "v2"
}
] | 2020-02-18 | [
[
"Zhmoginov",
"Andrey",
""
],
[
"Fischer",
"Ian",
""
],
[
"Sandler",
"Mark",
""
]
] | We propose a new method for learning image attention masks in a semi-supervised setting based on the Information Bottleneck principle. Provided with a set of labeled images, the mask generation model is minimizing mutual information between the input and the masked image while maximizing the mutual information between ... |
2404.02699 | Yu He | Zihan Yao, Yu He, Tianyu Qi and Ming Li | Scalable Model Editing via Customized Expert Networks | Accepted by COLM2024 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Addressing the issues of hallucinations and outdated knowledge in large
language models is critical for their reliable application. Model Editing
presents a promising avenue for mitigating these challenges in a cost-effective
manner. However, existing methods often suffer from unsatisfactory
generalization and uninte... | [
{
"created": "Wed, 3 Apr 2024 12:57:19 GMT",
"version": "v1"
},
{
"created": "Thu, 8 Aug 2024 13:10:50 GMT",
"version": "v2"
}
] | 2024-08-09 | [
[
"Yao",
"Zihan",
""
],
[
"He",
"Yu",
""
],
[
"Qi",
"Tianyu",
""
],
[
"Li",
"Ming",
""
]
] | Addressing the issues of hallucinations and outdated knowledge in large language models is critical for their reliable application. Model Editing presents a promising avenue for mitigating these challenges in a cost-effective manner. However, existing methods often suffer from unsatisfactory generalization and unintend... |
2103.17269 | Michael Niemeyer | Michael Niemeyer, Andreas Geiger | CAMPARI: Camera-Aware Decomposed Generative Neural Radiance Fields | null | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Tremendous progress in deep generative models has led to photorealistic image
synthesis. While achieving compelling results, most approaches operate in the
two-dimensional image domain, ignoring the three-dimensional nature of our
world. Several recent works therefore propose generative models which are
3D-aware, i.e... | [
{
"created": "Wed, 31 Mar 2021 17:59:24 GMT",
"version": "v1"
}
] | 2021-04-01 | [
[
"Niemeyer",
"Michael",
""
],
[
"Geiger",
"Andreas",
""
]
] | Tremendous progress in deep generative models has led to photorealistic image synthesis. While achieving compelling results, most approaches operate in the two-dimensional image domain, ignoring the three-dimensional nature of our world. Several recent works therefore propose generative models which are 3D-aware, i.e.,... |
2111.09047 | Julien Berger | Julien Berger, Clemence Legros, Madina Abdykarim | Dimensionless formulation and similarity to assess the main phenomena of
heat and mass transfer in building porous material | null | null | 10.1016/j.jobe.2020.101849 | null | cs.CE physics.app-ph | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Within the environmental context, several tools based on simulations have
been proposed to analyze the physical phenomena of heat and mass transfer in
porous materials. However, it is still an open challenge to propose tools that
do not require to perform computations to catch the dominant processes. Thus,
this artic... | [
{
"created": "Wed, 17 Nov 2021 11:43:03 GMT",
"version": "v1"
}
] | 2021-11-18 | [
[
"Berger",
"Julien",
""
],
[
"Legros",
"Clemence",
""
],
[
"Abdykarim",
"Madina",
""
]
] | Within the environmental context, several tools based on simulations have been proposed to analyze the physical phenomena of heat and mass transfer in porous materials. However, it is still an open challenge to propose tools that do not require to perform computations to catch the dominant processes. Thus, this article... |
2303.07655 | Kourosh Darvish | Kourosh Darvish, Serena Ivaldi, Daniele Pucci | Simultaneous Action Recognition and Human Whole-Body Motion and Dynamics
Prediction from Wearable Sensors | null | null | 10.1109/Humanoids53995.2022.10000122 | null | cs.RO | http://creativecommons.org/licenses/by/4.0/ | This paper presents a novel approach to solve simultaneously the problems of
human activity recognition and whole-body motion and dynamics prediction for
real-time applications. Starting from the dynamics of human motion and motor
system theory, the notion of mixture of experts from deep learning has been
extended to... | [
{
"created": "Tue, 14 Mar 2023 06:52:41 GMT",
"version": "v1"
}
] | 2023-03-15 | [
[
"Darvish",
"Kourosh",
""
],
[
"Ivaldi",
"Serena",
""
],
[
"Pucci",
"Daniele",
""
]
] | This paper presents a novel approach to solve simultaneously the problems of human activity recognition and whole-body motion and dynamics prediction for real-time applications. Starting from the dynamics of human motion and motor system theory, the notion of mixture of experts from deep learning has been extended to a... |
1508.02050 | Tahani Almanie | Tahani Almanie, Rsha Mirza and Elizabeth Lor | Crime Prediction Based On Crime Types And Using Spatial And Temporal
Criminal Hotspots | 19 pages, 18 figures, 7 tables | International Journal of Data Mining & Knowledge Management
Process (IJDKP) Vol.5, No.4, July 2015 | 10.5121/ijdkp.2015.5401 | null | cs.AI cs.CY cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper focuses on finding spatial and temporal criminal hotspots. It
analyses two different real-world crimes datasets for Denver, CO and Los
Angeles, CA and provides a comparison between the two datasets through a
statistical analysis supported by several graphs. Then, it clarifies how we
conducted Apriori algor... | [
{
"created": "Sun, 9 Aug 2015 17:15:56 GMT",
"version": "v1"
}
] | 2015-08-11 | [
[
"Almanie",
"Tahani",
""
],
[
"Mirza",
"Rsha",
""
],
[
"Lor",
"Elizabeth",
""
]
] | This paper focuses on finding spatial and temporal criminal hotspots. It analyses two different real-world crimes datasets for Denver, CO and Los Angeles, CA and provides a comparison between the two datasets through a statistical analysis supported by several graphs. Then, it clarifies how we conducted Apriori algorit... |
1502.00979 | Yuming Jiang | Fengyou Sun and Yuming Jiang | Further Properties of Wireless Channel Capacity | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Future wireless communication calls for exploration of more efficient use of
wireless channel capacity to meet the increasing demand on higher data rate and
less latency. However, while the ergodic capacity and instantaneous capacity of
a wireless channel have been extensively studied, they are in many cases not
suff... | [
{
"created": "Sat, 31 Jan 2015 13:10:57 GMT",
"version": "v1"
},
{
"created": "Mon, 4 Apr 2016 20:09:46 GMT",
"version": "v2"
}
] | 2016-04-06 | [
[
"Sun",
"Fengyou",
""
],
[
"Jiang",
"Yuming",
""
]
] | Future wireless communication calls for exploration of more efficient use of wireless channel capacity to meet the increasing demand on higher data rate and less latency. However, while the ergodic capacity and instantaneous capacity of a wireless channel have been extensively studied, they are in many cases not suffic... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.