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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
cs/0408021 | Florentin Smarandache | Florentin Smarandache, Jean Dezert | An Algorithm for Quasi-Associative and Quasi-Markovian Rules of
Combination in Information Fusion | 9 pages | International Journal of Applied Mathematics & Statistics, Vol.
22, No. S11 (Special Issue on Soft Computing), 33-42, 2011 | null | null | cs.AI | null | In this paper one proposes a simple algorithm of combining the fusion rules,
those rules which first use the conjunctive rule and then the transfer of
conflicting mass to the non-empty sets, in such a way that they gain the
property of associativity and fulfill the Markovian requirement for dynamic
fusion. Also, a ne... | [
{
"created": "Sun, 8 Aug 2004 19:41:23 GMT",
"version": "v1"
},
{
"created": "Sat, 14 Aug 2004 16:59:51 GMT",
"version": "v2"
}
] | 2010-09-14 | [
[
"Smarandache",
"Florentin",
""
],
[
"Dezert",
"Jean",
""
]
] | In this paper one proposes a simple algorithm of combining the fusion rules, those rules which first use the conjunctive rule and then the transfer of conflicting mass to the non-empty sets, in such a way that they gain the property of associativity and fulfill the Markovian requirement for dynamic fusion. Also, a new ... |
1907.05364 | Felix Batsch | Felix Batsch, Alireza Daneshkhah, Madeline Cheah, Stratis Kanarachos,
Anthony Baxendale | Performance Boundary Identification for the Evaluation of Automated
Vehicles using Gaussian Process Classification | 6 pages, 5 figures, accepted at 2019 IEEE Intelligent Transportation
Systems Conference - ITSC 2019, Auckland, New Zealand, October 2019 | null | null | null | cs.LG cs.RO stat.AP stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Safety is an essential aspect in the facilitation of automated vehicle
deployment. Current testing practices are not enough, and going beyond them
leads to infeasible testing requirements, such as needing to drive billions of
kilometres on public roads. Automated vehicles are exposed to an indefinite
number of scenar... | [
{
"created": "Thu, 11 Jul 2019 16:35:59 GMT",
"version": "v1"
}
] | 2019-07-12 | [
[
"Batsch",
"Felix",
""
],
[
"Daneshkhah",
"Alireza",
""
],
[
"Cheah",
"Madeline",
""
],
[
"Kanarachos",
"Stratis",
""
],
[
"Baxendale",
"Anthony",
""
]
] | Safety is an essential aspect in the facilitation of automated vehicle deployment. Current testing practices are not enough, and going beyond them leads to infeasible testing requirements, such as needing to drive billions of kilometres on public roads. Automated vehicles are exposed to an indefinite number of scenario... |
1209.1734 | Vishnuvardhan Mannava M.E | Vishnuvardhan Mannava and T. Ramesh | Load Distribution Composite Design Pattern for Genetic Algorithm-Based
Autonomic Computing Systems | International Journal on Soft Computing (IJSC), 15 pages, 11 figures | Vishnuvardhan, Mannava., & Ramesh, T. (2012). Load Distribution
Composite Design Pattern for Genetic Algorithm-Based Autonomic Computing
Systems. International Journal on Soft Computing (IJSC), 3(3), 85-99 | 10.5121/ijsc | null | cs.SE cs.DC cs.NE | http://creativecommons.org/licenses/by-nc-sa/3.0/ | Current autonomic computing systems are ad hoc solutions that are designed
and implemented from the scratch. When designing software, in most cases two or
more patterns are to be composed to solve a bigger problem. A composite design
patterns shows a synergy that makes the composition more than just the sum of
its pa... | [
{
"created": "Sat, 8 Sep 2012 17:39:46 GMT",
"version": "v1"
}
] | 2012-09-11 | [
[
"Mannava",
"Vishnuvardhan",
""
],
[
"Ramesh",
"T.",
""
]
] | Current autonomic computing systems are ad hoc solutions that are designed and implemented from the scratch. When designing software, in most cases two or more patterns are to be composed to solve a bigger problem. A composite design patterns shows a synergy that makes the composition more than just the sum of its part... |
2310.15021 | Zhiyuan Fan | Zhiyuan Fan, Shizhu He | Efficient Data Learning for Open Information Extraction with Pre-trained
Language Models | null | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | Open Information Extraction (OpenIE) is a fundamental yet challenging task in
Natural Language Processing, which involves extracting all triples (subject,
predicate, object) from a given sentence. While labeling-based methods have
their merits, generation-based techniques offer unique advantages, such as the
ability ... | [
{
"created": "Mon, 23 Oct 2023 15:19:24 GMT",
"version": "v1"
},
{
"created": "Wed, 26 Jun 2024 08:23:10 GMT",
"version": "v2"
}
] | 2024-06-27 | [
[
"Fan",
"Zhiyuan",
""
],
[
"He",
"Shizhu",
""
]
] | Open Information Extraction (OpenIE) is a fundamental yet challenging task in Natural Language Processing, which involves extracting all triples (subject, predicate, object) from a given sentence. While labeling-based methods have their merits, generation-based techniques offer unique advantages, such as the ability to... |
1004.4729 | Venkatesan Chakaravarthy | Venkatesan T. Chakaravarthy and Vinayaka Pandit and Yogish Sabharwal | On the Complexity of the $k$-Anonymization Problem | 9 pages, 2 figures | null | null | null | cs.CC cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the problem of anonymizing tables containing personal information
before releasing them for public use. One of the formulations considered in
this context is the $k$-anonymization problem: given a table, suppress a
minimum number of cells so that in the transformed table, each row is identical
to atleast $k-... | [
{
"created": "Tue, 27 Apr 2010 07:46:35 GMT",
"version": "v1"
}
] | 2010-04-28 | [
[
"Chakaravarthy",
"Venkatesan T.",
""
],
[
"Pandit",
"Vinayaka",
""
],
[
"Sabharwal",
"Yogish",
""
]
] | We study the problem of anonymizing tables containing personal information before releasing them for public use. One of the formulations considered in this context is the $k$-anonymization problem: given a table, suppress a minimum number of cells so that in the transformed table, each row is identical to atleast $k-1$... |
2302.01724 | Qingpeng Cai | Qingpeng Cai, Shuchang Liu, Xueliang Wang, Tianyou Zuo, Wentao Xie,
Bin Yang, Dong Zheng, Peng Jiang, Kun Gai | Reinforcing User Retention in a Billion Scale Short Video Recommender
System | null | The Web Conference 2023 Industry Track | null | null | cs.LG cs.IR | http://creativecommons.org/publicdomain/zero/1.0/ | Recently, short video platforms have achieved rapid user growth by
recommending interesting content to users. The objective of the recommendation
is to optimize user retention, thereby driving the growth of DAU (Daily Active
Users). Retention is a long-term feedback after multiple interactions of users
and the system... | [
{
"created": "Fri, 3 Feb 2023 13:25:43 GMT",
"version": "v1"
},
{
"created": "Tue, 7 Feb 2023 04:12:02 GMT",
"version": "v2"
},
{
"created": "Sun, 12 Feb 2023 07:02:19 GMT",
"version": "v3"
}
] | 2023-02-14 | [
[
"Cai",
"Qingpeng",
""
],
[
"Liu",
"Shuchang",
""
],
[
"Wang",
"Xueliang",
""
],
[
"Zuo",
"Tianyou",
""
],
[
"Xie",
"Wentao",
""
],
[
"Yang",
"Bin",
""
],
[
"Zheng",
"Dong",
""
],
[
"Jiang",
"Pen... | Recently, short video platforms have achieved rapid user growth by recommending interesting content to users. The objective of the recommendation is to optimize user retention, thereby driving the growth of DAU (Daily Active Users). Retention is a long-term feedback after multiple interactions of users and the system, ... |
2209.08554 | Murad Tukan | Murad Tukan, Loay Mualem, Alaa Maalouf | Pruning Neural Networks via Coresets and Convex Geometry: Towards No
Assumptions | null | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | Pruning is one of the predominant approaches for compressing deep neural
networks (DNNs). Lately, coresets (provable data summarizations) were leveraged
for pruning DNNs, adding the advantage of theoretical guarantees on the
trade-off between the compression rate and the approximation error. However,
coresets in this... | [
{
"created": "Sun, 18 Sep 2022 12:45:26 GMT",
"version": "v1"
}
] | 2022-09-20 | [
[
"Tukan",
"Murad",
""
],
[
"Mualem",
"Loay",
""
],
[
"Maalouf",
"Alaa",
""
]
] | Pruning is one of the predominant approaches for compressing deep neural networks (DNNs). Lately, coresets (provable data summarizations) were leveraged for pruning DNNs, adding the advantage of theoretical guarantees on the trade-off between the compression rate and the approximation error. However, coresets in this d... |
1903.08752 | Nirupam Gupta | Nirupam Gupta and Nitin H. Vaidya | Byzantine Fault Tolerant Distributed Linear Regression | Manuscript revised by adding; a new improved filtering technique, and
convergence analysis with noise | null | null | null | cs.LG cs.DC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper considers the problem of Byzantine fault tolerance in distributed
linear regression in a multi-agent system. However, the proposed algorithms are
given for a more general class of distributed optimization problems, of which
distributed linear regression is a special case. The system comprises of a
server a... | [
{
"created": "Wed, 20 Mar 2019 21:37:42 GMT",
"version": "v1"
},
{
"created": "Thu, 4 Apr 2019 15:05:46 GMT",
"version": "v2"
}
] | 2019-04-05 | [
[
"Gupta",
"Nirupam",
""
],
[
"Vaidya",
"Nitin H.",
""
]
] | This paper considers the problem of Byzantine fault tolerance in distributed linear regression in a multi-agent system. However, the proposed algorithms are given for a more general class of distributed optimization problems, of which distributed linear regression is a special case. The system comprises of a server and... |
1302.0962 | Veenu Mangat | Savinderjit Kaur (Department of Information Technology, UIET, PU,
Chandigarh, India), Veenu Mangat (Department of Information Technology, UIET,
PU, Chandigarh, India) | Improved Accuracy of PSO and DE using Normalization: an Application to
Stock Price Prediction | null | (IJACSA) International Journal of Advanced Computer Science and
Applications, Vol. 3, No. 9, 2012 | null | null | cs.NE cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Data Mining is being actively applied to stock market since 1980s. It has
been used to predict stock prices, stock indexes, for portfolio management,
trend detection and for developing recommender systems. The various algorithms
which have been used for the same include ANN, SVM, ARIMA, GARCH etc. Different
hybrid mo... | [
{
"created": "Tue, 5 Feb 2013 09:01:13 GMT",
"version": "v1"
}
] | 2013-02-06 | [
[
"Kaur",
"Savinderjit",
"",
"Department of Information Technology, UIET, PU,\n Chandigarh, India"
],
[
"Mangat",
"Veenu",
"",
"Department of Information Technology, UIET,\n PU, Chandigarh, India"
]
] | Data Mining is being actively applied to stock market since 1980s. It has been used to predict stock prices, stock indexes, for portfolio management, trend detection and for developing recommender systems. The various algorithms which have been used for the same include ANN, SVM, ARIMA, GARCH etc. Different hybrid mode... |
1802.00047 | Rui Zhang | Alexander Shapiro, Yao Xie, Rui Zhang | Matrix completion with deterministic pattern - a geometric perspective | null | null | 10.1109/TSP.2018.2885494 | null | cs.LG math.ST stat.ML stat.TH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the matrix completion problem with a deterministic pattern of
observed entries. In this setting, we aim to answer the question: under what
condition there will be (at least locally) unique solution to the matrix
completion problem, i.e., the underlying true matrix is identifiable. We answer
the question f... | [
{
"created": "Wed, 31 Jan 2018 20:03:07 GMT",
"version": "v1"
},
{
"created": "Fri, 2 Feb 2018 02:29:26 GMT",
"version": "v2"
},
{
"created": "Fri, 16 Feb 2018 03:25:36 GMT",
"version": "v3"
},
{
"created": "Wed, 29 Aug 2018 19:03:53 GMT",
"version": "v4"
}
] | 2019-01-30 | [
[
"Shapiro",
"Alexander",
""
],
[
"Xie",
"Yao",
""
],
[
"Zhang",
"Rui",
""
]
] | We consider the matrix completion problem with a deterministic pattern of observed entries. In this setting, we aim to answer the question: under what condition there will be (at least locally) unique solution to the matrix completion problem, i.e., the underlying true matrix is identifiable. We answer the question fro... |
2209.00796 | Ling Yang | Ling Yang, Zhilong Zhang, Yang Song, Shenda Hong, Runsheng Xu, Yue
Zhao, Wentao Zhang, Bin Cui, Ming-Hsuan Yang | Diffusion Models: A Comprehensive Survey of Methods and Applications | 54 pages, 18 figures, citing 368 (up-to-date) papers, project:
https://github.com/YangLing0818/Diffusion-Models-Papers-Survey-Taxonomy,
accepted by ACM Computing Surveys | null | null | null | cs.LG cs.AI cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Diffusion models have emerged as a powerful new family of deep generative
models with record-breaking performance in many applications, including image
synthesis, video generation, and molecule design. In this survey, we provide an
overview of the rapidly expanding body of work on diffusion models,
categorizing the r... | [
{
"created": "Fri, 2 Sep 2022 02:59:10 GMT",
"version": "v1"
},
{
"created": "Thu, 23 Mar 2023 08:25:32 GMT",
"version": "v10"
},
{
"created": "Wed, 11 Oct 2023 01:33:17 GMT",
"version": "v11"
},
{
"created": "Tue, 6 Feb 2024 10:43:20 GMT",
"version": "v12"
},
{
"... | 2024-06-25 | [
[
"Yang",
"Ling",
""
],
[
"Zhang",
"Zhilong",
""
],
[
"Song",
"Yang",
""
],
[
"Hong",
"Shenda",
""
],
[
"Xu",
"Runsheng",
""
],
[
"Zhao",
"Yue",
""
],
[
"Zhang",
"Wentao",
""
],
[
"Cui",
"Bin",
... | Diffusion models have emerged as a powerful new family of deep generative models with record-breaking performance in many applications, including image synthesis, video generation, and molecule design. In this survey, we provide an overview of the rapidly expanding body of work on diffusion models, categorizing the res... |
1803.03571 | Rion Brattig Correia | Rion Brattig Correia and Luciana P. de Ara\'ujo and Mauro M. Mattos
and Luis M. Rocha | City-wide Analysis of Electronic Health Records Reveals Gender and Age
Biases in the Administration of Known Drug-Drug Interactions | null | npj Digit. Med. 2, 74 (2019) | 10.1038/s41746-019-0141-x | null | cs.SI cs.CY cs.IR q-bio.QM stat.ML | http://creativecommons.org/licenses/by/4.0/ | The occurrence of drug-drug-interactions (DDI) from multiple drug
dispensations is a serious problem, both for individuals and health-care
systems, since patients with complications due to DDI are likely to reenter the
system at a costlier level. We present a large-scale longitudinal study (18
months) of the DDI phen... | [
{
"created": "Fri, 9 Mar 2018 15:45:12 GMT",
"version": "v1"
},
{
"created": "Fri, 7 Dec 2018 21:57:21 GMT",
"version": "v2"
},
{
"created": "Wed, 20 Feb 2019 15:29:36 GMT",
"version": "v3"
},
{
"created": "Thu, 2 Jan 2020 14:08:43 GMT",
"version": "v4"
}
] | 2020-01-03 | [
[
"Correia",
"Rion Brattig",
""
],
[
"de Araújo",
"Luciana P.",
""
],
[
"Mattos",
"Mauro M.",
""
],
[
"Rocha",
"Luis M.",
""
]
] | The occurrence of drug-drug-interactions (DDI) from multiple drug dispensations is a serious problem, both for individuals and health-care systems, since patients with complications due to DDI are likely to reenter the system at a costlier level. We present a large-scale longitudinal study (18 months) of the DDI phenom... |
2010.15090 | Vishal Sunder | Vishal Sunder and Eric Fosler-Lussier | Handling Class Imbalance in Low-Resource Dialogue Systems by Combining
Few-Shot Classification and Interpolation | 5 pages, 4 figures, 3 tables | null | null | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Utterance classification performance in low-resource dialogue systems is
constrained by an inevitably high degree of data imbalance in class labels. We
present a new end-to-end pairwise learning framework that is designed
specifically to tackle this phenomenon by inducing a few-shot classification
capability in the u... | [
{
"created": "Wed, 28 Oct 2020 17:05:24 GMT",
"version": "v1"
}
] | 2020-10-29 | [
[
"Sunder",
"Vishal",
""
],
[
"Fosler-Lussier",
"Eric",
""
]
] | Utterance classification performance in low-resource dialogue systems is constrained by an inevitably high degree of data imbalance in class labels. We present a new end-to-end pairwise learning framework that is designed specifically to tackle this phenomenon by inducing a few-shot classification capability in the utt... |
2203.07920 | Jingxiong Gao | Zichen Xu, Yunxiao Du, Kanqi Zhang, Jiacheng Huang, Jie Liu, Jingxiong
Gao, Christopher Stewart | Cost-effective BlackWater Raft on Highly Unreliable Nodes at Scale Out | 18 pages, 26 figures, We are already revising the Camera Ready
version of IEEE Transaction on Cloud Computing | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Raft algorithm maintains strong consistency across data replicas in
Cloud. This algorithm divides nodes into leaders and followers, to satisfy
read/write requests spanning geo-diverse sites. With the increase of workload,
Raft shall provide scale-out performance in proportion. However, traditional
scale-out techn... | [
{
"created": "Tue, 15 Mar 2022 14:00:17 GMT",
"version": "v1"
}
] | 2022-03-16 | [
[
"Xu",
"Zichen",
""
],
[
"Du",
"Yunxiao",
""
],
[
"Zhang",
"Kanqi",
""
],
[
"Huang",
"Jiacheng",
""
],
[
"Liu",
"Jie",
""
],
[
"Gao",
"Jingxiong",
""
],
[
"Stewart",
"Christopher",
""
]
] | The Raft algorithm maintains strong consistency across data replicas in Cloud. This algorithm divides nodes into leaders and followers, to satisfy read/write requests spanning geo-diverse sites. With the increase of workload, Raft shall provide scale-out performance in proportion. However, traditional scale-out techniq... |
1804.01307 | Anjany Kumar Sekuboyina | Anjany Sekuboyina, Markus Rempfler, Jan Kuka\v{c}ka, Giles Tetteh,
Alexander Valentinitsch, Jan S. Kirschke, and Bjoern H. Menze | Btrfly Net: Vertebrae Labelling with Energy-based Adversarial Learning
of Local Spine Prior | Published as conference paper in Medical Image Computing and Computer
Assisted Intervention - MICCAI 2018 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Robust localisation and identification of vertebrae is essential for
automated spine analysis. The contribution of this work to the task is
two-fold: (1) Inspired by the human expert, we hypothesise that a sagittal and
coronal reformation of the spine contain sufficient information for labelling
the vertebrae. Thereb... | [
{
"created": "Wed, 4 Apr 2018 09:00:33 GMT",
"version": "v1"
},
{
"created": "Tue, 13 Nov 2018 16:20:52 GMT",
"version": "v2"
}
] | 2018-11-14 | [
[
"Sekuboyina",
"Anjany",
""
],
[
"Rempfler",
"Markus",
""
],
[
"Kukačka",
"Jan",
""
],
[
"Tetteh",
"Giles",
""
],
[
"Valentinitsch",
"Alexander",
""
],
[
"Kirschke",
"Jan S.",
""
],
[
"Menze",
"Bjoern H.",
"... | Robust localisation and identification of vertebrae is essential for automated spine analysis. The contribution of this work to the task is two-fold: (1) Inspired by the human expert, we hypothesise that a sagittal and coronal reformation of the spine contain sufficient information for labelling the vertebrae. Thereby,... |
1909.08866 | Dimitri Gominski | Dimitri Gominski (LaSTIG), Martyna Poreba (LaSTIG), Val\'erie
Gouet-Brunet (LaSTIG), Liming Chen (LaSTIG) | Challenging deep image descriptors for retrieval in heterogeneous
iconographic collections | SUMAC '19, 2019 | null | 10.1145/3347317.3357246 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This article proposes to study the behavior of recent and efficient
state-of-the-art deep-learning based image descriptors for content-based image
retrieval, facing a panel of complex variations appearing in heterogeneous
image datasets, in particular in cultural collections that may involve
multi-source, multi-date ... | [
{
"created": "Thu, 19 Sep 2019 08:54:51 GMT",
"version": "v1"
}
] | 2019-09-20 | [
[
"Gominski",
"Dimitri",
"",
"LaSTIG"
],
[
"Poreba",
"Martyna",
"",
"LaSTIG"
],
[
"Gouet-Brunet",
"Valérie",
"",
"LaSTIG"
],
[
"Chen",
"Liming",
"",
"LaSTIG"
]
] | This article proposes to study the behavior of recent and efficient state-of-the-art deep-learning based image descriptors for content-based image retrieval, facing a panel of complex variations appearing in heterogeneous image datasets, in particular in cultural collections that may involve multi-source, multi-date an... |
1511.08507 | Steffen Wendzel | Steffen Wendzel, Carolin Palmer | Creativity in Mind: Evaluating and Maintaining Advances in Network
Steganographic Research | to appear in Journal of Universal Computer Science (J.UCS) | Journal of Universal Computer Science, Vol. 21(12), 2015 | 10.3217/jucs-021-12-1684 | null | cs.MM cs.CR cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The research discipline of network steganography deals with the hiding of
information within network transmissions, e.g. to transfer illicit information
in networks with Internet censorship. The last decades of research on network
steganography led to more than hundred techniques for hiding data in network
transmissi... | [
{
"created": "Thu, 26 Nov 2015 21:07:05 GMT",
"version": "v1"
}
] | 2016-11-22 | [
[
"Wendzel",
"Steffen",
""
],
[
"Palmer",
"Carolin",
""
]
] | The research discipline of network steganography deals with the hiding of information within network transmissions, e.g. to transfer illicit information in networks with Internet censorship. The last decades of research on network steganography led to more than hundred techniques for hiding data in network transmission... |
2109.09526 | Stavros Shiaeles Dr | Stavros Shiaeles, Nicholas Kolokotronis, Emanuele Bellini | IoT Vulnerability Data Crawling and Analysis | 2019 IEEE World Congress on Services (SERVICES) | null | 10.1109/SERVICES.2019.00028 | null | cs.CR | http://creativecommons.org/licenses/by/4.0/ | Internet of Things (IoT) is a whole new ecosystem comprised of heterogeneous
connected devices -i.e. computers, laptops, smart-phones and tablets as well as
embedded devices and sensors-that communicate to deliver capabilities making
our living, cities, transport, energy, and many other areas more intelligent.
The ma... | [
{
"created": "Mon, 20 Sep 2021 13:20:51 GMT",
"version": "v1"
}
] | 2021-09-21 | [
[
"Shiaeles",
"Stavros",
""
],
[
"Kolokotronis",
"Nicholas",
""
],
[
"Bellini",
"Emanuele",
""
]
] | Internet of Things (IoT) is a whole new ecosystem comprised of heterogeneous connected devices -i.e. computers, laptops, smart-phones and tablets as well as embedded devices and sensors-that communicate to deliver capabilities making our living, cities, transport, energy, and many other areas more intelligent. The main... |
1912.04822 | Jocelyn Sunseri | Jocelyn Sunseri and David Ryan Koes | libmolgrid: GPU Accelerated Molecular Gridding for Deep Learning
Applications | null | null | null | null | cs.LG physics.chem-ph q-bio.BM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | There are many ways to represent a molecule as input to a machine learning
model and each is associated with loss and retention of certain kinds of
information. In the interest of preserving three-dimensional spatial
information, including bond angles and torsions, we have developed libmolgrid,
a general-purpose libr... | [
{
"created": "Tue, 10 Dec 2019 17:03:56 GMT",
"version": "v1"
}
] | 2019-12-11 | [
[
"Sunseri",
"Jocelyn",
""
],
[
"Koes",
"David Ryan",
""
]
] | There are many ways to represent a molecule as input to a machine learning model and each is associated with loss and retention of certain kinds of information. In the interest of preserving three-dimensional spatial information, including bond angles and torsions, we have developed libmolgrid, a general-purpose librar... |
1603.00831 | Anton Milan | Anton Milan, Laura Leal-Taixe, Ian Reid, Stefan Roth, Konrad Schindler | MOT16: A Benchmark for Multi-Object Tracking | arXiv admin note: substantial text overlap with arXiv:1504.01942 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Standardized benchmarks are crucial for the majority of computer vision
applications. Although leaderboards and ranking tables should not be
over-claimed, benchmarks often provide the most objective measure of
performance and are therefore important guides for reseach.
Recently, a new benchmark for Multiple Object ... | [
{
"created": "Wed, 2 Mar 2016 19:07:56 GMT",
"version": "v1"
},
{
"created": "Tue, 3 May 2016 23:55:38 GMT",
"version": "v2"
}
] | 2016-05-05 | [
[
"Milan",
"Anton",
""
],
[
"Leal-Taixe",
"Laura",
""
],
[
"Reid",
"Ian",
""
],
[
"Roth",
"Stefan",
""
],
[
"Schindler",
"Konrad",
""
]
] | Standardized benchmarks are crucial for the majority of computer vision applications. Although leaderboards and ranking tables should not be over-claimed, benchmarks often provide the most objective measure of performance and are therefore important guides for reseach. Recently, a new benchmark for Multiple Object Trac... |
1910.01973 | Martin Johannes Kraemer | Martin J Kraemer, William Seymour, Reuben Binns, Max Van Kleek, Ivan
Flechais | Informing The Future of Data Protection in Smart Homes | Proceedings of the CHI 2019 Workshop on New Directions for the IoT:
Automate, Share, Build, and Care, (arXiv:1906.06089) | null | null | IOTD/2019/12 | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent changes to data protection regulation, particularly in Europe, are
changing the design landscape for smart devices, requiring new design
techniques to ensure that devices are able to adequately protect users' data. A
particularly interesting space in which to explore and address these challenges
is the smart h... | [
{
"created": "Mon, 17 Jun 2019 09:57:41 GMT",
"version": "v1"
}
] | 2019-10-07 | [
[
"Kraemer",
"Martin J",
""
],
[
"Seymour",
"William",
""
],
[
"Binns",
"Reuben",
""
],
[
"Van Kleek",
"Max",
""
],
[
"Flechais",
"Ivan",
""
]
] | Recent changes to data protection regulation, particularly in Europe, are changing the design landscape for smart devices, requiring new design techniques to ensure that devices are able to adequately protect users' data. A particularly interesting space in which to explore and address these challenges is the smart hom... |
1602.00877 | Jonathan Scarlett | Jonathan Scarlett and Volkan Cevher | Partial Recovery Bounds for the Sparse Stochastic Block Model | Accepted to ISIT 2016 | null | null | null | cs.IT cs.SI math.IT stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we study the information-theoretic limits of community
detection in the symmetric two-community stochastic block model, with
intra-community and inter-community edge probabilities $\frac{a}{n}$ and
$\frac{b}{n}$ respectively. We consider the sparse setting, in which $a$ and
$b$ do not scale with $n$, a... | [
{
"created": "Tue, 2 Feb 2016 11:00:10 GMT",
"version": "v1"
},
{
"created": "Mon, 4 Apr 2016 16:59:26 GMT",
"version": "v2"
}
] | 2016-04-05 | [
[
"Scarlett",
"Jonathan",
""
],
[
"Cevher",
"Volkan",
""
]
] | In this paper, we study the information-theoretic limits of community detection in the symmetric two-community stochastic block model, with intra-community and inter-community edge probabilities $\frac{a}{n}$ and $\frac{b}{n}$ respectively. We consider the sparse setting, in which $a$ and $b$ do not scale with $n$, and... |
2208.08084 | Xinghao Chen | Zhijun Tu, Xinghao Chen, Pengju Ren, Yunhe Wang | AdaBin: Improving Binary Neural Networks with Adaptive Binary Sets | ECCV 2022 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper studies the Binary Neural Networks (BNNs) in which weights and
activations are both binarized into 1-bit values, thus greatly reducing the
memory usage and computational complexity. Since the modern deep neural
networks are of sophisticated design with complex architecture for the accuracy
reason, the dive... | [
{
"created": "Wed, 17 Aug 2022 05:43:33 GMT",
"version": "v1"
},
{
"created": "Mon, 3 Oct 2022 14:23:42 GMT",
"version": "v2"
}
] | 2022-10-04 | [
[
"Tu",
"Zhijun",
""
],
[
"Chen",
"Xinghao",
""
],
[
"Ren",
"Pengju",
""
],
[
"Wang",
"Yunhe",
""
]
] | This paper studies the Binary Neural Networks (BNNs) in which weights and activations are both binarized into 1-bit values, thus greatly reducing the memory usage and computational complexity. Since the modern deep neural networks are of sophisticated design with complex architecture for the accuracy reason, the divers... |
2301.05897 | Erik Isai Valle Salgado | Erik Isai Valle Salgado, Haoxin Yan, Yue Hong, Peiyuan Zhu, Shidong
Zhu, Chengwei Liao, Yanxiang Wen, Xiu Li, Xiang Qian, Xiaohao Wang, Xinghui
Li | Model-based Transfer Learning for Automatic Optical Inspection based on
domain discrepancy | This is a fix of the published paper "Relational-based transfer
learning for automatic optical inspection based on domain discrepancy" | Proc. SPIE 12317, Optoelectronic Imaging and Multimedia Technology
IXMultimedia Technology IX, 2023 | 10.1117/12.2644087 10.1117/12.2644087 | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Transfer learning is a promising method for AOI applications since it can
significantly shorten sample collection time and improve efficiency in today's
smart manufacturing. However, related research enhanced the network models by
applying TL without considering the domain similarity among datasets, the data
long-tai... | [
{
"created": "Sat, 14 Jan 2023 11:32:39 GMT",
"version": "v1"
}
] | 2023-01-18 | [
[
"Salgado",
"Erik Isai Valle",
""
],
[
"Yan",
"Haoxin",
""
],
[
"Hong",
"Yue",
""
],
[
"Zhu",
"Peiyuan",
""
],
[
"Zhu",
"Shidong",
""
],
[
"Liao",
"Chengwei",
""
],
[
"Wen",
"Yanxiang",
""
],
[
"Li",... | Transfer learning is a promising method for AOI applications since it can significantly shorten sample collection time and improve efficiency in today's smart manufacturing. However, related research enhanced the network models by applying TL without considering the domain similarity among datasets, the data long-taile... |
1506.02531 | Cl\'ement Duhart Mr | Cl\'ement Duhart and Pierre Sauvage and Cyrille Bertelle | EMMA: A Resource Oriented Framework for Service Choreography over
Wireless Sensor and Actor Networks | 23 pages | null | null | null | cs.NI cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Current Internet of Things (IoT) development requires service distribution
over Wireless Sensor and Actor Networks (WSAN) to deal with the drastic
increasing of network management complexity. Because of the specific
constraints of WSAN, centralized approaches are strongly limited. Multi-hop
communication used by WSAN... | [
{
"created": "Mon, 8 Jun 2015 14:54:24 GMT",
"version": "v1"
}
] | 2015-06-09 | [
[
"Duhart",
"Clément",
""
],
[
"Sauvage",
"Pierre",
""
],
[
"Bertelle",
"Cyrille",
""
]
] | Current Internet of Things (IoT) development requires service distribution over Wireless Sensor and Actor Networks (WSAN) to deal with the drastic increasing of network management complexity. Because of the specific constraints of WSAN, centralized approaches are strongly limited. Multi-hop communication used by WSAN i... |
2201.07216 | Yiqiang Sheng | Satoshi Kamo, Yiqiang Sheng | Wide Area Network Intelligence with Application to Multimedia Service | null | null | null | null | cs.NI cs.AI cs.NE | http://creativecommons.org/licenses/by/4.0/ | Network intelligence is a discipline that builds on the capabilities of
network systems to act intelligently by the usage of network resources for
delivering high-quality services in a changing environment. Wide area network
intelligence is a class of network intelligence in wide area network which
covers the core an... | [
{
"created": "Fri, 14 Jan 2022 23:45:54 GMT",
"version": "v1"
}
] | 2022-01-20 | [
[
"Kamo",
"Satoshi",
""
],
[
"Sheng",
"Yiqiang",
""
]
] | Network intelligence is a discipline that builds on the capabilities of network systems to act intelligently by the usage of network resources for delivering high-quality services in a changing environment. Wide area network intelligence is a class of network intelligence in wide area network which covers the core and ... |
1308.4757 | Ziqiang Shi | Ziqiang Shi and Rujie Liu | Online and stochastic Douglas-Rachford splitting method for large scale
machine learning | null | null | null | null | cs.NA cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Online and stochastic learning has emerged as powerful tool in large scale
optimization. In this work, we generalize the Douglas-Rachford splitting (DRs)
method for minimizing composite functions to online and stochastic settings (to
our best knowledge this is the first time DRs been generalized to sequential
version... | [
{
"created": "Thu, 22 Aug 2013 03:40:41 GMT",
"version": "v1"
},
{
"created": "Mon, 26 Aug 2013 06:21:25 GMT",
"version": "v2"
},
{
"created": "Wed, 28 Aug 2013 06:50:16 GMT",
"version": "v3"
},
{
"created": "Sat, 7 Sep 2013 04:30:41 GMT",
"version": "v4"
},
{
"cr... | 2016-12-22 | [
[
"Shi",
"Ziqiang",
""
],
[
"Liu",
"Rujie",
""
]
] | Online and stochastic learning has emerged as powerful tool in large scale optimization. In this work, we generalize the Douglas-Rachford splitting (DRs) method for minimizing composite functions to online and stochastic settings (to our best knowledge this is the first time DRs been generalized to sequential version).... |
2303.04486 | Sarah Bee | S.C. Bee, E. Papatheou, M Haywood-Alexander, R.S. Mills, L.A. Bull, K.
Worden and N. Dervilis | Better Together: Using Multi-task Learning to Improve Feature Selection
within Structural Datasets | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | There have been recent efforts to move to population-based structural health
monitoring (PBSHM) systems. One area of PBSHM which has been recognised for
potential development is the use of multi-task learning (MTL); algorithms which
differ from traditional independent learning algorithms. Presented here is the
use of... | [
{
"created": "Wed, 8 Mar 2023 10:19:55 GMT",
"version": "v1"
}
] | 2023-03-09 | [
[
"Bee",
"S. C.",
""
],
[
"Papatheou",
"E.",
""
],
[
"Haywood-Alexander",
"M",
""
],
[
"Mills",
"R. S.",
""
],
[
"Bull",
"L. A.",
""
],
[
"Worden",
"K.",
""
],
[
"Dervilis",
"N.",
""
]
] | There have been recent efforts to move to population-based structural health monitoring (PBSHM) systems. One area of PBSHM which has been recognised for potential development is the use of multi-task learning (MTL); algorithms which differ from traditional independent learning algorithms. Presented here is the use of t... |
2401.08719 | Sang-Ki Ko | Seung-Yeop Baik, Mingi Jeon, Joonghyuk Hahn, Jungin Kim, Yo-Sub Han,
Sang-Ki Ko | CodeComplex: A Time-Complexity Dataset for Bilingual Source Codes | null | null | null | null | cs.SE cs.CC | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Analyzing the worst-case time complexity of a code is a crucial task in
computer science and software engineering for ensuring the efficiency,
reliability, and robustness of software systems. However, it is well-known that
the problem of determining the worst-case time complexity of a given code
written in general-pu... | [
{
"created": "Tue, 16 Jan 2024 06:54:44 GMT",
"version": "v1"
}
] | 2024-01-18 | [
[
"Baik",
"Seung-Yeop",
""
],
[
"Jeon",
"Mingi",
""
],
[
"Hahn",
"Joonghyuk",
""
],
[
"Kim",
"Jungin",
""
],
[
"Han",
"Yo-Sub",
""
],
[
"Ko",
"Sang-Ki",
""
]
] | Analyzing the worst-case time complexity of a code is a crucial task in computer science and software engineering for ensuring the efficiency, reliability, and robustness of software systems. However, it is well-known that the problem of determining the worst-case time complexity of a given code written in general-purp... |
2109.14680 | Jialing Liao | Jialing Liao and Olav Tirkkonen | Fundamental Rate-Memory Tradeoff for Coded Caching in Presence of User
Inactivity | 42pages, 5 figures, submitted to Trans Inf | null | null | null | cs.IT math.IT | http://creativecommons.org/licenses/by/4.0/ | Coded caching utilizes proper file subpacketization and coded delivery to
make full use of the multicast opportunities in content delivery, to alleviate
file transfer load in massive content delivery scenarios. Most existing work
considers deterministic environments. An important practical topic is to
characterize th... | [
{
"created": "Wed, 29 Sep 2021 19:31:40 GMT",
"version": "v1"
}
] | 2021-10-01 | [
[
"Liao",
"Jialing",
""
],
[
"Tirkkonen",
"Olav",
""
]
] | Coded caching utilizes proper file subpacketization and coded delivery to make full use of the multicast opportunities in content delivery, to alleviate file transfer load in massive content delivery scenarios. Most existing work considers deterministic environments. An important practical topic is to characterize the ... |
1908.07323 | Zewen He | Zewen He, He Huang, Yudong Wu, Guan Huang, Wensheng Zhang | Instance Scale Normalization for image understanding | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Scale variation remains a challenging problem for object detection. Common
paradigms usually adopt multiscale training & testing (image pyramid) or FPN
(feature pyramid network) to process objects in a wide scale range. However,
multi-scale methods aggravate more variations of scale that even deep
convolution neural ... | [
{
"created": "Tue, 20 Aug 2019 13:12:33 GMT",
"version": "v1"
},
{
"created": "Wed, 10 Jun 2020 01:42:50 GMT",
"version": "v2"
}
] | 2020-06-11 | [
[
"He",
"Zewen",
""
],
[
"Huang",
"He",
""
],
[
"Wu",
"Yudong",
""
],
[
"Huang",
"Guan",
""
],
[
"Zhang",
"Wensheng",
""
]
] | Scale variation remains a challenging problem for object detection. Common paradigms usually adopt multiscale training & testing (image pyramid) or FPN (feature pyramid network) to process objects in a wide scale range. However, multi-scale methods aggravate more variations of scale that even deep convolution neural ne... |
2105.08877 | Erick Delage | Abderrahim Fathan and Erick Delage | Deep Reinforcement Learning for Optimal Stopping with Application in
Financial Engineering | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Optimal stopping is the problem of deciding the right time at which to take a
particular action in a stochastic system, in order to maximize an expected
reward. It has many applications in areas such as finance, healthcare, and
statistics. In this paper, we employ deep Reinforcement Learning (RL) to learn
optimal sto... | [
{
"created": "Wed, 19 May 2021 01:52:04 GMT",
"version": "v1"
}
] | 2021-05-20 | [
[
"Fathan",
"Abderrahim",
""
],
[
"Delage",
"Erick",
""
]
] | Optimal stopping is the problem of deciding the right time at which to take a particular action in a stochastic system, in order to maximize an expected reward. It has many applications in areas such as finance, healthcare, and statistics. In this paper, we employ deep Reinforcement Learning (RL) to learn optimal stopp... |
2002.03323 | Lina Mohjazi | Lina Mohjazi, Sami Muhaidat, Mehrdad Dianati, Mahmoud Al-Qutayri and
Naofal Al-Dhahir | Performance Analysis of SWIPT Relaying Systems in the Presence of
Impulsive Noise | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We develop an analytical framework to characterize the effect of impulsive
noise on the performance of relay-assisted simultaneous wireless information
and power transfer (SWIPT) systems. We derive novel closed-form expressions for
the pairwise error probability (PEP) considering two variants based on the
availabilit... | [
{
"created": "Sun, 9 Feb 2020 09:13:26 GMT",
"version": "v1"
}
] | 2020-02-11 | [
[
"Mohjazi",
"Lina",
""
],
[
"Muhaidat",
"Sami",
""
],
[
"Dianati",
"Mehrdad",
""
],
[
"Al-Qutayri",
"Mahmoud",
""
],
[
"Al-Dhahir",
"Naofal",
""
]
] | We develop an analytical framework to characterize the effect of impulsive noise on the performance of relay-assisted simultaneous wireless information and power transfer (SWIPT) systems. We derive novel closed-form expressions for the pairwise error probability (PEP) considering two variants based on the availability ... |
1803.11046 | Swarup Chauhan | Swarup Chauhan (1 and 2), Kathleen Sell (2 and 5), Frieder Enzmann
(2), Wolfram R\"uhaak (3), Thorsten Wille (4), Ingo Sass (1), Michael Kersten
(2) ((1) Institute of Applied Geosciences, University of Technology,
Darmstadt, Germany (2) Institute for Geosciences, Johannes
Gutenberg-University, Mainz, Germany (3... | CobWeb - a toolbox for automatic tomographic image analysis based on
machine learning techniques: application and examples | 29 pages (article + appendix). 16 figures (8 Article/8 Appendix) | null | null | null | cs.HC | http://creativecommons.org/licenses/by/4.0/ | In this study, we introduce CobWeb 1.0 which is a graphical user interface
tailored explicitly for accurate image segmentation and representative
elementary volume analysis of digital rock images derived from high resolution
tomography. The CobWeb code is a work package deployed as a series of windows
executable bina... | [
{
"created": "Thu, 29 Mar 2018 13:13:57 GMT",
"version": "v1"
},
{
"created": "Fri, 6 Apr 2018 13:50:42 GMT",
"version": "v2"
},
{
"created": "Mon, 9 Apr 2018 00:28:36 GMT",
"version": "v3"
}
] | 2018-04-10 | [
[
"Chauhan",
"Swarup",
"",
"1 and 2"
],
[
"Sell",
"Kathleen",
"",
"2 and 5"
],
[
"Enzmann",
"Frieder",
""
],
[
"Rühaak",
"Wolfram",
""
],
[
"Wille",
"Thorsten",
""
],
[
"Sass",
"Ingo",
""
],
[
"Kersten",
... | In this study, we introduce CobWeb 1.0 which is a graphical user interface tailored explicitly for accurate image segmentation and representative elementary volume analysis of digital rock images derived from high resolution tomography. The CobWeb code is a work package deployed as a series of windows executable binari... |
0712.0411 | Suresh Thippireddy | Suresh Thippireddy and Sandeep Chalasani | Period of the d-Sequence Based Random Number Generator | 8 pages, 4 figures | null | null | null | cs.CR | null | This paper presents an expression to compute the exact period of a recursive
random number generator based on d-sequences. Using the multi-recursive version
of this generator we can produce large number of pseudorandom sequences.
| [
{
"created": "Mon, 3 Dec 2007 23:29:42 GMT",
"version": "v1"
}
] | 2007-12-05 | [
[
"Thippireddy",
"Suresh",
""
],
[
"Chalasani",
"Sandeep",
""
]
] | This paper presents an expression to compute the exact period of a recursive random number generator based on d-sequences. Using the multi-recursive version of this generator we can produce large number of pseudorandom sequences. |
2005.07858 | Seunghan Yang | Seunghan Yang, Youngeun Kim, Dongki Jung, Changick Kim | Partial Domain Adaptation Using Graph Convolutional Networks | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Partial domain adaptation (PDA), in which we assume the target label space is
included in the source label space, is a general version of standard domain
adaptation. Since the target label space is unknown, the main challenge of PDA
is to reduce the learning impact of irrelevant source samples, named outliers,
which ... | [
{
"created": "Sat, 16 May 2020 03:37:38 GMT",
"version": "v1"
}
] | 2020-05-19 | [
[
"Yang",
"Seunghan",
""
],
[
"Kim",
"Youngeun",
""
],
[
"Jung",
"Dongki",
""
],
[
"Kim",
"Changick",
""
]
] | Partial domain adaptation (PDA), in which we assume the target label space is included in the source label space, is a general version of standard domain adaptation. Since the target label space is unknown, the main challenge of PDA is to reduce the learning impact of irrelevant source samples, named outliers, which do... |
1705.00754 | Ranjay Krishna | Ranjay Krishna, Kenji Hata, Frederic Ren, Li Fei-Fei, Juan Carlos
Niebles | Dense-Captioning Events in Videos | 16 pages, 16 figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Most natural videos contain numerous events. For example, in a video of a
"man playing a piano", the video might also contain "another man dancing" or "a
crowd clapping". We introduce the task of dense-captioning events, which
involves both detecting and describing events in a video. We propose a new
model that is ab... | [
{
"created": "Tue, 2 May 2017 01:21:58 GMT",
"version": "v1"
}
] | 2017-05-03 | [
[
"Krishna",
"Ranjay",
""
],
[
"Hata",
"Kenji",
""
],
[
"Ren",
"Frederic",
""
],
[
"Fei-Fei",
"Li",
""
],
[
"Niebles",
"Juan Carlos",
""
]
] | Most natural videos contain numerous events. For example, in a video of a "man playing a piano", the video might also contain "another man dancing" or "a crowd clapping". We introduce the task of dense-captioning events, which involves both detecting and describing events in a video. We propose a new model that is able... |
2104.12046 | Xiaowei Xu | Wentao Chen, Hailong Qiu, Jian Zhuang, Chutong Zhang, Yu Hu, Qing Lu,
Tianchen Wang, Yiyu Shi, Meiping Huang, Xiaowe Xu | Quantization of Deep Neural Networks for Accurate Edge Computing | 11 pages, 3 figures, 10 tables, accepted by the ACM Journal on
Emerging Technologies in Computing Systems (JETC) | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep neural networks (DNNs) have demonstrated their great potential in recent
years, exceeding the per-formance of human experts in a wide range of
applications. Due to their large sizes, however, compressiontechniques such as
weight quantization and pruning are usually applied before they can be
accommodated onthe e... | [
{
"created": "Sun, 25 Apr 2021 02:05:12 GMT",
"version": "v1"
},
{
"created": "Thu, 14 Oct 2021 07:14:14 GMT",
"version": "v2"
}
] | 2021-10-15 | [
[
"Chen",
"Wentao",
""
],
[
"Qiu",
"Hailong",
""
],
[
"Zhuang",
"Jian",
""
],
[
"Zhang",
"Chutong",
""
],
[
"Hu",
"Yu",
""
],
[
"Lu",
"Qing",
""
],
[
"Wang",
"Tianchen",
""
],
[
"Shi",
"Yiyu",
... | Deep neural networks (DNNs) have demonstrated their great potential in recent years, exceeding the per-formance of human experts in a wide range of applications. Due to their large sizes, however, compressiontechniques such as weight quantization and pruning are usually applied before they can be accommodated onthe edg... |
1402.2231 | William Bradley | J. N. Laska, W. F. Bradley, T. W. Rondeau, K. E. Nolan, and B. Vigoda | Compressive sensing for dynamic spectrum access networks: Techniques and
tradeoffs | 2011 IEEE Symposium on New Frontiers in Dynamic Spectrum, May 2011 | null | 10.1109/DYSPAN.2011.5936202 | null | cs.NI cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We explore the practical costs and benefits of CS for dynamic spectrum access
(DSA) networks. Firstly, we review several fast and practical techniques for
energy detection without full reconstruction and provide theoretical
guarantees. We also define practical metrics to measure the performance of
these techniques. S... | [
{
"created": "Mon, 10 Feb 2014 18:27:53 GMT",
"version": "v1"
}
] | 2016-11-18 | [
[
"Laska",
"J. N.",
""
],
[
"Bradley",
"W. F.",
""
],
[
"Rondeau",
"T. W.",
""
],
[
"Nolan",
"K. E.",
""
],
[
"Vigoda",
"B.",
""
]
] | We explore the practical costs and benefits of CS for dynamic spectrum access (DSA) networks. Firstly, we review several fast and practical techniques for energy detection without full reconstruction and provide theoretical guarantees. We also define practical metrics to measure the performance of these techniques. Sec... |
1810.01049 | Hu Ding | Hu Ding and Jinhui Xu | A Unified Framework for Clustering Constrained Data without Locality
Property | null | null | null | null | cs.CG cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we consider a class of constrained clustering problems of
points in $\mathbb{R}^{d}$, where $d$ could be rather high. A common feature of
these problems is that their optimal clusterings no longer have the locality
property (due to the additional constraints), which is a key property required
by many a... | [
{
"created": "Tue, 2 Oct 2018 03:18:15 GMT",
"version": "v1"
}
] | 2018-10-03 | [
[
"Ding",
"Hu",
""
],
[
"Xu",
"Jinhui",
""
]
] | In this paper, we consider a class of constrained clustering problems of points in $\mathbb{R}^{d}$, where $d$ could be rather high. A common feature of these problems is that their optimal clusterings no longer have the locality property (due to the additional constraints), which is a key property required by many alg... |
1210.2529 | Chau Yuen | Mahshad Eslamifar, Woon Hau Chin, Chau Yuen and Yong Liang Guan | Performance Analysis of Two-Step Bi-Directional Relaying with Multiple
Antennas | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we study decode-and-forward multi-antenna relay systems that
achieve bi-directional communication in two time slots. We investigate
different downlink broadcast schemes which employ binary or analog network
coding at the relay. We also analyze and compare their performances in terms of
diversity order a... | [
{
"created": "Tue, 9 Oct 2012 08:41:47 GMT",
"version": "v1"
}
] | 2012-10-10 | [
[
"Eslamifar",
"Mahshad",
""
],
[
"Chin",
"Woon Hau",
""
],
[
"Yuen",
"Chau",
""
],
[
"Guan",
"Yong Liang",
""
]
] | In this paper we study decode-and-forward multi-antenna relay systems that achieve bi-directional communication in two time slots. We investigate different downlink broadcast schemes which employ binary or analog network coding at the relay. We also analyze and compare their performances in terms of diversity order and... |
1806.02918 | Maria Shugrina | Maria Shugrina, Amlan Kar, Karan Singh, Sanja Fidler | Color Sails: Discrete-Continuous Palettes for Deep Color Exploration | 14 pages, 13 figures | null | null | null | cs.GR cs.AI cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present color sails, a discrete-continuous color gamut representation that
extends the color gradient analogy to three dimensions and allows interactive
control of the color blending behavior. Our representation models a wide
variety of color distributions in a compact manner, and lends itself to
applications such... | [
{
"created": "Thu, 7 Jun 2018 22:42:00 GMT",
"version": "v1"
}
] | 2018-06-11 | [
[
"Shugrina",
"Maria",
""
],
[
"Kar",
"Amlan",
""
],
[
"Singh",
"Karan",
""
],
[
"Fidler",
"Sanja",
""
]
] | We present color sails, a discrete-continuous color gamut representation that extends the color gradient analogy to three dimensions and allows interactive control of the color blending behavior. Our representation models a wide variety of color distributions in a compact manner, and lends itself to applications such a... |
2202.08514 | Sayed Hashim | Muhammad Ali, Sayed Hashim | Survey on Self-supervised Representation Learning Using Image
Transformations | null | null | null | null | cs.CV cs.LG | http://creativecommons.org/licenses/by/4.0/ | Deep neural networks need huge amount of training data, while in real world
there is a scarcity of data available for training purposes. To resolve these
issues, self-supervised learning (SSL) methods are used. SSL using geometric
transformations (GT) is a simple yet powerful technique used in unsupervised
representa... | [
{
"created": "Thu, 17 Feb 2022 08:37:50 GMT",
"version": "v1"
}
] | 2022-02-18 | [
[
"Ali",
"Muhammad",
""
],
[
"Hashim",
"Sayed",
""
]
] | Deep neural networks need huge amount of training data, while in real world there is a scarcity of data available for training purposes. To resolve these issues, self-supervised learning (SSL) methods are used. SSL using geometric transformations (GT) is a simple yet powerful technique used in unsupervised representati... |
2207.04145 | Neil Perry | Neil Perry, Bruce Spang, Saba Eskandarian, Dan Boneh | Strong Anonymity for Mesh Messaging | 21 pages, 11 figures; added reference to introduction | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Messaging systems built on mesh networks consisting of smartphones
communicating over Bluetooth have been used by protesters around the world
after governments have disrupted Internet connectivity. Unfortunately, existing
systems have been shown to be insecure; most concerningly by not adequately
hiding metadata. Thi... | [
{
"created": "Fri, 8 Jul 2022 22:25:27 GMT",
"version": "v1"
},
{
"created": "Mon, 22 Aug 2022 19:50:51 GMT",
"version": "v2"
}
] | 2022-08-24 | [
[
"Perry",
"Neil",
""
],
[
"Spang",
"Bruce",
""
],
[
"Eskandarian",
"Saba",
""
],
[
"Boneh",
"Dan",
""
]
] | Messaging systems built on mesh networks consisting of smartphones communicating over Bluetooth have been used by protesters around the world after governments have disrupted Internet connectivity. Unfortunately, existing systems have been shown to be insecure; most concerningly by not adequately hiding metadata. This ... |
1502.05767 | Atilim Gunes Baydin | Atilim Gunes Baydin, Barak A. Pearlmutter, Alexey Andreyevich Radul,
Jeffrey Mark Siskind | Automatic differentiation in machine learning: a survey | 43 pages, 5 figures | Atilim Gunes Baydin, Barak A. Pearlmutter, Alexey Andreyevich
Radul, Jeffrey Mark Siskind. Automatic differentiation in machine learning: a
survey. The Journal of Machine Learning Research, 18(153):1--43, 2018 | null | null | cs.SC cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Derivatives, mostly in the form of gradients and Hessians, are ubiquitous in
machine learning. Automatic differentiation (AD), also called algorithmic
differentiation or simply "autodiff", is a family of techniques similar to but
more general than backpropagation for efficiently and accurately evaluating
derivatives ... | [
{
"created": "Fri, 20 Feb 2015 04:20:47 GMT",
"version": "v1"
},
{
"created": "Sun, 19 Apr 2015 16:49:13 GMT",
"version": "v2"
},
{
"created": "Thu, 17 Aug 2017 16:45:07 GMT",
"version": "v3"
},
{
"created": "Mon, 5 Feb 2018 15:57:57 GMT",
"version": "v4"
}
] | 2018-07-18 | [
[
"Baydin",
"Atilim Gunes",
""
],
[
"Pearlmutter",
"Barak A.",
""
],
[
"Radul",
"Alexey Andreyevich",
""
],
[
"Siskind",
"Jeffrey Mark",
""
]
] | Derivatives, mostly in the form of gradients and Hessians, are ubiquitous in machine learning. Automatic differentiation (AD), also called algorithmic differentiation or simply "autodiff", is a family of techniques similar to but more general than backpropagation for efficiently and accurately evaluating derivatives of... |
2406.02771 | Kathrin Donandt | Kathrin Donandt, Karim B\"ottger, Dirk S\"offker | Improved context-sensitive transformer model for inland vessel
trajectory prediction | null | Proceedings of the 2023 IEEE 26th International Conference on
Intelligent Transportation Systems (ITSC), Bilbao, Spain, pp. 5903-5908 | 10.1109/ITSC57777.2023.10422417 | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Physics-related and model-based vessel trajectory prediction is highly
accurate but requires specific knowledge of the vessel under consideration
which is not always practical. Machine learning-based trajectory prediction
models do not require expert knowledge, but rely on the implicit knowledge
extracted from massiv... | [
{
"created": "Tue, 4 Jun 2024 20:39:14 GMT",
"version": "v1"
}
] | 2024-06-06 | [
[
"Donandt",
"Kathrin",
""
],
[
"Böttger",
"Karim",
""
],
[
"Söffker",
"Dirk",
""
]
] | Physics-related and model-based vessel trajectory prediction is highly accurate but requires specific knowledge of the vessel under consideration which is not always practical. Machine learning-based trajectory prediction models do not require expert knowledge, but rely on the implicit knowledge extracted from massive ... |
1811.06147 | Joel Mackenzie | Rodger Benham, Joel Mackenzie, Alistair Moffat, and J. Shane Culpepper | Boosting Search Performance Using Query Variations | Published in ACM TOIS, 2019 | null | 10.1145/3345001 | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Rank fusion is a powerful technique that allows multiple sources of
information to be combined into a single result set. However, to date fusion
has not been regarded as being cost-effective in cases where strict per-query
efficiency guarantees are required, such as in web search. In this work we
propose a novel solu... | [
{
"created": "Thu, 15 Nov 2018 02:43:06 GMT",
"version": "v1"
},
{
"created": "Tue, 10 Nov 2020 00:34:14 GMT",
"version": "v2"
}
] | 2020-11-11 | [
[
"Benham",
"Rodger",
""
],
[
"Mackenzie",
"Joel",
""
],
[
"Moffat",
"Alistair",
""
],
[
"Culpepper",
"J. Shane",
""
]
] | Rank fusion is a powerful technique that allows multiple sources of information to be combined into a single result set. However, to date fusion has not been regarded as being cost-effective in cases where strict per-query efficiency guarantees are required, such as in web search. In this work we propose a novel soluti... |
2408.05094 | Tingchen Fu | Tingchen Fu, Yupeng Hou, Julian McAuley, Rui Yan | Unlocking Decoding-time Controllability: Gradient-Free Multi-Objective
Alignment with Contrastive Prompts | null | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | The task of multi-objective alignment aims at balancing and controlling the
different alignment objectives (e.g., helpfulness, harmlessness and honesty) of
large language models to meet the personalized requirements of different users.
However, previous methods tend to train multiple models to deal with various
user ... | [
{
"created": "Fri, 9 Aug 2024 14:36:42 GMT",
"version": "v1"
}
] | 2024-08-12 | [
[
"Fu",
"Tingchen",
""
],
[
"Hou",
"Yupeng",
""
],
[
"McAuley",
"Julian",
""
],
[
"Yan",
"Rui",
""
]
] | The task of multi-objective alignment aims at balancing and controlling the different alignment objectives (e.g., helpfulness, harmlessness and honesty) of large language models to meet the personalized requirements of different users. However, previous methods tend to train multiple models to deal with various user pr... |
1710.08868 | Bence Zuti | Bence Zuti | Modern-day Universities and Regional Development | Conference Paper | ISBN 978-963-89779-2-2. 2014. pp. 221-228 | 10.5281/zenodo.227114 | null | cs.CY | http://creativecommons.org/licenses/by/4.0/ | Nowadays it is quite evident that knowledge-based society necessarily
involves the revaluation of human and intangible assets, as the advancement of
local economies significantly depend on the qualitative and quantitative
characteristics of human capital[Lundvall, 2004]. As we can instantaneously
link the universitie... | [
{
"created": "Thu, 19 Oct 2017 06:45:57 GMT",
"version": "v1"
}
] | 2017-10-27 | [
[
"Zuti",
"Bence",
""
]
] | Nowadays it is quite evident that knowledge-based society necessarily involves the revaluation of human and intangible assets, as the advancement of local economies significantly depend on the qualitative and quantitative characteristics of human capital[Lundvall, 2004]. As we can instantaneously link the universities ... |
2312.00845 | Jong Chul Ye | Hyeonho Jeong, Geon Yeong Park, Jong Chul Ye | VMC: Video Motion Customization using Temporal Attention Adaption for
Text-to-Video Diffusion Models | Project page: https://video-motion-customization.github.io | null | null | null | cs.CV cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | Text-to-video diffusion models have advanced video generation significantly.
However, customizing these models to generate videos with tailored motions
presents a substantial challenge. In specific, they encounter hurdles in (a)
accurately reproducing motion from a target video, and (b) creating diverse
visual variat... | [
{
"created": "Fri, 1 Dec 2023 06:50:11 GMT",
"version": "v1"
}
] | 2023-12-05 | [
[
"Jeong",
"Hyeonho",
""
],
[
"Park",
"Geon Yeong",
""
],
[
"Ye",
"Jong Chul",
""
]
] | Text-to-video diffusion models have advanced video generation significantly. However, customizing these models to generate videos with tailored motions presents a substantial challenge. In specific, they encounter hurdles in (a) accurately reproducing motion from a target video, and (b) creating diverse visual variatio... |
2404.15435 | S\"uleyman \"Ozdel | Enkelejda Kasneci, Hong Gao, Suleyman Ozdel, Virmarie Maquiling,
Enkeleda Thaqi, Carrie Lau, Yao Rong, Gjergji Kasneci, Efe Bozkir | Introduction to Eye Tracking: A Hands-On Tutorial for Students and
Practitioners | null | null | null | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Eye-tracking technology is widely used in various application areas such as
psychology, neuroscience, marketing, and human-computer interaction, as it is a
valuable tool for understanding how people process information and interact
with their environment. This tutorial provides a comprehensive introduction to
eye tra... | [
{
"created": "Tue, 23 Apr 2024 18:25:05 GMT",
"version": "v1"
}
] | 2024-04-25 | [
[
"Kasneci",
"Enkelejda",
""
],
[
"Gao",
"Hong",
""
],
[
"Ozdel",
"Suleyman",
""
],
[
"Maquiling",
"Virmarie",
""
],
[
"Thaqi",
"Enkeleda",
""
],
[
"Lau",
"Carrie",
""
],
[
"Rong",
"Yao",
""
],
[
"Kas... | Eye-tracking technology is widely used in various application areas such as psychology, neuroscience, marketing, and human-computer interaction, as it is a valuable tool for understanding how people process information and interact with their environment. This tutorial provides a comprehensive introduction to eye track... |
2009.07185 | Gregor Betz | Gregor Betz and Christian Voigt and Kyle Richardson | Critical Thinking for Language Models | null | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper takes a first step towards a critical thinking curriculum for
neural auto-regressive language models. We introduce a synthetic corpus of
deductively valid arguments, and generate artificial argumentative texts to
train and evaluate GPT-2. Significant transfer learning effects can be
observed: Training a mo... | [
{
"created": "Tue, 15 Sep 2020 15:49:19 GMT",
"version": "v1"
},
{
"created": "Thu, 17 Dec 2020 14:42:42 GMT",
"version": "v2"
}
] | 2020-12-18 | [
[
"Betz",
"Gregor",
""
],
[
"Voigt",
"Christian",
""
],
[
"Richardson",
"Kyle",
""
]
] | This paper takes a first step towards a critical thinking curriculum for neural auto-regressive language models. We introduce a synthetic corpus of deductively valid arguments, and generate artificial argumentative texts to train and evaluate GPT-2. Significant transfer learning effects can be observed: Training a mode... |
1712.09552 | Yogesh Simmhan | Yogesh Simmhan | Big Data and Fog Computing | To Appear as a contribution in Encyclopedia of Big Data Technologies,
Sherif Sakr and Albert Zomaya eds., Springer Nature, 2018 | Book chapter "Big Data and Fog Computing", 2018. In: Encyclopedia
of Big Data Technologies, Sakr S., Zomaya A. (eds), Springer, Cham | 10.1007/978-3-319-63962-8_41-1 | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Fog computing serves as a computing layer that sits between the edge devices
and the cloud in the network topology. They have more compute capacity than the
edge but much less so than cloud data centers. They typically have high uptime
and always-on Internet connectivity. Applications that make use of the fog can
avo... | [
{
"created": "Wed, 27 Dec 2017 11:27:30 GMT",
"version": "v1"
}
] | 2019-05-13 | [
[
"Simmhan",
"Yogesh",
""
]
] | Fog computing serves as a computing layer that sits between the edge devices and the cloud in the network topology. They have more compute capacity than the edge but much less so than cloud data centers. They typically have high uptime and always-on Internet connectivity. Applications that make use of the fog can avoid... |
1911.04708 | Shingo Fujimoto | Shingo Fujimoto, Yoshiki Higashikado, Takuma Takeuchi | ConnectionChain: Secure Interworking of Blockchains | 4 pages, 5 figures, posted for IEEE BCCA 2019 | null | 10.1109/IOTSMS48152.2019.8939267 | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Blockchain is a core technology to manage the value of cryptocurrencies, or
to record trails of important business trades. The Smart Contract on blockchain
is expected to improve security on blockchain system with automated operation,
but it cannot be the solution when the application service required to operate
tigh... | [
{
"created": "Tue, 12 Nov 2019 07:35:10 GMT",
"version": "v1"
}
] | 2020-01-07 | [
[
"Fujimoto",
"Shingo",
""
],
[
"Higashikado",
"Yoshiki",
""
],
[
"Takeuchi",
"Takuma",
""
]
] | Blockchain is a core technology to manage the value of cryptocurrencies, or to record trails of important business trades. The Smart Contract on blockchain is expected to improve security on blockchain system with automated operation, but it cannot be the solution when the application service required to operate tightl... |
2309.05885 | Oliver Bra\v{c}evac | Yuyan Bao, Guannan Wei, Oliver Bra\v{c}evac, and Tiark Rompf | Modeling Reachability Types with Logical Relations | null | null | null | null | cs.PL | http://creativecommons.org/licenses/by/4.0/ | Reachability types are a recent proposal to bring Rust-style reasoning about
memory properties to higher-level languages. While key type soundness results
for reachability types have been established using syntactic techniques in
prior work, stronger metatheoretic properties have so far been unexplored. This
paper pr... | [
{
"created": "Tue, 12 Sep 2023 00:13:53 GMT",
"version": "v1"
}
] | 2023-09-13 | [
[
"Bao",
"Yuyan",
""
],
[
"Wei",
"Guannan",
""
],
[
"Bračevac",
"Oliver",
""
],
[
"Rompf",
"Tiark",
""
]
] | Reachability types are a recent proposal to bring Rust-style reasoning about memory properties to higher-level languages. While key type soundness results for reachability types have been established using syntactic techniques in prior work, stronger metatheoretic properties have so far been unexplored. This paper pres... |
0809.3009 | Grenville Croll | Karin Hodnigg, Roland T. Mittermeir | Metrics-Based Spreadsheet Visualization: Support for Focused Maintenance | 16 Pages, 7 Colour Figures | Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2008 79-94
ISBN 978-905617-69-2 | null | null | cs.SE cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Legacy spreadsheets are both, an asset, and an enduring problem concerning
spreadsheets in business. To make spreadsheets stay alive and remain correct,
comprehension of a given spreadsheet is highly important. Visualization
techniques should ease the complex and mindblowing challenges of finding
structures in a huge... | [
{
"created": "Wed, 17 Sep 2008 20:58:29 GMT",
"version": "v1"
}
] | 2008-09-19 | [
[
"Hodnigg",
"Karin",
""
],
[
"Mittermeir",
"Roland T.",
""
]
] | Legacy spreadsheets are both, an asset, and an enduring problem concerning spreadsheets in business. To make spreadsheets stay alive and remain correct, comprehension of a given spreadsheet is highly important. Visualization techniques should ease the complex and mindblowing challenges of finding structures in a huge s... |
1301.6209 | Jung Hyun Bae | Jung Hyun Bae, Jungwon Lee, Inyup Kang | On the achievable region for interference networks with point-to-point
codes | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper studies evaluation of the capacity region for interference
networks with point-to-point (p2p) capacity-achieving codes. Such capacity
region has recently been characterized as union of several sub-regions each of
which has distinctive operational characteristics. Detailed evaluation of this
region, therefo... | [
{
"created": "Sat, 26 Jan 2013 04:29:54 GMT",
"version": "v1"
}
] | 2013-01-29 | [
[
"Bae",
"Jung Hyun",
""
],
[
"Lee",
"Jungwon",
""
],
[
"Kang",
"Inyup",
""
]
] | This paper studies evaluation of the capacity region for interference networks with point-to-point (p2p) capacity-achieving codes. Such capacity region has recently been characterized as union of several sub-regions each of which has distinctive operational characteristics. Detailed evaluation of this region, therefore... |
1905.07356 | Matthijs Westera | Matthijs Westera and Gemma Boleda | Don't Blame Distributional Semantics if it can't do Entailment | To appear in Proceedings of the 13th International Conference on
Computational Semantics (IWCS 2019), Gothenburg, Sweden | null | null | null | cs.CL cs.AI cs.IR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Distributional semantics has had enormous empirical success in Computational
Linguistics and Cognitive Science in modeling various semantic phenomena, such
as semantic similarity, and distributional models are widely used in
state-of-the-art Natural Language Processing systems. However, the theoretical
status of dist... | [
{
"created": "Fri, 17 May 2019 16:26:05 GMT",
"version": "v1"
}
] | 2019-05-20 | [
[
"Westera",
"Matthijs",
""
],
[
"Boleda",
"Gemma",
""
]
] | Distributional semantics has had enormous empirical success in Computational Linguistics and Cognitive Science in modeling various semantic phenomena, such as semantic similarity, and distributional models are widely used in state-of-the-art Natural Language Processing systems. However, the theoretical status of distri... |
1206.1418 | Dinh Que Tran | Thuy Van T. Duong, Dinh Que Tran and Cong Hung Tran | A weighted combination similarity measure for mobility patterns in
wireless networks | 15 pages, 2 figures; International Journal of Computer Networks &
Communications (IJCNC) http://airccse.org/journal/ijc2012.html | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The similarity between trajectory patterns in clustering has played an
important role in discovering movement behaviour of different groups of mobile
objects. Several approaches have been proposed to measure the similarity
between sequences in trajectory data. Most of these measures are based on
Euclidean space or on... | [
{
"created": "Thu, 7 Jun 2012 07:58:18 GMT",
"version": "v1"
}
] | 2012-06-08 | [
[
"Duong",
"Thuy Van T.",
""
],
[
"Tran",
"Dinh Que",
""
],
[
"Tran",
"Cong Hung",
""
]
] | The similarity between trajectory patterns in clustering has played an important role in discovering movement behaviour of different groups of mobile objects. Several approaches have been proposed to measure the similarity between sequences in trajectory data. Most of these measures are based on Euclidean space or on s... |
1707.01696 | Yanlong Huang | Yanlong Huang, Jo\~ao Silv\'erio, Leonel Rozo, and Darwin G. Caldwell | Generalized Task-Parameterized Skill Learning | 8 pages | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Programming by demonstration has recently gained much attention due to its
user-friendly and natural way to transfer human skills to robots. In order to
facilitate the learning of multiple demonstrations and meanwhile generalize to
new situations, a task-parameterized Gaussian mixture model (TP-GMM) has been
recently... | [
{
"created": "Thu, 6 Jul 2017 09:08:08 GMT",
"version": "v1"
},
{
"created": "Mon, 5 Mar 2018 15:52:51 GMT",
"version": "v2"
}
] | 2018-03-06 | [
[
"Huang",
"Yanlong",
""
],
[
"Silvério",
"João",
""
],
[
"Rozo",
"Leonel",
""
],
[
"Caldwell",
"Darwin G.",
""
]
] | Programming by demonstration has recently gained much attention due to its user-friendly and natural way to transfer human skills to robots. In order to facilitate the learning of multiple demonstrations and meanwhile generalize to new situations, a task-parameterized Gaussian mixture model (TP-GMM) has been recently d... |
2110.14340 | Kazuaki Matsumura | Kazuaki Matsumura, Simon Garcia De Gonzalo, Antonio J. Pe\~na | JACC: An OpenACC Runtime Framework with Kernel-Level and Multi-GPU
Parallelization | Extended version of a paper to appear in: Proceedings of the 28th
IEEE International Conference on High Performance Computing, Data, and
Analytics (HiPC), December 17-18, 2021 | null | 10.1109/HiPC53243.2021.00032 | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The rapid development in computing technology has paved the way for
directive-based programming models towards a principal role in maintaining
software portability of performance-critical applications. Efforts on such
models involve a least engineering cost for enabling computational acceleration
on multiple architec... | [
{
"created": "Wed, 27 Oct 2021 10:43:48 GMT",
"version": "v1"
},
{
"created": "Fri, 17 Dec 2021 14:05:57 GMT",
"version": "v2"
},
{
"created": "Wed, 27 Apr 2022 12:43:52 GMT",
"version": "v3"
}
] | 2022-04-28 | [
[
"Matsumura",
"Kazuaki",
""
],
[
"De Gonzalo",
"Simon Garcia",
""
],
[
"Peña",
"Antonio J.",
""
]
] | The rapid development in computing technology has paved the way for directive-based programming models towards a principal role in maintaining software portability of performance-critical applications. Efforts on such models involve a least engineering cost for enabling computational acceleration on multiple architectu... |
0712.0271 | Enrico Magli | M. Grangetto, E. Magli, G. Olmo | Distributed Arithmetic Coding for the Asymmetric Slepian-Wolf problem | submitted to IEEE Transactions on Signal processing, Nov. 2007.
Revised version accepted with minor revisions | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Distributed source coding schemes are typically based on the use of channels
codes as source codes. In this paper we propose a new paradigm, termed
"distributed arithmetic coding", which exploits the fact that arithmetic codes
are good source as well as channel codes. In particular, we propose a
distributed binary ar... | [
{
"created": "Mon, 3 Dec 2007 12:27:00 GMT",
"version": "v1"
},
{
"created": "Tue, 11 Nov 2008 09:29:16 GMT",
"version": "v2"
}
] | 2008-11-11 | [
[
"Grangetto",
"M.",
""
],
[
"Magli",
"E.",
""
],
[
"Olmo",
"G.",
""
]
] | Distributed source coding schemes are typically based on the use of channels codes as source codes. In this paper we propose a new paradigm, termed "distributed arithmetic coding", which exploits the fact that arithmetic codes are good source as well as channel codes. In particular, we propose a distributed binary arit... |
1601.06744 | Yongge Wang | Yongge Wang | Octonion Algebra and Noise-Free Fully Homomorphic Encryption (FHE)
Schemes | this paper has some issues to be addressed | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Brakerski showed that linearly decryptable fully homomorphic encryption (FHE)
schemes cannot be secure in the chosen plaintext attack (CPA) model. In this
paper, we show that linearly decryptable FHE schemes cannot be secure even in
the ciphertext only security model. Then we consider the maximum security that
a line... | [
{
"created": "Mon, 25 Jan 2016 19:55:57 GMT",
"version": "v1"
},
{
"created": "Tue, 22 Mar 2016 08:46:42 GMT",
"version": "v2"
},
{
"created": "Fri, 24 Feb 2017 03:34:31 GMT",
"version": "v3"
},
{
"created": "Thu, 6 Jun 2019 10:11:54 GMT",
"version": "v4"
}
] | 2019-06-07 | [
[
"Wang",
"Yongge",
""
]
] | Brakerski showed that linearly decryptable fully homomorphic encryption (FHE) schemes cannot be secure in the chosen plaintext attack (CPA) model. In this paper, we show that linearly decryptable FHE schemes cannot be secure even in the ciphertext only security model. Then we consider the maximum security that a linear... |
1210.6447 | Om Prakash | S. Yashvir, Om Prakash | Disk Scheduling: Selection of Algorithm | 9 pages; http://www.ijascse.in/publications-2012--2 | null | null | null | cs.OS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The objective of this paper is to take some aspects of disk scheduling and
scheduling algorithms. The disk scheduling is discussed with a sneak peak in
general and selection of algorithm in particular.
| [
{
"created": "Wed, 24 Oct 2012 07:56:48 GMT",
"version": "v1"
}
] | 2012-10-25 | [
[
"Yashvir",
"S.",
""
],
[
"Prakash",
"Om",
""
]
] | The objective of this paper is to take some aspects of disk scheduling and scheduling algorithms. The disk scheduling is discussed with a sneak peak in general and selection of algorithm in particular. |
1106.0436 | Venkatesan Guruswami | Venkatesan Guruswami | Linear-algebraic list decoding of folded Reed-Solomon codes | 16 pages. Extended abstract in Proc. of IEEE Conference on
Computational Complexity (CCC), 2011 | null | 10.1109/CCC.2011.22 | null | cs.IT cs.DS math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Folded Reed-Solomon codes are an explicit family of codes that achieve the
optimal trade-off between rate and error-correction capability: specifically,
for any $\eps > 0$, the author and Rudra (2006,08) presented an $n^{O(1/\eps)}$
time algorithm to list decode appropriate folded RS codes of rate $R$ from a
fraction... | [
{
"created": "Thu, 2 Jun 2011 14:18:27 GMT",
"version": "v1"
}
] | 2016-11-17 | [
[
"Guruswami",
"Venkatesan",
""
]
] | Folded Reed-Solomon codes are an explicit family of codes that achieve the optimal trade-off between rate and error-correction capability: specifically, for any $\eps > 0$, the author and Rudra (2006,08) presented an $n^{O(1/\eps)}$ time algorithm to list decode appropriate folded RS codes of rate $R$ from a fraction $... |
2102.05218 | Qian Yang | Qian Yang, Jianyi Zhang, Weituo Hao, Gregory Spell, Lawrence Carin | FLOP: Federated Learning on Medical Datasets using Partial Networks | To appear in KDD 2021 | null | 10.1145/3447548.3467185 | null | cs.LG cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The outbreak of COVID-19 Disease due to the novel coronavirus has caused a
shortage of medical resources. To aid and accelerate the diagnosis process,
automatic diagnosis of COVID-19 via deep learning models has recently been
explored by researchers across the world. While different data-driven deep
learning models h... | [
{
"created": "Wed, 10 Feb 2021 01:56:58 GMT",
"version": "v1"
},
{
"created": "Wed, 23 Jun 2021 01:41:15 GMT",
"version": "v2"
}
] | 2021-06-24 | [
[
"Yang",
"Qian",
""
],
[
"Zhang",
"Jianyi",
""
],
[
"Hao",
"Weituo",
""
],
[
"Spell",
"Gregory",
""
],
[
"Carin",
"Lawrence",
""
]
] | The outbreak of COVID-19 Disease due to the novel coronavirus has caused a shortage of medical resources. To aid and accelerate the diagnosis process, automatic diagnosis of COVID-19 via deep learning models has recently been explored by researchers across the world. While different data-driven deep learning models hav... |
2402.00724 | Jan Valo\v{s}ek | Jan Valosek, Theo Mathieu, Raphaelle Schlienger, Olivia S. Kowalczyk,
Julien Cohen-Adad | Automatic Segmentation of the Spinal Cord Nerve Rootlets | null | Imaging Neuroscience, 2 (2024) 1-14 | 10.1162/imag_a_00218 | null | cs.CV cs.LG | http://creativecommons.org/licenses/by/4.0/ | Precise identification of spinal nerve rootlets is relevant to delineate
spinal levels for the study of functional activity in the spinal cord. The goal
of this study was to develop an automatic method for the semantic segmentation
of spinal nerve rootlets from T2-weighted magnetic resonance imaging (MRI)
scans. Imag... | [
{
"created": "Thu, 1 Feb 2024 16:14:54 GMT",
"version": "v1"
},
{
"created": "Wed, 1 May 2024 05:46:56 GMT",
"version": "v2"
}
] | 2024-07-26 | [
[
"Valosek",
"Jan",
""
],
[
"Mathieu",
"Theo",
""
],
[
"Schlienger",
"Raphaelle",
""
],
[
"Kowalczyk",
"Olivia S.",
""
],
[
"Cohen-Adad",
"Julien",
""
]
] | Precise identification of spinal nerve rootlets is relevant to delineate spinal levels for the study of functional activity in the spinal cord. The goal of this study was to develop an automatic method for the semantic segmentation of spinal nerve rootlets from T2-weighted magnetic resonance imaging (MRI) scans. Images... |
1310.7962 | Pece Mitrevski | Pece Mitrevski, Olivera Kostoska and Marjan Angeleski | E-Business Implications for Productivity and Competitiveness | null | Annals of the "Constantin Brancusi" University of Targu - Jiu,
Economy Series, Issue 1/2009, ISSN 1844-7007, pp. 253-262 | null | null | cs.OH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Information and Communication Technology (ICT) affects to a great extent the
output and productivity growth. Evidence suggests that investment growth in ICT
has rapidly accelerated the TFP (total factor productivity) growth within the
European Union. Such progress is particularly essential for the sectors which
thems... | [
{
"created": "Sat, 14 Sep 2013 18:01:29 GMT",
"version": "v1"
}
] | 2013-10-31 | [
[
"Mitrevski",
"Pece",
""
],
[
"Kostoska",
"Olivera",
""
],
[
"Angeleski",
"Marjan",
""
]
] | Information and Communication Technology (ICT) affects to a great extent the output and productivity growth. Evidence suggests that investment growth in ICT has rapidly accelerated the TFP (total factor productivity) growth within the European Union. Such progress is particularly essential for the sectors which themsel... |
2207.10290 | Xiaoliang Liu | Xiaoliang Liu, Furao Shen, Jian Zhao, Changhai Nie | AugRmixAT: A Data Processing and Training Method for Improving Multiple
Robustness and Generalization Performance | Accepted by ICME2022 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep neural networks are powerful, but they also have shortcomings such as
their sensitivity to adversarial examples, noise, blur, occlusion, etc.
Moreover, ensuring the reliability and robustness of deep neural network models
is crucial for their application in safety-critical areas. Much previous work
has been prop... | [
{
"created": "Thu, 21 Jul 2022 04:02:24 GMT",
"version": "v1"
}
] | 2022-07-22 | [
[
"Liu",
"Xiaoliang",
""
],
[
"Shen",
"Furao",
""
],
[
"Zhao",
"Jian",
""
],
[
"Nie",
"Changhai",
""
]
] | Deep neural networks are powerful, but they also have shortcomings such as their sensitivity to adversarial examples, noise, blur, occlusion, etc. Moreover, ensuring the reliability and robustness of deep neural network models is crucial for their application in safety-critical areas. Much previous work has been propos... |
2107.12637 | Rajashekhar V S | Rajashekhar Vachiravelu Saminathan | Topology Design and Position Analysis of a Reconfigurable Modular
Hybrid-Parallel Manipulator | 11 pages, 14 figures, Accepted for IDETC/CIE 2019 the ASME 2019
International Design Engineering Technical Conferences and Computers and
Information in Engineering Conference | null | null | null | cs.RO | http://creativecommons.org/licenses/by-nc-nd/4.0/ | In the modern days, manipulators are found in the automated assembly lines of
industries that produce products in masses. These manipulators can be used only
in one configuration, that is either serial or parallel. In this paper, a new
module which has two degrees of freedom is introduced. By connecting the two
and t... | [
{
"created": "Tue, 27 Jul 2021 07:19:14 GMT",
"version": "v1"
}
] | 2021-07-28 | [
[
"Saminathan",
"Rajashekhar Vachiravelu",
""
]
] | In the modern days, manipulators are found in the automated assembly lines of industries that produce products in masses. These manipulators can be used only in one configuration, that is either serial or parallel. In this paper, a new module which has two degrees of freedom is introduced. By connecting the two and thr... |
1804.08813 | Wenpeng Yin | Wenpeng Yin, Hinrich Sch\"utze and Dan Roth | End-Task Oriented Textual Entailment via Deep Explorations of
Inter-Sentence Interactions | ACL'2018 camera-ready; 6 pages, 3 figures | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work deals with SciTail, a natural entailment challenge derived from a
multi-choice question answering problem. The premises and hypotheses in SciTail
were generated with no awareness of each other, and did not specifically aim at
the entailment task. This makes it more challenging than other entailment data
set... | [
{
"created": "Tue, 24 Apr 2018 02:29:14 GMT",
"version": "v1"
},
{
"created": "Sat, 12 May 2018 03:29:42 GMT",
"version": "v2"
},
{
"created": "Tue, 15 May 2018 03:53:53 GMT",
"version": "v3"
}
] | 2018-05-16 | [
[
"Yin",
"Wenpeng",
""
],
[
"Schütze",
"Hinrich",
""
],
[
"Roth",
"Dan",
""
]
] | This work deals with SciTail, a natural entailment challenge derived from a multi-choice question answering problem. The premises and hypotheses in SciTail were generated with no awareness of each other, and did not specifically aim at the entailment task. This makes it more challenging than other entailment data sets ... |
2106.04715 | John Mern | John Mern, Mykel J. Kochenderfer | Measurable Monte Carlo Search Error Bounds | 9 pages, submitted to ALT 2022 | null | null | null | cs.AI cs.NA math.NA | http://creativecommons.org/licenses/by/4.0/ | Monte Carlo planners can often return sub-optimal actions, even if they are
guaranteed to converge in the limit of infinite samples. Known asymptotic
regret bounds do not provide any way to measure confidence of a recommended
action at the conclusion of search. In this work, we prove bounds on the
sub-optimality of M... | [
{
"created": "Tue, 8 Jun 2021 22:20:14 GMT",
"version": "v1"
},
{
"created": "Tue, 2 Nov 2021 23:44:05 GMT",
"version": "v2"
}
] | 2021-11-04 | [
[
"Mern",
"John",
""
],
[
"Kochenderfer",
"Mykel J.",
""
]
] | Monte Carlo planners can often return sub-optimal actions, even if they are guaranteed to converge in the limit of infinite samples. Known asymptotic regret bounds do not provide any way to measure confidence of a recommended action at the conclusion of search. In this work, we prove bounds on the sub-optimality of Mon... |
1905.03179 | Rahul Shome | Rahul Shome and Kostas E. Bekris | Anytime Multi-arm Task and Motion Planning for Pick-and-Place of
Individual Objects via Handoffs | null | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Automation applications are pushing the deployment of many high DoF
manipulators in warehouse and manufacturing environments. This has motivated
many efforts on optimizing manipulation tasks involving a single arm.
Coordinating multiple arms for manipulation, however, introduces additional
computational challenges ar... | [
{
"created": "Wed, 8 May 2019 16:07:56 GMT",
"version": "v1"
}
] | 2019-05-09 | [
[
"Shome",
"Rahul",
""
],
[
"Bekris",
"Kostas E.",
""
]
] | Automation applications are pushing the deployment of many high DoF manipulators in warehouse and manufacturing environments. This has motivated many efforts on optimizing manipulation tasks involving a single arm. Coordinating multiple arms for manipulation, however, introduces additional computational challenges aris... |
2105.14550 | Wei Sun | Wei Sun and Xiongkuo Min and Danyang Tu and Guangtao Zhai and Siwei Ma | Blind Quality Assessment for in-the-Wild Images via Hierarchical Feature
Fusion and Iterative Mixed Database Training | Accepted by IEEE Journal of Selected Topics in Signal Processing | null | 10.1109/JSTSP.2023.3270621 | null | cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Image quality assessment (IQA) is very important for both end-users and
service providers since a high-quality image can significantly improve the
user's quality of experience (QoE) and also benefit lots of computer vision
algorithms. Most existing blind image quality assessment (BIQA) models were
developed for synth... | [
{
"created": "Sun, 30 May 2021 14:04:10 GMT",
"version": "v1"
},
{
"created": "Mon, 22 Nov 2021 04:54:44 GMT",
"version": "v2"
},
{
"created": "Thu, 27 Apr 2023 07:18:31 GMT",
"version": "v3"
}
] | 2023-04-28 | [
[
"Sun",
"Wei",
""
],
[
"Min",
"Xiongkuo",
""
],
[
"Tu",
"Danyang",
""
],
[
"Zhai",
"Guangtao",
""
],
[
"Ma",
"Siwei",
""
]
] | Image quality assessment (IQA) is very important for both end-users and service providers since a high-quality image can significantly improve the user's quality of experience (QoE) and also benefit lots of computer vision algorithms. Most existing blind image quality assessment (BIQA) models were developed for synthet... |
2301.05873 | Paramita Koley | Paramita Koley, Aurghya Maiti, Niloy Ganguly and Sourangshu
Bhattacharya | Opponent-aware Role-based Learning in Team Competitive Markov Games | 9 pages, 6 figures | null | null | null | cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Team competition in multi-agent Markov games is an increasingly important
setting for multi-agent reinforcement learning, due to its general
applicability in modeling many real-life situations. Multi-agent actor-critic
methods are the most suitable class of techniques for learning optimal policies
in the team competi... | [
{
"created": "Sat, 14 Jan 2023 09:50:48 GMT",
"version": "v1"
}
] | 2023-01-18 | [
[
"Koley",
"Paramita",
""
],
[
"Maiti",
"Aurghya",
""
],
[
"Ganguly",
"Niloy",
""
],
[
"Bhattacharya",
"Sourangshu",
""
]
] | Team competition in multi-agent Markov games is an increasingly important setting for multi-agent reinforcement learning, due to its general applicability in modeling many real-life situations. Multi-agent actor-critic methods are the most suitable class of techniques for learning optimal policies in the team competiti... |
2110.09365 | Sourav Mondal | Sourav Mondal and Marco Ruffini | Optical Front/Mid-haul with Open Access-Edge Server Deployment Framework
for Sliced O-RAN | This is the final version to be published in IEEE Transactions on
Network and Service Management (TNSM). Copyright @ IEEE | null | 10.1109/TNSM.2022.3173915 | null | cs.NI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | The fifth-generation of mobile radio technologies is expected to be agile,
flexible, and scalable while provisioning ultra-reliable and low-latency
communication (uRLLC), enhanced mobile broadband (eMBB), and massive machine
type communication (mMTC) applications. An efficient way of implementing these
is by adopting... | [
{
"created": "Mon, 18 Oct 2021 14:49:05 GMT",
"version": "v1"
},
{
"created": "Tue, 19 Oct 2021 03:05:35 GMT",
"version": "v2"
},
{
"created": "Sun, 23 Jan 2022 06:49:37 GMT",
"version": "v3"
},
{
"created": "Sun, 8 May 2022 09:31:31 GMT",
"version": "v4"
}
] | 2022-05-10 | [
[
"Mondal",
"Sourav",
""
],
[
"Ruffini",
"Marco",
""
]
] | The fifth-generation of mobile radio technologies is expected to be agile, flexible, and scalable while provisioning ultra-reliable and low-latency communication (uRLLC), enhanced mobile broadband (eMBB), and massive machine type communication (mMTC) applications. An efficient way of implementing these is by adopting c... |
1903.07024 | Debajyoti Mondal | Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed
Mehrabi, Debajyoti Mondal, and Michiel Smid | Computing Maximum Independent Set on Outerstring Graphs and Their
Relatives | A preliminary version of this paper appeared in the 16th
International Symposium on Algorithms and Data Structures (WADS 2019) | null | null | null | cs.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A graph $G$ with $n$ vertices is called an outerstring graph if it has an
intersection representation of a set of $n$ curves inside a disk such that one
endpoint of every curve is attached to the boundary of the disk. Given an
outerstring graph representation, the Maximum Independent Set (MIS) problem of
the underlyi... | [
{
"created": "Sun, 17 Mar 2019 04:06:26 GMT",
"version": "v1"
},
{
"created": "Sun, 1 Aug 2021 19:42:19 GMT",
"version": "v2"
}
] | 2021-08-03 | [
[
"Bose",
"Prosenjit",
""
],
[
"Carmi",
"Paz",
""
],
[
"Keil",
"J. Mark",
""
],
[
"Maheshwari",
"Anil",
""
],
[
"Mehrabi",
"Saeed",
""
],
[
"Mondal",
"Debajyoti",
""
],
[
"Smid",
"Michiel",
""
]
] | A graph $G$ with $n$ vertices is called an outerstring graph if it has an intersection representation of a set of $n$ curves inside a disk such that one endpoint of every curve is attached to the boundary of the disk. Given an outerstring graph representation, the Maximum Independent Set (MIS) problem of the underlying... |
2010.01017 | Qinbin Li | Qinbin Li, Bingsheng He, Dawn Song | Practical One-Shot Federated Learning for Cross-Silo Setting | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Federated learning enables multiple parties to collaboratively learn a model
without exchanging their data. While most existing federated learning
algorithms need many rounds to converge, one-shot federated learning (i.e.,
federated learning with a single communication round) is a promising approach
to make federated... | [
{
"created": "Fri, 2 Oct 2020 14:09:10 GMT",
"version": "v1"
},
{
"created": "Thu, 20 May 2021 13:25:47 GMT",
"version": "v2"
}
] | 2021-05-21 | [
[
"Li",
"Qinbin",
""
],
[
"He",
"Bingsheng",
""
],
[
"Song",
"Dawn",
""
]
] | Federated learning enables multiple parties to collaboratively learn a model without exchanging their data. While most existing federated learning algorithms need many rounds to converge, one-shot federated learning (i.e., federated learning with a single communication round) is a promising approach to make federated l... |
2001.02390 | Corey Lammie | Corey Lammie, Wei Xiang, Mostafa Rahimi Azghadi | Training Progressively Binarizing Deep Networks Using FPGAs | Accepted at 2020 IEEE International Symposium on Circuits and Systems
(ISCAS) | 2020 IEEE International Symposium on Circuits and Systems (ISCAS) | 10.1109/ISCAS45731.2020.9181099 | null | cs.CV cs.LG eess.IV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | While hardware implementations of inference routines for Binarized Neural
Networks (BNNs) are plentiful, current realizations of efficient BNN hardware
training accelerators, suitable for Internet of Things (IoT) edge devices,
leave much to be desired. Conventional BNN hardware training accelerators
perform forward a... | [
{
"created": "Wed, 8 Jan 2020 06:01:13 GMT",
"version": "v1"
}
] | 2021-02-18 | [
[
"Lammie",
"Corey",
""
],
[
"Xiang",
"Wei",
""
],
[
"Azghadi",
"Mostafa Rahimi",
""
]
] | While hardware implementations of inference routines for Binarized Neural Networks (BNNs) are plentiful, current realizations of efficient BNN hardware training accelerators, suitable for Internet of Things (IoT) edge devices, leave much to be desired. Conventional BNN hardware training accelerators perform forward and... |
2003.04947 | Kristen Morse | Kristen Morse, Neha Das, Yixin Lin, Austin S. Wang, Akshara Rai,
Franziska Meier | Learning State-Dependent Losses for Inverse Dynamics Learning | 9 pages, 8 figures, accepted to IROS 2020, * Kristen Morse and Neha
Das had equal contribution | null | 10.1109/IROS45743.2020.9341701 | null | cs.RO cs.LG | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Being able to quickly adapt to changes in dynamics is paramount in
model-based control for object manipulation tasks. In order to influence fast
adaptation of the inverse dynamics model's parameters, data efficiency is
crucial. Given observed data, a key element to how an optimizer updates model
parameters is the los... | [
{
"created": "Tue, 10 Mar 2020 19:54:54 GMT",
"version": "v1"
},
{
"created": "Thu, 12 Mar 2020 16:16:12 GMT",
"version": "v2"
},
{
"created": "Fri, 14 Aug 2020 21:15:56 GMT",
"version": "v3"
}
] | 2022-11-28 | [
[
"Morse",
"Kristen",
""
],
[
"Das",
"Neha",
""
],
[
"Lin",
"Yixin",
""
],
[
"Wang",
"Austin S.",
""
],
[
"Rai",
"Akshara",
""
],
[
"Meier",
"Franziska",
""
]
] | Being able to quickly adapt to changes in dynamics is paramount in model-based control for object manipulation tasks. In order to influence fast adaptation of the inverse dynamics model's parameters, data efficiency is crucial. Given observed data, a key element to how an optimizer updates model parameters is the loss ... |
2108.09069 | Shunchuan Yang | Kai Zhu, Jinhui Wang, Shunchuan Yang | An Adaptive Interpolation Scheme for Wideband Frequency Sweep in
Electromagnetic Simulations | null | null | 10.1109/LAWP.2021.3135958 | null | cs.CE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | An adaptive interpolation scheme is proposed to accurately calculate the
wideband responses in electromagnetic simulations. In the proposed scheme, the
sampling points are first carefully divided into several groups based on their
responses to avoid the Runge phenomenon and the error fluctuations, and then
different ... | [
{
"created": "Fri, 20 Aug 2021 08:51:40 GMT",
"version": "v1"
}
] | 2022-03-14 | [
[
"Zhu",
"Kai",
""
],
[
"Wang",
"Jinhui",
""
],
[
"Yang",
"Shunchuan",
""
]
] | An adaptive interpolation scheme is proposed to accurately calculate the wideband responses in electromagnetic simulations. In the proposed scheme, the sampling points are first carefully divided into several groups based on their responses to avoid the Runge phenomenon and the error fluctuations, and then different in... |
2305.11813 | Philipp Czerner | Eszter Couillard and Philipp Czerner and Javier Esparza and Rupak
Majumdar | Making $\textsf{IP}=\textsf{PSPACE}$ Practical: Efficient Interactive
Protocols for BDD Algorithms | null | null | 10.1007/978-3-031-37709-9_21 | null | cs.LO cs.CC | http://creativecommons.org/licenses/by/4.0/ | We show that interactive protocols between a prover and a verifier, a
well-known tool of complexity theory, can be used in practice to certify the
correctness of automated reasoning tools.
Theoretically, interactive protocols exist for all $\textsf{PSPACE}$
problems. The verifier of a protocol checks the prover's a... | [
{
"created": "Fri, 19 May 2023 16:48:21 GMT",
"version": "v1"
},
{
"created": "Wed, 6 Sep 2023 13:37:35 GMT",
"version": "v2"
}
] | 2023-09-07 | [
[
"Couillard",
"Eszter",
""
],
[
"Czerner",
"Philipp",
""
],
[
"Esparza",
"Javier",
""
],
[
"Majumdar",
"Rupak",
""
]
] | We show that interactive protocols between a prover and a verifier, a well-known tool of complexity theory, can be used in practice to certify the correctness of automated reasoning tools. Theoretically, interactive protocols exist for all $\textsf{PSPACE}$ problems. The verifier of a protocol checks the prover's answe... |
2211.14613 | Gabriel Istrate | Gabriel Istrate | Some Remarks on Almost Periodic Sequences and Languages | Reconstructed source file of a paper originally published in 1995 in
a volume currently without an online version (and with limited availability).
Uploaded in order to ensure the online availability (and preservation) of the
paper. This version faithfully reproduces the original, except for the
addition of a no... | pages 191-195, in "Mathematical linguistics and related topics.
Papers in honor of Solomon Marcus on his 70th birthday". Edited by Gheorghe
P\u{a}un. Editura Academiei Rom\^ane, Bucharest, 1995. xii+364 pp. ISBN:
973-27-0486-1 | null | null | cs.FL | http://creativecommons.org/licenses/by/4.0/ | Almost periodicity has been considered in Formal Language Theory in
connection with some topics in Symbolic Dynamics. In (P\u{a}un and Marcus,
Bulletin of EATCS 53 (1994)) some problems concerning this property are raised.
For instance it is asked whether there exists some almost periodic word
$\alpha$ such that $Sub... | [
{
"created": "Sat, 26 Nov 2022 16:45:36 GMT",
"version": "v1"
}
] | 2022-11-29 | [
[
"Istrate",
"Gabriel",
""
]
] | Almost periodicity has been considered in Formal Language Theory in connection with some topics in Symbolic Dynamics. In (P\u{a}un and Marcus, Bulletin of EATCS 53 (1994)) some problems concerning this property are raised. For instance it is asked whether there exists some almost periodic word $\alpha$ such that $Sub(\... |
2312.03030 | Xiaosen Wang | Xiaosen Wang, Kunyu Wang | Generating Visually Realistic Adversarial Patch | 14 pages | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep neural networks (DNNs) are vulnerable to various types of adversarial
examples, bringing huge threats to security-critical applications. Among these,
adversarial patches have drawn increasing attention due to their good
applicability to fool DNNs in the physical world. However, existing works often
generate patc... | [
{
"created": "Tue, 5 Dec 2023 11:07:39 GMT",
"version": "v1"
}
] | 2023-12-07 | [
[
"Wang",
"Xiaosen",
""
],
[
"Wang",
"Kunyu",
""
]
] | Deep neural networks (DNNs) are vulnerable to various types of adversarial examples, bringing huge threats to security-critical applications. Among these, adversarial patches have drawn increasing attention due to their good applicability to fool DNNs in the physical world. However, existing works often generate patche... |
2011.11314 | Gerald Baier | Gerald Baier and Antonin Deschemps and Michael Schmitt and Naoto
Yokoya | Synthesizing Optical and SAR Imagery From Land Cover Maps and Auxiliary
Raster Data | null | null | 10.1109/TGRS.2021.3068532 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We synthesize both optical RGB and synthetic aperture radar (SAR) remote
sensing images from land cover maps and auxiliary raster data using generative
adversarial networks (GANs). In remote sensing, many types of data, such as
digital elevation models (DEMs) or precipitation maps, are often not reflected
in land cov... | [
{
"created": "Mon, 23 Nov 2020 10:28:10 GMT",
"version": "v1"
},
{
"created": "Tue, 25 May 2021 13:25:48 GMT",
"version": "v2"
}
] | 2021-05-26 | [
[
"Baier",
"Gerald",
""
],
[
"Deschemps",
"Antonin",
""
],
[
"Schmitt",
"Michael",
""
],
[
"Yokoya",
"Naoto",
""
]
] | We synthesize both optical RGB and synthetic aperture radar (SAR) remote sensing images from land cover maps and auxiliary raster data using generative adversarial networks (GANs). In remote sensing, many types of data, such as digital elevation models (DEMs) or precipitation maps, are often not reflected in land cover... |
1707.03374 | Abhishek Gupta | YuXuan Liu, Abhishek Gupta, Pieter Abbeel, Sergey Levine | Imitation from Observation: Learning to Imitate Behaviors from Raw Video
via Context Translation | Accepted at ICRA 2018, Brisbane. YuXuan Liu and Abhishek Gupta had
equal contribution | null | null | null | cs.LG cs.AI cs.CV cs.NE cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Imitation learning is an effective approach for autonomous systems to acquire
control policies when an explicit reward function is unavailable, using
supervision provided as demonstrations from an expert, typically a human
operator. However, standard imitation learning methods assume that the agent
receives examples ... | [
{
"created": "Tue, 11 Jul 2017 17:23:53 GMT",
"version": "v1"
},
{
"created": "Mon, 18 Jun 2018 21:00:13 GMT",
"version": "v2"
}
] | 2018-06-20 | [
[
"Liu",
"YuXuan",
""
],
[
"Gupta",
"Abhishek",
""
],
[
"Abbeel",
"Pieter",
""
],
[
"Levine",
"Sergey",
""
]
] | Imitation learning is an effective approach for autonomous systems to acquire control policies when an explicit reward function is unavailable, using supervision provided as demonstrations from an expert, typically a human operator. However, standard imitation learning methods assume that the agent receives examples of... |
1805.11724 | Michael Kampffmeyer | Michael Kampffmeyer, Yinbo Chen, Xiaodan Liang, Hao Wang, Yujia Zhang
and Eric P. Xing | Rethinking Knowledge Graph Propagation for Zero-Shot Learning | The first two authors contributed equally. Code at
https://github.com/cyvius96/adgpm. To appear in CVPR 2019 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Graph convolutional neural networks have recently shown great potential for
the task of zero-shot learning. These models are highly sample efficient as
related concepts in the graph structure share statistical strength allowing
generalization to new classes when faced with a lack of data. However,
multi-layer archite... | [
{
"created": "Tue, 29 May 2018 21:55:46 GMT",
"version": "v1"
},
{
"created": "Thu, 31 May 2018 20:14:38 GMT",
"version": "v2"
},
{
"created": "Wed, 27 Mar 2019 17:26:38 GMT",
"version": "v3"
}
] | 2019-03-28 | [
[
"Kampffmeyer",
"Michael",
""
],
[
"Chen",
"Yinbo",
""
],
[
"Liang",
"Xiaodan",
""
],
[
"Wang",
"Hao",
""
],
[
"Zhang",
"Yujia",
""
],
[
"Xing",
"Eric P.",
""
]
] | Graph convolutional neural networks have recently shown great potential for the task of zero-shot learning. These models are highly sample efficient as related concepts in the graph structure share statistical strength allowing generalization to new classes when faced with a lack of data. However, multi-layer architect... |
1303.6573 | Dr. Nadeem Javaid | A. Ahmad, K. Latif, N. Javaid, Z. A. Khan, U. Qasim | Density Controlled Divide-and-Rule Scheme for Energy Efficient Routing
in Wireless Sensor Networks | 26th IEEE Canadian Conference on Electrical and Computer Engineering
(CCECE2013), Regina, Saskatchewan, Canada, 2013 | null | 10.1109/CCECE.2013.6567738 | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Cluster based routing technique is most popular routing technique in Wireless
Sensor Networks (WSNs). Due to varying need of WSN applications efficient
energy utilization in routing protocols is still a potential area of research.
In this research work we introduced a new energy efficient cluster based
routing techni... | [
{
"created": "Tue, 26 Mar 2013 17:50:52 GMT",
"version": "v1"
}
] | 2016-11-17 | [
[
"Ahmad",
"A.",
""
],
[
"Latif",
"K.",
""
],
[
"Javaid",
"N.",
""
],
[
"Khan",
"Z. A.",
""
],
[
"Qasim",
"U.",
""
]
] | Cluster based routing technique is most popular routing technique in Wireless Sensor Networks (WSNs). Due to varying need of WSN applications efficient energy utilization in routing protocols is still a potential area of research. In this research work we introduced a new energy efficient cluster based routing techniqu... |
2104.14644 | Safa Alver | Safa Alver, Doina Precup | What is Going on Inside Recurrent Meta Reinforcement Learning Agents? | Accepted to the Never-Ending Reinforcement Learning Workshop at ICLR
2021 | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | Recurrent meta reinforcement learning (meta-RL) agents are agents that employ
a recurrent neural network (RNN) for the purpose of "learning a learning
algorithm". After being trained on a pre-specified task distribution, the
learned weights of the agent's RNN are said to implement an efficient learning
algorithm thro... | [
{
"created": "Thu, 29 Apr 2021 20:34:39 GMT",
"version": "v1"
}
] | 2021-05-03 | [
[
"Alver",
"Safa",
""
],
[
"Precup",
"Doina",
""
]
] | Recurrent meta reinforcement learning (meta-RL) agents are agents that employ a recurrent neural network (RNN) for the purpose of "learning a learning algorithm". After being trained on a pre-specified task distribution, the learned weights of the agent's RNN are said to implement an efficient learning algorithm throug... |
cs/0312042 | Sergio Greco | Sergio Flesca, Sergio Greco | Declarative Semantics for Active Rules | 27 pages | Theory and Practice of Logic Programming, 1(1): 43-69, 2001 | null | null | cs.DB | null | In this paper we analyze declarative deterministic and non-deterministic
semantics for active rules. In particular we consider several (partial) stable
model semantics, previously defined for deductive rules, such as well-founded,
max deterministic, unique total stable model, total stable model, and maximal
stable mo... | [
{
"created": "Thu, 18 Dec 2003 17:43:43 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Flesca",
"Sergio",
""
],
[
"Greco",
"Sergio",
""
]
] | In this paper we analyze declarative deterministic and non-deterministic semantics for active rules. In particular we consider several (partial) stable model semantics, previously defined for deductive rules, such as well-founded, max deterministic, unique total stable model, total stable model, and maximal stable mode... |
2004.02380 | Philippe Morere | Philippe Morere and Fabio Ramos | Intrinsic Exploration as Multi-Objective RL | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Intrinsic motivation enables reinforcement learning (RL) agents to explore
when rewards are very sparse, where traditional exploration heuristics such as
Boltzmann or e-greedy would typically fail. However, intrinsic exploration is
generally handled in an ad-hoc manner, where exploration is not treated as a
core obje... | [
{
"created": "Mon, 6 Apr 2020 02:37:29 GMT",
"version": "v1"
}
] | 2020-04-07 | [
[
"Morere",
"Philippe",
""
],
[
"Ramos",
"Fabio",
""
]
] | Intrinsic motivation enables reinforcement learning (RL) agents to explore when rewards are very sparse, where traditional exploration heuristics such as Boltzmann or e-greedy would typically fail. However, intrinsic exploration is generally handled in an ad-hoc manner, where exploration is not treated as a core object... |
1001.4420 | Markus Jalsenius | Raphael Clifford, Markus Jalsenius, Ashley Montanaro and Benjamin Sach | The Complexity of Flood Filling Games | 20 pages, 10 figures | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the complexity of the popular one player combinatorial game known as
Flood-It. In this game the player is given an n by n board of tiles where each
tile is allocated one of c colours. The goal is to make the colours of all
tiles equal via the shortest possible sequence of flooding operations. In the
standard... | [
{
"created": "Mon, 25 Jan 2010 13:40:57 GMT",
"version": "v1"
},
{
"created": "Thu, 19 Aug 2010 16:57:48 GMT",
"version": "v2"
},
{
"created": "Thu, 9 Jun 2011 13:12:47 GMT",
"version": "v3"
}
] | 2011-06-10 | [
[
"Clifford",
"Raphael",
""
],
[
"Jalsenius",
"Markus",
""
],
[
"Montanaro",
"Ashley",
""
],
[
"Sach",
"Benjamin",
""
]
] | We study the complexity of the popular one player combinatorial game known as Flood-It. In this game the player is given an n by n board of tiles where each tile is allocated one of c colours. The goal is to make the colours of all tiles equal via the shortest possible sequence of flooding operations. In the standard v... |
1908.05739 | Chandra Sekhar Bhagavatula | Chandra Bhagavatula, Ronan Le Bras, Chaitanya Malaviya, Keisuke
Sakaguchi, Ari Holtzman, Hannah Rashkin, Doug Downey, Scott Wen-tau Yih and
Yejin Choi | Abductive Commonsense Reasoning | ICLR 2020 Camera Ready | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Abductive reasoning is inference to the most plausible explanation. For
example, if Jenny finds her house in a mess when she returns from work, and
remembers that she left a window open, she can hypothesize that a thief broke
into her house and caused the mess, as the most plausible explanation. While
abduction has l... | [
{
"created": "Thu, 15 Aug 2019 20:03:10 GMT",
"version": "v1"
},
{
"created": "Fri, 14 Feb 2020 02:52:27 GMT",
"version": "v2"
}
] | 2020-02-17 | [
[
"Bhagavatula",
"Chandra",
""
],
[
"Bras",
"Ronan Le",
""
],
[
"Malaviya",
"Chaitanya",
""
],
[
"Sakaguchi",
"Keisuke",
""
],
[
"Holtzman",
"Ari",
""
],
[
"Rashkin",
"Hannah",
""
],
[
"Downey",
"Doug",
""
... | Abductive reasoning is inference to the most plausible explanation. For example, if Jenny finds her house in a mess when she returns from work, and remembers that she left a window open, she can hypothesize that a thief broke into her house and caused the mess, as the most plausible explanation. While abduction has lon... |
1901.00861 | Bradley Gram-Hansen | Bradley Gram-Hansen, Patrick Helber, Indhu Varatharajan, Faiza Azam,
Alejandro Coca-Castro, Veronika Kopackova, Piotr Bilinski | Mapping Informal Settlements in Developing Countries using Machine
Learning and Low Resolution Multi-spectral Data | Published at the AAAI/ACM Conference on AI, ethics and society.
Extended results from our previous workshop: arXiv:1812.00812 | AAAI/ACM Conference on AI, Ethics, and Society (AIES 2019) | 10.1145/3306618.3314253 | null | cs.CY cs.CV cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Informal settlements are home to the most socially and economically
vulnerable people on the planet. In order to deliver effective economic and
social aid, non-government organizations (NGOs), such as the United Nations
Children's Fund (UNICEF), require detailed maps of the locations of informal
settlements. However,... | [
{
"created": "Thu, 3 Jan 2019 16:51:40 GMT",
"version": "v1"
},
{
"created": "Fri, 8 Mar 2019 23:18:26 GMT",
"version": "v2"
},
{
"created": "Thu, 30 May 2019 11:11:39 GMT",
"version": "v3"
}
] | 2019-05-31 | [
[
"Gram-Hansen",
"Bradley",
""
],
[
"Helber",
"Patrick",
""
],
[
"Varatharajan",
"Indhu",
""
],
[
"Azam",
"Faiza",
""
],
[
"Coca-Castro",
"Alejandro",
""
],
[
"Kopackova",
"Veronika",
""
],
[
"Bilinski",
"Piotr",... | Informal settlements are home to the most socially and economically vulnerable people on the planet. In order to deliver effective economic and social aid, non-government organizations (NGOs), such as the United Nations Children's Fund (UNICEF), require detailed maps of the locations of informal settlements. However, d... |
1304.1137 | John Yen | John Yen, Piero P. Bonissone | Extending Term Subsumption systems for Uncertainty Management | Appears in Proceedings of the Sixth Conference on Uncertainty in
Artificial Intelligence (UAI1990) | null | null | UAI-P-1990-PG-468-474 | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A major difficulty in developing and maintaining very large knowledge bases
originates from the variety of forms in which knowledge is made available to
the KB builder. The objective of this research is to bring together two
complementary knowledge representation schemes: term subsumption languages,
which represent a... | [
{
"created": "Wed, 27 Mar 2013 13:59:48 GMT",
"version": "v1"
}
] | 2013-04-05 | [
[
"Yen",
"John",
""
],
[
"Bonissone",
"Piero P.",
""
]
] | A major difficulty in developing and maintaining very large knowledge bases originates from the variety of forms in which knowledge is made available to the KB builder. The objective of this research is to bring together two complementary knowledge representation schemes: term subsumption languages, which represent and... |
cs/0610119 | Elad Hazan | Elad Hazan | Approximate Convex Optimization by Online Game Playing | null | null | null | null | cs.DS | null | Lagrangian relaxation and approximate optimization algorithms have received
much attention in the last two decades. Typically, the running time of these
methods to obtain a $\epsilon$ approximate solution is proportional to
$\frac{1}{\epsilon^2}$. Recently, Bienstock and Iyengar, following Nesterov,
gave an algorithm... | [
{
"created": "Thu, 19 Oct 2006 22:10:32 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Hazan",
"Elad",
""
]
] | Lagrangian relaxation and approximate optimization algorithms have received much attention in the last two decades. Typically, the running time of these methods to obtain a $\epsilon$ approximate solution is proportional to $\frac{1}{\epsilon^2}$. Recently, Bienstock and Iyengar, following Nesterov, gave an algorithm f... |
1107.3129 | Anwitaman Datta | Frederique Oggier, Anwitaman Datta | Homomorphic Self-repairing Codes for Agile Maintenance of Distributed
Storage Systems | arXiv admin note: significant text overlap with arXiv:1008.0064 | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Distributed data storage systems are essential to deal with the need to store
massive volumes of data. In order to make such a system fault-tolerant, some
form of redundancy becomes crucial, incurring various overheads - most
prominently in terms of storage space and maintenance bandwidth requirements.
Erasure codes,... | [
{
"created": "Fri, 15 Jul 2011 18:46:33 GMT",
"version": "v1"
}
] | 2011-12-25 | [
[
"Oggier",
"Frederique",
""
],
[
"Datta",
"Anwitaman",
""
]
] | Distributed data storage systems are essential to deal with the need to store massive volumes of data. In order to make such a system fault-tolerant, some form of redundancy becomes crucial, incurring various overheads - most prominently in terms of storage space and maintenance bandwidth requirements. Erasure codes, o... |
1909.08518 | Ashesh Rambachan | Ashesh Rambachan and Jonathan Roth | Bias In, Bias Out? Evaluating the Folk Wisdom | null | 1st Symposium on Foundations of Responsible Computing (FORC 2020) | 10.4230/LIPIcs.FORC.2020.6 | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We evaluate the folk wisdom that algorithmic decision rules trained on data
produced by biased human decision-makers necessarily reflect this bias. We
consider a setting where training labels are only generated if a biased
decision-maker takes a particular action, and so "biased" training data arise
due to discrimina... | [
{
"created": "Wed, 18 Sep 2019 15:50:19 GMT",
"version": "v1"
},
{
"created": "Thu, 27 Feb 2020 02:45:01 GMT",
"version": "v2"
},
{
"created": "Sat, 19 Dec 2020 19:19:02 GMT",
"version": "v3"
}
] | 2020-12-22 | [
[
"Rambachan",
"Ashesh",
""
],
[
"Roth",
"Jonathan",
""
]
] | We evaluate the folk wisdom that algorithmic decision rules trained on data produced by biased human decision-makers necessarily reflect this bias. We consider a setting where training labels are only generated if a biased decision-maker takes a particular action, and so "biased" training data arise due to discriminato... |
2103.01078 | Rodrigo Bonacin | Renata de Podest\'a Gaspar, Rodrigo Bonacin, Vin\'icius Gon\c{c}alves | Um Estudo sobre Atividades Participativas para Solu\c{c}\~oes IoT para o
Home care de Pessoas Idosas | 147 pages, in Portuguese | null | null | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Population aging in Brazil and in the world occurs at the same time of
advances and evolutions in technology. Thus, opportunities for new solutions
arise for the elderly, such as innovations in Home Care. With the Internet of
Things, it is possible to improve the elderly autonomy, safety and quality of
life. However,... | [
{
"created": "Mon, 1 Mar 2021 15:43:32 GMT",
"version": "v1"
}
] | 2021-03-02 | [
[
"Gaspar",
"Renata de Podestá",
""
],
[
"Bonacin",
"Rodrigo",
""
],
[
"Gonçalves",
"Vinícius",
""
]
] | Population aging in Brazil and in the world occurs at the same time of advances and evolutions in technology. Thus, opportunities for new solutions arise for the elderly, such as innovations in Home Care. With the Internet of Things, it is possible to improve the elderly autonomy, safety and quality of life. However, t... |
2208.07824 | Ngoc Bui | Ngoc Bui, Phi Le Nguyen, Viet Anh Nguyen, Phan Thuan Do | A Deep Reinforcement Learning-based Adaptive Charging Policy for WRSNs | 9 pages | null | 10.1109/MASS56207.2022.00097 | null | cs.LG cs.SY eess.SY | http://creativecommons.org/licenses/by/4.0/ | Wireless sensor networks consist of randomly distributed sensor nodes for
monitoring targets or areas of interest. Maintaining the network for continuous
surveillance is a challenge due to the limited battery capacity in each sensor.
Wireless power transfer technology is emerging as a reliable solution for
energizing... | [
{
"created": "Tue, 16 Aug 2022 16:10:52 GMT",
"version": "v1"
}
] | 2023-10-03 | [
[
"Bui",
"Ngoc",
""
],
[
"Nguyen",
"Phi Le",
""
],
[
"Nguyen",
"Viet Anh",
""
],
[
"Do",
"Phan Thuan",
""
]
] | Wireless sensor networks consist of randomly distributed sensor nodes for monitoring targets or areas of interest. Maintaining the network for continuous surveillance is a challenge due to the limited battery capacity in each sensor. Wireless power transfer technology is emerging as a reliable solution for energizing t... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.