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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2301.09325 | Nhan-Phu Chung | Nhan-Phu Chung, Jaeseong Jeong, Namhun Koo and Soonhak Kwon | cc-differential uniformity, (almost) perfect cc-nonlinearity, and
equivalences | 18 pages. Comments welcome | null | null | null | cs.IT cs.CR math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this article, we introduce new notions $cc$-differential uniformity,
$cc$-differential spectrum, PccN functions and APccN functions, and investigate
their properties. We also introduce $c$-CCZ equivalence, $c$-EA equivalence,
and $c1$-equivalence. We show that $c$-differential uniformity is invariant
under $c1$-eq... | [
{
"created": "Mon, 23 Jan 2023 09:01:20 GMT",
"version": "v1"
}
] | 2023-01-24 | [
[
"Chung",
"Nhan-Phu",
""
],
[
"Jeong",
"Jaeseong",
""
],
[
"Koo",
"Namhun",
""
],
[
"Kwon",
"Soonhak",
""
]
] | In this article, we introduce new notions $cc$-differential uniformity, $cc$-differential spectrum, PccN functions and APccN functions, and investigate their properties. We also introduce $c$-CCZ equivalence, $c$-EA equivalence, and $c1$-equivalence. We show that $c$-differential uniformity is invariant under $c1$-equi... |
1904.04187 | Juraj Per\v{s}i\'c | Juraj Per\v{s}i\'c, Luka Petrovi\'c, Ivan Markovi\'c and Ivan
Petrovi\'c | Spatio-Temporal Multisensor Calibration Based on Gaussian Processes
Moving Object Tracking | null | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Perception is one of the key abilities of autonomous mobile robotic systems,
which often relies on fusion of heterogeneous sensors. Although this
heterogeneity presents a challenge for sensor calibration, it is also the main
prospect for reliability and robustness of autonomous systems. In this paper,
we propose a me... | [
{
"created": "Mon, 8 Apr 2019 16:53:44 GMT",
"version": "v1"
}
] | 2019-04-09 | [
[
"Peršić",
"Juraj",
""
],
[
"Petrović",
"Luka",
""
],
[
"Marković",
"Ivan",
""
],
[
"Petrović",
"Ivan",
""
]
] | Perception is one of the key abilities of autonomous mobile robotic systems, which often relies on fusion of heterogeneous sensors. Although this heterogeneity presents a challenge for sensor calibration, it is also the main prospect for reliability and robustness of autonomous systems. In this paper, we propose a meth... |
1807.07389 | Felix Diaz Hermida | F. D\'iaz-Hermida, Juan. C. Vidal | Fuzzy quantification for linguistic data analysis and data mining | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Fuzzy quantification is a subtopic of fuzzy logic which deals with the
modelling of the quantified expressions we can find in natural language. Fuzzy
quantifiers have been successfully applied in several fields like fuzzy,
control, fuzzy databases, information retrieval, natural language generation,
etc. Their abilit... | [
{
"created": "Thu, 19 Jul 2018 13:22:01 GMT",
"version": "v1"
}
] | 2018-07-20 | [
[
"Díaz-Hermida",
"F.",
""
],
[
"Vidal",
"Juan. C.",
""
]
] | Fuzzy quantification is a subtopic of fuzzy logic which deals with the modelling of the quantified expressions we can find in natural language. Fuzzy quantifiers have been successfully applied in several fields like fuzzy, control, fuzzy databases, information retrieval, natural language generation, etc. Their ability ... |
2401.04039 | Nabajeet Barman | Nabajeet Barman, Maria G. Martini and Yuriy Reznik | Bj{\o}ntegaard Delta (BD): A Tutorial Overview of the Metric, Evolution,
Challenges, and Recommendations | null | null | null | null | cs.MM cs.IT eess.IV math.IT | http://creativecommons.org/licenses/by-nc-nd/4.0/ | The Bj{\o}ntegaard Delta (BD) method proposed in 2001 has become a popular
tool for comparing video codec compression efficiency. It was initially
proposed to compute bitrate and quality differences between two Rate-Distortion
curves using PSNR as a distortion metric. Over the years, many works have
calculated and re... | [
{
"created": "Mon, 8 Jan 2024 17:24:16 GMT",
"version": "v1"
}
] | 2024-01-09 | [
[
"Barman",
"Nabajeet",
""
],
[
"Martini",
"Maria G.",
""
],
[
"Reznik",
"Yuriy",
""
]
] | The Bj{\o}ntegaard Delta (BD) method proposed in 2001 has become a popular tool for comparing video codec compression efficiency. It was initially proposed to compute bitrate and quality differences between two Rate-Distortion curves using PSNR as a distortion metric. Over the years, many works have calculated and repo... |
1609.01203 | L\'eopold Crestel | L\'eopold Crestel and Philippe Esling | Live Orchestral Piano, a system for real-time orchestral music
generation | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper introduces the first system for performing automatic orchestration
based on a real-time piano input. We believe that it is possible to learn the
underlying regularities existing between piano scores and their orchestrations
by notorious composers, in order to automatically perform this task on novel
piano ... | [
{
"created": "Mon, 5 Sep 2016 15:58:11 GMT",
"version": "v1"
},
{
"created": "Thu, 18 May 2017 14:15:30 GMT",
"version": "v2"
}
] | 2017-05-19 | [
[
"Crestel",
"Léopold",
""
],
[
"Esling",
"Philippe",
""
]
] | This paper introduces the first system for performing automatic orchestration based on a real-time piano input. We believe that it is possible to learn the underlying regularities existing between piano scores and their orchestrations by notorious composers, in order to automatically perform this task on novel piano in... |
2011.02879 | Mehdi Khoshboresh-Masouleh | Mehdi Khoshboresh-Masouleh, Mohammad R. Saradjian | Robust building footprint extraction from big multi-sensor data using
deep competition network | 8 pages, 5 figures | The International Archives of the Photogrammetry, Remote Sensing
and Spatial Information Sciences, Volume XLII-4/W18, 2019 | 10.5194/isprs-archives-XLII-4-W18-615-2019 | null | cs.CV eess.IV | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Building footprint extraction (BFE) from multi-sensor data such as optical
images and light detection and ranging (LiDAR) point clouds is widely used in
various fields of remote sensing applications. However, it is still challenging
research topic due to relatively inefficient building extraction techniques
from vari... | [
{
"created": "Wed, 4 Nov 2020 09:04:38 GMT",
"version": "v1"
},
{
"created": "Mon, 16 Nov 2020 09:11:12 GMT",
"version": "v2"
},
{
"created": "Sat, 28 Nov 2020 13:06:36 GMT",
"version": "v3"
}
] | 2020-12-01 | [
[
"Khoshboresh-Masouleh",
"Mehdi",
""
],
[
"Saradjian",
"Mohammad R.",
""
]
] | Building footprint extraction (BFE) from multi-sensor data such as optical images and light detection and ranging (LiDAR) point clouds is widely used in various fields of remote sensing applications. However, it is still challenging research topic due to relatively inefficient building extraction techniques from variet... |
2303.17805 | Sebastian Neumayer | Sebastian Neumayer and L\'ena\"ic Chizat and Michael Unser | On the Effect of Initialization: The Scaling Path of 2-Layer Neural
Networks | null | null | null | null | cs.LG math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In supervised learning, the regularization path is sometimes used as a
convenient theoretical proxy for the optimization path of gradient descent
initialized from zero. In this paper, we study a modification of the
regularization path for infinite-width 2-layer ReLU neural networks with
nonzero initial distribution o... | [
{
"created": "Fri, 31 Mar 2023 05:32:11 GMT",
"version": "v1"
},
{
"created": "Wed, 9 Aug 2023 07:24:44 GMT",
"version": "v2"
}
] | 2023-08-10 | [
[
"Neumayer",
"Sebastian",
""
],
[
"Chizat",
"Lénaïc",
""
],
[
"Unser",
"Michael",
""
]
] | In supervised learning, the regularization path is sometimes used as a convenient theoretical proxy for the optimization path of gradient descent initialized from zero. In this paper, we study a modification of the regularization path for infinite-width 2-layer ReLU neural networks with nonzero initial distribution of ... |
2404.16000 | Stefano Woerner | Stefano Woerner, Arthur Jaques and Christian F. Baumgartner | A comprehensive and easy-to-use multi-domain multi-task medical imaging
meta-dataset (MedIMeta) | null | null | null | null | cs.CV cs.LG | http://creativecommons.org/licenses/by-sa/4.0/ | While the field of medical image analysis has undergone a transformative
shift with the integration of machine learning techniques, the main challenge
of these techniques is often the scarcity of large, diverse, and well-annotated
datasets. Medical images vary in format, size, and other parameters and
therefore requi... | [
{
"created": "Wed, 24 Apr 2024 17:27:57 GMT",
"version": "v1"
}
] | 2024-04-25 | [
[
"Woerner",
"Stefano",
""
],
[
"Jaques",
"Arthur",
""
],
[
"Baumgartner",
"Christian F.",
""
]
] | While the field of medical image analysis has undergone a transformative shift with the integration of machine learning techniques, the main challenge of these techniques is often the scarcity of large, diverse, and well-annotated datasets. Medical images vary in format, size, and other parameters and therefore require... |
2112.07339 | Nicolae Paladi | Jakob Svenningsson, Nicolae Paladi, Arash Vahidi | Speeding up enclave transitions for IO-intensive applications | null | null | null | null | cs.CR cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Process-based confidential computing enclaves such as Intel SGX can be used
to protect the confidentiality and integrity of workloads, without the overhead
of virtualisation. However, they introduce a notable performance overhead,
especially when it comes to transitions in and out of the enclave context. Such
overhea... | [
{
"created": "Tue, 14 Dec 2021 12:54:36 GMT",
"version": "v1"
}
] | 2021-12-15 | [
[
"Svenningsson",
"Jakob",
""
],
[
"Paladi",
"Nicolae",
""
],
[
"Vahidi",
"Arash",
""
]
] | Process-based confidential computing enclaves such as Intel SGX can be used to protect the confidentiality and integrity of workloads, without the overhead of virtualisation. However, they introduce a notable performance overhead, especially when it comes to transitions in and out of the enclave context. Such overhead ... |
2202.00817 | Hyung Ju Suh | H.J. Terry Suh, Max Simchowitz, Kaiqing Zhang, Russ Tedrake | Do Differentiable Simulators Give Better Policy Gradients? | Accepted to ICML 2022 | ICML 2022 | null | null | cs.LG cs.AI cs.RO | http://creativecommons.org/licenses/by/4.0/ | Differentiable simulators promise faster computation time for reinforcement
learning by replacing zeroth-order gradient estimates of a stochastic objective
with an estimate based on first-order gradients. However, it is yet unclear
what factors decide the performance of the two estimators on complex landscapes
that i... | [
{
"created": "Wed, 2 Feb 2022 00:12:28 GMT",
"version": "v1"
},
{
"created": "Mon, 22 Aug 2022 14:33:02 GMT",
"version": "v2"
}
] | 2022-08-23 | [
[
"Suh",
"H. J. Terry",
""
],
[
"Simchowitz",
"Max",
""
],
[
"Zhang",
"Kaiqing",
""
],
[
"Tedrake",
"Russ",
""
]
] | Differentiable simulators promise faster computation time for reinforcement learning by replacing zeroth-order gradient estimates of a stochastic objective with an estimate based on first-order gradients. However, it is yet unclear what factors decide the performance of the two estimators on complex landscapes that inv... |
1905.01966 | Amirreza Shirani | Amirreza Shirani, Bowen Xu, David Lo, Thamar Solorio and Amin Alipour | Question Relatedness on Stack Overflow: The Task, Dataset, and
Corpus-inspired Models | null | AAAI 2019 Reasoning for Complex Question Answering Workshop | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | Domain-specific community question answering is becoming an integral part of
professions. Finding related questions and answers in these communities can
significantly improve the effectiveness and efficiency of information seeking.
Stack Overflow is one of the most popular communities that is being used by
millions o... | [
{
"created": "Fri, 3 May 2019 01:45:50 GMT",
"version": "v1"
},
{
"created": "Tue, 7 May 2019 15:35:32 GMT",
"version": "v2"
}
] | 2019-05-08 | [
[
"Shirani",
"Amirreza",
""
],
[
"Xu",
"Bowen",
""
],
[
"Lo",
"David",
""
],
[
"Solorio",
"Thamar",
""
],
[
"Alipour",
"Amin",
""
]
] | Domain-specific community question answering is becoming an integral part of professions. Finding related questions and answers in these communities can significantly improve the effectiveness and efficiency of information seeking. Stack Overflow is one of the most popular communities that is being used by millions of ... |
2103.05248 | Mo Zhou | Mo Zhou, Le Wang, Zhenxing Niu, Qilin Zhang, Yinghui Xu, Nanning
Zheng, Gang Hua | Practical Relative Order Attack in Deep Ranking | ICCV2021 Poster | null | null | null | cs.LG cs.CV cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent studies unveil the vulnerabilities of deep ranking models, where an
imperceptible perturbation can trigger dramatic changes in the ranking result.
While previous attempts focus on manipulating absolute ranks of certain
candidates, the possibility of adjusting their relative order remains
under-explored. In thi... | [
{
"created": "Tue, 9 Mar 2021 06:41:18 GMT",
"version": "v1"
},
{
"created": "Wed, 17 Mar 2021 01:16:13 GMT",
"version": "v2"
},
{
"created": "Sat, 20 Mar 2021 12:18:44 GMT",
"version": "v3"
},
{
"created": "Mon, 9 Aug 2021 15:54:56 GMT",
"version": "v4"
}
] | 2021-08-10 | [
[
"Zhou",
"Mo",
""
],
[
"Wang",
"Le",
""
],
[
"Niu",
"Zhenxing",
""
],
[
"Zhang",
"Qilin",
""
],
[
"Xu",
"Yinghui",
""
],
[
"Zheng",
"Nanning",
""
],
[
"Hua",
"Gang",
""
]
] | Recent studies unveil the vulnerabilities of deep ranking models, where an imperceptible perturbation can trigger dramatic changes in the ranking result. While previous attempts focus on manipulating absolute ranks of certain candidates, the possibility of adjusting their relative order remains under-explored. In this ... |
2210.03731 | Sheng-Chun Kao | Sheng-Chun Kao, Angshuman Parashar, Po-An Tsai, Tushar Krishna | Demystifying Map Space Exploration for NPUs | null | null | null | null | cs.LG cs.DC | http://creativecommons.org/licenses/by/4.0/ | Map Space Exploration is the problem of finding optimized mappings of a Deep
Neural Network (DNN) model on an accelerator. It is known to be extremely
computationally expensive, and there has been active research looking at both
heuristics and learning-based methods to make the problem computationally
tractable. Howe... | [
{
"created": "Fri, 7 Oct 2022 17:58:45 GMT",
"version": "v1"
}
] | 2022-10-10 | [
[
"Kao",
"Sheng-Chun",
""
],
[
"Parashar",
"Angshuman",
""
],
[
"Tsai",
"Po-An",
""
],
[
"Krishna",
"Tushar",
""
]
] | Map Space Exploration is the problem of finding optimized mappings of a Deep Neural Network (DNN) model on an accelerator. It is known to be extremely computationally expensive, and there has been active research looking at both heuristics and learning-based methods to make the problem computationally tractable. Howeve... |
1710.01363 | Carl Yang | Carl Yang and Kevin Chen-Chuan Chang | Relationship Profiling over Social Networks: Reverse Smoothness from
Similarity to Closeness | null | null | null | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | On social networks, while nodes bear rich attributes, we often lack the
`semantics' of why each link is formed-- and thus we are missing the `road
signs' to navigate and organize the complex social universe. How to identify
relationship semantics without labels? Founded on the prevalent homophily
principle, we propos... | [
{
"created": "Tue, 3 Oct 2017 19:46:48 GMT",
"version": "v1"
}
] | 2017-10-05 | [
[
"Yang",
"Carl",
""
],
[
"Chang",
"Kevin Chen-Chuan",
""
]
] | On social networks, while nodes bear rich attributes, we often lack the `semantics' of why each link is formed-- and thus we are missing the `road signs' to navigate and organize the complex social universe. How to identify relationship semantics without labels? Founded on the prevalent homophily principle, we propose ... |
2109.10161 | Yi Fang | Mengxi Wu, Hao Huang, Yi Fang | 3D Point Cloud Completion with Geometric-Aware Adversarial Augmentation | 11 page, 5 figures | null | 10.1109/ICPR56361.2022.9956045 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the popularity of 3D sensors in self-driving and other robotics
applications, extensive research has focused on designing novel neural network
architectures for accurate 3D point cloud completion. However, unlike in point
cloud classification and reconstruction, the role of adversarial samples in3D
point cloud c... | [
{
"created": "Tue, 21 Sep 2021 13:16:46 GMT",
"version": "v1"
}
] | 2023-01-24 | [
[
"Wu",
"Mengxi",
""
],
[
"Huang",
"Hao",
""
],
[
"Fang",
"Yi",
""
]
] | With the popularity of 3D sensors in self-driving and other robotics applications, extensive research has focused on designing novel neural network architectures for accurate 3D point cloud completion. However, unlike in point cloud classification and reconstruction, the role of adversarial samples in3D point cloud com... |
2206.13964 | Chao Fan | Chao Fan, Saihui Hou, Jilong Wang, Yongzhen Huang, and Shiqi Yu | Learning Gait Representation from Massive Unlabelled Walking Videos: A
Benchmark | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Gait depicts individuals' unique and distinguishing walking patterns and has
become one of the most promising biometric features for human identification.
As a fine-grained recognition task, gait recognition is easily affected by many
factors and usually requires a large amount of completely annotated data that
is co... | [
{
"created": "Tue, 28 Jun 2022 12:33:42 GMT",
"version": "v1"
},
{
"created": "Mon, 4 Sep 2023 07:12:45 GMT",
"version": "v2"
}
] | 2023-09-06 | [
[
"Fan",
"Chao",
""
],
[
"Hou",
"Saihui",
""
],
[
"Wang",
"Jilong",
""
],
[
"Huang",
"Yongzhen",
""
],
[
"Yu",
"Shiqi",
""
]
] | Gait depicts individuals' unique and distinguishing walking patterns and has become one of the most promising biometric features for human identification. As a fine-grained recognition task, gait recognition is easily affected by many factors and usually requires a large amount of completely annotated data that is cost... |
2309.13614 | Zenan Li | Zenan Li, Fan Nie, Qiao Sun, Fang Da, Hang Zhao | Boosting Offline Reinforcement Learning for Autonomous Driving with
Hierarchical Latent Skills | null | null | null | null | cs.RO cs.AI | http://creativecommons.org/licenses/by/4.0/ | Learning-based vehicle planning is receiving increasing attention with the
emergence of diverse driving simulators and large-scale driving datasets. While
offline reinforcement learning (RL) is well suited for these safety-critical
tasks, it still struggles to plan over extended periods. In this work, we
present a sk... | [
{
"created": "Sun, 24 Sep 2023 11:51:17 GMT",
"version": "v1"
},
{
"created": "Fri, 17 Nov 2023 05:44:54 GMT",
"version": "v2"
}
] | 2023-11-20 | [
[
"Li",
"Zenan",
""
],
[
"Nie",
"Fan",
""
],
[
"Sun",
"Qiao",
""
],
[
"Da",
"Fang",
""
],
[
"Zhao",
"Hang",
""
]
] | Learning-based vehicle planning is receiving increasing attention with the emergence of diverse driving simulators and large-scale driving datasets. While offline reinforcement learning (RL) is well suited for these safety-critical tasks, it still struggles to plan over extended periods. In this work, we present a skil... |
2108.07789 | Xianrui Zheng | Xianrui Zheng, Chao Zhang and Philip C. Woodland | Adapting GPT, GPT-2 and BERT Language Models for Speech Recognition | To appear in ASRU 2021 | null | null | null | cs.CL cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Language models (LMs) pre-trained on massive amounts of text, in particular
bidirectional encoder representations from Transformers (BERT), generative
pre-training (GPT), and GPT-2, have become a key technology for many natural
language processing tasks. In this paper, we present results using fine-tuned
GPT, GPT-2, ... | [
{
"created": "Thu, 29 Jul 2021 16:53:37 GMT",
"version": "v1"
},
{
"created": "Fri, 1 Oct 2021 14:19:39 GMT",
"version": "v2"
}
] | 2021-10-04 | [
[
"Zheng",
"Xianrui",
""
],
[
"Zhang",
"Chao",
""
],
[
"Woodland",
"Philip C.",
""
]
] | Language models (LMs) pre-trained on massive amounts of text, in particular bidirectional encoder representations from Transformers (BERT), generative pre-training (GPT), and GPT-2, have become a key technology for many natural language processing tasks. In this paper, we present results using fine-tuned GPT, GPT-2, an... |
2402.09410 | Asad Khaliq | Asad Khaliq | On Computability of Computable Problems | 18 Pages,5 figures, and 1 table | null | null | null | cs.CC | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Computational problems are classified into computable and uncomputable
problems.If there exists an effective procedure (algorithm) to compute a
problem then the problem is computable otherwise it is uncomputable.Turing
machines can execute any algorithm therefore every computable problem is Turing
computable.There ar... | [
{
"created": "Wed, 13 Dec 2023 18:02:12 GMT",
"version": "v1"
},
{
"created": "Fri, 16 Feb 2024 18:15:18 GMT",
"version": "v2"
}
] | 2024-02-19 | [
[
"Khaliq",
"Asad",
""
]
] | Computational problems are classified into computable and uncomputable problems.If there exists an effective procedure (algorithm) to compute a problem then the problem is computable otherwise it is uncomputable.Turing machines can execute any algorithm therefore every computable problem is Turing computable.There are ... |
2406.08124 | Duanyu Feng | Duanyu Feng, Bowen Qin, Chen Huang, Youcheng Huang, Zheng Zhang,
Wenqiang Lei | Legend: Leveraging Representation Engineering to Annotate Safety Margin
for Preference Datasets | Our code is available at https://github.com/colfeng/Legend | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The success of the reward model in distinguishing between responses with
subtle safety differences depends critically on the high-quality preference
dataset, which should capture the fine-grained nuances of harmful and harmless
responses. This motivates the need to develop a dataset involving preference
margins, whic... | [
{
"created": "Wed, 12 Jun 2024 12:06:32 GMT",
"version": "v1"
}
] | 2024-06-13 | [
[
"Feng",
"Duanyu",
""
],
[
"Qin",
"Bowen",
""
],
[
"Huang",
"Chen",
""
],
[
"Huang",
"Youcheng",
""
],
[
"Zhang",
"Zheng",
""
],
[
"Lei",
"Wenqiang",
""
]
] | The success of the reward model in distinguishing between responses with subtle safety differences depends critically on the high-quality preference dataset, which should capture the fine-grained nuances of harmful and harmless responses. This motivates the need to develop a dataset involving preference margins, which ... |
2003.10585 | Pietro Verzelli | Pietro Verzelli and Cesare Alippi and Lorenzo Livi and Peter Tino | Input-to-State Representation in linear reservoirs dynamics | null | null | null | null | cs.NE cs.LG math.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Reservoir computing is a popular approach to design recurrent neural
networks, due to its training simplicity and approximation performance. The
recurrent part of these networks is not trained (e.g., via gradient descent),
making them appealing for analytical studies by a large community of
researchers with backgroun... | [
{
"created": "Tue, 24 Mar 2020 00:14:25 GMT",
"version": "v1"
},
{
"created": "Tue, 5 Jan 2021 23:22:16 GMT",
"version": "v2"
},
{
"created": "Fri, 12 Feb 2021 14:29:49 GMT",
"version": "v3"
}
] | 2021-02-15 | [
[
"Verzelli",
"Pietro",
""
],
[
"Alippi",
"Cesare",
""
],
[
"Livi",
"Lorenzo",
""
],
[
"Tino",
"Peter",
""
]
] | Reservoir computing is a popular approach to design recurrent neural networks, due to its training simplicity and approximation performance. The recurrent part of these networks is not trained (e.g., via gradient descent), making them appealing for analytical studies by a large community of researchers with backgrounds... |
2308.02870 | Fangyuan Wang | Fangyuan Wang, Ming Hao, Yuhai Shi, Bo Xu | ApproBiVT: Lead ASR Models to Generalize Better Using Approximated
Bias-Variance Tradeoff Guided Early Stopping and Checkpoint Averaging | null | null | null | null | cs.CL cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The conventional recipe for Automatic Speech Recognition (ASR) models is to
1) train multiple checkpoints on a training set while relying on a validation
set to prevent overfitting using early stopping and 2) average several last
checkpoints or that of the lowest validation losses to obtain the final model.
In this p... | [
{
"created": "Sat, 5 Aug 2023 12:50:54 GMT",
"version": "v1"
}
] | 2023-08-08 | [
[
"Wang",
"Fangyuan",
""
],
[
"Hao",
"Ming",
""
],
[
"Shi",
"Yuhai",
""
],
[
"Xu",
"Bo",
""
]
] | The conventional recipe for Automatic Speech Recognition (ASR) models is to 1) train multiple checkpoints on a training set while relying on a validation set to prevent overfitting using early stopping and 2) average several last checkpoints or that of the lowest validation losses to obtain the final model. In this pap... |
1502.04820 | Tanmoy Maitra | Tanmoy Maitra | Cryptanalysis of A Secure Remote User Authentication Scheme Using Smart
Cards | 4 pages, no figure, fresh submission | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Smart card based authentication schemes are used in various fields like
e-banking, e-commerce, wireless sensor networks, medical system and so on to
authenticate the both remote user and the application server during the
communication via internet. Recently, Karuppiah and Saravanan proposed an
authentication scheme w... | [
{
"created": "Tue, 17 Feb 2015 07:55:50 GMT",
"version": "v1"
}
] | 2015-02-18 | [
[
"Maitra",
"Tanmoy",
""
]
] | Smart card based authentication schemes are used in various fields like e-banking, e-commerce, wireless sensor networks, medical system and so on to authenticate the both remote user and the application server during the communication via internet. Recently, Karuppiah and Saravanan proposed an authentication scheme whi... |
2303.14404 | Muhammad Akhtar Munir | Muhammad Akhtar Munir and Muhammad Haris Khan and Salman Khan and
Fahad Shahbaz Khan | Bridging Precision and Confidence: A Train-Time Loss for Calibrating
Object Detection | Accepted at CVPR 2023 | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Deep neural networks (DNNs) have enabled astounding progress in several
vision-based problems. Despite showing high predictive accuracy, recently,
several works have revealed that they tend to provide overconfident predictions
and thus are poorly calibrated. The majority of the works addressing the
miscalibration of ... | [
{
"created": "Sat, 25 Mar 2023 08:56:21 GMT",
"version": "v1"
}
] | 2023-03-28 | [
[
"Munir",
"Muhammad Akhtar",
""
],
[
"Khan",
"Muhammad Haris",
""
],
[
"Khan",
"Salman",
""
],
[
"Khan",
"Fahad Shahbaz",
""
]
] | Deep neural networks (DNNs) have enabled astounding progress in several vision-based problems. Despite showing high predictive accuracy, recently, several works have revealed that they tend to provide overconfident predictions and thus are poorly calibrated. The majority of the works addressing the miscalibration of DN... |
2112.12054 | Chennakesava Kadapa | Chennakesava Kadapa | Machine Learning for Computational Science and Engineering -- a brief
introduction and some critical questions | 16 papges | null | null | null | cs.LG cs.CE physics.comp-ph | http://creativecommons.org/licenses/by/4.0/ | Artificial Intelligence (AI) is now entering every sub-field of science,
technology, engineering, arts, and management. Thanks to the hype and
availability of research funds, it is being adapted in many fields without much
thought. Computational Science and Engineering (CS&E) is one such sub-field. By
highlighting so... | [
{
"created": "Wed, 22 Dec 2021 17:25:32 GMT",
"version": "v1"
}
] | 2021-12-23 | [
[
"Kadapa",
"Chennakesava",
""
]
] | Artificial Intelligence (AI) is now entering every sub-field of science, technology, engineering, arts, and management. Thanks to the hype and availability of research funds, it is being adapted in many fields without much thought. Computational Science and Engineering (CS&E) is one such sub-field. By highlighting some... |
2202.02177 | Jakub Nawa{\l}a | Jakub Nawa{\l}a (1), Lucjan Janowski (1), Bogdan \'Cmiel (2),
Krzysztof Rusek (1), Pablo P\'erez (3) ((1) AGH University of Science and
Technology, Institute of Telecommunications, (2) AGH University of Science
and Technology, Department of Mathematical Analysis, Computational
Mathematics and Probability Method... | Generalised Score Distribution: A Two-Parameter Discrete Distribution
Accurately Describing Responses from Quality of Experience Subjective
Experiments | 15 pages, 6 figures. Under review in IEEE Transactions on Multimedia | IEEE Transactions on Multimedia, 2022 | 10.1109/TMM.2022.3205444 | null | cs.MM | http://creativecommons.org/licenses/by/4.0/ | Subjective responses from Multimedia Quality Assessment (MQA) experiments are
conventionally analysed with methods not suitable for the data type these
responses represent. Furthermore, obtaining subjective responses is resource
intensive. A method allowing reuse of existing responses would be thus
beneficial. Applyi... | [
{
"created": "Fri, 4 Feb 2022 15:11:24 GMT",
"version": "v1"
}
] | 2022-10-07 | [
[
"Nawała",
"Jakub",
""
],
[
"Janowski",
"Lucjan",
""
],
[
"Ćmiel",
"Bogdan",
""
],
[
"Rusek",
"Krzysztof",
""
],
[
"Pérez",
"Pablo",
""
]
] | Subjective responses from Multimedia Quality Assessment (MQA) experiments are conventionally analysed with methods not suitable for the data type these responses represent. Furthermore, obtaining subjective responses is resource intensive. A method allowing reuse of existing responses would be thus beneficial. Applying... |
2307.10273 | Cl\'ement Canonne | Cl\'ement L. Canonne, Samuel B. Hopkins, Jerry Li, Allen Liu, and
Shyam Narayanan | The Full Landscape of Robust Mean Testing: Sharp Separations between
Oblivious and Adaptive Contamination | To appear in FOCS 2023 | null | null | null | cs.DS math.ST stat.TH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the question of Gaussian mean testing, a fundamental task in
high-dimensional distribution testing and signal processing, subject to
adversarial corruptions of the samples. We focus on the relative power of
different adversaries, and show that, in contrast to the common wisdom in
robust statistics, there ... | [
{
"created": "Tue, 18 Jul 2023 05:02:54 GMT",
"version": "v1"
}
] | 2023-07-21 | [
[
"Canonne",
"Clément L.",
""
],
[
"Hopkins",
"Samuel B.",
""
],
[
"Li",
"Jerry",
""
],
[
"Liu",
"Allen",
""
],
[
"Narayanan",
"Shyam",
""
]
] | We consider the question of Gaussian mean testing, a fundamental task in high-dimensional distribution testing and signal processing, subject to adversarial corruptions of the samples. We focus on the relative power of different adversaries, and show that, in contrast to the common wisdom in robust statistics, there ex... |
2310.13298 | Milad Abolpour | Milad Abolpour, MohammadJavad Salehi, and Antti T\"olli | Cache-Aided Communications in MISO Networks with Dynamic User Behavior | Accepted in IEEE Transaction On Wireless Communications, 2024. arXiv
admin note: substantial text overlap with arXiv:2304.11623 | null | null | null | cs.IT math.IT | http://creativecommons.org/licenses/by/4.0/ | Coded caching (CC) can substantially enhance network performance by
leveraging memory as an additional communication resource. However, the use of
CC is challenging in various practical applications due to dynamic user
behavior. The existing solutions, based on shared caching, cannot directly
handle all scenarios whe... | [
{
"created": "Fri, 20 Oct 2023 06:17:39 GMT",
"version": "v1"
},
{
"created": "Mon, 6 May 2024 09:13:09 GMT",
"version": "v2"
}
] | 2024-05-07 | [
[
"Abolpour",
"Milad",
""
],
[
"Salehi",
"MohammadJavad",
""
],
[
"Tölli",
"Antti",
""
]
] | Coded caching (CC) can substantially enhance network performance by leveraging memory as an additional communication resource. However, the use of CC is challenging in various practical applications due to dynamic user behavior. The existing solutions, based on shared caching, cannot directly handle all scenarios where... |
2004.01909 | Jimmy Lin | Sheng-Chieh Lin, Jheng-Hong Yang, Rodrigo Nogueira, Ming-Feng Tsai,
Chuan-Ju Wang, Jimmy Lin | Conversational Question Reformulation via Sequence-to-Sequence
Architectures and Pretrained Language Models | null | null | null | null | cs.CL cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents an empirical study of conversational question
reformulation (CQR) with sequence-to-sequence architectures and pretrained
language models (PLMs). We leverage PLMs to address the strong token-to-token
independence assumption made in the common objective, maximum likelihood
estimation, for the CQR ta... | [
{
"created": "Sat, 4 Apr 2020 11:07:54 GMT",
"version": "v1"
}
] | 2020-04-07 | [
[
"Lin",
"Sheng-Chieh",
""
],
[
"Yang",
"Jheng-Hong",
""
],
[
"Nogueira",
"Rodrigo",
""
],
[
"Tsai",
"Ming-Feng",
""
],
[
"Wang",
"Chuan-Ju",
""
],
[
"Lin",
"Jimmy",
""
]
] | This paper presents an empirical study of conversational question reformulation (CQR) with sequence-to-sequence architectures and pretrained language models (PLMs). We leverage PLMs to address the strong token-to-token independence assumption made in the common objective, maximum likelihood estimation, for the CQR task... |
2406.03439 | Joachim Ott | Joachim Ott, Zuowen Wang, Shih-Chii Liu | Text-to-Events: Synthetic Event Camera Streams from Conditional Text
Input | null | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Event cameras are advantageous for tasks that require vision sensors with
low-latency and sparse output responses. However, the development of deep
network algorithms using event cameras has been slow because of the lack of
large labelled event camera datasets for network training. This paper reports a
method for cre... | [
{
"created": "Wed, 5 Jun 2024 16:34:12 GMT",
"version": "v1"
}
] | 2024-06-06 | [
[
"Ott",
"Joachim",
""
],
[
"Wang",
"Zuowen",
""
],
[
"Liu",
"Shih-Chii",
""
]
] | Event cameras are advantageous for tasks that require vision sensors with low-latency and sparse output responses. However, the development of deep network algorithms using event cameras has been slow because of the lack of large labelled event camera datasets for network training. This paper reports a method for creat... |
2004.01030 | Lachlan Kermode | Lachlan Kermode, Jan Freyberg, Alican Akturk, Robert Trafford, Denis
Kochetkov, Rafael Pardinas, Eyal Weizman, and Julien Cornebise | Objects of violence: synthetic data for practical ML in human rights
investigations | Presented at NeurIPS 2019 in the AI for Social Good track | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce a machine learning workflow to search for, identify, and
meaningfully triage videos and images of munitions, weapons, and military
equipment, even when limited training data exists for the object of interest.
This workflow is designed to expedite the work of OSINT ("open source
intelligence") researchers... | [
{
"created": "Wed, 1 Apr 2020 14:50:43 GMT",
"version": "v1"
}
] | 2020-04-03 | [
[
"Kermode",
"Lachlan",
""
],
[
"Freyberg",
"Jan",
""
],
[
"Akturk",
"Alican",
""
],
[
"Trafford",
"Robert",
""
],
[
"Kochetkov",
"Denis",
""
],
[
"Pardinas",
"Rafael",
""
],
[
"Weizman",
"Eyal",
""
],
[
... | We introduce a machine learning workflow to search for, identify, and meaningfully triage videos and images of munitions, weapons, and military equipment, even when limited training data exists for the object of interest. This workflow is designed to expedite the work of OSINT ("open source intelligence") researchers i... |
2307.11449 | Yong Song | Ye Ouyang, Yaqin Zhang, Xiaozhou Ye, Yunxin Liu, Yong Song, Yang Liu,
Sen Bian, Zhiyong Liu | AIGC Empowering Telecom Sector White Paper_chinese | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the global craze of GPT, people have deeply realized that AI, as a
transformative technology and key force in economic and social development,
will bring great leaps and breakthroughs to the global industry and profoundly
influence the future world competition pattern. As the builder and operator of
information an... | [
{
"created": "Fri, 21 Jul 2023 09:30:08 GMT",
"version": "v1"
},
{
"created": "Mon, 24 Jul 2023 01:54:25 GMT",
"version": "v2"
}
] | 2023-07-25 | [
[
"Ouyang",
"Ye",
""
],
[
"Zhang",
"Yaqin",
""
],
[
"Ye",
"Xiaozhou",
""
],
[
"Liu",
"Yunxin",
""
],
[
"Song",
"Yong",
""
],
[
"Liu",
"Yang",
""
],
[
"Bian",
"Sen",
""
],
[
"Liu",
"Zhiyong",
"... | In the global craze of GPT, people have deeply realized that AI, as a transformative technology and key force in economic and social development, will bring great leaps and breakthroughs to the global industry and profoundly influence the future world competition pattern. As the builder and operator of information and ... |
2312.01561 | Yan Xu | Yan Xu, Kris Kitani | Multi-View Person Matching and 3D Pose Estimation with Arbitrary
Uncalibrated Camera Networks | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Cross-view person matching and 3D human pose estimation in multi-camera
networks are particularly difficult when the cameras are extrinsically
uncalibrated. Existing efforts generally require large amounts of 3D data for
training neural networks or known camera poses for geometric constraints to
solve the problem. Ho... | [
{
"created": "Mon, 4 Dec 2023 01:28:38 GMT",
"version": "v1"
}
] | 2023-12-05 | [
[
"Xu",
"Yan",
""
],
[
"Kitani",
"Kris",
""
]
] | Cross-view person matching and 3D human pose estimation in multi-camera networks are particularly difficult when the cameras are extrinsically uncalibrated. Existing efforts generally require large amounts of 3D data for training neural networks or known camera poses for geometric constraints to solve the problem. Howe... |
2311.11550 | Kun Wang | Kun Wang, Yu Fua, Xueyuan Duan, Taotao Liu, Jianqiao Xu | Abnormal traffic detection system in SDN based on deep learning hybrid
models | null | null | null | null | cs.NI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Software defined network (SDN) provides technical support for network
construction in smart cities, However, the openness of SDN is also prone to
more network attacks. Traditional abnormal traffic detection methods have
complex algorithms and find it difficult to detect abnormalities in the network
promptly, which ca... | [
{
"created": "Mon, 20 Nov 2023 06:05:32 GMT",
"version": "v1"
}
] | 2023-11-21 | [
[
"Wang",
"Kun",
""
],
[
"Fua",
"Yu",
""
],
[
"Duan",
"Xueyuan",
""
],
[
"Liu",
"Taotao",
""
],
[
"Xu",
"Jianqiao",
""
]
] | Software defined network (SDN) provides technical support for network construction in smart cities, However, the openness of SDN is also prone to more network attacks. Traditional abnormal traffic detection methods have complex algorithms and find it difficult to detect abnormalities in the network promptly, which cann... |
2107.06054 | Maxime Buron | Maxime Buron, Marie-Laure Mugnier, Micha\"el Thomazo | Parallelisable Existential Rules: a Story of Pieces | null | null | null | null | cs.AI cs.DB | http://creativecommons.org/licenses/by/4.0/ | In this paper, we consider existential rules, an expressive formalism well
suited to the representation of ontological knowledge and data-to-ontology
mappings in the context of ontology-based data integration. The chase is a
fundamental tool to do reasoning with existential rules as it computes all the
facts entailed... | [
{
"created": "Tue, 13 Jul 2021 13:09:14 GMT",
"version": "v1"
}
] | 2021-07-14 | [
[
"Buron",
"Maxime",
""
],
[
"Mugnier",
"Marie-Laure",
""
],
[
"Thomazo",
"Michaël",
""
]
] | In this paper, we consider existential rules, an expressive formalism well suited to the representation of ontological knowledge and data-to-ontology mappings in the context of ontology-based data integration. The chase is a fundamental tool to do reasoning with existential rules as it computes all the facts entailed b... |
2202.04431 | Filipe Cogo | Filipe R. Cogo and Xin Xia and Ahmed E. Hassan | Assessing the alignment between the information needs of developers and
the documentation of programming languages: A case study on Rust | null | ACM Transactions on Software Engineering and Methodology (2022) | 10.1145/3546945 | null | cs.SE cs.PL | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Programming language documentation refers to the set of technical documents
that provide application developers with a description of the high-level
concepts of a language. Such documentation is essential to support application
developers in the effective use of a programming language. One of the
challenges faced by ... | [
{
"created": "Tue, 8 Feb 2022 14:45:16 GMT",
"version": "v1"
}
] | 2022-10-11 | [
[
"Cogo",
"Filipe R.",
""
],
[
"Xia",
"Xin",
""
],
[
"Hassan",
"Ahmed E.",
""
]
] | Programming language documentation refers to the set of technical documents that provide application developers with a description of the high-level concepts of a language. Such documentation is essential to support application developers in the effective use of a programming language. One of the challenges faced by do... |
1405.3033 | Zeeshan Bhatti | Zeeshan Bhatti, Ahmad Waqas, Imdad Ali Ismaili, Dil Nawaz Hakro,
Waseem Javaid Soomro | Phonetic based SoundEx & ShapeEx algorithm for Sindhi Spell Checker
System | 9 pages, 6 figures, 5 Tables, Sindhi Computing, Sindhi Language | Adv. Environ. Biol., 8(4), 1147-1155, AENSI Publisher, 2014 | null | null | cs.CL | http://creativecommons.org/licenses/by/3.0/ | This paper presents a novel combinational phonetic algorithm for Sindhi
Language, to be used in developing Sindhi Spell Checker which has yet not been
developed prior to this work. The compound textual forms and glyphs of Sindhi
language presents a substantial challenge for developing Sindhi spell checker
system and ... | [
{
"created": "Tue, 13 May 2014 04:33:04 GMT",
"version": "v1"
}
] | 2014-05-14 | [
[
"Bhatti",
"Zeeshan",
""
],
[
"Waqas",
"Ahmad",
""
],
[
"Ismaili",
"Imdad Ali",
""
],
[
"Hakro",
"Dil Nawaz",
""
],
[
"Soomro",
"Waseem Javaid",
""
]
] | This paper presents a novel combinational phonetic algorithm for Sindhi Language, to be used in developing Sindhi Spell Checker which has yet not been developed prior to this work. The compound textual forms and glyphs of Sindhi language presents a substantial challenge for developing Sindhi spell checker system and ge... |
1602.03644 | Jesus Arnau | Jes\'us Arnau and Italo Atzeni and Marios Kountouris | Impact of LOS/NLOS Propagation and Path Loss in Ultra-Dense Cellular
Networks | Paper presented at IEEE ICC 2016 - Wireless Communications Symposium | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Most prior work on performance analysis of ultra-dense cellular networks
(UDNs) has considered standard power-law path loss models and non-line-of-sight
(NLOS) propagation modeled by Rayleigh fading. The effect of line-of-sight
(LOS) on coverage and throughput and its implication on network densification
are still no... | [
{
"created": "Thu, 11 Feb 2016 09:09:50 GMT",
"version": "v1"
},
{
"created": "Fri, 17 Jun 2016 15:50:01 GMT",
"version": "v2"
},
{
"created": "Wed, 28 Sep 2016 15:22:46 GMT",
"version": "v3"
}
] | 2016-09-29 | [
[
"Arnau",
"Jesús",
""
],
[
"Atzeni",
"Italo",
""
],
[
"Kountouris",
"Marios",
""
]
] | Most prior work on performance analysis of ultra-dense cellular networks (UDNs) has considered standard power-law path loss models and non-line-of-sight (NLOS) propagation modeled by Rayleigh fading. The effect of line-of-sight (LOS) on coverage and throughput and its implication on network densification are still not ... |
0908.2295 | Ezra N. Hoch | Danny Dolev, Ezra N. Hoch, Yoram Moses | An Optimal Self-Stabilizing Firing Squad | Shorter version to appear in SSS09 | null | 10.1007/978-3-642-05118-0_20 | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Consider a fully connected network where up to $t$ processes may crash, and
all processes start in an arbitrary memory state. The self-stabilizing firing
squad problem consists of eventually guaranteeing simultaneous response to an
external input. This is modeled by requiring that the non-crashed processes
"fire" sim... | [
{
"created": "Mon, 17 Aug 2009 07:39:06 GMT",
"version": "v1"
}
] | 2015-05-13 | [
[
"Dolev",
"Danny",
""
],
[
"Hoch",
"Ezra N.",
""
],
[
"Moses",
"Yoram",
""
]
] | Consider a fully connected network where up to $t$ processes may crash, and all processes start in an arbitrary memory state. The self-stabilizing firing squad problem consists of eventually guaranteeing simultaneous response to an external input. This is modeled by requiring that the non-crashed processes "fire" simul... |
1111.0594 | Andrey Nikolaev | Andrey Nikolaev | Exploring Oracle RDBMS latches using Solaris DTrace | 14 pages, 6 figures, 6 tables. MEDIAS 2011 Conference. Limassol,
Cyprus | null | null | null | cs.DB cs.DC cs.PF | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Rise of hundreds cores technologies bring again to the first plan the problem
of interprocess synchronization in database engines. Spinlocks are widely used
in contemporary DBMS to synchronize processes at microsecond timescale. Latches
are Oracle RDBMS specific spinlocks. The latch contention is common to observe
in... | [
{
"created": "Wed, 2 Nov 2011 18:20:36 GMT",
"version": "v1"
}
] | 2011-11-03 | [
[
"Nikolaev",
"Andrey",
""
]
] | Rise of hundreds cores technologies bring again to the first plan the problem of interprocess synchronization in database engines. Spinlocks are widely used in contemporary DBMS to synchronize processes at microsecond timescale. Latches are Oracle RDBMS specific spinlocks. The latch contention is common to observe in c... |
1710.01692 | Dokhyam Hoshen | Dokhyam Hoshen, Michael Werman | IQ of Neural Networks | null | null | null | null | cs.LG cs.AI cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | IQ tests are an accepted method for assessing human intelligence. The tests
consist of several parts that must be solved under a time constraint. Of all
the tested abilities, pattern recognition has been found to have the highest
correlation with general intelligence. This is primarily because pattern
recognition is ... | [
{
"created": "Fri, 29 Sep 2017 11:48:58 GMT",
"version": "v1"
}
] | 2017-10-05 | [
[
"Hoshen",
"Dokhyam",
""
],
[
"Werman",
"Michael",
""
]
] | IQ tests are an accepted method for assessing human intelligence. The tests consist of several parts that must be solved under a time constraint. Of all the tested abilities, pattern recognition has been found to have the highest correlation with general intelligence. This is primarily because pattern recognition is th... |
1501.04232 | Christian Bauckhage | Christian Bauckhage, Kristian Kersting, Fabian Hadiji | Maximum Entropy Models of Shortest Path and Outbreak Distributions in
Networks | null | null | null | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Properties of networks are often characterized in terms of features such as
node degree distributions, average path lengths, diameters, or clustering
coefficients. Here, we study shortest path length distributions. On the one
hand, average as well as maximum distances can be determined therefrom; on the
other hand, t... | [
{
"created": "Sat, 17 Jan 2015 21:37:10 GMT",
"version": "v1"
}
] | 2015-01-20 | [
[
"Bauckhage",
"Christian",
""
],
[
"Kersting",
"Kristian",
""
],
[
"Hadiji",
"Fabian",
""
]
] | Properties of networks are often characterized in terms of features such as node degree distributions, average path lengths, diameters, or clustering coefficients. Here, we study shortest path length distributions. On the one hand, average as well as maximum distances can be determined therefrom; on the other hand, the... |
2107.09725 | Hung La | Ashutosh Singandhupe, Hung La, Trung Dung Ngo, Van Ho | Registration of 3D Point Sets Using Correntropy Similarity Matrix | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work focuses on Registration or Alignment of 3D point sets. Although the
Registration problem is a well established problem and it's solved using
multiple variants of Iterative Closest Point (ICP) Algorithm, most of the
approaches in the current state of the art still suffers from misalignment when
the \textit{S... | [
{
"created": "Tue, 20 Jul 2021 18:56:22 GMT",
"version": "v1"
}
] | 2021-07-22 | [
[
"Singandhupe",
"Ashutosh",
""
],
[
"La",
"Hung",
""
],
[
"Ngo",
"Trung Dung",
""
],
[
"Ho",
"Van",
""
]
] | This work focuses on Registration or Alignment of 3D point sets. Although the Registration problem is a well established problem and it's solved using multiple variants of Iterative Closest Point (ICP) Algorithm, most of the approaches in the current state of the art still suffers from misalignment when the \textit{Sou... |
1704.02373 | Achintya Sarkar | Achintya Kr. Sarkar and Zheng-Hua Tan | Time-Contrastive Learning Based DNN Bottleneck Features for
Text-Dependent Speaker Verification | null | NIPS Time Series Workshop 2017, Long Beach, CA, USA | null | null | cs.SD cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we present a time-contrastive learning (TCL) based bottleneck
(BN)feature extraction method for speech signals with an application to
text-dependent (TD) speaker verification (SV). It is well-known that speech
signals exhibit quasi-stationary behavior in and only in a short interval, and
the TCL method... | [
{
"created": "Thu, 6 Apr 2017 09:37:41 GMT",
"version": "v1"
},
{
"created": "Mon, 27 Nov 2017 16:56:31 GMT",
"version": "v2"
},
{
"created": "Sat, 11 May 2019 16:19:20 GMT",
"version": "v3"
}
] | 2019-05-14 | [
[
"Sarkar",
"Achintya Kr.",
""
],
[
"Tan",
"Zheng-Hua",
""
]
] | In this paper, we present a time-contrastive learning (TCL) based bottleneck (BN)feature extraction method for speech signals with an application to text-dependent (TD) speaker verification (SV). It is well-known that speech signals exhibit quasi-stationary behavior in and only in a short interval, and the TCL method a... |
1805.02917 | Motoki Sato | Motoki Sato, Jun Suzuki, Hiroyuki Shindo, Yuji Matsumoto | Interpretable Adversarial Perturbation in Input Embedding Space for Text | 8 pages, 4 figures | IJCAI-ECAI-2018 | null | null | cs.LG cs.CL stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Following great success in the image processing field, the idea of
adversarial training has been applied to tasks in the natural language
processing (NLP) field. One promising approach directly applies adversarial
training developed in the image processing field to the input word embedding
space instead of the discre... | [
{
"created": "Tue, 8 May 2018 09:27:46 GMT",
"version": "v1"
}
] | 2018-05-09 | [
[
"Sato",
"Motoki",
""
],
[
"Suzuki",
"Jun",
""
],
[
"Shindo",
"Hiroyuki",
""
],
[
"Matsumoto",
"Yuji",
""
]
] | Following great success in the image processing field, the idea of adversarial training has been applied to tasks in the natural language processing (NLP) field. One promising approach directly applies adversarial training developed in the image processing field to the input word embedding space instead of the discrete... |
2309.13869 | Minseok Choi | Minseok Choi, Hyesu Lim, Jaegul Choo | PRiSM: Enhancing Low-Resource Document-Level Relation Extraction with
Relation-Aware Score Calibration | Accepted to Findings of IJCNLP-AACL 2023 | null | null | null | cs.CL cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | Document-level relation extraction (DocRE) aims to extract relations of all
entity pairs in a document. A key challenge in DocRE is the cost of annotating
such data which requires intensive human effort. Thus, we investigate the case
of DocRE in a low-resource setting, and we find that existing models trained on
low ... | [
{
"created": "Mon, 25 Sep 2023 04:42:39 GMT",
"version": "v1"
}
] | 2023-10-13 | [
[
"Choi",
"Minseok",
""
],
[
"Lim",
"Hyesu",
""
],
[
"Choo",
"Jaegul",
""
]
] | Document-level relation extraction (DocRE) aims to extract relations of all entity pairs in a document. A key challenge in DocRE is the cost of annotating such data which requires intensive human effort. Thus, we investigate the case of DocRE in a low-resource setting, and we find that existing models trained on low da... |
2208.13154 | Haoxiang Wang | Haoxiang Wang, Zhanhong Jiang, Chao Liu, Soumik Sarkar, Dongxiang
Jiang, Young M. Lee | Asynchronous Training Schemes in Distributed Learning with Time Delay | This work has been submitted to the IEEE for possible publication.
Copyright may be transferred without notice, after which this version may no
longer be accessible | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the context of distributed deep learning, the issue of stale weights or
gradients could result in poor algorithmic performance. This issue is usually
tackled by delay tolerant algorithms with some mild assumptions on the
objective functions and step sizes. In this paper, we propose a different
approach to develop ... | [
{
"created": "Sun, 28 Aug 2022 07:14:59 GMT",
"version": "v1"
}
] | 2022-08-30 | [
[
"Wang",
"Haoxiang",
""
],
[
"Jiang",
"Zhanhong",
""
],
[
"Liu",
"Chao",
""
],
[
"Sarkar",
"Soumik",
""
],
[
"Jiang",
"Dongxiang",
""
],
[
"Lee",
"Young M.",
""
]
] | In the context of distributed deep learning, the issue of stale weights or gradients could result in poor algorithmic performance. This issue is usually tackled by delay tolerant algorithms with some mild assumptions on the objective functions and step sizes. In this paper, we propose a different approach to develop a ... |
1404.6218 | Ashkan Tousimojarad Mr | Ashkan Tousimojarad and Wim Vanderbauwhede | A Parallel Task-based Approach to Linear Algebra | Final version as appeared in "dx.doi.org/10.1109/ISPDC.2014.11" | Tousimojarad, A., Vanderbauwhede, W.: A parallel task-based
approach to linear algebra. In: Parallel and Distributed Computing (ISPDC),
2014 IEEE 13th International Symposium on. pp. 59-66. IEEE (2014) | 10.1109/ISPDC.2014.11 | null | cs.DC cs.PF cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Processors with large numbers of cores are becoming commonplace. In order to
take advantage of the available resources in these systems, the programming
paradigm has to move towards increased parallelism. However, increasing the
level of concurrency in the program does not necessarily lead to better
performance. Para... | [
{
"created": "Thu, 24 Apr 2014 18:39:30 GMT",
"version": "v1"
},
{
"created": "Fri, 3 Oct 2014 14:53:58 GMT",
"version": "v2"
},
{
"created": "Mon, 6 Oct 2014 15:46:24 GMT",
"version": "v3"
}
] | 2014-10-07 | [
[
"Tousimojarad",
"Ashkan",
""
],
[
"Vanderbauwhede",
"Wim",
""
]
] | Processors with large numbers of cores are becoming commonplace. In order to take advantage of the available resources in these systems, the programming paradigm has to move towards increased parallelism. However, increasing the level of concurrency in the program does not necessarily lead to better performance. Parall... |
1005.0783 | Yiwei Sun | Omer Shahid Ahmad, Faisal Alrashdi, Jason (Jun-Duo) Chen, Najah Ilham,
Jianhai Lu, Yiwei Sun, Tong Wang, Yongxin Zhu | Software Requirements Specification of the IUfA's UUIS -- a Team 2
COMP5541-W10 Project Approach | 52 pages. 51 tables, 4 figures | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the 52-page document, we describe our approach to the Software
Requirements Specification of the IUfA's UUIS prototype. This includes the
overall system description, functional requirements, non-functional
requirements, use cases, the corresponding data dictionary for all entities
involved, mock user interface (UI... | [
{
"created": "Wed, 5 May 2010 15:59:50 GMT",
"version": "v1"
},
{
"created": "Fri, 7 May 2010 15:59:22 GMT",
"version": "v2"
}
] | 2015-03-17 | [
[
"Ahmad",
"Omer Shahid",
"",
"Jun-Duo"
],
[
"Alrashdi",
"Faisal",
"",
"Jun-Duo"
],
[
"Jason",
"",
"",
"Jun-Duo"
],
[
"Chen",
"",
""
],
[
"Ilham",
"Najah",
""
],
[
"Lu",
"Jianhai",
""
],
[
"Sun",
"Yiw... | In the 52-page document, we describe our approach to the Software Requirements Specification of the IUfA's UUIS prototype. This includes the overall system description, functional requirements, non-functional requirements, use cases, the corresponding data dictionary for all entities involved, mock user interface (UI) ... |
1410.7923 | Jesper W. Mikkelsen | Jesper W. Mikkelsen | Optimal Online Edge Coloring of Planar Graphs with Advice | CIAC 2015 | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Using the framework of advice complexity, we study the amount of knowledge
about the future that an online algorithm needs to color the edges of a graph
optimally, i.e., using as few colors as possible. For graphs of maximum degree
$\Delta$, it follows from Vizing's Theorem that $O(m\log \Delta)$ bits of
advice suffi... | [
{
"created": "Wed, 29 Oct 2014 10:34:01 GMT",
"version": "v1"
},
{
"created": "Thu, 12 Feb 2015 08:20:06 GMT",
"version": "v2"
}
] | 2015-02-13 | [
[
"Mikkelsen",
"Jesper W.",
""
]
] | Using the framework of advice complexity, we study the amount of knowledge about the future that an online algorithm needs to color the edges of a graph optimally, i.e., using as few colors as possible. For graphs of maximum degree $\Delta$, it follows from Vizing's Theorem that $O(m\log \Delta)$ bits of advice suffice... |
2102.06603 | James O' Neill | James O' Neill, Danushka Bollegala | Semantically-Conditioned Negative Samples for Efficient Contrastive
Learning | null | null | null | null | cs.LG cs.CV | http://creativecommons.org/licenses/by/4.0/ | Negative sampling is a limiting factor w.r.t. the generalization of
metric-learned neural networks. We show that uniform negative sampling provides
little information about the class boundaries and thus propose three novel
techniques for efficient negative sampling: drawing negative samples from (1)
the top-$k$ most ... | [
{
"created": "Fri, 12 Feb 2021 16:26:52 GMT",
"version": "v1"
}
] | 2021-02-15 | [
[
"Neill",
"James O'",
""
],
[
"Bollegala",
"Danushka",
""
]
] | Negative sampling is a limiting factor w.r.t. the generalization of metric-learned neural networks. We show that uniform negative sampling provides little information about the class boundaries and thus propose three novel techniques for efficient negative sampling: drawing negative samples from (1) the top-$k$ most se... |
1204.4322 | David Pichardie | Thomas Jensen (INRIA Rennes), Florent Kirchner (INRIA Rennes), David
Pichardie (INRIA Rennes) | Secure the Clones | null | Logical Methods in Computer Science, Volume 8, Issue 2 (May 31,
2012) lmcs:801 | 10.2168/LMCS-8(2:5)2012 | null | cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Exchanging mutable data objects with untrusted code is a delicate matter
because of the risk of creating a data space that is accessible by an attacker.
Consequently, secure programming guidelines for Java stress the importance of
using defensive copying before accepting or handing out references to an
internal mutab... | [
{
"created": "Thu, 19 Apr 2012 11:49:03 GMT",
"version": "v1"
},
{
"created": "Wed, 30 May 2012 19:21:46 GMT",
"version": "v2"
},
{
"created": "Mon, 4 Jun 2012 10:04:07 GMT",
"version": "v3"
}
] | 2015-07-01 | [
[
"Jensen",
"Thomas",
"",
"INRIA Rennes"
],
[
"Kirchner",
"Florent",
"",
"INRIA Rennes"
],
[
"Pichardie",
"David",
"",
"INRIA Rennes"
]
] | Exchanging mutable data objects with untrusted code is a delicate matter because of the risk of creating a data space that is accessible by an attacker. Consequently, secure programming guidelines for Java stress the importance of using defensive copying before accepting or handing out references to an internal mutable... |
1901.01919 | Rui Chen | Rui Chen, Christos G. Cassandras | Optimization of Ride Sharing Systems Using Event-driven Receding Horizon
Control | 14 pages, 12 figures | null | null | null | cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We develop an event-driven Receding Horizon Control (RHC) scheme for a Ride
Sharing System (RSS) in a transportation network where vehicles are shared to
pick up and drop off passengers so as to minimize a weighted sum of passenger
waiting and traveling times. The RSS is modeled as a discrete event system and
the eve... | [
{
"created": "Mon, 7 Jan 2019 16:58:23 GMT",
"version": "v1"
},
{
"created": "Tue, 8 Jan 2019 22:40:14 GMT",
"version": "v2"
}
] | 2019-01-10 | [
[
"Chen",
"Rui",
""
],
[
"Cassandras",
"Christos G.",
""
]
] | We develop an event-driven Receding Horizon Control (RHC) scheme for a Ride Sharing System (RSS) in a transportation network where vehicles are shared to pick up and drop off passengers so as to minimize a weighted sum of passenger waiting and traveling times. The RSS is modeled as a discrete event system and the event... |
1912.07004 | Wei Quan Lim | Wei Quan Lim | Small Connected Planar Graph with 1-Cop-Move Number 4 | null | null | null | null | cs.DM math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper describes a 720-vertex connected planar graph G such that cop1(G),
denoting the minimum number of cops needed to catch the robber in the
1-cop-move game on G, is at least 4 and at most 7. Furthermore, G has a
connected subgraph H such that cop1(H) is exactly 4, meaning that 4 cops are
barely sufficient to ... | [
{
"created": "Sun, 15 Dec 2019 08:47:55 GMT",
"version": "v1"
}
] | 2019-12-17 | [
[
"Lim",
"Wei Quan",
""
]
] | This paper describes a 720-vertex connected planar graph G such that cop1(G), denoting the minimum number of cops needed to catch the robber in the 1-cop-move game on G, is at least 4 and at most 7. Furthermore, G has a connected subgraph H such that cop1(H) is exactly 4, meaning that 4 cops are barely sufficient to ca... |
1310.6173 | Pantelis Monogioudis | Carl Weaver, Pantelis Monogioudis | Self-Organizing Mobility Robustness Optimization in LTE Networks with
eICIC | 18 pages, 8 figures | null | null | null | cs.NI cs.PF cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We address the problem of Mobility Robustness Optimization (MRO) and describe
centralized Self Organizing Network (SON) solutions that can optimize
connected-mode mobility Key Performance Indicators (KPIs). Our solution extends
the earlier work of eICIC parameter optimization [7], to heterogeneous networks
with mobil... | [
{
"created": "Wed, 23 Oct 2013 10:27:49 GMT",
"version": "v1"
}
] | 2013-10-24 | [
[
"Weaver",
"Carl",
""
],
[
"Monogioudis",
"Pantelis",
""
]
] | We address the problem of Mobility Robustness Optimization (MRO) and describe centralized Self Organizing Network (SON) solutions that can optimize connected-mode mobility Key Performance Indicators (KPIs). Our solution extends the earlier work of eICIC parameter optimization [7], to heterogeneous networks with mobilit... |
1711.02760 | Christoph Trattner | Christoph Trattner, David Elsweiler | Food Recommender Systems: Important Contributions, Challenges and Future
Research Directions | null | null | null | null | cs.IR cs.CY cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The recommendation of food items is important for many reasons. Attaining
cooking inspiration via digital sources is becoming evermore popular; as are
systems, which recommend other types of food, such as meals in restaurants or
products in supermarkets. Researchers have been studying these kinds of systems
for many ... | [
{
"created": "Tue, 7 Nov 2017 22:52:12 GMT",
"version": "v1"
},
{
"created": "Fri, 10 Nov 2017 10:23:29 GMT",
"version": "v2"
}
] | 2017-11-13 | [
[
"Trattner",
"Christoph",
""
],
[
"Elsweiler",
"David",
""
]
] | The recommendation of food items is important for many reasons. Attaining cooking inspiration via digital sources is becoming evermore popular; as are systems, which recommend other types of food, such as meals in restaurants or products in supermarkets. Researchers have been studying these kinds of systems for many ye... |
2307.05914 | Weipeng Zhuo | Weipeng Zhuo, Ka Ho Chiu, Jierun Chen, Ziqi Zhao, S.-H. Gary Chan,
Sangtae Ha, Chul-Ho Lee | FIS-ONE: Floor Identification System with One Label for Crowdsourced RF
Signals | Accepted by IEEE ICDCS 2023 | null | null | null | cs.NI cs.LG eess.SP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Floor labels of crowdsourced RF signals are crucial for many smart-city
applications, such as multi-floor indoor localization, geofencing, and robot
surveillance. To build a prediction model to identify the floor number of a new
RF signal upon its measurement, conventional approaches using the crowdsourced
RF signals... | [
{
"created": "Wed, 12 Jul 2023 04:43:59 GMT",
"version": "v1"
}
] | 2023-07-13 | [
[
"Zhuo",
"Weipeng",
""
],
[
"Chiu",
"Ka Ho",
""
],
[
"Chen",
"Jierun",
""
],
[
"Zhao",
"Ziqi",
""
],
[
"Chan",
"S. -H. Gary",
""
],
[
"Ha",
"Sangtae",
""
],
[
"Lee",
"Chul-Ho",
""
]
] | Floor labels of crowdsourced RF signals are crucial for many smart-city applications, such as multi-floor indoor localization, geofencing, and robot surveillance. To build a prediction model to identify the floor number of a new RF signal upon its measurement, conventional approaches using the crowdsourced RF signals a... |
1811.01256 | Eric Rowland | Eric Rowland, Reem Yassawi | Automaticity and invariant measures of linear cellular automata | 33 pages, 8 figures; fixed some typos | Can. J. Math.-J. Can. Math. 72 (2020) 1691-1726 | 10.4153/S0008414X19000488 | null | cs.FL cs.DM math.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We show that spacetime diagrams of linear cellular automata $\Phi : {\mathbb
F}_p^{\mathbb Z} \to {\mathbb F}_p^{\mathbb Z}$ with $(-p)$-automatic initial
conditions are automatic. This extends existing results on initial conditions
which are eventually constant. Each automatic spacetime diagram defines a
$(\sigma, \... | [
{
"created": "Sat, 3 Nov 2018 17:33:02 GMT",
"version": "v1"
},
{
"created": "Thu, 14 Feb 2019 18:21:19 GMT",
"version": "v2"
},
{
"created": "Wed, 19 Feb 2020 16:40:11 GMT",
"version": "v3"
}
] | 2023-09-06 | [
[
"Rowland",
"Eric",
""
],
[
"Yassawi",
"Reem",
""
]
] | We show that spacetime diagrams of linear cellular automata $\Phi : {\mathbb F}_p^{\mathbb Z} \to {\mathbb F}_p^{\mathbb Z}$ with $(-p)$-automatic initial conditions are automatic. This extends existing results on initial conditions which are eventually constant. Each automatic spacetime diagram defines a $(\sigma, \Ph... |
2403.11878 | Jiaxiang Tang | Jiaxiang Tang, Ruijie Lu, Xiaokang Chen, Xiang Wen, Gang Zeng, Ziwei
Liu | InTeX: Interactive Text-to-texture Synthesis via Unified Depth-aware
Inpainting | Project Page: https://me.kiui.moe/intex/ | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Text-to-texture synthesis has become a new frontier in 3D content creation
thanks to the recent advances in text-to-image models. Existing methods
primarily adopt a combination of pretrained depth-aware diffusion and
inpainting models, yet they exhibit shortcomings such as 3D inconsistency and
limited controllability... | [
{
"created": "Mon, 18 Mar 2024 15:31:57 GMT",
"version": "v1"
}
] | 2024-03-19 | [
[
"Tang",
"Jiaxiang",
""
],
[
"Lu",
"Ruijie",
""
],
[
"Chen",
"Xiaokang",
""
],
[
"Wen",
"Xiang",
""
],
[
"Zeng",
"Gang",
""
],
[
"Liu",
"Ziwei",
""
]
] | Text-to-texture synthesis has become a new frontier in 3D content creation thanks to the recent advances in text-to-image models. Existing methods primarily adopt a combination of pretrained depth-aware diffusion and inpainting models, yet they exhibit shortcomings such as 3D inconsistency and limited controllability. ... |
1607.05427 | Dacheng Tao | Changxing Ding and Dacheng Tao | Trunk-Branch Ensemble Convolutional Neural Networks for Video-based Face
Recognition | Accepted Version to IEEE T-PAMI | null | 10.1109/TPAMI.2017.2700390 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Human faces in surveillance videos often suffer from severe image blur,
dramatic pose variations, and occlusion. In this paper, we propose a
comprehensive framework based on Convolutional Neural Networks (CNN) to
overcome challenges in video-based face recognition (VFR). First, to learn
blur-robust face representatio... | [
{
"created": "Tue, 19 Jul 2016 07:14:28 GMT",
"version": "v1"
},
{
"created": "Wed, 17 May 2017 09:12:19 GMT",
"version": "v2"
}
] | 2017-05-18 | [
[
"Ding",
"Changxing",
""
],
[
"Tao",
"Dacheng",
""
]
] | Human faces in surveillance videos often suffer from severe image blur, dramatic pose variations, and occlusion. In this paper, we propose a comprehensive framework based on Convolutional Neural Networks (CNN) to overcome challenges in video-based face recognition (VFR). First, to learn blur-robust face representations... |
2208.12014 | Sung Sik Nam | Sung Sik Nam, Changseok Yoon, Ki-Hong Park and Mohamed-Slim Alouini | Technical Report: Development of an Ultrahigh Bandwidth Software-defined
Radio Platform | null | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For the development of new digital signal processing systems and services,
the rapid, easy, and convenient prototyping of ideas and the rapid
time-to-market of products are becoming important with advances in technology.
Conventionally, for the development stage, particularly when confirming the
feasibility or perfor... | [
{
"created": "Thu, 25 Aug 2022 11:31:35 GMT",
"version": "v1"
},
{
"created": "Sat, 27 Aug 2022 02:34:32 GMT",
"version": "v2"
}
] | 2022-08-30 | [
[
"Nam",
"Sung Sik",
""
],
[
"Yoon",
"Changseok",
""
],
[
"Park",
"Ki-Hong",
""
],
[
"Alouini",
"Mohamed-Slim",
""
]
] | For the development of new digital signal processing systems and services, the rapid, easy, and convenient prototyping of ideas and the rapid time-to-market of products are becoming important with advances in technology. Conventionally, for the development stage, particularly when confirming the feasibility or performa... |
2306.15390 | Yanjing Li | Yanjing Li, Sheng Xu, Xianbin Cao, Li'an Zhuo, Baochang Zhang, Tian
Wang, Guodong Guo | DCP-NAS: Discrepant Child-Parent Neural Architecture Search for 1-bit
CNNs | Accepted by International Journal of Computer Vision | null | null | null | cs.CV cs.AI | http://creativecommons.org/licenses/by/4.0/ | Neural architecture search (NAS) proves to be among the effective approaches
for many tasks by generating an application-adaptive neural architecture, which
is still challenged by high computational cost and memory consumption. At the
same time, 1-bit convolutional neural networks (CNNs) with binary weights and
activ... | [
{
"created": "Tue, 27 Jun 2023 11:28:29 GMT",
"version": "v1"
}
] | 2023-06-28 | [
[
"Li",
"Yanjing",
""
],
[
"Xu",
"Sheng",
""
],
[
"Cao",
"Xianbin",
""
],
[
"Zhuo",
"Li'an",
""
],
[
"Zhang",
"Baochang",
""
],
[
"Wang",
"Tian",
""
],
[
"Guo",
"Guodong",
""
]
] | Neural architecture search (NAS) proves to be among the effective approaches for many tasks by generating an application-adaptive neural architecture, which is still challenged by high computational cost and memory consumption. At the same time, 1-bit convolutional neural networks (CNNs) with binary weights and activat... |
1605.07760 | Jens Grubert | Jens Grubert, Matthias Kranz, Aaron Quigley | Challenges in Mobile Multi-Device Ecosystems | null | mUX: The Journal of Mobile User Experience, 5(1), 1-22, 2016 | 10.1186/s13678-016-0007-y | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Coordinated multi-display environments from the desktop, second-screen to
gigapixel display walls are increasingly common. Personal and intimate mobile
and wearable devices such as head-mounted displays, smartwatches, smartphones
and tablets are rarely part of such multi-device ecosystems. With this paper,
we contrib... | [
{
"created": "Wed, 25 May 2016 07:26:02 GMT",
"version": "v1"
}
] | 2016-10-04 | [
[
"Grubert",
"Jens",
""
],
[
"Kranz",
"Matthias",
""
],
[
"Quigley",
"Aaron",
""
]
] | Coordinated multi-display environments from the desktop, second-screen to gigapixel display walls are increasingly common. Personal and intimate mobile and wearable devices such as head-mounted displays, smartwatches, smartphones and tablets are rarely part of such multi-device ecosystems. With this paper, we contribut... |
2302.08570 | Ashwin Maran | Jin-Yi Cai, Ashwin Maran | The complexity of counting planar graph homomorphisms of domain size 3 | 32 pages, 2 figures, accepted by STOC 2023 | null | null | null | cs.CC | http://creativecommons.org/licenses/by/4.0/ | We prove a complexity dichotomy theorem for counting planar graph
homomorphisms of domain size 3. Given any 3 by 3 real valued symmetric matrix
$H$ defining a graph homomorphism from all planar graphs $G \mapsto Z_H(G)$, we
completely classify the computational complexity of this problem according to
the matrix $H$. ... | [
{
"created": "Thu, 16 Feb 2023 20:33:07 GMT",
"version": "v1"
}
] | 2023-02-20 | [
[
"Cai",
"Jin-Yi",
""
],
[
"Maran",
"Ashwin",
""
]
] | We prove a complexity dichotomy theorem for counting planar graph homomorphisms of domain size 3. Given any 3 by 3 real valued symmetric matrix $H$ defining a graph homomorphism from all planar graphs $G \mapsto Z_H(G)$, we completely classify the computational complexity of this problem according to the matrix $H$. We... |
2003.07450 | Heng Chang | Heng Chang, Yu Rong, Tingyang Xu, Wenbing Huang, Somayeh Sojoudi,
Junzhou Huang, Wenwu Zhu | Spectral Graph Attention Network with Fast Eigen-approximation | Accepted by Deep Learning on Graphs: Method and Applications
(DLG-KDD21) | null | null | null | cs.LG cs.SI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Variants of Graph Neural Networks (GNNs) for representation learning have
been proposed recently and achieved fruitful results in various fields. Among
them, Graph Attention Network (GAT) first employs a self-attention strategy to
learn attention weights for each edge in the spatial domain. However, learning
the atte... | [
{
"created": "Mon, 16 Mar 2020 21:49:34 GMT",
"version": "v1"
},
{
"created": "Tue, 27 Jul 2021 11:58:57 GMT",
"version": "v2"
}
] | 2021-07-28 | [
[
"Chang",
"Heng",
""
],
[
"Rong",
"Yu",
""
],
[
"Xu",
"Tingyang",
""
],
[
"Huang",
"Wenbing",
""
],
[
"Sojoudi",
"Somayeh",
""
],
[
"Huang",
"Junzhou",
""
],
[
"Zhu",
"Wenwu",
""
]
] | Variants of Graph Neural Networks (GNNs) for representation learning have been proposed recently and achieved fruitful results in various fields. Among them, Graph Attention Network (GAT) first employs a self-attention strategy to learn attention weights for each edge in the spatial domain. However, learning the attent... |
2211.12081 | Ran Gu | Ran Gu, Guotai Wang, Jiangshan Lu, Jingyang Zhang, Wenhui Lei, Yinan
Chen, Wenjun Liao, Shichuan Zhang, Kang Li, Dimitris N. Metaxas, Shaoting
Zhang | CDDSA: Contrastive Domain Disentanglement and Style Augmentation for
Generalizable Medical Image Segmentation | 14 pages, 8 figures | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Generalization to previously unseen images with potential domain shifts and
different styles is essential for clinically applicable medical image
segmentation, and the ability to disentangle domain-specific and
domain-invariant features is key for achieving Domain Generalization (DG).
However, existing DG methods can... | [
{
"created": "Tue, 22 Nov 2022 08:25:35 GMT",
"version": "v1"
}
] | 2022-11-23 | [
[
"Gu",
"Ran",
""
],
[
"Wang",
"Guotai",
""
],
[
"Lu",
"Jiangshan",
""
],
[
"Zhang",
"Jingyang",
""
],
[
"Lei",
"Wenhui",
""
],
[
"Chen",
"Yinan",
""
],
[
"Liao",
"Wenjun",
""
],
[
"Zhang",
"Shich... | Generalization to previously unseen images with potential domain shifts and different styles is essential for clinically applicable medical image segmentation, and the ability to disentangle domain-specific and domain-invariant features is key for achieving Domain Generalization (DG). However, existing DG methods can h... |
0711.4324 | Jinshan Zhang | Jinshan Zhang | Report on "American Option Pricing and Hedging Strategies" | 14pages | null | null | null | cs.CE cs.DM | null | This paper mainly discusses the American option's hedging strategies via
binomialmodel and the basic idea of pricing and hedging American option.
Although the essential scheme of hedging is almost the same as European option,
small differences may arise when simulating the process for American option
holder has more ... | [
{
"created": "Tue, 27 Nov 2007 18:34:40 GMT",
"version": "v1"
}
] | 2007-11-28 | [
[
"Zhang",
"Jinshan",
""
]
] | This paper mainly discusses the American option's hedging strategies via binomialmodel and the basic idea of pricing and hedging American option. Although the essential scheme of hedging is almost the same as European option, small differences may arise when simulating the process for American option holder has more ri... |
2211.00262 | Elad Segal | Elad Segal, Ben Bogin, Jonathan Berant | Training Vision-Language Models with Less Bimodal Supervision | AKBC 2022 | null | null | null | cs.CL cs.CV | http://creativecommons.org/licenses/by/4.0/ | Standard practice in pretraining multimodal models, such as vision-language
models, is to rely on pairs of aligned inputs from both modalities, for
example, aligned image-text pairs. However, such pairs can be difficult to
obtain in low-resource settings and for some modality pairs (e.g., structured
tables and images... | [
{
"created": "Tue, 1 Nov 2022 04:07:11 GMT",
"version": "v1"
}
] | 2022-11-02 | [
[
"Segal",
"Elad",
""
],
[
"Bogin",
"Ben",
""
],
[
"Berant",
"Jonathan",
""
]
] | Standard practice in pretraining multimodal models, such as vision-language models, is to rely on pairs of aligned inputs from both modalities, for example, aligned image-text pairs. However, such pairs can be difficult to obtain in low-resource settings and for some modality pairs (e.g., structured tables and images).... |
1711.01068 | Raphael Shu | Raphael Shu, Hideki Nakayama | Compressing Word Embeddings via Deep Compositional Code Learning | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Natural language processing (NLP) models often require a massive number of
parameters for word embeddings, resulting in a large storage or memory
footprint. Deploying neural NLP models to mobile devices requires compressing
the word embeddings without any significant sacrifices in performance. For this
purpose, we pr... | [
{
"created": "Fri, 3 Nov 2017 09:05:44 GMT",
"version": "v1"
},
{
"created": "Fri, 17 Nov 2017 15:31:45 GMT",
"version": "v2"
}
] | 2017-11-20 | [
[
"Shu",
"Raphael",
""
],
[
"Nakayama",
"Hideki",
""
]
] | Natural language processing (NLP) models often require a massive number of parameters for word embeddings, resulting in a large storage or memory footprint. Deploying neural NLP models to mobile devices requires compressing the word embeddings without any significant sacrifices in performance. For this purpose, we prop... |
1109.4323 | Adrien Poteaux | Adrien Poteaux, \'Eric Schost | On the complexity of computing with zero-dimensional triangular sets | null | null | null | null | cs.SC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the complexity of some fundamental operations for triangular sets in
dimension zero. Using Las-Vegas algorithms, we prove that one can perform such
operations as change of order, equiprojectable decomposition, or quasi-inverse
computation with a cost that is essentially that of modular composition. Over
an a... | [
{
"created": "Tue, 20 Sep 2011 15:34:04 GMT",
"version": "v1"
}
] | 2011-09-21 | [
[
"Poteaux",
"Adrien",
""
],
[
"Schost",
"Éric",
""
]
] | We study the complexity of some fundamental operations for triangular sets in dimension zero. Using Las-Vegas algorithms, we prove that one can perform such operations as change of order, equiprojectable decomposition, or quasi-inverse computation with a cost that is essentially that of modular composition. Over an abs... |
2101.01115 | Yunus Camg\"ozl\"u | Yunus Camg\"ozl\"u, Yakup Kutlu | Analysis of Filter Size Effect In Deep Learning | 10 Pages, 9 Figures, Journal of Artificial Intelligence with
Applications, published | Journal of Artificial Intelligence with Applications, 1(1), 20-29,
2020 | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | With the use of deep learning in many areas, how to improve this technology
or how to develop the structure used more effectively and in a shorter time is
an issue that is of interest to many people working in this field. Many studies
are carried out on this subject, it is aimed to reduce the duration of the
operatio... | [
{
"created": "Sat, 12 Dec 2020 11:05:47 GMT",
"version": "v1"
}
] | 2021-01-05 | [
[
"Camgözlü",
"Yunus",
""
],
[
"Kutlu",
"Yakup",
""
]
] | With the use of deep learning in many areas, how to improve this technology or how to develop the structure used more effectively and in a shorter time is an issue that is of interest to many people working in this field. Many studies are carried out on this subject, it is aimed to reduce the duration of the operation ... |
2208.10188 | Soura Sena Das | Soura Sena Das, Soumen Nandi and Sagnik Sen | The oriented relative clique number of triangle-free planar graphs is 10 | null | null | null | null | cs.DM math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In relation to oriented coloring and chromatic number, the parameter oriented
relative clique number of an oriented graph $\overrightarrow{G}$, denoted by
$\omega_{ro}(\overrightarrow{G})$, is the main focus of this work. We solve an
open problem mentioned in the recent survey on oriented coloring by Sopena
(Discrete... | [
{
"created": "Mon, 22 Aug 2022 10:13:48 GMT",
"version": "v1"
}
] | 2022-08-23 | [
[
"Das",
"Soura Sena",
""
],
[
"Nandi",
"Soumen",
""
],
[
"Sen",
"Sagnik",
""
]
] | In relation to oriented coloring and chromatic number, the parameter oriented relative clique number of an oriented graph $\overrightarrow{G}$, denoted by $\omega_{ro}(\overrightarrow{G})$, is the main focus of this work. We solve an open problem mentioned in the recent survey on oriented coloring by Sopena (Discrete M... |
2311.17080 | Weihao Qiu | Weihao Qiu, George Legrady | Combating the "Sameness" in AI Art: Reflections on the Interactive AI
Installation Fencing Hallucination | Paper for NeurIPS 2023 Workshop, Machine Learning for Creativity and
Design | null | null | null | cs.CV cs.AI | http://creativecommons.org/licenses/by-nc-nd/4.0/ | The article summarizes three types of "sameness" issues in Artificial
Intelligence(AI) art, each occurring at different stages of development in AI
image creation tools. Through the Fencing Hallucination project, the article
reflects on the design of AI art production in alleviating the sense of
uniformity, maintaini... | [
{
"created": "Tue, 28 Nov 2023 00:00:34 GMT",
"version": "v1"
}
] | 2023-11-30 | [
[
"Qiu",
"Weihao",
""
],
[
"Legrady",
"George",
""
]
] | The article summarizes three types of "sameness" issues in Artificial Intelligence(AI) art, each occurring at different stages of development in AI image creation tools. Through the Fencing Hallucination project, the article reflects on the design of AI art production in alleviating the sense of uniformity, maintaining... |
1805.10338 | Lierni Sestorain | Lierni Sestorain and Massimiliano Ciaramita and Christian Buck and
Thomas Hofmann | Zero-Shot Dual Machine Translation | null | null | null | null | cs.CL cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Neural Machine Translation (NMT) systems rely on large amounts of parallel
data. This is a major challenge for low-resource languages. Building on recent
work on unsupervised and semi-supervised methods, we present an approach that
combines zero-shot and dual learning. The latter relies on reinforcement
learning, to ... | [
{
"created": "Fri, 25 May 2018 19:27:43 GMT",
"version": "v1"
}
] | 2018-05-29 | [
[
"Sestorain",
"Lierni",
""
],
[
"Ciaramita",
"Massimiliano",
""
],
[
"Buck",
"Christian",
""
],
[
"Hofmann",
"Thomas",
""
]
] | Neural Machine Translation (NMT) systems rely on large amounts of parallel data. This is a major challenge for low-resource languages. Building on recent work on unsupervised and semi-supervised methods, we present an approach that combines zero-shot and dual learning. The latter relies on reinforcement learning, to ex... |
2302.09699 | Daogao Liu | Arun Ganesh, Daogao Liu, Sewoong Oh, Abhradeep Thakurta | Private (Stochastic) Non-Convex Optimization Revisited: Second-Order
Stationary Points and Excess Risks | null | null | null | null | cs.LG cs.CR math.OC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the problem of minimizing a non-convex objective while preserving
the privacy of the examples in the training data. Building upon the previous
variance-reduced algorithm SpiderBoost, we introduce a new framework that
utilizes two different kinds of gradient oracles. The first kind of oracles can
estimate ... | [
{
"created": "Mon, 20 Feb 2023 00:11:19 GMT",
"version": "v1"
}
] | 2023-02-21 | [
[
"Ganesh",
"Arun",
""
],
[
"Liu",
"Daogao",
""
],
[
"Oh",
"Sewoong",
""
],
[
"Thakurta",
"Abhradeep",
""
]
] | We consider the problem of minimizing a non-convex objective while preserving the privacy of the examples in the training data. Building upon the previous variance-reduced algorithm SpiderBoost, we introduce a new framework that utilizes two different kinds of gradient oracles. The first kind of oracles can estimate th... |
2209.04376 | Elnaz Rabieinejad | Lulit Asfaw (College of Computing and Software Engineering, Kennesaw
State University, Marietta, GA, USA), Mikael Clemmons (College of Computing
and Software Engineering, Kennesaw State University, Marietta, GA, USA), Cody
Hayes (College of Computing and Software Engineering, Kennesaw State
University, Marietta... | Challenges of Implementing Agile Processes in Remote-First Companies | null | null | null | null | cs.SE cs.CY | http://creativecommons.org/licenses/by/4.0/ | The trend of remote work, especially in the IT sector, has been on the rise
in recent years, and its popularity has especially increased since the COVID-19
pandemic. In addition to adopting remote work, companies also have been
migrating toward managing their projects using agile processes. Agile processes
promote sm... | [
{
"created": "Fri, 9 Sep 2022 16:20:04 GMT",
"version": "v1"
}
] | 2022-09-12 | [
[
"Asfaw",
"Lulit",
"",
"College of Computing and Software Engineering, Kennesaw\n State University, Marietta, GA, USA"
],
[
"Clemmons",
"Mikael",
"",
"College of Computing\n and Software Engineering, Kennesaw State University, Marietta, GA, USA"
],
[
"Hayes",
"Cody... | The trend of remote work, especially in the IT sector, has been on the rise in recent years, and its popularity has especially increased since the COVID-19 pandemic. In addition to adopting remote work, companies also have been migrating toward managing their projects using agile processes. Agile processes promote smal... |
2106.03242 | Elahe Arani | Ahmed Badar, Arnav Varma, Adrian Staniec, Mahmoud Gamal, Omar Magdy,
Haris Iqbal, Elahe Arani and Bahram Zonooz | Highlighting the Importance of Reducing Research Bias and Carbon
Emissions in CNNs | null | null | null | null | cs.CV cs.AI | http://creativecommons.org/licenses/by/4.0/ | Convolutional neural networks (CNNs) have become commonplace in addressing
major challenges in computer vision. Researchers are not only coming up with
new CNN architectures but are also researching different techniques to improve
the performance of existing architectures. However, there is a tendency to
over-emphasi... | [
{
"created": "Sun, 6 Jun 2021 20:42:00 GMT",
"version": "v1"
}
] | 2021-06-08 | [
[
"Badar",
"Ahmed",
""
],
[
"Varma",
"Arnav",
""
],
[
"Staniec",
"Adrian",
""
],
[
"Gamal",
"Mahmoud",
""
],
[
"Magdy",
"Omar",
""
],
[
"Iqbal",
"Haris",
""
],
[
"Arani",
"Elahe",
""
],
[
"Zonooz",
... | Convolutional neural networks (CNNs) have become commonplace in addressing major challenges in computer vision. Researchers are not only coming up with new CNN architectures but are also researching different techniques to improve the performance of existing architectures. However, there is a tendency to over-emphasize... |
2201.12179 | Lukas Struppek | Lukas Struppek, Dominik Hintersdorf, Antonio De Almeida Correia,
Antonia Adler, Kristian Kersting | Plug & Play Attacks: Towards Robust and Flexible Model Inversion Attacks | Accepted by ICML 2022 | null | null | null | cs.LG cs.AI cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Model inversion attacks (MIAs) aim to create synthetic images that reflect
the class-wise characteristics from a target classifier's private training data
by exploiting the model's learned knowledge. Previous research has developed
generative MIAs that use generative adversarial networks (GANs) as image priors
tailor... | [
{
"created": "Fri, 28 Jan 2022 15:25:50 GMT",
"version": "v1"
},
{
"created": "Wed, 2 Feb 2022 15:21:17 GMT",
"version": "v2"
},
{
"created": "Tue, 7 Jun 2022 16:15:28 GMT",
"version": "v3"
},
{
"created": "Thu, 9 Jun 2022 08:48:08 GMT",
"version": "v4"
}
] | 2022-06-10 | [
[
"Struppek",
"Lukas",
""
],
[
"Hintersdorf",
"Dominik",
""
],
[
"Correia",
"Antonio De Almeida",
""
],
[
"Adler",
"Antonia",
""
],
[
"Kersting",
"Kristian",
""
]
] | Model inversion attacks (MIAs) aim to create synthetic images that reflect the class-wise characteristics from a target classifier's private training data by exploiting the model's learned knowledge. Previous research has developed generative MIAs that use generative adversarial networks (GANs) as image priors tailored... |
2212.14133 | Andrew O'Brien | Andrew O'Brien, Rosina Weber, Edward Kim | Investigating Sindy As a Tool For Causal Discovery In Time Series
Signals | null | null | null | null | cs.LG stat.ME | http://creativecommons.org/licenses/by/4.0/ | The SINDy algorithm has been successfully used to identify the governing
equations of dynamical systems from time series data. In this paper, we argue
that this makes SINDy a potentially useful tool for causal discovery and that
existing tools for causal discovery can be used to dramatically improve the
performance o... | [
{
"created": "Thu, 29 Dec 2022 00:32:24 GMT",
"version": "v1"
}
] | 2023-01-02 | [
[
"O'Brien",
"Andrew",
""
],
[
"Weber",
"Rosina",
""
],
[
"Kim",
"Edward",
""
]
] | The SINDy algorithm has been successfully used to identify the governing equations of dynamical systems from time series data. In this paper, we argue that this makes SINDy a potentially useful tool for causal discovery and that existing tools for causal discovery can be used to dramatically improve the performance of ... |
2112.11190 | Omid Ziaee | Omid Ziaee, Mohsen Hamedi | Augmented reality applications in manufacturing and its future scope in
Industry 4.0 | null | null | null | null | cs.CY | http://creativecommons.org/licenses/by/4.0/ | Augmented reality technology is one of the leading technologies in the
context of Industry 4.0. The promising potential application of augmented
reality in industrial production systems has received much attention, which led
to the concept of industrial augmented reality. On the one hand, this
technology provides a s... | [
{
"created": "Fri, 3 Dec 2021 20:46:50 GMT",
"version": "v1"
}
] | 2021-12-22 | [
[
"Ziaee",
"Omid",
""
],
[
"Hamedi",
"Mohsen",
""
]
] | Augmented reality technology is one of the leading technologies in the context of Industry 4.0. The promising potential application of augmented reality in industrial production systems has received much attention, which led to the concept of industrial augmented reality. On the one hand, this technology provides a sui... |
1902.00389 | Francesco Restuccia | Salvatore D'Oro and Francesco Restuccia and Alessandro Talamonti and
Tommaso Melodia | The Slice Is Served: Enforcing Radio Access Network Slicing in
Virtualized 5G Systems | Accepted for publication in IEEE INFOCOM 2019 | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The notions of softwarization and virtualization of the radio access network
(RAN) of next-generation (5G) wireless systems are ushering in a vision where
applications and services are physically decoupled from devices and network
infrastructure. This crucial aspect will ultimately enable the dynamic
deployment of he... | [
{
"created": "Fri, 1 Feb 2019 15:06:28 GMT",
"version": "v1"
}
] | 2019-02-04 | [
[
"D'Oro",
"Salvatore",
""
],
[
"Restuccia",
"Francesco",
""
],
[
"Talamonti",
"Alessandro",
""
],
[
"Melodia",
"Tommaso",
""
]
] | The notions of softwarization and virtualization of the radio access network (RAN) of next-generation (5G) wireless systems are ushering in a vision where applications and services are physically decoupled from devices and network infrastructure. This crucial aspect will ultimately enable the dynamic deployment of hete... |
2202.01115 | Saeed Boor Boor | Saeed Boorboor, Shawn Mathew, Mala Ananth, David Talmage, Lorna W.
Role, Arie E. Kaufman | NeuRegenerate: A Framework for Visualizing Neurodegeneration | Accepted for publication in IEEE Transactions on Visualization and
Computer Graphics | null | 10.1109/TVCG.2021.3127132 | null | cs.LG cs.GR cs.HC eess.IV q-bio.NC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent advances in high-resolution microscopy have allowed scientists to
better understand the underlying brain connectivity. However, due to the
limitation that biological specimens can only be imaged at a single timepoint,
studying changes to neural projections is limited to general observations using
population an... | [
{
"created": "Wed, 2 Feb 2022 16:21:14 GMT",
"version": "v1"
}
] | 2022-02-03 | [
[
"Boorboor",
"Saeed",
""
],
[
"Mathew",
"Shawn",
""
],
[
"Ananth",
"Mala",
""
],
[
"Talmage",
"David",
""
],
[
"Role",
"Lorna W.",
""
],
[
"Kaufman",
"Arie E.",
""
]
] | Recent advances in high-resolution microscopy have allowed scientists to better understand the underlying brain connectivity. However, due to the limitation that biological specimens can only be imaged at a single timepoint, studying changes to neural projections is limited to general observations using population anal... |
2306.04968 | Jun Zhao | Jun Zhao, Yongxin Zhang, Qi Zhang, Tao Gui, Zhongyu Wei, Minlong Peng,
Mingming Sun | Actively Supervised Clustering for Open Relation Extraction | Accepted by ACL2023 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Current clustering-based Open Relation Extraction (OpenRE) methods usually
adopt a two-stage pipeline. The first stage simultaneously learns relation
representations and assignments. The second stage manually labels several
instances and thus names the relation for each cluster. However, unsupervised
objectives strug... | [
{
"created": "Thu, 8 Jun 2023 06:55:02 GMT",
"version": "v1"
}
] | 2023-06-09 | [
[
"Zhao",
"Jun",
""
],
[
"Zhang",
"Yongxin",
""
],
[
"Zhang",
"Qi",
""
],
[
"Gui",
"Tao",
""
],
[
"Wei",
"Zhongyu",
""
],
[
"Peng",
"Minlong",
""
],
[
"Sun",
"Mingming",
""
]
] | Current clustering-based Open Relation Extraction (OpenRE) methods usually adopt a two-stage pipeline. The first stage simultaneously learns relation representations and assignments. The second stage manually labels several instances and thus names the relation for each cluster. However, unsupervised objectives struggl... |
1709.05038 | Yang Xian | Yang Xian, Yingli Tian | Self-Guiding Multimodal LSTM - when we do not have a perfect training
dataset for image captioning | The paper is under consideration at Computer Vision and Image
Understanding | null | null | null | cs.CV cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, a self-guiding multimodal LSTM (sg-LSTM) image captioning
model is proposed to handle uncontrolled imbalanced real-world image-sentence
dataset. We collect FlickrNYC dataset from Flickr as our testbed with 306,165
images and the original text descriptions uploaded by the users are utilized as
the groun... | [
{
"created": "Fri, 15 Sep 2017 02:53:16 GMT",
"version": "v1"
}
] | 2017-09-18 | [
[
"Xian",
"Yang",
""
],
[
"Tian",
"Yingli",
""
]
] | In this paper, a self-guiding multimodal LSTM (sg-LSTM) image captioning model is proposed to handle uncontrolled imbalanced real-world image-sentence dataset. We collect FlickrNYC dataset from Flickr as our testbed with 306,165 images and the original text descriptions uploaded by the users are utilized as the ground ... |
2109.14065 | Subodh Mishra | Subodh Mishra, Armin Parchami, Enrique Corona, Punarjay Chakravarty,
Ankit Vora, Devarth Parikh, Gaurav Pandey | Localization of a Smart Infrastructure Fisheye Camera in a Prior Map for
Autonomous Vehicles | Submitted to ICRA 2022 | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work presents a technique for localization of a smart infrastructure
node, consisting of a fisheye camera, in a prior map. These cameras can detect
objects that are outside the line of sight of the autonomous vehicles (AV) and
send that information to AVs using V2X technology. However, in order for this
informat... | [
{
"created": "Tue, 28 Sep 2021 21:57:35 GMT",
"version": "v1"
}
] | 2021-09-30 | [
[
"Mishra",
"Subodh",
""
],
[
"Parchami",
"Armin",
""
],
[
"Corona",
"Enrique",
""
],
[
"Chakravarty",
"Punarjay",
""
],
[
"Vora",
"Ankit",
""
],
[
"Parikh",
"Devarth",
""
],
[
"Pandey",
"Gaurav",
""
]
] | This work presents a technique for localization of a smart infrastructure node, consisting of a fisheye camera, in a prior map. These cameras can detect objects that are outside the line of sight of the autonomous vehicles (AV) and send that information to AVs using V2X technology. However, in order for this informatio... |
1211.2287 | Jie Xu | Jie Xu, Yu Zhang and Mihaela van der Schaar | Designing Rating Systems to Promote Mutual Security for Interconnected
Networks | null | null | null | null | cs.GT cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Interconnected autonomous systems often share security risks. However, an
autonomous system lacks the incentive to make (sufficient) security investments
if the cost exceeds its own benefit even though doing that would be socially
beneficial. In this paper, we develop a systematic and rigorous framework for
analyzing... | [
{
"created": "Sat, 10 Nov 2012 03:36:00 GMT",
"version": "v1"
}
] | 2012-11-13 | [
[
"Xu",
"Jie",
""
],
[
"Zhang",
"Yu",
""
],
[
"van der Schaar",
"Mihaela",
""
]
] | Interconnected autonomous systems often share security risks. However, an autonomous system lacks the incentive to make (sufficient) security investments if the cost exceeds its own benefit even though doing that would be socially beneficial. In this paper, we develop a systematic and rigorous framework for analyzing a... |
2108.05781 | Hamed Ahmadi | Hamed Ahmadi, Avishek Nag, Zaheer Khan, Kamran Sayrafian, Susanto
Rahadrja | Networked Twins and Twins of Networks: an Overview on the Relationship
Between Digital Twins and 6G | Accepted for publication at IEEE Communications Standards Magazine | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Digital Twin (DT) is a promising technology for the new immersive digital
life with a variety of applications in areas such as Industry 4.0, aviation,
and healthcare. Proliferation of this technology requires higher data rates,
reliability, resilience, and lower latency beyond what is currently offered by
5G. Thus, D... | [
{
"created": "Thu, 12 Aug 2021 14:47:34 GMT",
"version": "v1"
}
] | 2021-08-13 | [
[
"Ahmadi",
"Hamed",
""
],
[
"Nag",
"Avishek",
""
],
[
"Khan",
"Zaheer",
""
],
[
"Sayrafian",
"Kamran",
""
],
[
"Rahadrja",
"Susanto",
""
]
] | Digital Twin (DT) is a promising technology for the new immersive digital life with a variety of applications in areas such as Industry 4.0, aviation, and healthcare. Proliferation of this technology requires higher data rates, reliability, resilience, and lower latency beyond what is currently offered by 5G. Thus, DT ... |
1604.05747 | Francesco Maria Elia | Francesco Elia | Syntactic and semantic classification of verb arguments using
dependency-based and rich semantic features | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Corpus Pattern Analysis (CPA) has been the topic of Semeval 2015 Task 15,
aimed at producing a system that can aid lexicographers in their efforts to
build a dictionary of meanings for English verbs using the CPA annotation
process. CPA parsing is one of the subtasks which this annotation process is
made of and it is... | [
{
"created": "Tue, 19 Apr 2016 20:59:32 GMT",
"version": "v1"
}
] | 2016-04-21 | [
[
"Elia",
"Francesco",
""
]
] | Corpus Pattern Analysis (CPA) has been the topic of Semeval 2015 Task 15, aimed at producing a system that can aid lexicographers in their efforts to build a dictionary of meanings for English verbs using the CPA annotation process. CPA parsing is one of the subtasks which this annotation process is made of and it is t... |
2303.04835 | Alexandra Bremers | Alexandra Bremers, Maria Teresa Parreira, Xuanyu Fang, Natalie
Friedman, Adolfo Ramirez-Aristizabal, Alexandria Pabst, Mirjana Spasojevic,
Michael Kuniavsky, Wendy Ju | The Bystander Affect Detection (BAD) Dataset for Failure Detection in
HRI | 12 pages | null | null | null | cs.RO cs.HC | http://creativecommons.org/licenses/by/4.0/ | For a robot to repair its own error, it must first know it has made a
mistake. One way that people detect errors is from the implicit reactions from
bystanders -- their confusion, smirks, or giggles clue us in that something
unexpected occurred. To enable robots to detect and act on bystander responses
to task failur... | [
{
"created": "Wed, 8 Mar 2023 19:13:18 GMT",
"version": "v1"
}
] | 2023-03-10 | [
[
"Bremers",
"Alexandra",
""
],
[
"Parreira",
"Maria Teresa",
""
],
[
"Fang",
"Xuanyu",
""
],
[
"Friedman",
"Natalie",
""
],
[
"Ramirez-Aristizabal",
"Adolfo",
""
],
[
"Pabst",
"Alexandria",
""
],
[
"Spasojevic",
... | For a robot to repair its own error, it must first know it has made a mistake. One way that people detect errors is from the implicit reactions from bystanders -- their confusion, smirks, or giggles clue us in that something unexpected occurred. To enable robots to detect and act on bystander responses to task failures... |
2306.05815 | Francesco Tonin | Francesco Tonin, Alex Lambert, Panagiotis Patrinos, Johan A. K.
Suykens | Extending Kernel PCA through Dualization: Sparsity, Robustness and Fast
Algorithms | 15 pages, ICML 2023 | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The goal of this paper is to revisit Kernel Principal Component Analysis
(KPCA) through dualization of a difference of convex functions. This allows to
naturally extend KPCA to multiple objective functions and leads to efficient
gradient-based algorithms avoiding the expensive SVD of the Gram matrix.
Particularly, we... | [
{
"created": "Fri, 9 Jun 2023 11:27:35 GMT",
"version": "v1"
}
] | 2023-06-12 | [
[
"Tonin",
"Francesco",
""
],
[
"Lambert",
"Alex",
""
],
[
"Patrinos",
"Panagiotis",
""
],
[
"Suykens",
"Johan A. K.",
""
]
] | The goal of this paper is to revisit Kernel Principal Component Analysis (KPCA) through dualization of a difference of convex functions. This allows to naturally extend KPCA to multiple objective functions and leads to efficient gradient-based algorithms avoiding the expensive SVD of the Gram matrix. Particularly, we c... |
1611.08103 | Guangming Lang | Guangming Lang | Double-quantitative $\gamma^{\ast}-$fuzzy coverings approximation
operators | It enriches the fuzzy covering rough set theory | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In digital-based information boom, the fuzzy covering rough set model is an
important mathematical tool for artificial intelligence, and how to build the
bridge between the fuzzy covering rough set theory and Pawlak's model is
becoming a hot research topic. In this paper, we first present the
$\gamma-$fuzzy covering ... | [
{
"created": "Thu, 24 Nov 2016 09:06:57 GMT",
"version": "v1"
}
] | 2016-11-28 | [
[
"Lang",
"Guangming",
""
]
] | In digital-based information boom, the fuzzy covering rough set model is an important mathematical tool for artificial intelligence, and how to build the bridge between the fuzzy covering rough set theory and Pawlak's model is becoming a hot research topic. In this paper, we first present the $\gamma-$fuzzy covering ba... |
2407.11217 | David Saulpic | Max Dupr\'e la Tour, David Saulpic | Almost-linear Time Approximation Algorithm to Euclidean $k$-median and
$k$-means | null | null | null | null | cs.DS cs.AI | http://creativecommons.org/licenses/by/4.0/ | Clustering is one of the staples of data analysis and unsupervised learning.
As such, clustering algorithms are often used on massive data sets, and they
need to be extremely fast. We focus on the Euclidean $k$-median and $k$-means
problems, two of the standard ways to model the task of clustering.
For these, the g... | [
{
"created": "Mon, 15 Jul 2024 20:04:06 GMT",
"version": "v1"
}
] | 2024-07-17 | [
[
"la Tour",
"Max Dupré",
""
],
[
"Saulpic",
"David",
""
]
] | Clustering is one of the staples of data analysis and unsupervised learning. As such, clustering algorithms are often used on massive data sets, and they need to be extremely fast. We focus on the Euclidean $k$-median and $k$-means problems, two of the standard ways to model the task of clustering. For these, the go-to... |
2006.13063 | Gabriel De Souza Pereira Moreira | Gabriel de Souza P. Moreira, Dietmar Jannach, Adilson Marques da Cunha | Hybrid Session-based News Recommendation using Recurrent Neural Networks | From the Proceeding of the LatinX in AI Research (LXAI) at ICML 2020.
arXiv admin note: text overlap with arXiv:1904.10367 | null | null | null | cs.LG cs.IR stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We describe a hybrid meta-architecture -- the CHAMELEON -- for session-based
news recommendation that is able to leverage a variety of information types
using Recurrent Neural Networks. We evaluated our approach on two public
datasets, using a temporal evaluation protocol that simulates the dynamics of a
news portal ... | [
{
"created": "Mon, 22 Jun 2020 17:24:43 GMT",
"version": "v1"
}
] | 2020-06-24 | [
[
"Moreira",
"Gabriel de Souza P.",
""
],
[
"Jannach",
"Dietmar",
""
],
[
"da Cunha",
"Adilson Marques",
""
]
] | We describe a hybrid meta-architecture -- the CHAMELEON -- for session-based news recommendation that is able to leverage a variety of information types using Recurrent Neural Networks. We evaluated our approach on two public datasets, using a temporal evaluation protocol that simulates the dynamics of a news portal in... |
1803.03586 | Qi Zhang | Qi Zhang, Jianhui Liu, and Guodong Zhao | Towards 5G Enabled Tactile Robotic Telesurgery | null | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Robotic telesurgery has a potential to provide extreme and urgent health care
services and bring unprecedented opportunities to deliver highly specialized
skills globally. It has a significant societal impact and is regarded as one of
the appealing use cases of Tactile Internet and 5G applications. However, the
perfo... | [
{
"created": "Fri, 9 Mar 2018 16:16:42 GMT",
"version": "v1"
}
] | 2018-03-12 | [
[
"Zhang",
"Qi",
""
],
[
"Liu",
"Jianhui",
""
],
[
"Zhao",
"Guodong",
""
]
] | Robotic telesurgery has a potential to provide extreme and urgent health care services and bring unprecedented opportunities to deliver highly specialized skills globally. It has a significant societal impact and is regarded as one of the appealing use cases of Tactile Internet and 5G applications. However, the perform... |
2212.06123 | Ambra Demontis Ph.D. | Ambra Demontis, Maura Pintor, Luca Demetrio, Kathrin Grosse,
Hsiao-Ying Lin, Chengfang Fang, Battista Biggio, Fabio Roli | A Survey on Reinforcement Learning Security with Application to
Autonomous Driving | null | null | null | null | cs.LG cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Reinforcement learning allows machines to learn from their own experience.
Nowadays, it is used in safety-critical applications, such as autonomous
driving, despite being vulnerable to attacks carefully crafted to either
prevent that the reinforcement learning algorithm learns an effective and
reliable policy, or to ... | [
{
"created": "Mon, 12 Dec 2022 18:50:49 GMT",
"version": "v1"
}
] | 2022-12-13 | [
[
"Demontis",
"Ambra",
""
],
[
"Pintor",
"Maura",
""
],
[
"Demetrio",
"Luca",
""
],
[
"Grosse",
"Kathrin",
""
],
[
"Lin",
"Hsiao-Ying",
""
],
[
"Fang",
"Chengfang",
""
],
[
"Biggio",
"Battista",
""
],
[
... | Reinforcement learning allows machines to learn from their own experience. Nowadays, it is used in safety-critical applications, such as autonomous driving, despite being vulnerable to attacks carefully crafted to either prevent that the reinforcement learning algorithm learns an effective and reliable policy, or to in... |
2211.09171 | Fabio Saggese | Fabio Saggese, Federico Chiariotti, Kimmo Kansanen, Petar Popovski | Efficient URLLC with a Reconfigurable Intelligent Surface and Imperfect
Device Tracking | Submitted to ICC 2023, the copyright may be transferred without
further notice | null | null | null | cs.IT math.IT math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The use of Reconfigurable Intelligent Surfaces (RIS) technology to extend
coverage and allow for better control of the wireless environment has been
proposed in several use cases, including Ultra-Reliable Low-Latency
Communications (URLLC), communications. However, the extremely challenging
latency constraint makes e... | [
{
"created": "Wed, 16 Nov 2022 19:41:15 GMT",
"version": "v1"
}
] | 2022-11-18 | [
[
"Saggese",
"Fabio",
""
],
[
"Chiariotti",
"Federico",
""
],
[
"Kansanen",
"Kimmo",
""
],
[
"Popovski",
"Petar",
""
]
] | The use of Reconfigurable Intelligent Surfaces (RIS) technology to extend coverage and allow for better control of the wireless environment has been proposed in several use cases, including Ultra-Reliable Low-Latency Communications (URLLC), communications. However, the extremely challenging latency constraint makes exp... |
1210.2984 | Francesca A. Lisi | Francesca A. Lisi | Learning Onto-Relational Rules with Inductive Logic Programming | 18 pages. arXiv admin note: text overlap with arXiv:1003.2586 | null | null | null | cs.AI cs.DB cs.LG cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Rules complement and extend ontologies on the Semantic Web. We refer to these
rules as onto-relational since they combine DL-based ontology languages and
Knowledge Representation formalisms supporting the relational data model within
the tradition of Logic Programming and Deductive Databases. Rule authoring is a
very... | [
{
"created": "Wed, 10 Oct 2012 16:56:41 GMT",
"version": "v1"
},
{
"created": "Mon, 29 Oct 2012 18:25:34 GMT",
"version": "v2"
}
] | 2012-10-30 | [
[
"Lisi",
"Francesca A.",
""
]
] | Rules complement and extend ontologies on the Semantic Web. We refer to these rules as onto-relational since they combine DL-based ontology languages and Knowledge Representation formalisms supporting the relational data model within the tradition of Logic Programming and Deductive Databases. Rule authoring is a very d... |
1805.02974 | Sepehr Assadi | Sepehr Assadi, Xiaorui Sun, Omri Weinstein | Massively Parallel Algorithms for Finding Well-Connected Components in
Sparse Graphs | null | null | null | null | cs.DS cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A fundamental question that shrouds the emergence of massively parallel
computing (MPC) platforms is how can the additional power of the MPC paradigm
be leveraged to achieve faster algorithms compared to classical parallel models
such as PRAM?
Previous research has identified the sparse graph connectivity problem a... | [
{
"created": "Tue, 8 May 2018 12:29:21 GMT",
"version": "v1"
}
] | 2018-05-09 | [
[
"Assadi",
"Sepehr",
""
],
[
"Sun",
"Xiaorui",
""
],
[
"Weinstein",
"Omri",
""
]
] | A fundamental question that shrouds the emergence of massively parallel computing (MPC) platforms is how can the additional power of the MPC paradigm be leveraged to achieve faster algorithms compared to classical parallel models such as PRAM? Previous research has identified the sparse graph connectivity problem as a ... |
2007.07221 | Jishan Shaikh | Jishan Shaikh, Adya Sharma, Ankit Chouhan, Avinash Mahawar | Alpha-Net: Architecture, Models, and Applications | 13 pages, 8 figures, project paper preprint | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep learning network training is usually computationally expensive and
intuitively complex. We present a novel network architecture for custom
training and weight evaluations. We reformulate the layers as ResNet-similar
blocks with certain inputs and outputs of their own, the blocks (called Alpha
blocks) on their co... | [
{
"created": "Sat, 27 Jun 2020 05:05:01 GMT",
"version": "v1"
}
] | 2020-07-15 | [
[
"Shaikh",
"Jishan",
""
],
[
"Sharma",
"Adya",
""
],
[
"Chouhan",
"Ankit",
""
],
[
"Mahawar",
"Avinash",
""
]
] | Deep learning network training is usually computationally expensive and intuitively complex. We present a novel network architecture for custom training and weight evaluations. We reformulate the layers as ResNet-similar blocks with certain inputs and outputs of their own, the blocks (called Alpha blocks) on their conn... |
2101.01713 | Naoto Inoue | Naoto Inoue, Toshihiko Yamasaki | Learning from Synthetic Shadows for Shadow Detection and Removal | Accepted to IEEE Transactions on Circuits and Systems for Video
Technology (TCSVT), v2: fixed typos | null | 10.1109/TCSVT.2020.3047977 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Shadow removal is an essential task in computer vision and computer graphics.
Recent shadow removal approaches all train convolutional neural networks (CNN)
on real paired shadow/shadow-free or shadow/shadow-free/mask image datasets.
However, obtaining a large-scale, diverse, and accurate dataset has been a big
chall... | [
{
"created": "Tue, 5 Jan 2021 18:56:34 GMT",
"version": "v1"
},
{
"created": "Sat, 13 Feb 2021 06:40:05 GMT",
"version": "v2"
}
] | 2021-02-16 | [
[
"Inoue",
"Naoto",
""
],
[
"Yamasaki",
"Toshihiko",
""
]
] | Shadow removal is an essential task in computer vision and computer graphics. Recent shadow removal approaches all train convolutional neural networks (CNN) on real paired shadow/shadow-free or shadow/shadow-free/mask image datasets. However, obtaining a large-scale, diverse, and accurate dataset has been a big challen... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.