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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1509.05452 | Anant Baijal | Anant Baijal, Julia Kim, Carmen Branje, Frank Russo, Deborah I. Fels | Composing vibrotactile music: A multisensory experience with the
Emoti-chair | IEEE HAPTICS Symposium 2012 | null | 10.1109/HAPTIC.2012.6183839 | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Emoti-Chair is a novel technology to enhance entertainment through
vibrotactile stimulation. We assessed the experience of this technology in two
workshops. In the first workshop, deaf film-makers experimented with creating
vibetracks for a movie clip using a professional movie editing software. In the
second wor... | [
{
"created": "Thu, 17 Sep 2015 21:52:12 GMT",
"version": "v1"
}
] | 2015-09-21 | [
[
"Baijal",
"Anant",
""
],
[
"Kim",
"Julia",
""
],
[
"Branje",
"Carmen",
""
],
[
"Russo",
"Frank",
""
],
[
"Fels",
"Deborah I.",
""
]
] | The Emoti-Chair is a novel technology to enhance entertainment through vibrotactile stimulation. We assessed the experience of this technology in two workshops. In the first workshop, deaf film-makers experimented with creating vibetracks for a movie clip using a professional movie editing software. In the second works... |
2306.17162 | Simeon Adebola | Simeon Adebola, Rishi Parikh, Mark Presten, Satvik Sharma, Shrey
Aeron, Ananth Rao, Sandeep Mukherjee, Tomson Qu, Christina Wistrom, Eugen
Solowjow, Ken Goldberg | Can Machines Garden? Systematically Comparing the AlphaGarden vs.
Professional Horticulturalists | International Conference on Robotics and Automation(ICRA) 2023 Oral | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The AlphaGarden is an automated testbed for indoor polyculture farming which
combines a first-order plant simulator, a gantry robot, a seed planting
algorithm, plant phenotyping and tracking algorithms, irrigation sensors and
algorithms, and custom pruning tools and algorithms. In this paper, we
systematically compar... | [
{
"created": "Thu, 29 Jun 2023 17:59:05 GMT",
"version": "v1"
}
] | 2023-06-30 | [
[
"Adebola",
"Simeon",
""
],
[
"Parikh",
"Rishi",
""
],
[
"Presten",
"Mark",
""
],
[
"Sharma",
"Satvik",
""
],
[
"Aeron",
"Shrey",
""
],
[
"Rao",
"Ananth",
""
],
[
"Mukherjee",
"Sandeep",
""
],
[
"Qu"... | The AlphaGarden is an automated testbed for indoor polyculture farming which combines a first-order plant simulator, a gantry robot, a seed planting algorithm, plant phenotyping and tracking algorithms, irrigation sensors and algorithms, and custom pruning tools and algorithms. In this paper, we systematically compare ... |
2203.16797 | Chuizheng Meng | Chuizheng Meng, Sungyong Seo, Defu Cao, Sam Griesemer, Yan Liu | When Physics Meets Machine Learning: A Survey of Physics-Informed
Machine Learning | null | null | null | null | cs.LG stat.ML | http://creativecommons.org/licenses/by/4.0/ | Physics-informed machine learning (PIML), referring to the combination of
prior knowledge of physics, which is the high level abstraction of natural
phenomenons and human behaviours in the long history, with data-driven machine
learning models, has emerged as an effective way to mitigate the shortage of
training data... | [
{
"created": "Thu, 31 Mar 2022 04:58:27 GMT",
"version": "v1"
}
] | 2022-04-01 | [
[
"Meng",
"Chuizheng",
""
],
[
"Seo",
"Sungyong",
""
],
[
"Cao",
"Defu",
""
],
[
"Griesemer",
"Sam",
""
],
[
"Liu",
"Yan",
""
]
] | Physics-informed machine learning (PIML), referring to the combination of prior knowledge of physics, which is the high level abstraction of natural phenomenons and human behaviours in the long history, with data-driven machine learning models, has emerged as an effective way to mitigate the shortage of training data, ... |
2208.03374 | Aleksandar Stanic | Aleksandar Stani\'c, Yujin Tang, David Ha, J\"urgen Schmidhuber | Learning to Generalize with Object-centric Agents in the Open World
Survival Game Crafter | null | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | Reinforcement learning agents must generalize beyond their training
experience. Prior work has focused mostly on identical training and evaluation
environments. Starting from the recently introduced Crafter benchmark, a 2D
open world survival game, we introduce a new set of environments suitable for
evaluating some a... | [
{
"created": "Fri, 5 Aug 2022 20:05:46 GMT",
"version": "v1"
}
] | 2022-08-09 | [
[
"Stanić",
"Aleksandar",
""
],
[
"Tang",
"Yujin",
""
],
[
"Ha",
"David",
""
],
[
"Schmidhuber",
"Jürgen",
""
]
] | Reinforcement learning agents must generalize beyond their training experience. Prior work has focused mostly on identical training and evaluation environments. Starting from the recently introduced Crafter benchmark, a 2D open world survival game, we introduce a new set of environments suitable for evaluating some age... |
2207.14745 | Maria Vittoria Minniti | Jessie van Dam, Andreea Tulbure, Maria Vittoria Minniti, Firas
Abi-Farraj, Marco Hutter | Collision detection and identification for a legged manipulator | International Conference on Intelligent Robots and Systems, IROS
2022, Kyoto, Japan, Oct 23 - Oct. 27, 2022 | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | To safely deploy legged robots in the real world it is necessary to provide
them with the ability to reliably detect unexpected contacts and accurately
estimate the corresponding contact force. In this paper, we propose a collision
detection and identification pipeline for a quadrupedal manipulator. We first
introduc... | [
{
"created": "Fri, 29 Jul 2022 15:37:23 GMT",
"version": "v1"
}
] | 2022-08-01 | [
[
"van Dam",
"Jessie",
""
],
[
"Tulbure",
"Andreea",
""
],
[
"Minniti",
"Maria Vittoria",
""
],
[
"Abi-Farraj",
"Firas",
""
],
[
"Hutter",
"Marco",
""
]
] | To safely deploy legged robots in the real world it is necessary to provide them with the ability to reliably detect unexpected contacts and accurately estimate the corresponding contact force. In this paper, we propose a collision detection and identification pipeline for a quadrupedal manipulator. We first introduce ... |
2001.09747 | Dirk Hartmann | Dirk Hartmann, Herman van der Auweraer | Digital Twins | null | null | null | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Digital Twins are one of the hottest digital trends. In this contribution we
will shortly review the concept of Digital Twins and the chances for novel
industrial applications. Mathematics are a key enabler and the impact will be
highlighted along four specific examples addressing Digital Product Twins
democratizing ... | [
{
"created": "Fri, 3 Jan 2020 19:20:47 GMT",
"version": "v1"
}
] | 2020-01-28 | [
[
"Hartmann",
"Dirk",
""
],
[
"van der Auweraer",
"Herman",
""
]
] | Digital Twins are one of the hottest digital trends. In this contribution we will shortly review the concept of Digital Twins and the chances for novel industrial applications. Mathematics are a key enabler and the impact will be highlighted along four specific examples addressing Digital Product Twins democratizing De... |
2001.01000 | Thomas Drugman | Thomas Drugman, Thierry Dutoit | The Deterministic plus Stochastic Model of the Residual Signal and its
Applications | null | null | null | null | cs.SD cs.CL eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The modeling of speech production often relies on a source-filter approach.
Although methods parameterizing the filter have nowadays reached a certain
maturity, there is still a lot to be gained for several speech processing
applications in finding an appropriate excitation model. This manuscript
presents a Determini... | [
{
"created": "Sun, 29 Dec 2019 07:52:37 GMT",
"version": "v1"
}
] | 2020-01-07 | [
[
"Drugman",
"Thomas",
""
],
[
"Dutoit",
"Thierry",
""
]
] | The modeling of speech production often relies on a source-filter approach. Although methods parameterizing the filter have nowadays reached a certain maturity, there is still a lot to be gained for several speech processing applications in finding an appropriate excitation model. This manuscript presents a Determinist... |
1907.12998 | Tomasz Arodz | Han Zhang, Xi Gao, Jacob Unterman, Tom Arodz | Approximation Capabilities of Neural ODEs and Invertible Residual
Networks | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Neural ODEs and i-ResNet are recently proposed methods for enforcing
invertibility of residual neural models. Having a generic technique for
constructing invertible models can open new avenues for advances in learning
systems, but so far the question of whether Neural ODEs and i-ResNets can model
any continuous inver... | [
{
"created": "Tue, 30 Jul 2019 15:04:01 GMT",
"version": "v1"
},
{
"created": "Sun, 1 Mar 2020 03:28:45 GMT",
"version": "v2"
}
] | 2020-03-03 | [
[
"Zhang",
"Han",
""
],
[
"Gao",
"Xi",
""
],
[
"Unterman",
"Jacob",
""
],
[
"Arodz",
"Tom",
""
]
] | Neural ODEs and i-ResNet are recently proposed methods for enforcing invertibility of residual neural models. Having a generic technique for constructing invertible models can open new avenues for advances in learning systems, but so far the question of whether Neural ODEs and i-ResNets can model any continuous inverti... |
2306.11104 | Lucia Cipolina-Kun | Lucia Cipolina-Kun | Markovian Embeddings for Coalitional Bargaining Games | null | null | null | null | cs.MA cs.GT cs.LG | http://creativecommons.org/licenses/by/4.0/ | We examine the Markovian properties of coalition bargaining games, in
particular, the case where past rejected proposals cannot be repeated. We
propose a Markovian embedding with filtrations to render the sates Markovian
and thus, fit into the framework of stochastic games.
| [
{
"created": "Mon, 19 Jun 2023 18:13:16 GMT",
"version": "v1"
}
] | 2023-06-21 | [
[
"Cipolina-Kun",
"Lucia",
""
]
] | We examine the Markovian properties of coalition bargaining games, in particular, the case where past rejected proposals cannot be repeated. We propose a Markovian embedding with filtrations to render the sates Markovian and thus, fit into the framework of stochastic games. |
2404.15475 | Robert Grossman | Robert L. Grossman | An Annotated Glossary for Data Commons, Data Meshes, and Other Data
Platforms | 6 pages | null | null | null | cs.IR | http://creativecommons.org/licenses/by/4.0/ | Cloud-based data commons, data meshes, data hubs, and other data platforms
are important ways to manage, analyze and share data to accelerate research and
to support reproducible research. This is an annotated glossary of some of the
more common terms used in articles and discussions about these platforms.
| [
{
"created": "Tue, 23 Apr 2024 19:26:28 GMT",
"version": "v1"
}
] | 2024-04-25 | [
[
"Grossman",
"Robert L.",
""
]
] | Cloud-based data commons, data meshes, data hubs, and other data platforms are important ways to manage, analyze and share data to accelerate research and to support reproducible research. This is an annotated glossary of some of the more common terms used in articles and discussions about these platforms. |
1507.05224 | Kiran Garimella | Kiran Garimella, Gianmarco De Francisci Morales, Aristides Gionis,
Michael Mathioudakis | Quantifying Controversy in Social Media | Accepted in the journal Transactions on Social Computing (TSC).
Extended version of the WSDM 2016 and CSCW 2016 demo paper. Please cite the
TSC/WSDM version and not the arxiv version | null | null | null | cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Which topics spark the most heated debates on social media? Identifying those
topics is not only interesting from a societal point of view, but also allows
the filtering and aggregation of social media content for disseminating news
stories. In this paper, we perform a systematic methodological study of
controversy d... | [
{
"created": "Sat, 18 Jul 2015 20:50:42 GMT",
"version": "v1"
},
{
"created": "Mon, 17 Aug 2015 04:12:06 GMT",
"version": "v2"
},
{
"created": "Mon, 14 Dec 2015 18:48:53 GMT",
"version": "v3"
},
{
"created": "Tue, 7 Jun 2016 15:28:51 GMT",
"version": "v4"
},
{
"cr... | 2017-09-21 | [
[
"Garimella",
"Kiran",
""
],
[
"Morales",
"Gianmarco De Francisci",
""
],
[
"Gionis",
"Aristides",
""
],
[
"Mathioudakis",
"Michael",
""
]
] | Which topics spark the most heated debates on social media? Identifying those topics is not only interesting from a societal point of view, but also allows the filtering and aggregation of social media content for disseminating news stories. In this paper, we perform a systematic methodological study of controversy det... |
2111.13839 | Hanlin Zhang | Hanlin Zhang, Yi-Fan Zhang, Weiyang Liu, Adrian Weller, Bernhard
Sch\"olkopf, Eric P. Xing | Towards Principled Disentanglement for Domain Generalization | CVPR 2022 Oral | null | null | null | cs.LG cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A fundamental challenge for machine learning models is generalizing to
out-of-distribution (OOD) data, in part due to spurious correlations. To tackle
this challenge, we first formalize the OOD generalization problem as
constrained optimization, called Disentanglement-constrained Domain
Generalization (DDG). We relax... | [
{
"created": "Sat, 27 Nov 2021 07:36:32 GMT",
"version": "v1"
},
{
"created": "Thu, 13 Jan 2022 21:23:57 GMT",
"version": "v2"
},
{
"created": "Tue, 29 Mar 2022 05:34:27 GMT",
"version": "v3"
},
{
"created": "Wed, 19 Oct 2022 04:26:12 GMT",
"version": "v4"
}
] | 2022-10-20 | [
[
"Zhang",
"Hanlin",
""
],
[
"Zhang",
"Yi-Fan",
""
],
[
"Liu",
"Weiyang",
""
],
[
"Weller",
"Adrian",
""
],
[
"Schölkopf",
"Bernhard",
""
],
[
"Xing",
"Eric P.",
""
]
] | A fundamental challenge for machine learning models is generalizing to out-of-distribution (OOD) data, in part due to spurious correlations. To tackle this challenge, we first formalize the OOD generalization problem as constrained optimization, called Disentanglement-constrained Domain Generalization (DDG). We relax t... |
2310.05882 | Erica Weng | Erica Weng, Kenta Mukoya, Deva Ramanan, Kris Kitani | Evaluating a VR System for Collecting Safety-Critical Vehicle-Pedestrian
Interactions | Spotlight paper in the Data Generation for Robotics Workshop at RSS
2024 | null | null | null | cs.HC | http://creativecommons.org/licenses/by/4.0/ | Autonomous vehicles (AVs) require comprehensive and reliable pedestrian
trajectory data to ensure safe operation. However, obtaining data of
safety-critical scenarios such as jaywalking and near-collisions, or uncommon
agents such as children, disabled pedestrians, and vulnerable road users poses
logistical and ethic... | [
{
"created": "Mon, 9 Oct 2023 17:23:20 GMT",
"version": "v1"
},
{
"created": "Fri, 5 Jul 2024 20:08:00 GMT",
"version": "v2"
},
{
"created": "Tue, 9 Jul 2024 18:42:09 GMT",
"version": "v3"
}
] | 2024-07-11 | [
[
"Weng",
"Erica",
""
],
[
"Mukoya",
"Kenta",
""
],
[
"Ramanan",
"Deva",
""
],
[
"Kitani",
"Kris",
""
]
] | Autonomous vehicles (AVs) require comprehensive and reliable pedestrian trajectory data to ensure safe operation. However, obtaining data of safety-critical scenarios such as jaywalking and near-collisions, or uncommon agents such as children, disabled pedestrians, and vulnerable road users poses logistical and ethical... |
1812.01156 | Anik Islam | Anik Islam, Mohammed Belal Uddin, Md. Fazlul Kader, Soo Young Shin | Blockchain based secure data handover scheme in non-orthogonal multiple
access | Published in 2018 4th International Conference on Wireless and
Telematics (ICWT) | 2018 4th International Conference on Wireless and Telematics
(ICWT), Nusa Dua, 2018, pp. 1-5 | 10.1109/ICWT.2018.8527732 | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Non-orthogonal multiple access (NOMA) with successive interference
cancellation receiver is considered as one of the most potent multiple access
techniques to be adopted in future wireless communication networks. Data
security in the NOMA transmission scheme is on much attention drawing issue.
Blockchain is a distrib... | [
{
"created": "Tue, 4 Dec 2018 01:15:27 GMT",
"version": "v1"
}
] | 2018-12-05 | [
[
"Islam",
"Anik",
""
],
[
"Uddin",
"Mohammed Belal",
""
],
[
"Kader",
"Md. Fazlul",
""
],
[
"Shin",
"Soo Young",
""
]
] | Non-orthogonal multiple access (NOMA) with successive interference cancellation receiver is considered as one of the most potent multiple access techniques to be adopted in future wireless communication networks. Data security in the NOMA transmission scheme is on much attention drawing issue. Blockchain is a distribut... |
0902.2969 | Giorgi Japaridze | Giorgi Japaridze | Ptarithmetic | Substantially better versions are on their way. Hence the present
article probably will not be published | The Baltic International Yearbook on Cognition, Logic and
Communication 8 (2013), Article 5, pp. 1-186 | 10.4148/1944-3676.1074 | null | cs.LO cs.AI cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The present article introduces ptarithmetic (short for "polynomial time
arithmetic") -- a formal number theory similar to the well known Peano
arithmetic, but based on the recently born computability logic (see
http://www.cis.upenn.edu/~giorgi/cl.html) instead of classical logic. The
formulas of ptarithmetic represen... | [
{
"created": "Tue, 17 Feb 2009 19:14:09 GMT",
"version": "v1"
},
{
"created": "Wed, 18 Feb 2009 12:48:43 GMT",
"version": "v2"
},
{
"created": "Fri, 26 Feb 2010 10:17:31 GMT",
"version": "v3"
}
] | 2013-12-16 | [
[
"Japaridze",
"Giorgi",
""
]
] | The present article introduces ptarithmetic (short for "polynomial time arithmetic") -- a formal number theory similar to the well known Peano arithmetic, but based on the recently born computability logic (see http://www.cis.upenn.edu/~giorgi/cl.html) instead of classical logic. The formulas of ptarithmetic represent ... |
2004.13629 | Masahiro Oda Dr. | Masahiro Oda, Holger R. Roth, Takayuki Kitasaka, Kazuhiro Furukawa,
Ryoji Miyahara, Yoshiki Hirooka, Hidemi Goto, Nassir Navab, Kensaku Mori | Colon Shape Estimation Method for Colonoscope Tracking using Recurrent
Neural Networks | Accepted paper as a poster presentation at MICCAI 2018 (International
Conference on Medical Image Computing and Computer-Assisted Intervention),
Granada, Spain | Published in Proceedings of MICCAI 2018, LNCS 11073, pp 176-184 | 10.1007/978-3-030-00937-3_21 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose an estimation method using a recurrent neural network (RNN) of the
colon's shape where deformation was occurred by a colonoscope insertion.
Colonoscope tracking or a navigation system that navigates physician to polyp
positions is needed to reduce such complications as colon perforation. Previous
tracking ... | [
{
"created": "Mon, 20 Apr 2020 04:43:58 GMT",
"version": "v1"
}
] | 2020-04-29 | [
[
"Oda",
"Masahiro",
""
],
[
"Roth",
"Holger R.",
""
],
[
"Kitasaka",
"Takayuki",
""
],
[
"Furukawa",
"Kazuhiro",
""
],
[
"Miyahara",
"Ryoji",
""
],
[
"Hirooka",
"Yoshiki",
""
],
[
"Goto",
"Hidemi",
""
],
... | We propose an estimation method using a recurrent neural network (RNN) of the colon's shape where deformation was occurred by a colonoscope insertion. Colonoscope tracking or a navigation system that navigates physician to polyp positions is needed to reduce such complications as colon perforation. Previous tracking me... |
2205.06802 | Danial Toufani Movaghar | Danial Toufani-Movaghar, Mohammad-Reza Feizi-Derakhshi | Word Embeddings and Validity Indexes in Fuzzy Clustering | 10 Pages, 2 figures. arXiv admin note: substantial text overlap with
arXiv:1907.07672 by other authors | null | null | null | cs.CL cs.AI | http://creativecommons.org/publicdomain/zero/1.0/ | In the new era of internet systems and applications, a concept of detecting
distinguished topics from huge amounts of text has gained a lot of attention.
These methods use representation of text in a numerical format -- called
embeddings -- to imitate human-based semantic similarity between words. In this
study, we p... | [
{
"created": "Tue, 26 Apr 2022 18:08:19 GMT",
"version": "v1"
}
] | 2022-05-16 | [
[
"Toufani-Movaghar",
"Danial",
""
],
[
"Feizi-Derakhshi",
"Mohammad-Reza",
""
]
] | In the new era of internet systems and applications, a concept of detecting distinguished topics from huge amounts of text has gained a lot of attention. These methods use representation of text in a numerical format -- called embeddings -- to imitate human-based semantic similarity between words. In this study, we per... |
1410.6513 | Yunan Gu | Yunan Gu and Walid Saad and Mehdi Bennis and Merouane Debbah and Zhu
Han | Matching Theory for Future Wireless Networks: Fundamentals and
Applications | null | null | null | null | cs.IT cs.NI math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The emergence of novel wireless networking paradigms such as small cell and
cognitive radio networks has forever transformed the way in which wireless
systems are operated. In particular, the need for self-organizing solutions to
manage the scarce spectral resources has become a prevalent theme in many
emerging wirel... | [
{
"created": "Thu, 23 Oct 2014 21:43:31 GMT",
"version": "v1"
},
{
"created": "Thu, 12 Mar 2015 22:22:27 GMT",
"version": "v2"
}
] | 2015-03-16 | [
[
"Gu",
"Yunan",
""
],
[
"Saad",
"Walid",
""
],
[
"Bennis",
"Mehdi",
""
],
[
"Debbah",
"Merouane",
""
],
[
"Han",
"Zhu",
""
]
] | The emergence of novel wireless networking paradigms such as small cell and cognitive radio networks has forever transformed the way in which wireless systems are operated. In particular, the need for self-organizing solutions to manage the scarce spectral resources has become a prevalent theme in many emerging wireles... |
2405.20446 | Maya Anderson | Maya Anderson, Guy Amit, Abigail Goldsteen | Is My Data in Your Retrieval Database? Membership Inference Attacks
Against Retrieval Augmented Generation | 16 pages, 3 figures | null | null | null | cs.CR cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | Retrieval Augmented Generation (RAG) systems have shown great promise in
natural language processing. However, their reliance on data stored in a
retrieval database, which may contain proprietary or sensitive information,
introduces new privacy concerns. Specifically, an attacker may be able to infer
whether a certai... | [
{
"created": "Thu, 30 May 2024 19:46:36 GMT",
"version": "v1"
},
{
"created": "Fri, 7 Jun 2024 09:39:39 GMT",
"version": "v2"
}
] | 2024-06-10 | [
[
"Anderson",
"Maya",
""
],
[
"Amit",
"Guy",
""
],
[
"Goldsteen",
"Abigail",
""
]
] | Retrieval Augmented Generation (RAG) systems have shown great promise in natural language processing. However, their reliance on data stored in a retrieval database, which may contain proprietary or sensitive information, introduces new privacy concerns. Specifically, an attacker may be able to infer whether a certain ... |
2406.06258 | Xiaojie Li | Xiaojie Li, Chenghao Gu, Shuzhao Xie, Yunpeng Bai, Weixiang Zhang, Zhi
Wang | Tuning-Free Visual Customization via View Iterative Self-Attention
Control | Under review | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Fine-Tuning Diffusion Models enable a wide range of personalized generation
and editing applications on diverse visual modalities. While Low-Rank
Adaptation (LoRA) accelerates the fine-tuning process, it still requires
multiple reference images and time-consuming training, which constrains its
scalability for large-s... | [
{
"created": "Mon, 10 Jun 2024 13:41:10 GMT",
"version": "v1"
},
{
"created": "Tue, 11 Jun 2024 03:06:14 GMT",
"version": "v2"
}
] | 2024-06-12 | [
[
"Li",
"Xiaojie",
""
],
[
"Gu",
"Chenghao",
""
],
[
"Xie",
"Shuzhao",
""
],
[
"Bai",
"Yunpeng",
""
],
[
"Zhang",
"Weixiang",
""
],
[
"Wang",
"Zhi",
""
]
] | Fine-Tuning Diffusion Models enable a wide range of personalized generation and editing applications on diverse visual modalities. While Low-Rank Adaptation (LoRA) accelerates the fine-tuning process, it still requires multiple reference images and time-consuming training, which constrains its scalability for large-sca... |
2307.09408 | Anne Cathrine Linder | Anne Cathrine Linder and David Lusseau | Resilience of the reported global human-nature interaction network to
pandemic conditions | null | null | null | null | cs.SI physics.soc-ph | http://creativecommons.org/licenses/by/4.0/ | Understanding human-nature interactions and the architecture of coupled
human-nature systems is crucial for sustainable development. Cultural ecosystem
services (CES), defined as intangible benefits derived from nature exposure,
contribute to maintaining and improving human well-being. However, we have
limited unders... | [
{
"created": "Tue, 18 Jul 2023 16:27:39 GMT",
"version": "v1"
}
] | 2023-07-19 | [
[
"Linder",
"Anne Cathrine",
""
],
[
"Lusseau",
"David",
""
]
] | Understanding human-nature interactions and the architecture of coupled human-nature systems is crucial for sustainable development. Cultural ecosystem services (CES), defined as intangible benefits derived from nature exposure, contribute to maintaining and improving human well-being. However, we have limited understa... |
2404.01543 | Ziqian Bai | Ziqian Bai, Feitong Tan, Sean Fanello, Rohit Pandey, Mingsong Dou,
Shichen Liu, Ping Tan, Yinda Zhang | Efficient 3D Implicit Head Avatar with Mesh-anchored Hash Table
Blendshapes | In CVPR2024. Project page:
https://augmentedperception.github.io/monoavatar-plus | null | null | null | cs.CV cs.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 3D head avatars built with neural implicit volumetric representations have
achieved unprecedented levels of photorealism. However, the computational cost
of these methods remains a significant barrier to their widespread adoption,
particularly in real-time applications such as virtual reality and
teleconferencing. Wh... | [
{
"created": "Tue, 2 Apr 2024 00:55:50 GMT",
"version": "v1"
}
] | 2024-04-03 | [
[
"Bai",
"Ziqian",
""
],
[
"Tan",
"Feitong",
""
],
[
"Fanello",
"Sean",
""
],
[
"Pandey",
"Rohit",
""
],
[
"Dou",
"Mingsong",
""
],
[
"Liu",
"Shichen",
""
],
[
"Tan",
"Ping",
""
],
[
"Zhang",
"Yin... | 3D head avatars built with neural implicit volumetric representations have achieved unprecedented levels of photorealism. However, the computational cost of these methods remains a significant barrier to their widespread adoption, particularly in real-time applications such as virtual reality and teleconferencing. Whil... |
1307.1718 | Kyle Williams | Pucktada Treeratpituk, Madian Khabsa, C. Lee Giles | Graph-based Approach to Automatic Taxonomy Generation (GraBTax) | null | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a novel graph-based approach for constructing concept hierarchy
from a large text corpus. Our algorithm, GraBTax, incorporates both statistical
co-occurrences and lexical similarity in optimizing the structure of the
taxonomy. To automatically generate topic-dependent taxonomies from a large
text corpus, G... | [
{
"created": "Fri, 5 Jul 2013 21:05:20 GMT",
"version": "v1"
},
{
"created": "Mon, 28 Apr 2014 20:50:22 GMT",
"version": "v2"
}
] | 2014-04-30 | [
[
"Treeratpituk",
"Pucktada",
""
],
[
"Khabsa",
"Madian",
""
],
[
"Giles",
"C. Lee",
""
]
] | We propose a novel graph-based approach for constructing concept hierarchy from a large text corpus. Our algorithm, GraBTax, incorporates both statistical co-occurrences and lexical similarity in optimizing the structure of the taxonomy. To automatically generate topic-dependent taxonomies from a large text corpus, Gra... |
1204.6304 | Srijith Ravikumar | Sathya Narayanan Nagarajan, Srijith Ravikumar | Model for Predicting End User Web Page Response Time | null | null | null | null | cs.PF | http://creativecommons.org/licenses/by-nc-sa/3.0/ | Perceived responsiveness of a web page is one of the most important and least
understood metrics of web page design, and is critical for attracting and
maintaining a large audience. Web pages can be designed to meet performance
SLAs early in the product lifecycle if there is a way to predict the apparent
responsivene... | [
{
"created": "Fri, 27 Apr 2012 19:21:30 GMT",
"version": "v1"
}
] | 2012-04-30 | [
[
"Nagarajan",
"Sathya Narayanan",
""
],
[
"Ravikumar",
"Srijith",
""
]
] | Perceived responsiveness of a web page is one of the most important and least understood metrics of web page design, and is critical for attracting and maintaining a large audience. Web pages can be designed to meet performance SLAs early in the product lifecycle if there is a way to predict the apparent responsiveness... |
1407.0791 | Kiran Garimella | Venkata Rama Kiran Garimella, Ingmar Weber | Co-Following on Twitter | full version of a short paper at Hypertext 2014 | null | null | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present an in-depth study of co-following on Twitter based on the
observation that two Twitter users whose followers have similar friends are
also similar, even though they might not share any direct links or a single
mutual follower. We show how this observation contributes to (i) a better
understanding of langua... | [
{
"created": "Thu, 3 Jul 2014 06:07:59 GMT",
"version": "v1"
}
] | 2014-07-04 | [
[
"Garimella",
"Venkata Rama Kiran",
""
],
[
"Weber",
"Ingmar",
""
]
] | We present an in-depth study of co-following on Twitter based on the observation that two Twitter users whose followers have similar friends are also similar, even though they might not share any direct links or a single mutual follower. We show how this observation contributes to (i) a better understanding of language... |
2107.10249 | Feng Zhou | Sue Bai, Dakota Drake Legge, Ashley Young, Shan Bao, Feng Zhou | Investigating External Interaction Modality and Design Between Automated
Vehicles and Pedestrians at Crossings | null | null | null | null | cs.HC | http://creativecommons.org/licenses/by/4.0/ | In this study, we investigated the effectiveness and user acceptance of three
external interaction modalities (i.e., visual, auditory, and visual+auditory)
in promoting communications between automated vehicle systems (AVS) and
pedestrians at a crosswalk through a large number of combined designs. For this
purpose, a... | [
{
"created": "Wed, 21 Jul 2021 17:53:47 GMT",
"version": "v1"
}
] | 2021-07-22 | [
[
"Bai",
"Sue",
""
],
[
"Legge",
"Dakota Drake",
""
],
[
"Young",
"Ashley",
""
],
[
"Bao",
"Shan",
""
],
[
"Zhou",
"Feng",
""
]
] | In this study, we investigated the effectiveness and user acceptance of three external interaction modalities (i.e., visual, auditory, and visual+auditory) in promoting communications between automated vehicle systems (AVS) and pedestrians at a crosswalk through a large number of combined designs. For this purpose, an ... |
2106.02289 | Tiago Pimentel | Irene Nikkarinen, Tiago Pimentel, Dami\'an E. Blasi, Ryan Cotterell | Modeling the Unigram Distribution | Irene Nikkarinen and Tiago Pimentel contributed equally to this work.
Accepted to the findings of ACL 2021. Code available in
https://github.com/irenenikk/modelling-unigram | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The unigram distribution is the non-contextual probability of finding a
specific word form in a corpus. While of central importance to the study of
language, it is commonly approximated by each word's sample frequency in the
corpus. This approach, being highly dependent on sample size, assigns zero
probability to any... | [
{
"created": "Fri, 4 Jun 2021 07:02:49 GMT",
"version": "v1"
}
] | 2021-06-07 | [
[
"Nikkarinen",
"Irene",
""
],
[
"Pimentel",
"Tiago",
""
],
[
"Blasi",
"Damián E.",
""
],
[
"Cotterell",
"Ryan",
""
]
] | The unigram distribution is the non-contextual probability of finding a specific word form in a corpus. While of central importance to the study of language, it is commonly approximated by each word's sample frequency in the corpus. This approach, being highly dependent on sample size, assigns zero probability to any o... |
2311.09994 | Kathrin Grosse | Kathrin Grosse, Lukas Bieringer, Tarek Richard Besold, Alexandre Alahi | Towards more Practical Threat Models in Artificial Intelligence Security | 18 pages, 4 figures, 8 tables, accepted to Usenix Security,
incorporated external feedback | null | null | null | cs.CR cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent works have identified a gap between research and practice in
artificial intelligence security: threats studied in academia do not always
reflect the practical use and security risks of AI. For example, while models
are often studied in isolation, they form part of larger ML pipelines in
practice. Recent works ... | [
{
"created": "Thu, 16 Nov 2023 16:09:44 GMT",
"version": "v1"
},
{
"created": "Tue, 26 Mar 2024 13:06:28 GMT",
"version": "v2"
}
] | 2024-03-27 | [
[
"Grosse",
"Kathrin",
""
],
[
"Bieringer",
"Lukas",
""
],
[
"Besold",
"Tarek Richard",
""
],
[
"Alahi",
"Alexandre",
""
]
] | Recent works have identified a gap between research and practice in artificial intelligence security: threats studied in academia do not always reflect the practical use and security risks of AI. For example, while models are often studied in isolation, they form part of larger ML pipelines in practice. Recent works al... |
2011.03114 | Henggang Cui | Henggang Cui, Fang-Chieh Chou, Jake Charland, Carlos
Vallespi-Gonzalez, Nemanja Djuric | Uncertainty-Aware Vehicle Orientation Estimation for Joint
Detection-Prediction Models | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Object detection is a critical component of a self-driving system, tasked
with inferring the current states of the surrounding traffic actors. While
there exist a number of studies on the problem of inferring the position and
shape of vehicle actors, understanding actors' orientation remains a challenge
for existing ... | [
{
"created": "Thu, 5 Nov 2020 21:59:44 GMT",
"version": "v1"
}
] | 2020-11-09 | [
[
"Cui",
"Henggang",
""
],
[
"Chou",
"Fang-Chieh",
""
],
[
"Charland",
"Jake",
""
],
[
"Vallespi-Gonzalez",
"Carlos",
""
],
[
"Djuric",
"Nemanja",
""
]
] | Object detection is a critical component of a self-driving system, tasked with inferring the current states of the surrounding traffic actors. While there exist a number of studies on the problem of inferring the position and shape of vehicle actors, understanding actors' orientation remains a challenge for existing st... |
2306.02659 | Zhengzhe Xu | Zhengzhe Xu, Yanbo Chen, Zhuozhu Jian, Junbo Tan, Xueqian Wang, Bin
Liang | Hybrid Trajectory Optimization for Autonomous Terrain Traversal of
Articulated Tracked Robots | IEEE Robotics and Automation Letters (RA-L) | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Autonomous terrain traversal of articulated tracked robots can reduce
operator cognitive load to enhance task efficiency and facilitate extensive
deployment. We present a novel hybrid trajectory optimization method aimed at
generating efficient, stable, and smooth traversal motions. To achieve this, we
develop a plan... | [
{
"created": "Mon, 5 Jun 2023 07:48:28 GMT",
"version": "v1"
},
{
"created": "Wed, 22 Nov 2023 15:56:04 GMT",
"version": "v2"
},
{
"created": "Thu, 23 Nov 2023 05:22:42 GMT",
"version": "v3"
}
] | 2023-11-27 | [
[
"Xu",
"Zhengzhe",
""
],
[
"Chen",
"Yanbo",
""
],
[
"Jian",
"Zhuozhu",
""
],
[
"Tan",
"Junbo",
""
],
[
"Wang",
"Xueqian",
""
],
[
"Liang",
"Bin",
""
]
] | Autonomous terrain traversal of articulated tracked robots can reduce operator cognitive load to enhance task efficiency and facilitate extensive deployment. We present a novel hybrid trajectory optimization method aimed at generating efficient, stable, and smooth traversal motions. To achieve this, we develop a planar... |
2407.08787 | Wenshuo Peng | Wenshuo Peng, Kaipeng Zhang, Yue Yang, Hao Zhang, Yu Qiao | Data Adaptive Traceback for Vision-Language Foundation Models in Image
Classification | 9 pages,4 figures | null | 10.1609/aaai.v38i5.28249 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Vision-language foundation models have been incredibly successful in a wide
range of downstream computer vision tasks using adaptation methods. However,
due to the high cost of obtaining pre-training datasets, pairs with weak
image-text correlation in the data exist in large numbers. We call them
weak-paired samples.... | [
{
"created": "Thu, 11 Jul 2024 18:01:58 GMT",
"version": "v1"
}
] | 2024-07-15 | [
[
"Peng",
"Wenshuo",
""
],
[
"Zhang",
"Kaipeng",
""
],
[
"Yang",
"Yue",
""
],
[
"Zhang",
"Hao",
""
],
[
"Qiao",
"Yu",
""
]
] | Vision-language foundation models have been incredibly successful in a wide range of downstream computer vision tasks using adaptation methods. However, due to the high cost of obtaining pre-training datasets, pairs with weak image-text correlation in the data exist in large numbers. We call them weak-paired samples. D... |
2112.03376 | Michael Rawson | Michael Rawson, Radu Balan | Convergence Guarantees for Deep Epsilon Greedy Policy Learning | null | null | null | null | cs.LG cs.IT math.IT math.ST stat.TH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Policy learning is a quickly growing area. As robotics and computers control
day-to-day life, their error rate needs to be minimized and controlled. There
are many policy learning methods and bandit methods with provable error rates
that accompany them. We show an error or regret bound and convergence of the
Deep Eps... | [
{
"created": "Thu, 2 Dec 2021 04:05:54 GMT",
"version": "v1"
},
{
"created": "Thu, 27 Jan 2022 23:16:36 GMT",
"version": "v2"
}
] | 2022-01-31 | [
[
"Rawson",
"Michael",
""
],
[
"Balan",
"Radu",
""
]
] | Policy learning is a quickly growing area. As robotics and computers control day-to-day life, their error rate needs to be minimized and controlled. There are many policy learning methods and bandit methods with provable error rates that accompany them. We show an error or regret bound and convergence of the Deep Epsil... |
1407.3487 | Grigori Fursin | Grigori Fursin | Collective Tuning Initiative | GCC Developers' Summit'09, 14 June 2009, Montreal, Canada | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Computing systems rarely deliver best possible performance due to ever
increasing hardware and software complexity and limitations of the current
optimization technology. Additional code and architecture optimizations are
often required to improve execution time, size, power consumption, reliability
and other importa... | [
{
"created": "Sun, 13 Jul 2014 17:13:17 GMT",
"version": "v1"
}
] | 2014-07-15 | [
[
"Fursin",
"Grigori",
""
]
] | Computing systems rarely deliver best possible performance due to ever increasing hardware and software complexity and limitations of the current optimization technology. Additional code and architecture optimizations are often required to improve execution time, size, power consumption, reliability and other important... |
2205.10034 | Liang Shen | Dianhai Yu, Liang Shen, Hongxiang Hao, Weibao Gong, Huachao Wu, Jiang
Bian, Lirong Dai, Haoyi Xiong | MoESys: A Distributed and Efficient Mixture-of-Experts Training and
Inference System for Internet Services | null | null | null | null | cs.DC cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While modern internet services, such as chatbots, search engines, and online
advertising, demand the use of large-scale deep neural networks (DNNs),
distributed training and inference over heterogeneous computing systems are
desired to facilitate these DNN models. Mixture-of-Experts (MoE) is one the
most common strat... | [
{
"created": "Fri, 20 May 2022 09:09:27 GMT",
"version": "v1"
},
{
"created": "Mon, 12 Jun 2023 12:07:22 GMT",
"version": "v2"
},
{
"created": "Mon, 12 Aug 2024 09:23:13 GMT",
"version": "v3"
}
] | 2024-08-13 | [
[
"Yu",
"Dianhai",
""
],
[
"Shen",
"Liang",
""
],
[
"Hao",
"Hongxiang",
""
],
[
"Gong",
"Weibao",
""
],
[
"Wu",
"Huachao",
""
],
[
"Bian",
"Jiang",
""
],
[
"Dai",
"Lirong",
""
],
[
"Xiong",
"Haoyi... | While modern internet services, such as chatbots, search engines, and online advertising, demand the use of large-scale deep neural networks (DNNs), distributed training and inference over heterogeneous computing systems are desired to facilitate these DNN models. Mixture-of-Experts (MoE) is one the most common strateg... |
2002.01886 | Jeremy Castagno | Jeremy Castagno, Ella Atkins | Polylidar -- Polygons from Triangular Meshes | 8 pages, 9 Figures | null | 10.1109/LRA.2020.3002212 | null | cs.CG cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents Polylidar, an efficient algorithm to extract non-convex
polygons from 2D point sets, including interior holes. Plane segmented point
clouds can be input into Polylidar to extract their polygonal counterpart,
thereby reducing map size and improving visualization. The algorithm begins by
triangulati... | [
{
"created": "Wed, 5 Feb 2020 17:50:57 GMT",
"version": "v1"
},
{
"created": "Sat, 6 Jun 2020 12:31:52 GMT",
"version": "v2"
}
] | 2020-07-24 | [
[
"Castagno",
"Jeremy",
""
],
[
"Atkins",
"Ella",
""
]
] | This paper presents Polylidar, an efficient algorithm to extract non-convex polygons from 2D point sets, including interior holes. Plane segmented point clouds can be input into Polylidar to extract their polygonal counterpart, thereby reducing map size and improving visualization. The algorithm begins by triangulating... |
2011.14214 | Anadi Chaman | Anadi Chaman (1), Ivan Dokmani\'c (2) ((1) University of Illinois at
Urbana-Champaign, (2) University of Basel) | Truly shift-invariant convolutional neural networks | null | null | null | null | cs.CV cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Thanks to the use of convolution and pooling layers, convolutional neural
networks were for a long time thought to be shift-invariant. However, recent
works have shown that the output of a CNN can change significantly with small
shifts in input: a problem caused by the presence of downsampling (stride)
layers. The ex... | [
{
"created": "Sat, 28 Nov 2020 20:57:35 GMT",
"version": "v1"
},
{
"created": "Tue, 1 Dec 2020 12:46:12 GMT",
"version": "v2"
},
{
"created": "Fri, 4 Dec 2020 12:18:15 GMT",
"version": "v3"
},
{
"created": "Tue, 30 Mar 2021 19:47:57 GMT",
"version": "v4"
}
] | 2021-04-01 | [
[
"Chaman",
"Anadi",
""
],
[
"Dokmanić",
"Ivan",
""
]
] | Thanks to the use of convolution and pooling layers, convolutional neural networks were for a long time thought to be shift-invariant. However, recent works have shown that the output of a CNN can change significantly with small shifts in input: a problem caused by the presence of downsampling (stride) layers. The exis... |
1501.02035 | EPTCS | Adri\'an Riesco (Universidad Complutense de Madrid), Juan
Rodr\'iguez-Hortal\'a (Lambdoop Solutions) | Lifting Term Rewriting Derivations in Constructor Systems by Using
Generators | In Proceedings PROLE 2014, arXiv:1501.01693 | EPTCS 173, 2015, pp. 87-99 | 10.4204/EPTCS.173.7 | null | cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Narrowing is a procedure that was first studied in the context of equational
E-unification and that has been used in a wide range of applications. The
classic completeness result due to Hullot states that any term rewriting
derivation starting from an instance of an expression can be "lifted" to a
narrowing derivatio... | [
{
"created": "Fri, 9 Jan 2015 04:00:31 GMT",
"version": "v1"
}
] | 2019-08-15 | [
[
"Riesco",
"Adrián",
"",
"Universidad Complutense de Madrid"
],
[
"Rodríguez-Hortalá",
"Juan",
"",
"Lambdoop Solutions"
]
] | Narrowing is a procedure that was first studied in the context of equational E-unification and that has been used in a wide range of applications. The classic completeness result due to Hullot states that any term rewriting derivation starting from an instance of an expression can be "lifted" to a narrowing derivation,... |
2203.15507 | Bhagyashri Telsang | Bhagyashri Telsang and Seddik Djouadi | Computation of Centroidal Voronoi Tessellations in High Dimensional
spaces | null | null | null | null | cs.CG | http://creativecommons.org/licenses/by/4.0/ | Owing to the natural interpretation and various desirable mathematical
properties, centroidal Voronoi tessellations (CVT) have found a wide range of
applications and correspondingly a vast development in their literature.
However the computation of CVT in higher dimensional spaces still remains
difficult. In this pap... | [
{
"created": "Thu, 24 Mar 2022 20:31:27 GMT",
"version": "v1"
}
] | 2022-03-30 | [
[
"Telsang",
"Bhagyashri",
""
],
[
"Djouadi",
"Seddik",
""
]
] | Owing to the natural interpretation and various desirable mathematical properties, centroidal Voronoi tessellations (CVT) have found a wide range of applications and correspondingly a vast development in their literature. However the computation of CVT in higher dimensional spaces still remains difficult. In this paper... |
1803.00259 | Jun Zhao | Jun Zhao, Guang Qiu, Ziyu Guan, Wei Zhao, Xiaofei He | Deep Reinforcement Learning for Sponsored Search Real-time Bidding | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Bidding optimization is one of the most critical problems in online
advertising. Sponsored search (SS) auction, due to the randomness of user query
behavior and platform nature, usually adopts keyword-level bidding strategies.
In contrast, the display advertising (DA), as a relatively simpler scenario for
auction, ha... | [
{
"created": "Thu, 1 Mar 2018 09:04:37 GMT",
"version": "v1"
}
] | 2018-03-02 | [
[
"Zhao",
"Jun",
""
],
[
"Qiu",
"Guang",
""
],
[
"Guan",
"Ziyu",
""
],
[
"Zhao",
"Wei",
""
],
[
"He",
"Xiaofei",
""
]
] | Bidding optimization is one of the most critical problems in online advertising. Sponsored search (SS) auction, due to the randomness of user query behavior and platform nature, usually adopts keyword-level bidding strategies. In contrast, the display advertising (DA), as a relatively simpler scenario for auction, has ... |
2011.12599 | Valentina Anita Carriero | Valentina Anita Carriero, Marilena Daquino, Aldo Gangemi, Andrea
Giovanni Nuzzolese, Silvio Peroni, Valentina Presutti, Francesca Tomasi | The Landscape of Ontology Reuse Approaches | null | null | 10.3233/SSW200033 | null | cs.AI | http://creativecommons.org/licenses/by/4.0/ | Ontology reuse aims to foster interoperability and facilitate knowledge
reuse. Several approaches are typically evaluated by ontology engineers when
bootstrapping a new project. However, current practices are often motivated by
subjective, case-by-case decisions, which hamper the definition of a
recommended behaviour... | [
{
"created": "Wed, 25 Nov 2020 09:21:07 GMT",
"version": "v1"
}
] | 2021-01-01 | [
[
"Carriero",
"Valentina Anita",
""
],
[
"Daquino",
"Marilena",
""
],
[
"Gangemi",
"Aldo",
""
],
[
"Nuzzolese",
"Andrea Giovanni",
""
],
[
"Peroni",
"Silvio",
""
],
[
"Presutti",
"Valentina",
""
],
[
"Tomasi",
"F... | Ontology reuse aims to foster interoperability and facilitate knowledge reuse. Several approaches are typically evaluated by ontology engineers when bootstrapping a new project. However, current practices are often motivated by subjective, case-by-case decisions, which hamper the definition of a recommended behaviour. ... |
1709.09662 | Jeffrey Johnson | Jeffrey Kane Johnson | Image Space Potential Fields: Constant Size Environment Representation
for Vision-based Subsumption Control Architectures | Maeve Automation Technical Report. arXiv admin note: text overlap
with arXiv:1709.03947 | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This technical report presents an environment representation for use in
vision-based navigation. The representation has two useful properties: 1) it
has constant size, which can enable strong run-time guarantees to be made for
control algorithms using it, and 2) it is structurally similar to a camera
image space, whi... | [
{
"created": "Tue, 26 Sep 2017 22:02:53 GMT",
"version": "v1"
}
] | 2017-09-29 | [
[
"Johnson",
"Jeffrey Kane",
""
]
] | This technical report presents an environment representation for use in vision-based navigation. The representation has two useful properties: 1) it has constant size, which can enable strong run-time guarantees to be made for control algorithms using it, and 2) it is structurally similar to a camera image space, which... |
1511.04023 | Qian Ma | Qian Ma, Ya-Feng Liu, and Jianwei Huang | Time and Location Aware Mobile Data Pricing | This manuscript serves as the online technical report of the article
accepted by IEEE Transactions on Mobile Computing | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Mobile users' correlated mobility and data consumption patterns often lead to
severe cellular network congestion in peak hours and hot spots. This paper
presents an optimal design of time and location aware mobile data pricing,
which incentivizes users to smooth traffic and reduce network congestion. We
derive the op... | [
{
"created": "Thu, 12 Nov 2015 19:30:16 GMT",
"version": "v1"
}
] | 2015-11-13 | [
[
"Ma",
"Qian",
""
],
[
"Liu",
"Ya-Feng",
""
],
[
"Huang",
"Jianwei",
""
]
] | Mobile users' correlated mobility and data consumption patterns often lead to severe cellular network congestion in peak hours and hot spots. This paper presents an optimal design of time and location aware mobile data pricing, which incentivizes users to smooth traffic and reduce network congestion. We derive the opti... |
1608.07952 | Alex Olieman | Alex Olieman, Jaap Kamps, Gleb Satyukov, Emil de Valk | Topical Generalization for Presentation of User Profiles | (to be) presented at DIR'16, November 25, 2016, Delft, The
Netherlands | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Fine-grained user profile generation approaches have made it increasingly
feasible to display on a profile page in which topics a user has expertise or
interest. Earlier work on topical user profiling has been directed at enhancing
search and personalization functionality, but making such profiles useful for
human co... | [
{
"created": "Mon, 29 Aug 2016 08:47:12 GMT",
"version": "v1"
},
{
"created": "Sat, 15 Oct 2016 05:24:51 GMT",
"version": "v2"
},
{
"created": "Sun, 20 Nov 2016 01:52:00 GMT",
"version": "v3"
}
] | 2016-11-22 | [
[
"Olieman",
"Alex",
""
],
[
"Kamps",
"Jaap",
""
],
[
"Satyukov",
"Gleb",
""
],
[
"de Valk",
"Emil",
""
]
] | Fine-grained user profile generation approaches have made it increasingly feasible to display on a profile page in which topics a user has expertise or interest. Earlier work on topical user profiling has been directed at enhancing search and personalization functionality, but making such profiles useful for human cons... |
1904.01554 | Ali Payani | Ali Payani and Faramarz Fekri | Learning Algorithms via Neural Logic Networks | Under Review in ICLM2019 | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a novel learning paradigm for Deep Neural Networks (DNN) by using
Boolean logic algebra. We first present the basic differentiable operators of a
Boolean system such as conjunction, disjunction and exclusive-OR and show how
these elementary operators can be combined in a simple and meaningful way to
form N... | [
{
"created": "Tue, 2 Apr 2019 17:17:02 GMT",
"version": "v1"
}
] | 2019-04-10 | [
[
"Payani",
"Ali",
""
],
[
"Fekri",
"Faramarz",
""
]
] | We propose a novel learning paradigm for Deep Neural Networks (DNN) by using Boolean logic algebra. We first present the basic differentiable operators of a Boolean system such as conjunction, disjunction and exclusive-OR and show how these elementary operators can be combined in a simple and meaningful way to form Neu... |
cs/0702099 | Ruoheng Liu | Ruoheng Liu, Ivana Maric, Predrag Spasojevic, and Roy D. Yates | Discrete Memoryless Interference and Broadcast Channels with
Confidential Messages: Secrecy Rate Regions | to appear Special Issue of IEEE Transactions on Information Theory on
Information Theoretic Security | null | 10.1109/TIT.2008.921879 | null | cs.IT math.IT | null | We study information-theoretic security for discrete memoryless interference
and broadcast channels with independent confidential messages sent to two
receivers. Confidential messages are transmitted to their respective receivers
with information-theoretic secrecy. That is, each receiver is kept in total
ignorance wi... | [
{
"created": "Sat, 17 Feb 2007 21:02:37 GMT",
"version": "v1"
},
{
"created": "Tue, 11 Dec 2007 23:12:34 GMT",
"version": "v2"
}
] | 2016-11-15 | [
[
"Liu",
"Ruoheng",
""
],
[
"Maric",
"Ivana",
""
],
[
"Spasojevic",
"Predrag",
""
],
[
"Yates",
"Roy D.",
""
]
] | We study information-theoretic security for discrete memoryless interference and broadcast channels with independent confidential messages sent to two receivers. Confidential messages are transmitted to their respective receivers with information-theoretic secrecy. That is, each receiver is kept in total ignorance with... |
1211.6166 | Tao Zhu | Tao Zhu, David Phipps, Adam Pridgen, Jedidiah R. Crandall, Dan S.
Wallach | Tracking and Quantifying Censorship on a Chinese Microblogging Site | null | null | null | null | cs.IR cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present measurements and analysis of censorship on Weibo, a popular
microblogging site in China. Since we were limited in the rate at which we
could download posts, we identified users likely to participate in sensitive
topics and recursively followed their social contacts. We also leveraged new
natural language p... | [
{
"created": "Mon, 26 Nov 2012 23:54:27 GMT",
"version": "v1"
}
] | 2012-11-28 | [
[
"Zhu",
"Tao",
""
],
[
"Phipps",
"David",
""
],
[
"Pridgen",
"Adam",
""
],
[
"Crandall",
"Jedidiah R.",
""
],
[
"Wallach",
"Dan S.",
""
]
] | We present measurements and analysis of censorship on Weibo, a popular microblogging site in China. Since we were limited in the rate at which we could download posts, we identified users likely to participate in sensitive topics and recursively followed their social contacts. We also leveraged new natural language pro... |
2202.00598 | Sigrun May | Sigrun May, Sven Hartmann and Frank Klawonn | Combined Pruning for Nested Cross-Validation to Accelerate Automated
Hyperparameter Optimization for Embedded Feature Selection in
High-Dimensional Data with Very Small Sample Sizes | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Background: Embedded feature selection in high-dimensional data with very
small sample sizes requires optimized hyperparameters for the model building
process. For this hyperparameter optimization, nested cross-validation must be
applied to avoid a biased performance estimation. The resulting repeated
training with h... | [
{
"created": "Tue, 1 Feb 2022 17:42:37 GMT",
"version": "v1"
},
{
"created": "Mon, 12 Sep 2022 14:59:00 GMT",
"version": "v2"
}
] | 2022-09-13 | [
[
"May",
"Sigrun",
""
],
[
"Hartmann",
"Sven",
""
],
[
"Klawonn",
"Frank",
""
]
] | Background: Embedded feature selection in high-dimensional data with very small sample sizes requires optimized hyperparameters for the model building process. For this hyperparameter optimization, nested cross-validation must be applied to avoid a biased performance estimation. The resulting repeated training with hig... |
2308.06111 | Lars Hillebrand | Lars Hillebrand, Armin Berger, Tobias Deu{\ss}er, Tim Dilmaghani,
Mohamed Khaled, Bernd Kliem, R\"udiger Loitz, Maren Pielka, David Leonhard,
Christian Bauckhage, Rafet Sifa | Improving Zero-Shot Text Matching for Financial Auditing with Large
Language Models | Accepted at DocEng 2023, 4 pages, 1 figure, 2 tables | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Auditing financial documents is a very tedious and time-consuming process. As
of today, it can already be simplified by employing AI-based solutions to
recommend relevant text passages from a report for each legal requirement of
rigorous accounting standards. However, these methods need to be fine-tuned
regularly, an... | [
{
"created": "Fri, 11 Aug 2023 12:55:09 GMT",
"version": "v1"
},
{
"created": "Mon, 14 Aug 2023 07:45:17 GMT",
"version": "v2"
}
] | 2023-08-15 | [
[
"Hillebrand",
"Lars",
""
],
[
"Berger",
"Armin",
""
],
[
"Deußer",
"Tobias",
""
],
[
"Dilmaghani",
"Tim",
""
],
[
"Khaled",
"Mohamed",
""
],
[
"Kliem",
"Bernd",
""
],
[
"Loitz",
"Rüdiger",
""
],
[
"... | Auditing financial documents is a very tedious and time-consuming process. As of today, it can already be simplified by employing AI-based solutions to recommend relevant text passages from a report for each legal requirement of rigorous accounting standards. However, these methods need to be fine-tuned regularly, and ... |
1110.3470 | David Lievens | David Lievens and Bill Harrison | Symmetric Encapsulated Multi-Methods | This paper is a variant of David Lievens, William Harrison: Symmetric
encapsulated multi-methods to abstract over application structure. SAC 2009:
1873-1880 that includes full details of the proof of the type soundness
result stated in the original | null | null | null | cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In object systems, classes take the role of modules, and interfaces consist
of methods. Because methods are encapsulated in objects, interfaces in object
systems do not allow abstracting over \emph{where} methods are implemented.
This implies that any change to the implementation structure may cause a
rippling effect... | [
{
"created": "Sun, 16 Oct 2011 10:52:53 GMT",
"version": "v1"
}
] | 2011-10-18 | [
[
"Lievens",
"David",
""
],
[
"Harrison",
"Bill",
""
]
] | In object systems, classes take the role of modules, and interfaces consist of methods. Because methods are encapsulated in objects, interfaces in object systems do not allow abstracting over \emph{where} methods are implemented. This implies that any change to the implementation structure may cause a rippling effect. ... |
2103.11061 | Abu Md Niamul Taufique | Abu Md Niamul Taufique, Navya Nagananda, Andreas Savakis | Visualization of Deep Transfer Learning In SAR Imagery | 4 pages, 5 figures | IGARSS 2020 - 2020 IEEE International Geoscience and Remote
Sensing Symposium | 10.1109/IGARSS39084.2020.9324490 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Synthetic Aperture Radar (SAR) imagery has diverse applications in land and
marine surveillance. Unlike electro-optical (EO) systems, these systems are not
affected by weather conditions and can be used in the day and night times. With
the growing importance of SAR imagery, it would be desirable if models trained
on ... | [
{
"created": "Sat, 20 Mar 2021 00:16:15 GMT",
"version": "v1"
}
] | 2021-03-23 | [
[
"Taufique",
"Abu Md Niamul",
""
],
[
"Nagananda",
"Navya",
""
],
[
"Savakis",
"Andreas",
""
]
] | Synthetic Aperture Radar (SAR) imagery has diverse applications in land and marine surveillance. Unlike electro-optical (EO) systems, these systems are not affected by weather conditions and can be used in the day and night times. With the growing importance of SAR imagery, it would be desirable if models trained on wi... |
1911.13214 | Lionel Eyraud-Dubois | Julien Herrmann (UB, LaBRI, TADAAM), Olivier Beaumont (HiePACS, UB,
LaBRI), Lionel Eyraud-Dubois (HiePACS, UB, LaBRI), Julien Hermann, Alexis
Joly (ZENITH, LIRMM, UM), Alena Shilova (HiePACS, UB, LaBRI) | Optimal checkpointing for heterogeneous chains: how to train deep neural
networks with limited memory | null | null | null | null | cs.LG cs.DC cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper introduces a new activation checkpointing method which allows to
significantly decrease memory usage when training Deep Neural Networks with the
back-propagation algorithm. Similarly to checkpoint-ing techniques coming from
the literature on Automatic Differentiation, it consists in dynamically
selecting t... | [
{
"created": "Wed, 27 Nov 2019 13:05:11 GMT",
"version": "v1"
}
] | 2019-12-02 | [
[
"Herrmann",
"Julien",
"",
"UB, LaBRI, TADAAM"
],
[
"Beaumont",
"Olivier",
"",
"HiePACS, UB,\n LaBRI"
],
[
"Eyraud-Dubois",
"Lionel",
"",
"HiePACS, UB, LaBRI"
],
[
"Hermann",
"Julien",
"",
"ZENITH, LIRMM, UM"
],
[
"Joly",
"Ale... | This paper introduces a new activation checkpointing method which allows to significantly decrease memory usage when training Deep Neural Networks with the back-propagation algorithm. Similarly to checkpoint-ing techniques coming from the literature on Automatic Differentiation, it consists in dynamically selecting the... |
2111.03089 | Rinat Aynulin | Rinat Aynulin, Pavel Chebotarev | Measuring Proximity in Attributed Networks for Community Detection | null | Studies in Computational Intelligence 943 (2021) 27-37 | 10.1007/978-3-030-65347-7_3 | null | cs.SI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Proximity measures on graphs have a variety of applications in network
analysis, including community detection. Previously they have been mainly
studied in the context of networks without attributes. If node attributes are
taken into account, however, this can provide more insight into the network
structure. In this ... | [
{
"created": "Thu, 4 Nov 2021 18:07:05 GMT",
"version": "v1"
}
] | 2022-12-06 | [
[
"Aynulin",
"Rinat",
""
],
[
"Chebotarev",
"Pavel",
""
]
] | Proximity measures on graphs have a variety of applications in network analysis, including community detection. Previously they have been mainly studied in the context of networks without attributes. If node attributes are taken into account, however, this can provide more insight into the network structure. In this pa... |
1805.04956 | Moritz Lipp | Moritz Lipp and Misiker Tadesse Aga and Michael Schwarz and Daniel
Gruss and Cl\'ementine Maurice and Lukas Raab and Lukas Lamster | Nethammer: Inducing Rowhammer Faults through Network Requests | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A fundamental assumption in software security is that memory contents do not
change unless there is a legitimate deliberate modification. Classical fault
attacks show that this assumption does not hold if the attacker has physical
access. Rowhammer attacks showed that local code execution is already
sufficient to bre... | [
{
"created": "Sun, 13 May 2018 21:38:29 GMT",
"version": "v1"
}
] | 2018-05-15 | [
[
"Lipp",
"Moritz",
""
],
[
"Aga",
"Misiker Tadesse",
""
],
[
"Schwarz",
"Michael",
""
],
[
"Gruss",
"Daniel",
""
],
[
"Maurice",
"Clémentine",
""
],
[
"Raab",
"Lukas",
""
],
[
"Lamster",
"Lukas",
""
]
] | A fundamental assumption in software security is that memory contents do not change unless there is a legitimate deliberate modification. Classical fault attacks show that this assumption does not hold if the attacker has physical access. Rowhammer attacks showed that local code execution is already sufficient to break... |
2310.02439 | Naiming (Lucy) Liu | Naiming Liu, Shashank Sonkar, Zichao Wang, Simon Woodhead, Richard G.
Baraniuk | Novice Learner and Expert Tutor: Evaluating Math Reasoning Abilities of
Large Language Models with Misconceptions | null | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | We propose novel evaluations for mathematical reasoning capabilities of Large
Language Models (LLMs) based on mathematical misconceptions. Our primary
approach is to simulate LLMs as a novice learner and an expert tutor, aiming to
identify the incorrect answer to math question resulted from a specific
misconception a... | [
{
"created": "Tue, 3 Oct 2023 21:19:50 GMT",
"version": "v1"
}
] | 2023-10-05 | [
[
"Liu",
"Naiming",
""
],
[
"Sonkar",
"Shashank",
""
],
[
"Wang",
"Zichao",
""
],
[
"Woodhead",
"Simon",
""
],
[
"Baraniuk",
"Richard G.",
""
]
] | We propose novel evaluations for mathematical reasoning capabilities of Large Language Models (LLMs) based on mathematical misconceptions. Our primary approach is to simulate LLMs as a novice learner and an expert tutor, aiming to identify the incorrect answer to math question resulted from a specific misconception and... |
2407.19546 | Zeyu Zhang | Biao Wu, Yutong Xie, Zeyu Zhang, Minh Hieu Phan, Qi Chen, Ling Chen,
Qi Wu | XLIP: Cross-modal Attention Masked Modelling for Medical Language-Image
Pre-Training | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Vision-and-language pretraining (VLP) in the medical field utilizes
contrastive learning on image-text pairs to achieve effective transfer across
tasks. Yet, current VLP approaches with the masked modelling strategy face two
challenges when applied to the medical domain. First, current models struggle
to accurately r... | [
{
"created": "Sun, 28 Jul 2024 17:38:21 GMT",
"version": "v1"
},
{
"created": "Fri, 2 Aug 2024 10:53:37 GMT",
"version": "v2"
}
] | 2024-08-05 | [
[
"Wu",
"Biao",
""
],
[
"Xie",
"Yutong",
""
],
[
"Zhang",
"Zeyu",
""
],
[
"Phan",
"Minh Hieu",
""
],
[
"Chen",
"Qi",
""
],
[
"Chen",
"Ling",
""
],
[
"Wu",
"Qi",
""
]
] | Vision-and-language pretraining (VLP) in the medical field utilizes contrastive learning on image-text pairs to achieve effective transfer across tasks. Yet, current VLP approaches with the masked modelling strategy face two challenges when applied to the medical domain. First, current models struggle to accurately rec... |
2012.11067 | Alexey Ignatiev | Alexey Ignatiev, Nina Narodytska, Nicholas Asher, Joao Marques-Silva | On Relating 'Why?' and 'Why Not?' Explanations | null | null | null | null | cs.LG cs.AI cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Explanations of Machine Learning (ML) models often address a 'Why?' question.
Such explanations can be related with selecting feature-value pairs which are
sufficient for the prediction. Recent work has investigated explanations that
address a 'Why Not?' question, i.e. finding a change of feature values that
guarante... | [
{
"created": "Mon, 21 Dec 2020 01:07:13 GMT",
"version": "v1"
}
] | 2020-12-22 | [
[
"Ignatiev",
"Alexey",
""
],
[
"Narodytska",
"Nina",
""
],
[
"Asher",
"Nicholas",
""
],
[
"Marques-Silva",
"Joao",
""
]
] | Explanations of Machine Learning (ML) models often address a 'Why?' question. Such explanations can be related with selecting feature-value pairs which are sufficient for the prediction. Recent work has investigated explanations that address a 'Why Not?' question, i.e. finding a change of feature values that guarantee ... |
2310.20138 | Xinwei Wu | Xinwei Wu, Junzhuo Li, Minghui Xu, Weilong Dong, Shuangzhi Wu, Chao
Bian, Deyi Xiong | DEPN: Detecting and Editing Privacy Neurons in Pretrained Language
Models | EMNLP 2023 | null | null | null | cs.CR cs.CL | http://creativecommons.org/publicdomain/zero/1.0/ | Large language models pretrained on a huge amount of data capture rich
knowledge and information in the training data. The ability of data
memorization and regurgitation in pretrained language models, revealed in
previous studies, brings the risk of data leakage. In order to effectively
reduce these risks, we propose... | [
{
"created": "Tue, 31 Oct 2023 03:09:36 GMT",
"version": "v1"
},
{
"created": "Tue, 5 Dec 2023 16:14:24 GMT",
"version": "v2"
}
] | 2023-12-06 | [
[
"Wu",
"Xinwei",
""
],
[
"Li",
"Junzhuo",
""
],
[
"Xu",
"Minghui",
""
],
[
"Dong",
"Weilong",
""
],
[
"Wu",
"Shuangzhi",
""
],
[
"Bian",
"Chao",
""
],
[
"Xiong",
"Deyi",
""
]
] | Large language models pretrained on a huge amount of data capture rich knowledge and information in the training data. The ability of data memorization and regurgitation in pretrained language models, revealed in previous studies, brings the risk of data leakage. In order to effectively reduce these risks, we propose a... |
2402.16029 | Nuo Chen | Nuo Chen, Yuhan Li, Jianheng Tang, Jia Li | GraphWiz: An Instruction-Following Language Model for Graph Problems | 27pages, 15 tables | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Large language models (LLMs) have achieved impressive success across several
fields, but their proficiency in understanding and resolving complex graph
problems is less explored. To bridge this gap, we introduce GraphInstruct, a
novel and comprehensive instruction-tuning dataset designed to equip language
models with... | [
{
"created": "Sun, 25 Feb 2024 08:41:32 GMT",
"version": "v1"
},
{
"created": "Wed, 6 Mar 2024 13:52:12 GMT",
"version": "v2"
},
{
"created": "Mon, 1 Jul 2024 09:15:38 GMT",
"version": "v3"
},
{
"created": "Tue, 2 Jul 2024 06:40:30 GMT",
"version": "v4"
},
{
"crea... | 2024-07-04 | [
[
"Chen",
"Nuo",
""
],
[
"Li",
"Yuhan",
""
],
[
"Tang",
"Jianheng",
""
],
[
"Li",
"Jia",
""
]
] | Large language models (LLMs) have achieved impressive success across several fields, but their proficiency in understanding and resolving complex graph problems is less explored. To bridge this gap, we introduce GraphInstruct, a novel and comprehensive instruction-tuning dataset designed to equip language models with t... |
2204.10982 | Pradeep Kr. Banerjee | Johannes Rauh, Pradeep Kr. Banerjee, Eckehard Olbrich, Guido
Mont\'ufar, J\"urgen Jost | Continuity and Additivity Properties of Information Decompositions | 17 pages | International Journal of Approximate Reasoning, 2023 | null | null | cs.IT math.IT | http://creativecommons.org/licenses/by/4.0/ | Information decompositions quantify how the Shannon information about a given
random variable is distributed among several other random variables. Various
requirements have been proposed that such a decomposition should satisfy,
leading to different candidate solutions. Curiously, however, only two of the
original re... | [
{
"created": "Sat, 23 Apr 2022 03:45:18 GMT",
"version": "v1"
},
{
"created": "Sun, 9 Jul 2023 15:00:06 GMT",
"version": "v2"
}
] | 2023-07-11 | [
[
"Rauh",
"Johannes",
""
],
[
"Banerjee",
"Pradeep Kr.",
""
],
[
"Olbrich",
"Eckehard",
""
],
[
"Montúfar",
"Guido",
""
],
[
"Jost",
"Jürgen",
""
]
] | Information decompositions quantify how the Shannon information about a given random variable is distributed among several other random variables. Various requirements have been proposed that such a decomposition should satisfy, leading to different candidate solutions. Curiously, however, only two of the original requ... |
2010.14565 | Li-Chia Yang | Li-Chia Yang, Alexander Lerch | Remixing Music with Visual Conditioning | null | 2020 IEEE International Symposium on Multimedia | null | null | cs.SD cs.MM eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a visually conditioned music remixing system by incorporating deep
visual and audio models. The method is based on a state of the art audio-visual
source separation model which performs music instrument source separation with
video information. We modified the model to work with user-selected images
instea... | [
{
"created": "Tue, 27 Oct 2020 19:12:08 GMT",
"version": "v1"
}
] | 2020-10-29 | [
[
"Yang",
"Li-Chia",
""
],
[
"Lerch",
"Alexander",
""
]
] | We propose a visually conditioned music remixing system by incorporating deep visual and audio models. The method is based on a state of the art audio-visual source separation model which performs music instrument source separation with video information. We modified the model to work with user-selected images instead ... |
2109.04258 | Xiaodong Jia | Xiaodong Jia, Ashish Kumar, Gang Tan | A Derivative-based Parser Generator for Visibly Pushdown Grammars | null | null | null | null | cs.PL cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we present a derivative-based, functional recognizer and
parser generator for visibly pushdown grammars. The generated parser accepts
ambiguous grammars and produces a parse forest containing all valid parse trees
for an input string in linear time. Each parse tree in the forest can then be
extracted a... | [
{
"created": "Thu, 9 Sep 2021 13:28:31 GMT",
"version": "v1"
},
{
"created": "Fri, 10 Sep 2021 01:50:05 GMT",
"version": "v2"
}
] | 2021-09-13 | [
[
"Jia",
"Xiaodong",
""
],
[
"Kumar",
"Ashish",
""
],
[
"Tan",
"Gang",
""
]
] | In this paper, we present a derivative-based, functional recognizer and parser generator for visibly pushdown grammars. The generated parser accepts ambiguous grammars and produces a parse forest containing all valid parse trees for an input string in linear time. Each parse tree in the forest can then be extracted als... |
1512.03022 | Robert Elsaesser | Chen Avin and Robert Els\"asser | Breaking the log n barrier on rumor spreading | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | $O(\log n)$ rounds has been a well known upper bound for rumor spreading
using push&pull in the random phone call model (i.e., uniform gossip in the
complete graph). A matching lower bound of $\Omega(\log n)$ is also known for
this special case. Under the assumption of this model and with a natural
addition that node... | [
{
"created": "Tue, 8 Dec 2015 16:56:19 GMT",
"version": "v1"
}
] | 2015-12-10 | [
[
"Avin",
"Chen",
""
],
[
"Elsässer",
"Robert",
""
]
] | $O(\log n)$ rounds has been a well known upper bound for rumor spreading using push&pull in the random phone call model (i.e., uniform gossip in the complete graph). A matching lower bound of $\Omega(\log n)$ is also known for this special case. Under the assumption of this model and with a natural addition that nodes ... |
1508.01006 | Dongxu Zhang | Dongxu Zhang and Dong Wang | Relation Classification via Recurrent Neural Network | null | null | null | null | cs.CL cs.LG cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep learning has gained much success in sentence-level relation
classification. For example, convolutional neural networks (CNN) have delivered
competitive performance without much effort on feature engineering as the
conventional pattern-based methods. Thus a lot of works have been produced
based on CNN structures.... | [
{
"created": "Wed, 5 Aug 2015 09:03:46 GMT",
"version": "v1"
},
{
"created": "Fri, 25 Dec 2015 03:51:00 GMT",
"version": "v2"
}
] | 2015-12-29 | [
[
"Zhang",
"Dongxu",
""
],
[
"Wang",
"Dong",
""
]
] | Deep learning has gained much success in sentence-level relation classification. For example, convolutional neural networks (CNN) have delivered competitive performance without much effort on feature engineering as the conventional pattern-based methods. Thus a lot of works have been produced based on CNN structures. H... |
1103.3113 | Xiaojun Tang | Xiaojun Tang, Ruoheng Liu, Predrag Spasojevic, H. Vincent Poor | A Broadcast Approach To Secret Key Generation Over Slow Fading Channels | submitted to IEEE Trans. Information Theory | null | null | null | cs.IT cs.CR math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A secret-key generation scheme based on a layered broadcasting strategy is
introduced for slow-fading channels. In the model considered, Alice wants to
share a key with Bob while keeping the key secret from Eve, who is a passive
eavesdropper. Both Alice-Bob and Alice-Eve channels are assumed to undergo slow
fading, a... | [
{
"created": "Wed, 16 Mar 2011 07:03:51 GMT",
"version": "v1"
}
] | 2011-03-17 | [
[
"Tang",
"Xiaojun",
""
],
[
"Liu",
"Ruoheng",
""
],
[
"Spasojevic",
"Predrag",
""
],
[
"Poor",
"H. Vincent",
""
]
] | A secret-key generation scheme based on a layered broadcasting strategy is introduced for slow-fading channels. In the model considered, Alice wants to share a key with Bob while keeping the key secret from Eve, who is a passive eavesdropper. Both Alice-Bob and Alice-Eve channels are assumed to undergo slow fading, and... |
1203.0369 | Ak Rs | Abhijit Chowdhury (NSHM College of Management & Technology, Durgapur
West Bengal, INDIA), Angshu Kumar Sinha (NSHM College of Management &
Technology, Durgapur West Bengal, INDIA) Saurabh Dutta (Dr. B.C Roy
Engineering College West Bengal, INDIA) | Introduction of a Triple Prime Symmetric Key Block Cipher | null | International Journal of Computer Applications (0975 - 8887)
Volume 39 - No.7, February 2012 | 10.5120/4831-7089 | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper proposes to put forward an innovative algorithm for symmetric key
block cipher named as "Triple Prime Symmetric Key Block Cipher with Variable
Key-Spaces (TPSKBCVK)" that employs triple prime integers as private key-spaces
of varying lengths to encrypt data files. Principles of modular arithmetic have
been... | [
{
"created": "Fri, 2 Mar 2012 04:50:35 GMT",
"version": "v1"
}
] | 2012-03-19 | [
[
"Chowdhury",
"Abhijit",
"",
"NSHM College of Management & Technology, Durgapur\n West Bengal, INDIA"
],
[
"Sinha",
"Angshu Kumar",
"",
"NSHM College of Management &\n Technology, Durgapur West Bengal, INDIA"
],
[
"Dutta",
"Saurabh",
"",
"Dr. B.C Roy\n Eng... | This paper proposes to put forward an innovative algorithm for symmetric key block cipher named as "Triple Prime Symmetric Key Block Cipher with Variable Key-Spaces (TPSKBCVK)" that employs triple prime integers as private key-spaces of varying lengths to encrypt data files. Principles of modular arithmetic have been e... |
2206.13749 | Rongzhi Zhang | Rongzhi Zhang, Rebecca West, Xiquan Cui, Chao Zhang | Adaptive Multi-view Rule Discovery for Weakly-Supervised Compatible
Products Prediction | KDD 2022 Applied Data Science Track | null | 10.1145/3534678.3539208 | null | cs.LG cs.CL | http://creativecommons.org/licenses/by-nc-nd/4.0/ | On e-commerce platforms, predicting if two products are compatible with each
other is an important functionality to achieve trustworthy product
recommendation and search experience for consumers. However, accurately
predicting product compatibility is difficult due to the heterogeneous product
data and the lack of ma... | [
{
"created": "Tue, 28 Jun 2022 04:11:58 GMT",
"version": "v1"
}
] | 2022-06-29 | [
[
"Zhang",
"Rongzhi",
""
],
[
"West",
"Rebecca",
""
],
[
"Cui",
"Xiquan",
""
],
[
"Zhang",
"Chao",
""
]
] | On e-commerce platforms, predicting if two products are compatible with each other is an important functionality to achieve trustworthy product recommendation and search experience for consumers. However, accurately predicting product compatibility is difficult due to the heterogeneous product data and the lack of manu... |
1705.09552 | Seyed-Mohsen Moosavi-Dezfooli | Alhussein Fawzi, Seyed-Mohsen Moosavi-Dezfooli, Pascal Frossard,
Stefano Soatto | Classification regions of deep neural networks | null | null | null | null | cs.CV cs.AI cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The goal of this paper is to analyze the geometric properties of deep neural
network classifiers in the input space. We specifically study the topology of
classification regions created by deep networks, as well as their associated
decision boundary. Through a systematic empirical investigation, we show that
state-of... | [
{
"created": "Fri, 26 May 2017 12:38:48 GMT",
"version": "v1"
}
] | 2017-05-29 | [
[
"Fawzi",
"Alhussein",
""
],
[
"Moosavi-Dezfooli",
"Seyed-Mohsen",
""
],
[
"Frossard",
"Pascal",
""
],
[
"Soatto",
"Stefano",
""
]
] | The goal of this paper is to analyze the geometric properties of deep neural network classifiers in the input space. We specifically study the topology of classification regions created by deep networks, as well as their associated decision boundary. Through a systematic empirical investigation, we show that state-of-t... |
2305.09221 | Nazatul Haque Sultan | Nazatul H. Sultan, Shabnam Kasra-Kermanshahi, Yen Tran, Shangqi Lai,
Vijay Varadharajan, Surya Nepal, and Xun Yi | A Multi-Client Searchable Encryption Scheme for IoT Environment | 22 pages, 5 figures, this version was submitted to ESORICS 2023 | null | null | null | cs.CR | http://creativecommons.org/licenses/by/4.0/ | The proliferation of connected devices through Internet connectivity presents
both opportunities for smart applications and risks to security and privacy. It
is vital to proactively address these concerns to fully leverage the potential
of the Internet of Things. IoT services where one data owner serves multiple
clie... | [
{
"created": "Tue, 16 May 2023 06:53:39 GMT",
"version": "v1"
}
] | 2023-05-17 | [
[
"Sultan",
"Nazatul H.",
""
],
[
"Kasra-Kermanshahi",
"Shabnam",
""
],
[
"Tran",
"Yen",
""
],
[
"Lai",
"Shangqi",
""
],
[
"Varadharajan",
"Vijay",
""
],
[
"Nepal",
"Surya",
""
],
[
"Yi",
"Xun",
""
]
] | The proliferation of connected devices through Internet connectivity presents both opportunities for smart applications and risks to security and privacy. It is vital to proactively address these concerns to fully leverage the potential of the Internet of Things. IoT services where one data owner serves multiple client... |
2211.15656 | Hao Dong | Hao Dong, Xianjing Zhang, Jintao Xu, Rui Ai, Weihao Gu, Huimin Lu,
Juho Kannala and Xieyuanli Chen | SuperFusion: Multilevel LiDAR-Camera Fusion for Long-Range HD Map
Generation | null | null | null | null | cs.CV cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | High-definition (HD) semantic map generation of the environment is an
essential component of autonomous driving. Existing methods have achieved good
performance in this task by fusing different sensor modalities, such as LiDAR
and camera. However, current works are based on raw data or network
feature-level fusion an... | [
{
"created": "Mon, 28 Nov 2022 18:59:02 GMT",
"version": "v1"
},
{
"created": "Thu, 16 Mar 2023 16:01:22 GMT",
"version": "v2"
}
] | 2023-03-17 | [
[
"Dong",
"Hao",
""
],
[
"Zhang",
"Xianjing",
""
],
[
"Xu",
"Jintao",
""
],
[
"Ai",
"Rui",
""
],
[
"Gu",
"Weihao",
""
],
[
"Lu",
"Huimin",
""
],
[
"Kannala",
"Juho",
""
],
[
"Chen",
"Xieyuanli",
... | High-definition (HD) semantic map generation of the environment is an essential component of autonomous driving. Existing methods have achieved good performance in this task by fusing different sensor modalities, such as LiDAR and camera. However, current works are based on raw data or network feature-level fusion and ... |
1810.08691 | Dawei Liang | Dawei Liang, Edison Thomaz | Audio-Based Activities of Daily Living (ADL) Recognition with
Large-Scale Acoustic Embeddings from Online Videos | 18 pages,7 figures; new version: results updates | ACM IMWUT 3(1) 2019 Article 17 | 10.1145/3314404 | null | cs.HC cs.LG cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Over the years, activity sensing and recognition has been shown to play a key
enabling role in a wide range of applications, from sustainability and
human-computer interaction to health care. While many recognition tasks have
traditionally employed inertial sensors, acoustic-based methods offer the
benefit of capturi... | [
{
"created": "Fri, 19 Oct 2018 21:19:16 GMT",
"version": "v1"
},
{
"created": "Sun, 18 Nov 2018 09:08:24 GMT",
"version": "v2"
}
] | 2019-04-09 | [
[
"Liang",
"Dawei",
""
],
[
"Thomaz",
"Edison",
""
]
] | Over the years, activity sensing and recognition has been shown to play a key enabling role in a wide range of applications, from sustainability and human-computer interaction to health care. While many recognition tasks have traditionally employed inertial sensors, acoustic-based methods offer the benefit of capturing... |
2303.16411 | Zheng Naishan | Man Zhou, Naishan Zheng, Jie Huang, Chunle Guo, Chongyi Li | Unlocking Masked Autoencoders as Loss Function for Image and Video
Restoration | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Image and video restoration has achieved a remarkable leap with the advent of
deep learning. The success of deep learning paradigm lies in three key
components: data, model, and loss. Currently, many efforts have been devoted to
the first two while seldom study focuses on loss function. With the question
``are the de... | [
{
"created": "Wed, 29 Mar 2023 02:41:08 GMT",
"version": "v1"
}
] | 2023-03-30 | [
[
"Zhou",
"Man",
""
],
[
"Zheng",
"Naishan",
""
],
[
"Huang",
"Jie",
""
],
[
"Guo",
"Chunle",
""
],
[
"Li",
"Chongyi",
""
]
] | Image and video restoration has achieved a remarkable leap with the advent of deep learning. The success of deep learning paradigm lies in three key components: data, model, and loss. Currently, many efforts have been devoted to the first two while seldom study focuses on loss function. With the question ``are the de f... |
2208.06111 | Charbel Toumieh | Charbel Toumieh, Alain Lambert | Shape-aware Safe Corridors Generation using Voxel Grids | null | null | null | null | cs.RO | http://creativecommons.org/licenses/by/4.0/ | Safe Corridors (a series of overlapping convex shapes) have been used
recently in multiple state-of-the-art motion planning methods. They allow to
represent the free space in the environment in an efficient way for collision
avoidance. In this paper, we propose a new framework for generating Safe
Corridors. We assume... | [
{
"created": "Fri, 12 Aug 2022 04:25:39 GMT",
"version": "v1"
},
{
"created": "Tue, 16 Aug 2022 02:34:03 GMT",
"version": "v2"
}
] | 2022-08-17 | [
[
"Toumieh",
"Charbel",
""
],
[
"Lambert",
"Alain",
""
]
] | Safe Corridors (a series of overlapping convex shapes) have been used recently in multiple state-of-the-art motion planning methods. They allow to represent the free space in the environment in an efficient way for collision avoidance. In this paper, we propose a new framework for generating Safe Corridors. We assume t... |
1805.02165 | Xinghao Ding | Liyan Sun, Zhiwen Fan, Yue Huang, Xinghao Ding, John Paisley | Joint CS-MRI Reconstruction and Segmentation with a Unified Deep Network | 8 pages, 6 figures, 3 tables | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The need for fast acquisition and automatic analysis of MRI data is growing
in the age of big data. Although compressed sensing magnetic resonance imaging
(CS-MRI) has been studied to accelerate MRI by reducing k-space measurements,
in current CS-MRI techniques MRI applications such as segmentation are
overlooked whe... | [
{
"created": "Sun, 6 May 2018 07:45:32 GMT",
"version": "v1"
}
] | 2018-05-08 | [
[
"Sun",
"Liyan",
""
],
[
"Fan",
"Zhiwen",
""
],
[
"Huang",
"Yue",
""
],
[
"Ding",
"Xinghao",
""
],
[
"Paisley",
"John",
""
]
] | The need for fast acquisition and automatic analysis of MRI data is growing in the age of big data. Although compressed sensing magnetic resonance imaging (CS-MRI) has been studied to accelerate MRI by reducing k-space measurements, in current CS-MRI techniques MRI applications such as segmentation are overlooked when ... |
2009.12185 | Tom\'a\v{s} Kroupa | Luk\'a\v{s} Adam, Rostislav Hor\v{c}\'ik, Tom\'a\v{s} Kasl,
Tom\'a\v{s} Kroupa | Double Oracle Algorithm for Computing Equilibria in Continuous Games | null | null | null | null | cs.GT math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many efficient algorithms have been designed to recover Nash equilibria of
various classes of finite games. Special classes of continuous games with
infinite strategy spaces, such as polynomial games, can be solved by
semidefinite programming. In general, however, continuous games are not
directly amenable to computa... | [
{
"created": "Fri, 25 Sep 2020 12:42:08 GMT",
"version": "v1"
},
{
"created": "Wed, 30 Sep 2020 16:12:53 GMT",
"version": "v2"
}
] | 2020-10-01 | [
[
"Adam",
"Lukáš",
""
],
[
"Horčík",
"Rostislav",
""
],
[
"Kasl",
"Tomáš",
""
],
[
"Kroupa",
"Tomáš",
""
]
] | Many efficient algorithms have been designed to recover Nash equilibria of various classes of finite games. Special classes of continuous games with infinite strategy spaces, such as polynomial games, can be solved by semidefinite programming. In general, however, continuous games are not directly amenable to computati... |
2010.00246 | Zheng Gu | Zheng Gu, Chuanqi Dong, Jing Huo, Wenbin Li, Yang Gao | CariMe: Unpaired Caricature Generation with Multiple Exaggerations | null | null | null | null | cs.CV cs.LG cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Caricature generation aims to translate real photos into caricatures with
artistic styles and shape exaggerations while maintaining the identity of the
subject. Different from the generic image-to-image translation, drawing a
caricature automatically is a more challenging task due to the existence of
various spacial ... | [
{
"created": "Thu, 1 Oct 2020 08:14:32 GMT",
"version": "v1"
}
] | 2020-10-02 | [
[
"Gu",
"Zheng",
""
],
[
"Dong",
"Chuanqi",
""
],
[
"Huo",
"Jing",
""
],
[
"Li",
"Wenbin",
""
],
[
"Gao",
"Yang",
""
]
] | Caricature generation aims to translate real photos into caricatures with artistic styles and shape exaggerations while maintaining the identity of the subject. Different from the generic image-to-image translation, drawing a caricature automatically is a more challenging task due to the existence of various spacial de... |
2101.10882 | Sidhanth Mohanty | Siqi Liu, Sidhanth Mohanty, Prasad Raghavendra | On statistical inference when fixed points of belief propagation are
unstable | Title changed. More detailed description of results and technical
overview in the intro | null | null | null | cs.DS math.PR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many statistical inference problems correspond to recovering the values of a
set of hidden variables from sparse observations on them. For instance, in a
planted constraint satisfaction problem such as planted 3-SAT, the clauses are
sparse observations from which the hidden assignment is to be recovered. In the
probl... | [
{
"created": "Tue, 26 Jan 2021 15:51:44 GMT",
"version": "v1"
},
{
"created": "Sat, 17 Jul 2021 18:53:55 GMT",
"version": "v2"
}
] | 2021-07-20 | [
[
"Liu",
"Siqi",
""
],
[
"Mohanty",
"Sidhanth",
""
],
[
"Raghavendra",
"Prasad",
""
]
] | Many statistical inference problems correspond to recovering the values of a set of hidden variables from sparse observations on them. For instance, in a planted constraint satisfaction problem such as planted 3-SAT, the clauses are sparse observations from which the hidden assignment is to be recovered. In the problem... |
2404.09494 | Junfan Li | Junfan Li and Zenglin Xu and Zheshun Wu and Irwin King | On the Necessity of Collaboration in Online Model Selection with
Decentralized Data | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider online model selection with decentralized data over $M$ clients,
and study the necessity of collaboration among clients. Previous work proposed
various federated algorithms without demonstrating their necessity, while we
answer the question from a novel perspective of computational constraints. We
prove l... | [
{
"created": "Mon, 15 Apr 2024 06:32:28 GMT",
"version": "v1"
},
{
"created": "Tue, 14 May 2024 11:29:13 GMT",
"version": "v2"
},
{
"created": "Wed, 22 May 2024 02:07:41 GMT",
"version": "v3"
}
] | 2024-05-24 | [
[
"Li",
"Junfan",
""
],
[
"Xu",
"Zenglin",
""
],
[
"Wu",
"Zheshun",
""
],
[
"King",
"Irwin",
""
]
] | We consider online model selection with decentralized data over $M$ clients, and study the necessity of collaboration among clients. Previous work proposed various federated algorithms without demonstrating their necessity, while we answer the question from a novel perspective of computational constraints. We prove low... |
2110.01098 | Michael Coblenz | Michael Coblenz, Michelle Mazurek, Michael Hicks | Garbage Collection Makes Rust Easier to Use: A Randomized Controlled
Trial of the Bronze Garbage Collector | Michael Coblenz, Michelle L. Mazurek, and Michael Hicks. 2022.
Garbage Collection Makes Rust Easier to Use: A Randomized Controlled Trial of
the Bronze Garbage Collector. In 44th International Conference on Software
Engineering (ICSE '22), May 21-29, 2022, Pittsburgh, PA, USA. ACM, New York,
NY, USA, 12 pages. ... | null | 10.1145/3510003.3510107 | null | cs.SE cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Rust is a general-purpose programming language that is both type- and
memory-safe. Rust does not use a garbage collector, but rather achieves these
properties through a sophisticated, but complex, type system. Doing so makes
Rust very efficient, but makes Rust relatively hard to learn and use. We
designed Bronze, an ... | [
{
"created": "Sun, 3 Oct 2021 20:26:24 GMT",
"version": "v1"
},
{
"created": "Tue, 15 Feb 2022 14:55:41 GMT",
"version": "v2"
}
] | 2022-02-16 | [
[
"Coblenz",
"Michael",
""
],
[
"Mazurek",
"Michelle",
""
],
[
"Hicks",
"Michael",
""
]
] | Rust is a general-purpose programming language that is both type- and memory-safe. Rust does not use a garbage collector, but rather achieves these properties through a sophisticated, but complex, type system. Doing so makes Rust very efficient, but makes Rust relatively hard to learn and use. We designed Bronze, an op... |
2106.16085 | Jinwook Lee Ph.D. | Matthew J. Schneider and Jinwook Lee | Protecting Time Series Data with Minimal Forecast Loss | found better results | null | null | null | cs.CR cs.DM math.ST stat.TH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Forecasting could be negatively impacted due to anonymization requirements in
data protection legislation. To measure the potential severity of this problem,
we derive theoretical bounds for the loss to forecasts from additive
exponential smoothing models using protected data. Following the guidelines of
anonymizatio... | [
{
"created": "Wed, 30 Jun 2021 14:20:02 GMT",
"version": "v1"
},
{
"created": "Tue, 7 Mar 2023 15:14:44 GMT",
"version": "v2"
}
] | 2023-03-08 | [
[
"Schneider",
"Matthew J.",
""
],
[
"Lee",
"Jinwook",
""
]
] | Forecasting could be negatively impacted due to anonymization requirements in data protection legislation. To measure the potential severity of this problem, we derive theoretical bounds for the loss to forecasts from additive exponential smoothing models using protected data. Following the guidelines of anonymization ... |
2403.12463 | Mehmet Tekerek (PhD) | Mehmet Gok, Mehmet Tekerek, Hamza Aydemir | Reinforcement learning based local path planning for mobile robot | 5 Pages, 10 figures, Presented in; Interdisciplinary Conference on
Mechanics, Computers and Electrics ANKARA/TURKEY 27-28 November 2021 | Interdisciplinary Conference on Mechanics, Computers and
Electrics, 27-28 Nov. 2021, Ankara | null | null | cs.RO cs.AI | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Different methods are used for a mobile robot to go to a specific target
location. These methods work in different ways for online and offline
scenarios. In the offline scenario, an environment map is created once, and
fixed path planning is made on this map to reach the target. Path planning
algorithms such as A* an... | [
{
"created": "Tue, 24 Oct 2023 18:26:25 GMT",
"version": "v1"
}
] | 2024-03-20 | [
[
"Gok",
"Mehmet",
""
],
[
"Tekerek",
"Mehmet",
""
],
[
"Aydemir",
"Hamza",
""
]
] | Different methods are used for a mobile robot to go to a specific target location. These methods work in different ways for online and offline scenarios. In the offline scenario, an environment map is created once, and fixed path planning is made on this map to reach the target. Path planning algorithms such as A* and ... |
2011.02068 | Sichang Tu | Amir Zeldes, Lance Martin and Sichang Tu | Exhaustive Entity Recognition for Coptic: Challenges and Solutions | 9 pages, 2 figures, 5 tables. Accepted by The 4th Joint SIGHUM
Workshop on Computational Linguistics for Cultural Heritage, Social Sciences,
Humanities and Literature | null | null | null | cs.CL cs.DL | http://creativecommons.org/licenses/by/4.0/ | Entity recognition provides semantic access to ancient materials in the
Digital Humanities: itexposes people and places of interest in texts that
cannot be read exhaustively, facilitates linkingresources and can provide a
window into text contents, even for texts with no translations. Inthis paper we
present entity r... | [
{
"created": "Tue, 3 Nov 2020 23:49:42 GMT",
"version": "v1"
}
] | 2020-11-05 | [
[
"Zeldes",
"Amir",
""
],
[
"Martin",
"Lance",
""
],
[
"Tu",
"Sichang",
""
]
] | Entity recognition provides semantic access to ancient materials in the Digital Humanities: itexposes people and places of interest in texts that cannot be read exhaustively, facilitates linkingresources and can provide a window into text contents, even for texts with no translations. Inthis paper we present entity rec... |
1602.07808 | Junaid Qadir | Junaid Qadir, Arjuna Sathiaseelan, Liang Wang, Jon Crowcroft | "Resource Pooling" for Wireless Networks: Solutions for the Developing
World | null | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We live in a world in which there is a great disparity between the lives of
the rich and the poor. Technology offers great promise in bridging this gap. In
particular, wireless technology unfetters developing communities from the
constraints of infrastructure providing a great opportunity to leapfrog years
of neglect... | [
{
"created": "Thu, 25 Feb 2016 05:57:51 GMT",
"version": "v1"
}
] | 2016-02-26 | [
[
"Qadir",
"Junaid",
""
],
[
"Sathiaseelan",
"Arjuna",
""
],
[
"Wang",
"Liang",
""
],
[
"Crowcroft",
"Jon",
""
]
] | We live in a world in which there is a great disparity between the lives of the rich and the poor. Technology offers great promise in bridging this gap. In particular, wireless technology unfetters developing communities from the constraints of infrastructure providing a great opportunity to leapfrog years of neglect a... |
1211.2365 | Sylvester Eriksson-Bique | Sylvester Eriksson-Bique (University of Washington and University of
Helsinki) and David Kirkpatrick (University of British Columbia) and Valentin
Polishchuk (University of Helsinki) | Discrete Dubins Paths | 26 pages | null | null | null | cs.DM cs.CG math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A Dubins path is a shortest path with bounded curvature. The seminal result
in non-holonomic motion planning is that (in the absence of obstacles) a Dubins
path consists either from a circular arc followed by a segment followed by
another arc, or from three circular arcs [Dubins, 1957]. Dubins original proof
uses adv... | [
{
"created": "Sun, 11 Nov 2012 01:45:17 GMT",
"version": "v1"
}
] | 2012-11-14 | [
[
"Eriksson-Bique",
"Sylvester",
"",
"University of Washington and University of\n Helsinki"
],
[
"Kirkpatrick",
"David",
"",
"University of British Columbia"
],
[
"Polishchuk",
"Valentin",
"",
"University of Helsinki"
]
] | A Dubins path is a shortest path with bounded curvature. The seminal result in non-holonomic motion planning is that (in the absence of obstacles) a Dubins path consists either from a circular arc followed by a segment followed by another arc, or from three circular arcs [Dubins, 1957]. Dubins original proof uses advan... |
2209.15181 | Jianzong Wang | Wen Wang, Jianzong Wang, Shijing Si, Zhangcheng Huang, Jing Xiao | RL-MD: A Novel Reinforcement Learning Approach for DNA Motif Discovery | This paper is accepted by DSAA2022. The 9th IEEE International
Conference on Data Science and Advanced Analytics | null | null | null | cs.LG cs.AI q-bio.GN | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The extraction of sequence patterns from a collection of functionally linked
unlabeled DNA sequences is known as DNA motif discovery, and it is a key task
in computational biology. Several deep learning-based techniques have recently
been introduced to address this issue. However, these algorithms can not be
used in ... | [
{
"created": "Fri, 30 Sep 2022 02:07:37 GMT",
"version": "v1"
}
] | 2022-10-03 | [
[
"Wang",
"Wen",
""
],
[
"Wang",
"Jianzong",
""
],
[
"Si",
"Shijing",
""
],
[
"Huang",
"Zhangcheng",
""
],
[
"Xiao",
"Jing",
""
]
] | The extraction of sequence patterns from a collection of functionally linked unlabeled DNA sequences is known as DNA motif discovery, and it is a key task in computational biology. Several deep learning-based techniques have recently been introduced to address this issue. However, these algorithms can not be used in re... |
1401.3839 | Silvia Richter | Silvia Richter, Matthias Westphal | The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks | null | Journal Of Artificial Intelligence Research, Volume 39, pages
127-177, 2010 | 10.1613/jair.2972 | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | LAMA is a classical planning system based on heuristic forward search. Its
core feature is the use of a pseudo-heuristic derived from landmarks,
propositional formulas that must be true in every solution of a planning task.
LAMA builds on the Fast Downward planning system, using finite-domain rather
than binary state... | [
{
"created": "Thu, 16 Jan 2014 04:52:55 GMT",
"version": "v1"
}
] | 2014-01-17 | [
[
"Richter",
"Silvia",
""
],
[
"Westphal",
"Matthias",
""
]
] | LAMA is a classical planning system based on heuristic forward search. Its core feature is the use of a pseudo-heuristic derived from landmarks, propositional formulas that must be true in every solution of a planning task. LAMA builds on the Fast Downward planning system, using finite-domain rather than binary state v... |
1807.01857 | Mohammad Masudur Rahman | Mohammad Masudur Rahman, Shamima Yeasmin and Chanchal K. Roy | An IDE-Based Context-Aware Meta Search Engine | 20th Working Conference on Reverse Engineering (WCRE 2013), Koblenz,
Germany, October 2013, pp. 467--471 | null | 10.1109/WCRE.2013.6671324 | null | cs.SE cs.IR | http://creativecommons.org/licenses/by/4.0/ | Traditional web search forces the developers to leave their working
environments and look for solutions in the web browsers. It often does not
consider the context of their programming problems. The context-switching
between the web browser and the working environment is time-consuming and
distracting, and the keywor... | [
{
"created": "Thu, 5 Jul 2018 06:05:46 GMT",
"version": "v1"
}
] | 2018-07-06 | [
[
"Rahman",
"Mohammad Masudur",
""
],
[
"Yeasmin",
"Shamima",
""
],
[
"Roy",
"Chanchal K.",
""
]
] | Traditional web search forces the developers to leave their working environments and look for solutions in the web browsers. It often does not consider the context of their programming problems. The context-switching between the web browser and the working environment is time-consuming and distracting, and the keyword-... |
1705.08277 | Pieter Leyman | Pieter Leyman and Patrick De Causmaecker | Optimization in large graphs: Toward a better future? | null | null | null | null | cs.DS cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Finding groups of connected individuals in large graphs with tens of
thousands or more nodes has received considerable attention in academic
research. In this paper, we analyze three main issues with respect to the
recent influx of papers on community detection in (large) graphs, highlight the
specific problems with ... | [
{
"created": "Tue, 23 May 2017 14:02:15 GMT",
"version": "v1"
}
] | 2017-05-24 | [
[
"Leyman",
"Pieter",
""
],
[
"De Causmaecker",
"Patrick",
""
]
] | Finding groups of connected individuals in large graphs with tens of thousands or more nodes has received considerable attention in academic research. In this paper, we analyze three main issues with respect to the recent influx of papers on community detection in (large) graphs, highlight the specific problems with th... |
1205.3247 | Zohreh Sanaei | Zohreh Sanaei, Saeid Abolfazli, Abdullah Gani, Rashid Hafeez Khokhar | Tripod of Requirements in Horizontal Heterogeneous Mobile Cloud
Computing | null | Z. Sanaei, S. Abolfazli, A. Gani, and R. H. Khokhar, "Tripod of
requirements in horizontal heterogeneous mobile cloud computing," in Proc.1st
Int'l Conf. Computing, Information Systems, and Communications, 2012 | null | null | cs.DC | http://creativecommons.org/licenses/by-nc-sa/3.0/ | Recent trend of mobile computing is emerging toward executing
resource-intensive applications in mobile devices regardless of underlying
resource restrictions (e.g. limited processor and energy) that necessitate
imminent technologies. Prosperity of cloud computing in stationary computers
breeds Mobile Cloud Computing... | [
{
"created": "Tue, 15 May 2012 03:29:23 GMT",
"version": "v1"
}
] | 2012-05-16 | [
[
"Sanaei",
"Zohreh",
""
],
[
"Abolfazli",
"Saeid",
""
],
[
"Gani",
"Abdullah",
""
],
[
"Khokhar",
"Rashid Hafeez",
""
]
] | Recent trend of mobile computing is emerging toward executing resource-intensive applications in mobile devices regardless of underlying resource restrictions (e.g. limited processor and energy) that necessitate imminent technologies. Prosperity of cloud computing in stationary computers breeds Mobile Cloud Computing (... |
cs/0501011 | Sergei Fedorenko | Sergei Fedorenko | A simple algorithm for decoding Reed-Solomon codes and its relation to
the Welch-Berlekamp algorithm | 7 pages. Submitted to IEEE Transactions on Information Theory | IEEE Transactions on Information Theory, vol. IT-51, no. 3, pp.
1196-1198, 2005. | 10.1109/TIT.2004.842738 | null | cs.IT math.IT | null | A simple and natural Gao algorithm for decoding algebraic codes is described.
Its relation to the Welch-Berlekamp and Euclidean algorithms is given.
| [
{
"created": "Thu, 6 Jan 2005 18:55:37 GMT",
"version": "v1"
}
] | 2007-07-16 | [
[
"Fedorenko",
"Sergei",
""
]
] | A simple and natural Gao algorithm for decoding algebraic codes is described. Its relation to the Welch-Berlekamp and Euclidean algorithms is given. |
2205.01006 | Shi Xian | Xian Shi, Xun Xu, Wanyue Zhang, Xiatian Zhu, Chuan Sheng Foo, Kui Jia | Open-Set Semi-Supervised Learning for 3D Point Cloud Understanding | null | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Semantic understanding of 3D point cloud relies on learning models with
massively annotated data, which, in many cases, are expensive or difficult to
collect. This has led to an emerging research interest in semi-supervised
learning (SSL) for 3D point cloud. It is commonly assumed in SSL that the
unlabeled data are d... | [
{
"created": "Mon, 2 May 2022 16:09:17 GMT",
"version": "v1"
}
] | 2022-05-03 | [
[
"Shi",
"Xian",
""
],
[
"Xu",
"Xun",
""
],
[
"Zhang",
"Wanyue",
""
],
[
"Zhu",
"Xiatian",
""
],
[
"Foo",
"Chuan Sheng",
""
],
[
"Jia",
"Kui",
""
]
] | Semantic understanding of 3D point cloud relies on learning models with massively annotated data, which, in many cases, are expensive or difficult to collect. This has led to an emerging research interest in semi-supervised learning (SSL) for 3D point cloud. It is commonly assumed in SSL that the unlabeled data are dra... |
1903.09734 | Kamyar Azizzadenesheli Ph.D. | Kamyar Azizzadenesheli, Anqi Liu, Fanny Yang, Animashree Anandkumar | Regularized Learning for Domain Adaptation under Label Shifts | International Conference on Learning Representations (ICLR) 2019 | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose Regularized Learning under Label shifts (RLLS), a principled and a
practical domain-adaptation algorithm to correct for shifts in the label
distribution between a source and a target domain. We first estimate importance
weights using labeled source data and unlabeled target data, and then train a
classifie... | [
{
"created": "Fri, 22 Mar 2019 23:46:24 GMT",
"version": "v1"
}
] | 2020-08-10 | [
[
"Azizzadenesheli",
"Kamyar",
""
],
[
"Liu",
"Anqi",
""
],
[
"Yang",
"Fanny",
""
],
[
"Anandkumar",
"Animashree",
""
]
] | We propose Regularized Learning under Label shifts (RLLS), a principled and a practical domain-adaptation algorithm to correct for shifts in the label distribution between a source and a target domain. We first estimate importance weights using labeled source data and unlabeled target data, and then train a classifier ... |
0810.2865 | Krzysztof R. Apt | Krzysztof R. Apt, Vincent Conitzer, Mingyu Guo and Evangelos Markakis | Welfare Undominated Groves Mechanisms | 12 pages. To appear in Proceedings of the 4th International Workshop
On Internet And Network Economics (WINE 2008). Springer Lecture Notes in
Computer Science, 2008 | null | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A common objective in mechanism design is to choose the outcome (for example,
allocation of resources) that maximizes the sum of the agents' valuations,
without introducing incentives for agents to misreport their preferences. The
class of Groves mechanisms achieves this; however, these mechanisms require the
agents ... | [
{
"created": "Thu, 16 Oct 2008 08:25:11 GMT",
"version": "v1"
}
] | 2008-10-17 | [
[
"Apt",
"Krzysztof R.",
""
],
[
"Conitzer",
"Vincent",
""
],
[
"Guo",
"Mingyu",
""
],
[
"Markakis",
"Evangelos",
""
]
] | A common objective in mechanism design is to choose the outcome (for example, allocation of resources) that maximizes the sum of the agents' valuations, without introducing incentives for agents to misreport their preferences. The class of Groves mechanisms achieves this; however, these mechanisms require the agents to... |
2310.16624 | Peter Sorrenson | Felix Draxler, Peter Sorrenson, Lea Zimmermann, Armand Rousselot,
Ullrich K\"othe | Free-form Flows: Make Any Architecture a Normalizing Flow | Camera-ready version: accepted at AISTATS 2024 | null | null | null | cs.LG stat.ML | http://creativecommons.org/licenses/by/4.0/ | Normalizing Flows are generative models that directly maximize the
likelihood. Previously, the design of normalizing flows was largely constrained
by the need for analytical invertibility. We overcome this constraint by a
training procedure that uses an efficient estimator for the gradient of the
change of variables ... | [
{
"created": "Wed, 25 Oct 2023 13:23:08 GMT",
"version": "v1"
},
{
"created": "Wed, 24 Apr 2024 10:05:18 GMT",
"version": "v2"
}
] | 2024-04-25 | [
[
"Draxler",
"Felix",
""
],
[
"Sorrenson",
"Peter",
""
],
[
"Zimmermann",
"Lea",
""
],
[
"Rousselot",
"Armand",
""
],
[
"Köthe",
"Ullrich",
""
]
] | Normalizing Flows are generative models that directly maximize the likelihood. Previously, the design of normalizing flows was largely constrained by the need for analytical invertibility. We overcome this constraint by a training procedure that uses an efficient estimator for the gradient of the change of variables fo... |
2402.06500 | Charles Assaad | Lei Zan, Charles K. Assaad, Emilie Devijver, Eric Gaussier, Ali
A\"it-Bachir | On the Fly Detection of Root Causes from Observed Data with Application
to IT Systems | Accepted to CIKM 2024 | null | null | null | cs.AI | http://creativecommons.org/licenses/by/4.0/ | This paper introduces a new structural causal model tailored for representing
threshold-based IT systems and presents a new algorithm designed to rapidly
detect root causes of anomalies in such systems. When root causes are not
causally related, the method is proven to be correct; while an extension is
proposed based... | [
{
"created": "Fri, 9 Feb 2024 16:10:19 GMT",
"version": "v1"
},
{
"created": "Mon, 29 Jul 2024 13:13:30 GMT",
"version": "v2"
}
] | 2024-07-30 | [
[
"Zan",
"Lei",
""
],
[
"Assaad",
"Charles K.",
""
],
[
"Devijver",
"Emilie",
""
],
[
"Gaussier",
"Eric",
""
],
[
"Aït-Bachir",
"Ali",
""
]
] | This paper introduces a new structural causal model tailored for representing threshold-based IT systems and presents a new algorithm designed to rapidly detect root causes of anomalies in such systems. When root causes are not causally related, the method is proven to be correct; while an extension is proposed based o... |
2205.13764 | Chunhua Shen | Zhi Tian, Xiangxiang Chu, Xiaoming Wang, Xiaolin Wei, Chunhua Shen | Fully Convolutional One-Stage 3D Object Detection on LiDAR Range Images | Accepted to: Proc. Thirty-sixth Conference on Neural Information
Processing Systems (NeurIPS) 2022. 14 pages | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-nd/4.0/ | We present a simple yet effective fully convolutional one-stage 3D object
detector for LiDAR point clouds of autonomous driving scenes, termed
FCOS-LiDAR. Unlike the dominant methods that use the bird-eye view (BEV), our
proposed detector detects objects from the range view (RV, a.k.a. range image)
of the LiDAR point... | [
{
"created": "Fri, 27 May 2022 05:42:16 GMT",
"version": "v1"
},
{
"created": "Tue, 20 Sep 2022 03:06:12 GMT",
"version": "v2"
}
] | 2022-09-21 | [
[
"Tian",
"Zhi",
""
],
[
"Chu",
"Xiangxiang",
""
],
[
"Wang",
"Xiaoming",
""
],
[
"Wei",
"Xiaolin",
""
],
[
"Shen",
"Chunhua",
""
]
] | We present a simple yet effective fully convolutional one-stage 3D object detector for LiDAR point clouds of autonomous driving scenes, termed FCOS-LiDAR. Unlike the dominant methods that use the bird-eye view (BEV), our proposed detector detects objects from the range view (RV, a.k.a. range image) of the LiDAR points.... |
2306.04274 | Richard Blythman | Richard Blythman, Mohamed Arshath, Salvatore Vivona, Jakub Sm\'ekal,
Hithesh Shaji | Decentralized Technologies for AI Hubs | arXiv admin note: substantial text overlap with arXiv:2210.16651 | 2022 Conference on Neural Information Processing Systems Workshops | null | null | cs.AI | http://creativecommons.org/licenses/by/4.0/ | AI requires heavy amounts of storage and compute with assets that are
commonly stored in AI Hubs. AI Hubs have contributed significantly to the
democratization of AI. However, existing implementations are associated with
certain benefits and limitations that stem from the underlying infrastructure
and governance syst... | [
{
"created": "Wed, 7 Jun 2023 09:18:56 GMT",
"version": "v1"
}
] | 2023-06-08 | [
[
"Blythman",
"Richard",
""
],
[
"Arshath",
"Mohamed",
""
],
[
"Vivona",
"Salvatore",
""
],
[
"Smékal",
"Jakub",
""
],
[
"Shaji",
"Hithesh",
""
]
] | AI requires heavy amounts of storage and compute with assets that are commonly stored in AI Hubs. AI Hubs have contributed significantly to the democratization of AI. However, existing implementations are associated with certain benefits and limitations that stem from the underlying infrastructure and governance system... |
1904.02809 | Xuanrui Qi | Reynald Affeldt, Jacques Garrigue, Xuanrui Qi, Kazunari Tanaka | Proving tree algorithms for succinct data structures | Accepted to the 10th International Conference on Interactive Theorem
Proving (ITP 2019) | null | null | null | cs.PL cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Succinct data structures give space-efficient representations of large
amounts of data without sacrificing performance. They rely one cleverly
designed data representations and algorithms. We present here the formalization
in Coq/SSReflect of two different tree-based succinct representations and their
accompanying al... | [
{
"created": "Thu, 4 Apr 2019 22:20:12 GMT",
"version": "v1"
},
{
"created": "Tue, 2 Jul 2019 09:49:48 GMT",
"version": "v2"
}
] | 2019-07-03 | [
[
"Affeldt",
"Reynald",
""
],
[
"Garrigue",
"Jacques",
""
],
[
"Qi",
"Xuanrui",
""
],
[
"Tanaka",
"Kazunari",
""
]
] | Succinct data structures give space-efficient representations of large amounts of data without sacrificing performance. They rely one cleverly designed data representations and algorithms. We present here the formalization in Coq/SSReflect of two different tree-based succinct representations and their accompanying algo... |
2303.12048 | Etai Sella | Etai Sella, Gal Fiebelman, Peter Hedman, Hadar Averbuch-Elor | Vox-E: Text-guided Voxel Editing of 3D Objects | ICCV 2023. Project webpage: https://tau-vailab.github.io/Vox-E/ | null | null | null | cs.CV cs.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Large scale text-guided diffusion models have garnered significant attention
due to their ability to synthesize diverse images that convey complex visual
concepts. This generative power has more recently been leveraged to perform
text-to-3D synthesis. In this work, we present a technique that harnesses the
power of l... | [
{
"created": "Tue, 21 Mar 2023 17:36:36 GMT",
"version": "v1"
},
{
"created": "Mon, 21 Aug 2023 13:45:55 GMT",
"version": "v2"
},
{
"created": "Tue, 19 Sep 2023 05:41:59 GMT",
"version": "v3"
}
] | 2023-09-20 | [
[
"Sella",
"Etai",
""
],
[
"Fiebelman",
"Gal",
""
],
[
"Hedman",
"Peter",
""
],
[
"Averbuch-Elor",
"Hadar",
""
]
] | Large scale text-guided diffusion models have garnered significant attention due to their ability to synthesize diverse images that convey complex visual concepts. This generative power has more recently been leveraged to perform text-to-3D synthesis. In this work, we present a technique that harnesses the power of lat... |
2211.04402 | Vaclav Skala | Vaclav Skala | Summation Problem Revisited -- More Robust Computation | 9 pages, 3 Figs, 3 Tabs. Presented at Recent Advances in Computer
Science Conf, 2013 | null | null | null | cs.DS cs.NA math.NA | http://creativecommons.org/licenses/by/4.0/ | Numerical data processing is a key task across different fields of computer
technology use. However, even simple summation of values is not precise due to
the floating point representation use. This paper presents a practical
algorithm for summation of values convenient for medium and large data sets.
The proposed al... | [
{
"created": "Tue, 8 Nov 2022 17:45:06 GMT",
"version": "v1"
}
] | 2022-11-09 | [
[
"Skala",
"Vaclav",
""
]
] | Numerical data processing is a key task across different fields of computer technology use. However, even simple summation of values is not precise due to the floating point representation use. This paper presents a practical algorithm for summation of values convenient for medium and large data sets. The proposed algo... |
1605.03651 | Dinh Hoa Nguyen | Dinh Hoa Nguyen | Minimum-Rank Dynamic Output Consensus Design for Heterogeneous Nonlinear
Multi-Agent Systems | Revised version submitted to IEEE Transactions on Control of Network
Systems | null | 10.1109/TCNS.2016.2580908 | null | cs.SY math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a new and systematic design framework for output
consensus in heterogeneous Multi-Input Multi-Output (MIMO) general nonlinear
Multi-Agent Systems (MASs) subjected to directed communication topology. First,
the input-output feedback linearization method is utilized assuming that the
internal ... | [
{
"created": "Thu, 12 May 2016 01:53:27 GMT",
"version": "v1"
}
] | 2016-11-15 | [
[
"Nguyen",
"Dinh Hoa",
""
]
] | In this paper, we propose a new and systematic design framework for output consensus in heterogeneous Multi-Input Multi-Output (MIMO) general nonlinear Multi-Agent Systems (MASs) subjected to directed communication topology. First, the input-output feedback linearization method is utilized assuming that the internal dy... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.