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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1306.6410 | Chi Zhou | Amelie Chi Zhou, Bingsheng He, Cheng Liu | Monetary Cost Optimizations for Hosting Workflow-as-a-Service in IaaS
Clouds | null | null | null | Technical Report 2013-12 | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently, we have witnessed workflows from science and other data-intensive
applications emerging on Infrastructure-asa-Service (IaaS) clouds, and many
workflow service providers offering workflow as a service (WaaS). The major
concern of WaaS providers is to minimize the monetary cost of executing
workflows in the I... | [
{
"created": "Thu, 27 Jun 2013 05:50:26 GMT",
"version": "v1"
},
{
"created": "Wed, 30 Apr 2014 03:51:14 GMT",
"version": "v2"
}
] | 2014-05-01 | [
[
"Zhou",
"Amelie Chi",
""
],
[
"He",
"Bingsheng",
""
],
[
"Liu",
"Cheng",
""
]
] | Recently, we have witnessed workflows from science and other data-intensive applications emerging on Infrastructure-asa-Service (IaaS) clouds, and many workflow service providers offering workflow as a service (WaaS). The major concern of WaaS providers is to minimize the monetary cost of executing workflows in the Iaa... |
2210.05448 | Ignacio Carlucho | Arrasy Rahman and Ignacio Carlucho and Niklas H\"opner and Stefano V.
Albrecht | A General Learning Framework for Open Ad Hoc Teamwork Using Graph-based
Policy Learning | null | null | null | null | cs.MA cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Open ad hoc teamwork is the problem of training a single agent to efficiently
collaborate with an unknown group of teammates whose composition may change
over time. A variable team composition creates challenges for the agent, such
as the requirement to adapt to new team dynamics and dealing with changing
state vecto... | [
{
"created": "Tue, 11 Oct 2022 13:44:44 GMT",
"version": "v1"
},
{
"created": "Sat, 28 Oct 2023 18:29:29 GMT",
"version": "v2"
}
] | 2023-10-31 | [
[
"Rahman",
"Arrasy",
""
],
[
"Carlucho",
"Ignacio",
""
],
[
"Höpner",
"Niklas",
""
],
[
"Albrecht",
"Stefano V.",
""
]
] | Open ad hoc teamwork is the problem of training a single agent to efficiently collaborate with an unknown group of teammates whose composition may change over time. A variable team composition creates challenges for the agent, such as the requirement to adapt to new team dynamics and dealing with changing state vector ... |
2108.12840 | Mingyu Xiao | Sen Huang, Mingyu Xiao and Xiaoyu Chen | Exact algorithms for maximum weighted independent set on sparse graphs | 43 pages, presented at COCOON 2021 | null | null | null | cs.DS | http://creativecommons.org/licenses/by/4.0/ | The maximum independent set problem is one of the most important problems in
graph algorithms and has been extensively studied in the line of research on
the worst-case analysis of exact algorithms for NP-hard problems. In the
weighted version, each vertex in the graph is associated with a weight and we
are going to ... | [
{
"created": "Sun, 29 Aug 2021 13:27:53 GMT",
"version": "v1"
}
] | 2021-08-31 | [
[
"Huang",
"Sen",
""
],
[
"Xiao",
"Mingyu",
""
],
[
"Chen",
"Xiaoyu",
""
]
] | The maximum independent set problem is one of the most important problems in graph algorithms and has been extensively studied in the line of research on the worst-case analysis of exact algorithms for NP-hard problems. In the weighted version, each vertex in the graph is associated with a weight and we are going to fi... |
1207.1933 | Gol Kim | Gol Kim (Center of Natural Science, University of Sciences, Pyongyang,
DPR Korea), Ri Suk Yun (Foreign Economic General Bureau, Pyongyang, DPR
Korea) | A Hybrid Forecast of Exchange Rate based on ARFIMA,Discrete Grey-Markov,
and Fractal Kalman Model | null | null | null | null | cs.CE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a hybrid forecast based on extended discrete grey Markov and
variable dimension Kalman model and show that our hybrid model can improve much
more the performance of forecast than traditional grey Markov and Kalman
models. Our simulation results are given to demonstrate that our hybrid
forecast method combi... | [
{
"created": "Mon, 9 Jul 2012 02:08:26 GMT",
"version": "v1"
}
] | 2012-07-10 | [
[
"Kim",
"Gol",
"",
"Center of Natural Science, University of Sciences, Pyongyang,\n DPR Korea"
],
[
"Yun",
"Ri Suk",
"",
"Foreign Economic General Bureau, Pyongyang, DPR\n Korea"
]
] | We propose a hybrid forecast based on extended discrete grey Markov and variable dimension Kalman model and show that our hybrid model can improve much more the performance of forecast than traditional grey Markov and Kalman models. Our simulation results are given to demonstrate that our hybrid forecast method combine... |
2011.12574 | Jaskirat Singh | Jaskirat Singh and Liang Zheng | Enhanced Scene Specificity with Sparse Dynamic Value Estimation | null | null | null | null | cs.LG stat.ML | http://creativecommons.org/licenses/by/4.0/ | Multi-scene reinforcement learning involves training the RL agent across
multiple scenes / levels from the same task, and has become essential for many
generalization applications. However, the inclusion of multiple scenes leads to
an increase in sample variance for policy gradient computations, often
resulting in su... | [
{
"created": "Wed, 25 Nov 2020 08:35:16 GMT",
"version": "v1"
}
] | 2020-11-26 | [
[
"Singh",
"Jaskirat",
""
],
[
"Zheng",
"Liang",
""
]
] | Multi-scene reinforcement learning involves training the RL agent across multiple scenes / levels from the same task, and has become essential for many generalization applications. However, the inclusion of multiple scenes leads to an increase in sample variance for policy gradient computations, often resulting in subo... |
2209.06261 | Kun Wang | Kun Wang, William R. Johnson III, Shiyang Lu, Xiaonan Huang, Joran
Booth, Rebecca Kramer-Bottiglio, Mridul Aanjaneya, Kostas Bekris | Real2Sim2Real Transfer for Control of Cable-driven Robots via a
Differentiable Physics Engine | Accepted to IROS2023; https://sites.google.com/view/sim2real | null | null | null | cs.RO cs.AI cs.GR cs.LG cs.SY eess.SY | http://creativecommons.org/licenses/by/4.0/ | Tensegrity robots, composed of rigid rods and flexible cables, exhibit high
strength-to-weight ratios and significant deformations, which enable them to
navigate unstructured terrains and survive harsh impacts. They are hard to
control, however, due to high dimensionality, complex dynamics, and a coupled
architecture... | [
{
"created": "Tue, 13 Sep 2022 18:51:26 GMT",
"version": "v1"
},
{
"created": "Tue, 20 Sep 2022 02:23:20 GMT",
"version": "v2"
},
{
"created": "Thu, 6 Apr 2023 01:13:50 GMT",
"version": "v3"
},
{
"created": "Sun, 17 Sep 2023 23:25:08 GMT",
"version": "v4"
}
] | 2023-09-19 | [
[
"Wang",
"Kun",
""
],
[
"Johnson",
"William R.",
"III"
],
[
"Lu",
"Shiyang",
""
],
[
"Huang",
"Xiaonan",
""
],
[
"Booth",
"Joran",
""
],
[
"Kramer-Bottiglio",
"Rebecca",
""
],
[
"Aanjaneya",
"Mridul",
""
]... | Tensegrity robots, composed of rigid rods and flexible cables, exhibit high strength-to-weight ratios and significant deformations, which enable them to navigate unstructured terrains and survive harsh impacts. They are hard to control, however, due to high dimensionality, complex dynamics, and a coupled architecture. ... |
2403.14617 | Xiang Fan | Xiang Fan, Anand Bhattad, Ranjay Krishna | Videoshop: Localized Semantic Video Editing with Noise-Extrapolated
Diffusion Inversion | Project page at https://videoshop-editing.github.io/ | null | null | null | cs.CV cs.AI cs.LG | http://creativecommons.org/licenses/by-sa/4.0/ | We introduce Videoshop, a training-free video editing algorithm for localized
semantic edits. Videoshop allows users to use any editing software, including
Photoshop and generative inpainting, to modify the first frame; it
automatically propagates those changes, with semantic, spatial, and temporally
consistent motio... | [
{
"created": "Thu, 21 Mar 2024 17:59:03 GMT",
"version": "v1"
},
{
"created": "Fri, 22 Mar 2024 17:45:52 GMT",
"version": "v2"
}
] | 2024-03-25 | [
[
"Fan",
"Xiang",
""
],
[
"Bhattad",
"Anand",
""
],
[
"Krishna",
"Ranjay",
""
]
] | We introduce Videoshop, a training-free video editing algorithm for localized semantic edits. Videoshop allows users to use any editing software, including Photoshop and generative inpainting, to modify the first frame; it automatically propagates those changes, with semantic, spatial, and temporally consistent motion,... |
2105.00825 | Yu Li | Yu Li, Shirley Anugrah Hayati, Weiyan Shi and Zhou Yu | DEUX: An Attribute-Guided Framework for Sociable Recommendation Dialog
Systems | null | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | It is important for sociable recommendation dialog systems to perform as both
on-task content and social content to engage users and gain their favor. In
addition to understand the user preferences and provide a satisfying
recommendation, such systems must be able to generate coherent and natural
social conversations... | [
{
"created": "Fri, 16 Apr 2021 12:12:26 GMT",
"version": "v1"
}
] | 2021-05-04 | [
[
"Li",
"Yu",
""
],
[
"Hayati",
"Shirley Anugrah",
""
],
[
"Shi",
"Weiyan",
""
],
[
"Yu",
"Zhou",
""
]
] | It is important for sociable recommendation dialog systems to perform as both on-task content and social content to engage users and gain their favor. In addition to understand the user preferences and provide a satisfying recommendation, such systems must be able to generate coherent and natural social conversations t... |
1911.07356 | Yang Chu | Xuemei Chen, Yang Chu, Min Zheng | Identify Equivalent Frames | 12 pages, 6 figures. Submitted to Involve | null | null | null | cs.IT math.FA math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A frame is an overcomplete set that can represent vectors(signals) faithfully
and stably. Two frames are equivalent if signals can be essentially represented
in the same way, which means two frames differ by a permutation, sign change or
orthogonal transformation. Since these operations are combinatorial in nature,
i... | [
{
"created": "Sun, 17 Nov 2019 22:37:15 GMT",
"version": "v1"
}
] | 2019-11-19 | [
[
"Chen",
"Xuemei",
""
],
[
"Chu",
"Yang",
""
],
[
"Zheng",
"Min",
""
]
] | A frame is an overcomplete set that can represent vectors(signals) faithfully and stably. Two frames are equivalent if signals can be essentially represented in the same way, which means two frames differ by a permutation, sign change or orthogonal transformation. Since these operations are combinatorial in nature, it ... |
2302.07215 | Konrad Zuchniak | Konrad Zuchniak | Multi-teacher knowledge distillation as an effective method for
compressing ensembles of neural networks | Doctoral dissertation in the field of computer science, machine
learning. Application of knowledge distillation as aggregation of ensemble
models. Along with several uses. 140 pages, 67 figures, 13 tables | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Deep learning has contributed greatly to many successes in artificial
intelligence in recent years. Today, it is possible to train models that have
thousands of layers and hundreds of billions of parameters. Large-scale deep
models have achieved great success, but the enormous computational complexity
and gigantic st... | [
{
"created": "Tue, 14 Feb 2023 17:40:36 GMT",
"version": "v1"
}
] | 2023-02-15 | [
[
"Zuchniak",
"Konrad",
""
]
] | Deep learning has contributed greatly to many successes in artificial intelligence in recent years. Today, it is possible to train models that have thousands of layers and hundreds of billions of parameters. Large-scale deep models have achieved great success, but the enormous computational complexity and gigantic stor... |
2108.08972 | Taiga Ono | Taiga Ono (1), Takeshi Sugawara (2), Jun Sakuma (3), Tatsuya Mori (1
and 4) ((1) Waseda University, (2) The University of Electro-Communications,
(3) University of Tsukuba, (4) RIKEN AIP) | Application of Adversarial Examples to Physical ECG Signals | null | null | null | null | cs.LG cs.CR eess.SP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work aims to assess the reality and feasibility of the adversarial
attack against cardiac diagnosis system powered by machine learning algorithms.
To this end, we introduce adversarial beats, which are adversarial
perturbations tailored specifically against electrocardiograms (ECGs)
beat-by-beat classification s... | [
{
"created": "Fri, 20 Aug 2021 02:30:17 GMT",
"version": "v1"
}
] | 2021-08-23 | [
[
"Ono",
"Taiga",
"",
"1\n and 4"
],
[
"Sugawara",
"Takeshi",
"",
"1\n and 4"
],
[
"Sakuma",
"Jun",
"",
"1\n and 4"
],
[
"Mori",
"Tatsuya",
"",
"1\n and 4"
]
] | This work aims to assess the reality and feasibility of the adversarial attack against cardiac diagnosis system powered by machine learning algorithms. To this end, we introduce adversarial beats, which are adversarial perturbations tailored specifically against electrocardiograms (ECGs) beat-by-beat classification sys... |
1205.5742 | Ashraf Qadir | Ashraf Qadir, William Semke, and Jeremiah Neubert | Implementation of an Onboard Visual Tracking System with Small Unmanned
Aerial Vehicle (UAV) | 9 pages; 6 figures; International Journal of Innovative Technology
and Creative Engineering (ISSN:2045-8711) VOl.1 No. 10 OCTOBER 2011 | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a visual tracking system that is capable or running real
time on-board a small UAV (Unmanned Aerial Vehicle). The tracking system is
computationally efficient and invariant to lighting changes and rotation of the
object or the camera. Detection and tracking is autonomously carried out on the
paylo... | [
{
"created": "Fri, 25 May 2012 16:08:11 GMT",
"version": "v1"
}
] | 2012-05-28 | [
[
"Qadir",
"Ashraf",
""
],
[
"Semke",
"William",
""
],
[
"Neubert",
"Jeremiah",
""
]
] | This paper presents a visual tracking system that is capable or running real time on-board a small UAV (Unmanned Aerial Vehicle). The tracking system is computationally efficient and invariant to lighting changes and rotation of the object or the camera. Detection and tracking is autonomously carried out on the payload... |
1704.00380 | Mamoru Komachi | Junki Matsuo, Mamoru Komachi and Katsuhito Sudoh | Word-Alignment-Based Segment-Level Machine Translation Evaluation using
Word Embeddings | 5 pages | null | null | null | cs.CL | http://creativecommons.org/licenses/by-sa/4.0/ | One of the most important problems in machine translation (MT) evaluation is
to evaluate the similarity between translation hypotheses with different
surface forms from the reference, especially at the segment level. We propose
to use word embeddings to perform word alignment for segment-level MT
evaluation. We perfo... | [
{
"created": "Sun, 2 Apr 2017 22:36:56 GMT",
"version": "v1"
}
] | 2017-04-04 | [
[
"Matsuo",
"Junki",
""
],
[
"Komachi",
"Mamoru",
""
],
[
"Sudoh",
"Katsuhito",
""
]
] | One of the most important problems in machine translation (MT) evaluation is to evaluate the similarity between translation hypotheses with different surface forms from the reference, especially at the segment level. We propose to use word embeddings to perform word alignment for segment-level MT evaluation. We perform... |
1909.04550 | Jianshen Liu | Jianshen Liu, Philip Kufeldt, Carlos Maltzahn | MBWU: Benefit Quantification for Data Access Function Offloading | 16 pages, 11 figures | HPC I/O in the Data Center Workshop, 2019 | null | null | cs.DC cs.DB cs.PF | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The storage industry is considering new kinds of storage devices that support
data access function offloading, i.e. the ability to perform data access
functions on the storage device itself as opposed to performing it on a
separate compute system to which the storage device is connected. But what is
the benefit of of... | [
{
"created": "Mon, 9 Sep 2019 04:15:33 GMT",
"version": "v1"
}
] | 2019-09-11 | [
[
"Liu",
"Jianshen",
""
],
[
"Kufeldt",
"Philip",
""
],
[
"Maltzahn",
"Carlos",
""
]
] | The storage industry is considering new kinds of storage devices that support data access function offloading, i.e. the ability to perform data access functions on the storage device itself as opposed to performing it on a separate compute system to which the storage device is connected. But what is the benefit of offl... |
2008.07969 | Vipin Singh Sehrawat | Vipin Singh Sehrawat and Yvo Desmedt | Access Structure Hiding Secret Sharing from Novel Set Systems and Vector
Families | This is the full version of the paper that appears in D. Kim et al.
(Eds.): COCOON 2020 (The 26th International Computing and Combinatorics
Conference), LNCS 12273, pp. 246-261. This version contains tighter bounds on
the maximum share size, and the total number of access structures supported | Computing and Combinatorics. COCOON 2020. LNCS, vol 12273, pp.
246-261 | 10.1007/978-3-030-58150-3_20 | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Secret sharing provides a means to distribute shares of a secret such that
any authorized subset of shares, specified by an access structure, can be
pooled together to recompute the secret. The standard secret sharing model
requires public access structures, which violates privacy and facilitates the
adversary by rev... | [
{
"created": "Tue, 18 Aug 2020 15:04:13 GMT",
"version": "v1"
},
{
"created": "Tue, 22 Sep 2020 07:53:23 GMT",
"version": "v2"
},
{
"created": "Sun, 23 May 2021 09:03:06 GMT",
"version": "v3"
}
] | 2021-05-25 | [
[
"Sehrawat",
"Vipin Singh",
""
],
[
"Desmedt",
"Yvo",
""
]
] | Secret sharing provides a means to distribute shares of a secret such that any authorized subset of shares, specified by an access structure, can be pooled together to recompute the secret. The standard secret sharing model requires public access structures, which violates privacy and facilitates the adversary by revea... |
2107.07661 | Giselle Reis | Giselle Reis (Carnegie Mellon University) | Facilitating Meta-Theory Reasoning (Invited Paper) | In Proceedings LFMTP 2021, arXiv:2107.07376 | EPTCS 337, 2021, pp. 1-12 | 10.4204/EPTCS.337.1 | null | cs.LO | http://creativecommons.org/licenses/by/4.0/ | Structural proof theory is praised for being a symbolic approach to reasoning
and proofs, in which one can define schemas for reasoning steps and manipulate
proofs as a mathematical structure. For this to be possible, proof systems must
be designed as a set of rules such that proofs using those rules are correct by
c... | [
{
"created": "Fri, 16 Jul 2021 01:43:52 GMT",
"version": "v1"
},
{
"created": "Sun, 8 Aug 2021 02:10:30 GMT",
"version": "v2"
}
] | 2021-08-10 | [
[
"Reis",
"Giselle",
"",
"Carnegie Mellon University"
]
] | Structural proof theory is praised for being a symbolic approach to reasoning and proofs, in which one can define schemas for reasoning steps and manipulate proofs as a mathematical structure. For this to be possible, proof systems must be designed as a set of rules such that proofs using those rules are correct by con... |
2004.04330 | Sreejith Sreekumar Dr | Sreejith Sreekumar, Alexander Bunin, Ziv Goldfeld, Haim H. Permuter,
Shlomo Shamai (Shitz) | The Secrecy Capacity of Cost-Constrained Wiretap Channels | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In many information-theoretic channel coding problems, adding an input cost
constraint to the operational setup amounts to restricting the optimization
domain in the capacity formula. This paper shows that, in contrast to common
belief, such a simple modification does not hold for the cost-constrained (CC)
wiretap ch... | [
{
"created": "Thu, 9 Apr 2020 02:21:44 GMT",
"version": "v1"
},
{
"created": "Sat, 26 Dec 2020 15:24:07 GMT",
"version": "v2"
}
] | 2020-12-29 | [
[
"Sreekumar",
"Sreejith",
"",
"Shitz"
],
[
"Bunin",
"Alexander",
"",
"Shitz"
],
[
"Goldfeld",
"Ziv",
"",
"Shitz"
],
[
"Permuter",
"Haim H.",
"",
"Shitz"
],
[
"Shamai",
"Shlomo",
"",
"Shitz"
]
] | In many information-theoretic channel coding problems, adding an input cost constraint to the operational setup amounts to restricting the optimization domain in the capacity formula. This paper shows that, in contrast to common belief, such a simple modification does not hold for the cost-constrained (CC) wiretap chan... |
2402.14299 | Miao Xin | Miao Xin, Zhongrui You, Zihan Zhang, Taoran Jiang, Tingjia Xu, Haotian
Liang, Guojing Ge, Yuchen Ji, Shentong Mo, Jian Cheng | We Choose to Go to Space: Agent-driven Human and Multi-Robot
Collaboration in Microgravity | null | null | null | null | cs.RO cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present SpaceAgents-1, a system for learning human and multi-robot
collaboration (HMRC) strategies under microgravity conditions. Future space
exploration requires humans to work together with robots. However, acquiring
proficient robot skills and adept collaboration under microgravity conditions
poses significant... | [
{
"created": "Thu, 22 Feb 2024 05:32:27 GMT",
"version": "v1"
}
] | 2024-02-23 | [
[
"Xin",
"Miao",
""
],
[
"You",
"Zhongrui",
""
],
[
"Zhang",
"Zihan",
""
],
[
"Jiang",
"Taoran",
""
],
[
"Xu",
"Tingjia",
""
],
[
"Liang",
"Haotian",
""
],
[
"Ge",
"Guojing",
""
],
[
"Ji",
"Yuchen... | We present SpaceAgents-1, a system for learning human and multi-robot collaboration (HMRC) strategies under microgravity conditions. Future space exploration requires humans to work together with robots. However, acquiring proficient robot skills and adept collaboration under microgravity conditions poses significant c... |
2212.02006 | Jun Xia | Jun Xia, Yi Zhang, Zhihao Yue, Ming Hu, Xian Wei, Mingsong Chen | HierarchyFL: Heterogeneous Federated Learning via Hierarchical
Self-Distillation | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Federated learning (FL) has been recognized as a privacy-preserving
distributed machine learning paradigm that enables knowledge sharing among
various heterogeneous artificial intelligence (AIoT) devices through
centralized global model aggregation. FL suffers from model inaccuracy and slow
convergence due to the mod... | [
{
"created": "Mon, 5 Dec 2022 03:32:10 GMT",
"version": "v1"
}
] | 2022-12-06 | [
[
"Xia",
"Jun",
""
],
[
"Zhang",
"Yi",
""
],
[
"Yue",
"Zhihao",
""
],
[
"Hu",
"Ming",
""
],
[
"Wei",
"Xian",
""
],
[
"Chen",
"Mingsong",
""
]
] | Federated learning (FL) has been recognized as a privacy-preserving distributed machine learning paradigm that enables knowledge sharing among various heterogeneous artificial intelligence (AIoT) devices through centralized global model aggregation. FL suffers from model inaccuracy and slow convergence due to the model... |
1204.1616 | Marek Cygan | Marek Cygan and Harold N. Gabow and Piotr Sankowski | Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles,
Diameter and Matchings | To appear in FOCS 2012 | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Consider a directed or an undirected graph with integral edge weights from
the set [-W, W], that does not contain negative weight cycles. In this paper,
we introduce a general framework for solving problems on such graphs using
matrix multiplication. The framework is based on the usage of Baur-Strassen's
theorem and ... | [
{
"created": "Sat, 7 Apr 2012 09:54:25 GMT",
"version": "v1"
},
{
"created": "Fri, 17 Aug 2012 19:05:56 GMT",
"version": "v2"
}
] | 2012-08-20 | [
[
"Cygan",
"Marek",
""
],
[
"Gabow",
"Harold N.",
""
],
[
"Sankowski",
"Piotr",
""
]
] | Consider a directed or an undirected graph with integral edge weights from the set [-W, W], that does not contain negative weight cycles. In this paper, we introduce a general framework for solving problems on such graphs using matrix multiplication. The framework is based on the usage of Baur-Strassen's theorem and of... |
2405.06664 | Tom\'a\v{s} Jakl | Tom\'a\v{s} Jakl, Dan Marsden, Nihil Shah | A categorical account of composition methods in logic (extended version) | This is an extended version of arXiv:2304.10196 which, apart from
providing full proofs of all statements, takes a more categorical point of
view to tell the whole story. In particular, we highlight and explain the
underlying categorical constructions in detail | null | null | null | cs.LO math.CT | http://creativecommons.org/licenses/by-sa/4.0/ | We present a categorical theory of the composition methods in finite model
theory -- a key technique enabling modular reasoning about complex structures
by building them out of simpler components. The crucial results required by the
composition methods are Feferman--Vaught--Mostowski (FVM) type theorems, which
charac... | [
{
"created": "Tue, 30 Apr 2024 09:03:28 GMT",
"version": "v1"
}
] | 2024-05-14 | [
[
"Jakl",
"Tomáš",
""
],
[
"Marsden",
"Dan",
""
],
[
"Shah",
"Nihil",
""
]
] | We present a categorical theory of the composition methods in finite model theory -- a key technique enabling modular reasoning about complex structures by building them out of simpler components. The crucial results required by the composition methods are Feferman--Vaught--Mostowski (FVM) type theorems, which characte... |
2309.14496 | Timothy DeLise | Timothy DeLise | Era Splitting: Invariant Learning for Decision Trees | 29 pages, 9 figures, 3 tables, 2 algorithms | null | null | null | cs.LG cs.AI cs.CE | http://creativecommons.org/licenses/by/4.0/ | Real-life machine learning problems exhibit distributional shifts in the data
from one time to another or from one place to another. This behavior is beyond
the scope of the traditional empirical risk minimization paradigm, which
assumes i.i.d. distribution of data over time and across locations. The
emerging field o... | [
{
"created": "Mon, 25 Sep 2023 19:45:45 GMT",
"version": "v1"
},
{
"created": "Wed, 27 Sep 2023 15:54:36 GMT",
"version": "v2"
},
{
"created": "Tue, 2 Jan 2024 14:35:16 GMT",
"version": "v3"
},
{
"created": "Thu, 14 Mar 2024 17:31:06 GMT",
"version": "v4"
},
{
"cr... | 2024-07-24 | [
[
"DeLise",
"Timothy",
""
]
] | Real-life machine learning problems exhibit distributional shifts in the data from one time to another or from one place to another. This behavior is beyond the scope of the traditional empirical risk minimization paradigm, which assumes i.i.d. distribution of data over time and across locations. The emerging field of ... |
2103.12983 | Tri Minh Nguyen | Tri Minh Nguyen, Thomas P Quinn, Thin Nguyen, Truyen Tran | Counterfactual Explanation with Multi-Agent Reinforcement Learning for
Drug Target Prediction | null | null | null | null | cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | Motivation: Many high-performance DTA models have been proposed, but they are
mostly black-box and thus lack human interpretability. Explainable AI (XAI) can
make DTA models more trustworthy, and can also enable scientists to distill
biological knowledge from the models. Counterfactual explanation is one popular
appr... | [
{
"created": "Wed, 24 Mar 2021 04:38:38 GMT",
"version": "v1"
},
{
"created": "Wed, 2 Jun 2021 01:28:49 GMT",
"version": "v2"
}
] | 2021-06-03 | [
[
"Nguyen",
"Tri Minh",
""
],
[
"Quinn",
"Thomas P",
""
],
[
"Nguyen",
"Thin",
""
],
[
"Tran",
"Truyen",
""
]
] | Motivation: Many high-performance DTA models have been proposed, but they are mostly black-box and thus lack human interpretability. Explainable AI (XAI) can make DTA models more trustworthy, and can also enable scientists to distill biological knowledge from the models. Counterfactual explanation is one popular approa... |
2303.00188 | Sufang Yang | Sufang Yang and Longguang Li and Jintao Wang | On the Capacity Region of Optical Intensity Broadcast Channels | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper investigates the capacity region of the optical intensity
broadcast channels (OI-BCs), where the input is subject to a peak-intensity
constraint, an average-intensity constraint, or both. By leveraging the
decomposition results of several random variables, i.e., uniform, exponential,
and truncated exponent... | [
{
"created": "Wed, 1 Mar 2023 02:32:25 GMT",
"version": "v1"
}
] | 2023-03-02 | [
[
"Yang",
"Sufang",
""
],
[
"Li",
"Longguang",
""
],
[
"Wang",
"Jintao",
""
]
] | This paper investigates the capacity region of the optical intensity broadcast channels (OI-BCs), where the input is subject to a peak-intensity constraint, an average-intensity constraint, or both. By leveraging the decomposition results of several random variables, i.e., uniform, exponential, and truncated exponentia... |
1610.07789 | Yo-Seb Jeon | Song-Nam Hong, Yo-Seb Jeon, Namyoon Lee | MIMO Systems With Low-Resolution ADCs: Linear Coding Approach | Submitted to IEEE Transactions on Wireless Communications | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper considers a multiple-input multiple-output (MIMO) system with
low-resolution analog-to-digital converters (ADCs). In this system, the paper
presents a new MIMO detection approach using coding theory. The principal idea
of the proposed approach is to transform a non-linear MIMO channel to a linear
MIMO chan... | [
{
"created": "Tue, 25 Oct 2016 08:47:11 GMT",
"version": "v1"
}
] | 2016-10-26 | [
[
"Hong",
"Song-Nam",
""
],
[
"Jeon",
"Yo-Seb",
""
],
[
"Lee",
"Namyoon",
""
]
] | This paper considers a multiple-input multiple-output (MIMO) system with low-resolution analog-to-digital converters (ADCs). In this system, the paper presents a new MIMO detection approach using coding theory. The principal idea of the proposed approach is to transform a non-linear MIMO channel to a linear MIMO channe... |
2405.16493 | Shuangpeng Han | Shuangpeng Han, Ziyu Wang, Mengmi Zhang | Flow Snapshot Neurons in Action: Deep Neural Networks Generalize to
Biological Motion Perception | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Biological motion perception (BMP) refers to humans' ability to perceive and
recognize the actions of living beings solely from their motion patterns,
sometimes as minimal as those depicted on point-light displays. While humans
excel at these tasks without any prior training, current AI models struggle
with poor gene... | [
{
"created": "Sun, 26 May 2024 09:11:46 GMT",
"version": "v1"
}
] | 2024-05-28 | [
[
"Han",
"Shuangpeng",
""
],
[
"Wang",
"Ziyu",
""
],
[
"Zhang",
"Mengmi",
""
]
] | Biological motion perception (BMP) refers to humans' ability to perceive and recognize the actions of living beings solely from their motion patterns, sometimes as minimal as those depicted on point-light displays. While humans excel at these tasks without any prior training, current AI models struggle with poor genera... |
2104.07543 | Julian D. Cortes | Julian D. Cortes, Mireia Guix, Katerina Bohle Carbonell | Innovation for Sustainability in the Global South: Bibliometric findings
from management & business and STEM (Science, Technology, Engineering and
Mathematics) fields in developing countries | null | null | 10.1016/j.heliyon.2021.e07809 | null | cs.DL | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Research on innovation and sustainability is prolific but fragmented. This
study integrates the research on innovation in management and business and STEM
fields for sustainability in a unified framework for the case of developing
countries (i.e., the Global South). It presents and discusses the output,
impact, and s... | [
{
"created": "Tue, 13 Apr 2021 18:48:21 GMT",
"version": "v1"
}
] | 2021-08-18 | [
[
"Cortes",
"Julian D.",
""
],
[
"Guix",
"Mireia",
""
],
[
"Carbonell",
"Katerina Bohle",
""
]
] | Research on innovation and sustainability is prolific but fragmented. This study integrates the research on innovation in management and business and STEM fields for sustainability in a unified framework for the case of developing countries (i.e., the Global South). It presents and discusses the output, impact, and str... |
1807.11103 | Heinz Riener | Heinz Riener and R\"udiger Ehlers and Bruno Schmitt and Giovanni De
Micheli | Exact Synthesis of ESOP Forms | 16 pages, accepted at 13th Int'l Workshop on Boolean Problems | null | null | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present an exact synthesis approach for computing Exclusive-or
Sum-of-Products (ESOP) forms with a minimum number of product terms using
Boolean satisfiability. Our approach finds one or more ESOP forms for a given
Boolean function. The approach can deal with incompletely-specified Boolean
functions defined over m... | [
{
"created": "Sun, 29 Jul 2018 19:36:26 GMT",
"version": "v1"
}
] | 2018-07-31 | [
[
"Riener",
"Heinz",
""
],
[
"Ehlers",
"Rüdiger",
""
],
[
"Schmitt",
"Bruno",
""
],
[
"De Micheli",
"Giovanni",
""
]
] | We present an exact synthesis approach for computing Exclusive-or Sum-of-Products (ESOP) forms with a minimum number of product terms using Boolean satisfiability. Our approach finds one or more ESOP forms for a given Boolean function. The approach can deal with incompletely-specified Boolean functions defined over man... |
1904.04174 | John Lawson | Rod Burns, John Lawson, Duncan McBain and Daniel Soutar | Accelerated Neural Networks on OpenCL Devices Using SYCL-DNN | 4 pages, 3 figures. In International Workshop on OpenCL (IWOCL '19),
May 13-15, 2019, Boston | null | 10.1145/3318170.3318183 | null | cs.LG cs.DC cs.PF | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Over the past few years machine learning has seen a renewed explosion of
interest, following a number of studies showing the effectiveness of neural
networks in a range of tasks which had previously been considered incredibly
hard. Neural networks' effectiveness in the fields of image recognition and
natural language... | [
{
"created": "Mon, 8 Apr 2019 16:29:40 GMT",
"version": "v1"
}
] | 2019-04-09 | [
[
"Burns",
"Rod",
""
],
[
"Lawson",
"John",
""
],
[
"McBain",
"Duncan",
""
],
[
"Soutar",
"Daniel",
""
]
] | Over the past few years machine learning has seen a renewed explosion of interest, following a number of studies showing the effectiveness of neural networks in a range of tasks which had previously been considered incredibly hard. Neural networks' effectiveness in the fields of image recognition and natural language p... |
2303.08939 | Fernando Ortega | Ra\'ul Lara-Cabrera and Fernando Ortega and Edgar Talavera and Daniel
L\'opez-Fern\'andez | Using 3D printed badges to improve student performance and reduce
dropout rates in STEM higher education | null | null | 10.1109/TE.2023.3281767 | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Students' perception of excessive difficulty in STEM degrees lowers their
motivation and therefore affects their performance. According to prior
research, the use of gamification techniques promote engagement, motivation and
fun when learning. Badges, which are a distinction that is given as a reward to
students, are... | [
{
"created": "Wed, 15 Mar 2023 21:09:57 GMT",
"version": "v1"
},
{
"created": "Fri, 19 May 2023 16:05:46 GMT",
"version": "v2"
}
] | 2023-07-18 | [
[
"Lara-Cabrera",
"Raúl",
""
],
[
"Ortega",
"Fernando",
""
],
[
"Talavera",
"Edgar",
""
],
[
"López-Fernández",
"Daniel",
""
]
] | Students' perception of excessive difficulty in STEM degrees lowers their motivation and therefore affects their performance. According to prior research, the use of gamification techniques promote engagement, motivation and fun when learning. Badges, which are a distinction that is given as a reward to students, are a... |
2109.09666 | Chiara Renso | Vinicius Monteiro de Lira, Fabiano Pallonetto, Lorenzo Gabrielli,
Chiara Renso | Predicting vehicles parking behaviour in shared premises for aggregated
EV electricity demand response programs | null | null | null | null | cs.LG cs.AI eess.SP | http://creativecommons.org/licenses/by/4.0/ | The global electric car sales in 2020 continued to exceed the expectations
climbing to over 3 millions and reaching a market share of over 4%. However,
uncertainty of generation caused by higher penetration of renewable energies
and the advent of Electrical Vehicles (EV) with their additional electricity
demand could... | [
{
"created": "Mon, 20 Sep 2021 16:33:17 GMT",
"version": "v1"
}
] | 2021-09-21 | [
[
"de Lira",
"Vinicius Monteiro",
""
],
[
"Pallonetto",
"Fabiano",
""
],
[
"Gabrielli",
"Lorenzo",
""
],
[
"Renso",
"Chiara",
""
]
] | The global electric car sales in 2020 continued to exceed the expectations climbing to over 3 millions and reaching a market share of over 4%. However, uncertainty of generation caused by higher penetration of renewable energies and the advent of Electrical Vehicles (EV) with their additional electricity demand could c... |
0905.2177 | Andreas Enge | Andreas Enge (INRIA Bordeaux - Sud-Ouest), Pierrick Gaudry (INRIA
Lorraine - LORIA), Emmanuel Thom\'e (INRIA Lorraine - LORIA) | An $L (1/3)$ Discrete Logarithm Algorithm for Low Degree Curves | null | null | null | null | cs.CR math.AG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present an algorithm for solving the discrete logarithm problem in
Jacobians of families of plane curves whose degrees in $X$ and $Y$ are low with
respect to their genera. The finite base fields $\FF_q$ are arbitrary, but
their sizes should not grow too fast compared to the genus. For such families,
the group stru... | [
{
"created": "Wed, 13 May 2009 19:43:15 GMT",
"version": "v1"
},
{
"created": "Sun, 20 Dec 2009 17:24:45 GMT",
"version": "v2"
}
] | 2009-12-20 | [
[
"Enge",
"Andreas",
"",
"INRIA Bordeaux - Sud-Ouest"
],
[
"Gaudry",
"Pierrick",
"",
"INRIA\n Lorraine - LORIA"
],
[
"Thomé",
"Emmanuel",
"",
"INRIA Lorraine - LORIA"
]
] | We present an algorithm for solving the discrete logarithm problem in Jacobians of families of plane curves whose degrees in $X$ and $Y$ are low with respect to their genera. The finite base fields $\FF_q$ are arbitrary, but their sizes should not grow too fast compared to the genus. For such families, the group struct... |
0901.1427 | Sourav Chakraborty | Sourav Chakraborty, Nikhil Devanur | An Online Multi-unit Auction with Improved Competitive Ratio | null | null | null | null | cs.GT cs.CC cs.DM cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We improve the best known competitive ratio (from 1/4 to 1/2), for the online
multi-unit allocation problem, where the objective is to maximize the
single-price revenue. Moreover, the competitive ratio of our algorithm tends to
1, as the bid-profile tends to ``smoothen''. This algorithm is used as a
subroutine in des... | [
{
"created": "Sun, 11 Jan 2009 10:00:38 GMT",
"version": "v1"
}
] | 2009-01-13 | [
[
"Chakraborty",
"Sourav",
""
],
[
"Devanur",
"Nikhil",
""
]
] | We improve the best known competitive ratio (from 1/4 to 1/2), for the online multi-unit allocation problem, where the objective is to maximize the single-price revenue. Moreover, the competitive ratio of our algorithm tends to 1, as the bid-profile tends to ``smoothen''. This algorithm is used as a subroutine in desig... |
2407.11888 | Aritra Dhar | Aritra Dhar, Cl\'ement Thorens, Lara Magdalena Lazier, Lukas Cavigelli | Ascend-CC: Confidential Computing on Heterogeneous NPU for Emerging
Generative AI Workloads | null | null | null | null | cs.CR | http://creativecommons.org/licenses/by/4.0/ | Cloud workloads have dominated generative AI based on large language models
(LLM). Specialized hardware accelerators, such as GPUs, NPUs, and TPUs, play a
key role in AI adoption due to their superior performance over general-purpose
CPUs. The AI models and the data are often highly sensitive and come from
mutually d... | [
{
"created": "Tue, 16 Jul 2024 16:17:28 GMT",
"version": "v1"
}
] | 2024-07-17 | [
[
"Dhar",
"Aritra",
""
],
[
"Thorens",
"Clément",
""
],
[
"Lazier",
"Lara Magdalena",
""
],
[
"Cavigelli",
"Lukas",
""
]
] | Cloud workloads have dominated generative AI based on large language models (LLM). Specialized hardware accelerators, such as GPUs, NPUs, and TPUs, play a key role in AI adoption due to their superior performance over general-purpose CPUs. The AI models and the data are often highly sensitive and come from mutually dis... |
2308.07863 | Zhizhong Wang | Zhizhong Wang, Lei Zhao, Wei Xing | StyleDiffusion: Controllable Disentangled Style Transfer via Diffusion
Models | Accepted by ICCV 2023 | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Content and style (C-S) disentanglement is a fundamental problem and critical
challenge of style transfer. Existing approaches based on explicit definitions
(e.g., Gram matrix) or implicit learning (e.g., GANs) are neither interpretable
nor easy to control, resulting in entangled representations and less satisfying
r... | [
{
"created": "Tue, 15 Aug 2023 16:30:49 GMT",
"version": "v1"
}
] | 2023-08-16 | [
[
"Wang",
"Zhizhong",
""
],
[
"Zhao",
"Lei",
""
],
[
"Xing",
"Wei",
""
]
] | Content and style (C-S) disentanglement is a fundamental problem and critical challenge of style transfer. Existing approaches based on explicit definitions (e.g., Gram matrix) or implicit learning (e.g., GANs) are neither interpretable nor easy to control, resulting in entangled representations and less satisfying res... |
1301.0523 | Helene Cordier | Cyril L'Orphelin (CC IN2P3), H\'el\`ene Cordier (CC IN2P3), Sylvain
Reynaud (CC IN2P3), Marcos Lins (CC IN2P3), Sinika Loikkanen (CC IN2P3),
Olivier Lequeux (CC IN2P3), Pierre Veyre (CC IN2P3) | EELA Operations: A standalone regional dashboard implementation | Second EELA-2 Conference, CHORONI : Venezuela, Bolivarian Republic Of
(2009) | null | null | null | cs.SE cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Grid operators in EGEE use a dedicated dashboard as their central operational
tool, stable and scalable for the last 5 years despite continuous upgrade from
specifications by users, monitoring tools or data providers. In EGEE-III,
regionalisation of operations led the tool developers to conceive a standalone
instance... | [
{
"created": "Thu, 3 Jan 2013 17:44:46 GMT",
"version": "v1"
}
] | 2013-01-04 | [
[
"L'Orphelin",
"Cyril",
"",
"CC IN2P3"
],
[
"Cordier",
"Hélène",
"",
"CC IN2P3"
],
[
"Reynaud",
"Sylvain",
"",
"CC IN2P3"
],
[
"Lins",
"Marcos",
"",
"CC IN2P3"
],
[
"Loikkanen",
"Sinika",
"",
"CC IN2P3"
],
[
"Le... | Grid operators in EGEE use a dedicated dashboard as their central operational tool, stable and scalable for the last 5 years despite continuous upgrade from specifications by users, monitoring tools or data providers. In EGEE-III, regionalisation of operations led the tool developers to conceive a standalone instance o... |
2112.10254 | Simiao Ren | Simiao Ren, Ashwin Mahendra, Omar Khatib, Yang Deng, Willie J. Padilla
and Jordan M. Malof | Inverse deep learning methods and benchmarks for artificial
electromagnetic material design | null | null | null | null | cs.LG cond-mat.mtrl-sci | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep learning (DL) inverse techniques have increased the speed of artificial
electromagnetic material (AEM) design and improved the quality of resulting
devices. Many DL inverse techniques have succeeded on a number of AEM design
tasks, but to compare, contrast, and evaluate assorted techniques it is
critical to clar... | [
{
"created": "Sun, 19 Dec 2021 20:44:53 GMT",
"version": "v1"
}
] | 2021-12-21 | [
[
"Ren",
"Simiao",
""
],
[
"Mahendra",
"Ashwin",
""
],
[
"Khatib",
"Omar",
""
],
[
"Deng",
"Yang",
""
],
[
"Padilla",
"Willie J.",
""
],
[
"Malof",
"Jordan M.",
""
]
] | Deep learning (DL) inverse techniques have increased the speed of artificial electromagnetic material (AEM) design and improved the quality of resulting devices. Many DL inverse techniques have succeeded on a number of AEM design tasks, but to compare, contrast, and evaluate assorted techniques it is critical to clarif... |
1210.2047 | Miranda Zhang | Miranda Zhang, Rajiv Ranjan, Surya Nepal, Michael Menzel, Armin Haller | A Declarative Recommender System for Cloud Infrastructure Services
Selection | Supplement document to the conference paper accepted at the 9th
International Conference on Economics of Grids, Clouds, Systems, and
Services, Berlin, Germany, 2012 | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The cloud infrastructure services landscape advances steadily leaving users
in the agony of choice...
| [
{
"created": "Sun, 7 Oct 2012 12:16:09 GMT",
"version": "v1"
},
{
"created": "Thu, 29 Nov 2012 09:54:30 GMT",
"version": "v2"
}
] | 2012-11-30 | [
[
"Zhang",
"Miranda",
""
],
[
"Ranjan",
"Rajiv",
""
],
[
"Nepal",
"Surya",
""
],
[
"Menzel",
"Michael",
""
],
[
"Haller",
"Armin",
""
]
] | The cloud infrastructure services landscape advances steadily leaving users in the agony of choice... |
2401.09376 | Kevin Slote | Kevin Slote, Elaine Lee | Unlocking Unlabeled Data: Ensemble Learning with the Hui- Walter
Paradigm for Performance Estimation in Online and Static Settings | null | null | null | null | cs.LG math.ST stat.ML stat.TH | http://creativecommons.org/licenses/by/4.0/ | In the realm of machine learning and statistical modeling, practitioners
often work under the assumption of accessible, static, labeled data for
evaluation and training. However, this assumption often deviates from reality
where data may be private, encrypted, difficult- to-measure, or unlabeled. In
this paper, we br... | [
{
"created": "Wed, 17 Jan 2024 17:46:10 GMT",
"version": "v1"
}
] | 2024-01-18 | [
[
"Slote",
"Kevin",
""
],
[
"Lee",
"Elaine",
""
]
] | In the realm of machine learning and statistical modeling, practitioners often work under the assumption of accessible, static, labeled data for evaluation and training. However, this assumption often deviates from reality where data may be private, encrypted, difficult- to-measure, or unlabeled. In this paper, we brid... |
1210.6119 | Francis Cabarle | Francis George C. Cabarle, Kelvin C. Bu\~no, Henry N. Adorna | Time After Time: Notes on Delays In Spiking Neural P Systems | 11 pages, 9 figures, 4 lemmas, 1 theorem, preprint of Workshop on
Computation: Theory and Practice 2012 at DLSU, Manila together with UP
Diliman, DLSU, Tokyo Institute of Technology, and Osaka university | null | null | null | cs.NE cs.DC cs.ET | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Spiking Neural P systems, SNP systems for short, are biologically inspired
computing devices based on how neurons perform computations. SNP systems use
only one type of symbol, the spike, in the computations. Information is encoded
in the time differences of spikes or the multiplicity of spikes produced at
certain ti... | [
{
"created": "Tue, 23 Oct 2012 03:45:57 GMT",
"version": "v1"
}
] | 2012-10-24 | [
[
"Cabarle",
"Francis George C.",
""
],
[
"Buño",
"Kelvin C.",
""
],
[
"Adorna",
"Henry N.",
""
]
] | Spiking Neural P systems, SNP systems for short, are biologically inspired computing devices based on how neurons perform computations. SNP systems use only one type of symbol, the spike, in the computations. Information is encoded in the time differences of spikes or the multiplicity of spikes produced at certain time... |
1904.00386 | Zhihang Li | Zhihang Li, Xu Tang, Junyu Han, Jingtuo Liu, Ran He | PyramidBox++: High Performance Detector for Finding Tiny Face | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the rapid development of deep convolutional neural network, face
detection has made great progress in recent years. WIDER FACE dataset, as a
main benchmark, contributes greatly to this area. A large amount of methods
have been put forward where PyramidBox designs an effective data augmentation
strategy (Data-anc... | [
{
"created": "Sun, 31 Mar 2019 11:44:31 GMT",
"version": "v1"
}
] | 2019-04-02 | [
[
"Li",
"Zhihang",
""
],
[
"Tang",
"Xu",
""
],
[
"Han",
"Junyu",
""
],
[
"Liu",
"Jingtuo",
""
],
[
"He",
"Ran",
""
]
] | With the rapid development of deep convolutional neural network, face detection has made great progress in recent years. WIDER FACE dataset, as a main benchmark, contributes greatly to this area. A large amount of methods have been put forward where PyramidBox designs an effective data augmentation strategy (Data-ancho... |
1903.00796 | Chunlei Liu | Chunlei Liu | Proof of Mining in Blockchain Systems | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a proof of mining system. Roughly speaking, in this system the
mining stake ${\rm mstak}(A)$ with discrimination index $a\in[0,1]$ of an
account $A$ is defined by the formula: $${\rm mstak}(A)=(1-a)\cdot\frac{1}{{\rm
NOM}}+a\cdot\frac{{\rm NOBM}(A)}{L},$$ where $L$ is the length of the
block-chain, ${\rm N... | [
{
"created": "Sun, 3 Mar 2019 00:04:10 GMT",
"version": "v1"
}
] | 2019-03-05 | [
[
"Liu",
"Chunlei",
""
]
] | We propose a proof of mining system. Roughly speaking, in this system the mining stake ${\rm mstak}(A)$ with discrimination index $a\in[0,1]$ of an account $A$ is defined by the formula: $${\rm mstak}(A)=(1-a)\cdot\frac{1}{{\rm NOM}}+a\cdot\frac{{\rm NOBM}(A)}{L},$$ where $L$ is the length of the block-chain, ${\rm NOM... |
1912.07363 | Heidi Komkov | Heidi Komkov, Alessandro Restelli, Brian Hunt, Liam Shaughnessy,
Itamar Shani, Daniel P. Lathrop | The Recurrent Processing Unit: Hardware for High Speed Machine Learning | null | null | null | null | cs.ET | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Machine learning applications are computationally demanding and power
intensive. Hardware acceleration of these software tools is a natural step
being explored using various technologies. A recurrent processing unit (RPU) is
fast and power-efficient hardware for machine learning under development at the
University of... | [
{
"created": "Thu, 12 Dec 2019 23:28:32 GMT",
"version": "v1"
}
] | 2019-12-17 | [
[
"Komkov",
"Heidi",
""
],
[
"Restelli",
"Alessandro",
""
],
[
"Hunt",
"Brian",
""
],
[
"Shaughnessy",
"Liam",
""
],
[
"Shani",
"Itamar",
""
],
[
"Lathrop",
"Daniel P.",
""
]
] | Machine learning applications are computationally demanding and power intensive. Hardware acceleration of these software tools is a natural step being explored using various technologies. A recurrent processing unit (RPU) is fast and power-efficient hardware for machine learning under development at the University of M... |
2308.08479 | Johan Edstedt | Johan Edstedt, Georg B\"okman, M{\aa}rten Wadenb\"ack, Michael
Felsberg | DeDoDe: Detect, Don't Describe -- Describe, Don't Detect for Local
Feature Matching | Accepted to 3DV 2024 (Oral) | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Keypoint detection is a pivotal step in 3D reconstruction, whereby sets of
(up to) K points are detected in each view of a scene. Crucially, the detected
points need to be consistent between views, i.e., correspond to the same 3D
point in the scene. One of the main challenges with keypoint detection is the
formulatio... | [
{
"created": "Wed, 16 Aug 2023 16:37:02 GMT",
"version": "v1"
},
{
"created": "Sun, 3 Sep 2023 10:43:12 GMT",
"version": "v2"
},
{
"created": "Mon, 11 Dec 2023 14:16:50 GMT",
"version": "v3"
}
] | 2023-12-12 | [
[
"Edstedt",
"Johan",
""
],
[
"Bökman",
"Georg",
""
],
[
"Wadenbäck",
"Mårten",
""
],
[
"Felsberg",
"Michael",
""
]
] | Keypoint detection is a pivotal step in 3D reconstruction, whereby sets of (up to) K points are detected in each view of a scene. Crucially, the detected points need to be consistent between views, i.e., correspond to the same 3D point in the scene. One of the main challenges with keypoint detection is the formulation ... |
2010.14069 | Melanie Bancilhon | Melanie Bancilhon, Zhengliang Liu, Alvitta Ottley | Let's Gamble: How a Poor Visualization Can Elicit Risky Behavior | arXiv admin note: substantial text overlap with arXiv:1910.09725 | null | null | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Data visualizations are standard tools for assessing and communicating risks.
However, it is not always clear which designs are optimal or how encoding
choices might influence risk perception and decision-making. In this paper, we
report the findings of a large-scale gambling game that immersed participants
in an env... | [
{
"created": "Sun, 25 Oct 2020 08:39:33 GMT",
"version": "v1"
}
] | 2020-10-28 | [
[
"Bancilhon",
"Melanie",
""
],
[
"Liu",
"Zhengliang",
""
],
[
"Ottley",
"Alvitta",
""
]
] | Data visualizations are standard tools for assessing and communicating risks. However, it is not always clear which designs are optimal or how encoding choices might influence risk perception and decision-making. In this paper, we report the findings of a large-scale gambling game that immersed participants in an envir... |
2312.02161 | Uday Kumar Reddy Vengalam | Uday Kumar Reddy Vengalam, Andrew Hahn, Yongchao Liu, Anshujit Sharma,
Hui Wu, and Michael Huang | Efficient LDPC Decoding using Physical Computation | null | null | null | null | cs.IT cs.NE math.IT | http://creativecommons.org/licenses/by/4.0/ | Due to 5G deployment, there is significant interest in LDPC decoding. While
much research is devoted on efficient hardwiring of algorithms based on Belief
Propagation (BP), it has been shown that LDPC decoding can be formulated as a
combinatorial optimization problem, which could benefit from significant
acceleration... | [
{
"created": "Thu, 21 Sep 2023 01:39:07 GMT",
"version": "v1"
}
] | 2023-12-06 | [
[
"Vengalam",
"Uday Kumar Reddy",
""
],
[
"Hahn",
"Andrew",
""
],
[
"Liu",
"Yongchao",
""
],
[
"Sharma",
"Anshujit",
""
],
[
"Wu",
"Hui",
""
],
[
"Huang",
"Michael",
""
]
] | Due to 5G deployment, there is significant interest in LDPC decoding. While much research is devoted on efficient hardwiring of algorithms based on Belief Propagation (BP), it has been shown that LDPC decoding can be formulated as a combinatorial optimization problem, which could benefit from significant acceleration o... |
1401.0432 | G Ramakrishna | N.S. Narayanaswamy and G. Ramakrishna | On Minimum Average Stretch Spanning Trees in Polygonal 2-trees | 17 pages, 12 figures | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A spanning tree of an unweighted graph is a minimum average stretch spanning
tree if it minimizes the ratio of sum of the distances in the tree between the
end vertices of the graph edges and the number of graph edges. We consider the
problem of computing a minimum average stretch spanning tree in polygonal
2-trees, ... | [
{
"created": "Thu, 2 Jan 2014 13:31:13 GMT",
"version": "v1"
},
{
"created": "Mon, 14 Apr 2014 07:37:46 GMT",
"version": "v2"
}
] | 2014-04-15 | [
[
"Narayanaswamy",
"N. S.",
""
],
[
"Ramakrishna",
"G.",
""
]
] | A spanning tree of an unweighted graph is a minimum average stretch spanning tree if it minimizes the ratio of sum of the distances in the tree between the end vertices of the graph edges and the number of graph edges. We consider the problem of computing a minimum average stretch spanning tree in polygonal 2-trees, a ... |
2108.02448 | Weihao Yuan | Weihao Yuan, Rui Fan, Michael Yu Wang, Qifeng Chen | MFuseNet: Robust Depth Estimation with Learned Multiscopic Fusion | IEEE International Conference on Robotics and Automation (ICRA) +
IEEE Robotics and Automation Letters (RA-L). arXiv admin note: substantial
text overlap with arXiv:2001.08212 | null | 10.1109/LRA.2020.2974422 | null | cs.CV cs.AI cs.RO | http://creativecommons.org/licenses/by/4.0/ | We design a multiscopic vision system that utilizes a low-cost monocular RGB
camera to acquire accurate depth estimation. Unlike multi-view stereo with
images captured at unconstrained camera poses, the proposed system controls the
motion of a camera to capture a sequence of images in horizontally or
vertically align... | [
{
"created": "Thu, 5 Aug 2021 08:31:01 GMT",
"version": "v1"
},
{
"created": "Fri, 6 Aug 2021 07:31:12 GMT",
"version": "v2"
}
] | 2021-08-21 | [
[
"Yuan",
"Weihao",
""
],
[
"Fan",
"Rui",
""
],
[
"Wang",
"Michael Yu",
""
],
[
"Chen",
"Qifeng",
""
]
] | We design a multiscopic vision system that utilizes a low-cost monocular RGB camera to acquire accurate depth estimation. Unlike multi-view stereo with images captured at unconstrained camera poses, the proposed system controls the motion of a camera to capture a sequence of images in horizontally or vertically aligned... |
2212.14376 | Alexey Zakharov | Alexey Zakharov, Qinghai Guo, Zafeirios Fountas | Long-horizon video prediction using a dynamic latent hierarchy | null | null | null | null | cs.LG cs.AI cs.CV | http://creativecommons.org/licenses/by/4.0/ | The task of video prediction and generation is known to be notoriously
difficult, with the research in this area largely limited to short-term
predictions. Though plagued with noise and stochasticity, videos consist of
features that are organised in a spatiotemporal hierarchy, different features
possessing different ... | [
{
"created": "Thu, 29 Dec 2022 17:19:28 GMT",
"version": "v1"
},
{
"created": "Mon, 9 Jan 2023 18:08:09 GMT",
"version": "v2"
}
] | 2023-01-10 | [
[
"Zakharov",
"Alexey",
""
],
[
"Guo",
"Qinghai",
""
],
[
"Fountas",
"Zafeirios",
""
]
] | The task of video prediction and generation is known to be notoriously difficult, with the research in this area largely limited to short-term predictions. Though plagued with noise and stochasticity, videos consist of features that are organised in a spatiotemporal hierarchy, different features possessing different te... |
2002.07394 | Junnan Li Dr | Junnan Li, Richard Socher, Steven C.H. Hoi | DivideMix: Learning with Noisy Labels as Semi-supervised Learning | null | International Conference on Learning Representations, 2020 | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep neural networks are known to be annotation-hungry. Numerous efforts have
been devoted to reducing the annotation cost when learning with deep networks.
Two prominent directions include learning with noisy labels and semi-supervised
learning by exploiting unlabeled data. In this work, we propose DivideMix, a
nove... | [
{
"created": "Tue, 18 Feb 2020 06:20:06 GMT",
"version": "v1"
}
] | 2020-02-20 | [
[
"Li",
"Junnan",
""
],
[
"Socher",
"Richard",
""
],
[
"Hoi",
"Steven C. H.",
""
]
] | Deep neural networks are known to be annotation-hungry. Numerous efforts have been devoted to reducing the annotation cost when learning with deep networks. Two prominent directions include learning with noisy labels and semi-supervised learning by exploiting unlabeled data. In this work, we propose DivideMix, a novel ... |
1601.01183 | Tong-Xing Zheng | Tong-Xing Zheng, and Hui-Ming Wang | Optimal Power Allocation for Artificial Noise under Imperfect CSI
against Spatially Random Eavesdroppers | 7 pages, 6 figures | null | 10.1109/TVT.2015.2513003 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this correspondence, we study the secure multiantenna transmission with
artificial noise (AN) under imperfect channel state information in the presence
of spatially randomly distributed eavesdroppers. We derive the optimal
solutions of the power allocation between the information signal and the AN for
minimizing t... | [
{
"created": "Wed, 6 Jan 2016 14:10:33 GMT",
"version": "v1"
}
] | 2016-01-07 | [
[
"Zheng",
"Tong-Xing",
""
],
[
"Wang",
"Hui-Ming",
""
]
] | In this correspondence, we study the secure multiantenna transmission with artificial noise (AN) under imperfect channel state information in the presence of spatially randomly distributed eavesdroppers. We derive the optimal solutions of the power allocation between the information signal and the AN for minimizing the... |
2001.11846 | Marcos Eduardo Valle | Marcos Eduardo Valle and Rodolfo Anibal Lobo | Quaternion-Valued Recurrent Projection Neural Networks on Unit
Quaternions | arXiv admin note: substantial text overlap with arXiv:1909.09227 | null | 10.1016/j.tcs.2020.08.033 | null | cs.LG cs.NE stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Hypercomplex-valued neural networks, including quaternion-valued neural
networks, can treat multi-dimensional data as a single entity. In this paper,
we present the quaternion-valued recurrent projection neural networks (QRPNNs).
Briefly, QRPNNs are obtained by combining the non-local projection learning
with the qua... | [
{
"created": "Thu, 30 Jan 2020 11:25:45 GMT",
"version": "v1"
}
] | 2020-09-14 | [
[
"Valle",
"Marcos Eduardo",
""
],
[
"Lobo",
"Rodolfo Anibal",
""
]
] | Hypercomplex-valued neural networks, including quaternion-valued neural networks, can treat multi-dimensional data as a single entity. In this paper, we present the quaternion-valued recurrent projection neural networks (QRPNNs). Briefly, QRPNNs are obtained by combining the non-local projection learning with the quate... |
2406.06623 | Fernando Fernandes Neto | Eric Hartford and Lucas Atkins and Fernando Fernandes Neto and David
Golchinfar | Spectrum: Targeted Training on Signal to Noise Ratio | null | null | null | null | cs.LG stat.ML | http://creativecommons.org/licenses/by/4.0/ | Efficiently post-training large language models remains a challenging task
due to the vast computational resources required. We present Spectrum, a method
that accelerates LLM training by selectively targeting layer modules based on
their signal-to-noise ratio (SNR), and freezing the remaining modules. Our
approach, ... | [
{
"created": "Fri, 7 Jun 2024 21:20:57 GMT",
"version": "v1"
}
] | 2024-06-12 | [
[
"Hartford",
"Eric",
""
],
[
"Atkins",
"Lucas",
""
],
[
"Neto",
"Fernando Fernandes",
""
],
[
"Golchinfar",
"David",
""
]
] | Efficiently post-training large language models remains a challenging task due to the vast computational resources required. We present Spectrum, a method that accelerates LLM training by selectively targeting layer modules based on their signal-to-noise ratio (SNR), and freezing the remaining modules. Our approach, wh... |
2406.19354 | Peter Hase | Peter Hase, Thomas Hofweber, Xiang Zhou, Elias Stengel-Eskin, Mohit
Bansal | Fundamental Problems With Model Editing: How Should Rational Belief
Revision Work in LLMs? | 23 pages, 4 figures | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The model editing problem concerns how language models should learn new facts
about the world over time. While empirical research on model editing has drawn
widespread attention, the conceptual foundations of model editing remain shaky
-- perhaps unsurprisingly, since model editing is essentially belief revision,
a s... | [
{
"created": "Thu, 27 Jun 2024 17:33:03 GMT",
"version": "v1"
}
] | 2024-06-28 | [
[
"Hase",
"Peter",
""
],
[
"Hofweber",
"Thomas",
""
],
[
"Zhou",
"Xiang",
""
],
[
"Stengel-Eskin",
"Elias",
""
],
[
"Bansal",
"Mohit",
""
]
] | The model editing problem concerns how language models should learn new facts about the world over time. While empirical research on model editing has drawn widespread attention, the conceptual foundations of model editing remain shaky -- perhaps unsurprisingly, since model editing is essentially belief revision, a sto... |
1109.0807 | Reinhard Heckel | Reinhard Heckel, Steffen Schober, Martin Bossert | Harmonic Analysis of Boolean Networks: Determinative Power and
Perturbations | null | EURASIP Journal on Bioinformatics and Systems Biology 2013, 2013:6 | 10.1186/1687-4153-2013-6 | null | cs.IT cond-mat.dis-nn math.IT q-bio.MN | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Consider a large Boolean network with a feed forward structure. Given a
probability distribution on the inputs, can one find, possibly small,
collections of input nodes that determine the states of most other nodes in the
network? To answer this question, a notion that quantifies the determinative
power of an input o... | [
{
"created": "Mon, 5 Sep 2011 06:46:07 GMT",
"version": "v1"
},
{
"created": "Tue, 21 May 2013 20:02:24 GMT",
"version": "v2"
}
] | 2013-05-23 | [
[
"Heckel",
"Reinhard",
""
],
[
"Schober",
"Steffen",
""
],
[
"Bossert",
"Martin",
""
]
] | Consider a large Boolean network with a feed forward structure. Given a probability distribution on the inputs, can one find, possibly small, collections of input nodes that determine the states of most other nodes in the network? To answer this question, a notion that quantifies the determinative power of an input ove... |
1006.1343 | Fionn Murtagh | Fionn Murtagh and Adam Ganz | Segmentation and Nodal Points in Narrative: Study of Multiple Variations
of a Ballad | 27 pp., 13 figures. Submitted | null | null | null | cs.CL stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Lady Maisry ballads afford us a framework within which to segment a
storyline into its major components. Segments and as a consequence nodal points
are discussed for nine different variants of the Lady Maisry story of a (young)
woman being burnt to death by her family, on account of her becoming pregnant
by a for... | [
{
"created": "Mon, 7 Jun 2010 19:36:18 GMT",
"version": "v1"
}
] | 2010-06-08 | [
[
"Murtagh",
"Fionn",
""
],
[
"Ganz",
"Adam",
""
]
] | The Lady Maisry ballads afford us a framework within which to segment a storyline into its major components. Segments and as a consequence nodal points are discussed for nine different variants of the Lady Maisry story of a (young) woman being burnt to death by her family, on account of her becoming pregnant by a forei... |
1906.07038 | Alessio Quaglino PhD | Alessio Quaglino, Marco Gallieri, Jonathan Masci, Jan Koutn\'ik | SNODE: Spectral Discretization of Neural ODEs for System Identification | Published as a conference paper at ICLR 2020 | null | null | null | cs.NE cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper proposes the use of spectral element methods
\citep{canuto_spectral_1988} for fast and accurate training of Neural Ordinary
Differential Equations (ODE-Nets; \citealp{Chen2018NeuralOD}) for system
identification. This is achieved by expressing their dynamics as a truncated
series of Legendre polynomials. T... | [
{
"created": "Mon, 17 Jun 2019 13:54:30 GMT",
"version": "v1"
},
{
"created": "Fri, 17 Jan 2020 14:43:34 GMT",
"version": "v2"
}
] | 2020-01-20 | [
[
"Quaglino",
"Alessio",
""
],
[
"Gallieri",
"Marco",
""
],
[
"Masci",
"Jonathan",
""
],
[
"Koutník",
"Jan",
""
]
] | This paper proposes the use of spectral element methods \citep{canuto_spectral_1988} for fast and accurate training of Neural Ordinary Differential Equations (ODE-Nets; \citealp{Chen2018NeuralOD}) for system identification. This is achieved by expressing their dynamics as a truncated series of Legendre polynomials. The... |
1607.02784 | Duc-Thuan Vo | Duc-Thuan Vo and Ebrahim Bagheri | Open Information Extraction | This paper will appear in the Encyclopedia for Semantic Computing | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Open Information Extraction (Open IE) systems aim to obtain relation tuples
with highly scalable extraction in portable across domain by identifying a
variety of relation phrases and their arguments in arbitrary sentences. The
first generation of Open IE learns linear chain models based on unlexicalized
features such... | [
{
"created": "Sun, 10 Jul 2016 20:39:24 GMT",
"version": "v1"
}
] | 2016-07-12 | [
[
"Vo",
"Duc-Thuan",
""
],
[
"Bagheri",
"Ebrahim",
""
]
] | Open Information Extraction (Open IE) systems aim to obtain relation tuples with highly scalable extraction in portable across domain by identifying a variety of relation phrases and their arguments in arbitrary sentences. The first generation of Open IE learns linear chain models based on unlexicalized features such a... |
2101.05453 | Jian Li | Jian Li, Raziel Alvarez | On the quantization of recurrent neural networks | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Integer quantization of neural networks can be defined as the approximation
of the high precision computation of the canonical neural network formulation,
using reduced integer precision. It plays a significant role in the efficient
deployment and execution of machine learning (ML) systems, reducing memory
consumptio... | [
{
"created": "Thu, 14 Jan 2021 04:25:08 GMT",
"version": "v1"
}
] | 2021-01-15 | [
[
"Li",
"Jian",
""
],
[
"Alvarez",
"Raziel",
""
]
] | Integer quantization of neural networks can be defined as the approximation of the high precision computation of the canonical neural network formulation, using reduced integer precision. It plays a significant role in the efficient deployment and execution of machine learning (ML) systems, reducing memory consumption ... |
2112.13305 | Wenhao Zhu | Wenhao Zhu, Ziyao Li, Lingsheng Cai, Guojie Song | Stepping Back to SMILES Transformers for Fast Molecular Representation
Inference | 15 pages, 2 figures, appendix included | null | null | null | cs.CE | http://creativecommons.org/licenses/by-sa/4.0/ | In the intersection of molecular science and deep learning, tasks like
virtual screening have driven the need for a high-throughput molecular
representation generator on large chemical databases. However, as SMILES
strings are the most common storage format for molecules, using deep graph
models to extract molecular ... | [
{
"created": "Sun, 26 Dec 2021 01:35:54 GMT",
"version": "v1"
}
] | 2021-12-28 | [
[
"Zhu",
"Wenhao",
""
],
[
"Li",
"Ziyao",
""
],
[
"Cai",
"Lingsheng",
""
],
[
"Song",
"Guojie",
""
]
] | In the intersection of molecular science and deep learning, tasks like virtual screening have driven the need for a high-throughput molecular representation generator on large chemical databases. However, as SMILES strings are the most common storage format for molecules, using deep graph models to extract molecular fe... |
1703.04935 | Nikolaos Giatsoglou | Nikolaos Giatsoglou, Konstantinos Ntontin, Elli Kartsakli, Angelos
Antonopoulos, Christos Verikoukis | D2D-Aware Device Caching in MmWave-Cellular Networks | added main body of the paper | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a novel policy for device caching that facilitates
popular content exchange through high-rate device-to-device (D2D)
millimeter-wave (mmWave) communication. The D2D-aware caching (DAC) policy
splits the cacheable content into two content groups and distributes it
randomly to the user equipme... | [
{
"created": "Wed, 15 Mar 2017 05:28:33 GMT",
"version": "v1"
},
{
"created": "Tue, 16 May 2017 15:43:07 GMT",
"version": "v2"
}
] | 2017-05-17 | [
[
"Giatsoglou",
"Nikolaos",
""
],
[
"Ntontin",
"Konstantinos",
""
],
[
"Kartsakli",
"Elli",
""
],
[
"Antonopoulos",
"Angelos",
""
],
[
"Verikoukis",
"Christos",
""
]
] | In this paper, we propose a novel policy for device caching that facilitates popular content exchange through high-rate device-to-device (D2D) millimeter-wave (mmWave) communication. The D2D-aware caching (DAC) policy splits the cacheable content into two content groups and distributes it randomly to the user equipment... |
2402.12343 | Zhanhui Zhou | Zhanhui Zhou, Jie Liu, Zhichen Dong, Jiaheng Liu, Chao Yang, Wanli
Ouyang, Yu Qiao | Emulated Disalignment: Safety Alignment for Large Language Models May
Backfire! | ACL 2024 | null | null | null | cs.CL cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Large language models (LLMs) undergo safety alignment to ensure safe
conversations with humans. However, this paper introduces a training-free
attack method capable of reversing safety alignment, converting the outcomes of
stronger alignment into greater potential for harm by accessing only LLM output
token distribut... | [
{
"created": "Mon, 19 Feb 2024 18:16:51 GMT",
"version": "v1"
},
{
"created": "Wed, 21 Feb 2024 16:29:18 GMT",
"version": "v2"
},
{
"created": "Wed, 3 Apr 2024 12:25:47 GMT",
"version": "v3"
},
{
"created": "Thu, 6 Jun 2024 12:54:48 GMT",
"version": "v4"
}
] | 2024-06-07 | [
[
"Zhou",
"Zhanhui",
""
],
[
"Liu",
"Jie",
""
],
[
"Dong",
"Zhichen",
""
],
[
"Liu",
"Jiaheng",
""
],
[
"Yang",
"Chao",
""
],
[
"Ouyang",
"Wanli",
""
],
[
"Qiao",
"Yu",
""
]
] | Large language models (LLMs) undergo safety alignment to ensure safe conversations with humans. However, this paper introduces a training-free attack method capable of reversing safety alignment, converting the outcomes of stronger alignment into greater potential for harm by accessing only LLM output token distributio... |
2101.03722 | Jagruti Sahoo | Jagruti Sahoo, Kristin Barrett | Internet of Things (IoT) Application Model for Smart Farming | Submitted to IEEE Conference | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Smart Farming has brought a major transformation in the agriculture process
by using the Internet of Things (IoT) devices, emerging technologies such as
cloud computing, fog computing, and data analytics. It allows farmers to have
real-time awareness of the farm and help them make smart and informed
decisions. In thi... | [
{
"created": "Mon, 11 Jan 2021 06:23:00 GMT",
"version": "v1"
}
] | 2021-01-12 | [
[
"Sahoo",
"Jagruti",
""
],
[
"Barrett",
"Kristin",
""
]
] | Smart Farming has brought a major transformation in the agriculture process by using the Internet of Things (IoT) devices, emerging technologies such as cloud computing, fog computing, and data analytics. It allows farmers to have real-time awareness of the farm and help them make smart and informed decisions. In this ... |
1408.1271 | EPTCS | Johannes Borgstr\"om (Uppsala University), Silvia Crafa (University of
Padova) | Proceedings Combined 21st International Workshop on Expressiveness in
Concurrency and 11th Workshop on Structural Operational Semantics | null | EPTCS 160, 2014 | 10.4204/EPTCS.160 | null | cs.LO cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This volume contains the proceedings of the Combined 21st International
Workshop on Expressiveness in Concurrency and the 11th Workshop on Structural
Operational Semantics (EXPRESS/SOS 2014) which was held on 1st September 2014
in Rome, Italy, as an affiliated workshop of CONCUR 2014, the 25th
International Conferenc... | [
{
"created": "Wed, 6 Aug 2014 13:21:29 GMT",
"version": "v1"
}
] | 2014-08-07 | [
[
"Borgström",
"Johannes",
"",
"Uppsala University"
],
[
"Crafa",
"Silvia",
"",
"University of\n Padova"
]
] | This volume contains the proceedings of the Combined 21st International Workshop on Expressiveness in Concurrency and the 11th Workshop on Structural Operational Semantics (EXPRESS/SOS 2014) which was held on 1st September 2014 in Rome, Italy, as an affiliated workshop of CONCUR 2014, the 25th International Conference ... |
1810.03234 | Rickard Br\"uel Gabrielsson | Rickard Br\"uel Gabrielsson and Gunnar Carlsson | Exposition and Interpretation of the Topology of Neural Networks | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Convolutional neural networks (CNN's) are powerful and widely used tools.
However, their interpretability is far from ideal. One such shortcoming is the
difficulty of deducing a network's ability to generalize to unseen data. We use
topological data analysis to show that the information encoded in the weights
of a CN... | [
{
"created": "Mon, 8 Oct 2018 00:34:25 GMT",
"version": "v1"
},
{
"created": "Tue, 27 Nov 2018 16:21:07 GMT",
"version": "v2"
},
{
"created": "Fri, 18 Oct 2019 04:24:28 GMT",
"version": "v3"
}
] | 2019-10-21 | [
[
"Gabrielsson",
"Rickard Brüel",
""
],
[
"Carlsson",
"Gunnar",
""
]
] | Convolutional neural networks (CNN's) are powerful and widely used tools. However, their interpretability is far from ideal. One such shortcoming is the difficulty of deducing a network's ability to generalize to unseen data. We use topological data analysis to show that the information encoded in the weights of a CNN ... |
1811.08933 | Deval Shah | Jonathan Lew, Deval Shah, Suchita Pati, Shaylin Cattell, Mengchi
Zhang, Amruth Sandhupatla, Christopher Ng, Negar Goli, Matthew D. Sinclair,
Timothy G. Rogers, Tor Aamodt | Analyzing Machine Learning Workloads Using a Detailed GPU Simulator | Source code available at:
https://github.com/gpgpu-sim/gpgpu-sim_distribution/tree/dev | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Most deep neural networks deployed today are trained using GPUs via
high-level frameworks such as TensorFlow and PyTorch. This paper describes
changes we made to the GPGPU-Sim simulator to enable it to run PyTorch by
running PTX kernels included in NVIDIA's cuDNN library. We use the resulting
modified simulator, whic... | [
{
"created": "Sun, 18 Nov 2018 07:52:34 GMT",
"version": "v1"
},
{
"created": "Sat, 26 Jan 2019 23:24:48 GMT",
"version": "v2"
}
] | 2019-01-29 | [
[
"Lew",
"Jonathan",
""
],
[
"Shah",
"Deval",
""
],
[
"Pati",
"Suchita",
""
],
[
"Cattell",
"Shaylin",
""
],
[
"Zhang",
"Mengchi",
""
],
[
"Sandhupatla",
"Amruth",
""
],
[
"Ng",
"Christopher",
""
],
[
... | Most deep neural networks deployed today are trained using GPUs via high-level frameworks such as TensorFlow and PyTorch. This paper describes changes we made to the GPGPU-Sim simulator to enable it to run PyTorch by running PTX kernels included in NVIDIA's cuDNN library. We use the resulting modified simulator, which ... |
2312.01619 | Zhengyu Hu | Zhengyu Hu, Jieyu Zhang, Yue Yu, Yuchen Zhuang, Hui Xiong | How Many Validation Labels Do You Need? Exploring the Design Space of
Label-Efficient Model Ranking | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents LEMR (Label-Efficient Model Ranking) and introduces the
MoraBench Benchmark. LEMR is a novel framework that minimizes the need for
costly annotations in model selection by strategically annotating instances
from an unlabeled validation set. To evaluate LEMR, we leverage the MoraBench
Benchmark, a ... | [
{
"created": "Mon, 4 Dec 2023 04:20:38 GMT",
"version": "v1"
},
{
"created": "Wed, 6 Dec 2023 22:42:27 GMT",
"version": "v2"
},
{
"created": "Sat, 17 Feb 2024 13:42:03 GMT",
"version": "v3"
}
] | 2024-02-20 | [
[
"Hu",
"Zhengyu",
""
],
[
"Zhang",
"Jieyu",
""
],
[
"Yu",
"Yue",
""
],
[
"Zhuang",
"Yuchen",
""
],
[
"Xiong",
"Hui",
""
]
] | This paper presents LEMR (Label-Efficient Model Ranking) and introduces the MoraBench Benchmark. LEMR is a novel framework that minimizes the need for costly annotations in model selection by strategically annotating instances from an unlabeled validation set. To evaluate LEMR, we leverage the MoraBench Benchmark, a co... |
1610.06754 | Martin Strohmeier | Martin Strohmeier and Vincent Lenders and Ivan Martinovic | A Localization Approach for Crowdsourced Air Traffic Communication
Networks | 10 pages, 10 figures, 5 tables | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we argue that current state-of-the-art methods of aircraft
localization such as multilateration are insufficient, in particular for modern
crowdsourced air traffic networks with random, unplanned deployment geometry.
We propose an alternative, a grid-based localization approach using the
k-Nearest Neigh... | [
{
"created": "Fri, 21 Oct 2016 12:11:14 GMT",
"version": "v1"
}
] | 2016-10-24 | [
[
"Strohmeier",
"Martin",
""
],
[
"Lenders",
"Vincent",
""
],
[
"Martinovic",
"Ivan",
""
]
] | In this work, we argue that current state-of-the-art methods of aircraft localization such as multilateration are insufficient, in particular for modern crowdsourced air traffic networks with random, unplanned deployment geometry. We propose an alternative, a grid-based localization approach using the k-Nearest Neighbo... |
2401.15896 | Qingpei Guo | Qingpei Guo, Furong Xu, Hanxiao Zhang, Wang Ren, Ziping Ma, Lin Ju,
Jian Wang, Jingdong Chen, Ming Yang | M2-Encoder: Advancing Bilingual Image-Text Understanding by Large-scale
Efficient Pretraining | null | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Vision-language foundation models like CLIP have revolutionized the field of
artificial intelligence. Nevertheless, VLM models supporting multi-language,
e.g., in both Chinese and English, have lagged due to the relative scarcity of
large-scale pretraining datasets. Toward this end, we introduce a comprehensive
bilin... | [
{
"created": "Mon, 29 Jan 2024 05:43:33 GMT",
"version": "v1"
},
{
"created": "Sun, 4 Feb 2024 04:30:07 GMT",
"version": "v2"
}
] | 2024-02-06 | [
[
"Guo",
"Qingpei",
""
],
[
"Xu",
"Furong",
""
],
[
"Zhang",
"Hanxiao",
""
],
[
"Ren",
"Wang",
""
],
[
"Ma",
"Ziping",
""
],
[
"Ju",
"Lin",
""
],
[
"Wang",
"Jian",
""
],
[
"Chen",
"Jingdong",
... | Vision-language foundation models like CLIP have revolutionized the field of artificial intelligence. Nevertheless, VLM models supporting multi-language, e.g., in both Chinese and English, have lagged due to the relative scarcity of large-scale pretraining datasets. Toward this end, we introduce a comprehensive bilingu... |
1805.11546 | Alexander Ororbia | Alexander G. Ororbia, Ankur Mali, Matthew A. Kelly, and David Reitter | Like a Baby: Visually Situated Neural Language Acquisition | Final submission (camera-ready), accepted to ACL 2019 | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We examine the benefits of visual context in training neural language models
to perform next-word prediction. A multi-modal neural architecture is
introduced that outperform its equivalent trained on language alone with a 2\%
decrease in perplexity, even when no visual context is available at test.
Fine-tuning the em... | [
{
"created": "Tue, 29 May 2018 15:53:30 GMT",
"version": "v1"
},
{
"created": "Tue, 4 Jun 2019 05:11:20 GMT",
"version": "v2"
}
] | 2019-06-05 | [
[
"Ororbia",
"Alexander G.",
""
],
[
"Mali",
"Ankur",
""
],
[
"Kelly",
"Matthew A.",
""
],
[
"Reitter",
"David",
""
]
] | We examine the benefits of visual context in training neural language models to perform next-word prediction. A multi-modal neural architecture is introduced that outperform its equivalent trained on language alone with a 2\% decrease in perplexity, even when no visual context is available at test. Fine-tuning the embe... |
1810.09506 | Ari Klein | Ari Z. Klein, Abeed Sarker, Davy Weissenbacher, Graciela
Gonzalez-Hernandez | Automatically Detecting Self-Reported Birth Defect Outcomes on Twitter
for Large-scale Epidemiological Research | null | npj Digital Medicine. 2019;2:96 | 10.1038/s41746-019-0170-5 | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In recent work, we identified and studied a small cohort of Twitter users
whose pregnancies with birth defect outcomes could be observed via their
publicly available tweets. Exploiting social media's large-scale potential to
complement the limited methods for studying birth defects, the leading cause of
infant mortal... | [
{
"created": "Mon, 22 Oct 2018 19:00:46 GMT",
"version": "v1"
}
] | 2019-10-03 | [
[
"Klein",
"Ari Z.",
""
],
[
"Sarker",
"Abeed",
""
],
[
"Weissenbacher",
"Davy",
""
],
[
"Gonzalez-Hernandez",
"Graciela",
""
]
] | In recent work, we identified and studied a small cohort of Twitter users whose pregnancies with birth defect outcomes could be observed via their publicly available tweets. Exploiting social media's large-scale potential to complement the limited methods for studying birth defects, the leading cause of infant mortalit... |
2401.06665 | Gianpietro Consolaro | Gianpietro Consolaro, Zhen Zhang, Harenome Razanajato, Nelson Lossing,
Nassim Tchoulak, Adilla Susungi, Artur Cesar Araujo Alves, Renwei Zhang,
Denis Barthou, Corinne Ancourt, Cedric Bastoul | PolyTOPS: Reconfigurable and Flexible Polyhedral Scheduler | 14 pages, bibliography included. The paper has been accepted to CGO
2024 and the publication and proceedings are ongoing. This is a preprint
version | null | null | null | cs.DC cs.CL cs.PF | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Polyhedral techniques have been widely used for automatic code optimization
in low-level compilers and higher-level processes. Loop optimization is central
to this technique, and several polyhedral schedulers like Feautrier, Pluto, isl
and Tensor Scheduler have been proposed, each of them targeting a different
archit... | [
{
"created": "Fri, 12 Jan 2024 16:11:27 GMT",
"version": "v1"
}
] | 2024-01-15 | [
[
"Consolaro",
"Gianpietro",
""
],
[
"Zhang",
"Zhen",
""
],
[
"Razanajato",
"Harenome",
""
],
[
"Lossing",
"Nelson",
""
],
[
"Tchoulak",
"Nassim",
""
],
[
"Susungi",
"Adilla",
""
],
[
"Alves",
"Artur Cesar Araujo... | Polyhedral techniques have been widely used for automatic code optimization in low-level compilers and higher-level processes. Loop optimization is central to this technique, and several polyhedral schedulers like Feautrier, Pluto, isl and Tensor Scheduler have been proposed, each of them targeting a different architec... |
2307.14928 | Emanuele Cosenza | Emanuele Cosenza, Andrea Valenti, Davide Bacciu | Graph-based Polyphonic Multitrack Music Generation | null | null | null | null | cs.SD cs.LG eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Graphs can be leveraged to model polyphonic multitrack symbolic music, where
notes, chords and entire sections may be linked at different levels of the
musical hierarchy by tonal and rhythmic relationships. Nonetheless, there is a
lack of works that consider graph representations in the context of deep
learning syste... | [
{
"created": "Thu, 27 Jul 2023 15:18:50 GMT",
"version": "v1"
}
] | 2023-07-28 | [
[
"Cosenza",
"Emanuele",
""
],
[
"Valenti",
"Andrea",
""
],
[
"Bacciu",
"Davide",
""
]
] | Graphs can be leveraged to model polyphonic multitrack symbolic music, where notes, chords and entire sections may be linked at different levels of the musical hierarchy by tonal and rhythmic relationships. Nonetheless, there is a lack of works that consider graph representations in the context of deep learning systems... |
1404.4467 | Jan Egger | Robert Schwarzenberg, Bernd Freisleben, Christopher Nimsky, Jan Egger | Cube-Cut: Vertebral Body Segmentation in MRI-Data through Cubic-Shaped
Divergences | 23 figures, 2 tables, 43 references, PLoS ONE 9(4): e93389 | null | 10.1371/journal.pone.0093389 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this article, we present a graph-based method using a cubic template for
volumetric segmentation of vertebrae in magnetic resonance imaging (MRI)
acquisitions. The user can define the degree of deviation from a regular cube
via a smoothness value Delta. The Cube-Cut algorithm generates a directed graph
with two te... | [
{
"created": "Thu, 17 Apr 2014 09:58:28 GMT",
"version": "v1"
},
{
"created": "Tue, 22 Jul 2014 17:40:56 GMT",
"version": "v2"
}
] | 2015-06-19 | [
[
"Schwarzenberg",
"Robert",
""
],
[
"Freisleben",
"Bernd",
""
],
[
"Nimsky",
"Christopher",
""
],
[
"Egger",
"Jan",
""
]
] | In this article, we present a graph-based method using a cubic template for volumetric segmentation of vertebrae in magnetic resonance imaging (MRI) acquisitions. The user can define the degree of deviation from a regular cube via a smoothness value Delta. The Cube-Cut algorithm generates a directed graph with two term... |
2404.00988 | Xin'ao Feng | Xin'ao Feng, Yaohua Sun, Mugen Peng | Distributed Satellite-Terrestrial Cooperative Routing Strategy Based on
Minimum Hop-Count Analysis in Mega LEO Satellite Constellation | 16pages, 15 figures, published to IEEE Transactions on Mobile
Computing | IEEE Transactions on Mobile Computing, no. 01, pp. 1-16, 2024,
early access | 10.1109/TMC.2024.3380891 | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Mega low earth orbit (LEO) satellite constellation is promising in achieving
global coverage with high capacity. However, forwarding packets in mega
constellation faces long end-to-end delay caused by multi-hop routing and
high-complexity routing table construction, which will detrimentally impair the
network transmi... | [
{
"created": "Mon, 1 Apr 2024 08:31:28 GMT",
"version": "v1"
}
] | 2024-04-02 | [
[
"Feng",
"Xin'ao",
""
],
[
"Sun",
"Yaohua",
""
],
[
"Peng",
"Mugen",
""
]
] | Mega low earth orbit (LEO) satellite constellation is promising in achieving global coverage with high capacity. However, forwarding packets in mega constellation faces long end-to-end delay caused by multi-hop routing and high-complexity routing table construction, which will detrimentally impair the network transmiss... |
2403.20204 | Junhao Xu | Junhao Xu, Longdi Xian, Zening Liu, Mingliang Chen, Qiuyang Yin,
Fenghua Song | The Future of Combating Rumors? Retrieval, Discrimination, and
Generation | 8 pages | null | null | null | cs.AI | http://creativecommons.org/licenses/by/4.0/ | Artificial Intelligence Generated Content (AIGC) technology development has
facilitated the creation of rumors with misinformation, impacting societal,
economic, and political ecosystems, challenging democracy. Current rumor
detection efforts fall short by merely labeling potentially misinformation
(classification ta... | [
{
"created": "Fri, 29 Mar 2024 14:32:41 GMT",
"version": "v1"
}
] | 2024-04-01 | [
[
"Xu",
"Junhao",
""
],
[
"Xian",
"Longdi",
""
],
[
"Liu",
"Zening",
""
],
[
"Chen",
"Mingliang",
""
],
[
"Yin",
"Qiuyang",
""
],
[
"Song",
"Fenghua",
""
]
] | Artificial Intelligence Generated Content (AIGC) technology development has facilitated the creation of rumors with misinformation, impacting societal, economic, and political ecosystems, challenging democracy. Current rumor detection efforts fall short by merely labeling potentially misinformation (classification task... |
2407.15909 | Pierre-Daniel Arsenault | Pierre-Daniel Arsenault, Shengrui Wang and Jean-Marc Patenande | A Survey of Explainable Artificial Intelligence (XAI) in Financial Time
Series Forecasting | 35 pages, This is the author's version of the work. It is posted here
for your personal use. Not for redistribution. The definitive Version of
Record will be published in a journal soon | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Artificial Intelligence (AI) models have reached a very significant level of
accuracy. While their superior performance offers considerable benefits, their
inherent complexity often decreases human trust, which slows their application
in high-risk decision-making domains, such as finance. The field of eXplainable
AI ... | [
{
"created": "Mon, 22 Jul 2024 17:06:19 GMT",
"version": "v1"
}
] | 2024-07-24 | [
[
"Arsenault",
"Pierre-Daniel",
""
],
[
"Wang",
"Shengrui",
""
],
[
"Patenande",
"Jean-Marc",
""
]
] | Artificial Intelligence (AI) models have reached a very significant level of accuracy. While their superior performance offers considerable benefits, their inherent complexity often decreases human trust, which slows their application in high-risk decision-making domains, such as finance. The field of eXplainable AI (X... |
2403.07142 | Ali Abbasi | Ali Abbasi, Ashkan Shahbazi, Hamed Pirsiavash, Soheil Kolouri | One Category One Prompt: Dataset Distillation using Diffusion Models | null | null | null | null | cs.CV cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The extensive amounts of data required for training deep neural networks pose
significant challenges on storage and transmission fronts. Dataset distillation
has emerged as a promising technique to condense the information of massive
datasets into a much smaller yet representative set of synthetic samples.
However, t... | [
{
"created": "Mon, 11 Mar 2024 20:23:59 GMT",
"version": "v1"
}
] | 2024-03-13 | [
[
"Abbasi",
"Ali",
""
],
[
"Shahbazi",
"Ashkan",
""
],
[
"Pirsiavash",
"Hamed",
""
],
[
"Kolouri",
"Soheil",
""
]
] | The extensive amounts of data required for training deep neural networks pose significant challenges on storage and transmission fronts. Dataset distillation has emerged as a promising technique to condense the information of massive datasets into a much smaller yet representative set of synthetic samples. However, tra... |
1801.00824 | Chinmay Chinara | Chinmay Chinara, Nishant Nath, Subhajeet Mishra, Sangram Keshari Sahoo
and Farida Ashraf Ali | A Novel Approach to Skew-Detection and Correction of English Alphabets
for OCR | 4 pages, 11 figures, 8 references, 2012 IEEE Student Conference on
Research and Development | IEEE SCOReD, 2012, Page 241-244 | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Optical Character Recognition has been a challenging field in the advent of
digital computers. It is needed where information is to be readable both to
humans and machines. The process of OCR is composed of a set of pre and post
processing steps that decide the level of accuracy of recognition. This paper
deals with ... | [
{
"created": "Tue, 2 Jan 2018 20:25:59 GMT",
"version": "v1"
}
] | 2018-01-04 | [
[
"Chinara",
"Chinmay",
""
],
[
"Nath",
"Nishant",
""
],
[
"Mishra",
"Subhajeet",
""
],
[
"Sahoo",
"Sangram Keshari",
""
],
[
"Ali",
"Farida Ashraf",
""
]
] | Optical Character Recognition has been a challenging field in the advent of digital computers. It is needed where information is to be readable both to humans and machines. The process of OCR is composed of a set of pre and post processing steps that decide the level of accuracy of recognition. This paper deals with on... |
2108.01976 | Nils Kurbis | Nils K\"urbis | A Binary Quantifier for Definite Descriptions in Intuitionist Negative
Free Logic: Natural Deduction and Normalisation | null | Bulletin of the Section of Logic 48/2 (2019): 81-97 | 10.18778/0138-0680.48.2.01 | null | cs.LO math.LO | http://creativecommons.org/licenses/by-nc-nd/4.0/ | This paper presents a way of formalising definite descriptions with a binary
quantifier $\iota$, where $\iota x[F, G]$ is read as `The $F$ is $G$'.
Introduction and elimination rules for $\iota$ in a system of intuitionist
negative free logic are formulated. Procedures for removing maximal formulas of
the form $\iota... | [
{
"created": "Wed, 4 Aug 2021 11:33:03 GMT",
"version": "v1"
}
] | 2021-08-12 | [
[
"Kürbis",
"Nils",
""
]
] | This paper presents a way of formalising definite descriptions with a binary quantifier $\iota$, where $\iota x[F, G]$ is read as `The $F$ is $G$'. Introduction and elimination rules for $\iota$ in a system of intuitionist negative free logic are formulated. Procedures for removing maximal formulas of the form $\iota x... |
2404.05072 | Dima Damen | Chiara Plizzari, Shubham Goel, Toby Perrett, Jacob Chalk, Angjoo
Kanazawa, Dima Damen | Spatial Cognition from Egocentric Video: Out of Sight, Not Out of Mind | 21 pages including references and appendix. Project Webpage:
http://dimadamen.github.io/OSNOM/ | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As humans move around, performing their daily tasks, they are able to recall
where they have positioned objects in their environment, even if these objects
are currently out of sight. In this paper, we aim to mimic this spatial
cognition ability. We thus formulate the task of Out of Sight, Not Out of Mind
- 3D tracki... | [
{
"created": "Sun, 7 Apr 2024 21:00:14 GMT",
"version": "v1"
}
] | 2024-04-09 | [
[
"Plizzari",
"Chiara",
""
],
[
"Goel",
"Shubham",
""
],
[
"Perrett",
"Toby",
""
],
[
"Chalk",
"Jacob",
""
],
[
"Kanazawa",
"Angjoo",
""
],
[
"Damen",
"Dima",
""
]
] | As humans move around, performing their daily tasks, they are able to recall where they have positioned objects in their environment, even if these objects are currently out of sight. In this paper, we aim to mimic this spatial cognition ability. We thus formulate the task of Out of Sight, Not Out of Mind - 3D tracking... |
2406.00135 | Ahmed Heakl Mr | Youssef Mohamed, Zeyad Youssef, Ahmed Heakl, Ahmed Zaky | Advancing Ear Biometrics: Enhancing Accuracy and Robustness through Deep
Learning | 6 pages, 8 figures, 3 tables, International IEEE Conference on the
Intelligent Methods, Systems, and Applications | null | null | null | cs.CV cs.AI cs.HC cs.LG cs.MM | http://creativecommons.org/licenses/by/4.0/ | Biometric identification is a reliable method to verify individuals based on
their unique physical or behavioral traits, offering a secure alternative to
traditional methods like passwords or PINs. This study focuses on ear biometric
identification, exploiting its distinctive features for enhanced accuracy,
reliabili... | [
{
"created": "Fri, 31 May 2024 18:55:10 GMT",
"version": "v1"
}
] | 2024-06-04 | [
[
"Mohamed",
"Youssef",
""
],
[
"Youssef",
"Zeyad",
""
],
[
"Heakl",
"Ahmed",
""
],
[
"Zaky",
"Ahmed",
""
]
] | Biometric identification is a reliable method to verify individuals based on their unique physical or behavioral traits, offering a secure alternative to traditional methods like passwords or PINs. This study focuses on ear biometric identification, exploiting its distinctive features for enhanced accuracy, reliability... |
2206.13927 | Valentina Castiglioni | Luca Aceto, Valentina Castiglioni, Anna Ingolfsdottir, Bas Luttik | On the Axiomatisation of Branching Bisimulation Congruence over CCS | null | null | null | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we investigate the equational theory of (the restriction,
relabelling, and recursion free fragment of) CCS modulo rooted branching
bisimilarity, which is a classic, bisimulation-based notion of equivalence that
abstracts from internal computational steps in process behaviour. Firstly, we
show that CCS i... | [
{
"created": "Tue, 28 Jun 2022 12:01:26 GMT",
"version": "v1"
}
] | 2022-06-29 | [
[
"Aceto",
"Luca",
""
],
[
"Castiglioni",
"Valentina",
""
],
[
"Ingolfsdottir",
"Anna",
""
],
[
"Luttik",
"Bas",
""
]
] | In this paper we investigate the equational theory of (the restriction, relabelling, and recursion free fragment of) CCS modulo rooted branching bisimilarity, which is a classic, bisimulation-based notion of equivalence that abstracts from internal computational steps in process behaviour. Firstly, we show that CCS is ... |
2206.13386 | Olger Siebinga | Olger Siebinga, Arkady Zgonnikov, David Abbink | Uncovering variability in human driving behavior through automatic
extraction of similar traffic scenes from large naturalistic datasets | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Recently, multiple naturalistic traffic datasets of human-driven trajectories
have been published (e.g., highD, NGSim, and pNEUMA). These datasets have been
used in studies that investigate variability in human driving behavior, for
example for scenario-based validation of autonomous vehicle (AV) behavior,
modeling d... | [
{
"created": "Fri, 17 Jun 2022 06:59:51 GMT",
"version": "v1"
},
{
"created": "Wed, 15 Mar 2023 07:43:31 GMT",
"version": "v2"
}
] | 2023-03-16 | [
[
"Siebinga",
"Olger",
""
],
[
"Zgonnikov",
"Arkady",
""
],
[
"Abbink",
"David",
""
]
] | Recently, multiple naturalistic traffic datasets of human-driven trajectories have been published (e.g., highD, NGSim, and pNEUMA). These datasets have been used in studies that investigate variability in human driving behavior, for example for scenario-based validation of autonomous vehicle (AV) behavior, modeling dri... |
1401.1059 | Pulkit Grover | Pulkit Grover | "Information-Friction" and its implications on minimum energy required
for communication | Accepted in IEEE Trans. Information Theory; preliminary version
presented at ISIT '13 | null | 10.1109/TIT.2014.2365777 | null | cs.IT cs.CC math-ph math.IT math.MP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Just as there are frictional losses associated with moving masses on a
surface, what if there were frictional losses associated with moving
information on a substrate? Indeed, many modes of communication suffer from
such frictional losses. We propose to model these losses as proportional to
"bit-meters," i.e., the pr... | [
{
"created": "Mon, 6 Jan 2014 12:34:35 GMT",
"version": "v1"
},
{
"created": "Mon, 1 Sep 2014 11:52:42 GMT",
"version": "v2"
}
] | 2016-11-15 | [
[
"Grover",
"Pulkit",
""
]
] | Just as there are frictional losses associated with moving masses on a surface, what if there were frictional losses associated with moving information on a substrate? Indeed, many modes of communication suffer from such frictional losses. We propose to model these losses as proportional to "bit-meters," i.e., the prod... |
1701.03147 | Corneliu Arsene Dr | Corneliu T.C. Arsene | Uncertainty Quantification of Water Distribution System Measurement Data
based on a Least Squares Loop Flows State Estimator | 55 pages | null | null | null | cs.SY cs.CE math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a novel algorithm for uncertainty quantification of water
distribution system measurement data including nodal demands/consumptions as
well as real pressure and flow measurements. This procedure, referred to as
Confidence Limit Analysis (CLA), is concerned with a deployment of a Least
Squares (LS)... | [
{
"created": "Wed, 11 Jan 2017 20:14:45 GMT",
"version": "v1"
},
{
"created": "Sat, 14 Jan 2017 13:43:31 GMT",
"version": "v2"
}
] | 2017-01-17 | [
[
"Arsene",
"Corneliu T. C.",
""
]
] | This paper presents a novel algorithm for uncertainty quantification of water distribution system measurement data including nodal demands/consumptions as well as real pressure and flow measurements. This procedure, referred to as Confidence Limit Analysis (CLA), is concerned with a deployment of a Least Squares (LS) s... |
1603.08819 | Nina Luhmann | Nina Luhmann, Manuel Lafond, Annelyse Th\'evenin, A\"ida Ouangraoua,
Roland Wittler and Cedric Chauve | The SCJ small parsimony problem for weighted gene adjacencies (Extended
version) | null | null | null | null | cs.DS q-bio.GN | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Reconstructing ancestral gene orders in a given phylogeny is a classical
problem in comparative genomics. Most existing methods compare conserved
features in extant genomes in the phylogeny to define potential ancestral gene
adjacencies, and either try to reconstruct all ancestral genomes under a global
evolutionary ... | [
{
"created": "Tue, 29 Mar 2016 15:47:57 GMT",
"version": "v1"
},
{
"created": "Mon, 26 Sep 2016 12:43:55 GMT",
"version": "v2"
}
] | 2016-09-27 | [
[
"Luhmann",
"Nina",
""
],
[
"Lafond",
"Manuel",
""
],
[
"Thévenin",
"Annelyse",
""
],
[
"Ouangraoua",
"Aïda",
""
],
[
"Wittler",
"Roland",
""
],
[
"Chauve",
"Cedric",
""
]
] | Reconstructing ancestral gene orders in a given phylogeny is a classical problem in comparative genomics. Most existing methods compare conserved features in extant genomes in the phylogeny to define potential ancestral gene adjacencies, and either try to reconstruct all ancestral genomes under a global evolutionary pa... |
1509.05517 | Mikel Forcada Dr. | Gang Chen and Mikel L. Forcada | A Light Sliding-Window Part-of-Speech Tagger for the Apertium
Free/Open-Source Machine Translation Platform | null | null | null | null | cs.CL | http://creativecommons.org/licenses/by-sa/4.0/ | This paper describes a free/open-source implementation of the light
sliding-window (LSW) part-of-speech tagger for the Apertium free/open-source
machine translation platform. Firstly, the mechanism and training process of
the tagger are reviewed, and a new method for incorporating linguistic rules is
proposed. Second... | [
{
"created": "Fri, 18 Sep 2015 06:56:38 GMT",
"version": "v1"
}
] | 2015-09-21 | [
[
"Chen",
"Gang",
""
],
[
"Forcada",
"Mikel L.",
""
]
] | This paper describes a free/open-source implementation of the light sliding-window (LSW) part-of-speech tagger for the Apertium free/open-source machine translation platform. Firstly, the mechanism and training process of the tagger are reviewed, and a new method for incorporating linguistic rules is proposed. Secondly... |
2407.05925 | Anum Afzal | Anum Afzal, Alexander Kowsik, Rajna Fani, Florian Matthes | Towards Optimizing and Evaluating a Retrieval Augmented QA Chatbot using
LLMs with Human in the Loop | null | null | null | null | cs.CL cs.AI | http://creativecommons.org/publicdomain/zero/1.0/ | Large Language Models have found application in various mundane and
repetitive tasks including Human Resource (HR) support. We worked with the
domain experts of SAP SE to develop an HR support chatbot as an efficient and
effective tool for addressing employee inquiries. We inserted a
human-in-the-loop in various part... | [
{
"created": "Mon, 8 Jul 2024 13:32:14 GMT",
"version": "v1"
}
] | 2024-07-09 | [
[
"Afzal",
"Anum",
""
],
[
"Kowsik",
"Alexander",
""
],
[
"Fani",
"Rajna",
""
],
[
"Matthes",
"Florian",
""
]
] | Large Language Models have found application in various mundane and repetitive tasks including Human Resource (HR) support. We worked with the domain experts of SAP SE to develop an HR support chatbot as an efficient and effective tool for addressing employee inquiries. We inserted a human-in-the-loop in various parts ... |
2208.01142 | Hiu Yung Wong | Albert Lu, Jordan Marshall, Yifan Wang, Ming Xiao, Yuhao Zhang, Hiu
Yung Wong | Vertical GaN Diode BV Maximization through Rapid TCAD Simulation and
ML-enabled Surrogate Model | 4 pages, 7 figures | null | 10.1016/j.sse.2022.108468 | null | cs.LG eess.SP | http://creativecommons.org/licenses/by/4.0/ | In this paper, two methodologies are used to speed up the maximization of the
breakdown volt-age (BV) of a vertical GaN diode that has a theoretical maximum
BV of ~2100V. Firstly, we demonstrated a 5X faster accurate simulation method
in Technology Computer-Aided-Design (TCAD). This allows us to find 50% more
numbers... | [
{
"created": "Mon, 18 Jul 2022 05:55:45 GMT",
"version": "v1"
}
] | 2022-10-19 | [
[
"Lu",
"Albert",
""
],
[
"Marshall",
"Jordan",
""
],
[
"Wang",
"Yifan",
""
],
[
"Xiao",
"Ming",
""
],
[
"Zhang",
"Yuhao",
""
],
[
"Wong",
"Hiu Yung",
""
]
] | In this paper, two methodologies are used to speed up the maximization of the breakdown volt-age (BV) of a vertical GaN diode that has a theoretical maximum BV of ~2100V. Firstly, we demonstrated a 5X faster accurate simulation method in Technology Computer-Aided-Design (TCAD). This allows us to find 50% more numbers o... |
2201.01811 | Arash Nasr-Esfahany | Abdullah Alomar, Pouya Hamadanian, Arash Nasr-Esfahany, Anish Agarwal,
Mohammad Alizadeh, Devavrat Shah | CausalSim: A Causal Framework for Unbiased Trace-Driven Simulation | NSDI'23 Best Paper Award | 20th USENIX Symposium on Networked Systems Design and
Implementation (2023) 1115--1147 | null | null | cs.LG cs.AI cs.NI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present CausalSim, a causal framework for unbiased trace-driven
simulation. Current trace-driven simulators assume that the interventions being
simulated (e.g., a new algorithm) would not affect the validity of the traces.
However, real-world traces are often biased by the choices algorithms make
during trace coll... | [
{
"created": "Wed, 5 Jan 2022 20:45:24 GMT",
"version": "v1"
},
{
"created": "Sat, 12 Feb 2022 23:36:54 GMT",
"version": "v2"
},
{
"created": "Tue, 27 Sep 2022 22:39:31 GMT",
"version": "v3"
},
{
"created": "Fri, 5 May 2023 23:14:14 GMT",
"version": "v4"
}
] | 2023-05-09 | [
[
"Alomar",
"Abdullah",
""
],
[
"Hamadanian",
"Pouya",
""
],
[
"Nasr-Esfahany",
"Arash",
""
],
[
"Agarwal",
"Anish",
""
],
[
"Alizadeh",
"Mohammad",
""
],
[
"Shah",
"Devavrat",
""
]
] | We present CausalSim, a causal framework for unbiased trace-driven simulation. Current trace-driven simulators assume that the interventions being simulated (e.g., a new algorithm) would not affect the validity of the traces. However, real-world traces are often biased by the choices algorithms make during trace collec... |
2305.11926 | Neil Shah Mr. | Neil Shah, Vishal Tambrahalli, Saiteja Kosgi, Niranjan Pedanekar,
Vineet Gandhi | MParrotTTS: Multilingual Multi-speaker Text to Speech Synthesis in Low
Resource Setting | 5 pages, 1 figure | null | null | null | cs.SD cs.CL cs.LG eess.AS | http://creativecommons.org/licenses/by/4.0/ | We present MParrotTTS, a unified multilingual, multi-speaker text-to-speech
(TTS) synthesis model that can produce high-quality speech. Benefiting from a
modularized training paradigm exploiting self-supervised speech
representations, MParrotTTS adapts to a new language with minimal supervised
data and generalizes to... | [
{
"created": "Fri, 19 May 2023 13:43:36 GMT",
"version": "v1"
}
] | 2023-05-23 | [
[
"Shah",
"Neil",
""
],
[
"Tambrahalli",
"Vishal",
""
],
[
"Kosgi",
"Saiteja",
""
],
[
"Pedanekar",
"Niranjan",
""
],
[
"Gandhi",
"Vineet",
""
]
] | We present MParrotTTS, a unified multilingual, multi-speaker text-to-speech (TTS) synthesis model that can produce high-quality speech. Benefiting from a modularized training paradigm exploiting self-supervised speech representations, MParrotTTS adapts to a new language with minimal supervised data and generalizes to l... |
2310.02031 | Ningyu Zhang | Zhen Bi, Ningyu Zhang, Yida Xue, Yixin Ou, Daxiong Ji, Guozhou Zheng,
Huajun Chen | OceanGPT: A Large Language Model for Ocean Science Tasks | ACL2024. Project Website: https://oceangpt.zjukg.cn/ | null | null | null | cs.CL cs.AI cs.CE cs.LG cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Ocean science, which delves into the oceans that are reservoirs of life and
biodiversity, is of great significance given that oceans cover over 70% of our
planet's surface. Recently, advances in Large Language Models (LLMs) have
transformed the paradigm in science. Despite the success in other domains,
current LLMs o... | [
{
"created": "Tue, 3 Oct 2023 13:17:35 GMT",
"version": "v1"
},
{
"created": "Wed, 4 Oct 2023 03:35:33 GMT",
"version": "v2"
},
{
"created": "Thu, 19 Oct 2023 15:25:32 GMT",
"version": "v3"
},
{
"created": "Wed, 25 Oct 2023 10:55:38 GMT",
"version": "v4"
},
{
"cre... | 2024-05-24 | [
[
"Bi",
"Zhen",
""
],
[
"Zhang",
"Ningyu",
""
],
[
"Xue",
"Yida",
""
],
[
"Ou",
"Yixin",
""
],
[
"Ji",
"Daxiong",
""
],
[
"Zheng",
"Guozhou",
""
],
[
"Chen",
"Huajun",
""
]
] | Ocean science, which delves into the oceans that are reservoirs of life and biodiversity, is of great significance given that oceans cover over 70% of our planet's surface. Recently, advances in Large Language Models (LLMs) have transformed the paradigm in science. Despite the success in other domains, current LLMs oft... |
1912.12833 | Han Huang | Jing Hao, Han Huang, Galyna Livshyts, Konstantin Tikhomirov | Distribution of the minimal distance of random linear codes | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we study the distribution of the minimal distance (in the
Hamming metric) of a random linear code of dimension $k$ in $\mathbb{F}_q^n$.
We provide quantitative estimates showing that the distribution function of the
minimal distance is close ({\it{}superpolynomially} in $n$)to the cumulative
distributi... | [
{
"created": "Mon, 30 Dec 2019 07:22:48 GMT",
"version": "v1"
},
{
"created": "Mon, 13 Jul 2020 23:53:40 GMT",
"version": "v2"
}
] | 2020-07-15 | [
[
"Hao",
"Jing",
""
],
[
"Huang",
"Han",
""
],
[
"Livshyts",
"Galyna",
""
],
[
"Tikhomirov",
"Konstantin",
""
]
] | In this paper, we study the distribution of the minimal distance (in the Hamming metric) of a random linear code of dimension $k$ in $\mathbb{F}_q^n$. We provide quantitative estimates showing that the distribution function of the minimal distance is close ({\it{}superpolynomially} in $n$)to the cumulative distribution... |
2404.00701 | Wenfang Sun | Wenfang Sun, Yingjun Du, Gaowen Liu, Ramana Kompella, Cees G.M. Snoek | Training-Free Semantic Segmentation via LLM-Supervision | 22 pages,10 figures, conference | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent advancements in open vocabulary models, like CLIP, have notably
advanced zero-shot classification and segmentation by utilizing natural
language for class-specific embeddings. However, most research has focused on
improving model accuracy through prompt engineering, prompt learning, or
fine-tuning with limited... | [
{
"created": "Sun, 31 Mar 2024 14:37:25 GMT",
"version": "v1"
}
] | 2024-04-02 | [
[
"Sun",
"Wenfang",
""
],
[
"Du",
"Yingjun",
""
],
[
"Liu",
"Gaowen",
""
],
[
"Kompella",
"Ramana",
""
],
[
"Snoek",
"Cees G. M.",
""
]
] | Recent advancements in open vocabulary models, like CLIP, have notably advanced zero-shot classification and segmentation by utilizing natural language for class-specific embeddings. However, most research has focused on improving model accuracy through prompt engineering, prompt learning, or fine-tuning with limited l... |
2307.10648 | Samie Mostafavi | Samie Mostafavi, Gourav Prateek Sharma, James Gross | Data-Driven Latency Probability Prediction for Wireless Networks:
Focusing on Tail Probabilities | Submitted to IEEE Global Communications (GLOBECOM) 2023 conference | null | null | null | cs.NI cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | With the emergence of new application areas, such as cyber-physical systems
and human-in-the-loop applications, there is a need to guarantee a certain
level of end-to-end network latency with extremely high reliability, e.g.,
99.999%. While mechanisms specified under IEEE 802.1as time-sensitive
networking (TSN) can b... | [
{
"created": "Thu, 20 Jul 2023 07:23:15 GMT",
"version": "v1"
}
] | 2023-07-21 | [
[
"Mostafavi",
"Samie",
""
],
[
"Sharma",
"Gourav Prateek",
""
],
[
"Gross",
"James",
""
]
] | With the emergence of new application areas, such as cyber-physical systems and human-in-the-loop applications, there is a need to guarantee a certain level of end-to-end network latency with extremely high reliability, e.g., 99.999%. While mechanisms specified under IEEE 802.1as time-sensitive networking (TSN) can be ... |
2407.17367 | Ivo Pajor | Nicol\'as \'Alvarez, Ver\'onica Becher, Mart\'in Mereb, Ivo Pajor,
Carlos Miguel Soto | De Bruijn Sequences with Minimum Discrepancy | null | null | null | null | cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The discrepancy of a binary string is the maximum (absolute) difference
between the number of ones and the number of zeroes over all possible
substrings of the given binary string. In this note we determine the minimal
discrepancy that a binary de Bruijn sequence of order $n$ can achieve, which is
$n$. This was an op... | [
{
"created": "Wed, 24 Jul 2024 15:44:35 GMT",
"version": "v1"
}
] | 2024-07-25 | [
[
"Álvarez",
"Nicolás",
""
],
[
"Becher",
"Verónica",
""
],
[
"Mereb",
"Martín",
""
],
[
"Pajor",
"Ivo",
""
],
[
"Soto",
"Carlos Miguel",
""
]
] | The discrepancy of a binary string is the maximum (absolute) difference between the number of ones and the number of zeroes over all possible substrings of the given binary string. In this note we determine the minimal discrepancy that a binary de Bruijn sequence of order $n$ can achieve, which is $n$. This was an open... |
2006.10553 | Elad Liebman | Elad Liebman and Peter Stone | Artificial Musical Intelligence: A Survey | 99 pages, 5 figures, preprint: currently under review | null | null | null | cs.SD cs.AI cs.MM eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Computers have been used to analyze and create music since they were first
introduced in the 1950s and 1960s. Beginning in the late 1990s, the rise of the
Internet and large scale platforms for music recommendation and retrieval have
made music an increasingly prevalent domain of machine learning and artificial
intel... | [
{
"created": "Wed, 17 Jun 2020 04:46:32 GMT",
"version": "v1"
}
] | 2020-06-19 | [
[
"Liebman",
"Elad",
""
],
[
"Stone",
"Peter",
""
]
] | Computers have been used to analyze and create music since they were first introduced in the 1950s and 1960s. Beginning in the late 1990s, the rise of the Internet and large scale platforms for music recommendation and retrieval have made music an increasingly prevalent domain of machine learning and artificial intelli... |
2110.01680 | Satoshi Tsutsui | Satoshi Tsutsui, Ruta Desai, Karl Ridgeway | How You Move Your Head Tells What You Do: Self-supervised Video
Representation Learning with Egocentric Cameras and IMU Sensors | Accepted to 2021 ICCV Workshop on Egocentric Perception, Interaction
and Computing (EPIC) | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Understanding users' activities from head-mounted cameras is a fundamental
task for Augmented and Virtual Reality (AR/VR) applications. A typical approach
is to train a classifier in a supervised manner using data labeled by humans.
This approach has limitations due to the expensive annotation cost and the
closed cov... | [
{
"created": "Mon, 4 Oct 2021 19:25:15 GMT",
"version": "v1"
}
] | 2021-10-06 | [
[
"Tsutsui",
"Satoshi",
""
],
[
"Desai",
"Ruta",
""
],
[
"Ridgeway",
"Karl",
""
]
] | Understanding users' activities from head-mounted cameras is a fundamental task for Augmented and Virtual Reality (AR/VR) applications. A typical approach is to train a classifier in a supervised manner using data labeled by humans. This approach has limitations due to the expensive annotation cost and the closed cover... |
1511.06098 | Itsikiantsoa Randrianantenaina | Itsikiantsoa Randrianantenaina, Hesham Elsawy, Hayssam Dahrouj and
Mohamed-Slim Alouini | Interference Management with Partial Uplink/Downlink Spectrum Overlap | null | null | null | null | cs.IT cs.NI math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Simultaneous reuse of spectral resources by uplink and downlink, denoted as
in-band full duplex (FD) communication, is promoted to double the spectral
efficiency when compared to its half-duplex (HD) counterpart. Interference
management, however, remains challenging in FD cellular networks, especially
when high dispa... | [
{
"created": "Thu, 19 Nov 2015 09:19:17 GMT",
"version": "v1"
}
] | 2015-11-20 | [
[
"Randrianantenaina",
"Itsikiantsoa",
""
],
[
"Elsawy",
"Hesham",
""
],
[
"Dahrouj",
"Hayssam",
""
],
[
"Alouini",
"Mohamed-Slim",
""
]
] | Simultaneous reuse of spectral resources by uplink and downlink, denoted as in-band full duplex (FD) communication, is promoted to double the spectral efficiency when compared to its half-duplex (HD) counterpart. Interference management, however, remains challenging in FD cellular networks, especially when high dispari... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.