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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1606.04202 | Avik Sengupta | Avik Sengupta and Ravi Tandon | Improved Approximation of Storage-Rate Tradeoff for Caching with
Multiple Demands | Extended version of a submission to IEEE Trans. on Communications | null | null | null | cs.IT cs.NI math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Caching at the network edge has emerged as a viable solution for alleviating
the severe capacity crunch in modern content centric wireless networks by
leveraging network load-balancing in the form of localized content storage and
delivery. In this work, we consider a cache-aided network where the cache
storage phase ... | [
{
"created": "Tue, 14 Jun 2016 04:53:35 GMT",
"version": "v1"
}
] | 2016-06-15 | [
[
"Sengupta",
"Avik",
""
],
[
"Tandon",
"Ravi",
""
]
] | Caching at the network edge has emerged as a viable solution for alleviating the severe capacity crunch in modern content centric wireless networks by leveraging network load-balancing in the form of localized content storage and delivery. In this work, we consider a cache-aided network where the cache storage phase is... |
2107.02757 | Zhibin Duan | Zhibin Duan, Dongsheng Wang, Bo Chen, Chaojie Wang, Wenchao Chen,
Yewen Li, Jie Ren, Mingyuan Zhou | Sawtooth Factorial Topic Embeddings Guided Gamma Belief Network | null | null | null | null | cs.IR cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Hierarchical topic models such as the gamma belief network (GBN) have
delivered promising results in mining multi-layer document representations and
discovering interpretable topic taxonomies. However, they often assume in the
prior that the topics at each layer are independently drawn from the Dirichlet
distribution... | [
{
"created": "Wed, 30 Jun 2021 10:14:57 GMT",
"version": "v1"
}
] | 2021-07-07 | [
[
"Duan",
"Zhibin",
""
],
[
"Wang",
"Dongsheng",
""
],
[
"Chen",
"Bo",
""
],
[
"Wang",
"Chaojie",
""
],
[
"Chen",
"Wenchao",
""
],
[
"Li",
"Yewen",
""
],
[
"Ren",
"Jie",
""
],
[
"Zhou",
"Mingyuan"... | Hierarchical topic models such as the gamma belief network (GBN) have delivered promising results in mining multi-layer document representations and discovering interpretable topic taxonomies. However, they often assume in the prior that the topics at each layer are independently drawn from the Dirichlet distribution, ... |
cs/0207007 | Denis Popel | Denis V. Popel and Nawar Al-Hakeem | Evolutionary Circuit Design: Information Theory Perspective on Signal
Propagation | 5 pages, 3 figures, 2 tables, ISSPIT'2001 | ISSPIT'2001 | null | null | cs.OH | null | This paper presents case-study results on the application of information
theoretic approach to gate-level evolutionary circuit design. We introduce
information measures to provide better estimates of synthesis criteria of
digital circuits. For example, the analysis of signal propagation during
evolving gate-level syn... | [
{
"created": "Wed, 3 Jul 2002 16:59:23 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Popel",
"Denis V.",
""
],
[
"Al-Hakeem",
"Nawar",
""
]
] | This paper presents case-study results on the application of information theoretic approach to gate-level evolutionary circuit design. We introduce information measures to provide better estimates of synthesis criteria of digital circuits. For example, the analysis of signal propagation during evolving gate-level synth... |
2005.04042 | Stefan Hoffmann | Stefan Hoffmann | Computational Complexity of Synchronization under Regular Commutative
Constraints | Published in COCOON 2020 (The 26th International Computing and
Combinatorics Conference); 2nd version is update of the published version and
1st version; both contain a minor error, the assumption of maximality in the
NP-c and PSPACE-c results (propositions 5 & 6) is missing, and of
incomparability of the vecto... | Computing and Combinatorics, 26th International Conference, COCOON
2020, Proceedings, pages 460-471 | 10.1007/978-3-030-58150-3_37 | null | cs.FL cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Here we study the computational complexity of the constrained synchronization
problem for the class of regular commutative constraint languages. Utilizing a
vector representation of regular commutative constraint languages, we give a
full classification of the computational complexity of the constraint
synchronizatio... | [
{
"created": "Fri, 8 May 2020 13:43:23 GMT",
"version": "v1"
},
{
"created": "Wed, 2 Sep 2020 20:12:21 GMT",
"version": "v2"
}
] | 2020-09-04 | [
[
"Hoffmann",
"Stefan",
""
]
] | Here we study the computational complexity of the constrained synchronization problem for the class of regular commutative constraint languages. Utilizing a vector representation of regular commutative constraint languages, we give a full classification of the computational complexity of the constraint synchronization ... |
2003.01993 | Igor Buzhinsky | Igor Buzhinsky, Arseny Nerinovsky, Stavros Tripakis | Metrics and methods for robustness evaluation of neural networks with
generative models | 24 pages, 9 figures; data in Table 3 and Fig. 3 corrected (results
unchanged), several typos fixed, references updated | null | null | null | cs.LG cs.CV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent studies have shown that modern deep neural network classifiers are
easy to fool, assuming that an adversary is able to slightly modify their
inputs. Many papers have proposed adversarial attacks, defenses and methods to
measure robustness to such adversarial perturbations. However, most commonly
considered adv... | [
{
"created": "Wed, 4 Mar 2020 10:58:59 GMT",
"version": "v1"
},
{
"created": "Sun, 15 Mar 2020 15:55:23 GMT",
"version": "v2"
}
] | 2020-03-17 | [
[
"Buzhinsky",
"Igor",
""
],
[
"Nerinovsky",
"Arseny",
""
],
[
"Tripakis",
"Stavros",
""
]
] | Recent studies have shown that modern deep neural network classifiers are easy to fool, assuming that an adversary is able to slightly modify their inputs. Many papers have proposed adversarial attacks, defenses and methods to measure robustness to such adversarial perturbations. However, most commonly considered adver... |
1806.00264 | Ting-Ting Liang | Ting-Ting Liang, Satoshi Tsutsui, Liangcai Gao, Jing-Jing Lu and
Mengyan Sun | Combining Pyramid Pooling and Attention Mechanism for Pelvic MR Image
Semantic Segmentaion | 12 pages | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One of the time-consuming routine work for a radiologist is to discern
anatomical structures from tomographic images. For assisting radiologists, this
paper develops an automatic segmentation method for pelvic magnetic resonance
(MR) images. The task has three major challenges 1) A pelvic organ can have
various sizes... | [
{
"created": "Fri, 1 Jun 2018 10:13:45 GMT",
"version": "v1"
},
{
"created": "Thu, 28 Jun 2018 16:57:39 GMT",
"version": "v2"
}
] | 2018-06-29 | [
[
"Liang",
"Ting-Ting",
""
],
[
"Tsutsui",
"Satoshi",
""
],
[
"Gao",
"Liangcai",
""
],
[
"Lu",
"Jing-Jing",
""
],
[
"Sun",
"Mengyan",
""
]
] | One of the time-consuming routine work for a radiologist is to discern anatomical structures from tomographic images. For assisting radiologists, this paper develops an automatic segmentation method for pelvic magnetic resonance (MR) images. The task has three major challenges 1) A pelvic organ can have various sizes a... |
2402.15420 | Simon Holk | Simon Holk, Daniel Marta, Iolanda Leite | PREDILECT: Preferences Delineated with Zero-Shot Language-based
Reasoning in Reinforcement Learning | 8 pages, 8 Figures, 2 Tables | null | 10.1145/3610977.3634970 | null | cs.RO cs.CL cs.LG | http://creativecommons.org/licenses/by/4.0/ | Preference-based reinforcement learning (RL) has emerged as a new field in
robot learning, where humans play a pivotal role in shaping robot behavior by
expressing preferences on different sequences of state-action pairs. However,
formulating realistic policies for robots demands responses from humans to an
extensive... | [
{
"created": "Fri, 23 Feb 2024 16:30:05 GMT",
"version": "v1"
}
] | 2024-02-26 | [
[
"Holk",
"Simon",
""
],
[
"Marta",
"Daniel",
""
],
[
"Leite",
"Iolanda",
""
]
] | Preference-based reinforcement learning (RL) has emerged as a new field in robot learning, where humans play a pivotal role in shaping robot behavior by expressing preferences on different sequences of state-action pairs. However, formulating realistic policies for robots demands responses from humans to an extensive a... |
2305.14749 | Chaitanya K. Joshi | Chaitanya K. Joshi, Arian R. Jamasb, Ramon Vi\~nas, Charles Harris,
Simon V. Mathis, Alex Morehead, Rishabh Anand, Pietro Li\`o | gRNAde: Geometric Deep Learning for 3D RNA inverse design | Previously titled 'Multi-State RNA Design with Geometric Multi-Graph
Neural Networks', presented at ICML 2023 Computational Biology Workshop | null | null | null | cs.LG q-bio.BM q-bio.QM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Computational RNA design tasks are often posed as inverse problems, where
sequences are designed based on adopting a single desired secondary structure
without considering 3D geometry and conformational diversity. We introduce
gRNAde, a geometric RNA design pipeline operating on 3D RNA backbones to design
sequences t... | [
{
"created": "Wed, 24 May 2023 05:46:56 GMT",
"version": "v1"
},
{
"created": "Thu, 25 May 2023 14:53:11 GMT",
"version": "v2"
},
{
"created": "Sun, 28 May 2023 22:44:27 GMT",
"version": "v3"
},
{
"created": "Sun, 31 Mar 2024 10:03:17 GMT",
"version": "v4"
},
{
"c... | 2024-05-28 | [
[
"Joshi",
"Chaitanya K.",
""
],
[
"Jamasb",
"Arian R.",
""
],
[
"Viñas",
"Ramon",
""
],
[
"Harris",
"Charles",
""
],
[
"Mathis",
"Simon V.",
""
],
[
"Morehead",
"Alex",
""
],
[
"Anand",
"Rishabh",
""
],
... | Computational RNA design tasks are often posed as inverse problems, where sequences are designed based on adopting a single desired secondary structure without considering 3D geometry and conformational diversity. We introduce gRNAde, a geometric RNA design pipeline operating on 3D RNA backbones to design sequences tha... |
2006.09785 | Jathushan Rajasegaran | Jathushan Rajasegaran, Salman Khan, Munawar Hayat, Fahad Shahbaz Khan,
Mubarak Shah | Self-supervised Knowledge Distillation for Few-shot Learning | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Real-world contains an overwhelmingly large number of object classes,
learning all of which at once is infeasible. Few shot learning is a promising
learning paradigm due to its ability to learn out of order distributions
quickly with only a few samples. Recent works [7, 41] show that simply learning
a good feature em... | [
{
"created": "Wed, 17 Jun 2020 11:27:00 GMT",
"version": "v1"
},
{
"created": "Tue, 4 Aug 2020 05:22:39 GMT",
"version": "v2"
}
] | 2020-08-05 | [
[
"Rajasegaran",
"Jathushan",
""
],
[
"Khan",
"Salman",
""
],
[
"Hayat",
"Munawar",
""
],
[
"Khan",
"Fahad Shahbaz",
""
],
[
"Shah",
"Mubarak",
""
]
] | Real-world contains an overwhelmingly large number of object classes, learning all of which at once is infeasible. Few shot learning is a promising learning paradigm due to its ability to learn out of order distributions quickly with only a few samples. Recent works [7, 41] show that simply learning a good feature embe... |
2008.02251 | Thomas K\"ustner | Thomas K\"ustner, Tobias Hepp, Marc Fischer, Martin Schwartz, Andreas
Fritsche, Hans-Ulrich H\"aring, Konstantin Nikolaou, Fabian Bamberg, Bin
Yang, Fritz Schick, Sergios Gatidis, J\"urgen Machann | Fully Automated and Standardized Segmentation of Adipose Tissue
Compartments by Deep Learning in Three-dimensional Whole-body MRI of
Epidemiological Cohort Studies | This manuscript has been accepted for publication in Radiology:
Artificial Intelligence (https://pubs.rsna.org/journal/ai), which is
published by the Radiological Society of North America (RSNA) | null | null | null | cs.CV eess.IV physics.med-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Purpose: To enable fast and reliable assessment of subcutaneous and visceral
adipose tissue compartments derived from whole-body MRI. Methods:
Quantification and localization of different adipose tissue compartments from
whole-body MR images is of high interest to examine metabolic conditions. For
correct identificat... | [
{
"created": "Wed, 5 Aug 2020 17:30:14 GMT",
"version": "v1"
}
] | 2020-08-06 | [
[
"Küstner",
"Thomas",
""
],
[
"Hepp",
"Tobias",
""
],
[
"Fischer",
"Marc",
""
],
[
"Schwartz",
"Martin",
""
],
[
"Fritsche",
"Andreas",
""
],
[
"Häring",
"Hans-Ulrich",
""
],
[
"Nikolaou",
"Konstantin",
""
... | Purpose: To enable fast and reliable assessment of subcutaneous and visceral adipose tissue compartments derived from whole-body MRI. Methods: Quantification and localization of different adipose tissue compartments from whole-body MR images is of high interest to examine metabolic conditions. For correct identificatio... |
2001.07615 | Stefan Ultes | Stefan Ultes | Improving Interaction Quality Estimation with BiLSTMs and the Impact on
Dialogue Policy Learning | Published at SIGDIAL 2019 | null | null | null | cs.CL cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Learning suitable and well-performing dialogue behaviour in statistical
spoken dialogue systems has been in the focus of research for many years. While
most work which is based on reinforcement learning employs an objective measure
like task success for modelling the reward signal, we use a reward based on
user satis... | [
{
"created": "Tue, 21 Jan 2020 15:39:12 GMT",
"version": "v1"
}
] | 2020-01-22 | [
[
"Ultes",
"Stefan",
""
]
] | Learning suitable and well-performing dialogue behaviour in statistical spoken dialogue systems has been in the focus of research for many years. While most work which is based on reinforcement learning employs an objective measure like task success for modelling the reward signal, we use a reward based on user satisfa... |
2302.14294 | Aravindh Raman | Haris Bin Zia, Jiahui He, Aravindh Raman, Ignacio Castro, Nishanth
Sastry, Gareth Tyson | Flocking to Mastodon: Tracking the Great Twitter Migration | null | null | null | null | cs.SI | http://creativecommons.org/licenses/by/4.0/ | The acquisition of Twitter by Elon Musk has spurred controversy and
uncertainty among Twitter users. The move raised as many praises as concerns,
particularly regarding Musk's views on free speech. As a result, a large number
of Twitter users have looked for alternatives to Twitter. Mastodon, a
decentralized micro-bl... | [
{
"created": "Tue, 28 Feb 2023 03:59:19 GMT",
"version": "v1"
}
] | 2023-03-01 | [
[
"Zia",
"Haris Bin",
""
],
[
"He",
"Jiahui",
""
],
[
"Raman",
"Aravindh",
""
],
[
"Castro",
"Ignacio",
""
],
[
"Sastry",
"Nishanth",
""
],
[
"Tyson",
"Gareth",
""
]
] | The acquisition of Twitter by Elon Musk has spurred controversy and uncertainty among Twitter users. The move raised as many praises as concerns, particularly regarding Musk's views on free speech. As a result, a large number of Twitter users have looked for alternatives to Twitter. Mastodon, a decentralized micro-blog... |
1905.02691 | Patrick M. Pilarski | Patrick M. Pilarski, Andrew Butcher, Michael Johanson, Matthew M.
Botvinick, Andrew Bolt, Adam S. R. Parker | Learned human-agent decision-making, communication and joint action in a
virtual reality environment | 5 pages, 3 figures. Accepted to The 4th Multidisciplinary Conference
on Reinforcement Learning and Decision Making, July 7-10, 2019, McGill
University, Montreal, Quebec, Canada | null | null | null | cs.AI cs.HC cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Humans make decisions and act alongside other humans to pursue both
short-term and long-term goals. As a result of ongoing progress in areas such
as computing science and automation, humans now also interact with non-human
agents of varying complexity as part of their day-to-day activities;
substantial work is being ... | [
{
"created": "Tue, 7 May 2019 16:53:48 GMT",
"version": "v1"
}
] | 2019-05-08 | [
[
"Pilarski",
"Patrick M.",
""
],
[
"Butcher",
"Andrew",
""
],
[
"Johanson",
"Michael",
""
],
[
"Botvinick",
"Matthew M.",
""
],
[
"Bolt",
"Andrew",
""
],
[
"Parker",
"Adam S. R.",
""
]
] | Humans make decisions and act alongside other humans to pursue both short-term and long-term goals. As a result of ongoing progress in areas such as computing science and automation, humans now also interact with non-human agents of varying complexity as part of their day-to-day activities; substantial work is being do... |
2207.05316 | Connor Parde | Connor J. Parde, Virginia E. Strehle, Vivekjyoti Banerjee, Ying Hu,
Jacqueline G. Cavazos, Carlos D. Castillo, Alice J. O'Toole | Twin identification over viewpoint change: A deep convolutional neural
network surpasses humans | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep convolutional neural networks (DCNNs) have achieved human-level accuracy
in face identification (Phillips et al., 2018), though it is unclear how
accurately they discriminate highly-similar faces. Here, humans and a DCNN
performed a challenging face-identity matching task that included identical
twins. Participa... | [
{
"created": "Tue, 12 Jul 2022 04:59:53 GMT",
"version": "v1"
}
] | 2022-07-13 | [
[
"Parde",
"Connor J.",
""
],
[
"Strehle",
"Virginia E.",
""
],
[
"Banerjee",
"Vivekjyoti",
""
],
[
"Hu",
"Ying",
""
],
[
"Cavazos",
"Jacqueline G.",
""
],
[
"Castillo",
"Carlos D.",
""
],
[
"O'Toole",
"Alice J."... | Deep convolutional neural networks (DCNNs) have achieved human-level accuracy in face identification (Phillips et al., 2018), though it is unclear how accurately they discriminate highly-similar faces. Here, humans and a DCNN performed a challenging face-identity matching task that included identical twins. Participant... |
2008.03444 | Xinyi Xu Mr | Xinyi Xu and Tiancheng Huang and Pengfei Wei and Akshay Narayan and
Tze-Yun Leong | Hierarchical Reinforcement Learning in StarCraft II with Human Expertise
in Subgoals Selection | In Submission to AAMAS 2021 | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work is inspired by recent advances in hierarchical reinforcement
learning (HRL) (Barto and Mahadevan 2003; Hengst 2010), and improvements in
learning efficiency from heuristic-based subgoal selection, experience replay
(Lin 1993; Andrychowicz et al. 2017), and task-based curriculum learning
(Bengio et al. 2009;... | [
{
"created": "Sat, 8 Aug 2020 04:56:30 GMT",
"version": "v1"
},
{
"created": "Sat, 26 Sep 2020 00:15:12 GMT",
"version": "v2"
},
{
"created": "Tue, 29 Sep 2020 01:15:05 GMT",
"version": "v3"
}
] | 2020-09-30 | [
[
"Xu",
"Xinyi",
""
],
[
"Huang",
"Tiancheng",
""
],
[
"Wei",
"Pengfei",
""
],
[
"Narayan",
"Akshay",
""
],
[
"Leong",
"Tze-Yun",
""
]
] | This work is inspired by recent advances in hierarchical reinforcement learning (HRL) (Barto and Mahadevan 2003; Hengst 2010), and improvements in learning efficiency from heuristic-based subgoal selection, experience replay (Lin 1993; Andrychowicz et al. 2017), and task-based curriculum learning (Bengio et al. 2009; Z... |
0707.0568 | Gesualdo Scutari | Gesualdo Scutari, D.P. Palomar, S. Barbarossa | Optimal Linear Precoding Strategies for Wideband Non-Cooperative Systems
based on Game Theory-Part I: Nash Equilibria | Paper submitted to IEEE Transactions on Signal Processing, September
22, 2005. Revised March 14, 2007. Accepted June 5, 2007. To be published on
IEEE Transactions on Signal Processing, 2007. To appear on IEEE Transactions
on Signal Processing, 2007 | null | 10.1109/TSP.2007.907807 | null | cs.IT cs.GT math.IT | null | In this two-parts paper we propose a decentralized strategy, based on a
game-theoretic formulation, to find out the optimal precoding/multiplexing
matrices for a multipoint-to-multipoint communication system composed of a set
of wideband links sharing the same physical resources, i.e., time and
bandwidth. We assume, ... | [
{
"created": "Wed, 4 Jul 2007 10:33:25 GMT",
"version": "v1"
}
] | 2009-11-13 | [
[
"Scutari",
"Gesualdo",
""
],
[
"Palomar",
"D. P.",
""
],
[
"Barbarossa",
"S.",
""
]
] | In this two-parts paper we propose a decentralized strategy, based on a game-theoretic formulation, to find out the optimal precoding/multiplexing matrices for a multipoint-to-multipoint communication system composed of a set of wideband links sharing the same physical resources, i.e., time and bandwidth. We assume, as... |
1807.06614 | Ayonga Hereid | Ayonga Hereid, Omar Harib, Ross Hartley, Yukai Gong and Jessy W.
Grizzle | Rapid Trajectory Optimization Using C-FROST with Illustration on a
Cassie-Series Dynamic Walking Biped | null | null | null | null | cs.RO cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One of the big attractions of low-dimensional models for gait design has been
the ability to compute solutions rapidly, whereas one of their drawbacks has
been the difficulty in mapping the solutions back to the target robot. This
paper presents a set of tools for rapidly determining solutions for
``humanoids'' witho... | [
{
"created": "Tue, 17 Jul 2018 18:28:06 GMT",
"version": "v1"
},
{
"created": "Fri, 20 Jul 2018 15:15:58 GMT",
"version": "v2"
},
{
"created": "Fri, 15 Mar 2019 16:39:06 GMT",
"version": "v3"
}
] | 2019-03-18 | [
[
"Hereid",
"Ayonga",
""
],
[
"Harib",
"Omar",
""
],
[
"Hartley",
"Ross",
""
],
[
"Gong",
"Yukai",
""
],
[
"Grizzle",
"Jessy W.",
""
]
] | One of the big attractions of low-dimensional models for gait design has been the ability to compute solutions rapidly, whereas one of their drawbacks has been the difficulty in mapping the solutions back to the target robot. This paper presents a set of tools for rapidly determining solutions for ``humanoids'' without... |
1410.6796 | Wojciech Mazurczyk | Wojciech Mazurczyk and Luca Caviglione | Steganography in Modern Smartphones and Mitigation Techniques | 25 pages, 8 figures, 6 tables | null | null | null | cs.MM cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | By offering sophisticated services and centralizing a huge volume of personal
data, modern smartphones changed the way we socialize, entertain and work. To
this aim, they rely upon complex hardware/software frameworks leading to a
number of vulnerabilities, attacks and hazards to profile individuals or gather
sensiti... | [
{
"created": "Wed, 27 Aug 2014 08:46:05 GMT",
"version": "v1"
}
] | 2014-10-27 | [
[
"Mazurczyk",
"Wojciech",
""
],
[
"Caviglione",
"Luca",
""
]
] | By offering sophisticated services and centralizing a huge volume of personal data, modern smartphones changed the way we socialize, entertain and work. To this aim, they rely upon complex hardware/software frameworks leading to a number of vulnerabilities, attacks and hazards to profile individuals or gather sensitive... |
2006.08157 | Yunwen Lei | Yunwen Lei and Yiming Ying | Fine-Grained Analysis of Stability and Generalization for Stochastic
Gradient Descent | to appear in ICML 2020 | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently there are a considerable amount of work devoted to the study of the
algorithmic stability and generalization for stochastic gradient descent (SGD).
However, the existing stability analysis requires to impose restrictive
assumptions on the boundedness of gradients, strong smoothness and convexity of
loss func... | [
{
"created": "Mon, 15 Jun 2020 06:30:19 GMT",
"version": "v1"
}
] | 2020-06-16 | [
[
"Lei",
"Yunwen",
""
],
[
"Ying",
"Yiming",
""
]
] | Recently there are a considerable amount of work devoted to the study of the algorithmic stability and generalization for stochastic gradient descent (SGD). However, the existing stability analysis requires to impose restrictive assumptions on the boundedness of gradients, strong smoothness and convexity of loss functi... |
2002.08347 | Florian Tram\`er | Florian Tramer, Nicholas Carlini, Wieland Brendel, Aleksander Madry | On Adaptive Attacks to Adversarial Example Defenses | NeurIPS 2020 | null | null | null | cs.LG cs.CR stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Adaptive attacks have (rightfully) become the de facto standard for
evaluating defenses to adversarial examples. We find, however, that typical
adaptive evaluations are incomplete. We demonstrate that thirteen defenses
recently published at ICLR, ICML and NeurIPS---and chosen for illustrative and
pedagogical purposes... | [
{
"created": "Wed, 19 Feb 2020 18:50:29 GMT",
"version": "v1"
},
{
"created": "Fri, 23 Oct 2020 12:07:41 GMT",
"version": "v2"
}
] | 2020-10-26 | [
[
"Tramer",
"Florian",
""
],
[
"Carlini",
"Nicholas",
""
],
[
"Brendel",
"Wieland",
""
],
[
"Madry",
"Aleksander",
""
]
] | Adaptive attacks have (rightfully) become the de facto standard for evaluating defenses to adversarial examples. We find, however, that typical adaptive evaluations are incomplete. We demonstrate that thirteen defenses recently published at ICLR, ICML and NeurIPS---and chosen for illustrative and pedagogical purposes--... |
2104.04748 | Zhengxu Hou | Zhengxu Hou, Bang Liu, Ruihui Zhao, Zijing Ou, Yafei Liu, Xi Chen,
Yefeng Zheng | Imperfect also Deserves Reward: Multi-Level and Sequential Reward
Modeling for Better Dialog Management | 9 pages | NAACL 2021 | null | null | cs.CL cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For task-oriented dialog systems, training a Reinforcement Learning (RL)
based Dialog Management module suffers from low sample efficiency and slow
convergence speed due to the sparse rewards in RL.To solve this problem, many
strategies have been proposed to give proper rewards when training RL, but
their rewards lac... | [
{
"created": "Sat, 10 Apr 2021 12:20:23 GMT",
"version": "v1"
}
] | 2021-04-13 | [
[
"Hou",
"Zhengxu",
""
],
[
"Liu",
"Bang",
""
],
[
"Zhao",
"Ruihui",
""
],
[
"Ou",
"Zijing",
""
],
[
"Liu",
"Yafei",
""
],
[
"Chen",
"Xi",
""
],
[
"Zheng",
"Yefeng",
""
]
] | For task-oriented dialog systems, training a Reinforcement Learning (RL) based Dialog Management module suffers from low sample efficiency and slow convergence speed due to the sparse rewards in RL.To solve this problem, many strategies have been proposed to give proper rewards when training RL, but their rewards lack ... |
1706.02494 | Rong Zhang | Rong Zhang and Lie-Liang Yang and Lajos Hanzo | Physical Layer Security of Generalised Pre-coded Spatial Modulation with
Antenna Scrambling | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We now advocate a novel physical layer security solution that is unique to
our previously proposed GPSM scheme with the aid of the proposed antenna
scrambling. The novelty and contribution of our paper lies in three aspects: 1/
principle: we introduce a `security key' generated at Alice that is unknown to
both Bob an... | [
{
"created": "Thu, 8 Jun 2017 09:48:08 GMT",
"version": "v1"
}
] | 2017-06-09 | [
[
"Zhang",
"Rong",
""
],
[
"Yang",
"Lie-Liang",
""
],
[
"Hanzo",
"Lajos",
""
]
] | We now advocate a novel physical layer security solution that is unique to our previously proposed GPSM scheme with the aid of the proposed antenna scrambling. The novelty and contribution of our paper lies in three aspects: 1/ principle: we introduce a `security key' generated at Alice that is unknown to both Bob and ... |
0705.0561 | Jingchao Chen | Jing-Chao Chen | Iterative Rounding for the Closest String Problem | This paper has been published in abstract Booklet of CiE09 | null | null | null | cs.DS cs.CC | http://creativecommons.org/licenses/by-nc-sa/3.0/ | The closest string problem is an NP-hard problem, whose task is to find a
string that minimizes maximum Hamming distance to a given set of strings. This
can be reduced to an integer program (IP). However, to date, there exists no
known polynomial-time algorithm for IP. In 2004, Meneses et al. introduced a
branch-and-... | [
{
"created": "Fri, 4 May 2007 03:01:42 GMT",
"version": "v1"
},
{
"created": "Wed, 11 May 2011 00:18:55 GMT",
"version": "v2"
}
] | 2011-05-12 | [
[
"Chen",
"Jing-Chao",
""
]
] | The closest string problem is an NP-hard problem, whose task is to find a string that minimizes maximum Hamming distance to a given set of strings. This can be reduced to an integer program (IP). However, to date, there exists no known polynomial-time algorithm for IP. In 2004, Meneses et al. introduced a branch-and-bo... |
2208.05810 | Minji Kim | Minji Kim, Seungkwan Lee, Jungseul Ok, Bohyung Han, Minsu Cho | Towards Sequence-Level Training for Visual Tracking | ECCV 2022 | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Despite the extensive adoption of machine learning on the task of visual
object tracking, recent learning-based approaches have largely overlooked the
fact that visual tracking is a sequence-level task in its nature; they rely
heavily on frame-level training, which inevitably induces inconsistency between
training an... | [
{
"created": "Thu, 11 Aug 2022 13:15:36 GMT",
"version": "v1"
},
{
"created": "Tue, 20 Sep 2022 12:46:53 GMT",
"version": "v2"
},
{
"created": "Sun, 16 Oct 2022 16:05:12 GMT",
"version": "v3"
}
] | 2022-10-18 | [
[
"Kim",
"Minji",
""
],
[
"Lee",
"Seungkwan",
""
],
[
"Ok",
"Jungseul",
""
],
[
"Han",
"Bohyung",
""
],
[
"Cho",
"Minsu",
""
]
] | Despite the extensive adoption of machine learning on the task of visual object tracking, recent learning-based approaches have largely overlooked the fact that visual tracking is a sequence-level task in its nature; they rely heavily on frame-level training, which inevitably induces inconsistency between training and ... |
1905.12261 | Che-Han Chang | Che-Han Chang, Chun-Hsien Yu, Szu-Ying Chen, Edward Y. Chang | KG-GAN: Knowledge-Guided Generative Adversarial Networks | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Can generative adversarial networks (GANs) generate roses of various colors
given only roses of red petals as input? The answer is negative, since GANs'
discriminator would reject all roses of unseen petal colors. In this study, we
propose knowledge-guided GAN (KG-GAN) to fuse domain knowledge with the GAN
framework.... | [
{
"created": "Wed, 29 May 2019 07:55:46 GMT",
"version": "v1"
},
{
"created": "Mon, 23 Sep 2019 09:48:33 GMT",
"version": "v2"
}
] | 2019-09-24 | [
[
"Chang",
"Che-Han",
""
],
[
"Yu",
"Chun-Hsien",
""
],
[
"Chen",
"Szu-Ying",
""
],
[
"Chang",
"Edward Y.",
""
]
] | Can generative adversarial networks (GANs) generate roses of various colors given only roses of red petals as input? The answer is negative, since GANs' discriminator would reject all roses of unseen petal colors. In this study, we propose knowledge-guided GAN (KG-GAN) to fuse domain knowledge with the GAN framework. K... |
2108.13015 | Pengguang Chen | Pengguang Chen, Yixin Chen, Shu Liu, Mingchang Yang, Jiaya Jia | Exploring and Improving Mobile Level Vision Transformers | 10 pages; 5 figures; preprint | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the vision transformer structure in the mobile level in this paper,
and find a dramatic performance drop. We analyze the reason behind this
phenomenon, and propose a novel irregular patch embedding module and adaptive
patch fusion module to improve the performance. We conjecture that the vision
transformer b... | [
{
"created": "Mon, 30 Aug 2021 06:42:49 GMT",
"version": "v1"
}
] | 2021-08-31 | [
[
"Chen",
"Pengguang",
""
],
[
"Chen",
"Yixin",
""
],
[
"Liu",
"Shu",
""
],
[
"Yang",
"Mingchang",
""
],
[
"Jia",
"Jiaya",
""
]
] | We study the vision transformer structure in the mobile level in this paper, and find a dramatic performance drop. We analyze the reason behind this phenomenon, and propose a novel irregular patch embedding module and adaptive patch fusion module to improve the performance. We conjecture that the vision transformer blo... |
2201.02850 | Rayson Laroca | Gabriel Salomon, Rayson Laroca, David Menotti | Image-based Automatic Dial Meter Reading in Unconstrained Scenarios | null | Measurement, vol. 204, p. 112025, 2022 | 10.1016/j.measurement.2022.112025 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The replacement of analog meters with smart meters is costly, laborious, and
far from complete in developing countries. The Energy Company of Parana (Copel)
(Brazil) performs more than 4 million meter readings (almost entirely of
non-smart devices) per month, and we estimate that 850 thousand of them are
from dial me... | [
{
"created": "Sat, 8 Jan 2022 16:03:46 GMT",
"version": "v1"
},
{
"created": "Sun, 23 Oct 2022 11:56:38 GMT",
"version": "v2"
}
] | 2022-10-25 | [
[
"Salomon",
"Gabriel",
""
],
[
"Laroca",
"Rayson",
""
],
[
"Menotti",
"David",
""
]
] | The replacement of analog meters with smart meters is costly, laborious, and far from complete in developing countries. The Energy Company of Parana (Copel) (Brazil) performs more than 4 million meter readings (almost entirely of non-smart devices) per month, and we estimate that 850 thousand of them are from dial mete... |
1906.10495 | Joshua Cook | Joshua Alan Cook | Approximating Unitary Preparations of Orthogonal Black Box States | A Class project Paper for CS395T Quantum Complexity Theory at UT
Austin in Spring 2019 under Scott Aaronson | null | null | null | cs.CC quant-ph | http://creativecommons.org/licenses/by/4.0/ | In this paper, I take a step toward answering the following question: for m
different small circuits that compute m orthogonal n qubit states, is there a
small circuit that will map m computational basis states to these m states
without any input leaving any auxiliary bits changed. While this may seem
simple, the con... | [
{
"created": "Sun, 23 Jun 2019 01:21:52 GMT",
"version": "v1"
}
] | 2019-06-26 | [
[
"Cook",
"Joshua Alan",
""
]
] | In this paper, I take a step toward answering the following question: for m different small circuits that compute m orthogonal n qubit states, is there a small circuit that will map m computational basis states to these m states without any input leaving any auxiliary bits changed. While this may seem simple, the const... |
cs/0407066 | Tentyukov Mikhail | M.Tentyukov, D.Fliegner, M.Frank, A.Onischenko, A.Retey,
H.M.Staudenmaier and J.A.M.Vermaseren | ParFORM: Parallel Version of the Symbolic Manipulation Program FORM | 5 pages, 4 Encapsulated postscript figures, LaTeX2e uses casc.cls
(included). Presented at CASC'04 http://wwwmayr.in.tum.de/CASC2004/ | null | null | TTP04-15 | cs.SC cs.DC hep-ph | null | After an introduction to the sequential version of FORM and the mechanisms
behind, we report on the status of our project of parallelization. We have now
a parallel version of FORM running on Cluster- and SMP-architectures. This
version can be used to run arbitrary FORM programs in parallel.
| [
{
"created": "Fri, 30 Jul 2004 10:06:16 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Tentyukov",
"M.",
""
],
[
"Fliegner",
"D.",
""
],
[
"Frank",
"M.",
""
],
[
"Onischenko",
"A.",
""
],
[
"Retey",
"A.",
""
],
[
"Staudenmaier",
"H. M.",
""
],
[
"Vermaseren",
"J. A. M.",
""
]
] | After an introduction to the sequential version of FORM and the mechanisms behind, we report on the status of our project of parallelization. We have now a parallel version of FORM running on Cluster- and SMP-architectures. This version can be used to run arbitrary FORM programs in parallel. |
2212.01545 | Ruihao Zheng | Ruihao Zheng and Zhenkun Wang | A Generalized Scalarization Method for Evolutionary Multi-Objective
Optimization | Correct some typos. (Accepted for presentation at Thirty-Seventh AAAI
Conference on Artificial Intelligence (AAAI-23)) | null | 10.1609/aaai.v37i10.26474 | null | cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The decomposition-based multi-objective evolutionary algorithm (MOEA/D)
transforms a multi-objective optimization problem (MOP) into a set of
single-objective subproblems for collaborative optimization. Mismatches between
subproblems and solutions can lead to severe performance degradation of MOEA/D.
Most existing mi... | [
{
"created": "Sat, 3 Dec 2022 05:55:04 GMT",
"version": "v1"
},
{
"created": "Tue, 7 Nov 2023 00:46:59 GMT",
"version": "v2"
}
] | 2023-11-08 | [
[
"Zheng",
"Ruihao",
""
],
[
"Wang",
"Zhenkun",
""
]
] | The decomposition-based multi-objective evolutionary algorithm (MOEA/D) transforms a multi-objective optimization problem (MOP) into a set of single-objective subproblems for collaborative optimization. Mismatches between subproblems and solutions can lead to severe performance degradation of MOEA/D. Most existing mism... |
2108.09939 | Mashiat Mostafa | Mashiat Mostafa and Faheem Hussain | Transcending Old Boundaries: Digital Afterlife in the Age of COVID-19 | In proceedings of the 1st Virtual Conference on Implications of
Information and Digital Technologies for Development, 2021 | null | null | null | cs.CY | http://creativecommons.org/licenses/by-nc-sa/4.0/ | The primary objective of our exploratory research is to contribute to the
ongoing conversation on Digital Afterlife from the lenses of Global South
during the COVID-19 period. Digital Afterlife is fast becoming a challenge for
our increasingly connected society. Moreover, the situation got worse with the
COVID-19 pan... | [
{
"created": "Mon, 23 Aug 2021 05:21:03 GMT",
"version": "v1"
}
] | 2021-08-24 | [
[
"Mostafa",
"Mashiat",
""
],
[
"Hussain",
"Faheem",
""
]
] | The primary objective of our exploratory research is to contribute to the ongoing conversation on Digital Afterlife from the lenses of Global South during the COVID-19 period. Digital Afterlife is fast becoming a challenge for our increasingly connected society. Moreover, the situation got worse with the COVID-19 pande... |
0803.2365 | Ganesh Narayan | V Sriram, Ganesh Narayan, K Gopinath | SAFIUS - A secure and accountable filesystem over untrusted storage | 11pt, 12 pages, 16 figures | Fourth International IEEE Security in Storage Workshop, 2007 -
SISW '07. Publication Date: 27-27 Sept. 2007 On page(s): 34-45 | 10.1109/SISW.2007.7 | null | cs.OS cs.CR cs.DC cs.NI cs.PF | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We describe SAFIUS, a secure accountable file system that resides over an
untrusted storage. SAFIUS provides strong security guarantees like
confidentiality, integrity, prevention from rollback attacks, and
accountability. SAFIUS also enables read/write sharing of data and provides the
standard UNIX-like interface fo... | [
{
"created": "Sun, 16 Mar 2008 18:24:13 GMT",
"version": "v1"
}
] | 2016-11-18 | [
[
"Sriram",
"V",
""
],
[
"Narayan",
"Ganesh",
""
],
[
"Gopinath",
"K",
""
]
] | We describe SAFIUS, a secure accountable file system that resides over an untrusted storage. SAFIUS provides strong security guarantees like confidentiality, integrity, prevention from rollback attacks, and accountability. SAFIUS also enables read/write sharing of data and provides the standard UNIX-like interface for ... |
2105.03389 | EPTCS | Patricia Johann (Appalachian State University), Enrico Ghiorzi
(Appalachian State University), Daniel Jeffries (Appalachian State
University) | GADTs, Functoriality, Parametricity: Pick Two | In Proceedings LSFA 2021, arXiv:2204.03415 | EPTCS 357, 2022, pp. 77-92 | 10.4204/EPTCS.357.6 | null | cs.LO cs.PL | http://creativecommons.org/licenses/by/4.0/ | GADTs can be represented either as their Church encodings a la Atkey, or as
fixpoints a la Johann and Polonsky. While a GADT represented as its Church
encoding need not support a map function satisfying the functor laws, the
fixpoint representation of a GADT must support such a map function even to be
well-defined. T... | [
{
"created": "Fri, 7 May 2021 16:50:42 GMT",
"version": "v1"
},
{
"created": "Tue, 7 Dec 2021 11:06:49 GMT",
"version": "v2"
},
{
"created": "Fri, 8 Apr 2022 07:18:08 GMT",
"version": "v3"
}
] | 2022-04-11 | [
[
"Johann",
"Patricia",
"",
"Appalachian State University"
],
[
"Ghiorzi",
"Enrico",
"",
"Appalachian State University"
],
[
"Jeffries",
"Daniel",
"",
"Appalachian State\n University"
]
] | GADTs can be represented either as their Church encodings a la Atkey, or as fixpoints a la Johann and Polonsky. While a GADT represented as its Church encoding need not support a map function satisfying the functor laws, the fixpoint representation of a GADT must support such a map function even to be well-defined. The... |
1208.0944 | Nader Ale Ebrahim | Nader Ale Ebrahim, Shamsuddin Ahmed, Zahari Taha | Establishing Virtual R&D Teams: Obliged Policy | 6th IMC (International Management Conference). Tehran, Iran 2008 | null | null | null | cs.OH | http://creativecommons.org/licenses/by/3.0/ | In a global and technology oriented world the requirements that products and
services have to fulfill are increasing and are getting more complicated.
Research and development (R&D) is becoming increasingly important in creating
the knowledge that makes research and business more competitive. Companies are
obliged to... | [
{
"created": "Sat, 4 Aug 2012 16:35:48 GMT",
"version": "v1"
}
] | 2012-08-07 | [
[
"Ebrahim",
"Nader Ale",
""
],
[
"Ahmed",
"Shamsuddin",
""
],
[
"Taha",
"Zahari",
""
]
] | In a global and technology oriented world the requirements that products and services have to fulfill are increasing and are getting more complicated. Research and development (R&D) is becoming increasingly important in creating the knowledge that makes research and business more competitive. Companies are obliged to p... |
1802.00771 | Vinay Namboodiri | Shashank Sharma and Vinay P. Namboodiri | No Modes left behind: Capturing the data distribution effectively using
GANs | accepted to AAAI 2018 conference | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Generative adversarial networks (GANs) while being very versatile in
realistic image synthesis, still are sensitive to the input distribution. Given
a set of data that has an imbalance in the distribution, the networks are
susceptible to missing modes and not capturing the data distribution. While
various methods hav... | [
{
"created": "Fri, 2 Feb 2018 17:10:55 GMT",
"version": "v1"
}
] | 2018-02-05 | [
[
"Sharma",
"Shashank",
""
],
[
"Namboodiri",
"Vinay P.",
""
]
] | Generative adversarial networks (GANs) while being very versatile in realistic image synthesis, still are sensitive to the input distribution. Given a set of data that has an imbalance in the distribution, the networks are susceptible to missing modes and not capturing the data distribution. While various methods have ... |
2108.00320 | Stefan Konigorski | Alexander M. Zenner, Erwin B\"ottinger, Stefan Konigorski | StudyMe: A New Mobile App for User-Centric N-of-1 Trials | null | null | null | null | cs.HC cs.AI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | N-of-1 trials are multi-crossover self-experiments that allow individuals to
systematically evaluate the effect of interventions on their personal health
goals. Although several tools for N-of-1 trials exist, none support non-experts
in conducting their own user-centric trials. In this study we present StudyMe,
an op... | [
{
"created": "Sat, 31 Jul 2021 20:43:36 GMT",
"version": "v1"
}
] | 2021-08-03 | [
[
"Zenner",
"Alexander M.",
""
],
[
"Böttinger",
"Erwin",
""
],
[
"Konigorski",
"Stefan",
""
]
] | N-of-1 trials are multi-crossover self-experiments that allow individuals to systematically evaluate the effect of interventions on their personal health goals. Although several tools for N-of-1 trials exist, none support non-experts in conducting their own user-centric trials. In this study we present StudyMe, an open... |
2205.02754 | Mulong Luo | Mulong Luo, G. Edward Suh | Accelerating Path Planning for Autonomous Driving with Hardware-Assisted
Memoization | null | null | null | null | cs.RO cs.AR | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Path planning for autonomous driving with dynamic obstacles poses a challenge
because it needs to perform a higher-dimensional search (with time-dimension)
while still meeting real-time constraints. This paper proposes an
algorithm-hardware co-optimization approach to accelerate path planning with
high-dimensional se... | [
{
"created": "Thu, 5 May 2022 16:31:14 GMT",
"version": "v1"
},
{
"created": "Fri, 27 May 2022 15:35:50 GMT",
"version": "v2"
}
] | 2022-05-30 | [
[
"Luo",
"Mulong",
""
],
[
"Suh",
"G. Edward",
""
]
] | Path planning for autonomous driving with dynamic obstacles poses a challenge because it needs to perform a higher-dimensional search (with time-dimension) while still meeting real-time constraints. This paper proposes an algorithm-hardware co-optimization approach to accelerate path planning with high-dimensional sear... |
2404.13798 | Jensen Hwa | Jensen Hwa, Qingyu Zhao, Aditya Lahiri, Adnan Masood, Babak Salimi,
Ehsan Adeli | Enforcing Conditional Independence for Fair Representation Learning and
Causal Image Generation | To appear at the 2024 IEEE CVPR Workshop on Fair, Data-Efficient, and
Trusted Computer Vision | null | null | null | cs.CV | http://creativecommons.org/licenses/by-sa/4.0/ | Conditional independence (CI) constraints are critical for defining and
evaluating fairness in machine learning, as well as for learning unconfounded
or causal representations. Traditional methods for ensuring fairness either
blindly learn invariant features with respect to a protected variable (e.g.,
race when class... | [
{
"created": "Sun, 21 Apr 2024 23:34:45 GMT",
"version": "v1"
}
] | 2024-04-23 | [
[
"Hwa",
"Jensen",
""
],
[
"Zhao",
"Qingyu",
""
],
[
"Lahiri",
"Aditya",
""
],
[
"Masood",
"Adnan",
""
],
[
"Salimi",
"Babak",
""
],
[
"Adeli",
"Ehsan",
""
]
] | Conditional independence (CI) constraints are critical for defining and evaluating fairness in machine learning, as well as for learning unconfounded or causal representations. Traditional methods for ensuring fairness either blindly learn invariant features with respect to a protected variable (e.g., race when classif... |
2405.12945 | Rishikesh Gajjala | Rishikesh Gajjala and Jayanth Ravi | Improved upper bounds for the Heilbronn's Problem for $k$-gons | To appear in the Canadian Conference on Computational Geometry (CCCG)
2024 | null | null | null | cs.DM cs.CG math.CO | http://creativecommons.org/licenses/by/4.0/ | The Heilbronn triangle problem asks for the placement of $n$ points in a unit
square that maximizes the smallest area of a triangle formed by any three of
those points. In $1972$, Schmidt considered a natural generalization of this
problem. He asked for the placement of $n$ points in a unit square that
maximizes the ... | [
{
"created": "Tue, 21 May 2024 17:17:25 GMT",
"version": "v1"
}
] | 2024-05-22 | [
[
"Gajjala",
"Rishikesh",
""
],
[
"Ravi",
"Jayanth",
""
]
] | The Heilbronn triangle problem asks for the placement of $n$ points in a unit square that maximizes the smallest area of a triangle formed by any three of those points. In $1972$, Schmidt considered a natural generalization of this problem. He asked for the placement of $n$ points in a unit square that maximizes the sm... |
1904.02322 | Youshan Zhang | Youshan Zhang, Brian D. Davison | Modified Distribution Alignment for Domain Adaptation with Pre-trained
Inception ResNet | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep neural networks have been widely used in computer vision. There are
several well trained deep neural networks for the ImageNet classification
challenge, which has played a significant role in image recognition. However,
little work has explored pre-trained neural networks for image recognition in
domain adaption... | [
{
"created": "Thu, 4 Apr 2019 03:00:24 GMT",
"version": "v1"
},
{
"created": "Thu, 18 Apr 2019 15:04:36 GMT",
"version": "v2"
}
] | 2019-04-19 | [
[
"Zhang",
"Youshan",
""
],
[
"Davison",
"Brian D.",
""
]
] | Deep neural networks have been widely used in computer vision. There are several well trained deep neural networks for the ImageNet classification challenge, which has played a significant role in image recognition. However, little work has explored pre-trained neural networks for image recognition in domain adaption. ... |
1904.05394 | Marco Huber | Nina Schaaf, Marco F. Huber, and Johannes Maucher | Enhancing Decision Tree based Interpretation of Deep Neural Networks
through L1-Orthogonal Regularization | 8 pages, 18th IEEE International Conference on Machine Learning and
Applications (ICMLA) 2019 | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One obstacle that so far prevents the introduction of machine learning models
primarily in critical areas is the lack of explainability. In this work, a
practicable approach of gaining explainability of deep artificial neural
networks (NN) using an interpretable surrogate model based on decision trees is
presented. S... | [
{
"created": "Wed, 10 Apr 2019 19:11:47 GMT",
"version": "v1"
},
{
"created": "Thu, 3 Oct 2019 19:57:24 GMT",
"version": "v2"
}
] | 2019-10-07 | [
[
"Schaaf",
"Nina",
""
],
[
"Huber",
"Marco F.",
""
],
[
"Maucher",
"Johannes",
""
]
] | One obstacle that so far prevents the introduction of machine learning models primarily in critical areas is the lack of explainability. In this work, a practicable approach of gaining explainability of deep artificial neural networks (NN) using an interpretable surrogate model based on decision trees is presented. Sim... |
1706.06810 | Jongpil Lee | Jongpil Lee, Juhan Nam | Multi-Level and Multi-Scale Feature Aggregation Using Sample-level Deep
Convolutional Neural Networks for Music Classification | ICML Music Discovery Workshop 2017 | null | null | null | cs.SD cs.LG cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Music tag words that describe music audio by text have different levels of
abstraction. Taking this issue into account, we propose a music classification
approach that aggregates multi-level and multi-scale features using pre-trained
feature extractors. In particular, the feature extractors are trained in
sample-leve... | [
{
"created": "Wed, 21 Jun 2017 09:57:24 GMT",
"version": "v1"
}
] | 2017-06-22 | [
[
"Lee",
"Jongpil",
""
],
[
"Nam",
"Juhan",
""
]
] | Music tag words that describe music audio by text have different levels of abstraction. Taking this issue into account, we propose a music classification approach that aggregates multi-level and multi-scale features using pre-trained feature extractors. In particular, the feature extractors are trained in sample-level ... |
1108.6123 | Aleksandar Nikolov | Jean Bolot, Nadia Fawaz, S. Muthukrishnan, Aleksandar Nikolov, Nina
Taft | Private Decayed Sum Estimation under Continual Observation | null | null | 10.1145/2448496.2448530 | null | cs.DS cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In monitoring applications, recent data is more important than distant data.
How does this affect privacy of data analysis? We study a general class of data
analyses - computing predicate sums - with privacy. Formally, we study the
problem of estimating predicate sums {\em privately}, for sliding windows (and
other w... | [
{
"created": "Wed, 31 Aug 2011 03:56:50 GMT",
"version": "v1"
},
{
"created": "Sat, 3 Mar 2012 01:06:44 GMT",
"version": "v2"
}
] | 2013-08-05 | [
[
"Bolot",
"Jean",
""
],
[
"Fawaz",
"Nadia",
""
],
[
"Muthukrishnan",
"S.",
""
],
[
"Nikolov",
"Aleksandar",
""
],
[
"Taft",
"Nina",
""
]
] | In monitoring applications, recent data is more important than distant data. How does this affect privacy of data analysis? We study a general class of data analyses - computing predicate sums - with privacy. Formally, we study the problem of estimating predicate sums {\em privately}, for sliding windows (and other wel... |
2407.13490 | Alexandre Bonlarron | Florian R\'egin, Elisabetta De Maria and Alexandre Bonlarron | Combining Constraint Programming Reasoning with Large Language Model
Predictions | To appear at The 30th International Conference on Principles and
Practice of Constraint Programming (CP 2024) | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Constraint Programming (CP) and Machine Learning (ML) face challenges in text
generation due to CP's struggle with implementing "meaning'' and ML's
difficulty with structural constraints. This paper proposes a solution by
combining both approaches and embedding a Large Language Model (LLM) in CP. The
LLM handles word... | [
{
"created": "Thu, 18 Jul 2024 13:15:55 GMT",
"version": "v1"
}
] | 2024-07-19 | [
[
"Régin",
"Florian",
""
],
[
"De Maria",
"Elisabetta",
""
],
[
"Bonlarron",
"Alexandre",
""
]
] | Constraint Programming (CP) and Machine Learning (ML) face challenges in text generation due to CP's struggle with implementing "meaning'' and ML's difficulty with structural constraints. This paper proposes a solution by combining both approaches and embedding a Large Language Model (LLM) in CP. The LLM handles word g... |
1602.02698 | Yehia Elkhatib PhD | Yehia Elkhatib | Defining Cross-Cloud Systems | null | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent years have seen an increasing number of cross-cloud architectures,
i.e. systems that span across cloud provisioning boundaries. However, the cloud
computing world still lacks any standards in terms of programming interfaces,
which has a knock-on effect on the costs associated with interoperability and
severely... | [
{
"created": "Mon, 8 Feb 2016 19:13:32 GMT",
"version": "v1"
}
] | 2016-02-09 | [
[
"Elkhatib",
"Yehia",
""
]
] | Recent years have seen an increasing number of cross-cloud architectures, i.e. systems that span across cloud provisioning boundaries. However, the cloud computing world still lacks any standards in terms of programming interfaces, which has a knock-on effect on the costs associated with interoperability and severely l... |
2105.05517 | Nicky Williams | Nicky Williams (LSL) | Towards exhaustive branch coverage with PathCrawler | null | 2nd ACM/IEEE International Conference on Automation of Software
Test AST 2021, May 2021, Madrid, Spain | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Branch coverage of source code is a very widely used test criterion.
Moreover, branch coverage is a similar problem to line coverage, MC/DC and the
coverage of assertion violations, certain runtime errors and various other
types of test objective. Indeed, establishing that a large number of test
objectives are unreac... | [
{
"created": "Wed, 12 May 2021 08:55:13 GMT",
"version": "v1"
}
] | 2021-05-13 | [
[
"Williams",
"Nicky",
"",
"LSL"
]
] | Branch coverage of source code is a very widely used test criterion. Moreover, branch coverage is a similar problem to line coverage, MC/DC and the coverage of assertion violations, certain runtime errors and various other types of test objective. Indeed, establishing that a large number of test objectives are unreacha... |
2209.09729 | Andr\'as Kov\'acs | Andr\'as Kov\'acs | Staged Compilation with Two-Level Type Theory | null | null | 10.1145/3547641 | null | cs.PL cs.LO | http://creativecommons.org/licenses/by/4.0/ | The aim of staged compilation is to enable metaprogramming in a way such that
we have guarantees about the well-formedness of code output, and we can also
mix together object-level and meta-level code in a concise and convenient
manner. In this work, we observe that two-level type theory (2LTT), a system
originally d... | [
{
"created": "Tue, 20 Sep 2022 14:00:15 GMT",
"version": "v1"
}
] | 2022-09-21 | [
[
"Kovács",
"András",
""
]
] | The aim of staged compilation is to enable metaprogramming in a way such that we have guarantees about the well-formedness of code output, and we can also mix together object-level and meta-level code in a concise and convenient manner. In this work, we observe that two-level type theory (2LTT), a system originally dev... |
2311.01279 | Samie Mostafavi | Samie Mostafavi, Vishnu Narayanan Moothedath, Stefan R\"onngren,
Neelabhro Roy, Gourav Prateek Sharma, Sangwon Seo, Manuel Olgu\'in Mu\~noz,
James Gross | ExPECA: An Experimental Platform for Trustworthy Edge Computing
Applications | null | null | 10.1145/3583740.3626819 | null | cs.NI eess.SP | http://creativecommons.org/licenses/by/4.0/ | This paper presents ExPECA, an edge computing and wireless communication
research testbed designed to tackle two pressing challenges: comprehensive
end-to-end experimentation and high levels of experimental reproducibility.
Leveraging OpenStack-based Chameleon Infrastructure (CHI) framework for its
proven flexibility... | [
{
"created": "Thu, 2 Nov 2023 14:50:01 GMT",
"version": "v1"
}
] | 2023-11-03 | [
[
"Mostafavi",
"Samie",
""
],
[
"Moothedath",
"Vishnu Narayanan",
""
],
[
"Rönngren",
"Stefan",
""
],
[
"Roy",
"Neelabhro",
""
],
[
"Sharma",
"Gourav Prateek",
""
],
[
"Seo",
"Sangwon",
""
],
[
"Muñoz",
"Manuel O... | This paper presents ExPECA, an edge computing and wireless communication research testbed designed to tackle two pressing challenges: comprehensive end-to-end experimentation and high levels of experimental reproducibility. Leveraging OpenStack-based Chameleon Infrastructure (CHI) framework for its proven flexibility a... |
2103.11520 | Gabriel Bertocco | Gabriel Bertocco and Fernanda Andal\'o and Anderson Rocha | Unsupervised and self-adaptative techniques for cross-domain person
re-identification | Published on IEEE Transactions on Information Forensics and Security | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Person Re-Identification (ReID) across non-overlapping cameras is a
challenging task and, for this reason, most works in the prior art rely on
supervised feature learning from a labeled dataset to match the same person in
different views. However, it demands the time-consuming task of labeling the
acquired data, proh... | [
{
"created": "Sun, 21 Mar 2021 23:58:39 GMT",
"version": "v1"
},
{
"created": "Fri, 26 Mar 2021 18:22:33 GMT",
"version": "v2"
},
{
"created": "Mon, 7 Feb 2022 13:29:38 GMT",
"version": "v3"
}
] | 2022-02-08 | [
[
"Bertocco",
"Gabriel",
""
],
[
"Andaló",
"Fernanda",
""
],
[
"Rocha",
"Anderson",
""
]
] | Person Re-Identification (ReID) across non-overlapping cameras is a challenging task and, for this reason, most works in the prior art rely on supervised feature learning from a labeled dataset to match the same person in different views. However, it demands the time-consuming task of labeling the acquired data, prohib... |
1107.5743 | Siddhartha Jonnalagadda | Siddhartha Jonnalagadda, Philip Topham | NEMO: Extraction and normalization of organization names from PubMed
affiliation strings | null | Siddhartha Jonnalagadda, Philip Topham. NEMO: Extraction and
normalization of organization names from PubMed affiliation strings. Journal
of Biomedical Discovery and Collaboration, 2010 Oct 4;5:50-75 | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose NEMO, a system for extracting organization names in the
affiliation and normalizing them to a canonical organization name. Our parsing
process involves multi-layered rule matching with multiple dictionaries. The
system achieves more than 98% f-score in extracting organization names. Our
process of normaliz... | [
{
"created": "Thu, 28 Jul 2011 15:37:56 GMT",
"version": "v1"
}
] | 2011-07-29 | [
[
"Jonnalagadda",
"Siddhartha",
""
],
[
"Topham",
"Philip",
""
]
] | We propose NEMO, a system for extracting organization names in the affiliation and normalizing them to a canonical organization name. Our parsing process involves multi-layered rule matching with multiple dictionaries. The system achieves more than 98% f-score in extracting organization names. Our process of normalizat... |
1807.01079 | Anna Latour | Anna L.D. Latour, Behrouz Babaki, Siegfried Nijssen | Stochastic Constraint Optimization using Propagation on Ordered Binary
Decision Diagrams | Eighth International Workshop on Statistical Relational AI, in
conjunction with the 2018 International Joint Conference on Artificial
Intelligence (IJCAI 2018) | null | null | null | cs.AI | http://creativecommons.org/licenses/by/4.0/ | A number of problems in relational Artificial Intelligence can be viewed as
Stochastic Constraint Optimization Problems (SCOPs). These are constraint
optimization problems that involve objectives or constraints with a stochastic
component. Building on the recently proposed language SC-ProbLog for modeling
SCOPs, we p... | [
{
"created": "Tue, 3 Jul 2018 10:58:38 GMT",
"version": "v1"
}
] | 2018-07-04 | [
[
"Latour",
"Anna L. D.",
""
],
[
"Babaki",
"Behrouz",
""
],
[
"Nijssen",
"Siegfried",
""
]
] | A number of problems in relational Artificial Intelligence can be viewed as Stochastic Constraint Optimization Problems (SCOPs). These are constraint optimization problems that involve objectives or constraints with a stochastic component. Building on the recently proposed language SC-ProbLog for modeling SCOPs, we pro... |
1711.00913 | Mohit Dubey | Mohit Dubey, Garrett Kenyon, Nils Carlson, Austin Thresher | Does Phase Matter For Monaural Source Separation? | 4 pages, 2 figures, NIPS format | null | null | null | cs.SD cs.NE eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The "cocktail party" problem of fully separating multiple sources from a
single channel audio waveform remains unsolved. Current biological
understanding of neural encoding suggests that phase information is preserved
and utilized at every stage of the auditory pathway. However, current
computational approaches prima... | [
{
"created": "Thu, 2 Nov 2017 20:10:00 GMT",
"version": "v1"
}
] | 2017-11-06 | [
[
"Dubey",
"Mohit",
""
],
[
"Kenyon",
"Garrett",
""
],
[
"Carlson",
"Nils",
""
],
[
"Thresher",
"Austin",
""
]
] | The "cocktail party" problem of fully separating multiple sources from a single channel audio waveform remains unsolved. Current biological understanding of neural encoding suggests that phase information is preserved and utilized at every stage of the auditory pathway. However, current computational approaches primari... |
2401.02180 | Ivo Sbalzarini | Johannes Pahlke, Ivo F. Sbalzarini | Proven Distributed Memory Parallelization of Particle Methods | 40 pages, 4 figures | null | null | null | cs.DC cs.DS cs.SE | http://creativecommons.org/licenses/by-nc-nd/4.0/ | We provide a mathematically proven parallelization scheme for particle
methods on distributed-memory computer systems. Particle methods are a
versatile and widely used class of algorithms for computer simulations and
numerical predictions in various applications, ranging from continuum fluid
dynamics and granular flo... | [
{
"created": "Thu, 4 Jan 2024 10:22:26 GMT",
"version": "v1"
}
] | 2024-01-05 | [
[
"Pahlke",
"Johannes",
""
],
[
"Sbalzarini",
"Ivo F.",
""
]
] | We provide a mathematically proven parallelization scheme for particle methods on distributed-memory computer systems. Particle methods are a versatile and widely used class of algorithms for computer simulations and numerical predictions in various applications, ranging from continuum fluid dynamics and granular flows... |
1008.1043 | Sergiy Vorobyov A. | Zengmao Chen, Cheng-Xiang Wang, Xuemin Hong, John Thompson, Sergiy A.
Vorobyov, Xiaohu Ge, Hailin Xiao, and Feng Zhao | Aggregate Interference Modeling in Cognitive Radio Networks with Power
and Contention Control | 24 pages, 8 figures, submitted to IEEE Trans. Communications in July
2010 | Z. Chen, C.-X. Wang, S.A. Vorobyov, and et al, "Aggregate
interference modeling in cognitive radio networks with power and contention
control," IEEE Trans. Communications, vol. 60, no. 2, pp. 456-468, Feb. 2012 | 10.1109/TCOMM.2011.012012.100426 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we present an interference model for cognitive radio (CR)
networks employing power control, contention control or hybrid power/contention
control schemes. For the first case, a power control scheme is proposed to
govern the transmission power of a CR node. For the second one, a contention
control schem... | [
{
"created": "Thu, 5 Aug 2010 19:20:21 GMT",
"version": "v1"
}
] | 2016-11-17 | [
[
"Chen",
"Zengmao",
""
],
[
"Wang",
"Cheng-Xiang",
""
],
[
"Hong",
"Xuemin",
""
],
[
"Thompson",
"John",
""
],
[
"Vorobyov",
"Sergiy A.",
""
],
[
"Ge",
"Xiaohu",
""
],
[
"Xiao",
"Hailin",
""
],
[
"Zh... | In this paper, we present an interference model for cognitive radio (CR) networks employing power control, contention control or hybrid power/contention control schemes. For the first case, a power control scheme is proposed to govern the transmission power of a CR node. For the second one, a contention control scheme ... |
2210.01987 | Artem Vysogorets | Dhrupad Bhardwaj, Julia Kempe, Artem Vysogorets, Angela M. Teng, and
Evaristus C. Ezekwem | ImpressLearn: Continual Learning via Combined Task Impressions | null | null | null | null | cs.CV cs.LG | http://creativecommons.org/licenses/by/4.0/ | This work proposes a new method to sequentially train deep neural networks on
multiple tasks without suffering catastrophic forgetting, while endowing it
with the capability to quickly adapt to unseen tasks. Starting from existing
work on network masking (Wortsman et al., 2020), we show that simply learning a
linear ... | [
{
"created": "Wed, 5 Oct 2022 02:28:25 GMT",
"version": "v1"
},
{
"created": "Tue, 31 Jan 2023 19:52:37 GMT",
"version": "v2"
}
] | 2023-02-02 | [
[
"Bhardwaj",
"Dhrupad",
""
],
[
"Kempe",
"Julia",
""
],
[
"Vysogorets",
"Artem",
""
],
[
"Teng",
"Angela M.",
""
],
[
"Ezekwem",
"Evaristus C.",
""
]
] | This work proposes a new method to sequentially train deep neural networks on multiple tasks without suffering catastrophic forgetting, while endowing it with the capability to quickly adapt to unseen tasks. Starting from existing work on network masking (Wortsman et al., 2020), we show that simply learning a linear co... |
1811.11660 | Michiel de Bondt | Michiel de Bondt | A short and elegant proof of a theorem of J.-E. Pin | 11 pages, major update with new proof | null | null | null | cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We give a short proof of a theorem of J.-E. Pin (theorem 1.1 below), which
can be found in his thesis. The part of the proof which is my own (not Pin's)
is a complete replacement of the same part in an earlier version of this paper.
| [
{
"created": "Wed, 28 Nov 2018 16:36:15 GMT",
"version": "v1"
},
{
"created": "Wed, 14 Sep 2022 11:52:28 GMT",
"version": "v2"
},
{
"created": "Thu, 15 Sep 2022 11:44:46 GMT",
"version": "v3"
}
] | 2022-09-16 | [
[
"de Bondt",
"Michiel",
""
]
] | We give a short proof of a theorem of J.-E. Pin (theorem 1.1 below), which can be found in his thesis. The part of the proof which is my own (not Pin's) is a complete replacement of the same part in an earlier version of this paper. |
2407.05246 | Yuxuan Yan | Yuxuan Yan, Na Lu, Ruofan Yan | Deep Online Probability Aggregation Clustering | 19 pages,2 figures, conference | null | null | null | cs.LG cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Combining machine clustering with deep models has shown remarkable
superiority in deep clustering. It modifies the data processing pipeline into
two alternating phases: feature clustering and model training. However, such
alternating schedule may lead to instability and computational burden issues.
We propose a cente... | [
{
"created": "Sun, 7 Jul 2024 03:31:00 GMT",
"version": "v1"
},
{
"created": "Sat, 13 Jul 2024 06:58:10 GMT",
"version": "v2"
}
] | 2024-07-16 | [
[
"Yan",
"Yuxuan",
""
],
[
"Lu",
"Na",
""
],
[
"Yan",
"Ruofan",
""
]
] | Combining machine clustering with deep models has shown remarkable superiority in deep clustering. It modifies the data processing pipeline into two alternating phases: feature clustering and model training. However, such alternating schedule may lead to instability and computational burden issues. We propose a centerl... |
1811.12240 | Geoffrey Goodell | Geoff Goodell and Tomaso Aste | Can Cryptocurrencies Preserve Privacy and Comply with Regulations? | 20 pages, 10 figures, 3 tables | null | 10.3389/fbloc.2019.00004 | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Cryptocurrencies offer an alternative to traditional methods of electronic
value exchange, promising anonymous, cash-like electronic transfers, but in
practice they fall short for several key reasons. We consider the false choice
between total surveillance, as represented by banking as currently implemented
by instit... | [
{
"created": "Thu, 29 Nov 2018 15:21:07 GMT",
"version": "v1"
},
{
"created": "Mon, 18 Mar 2019 16:34:47 GMT",
"version": "v2"
},
{
"created": "Tue, 7 May 2019 13:56:05 GMT",
"version": "v3"
}
] | 2019-06-05 | [
[
"Goodell",
"Geoff",
""
],
[
"Aste",
"Tomaso",
""
]
] | Cryptocurrencies offer an alternative to traditional methods of electronic value exchange, promising anonymous, cash-like electronic transfers, but in practice they fall short for several key reasons. We consider the false choice between total surveillance, as represented by banking as currently implemented by institut... |
1711.02026 | Arman Shojaeifard | Arman Shojaeifard, Kai-Kit Wong, Wei Yu, Gan Zheng, Jie Tang | Full-Duplex Cloud Radio Access Network: Stochastic Design and Analysis | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Full-duplex (FD) has emerged as a disruptive communications paradigm for
enhancing the achievable spectral efficiency (SE), thanks to the recent major
breakthroughs in self-interference (SI) mitigation. The FD versus half-duplex
(HD) SE gain, in cellular networks, is however largely limited by the
mutual-interference... | [
{
"created": "Mon, 6 Nov 2017 17:32:13 GMT",
"version": "v1"
}
] | 2017-11-07 | [
[
"Shojaeifard",
"Arman",
""
],
[
"Wong",
"Kai-Kit",
""
],
[
"Yu",
"Wei",
""
],
[
"Zheng",
"Gan",
""
],
[
"Tang",
"Jie",
""
]
] | Full-duplex (FD) has emerged as a disruptive communications paradigm for enhancing the achievable spectral efficiency (SE), thanks to the recent major breakthroughs in self-interference (SI) mitigation. The FD versus half-duplex (HD) SE gain, in cellular networks, is however largely limited by the mutual-interference (... |
2209.04053 | Thomas Steinke | Badih Ghazi, Ravi Kumar, Pasin Manurangsi, Thomas Steinke | Algorithms with More Granular Differential Privacy Guarantees | null | null | null | null | cs.CR cs.DS cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Differential privacy is often applied with a privacy parameter that is larger
than the theory suggests is ideal; various informal justifications for
tolerating large privacy parameters have been proposed. In this work, we
consider partial differential privacy (DP), which allows quantifying the
privacy guarantee on a ... | [
{
"created": "Thu, 8 Sep 2022 22:43:50 GMT",
"version": "v1"
}
] | 2022-09-12 | [
[
"Ghazi",
"Badih",
""
],
[
"Kumar",
"Ravi",
""
],
[
"Manurangsi",
"Pasin",
""
],
[
"Steinke",
"Thomas",
""
]
] | Differential privacy is often applied with a privacy parameter that is larger than the theory suggests is ideal; various informal justifications for tolerating large privacy parameters have been proposed. In this work, we consider partial differential privacy (DP), which allows quantifying the privacy guarantee on a pe... |
2105.07856 | Edward Simmons | Edward Simmons | Correlations Between Learning Environments and Dropout Intention | null | null | 10.13140/RG.2.2.28550.50245 | null | cs.CY math.ST stat.TH | http://creativecommons.org/licenses/by/4.0/ | This research is comparing learning environments to students dropout
intentions. While using statistics I looked at data and the correlations
between two articles to see how the two studies looked side to side. Learning
environments and dropout intentions can both have vary effects on students.
They can both determin... | [
{
"created": "Fri, 7 May 2021 10:08:47 GMT",
"version": "v1"
}
] | 2021-06-01 | [
[
"Simmons",
"Edward",
""
]
] | This research is comparing learning environments to students dropout intentions. While using statistics I looked at data and the correlations between two articles to see how the two studies looked side to side. Learning environments and dropout intentions can both have vary effects on students. They can both determine ... |
2107.12679 | Mingbo Zhao | Wenlong Cheng and Mingbo Zhao and Zhiling Ye and Shuhang Gu | MFAGAN: A Compression Framework for Memory-Efficient On-Device
Super-Resolution GAN | null | null | null | null | cs.AR cs.LG | http://creativecommons.org/publicdomain/zero/1.0/ | Generative adversarial networks (GANs) have promoted remarkable advances in
single-image super-resolution (SR) by recovering photo-realistic images.
However, high memory consumption of GAN-based SR (usually generators) causes
performance degradation and more energy consumption, hindering the deployment
of GAN-based S... | [
{
"created": "Tue, 27 Jul 2021 09:04:30 GMT",
"version": "v1"
}
] | 2021-07-28 | [
[
"Cheng",
"Wenlong",
""
],
[
"Zhao",
"Mingbo",
""
],
[
"Ye",
"Zhiling",
""
],
[
"Gu",
"Shuhang",
""
]
] | Generative adversarial networks (GANs) have promoted remarkable advances in single-image super-resolution (SR) by recovering photo-realistic images. However, high memory consumption of GAN-based SR (usually generators) causes performance degradation and more energy consumption, hindering the deployment of GAN-based SR ... |
2102.07886 | Johannes Sedlmeir | Johannes Sedlmeir and Hans Ulrich Buhl and Gilbert Fridgen and Robert
Keller | Recent Developments in Blockchain Technology and their Impact on Energy
Consumption | This is a translated version of a German article published in
Informatik Spektrum | null | 10.1007/s00287-020-01321-z | null | cs.CR cs.DC | http://creativecommons.org/licenses/by/4.0/ | The enormous power consumption of Bitcoin has led to undifferentiated
discussions in science and practice about the sustainability of blockchain and
distributed ledger technology in general. However, blockchain technology is far
from homogeneous - not only with regard to its applications, which now go far
beyond cryp... | [
{
"created": "Mon, 15 Feb 2021 22:55:30 GMT",
"version": "v1"
}
] | 2021-02-17 | [
[
"Sedlmeir",
"Johannes",
""
],
[
"Buhl",
"Hans Ulrich",
""
],
[
"Fridgen",
"Gilbert",
""
],
[
"Keller",
"Robert",
""
]
] | The enormous power consumption of Bitcoin has led to undifferentiated discussions in science and practice about the sustainability of blockchain and distributed ledger technology in general. However, blockchain technology is far from homogeneous - not only with regard to its applications, which now go far beyond crypto... |
1603.09012 | Laleh Jalali | Laleh Jalali and Ramesh Jain | A framework for event co-occurrence detection in event streams | null | null | null | null | cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper shows that characterizing co-occurrence between events is an
important but non-trivial and neglected aspect of discovering potential causal
relationships in multimedia event streams. First an introduction to the notion
of event co-occurrence and its relation to co-occurrence pattern detection is
given. The... | [
{
"created": "Wed, 30 Mar 2016 01:16:37 GMT",
"version": "v1"
}
] | 2016-03-31 | [
[
"Jalali",
"Laleh",
""
],
[
"Jain",
"Ramesh",
""
]
] | This paper shows that characterizing co-occurrence between events is an important but non-trivial and neglected aspect of discovering potential causal relationships in multimedia event streams. First an introduction to the notion of event co-occurrence and its relation to co-occurrence pattern detection is given. Then ... |
2408.05476 | Jonas Oppenlaender | Jonas Oppenlaender, Hannah Johnston, Johanna Silvennoinen, Helena
Barranha | Artworks Reimagined: Exploring Human-AI Co-Creation through Body
Prompting | 16 pages, 5 figures, 2 tables | null | null | null | cs.HC cs.AI cs.ET | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Image generation using generative artificial intelligence is a popular
activity. However, it is almost exclusively performed in the privacy of an
individual's home via typing on a keyboard. In this article, we explore body
prompting as input for image generation. Body prompting extends interaction
with generative AI ... | [
{
"created": "Sat, 10 Aug 2024 08:05:59 GMT",
"version": "v1"
}
] | 2024-08-13 | [
[
"Oppenlaender",
"Jonas",
""
],
[
"Johnston",
"Hannah",
""
],
[
"Silvennoinen",
"Johanna",
""
],
[
"Barranha",
"Helena",
""
]
] | Image generation using generative artificial intelligence is a popular activity. However, it is almost exclusively performed in the privacy of an individual's home via typing on a keyboard. In this article, we explore body prompting as input for image generation. Body prompting extends interaction with generative AI be... |
2201.12590 | Christopher Bl\"ocker | Christopher Bl\"ocker, Juan Carlos Nieves, Martin Rosvall | Map Equation Centrality: Community-aware Centrality based on the Map
Equation | null | Appl Netw Sci 7, 56 (2022) | 10.1007/s41109-022-00477-9 | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | To measure node importance, network scientists employ centrality scores that
typically take a microscopic or macroscopic perspective, relying on node
features or global network structure. However, traditional centrality measures
such as degree centrality, betweenness centrality, or PageRank neglect the
community stru... | [
{
"created": "Sat, 29 Jan 2022 13:47:27 GMT",
"version": "v1"
},
{
"created": "Wed, 17 Aug 2022 07:26:00 GMT",
"version": "v2"
}
] | 2022-08-18 | [
[
"Blöcker",
"Christopher",
""
],
[
"Nieves",
"Juan Carlos",
""
],
[
"Rosvall",
"Martin",
""
]
] | To measure node importance, network scientists employ centrality scores that typically take a microscopic or macroscopic perspective, relying on node features or global network structure. However, traditional centrality measures such as degree centrality, betweenness centrality, or PageRank neglect the community struct... |
1603.05739 | Elliot Schumacher | Elliot Schumacher, Maxine Eskenazi | A Readability Analysis of Campaign Speeches from the 2016 US
Presidential Campaign | null | null | null | CMU-LTI-16-001 | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Readability is defined as the reading level of the speech from grade 1 to
grade 12. It results from the use of the REAP readability analysis (vocabulary
- Collins-Thompson and Callan, 2004; syntax - Heilman et al ,2006, 2007), which
use the lexical contents and grammatical structure of the sentences in a
document to ... | [
{
"created": "Fri, 18 Mar 2016 00:55:52 GMT",
"version": "v1"
}
] | 2016-03-21 | [
[
"Schumacher",
"Elliot",
""
],
[
"Eskenazi",
"Maxine",
""
]
] | Readability is defined as the reading level of the speech from grade 1 to grade 12. It results from the use of the REAP readability analysis (vocabulary - Collins-Thompson and Callan, 2004; syntax - Heilman et al ,2006, 2007), which use the lexical contents and grammatical structure of the sentences in a document to pr... |
2305.15055 | Mayank Singh | Mayank Kumar Singh, Naoya Takahashi, Onoe Naoyuki | Iteratively Improving Speech Recognition and Voice Conversion | null | null | null | null | cs.SD cs.AI eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many existing works on voice conversion (VC) tasks use automatic speech
recognition (ASR) models for ensuring linguistic consistency between source and
converted samples. However, for the low-data resource domains, training a
high-quality ASR remains to be a challenging task. In this work, we propose a
novel iterativ... | [
{
"created": "Wed, 24 May 2023 11:45:42 GMT",
"version": "v1"
}
] | 2023-05-25 | [
[
"Singh",
"Mayank Kumar",
""
],
[
"Takahashi",
"Naoya",
""
],
[
"Naoyuki",
"Onoe",
""
]
] | Many existing works on voice conversion (VC) tasks use automatic speech recognition (ASR) models for ensuring linguistic consistency between source and converted samples. However, for the low-data resource domains, training a high-quality ASR remains to be a challenging task. In this work, we propose a novel iterative ... |
2403.14292 | Saad Noufel | Saad Noufel, Nadir Maaroufi, Mehdi Najib, Mohamed Bakhouya | HySim: An Efficient Hybrid Similarity Measure for Patch Matching in
Image Inpainting | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Inpainting, for filling missing image regions, is a crucial task in various
applications, such as medical imaging and remote sensing. Trending data-driven
approaches efficiency, for image inpainting, often requires extensive data
preprocessing. In this sense, there is still a need for model-driven approaches
in case ... | [
{
"created": "Thu, 21 Mar 2024 10:59:44 GMT",
"version": "v1"
}
] | 2024-03-22 | [
[
"Noufel",
"Saad",
""
],
[
"Maaroufi",
"Nadir",
""
],
[
"Najib",
"Mehdi",
""
],
[
"Bakhouya",
"Mohamed",
""
]
] | Inpainting, for filling missing image regions, is a crucial task in various applications, such as medical imaging and remote sensing. Trending data-driven approaches efficiency, for image inpainting, often requires extensive data preprocessing. In this sense, there is still a need for model-driven approaches in case of... |
1502.01877 | Helio M. de Oliveira | H.M. de Oliveira and T.H. Falk | On Wavelet Decomposition over Finite Fields | 4 pages, 1 figure. conference: XIX Simposio Brasileiro de
Telecomunicacoes, 2001, Fortaleza, CE, Brazil | null | null | null | cs.IT math.IT math.NT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper introduces some foundations of wavelets over Galois fields.
Standard orthogonal finite-field wavelets (FF-Wavelets) including FF-Haar and
FF-Daubechies are derived. Non-orthogonal FF-wavelets such as B-spline over
GF(p) are also considered. A few examples of multiresolution analysis over
Finite fields are ... | [
{
"created": "Fri, 6 Feb 2015 13:09:24 GMT",
"version": "v1"
}
] | 2020-06-01 | [
[
"de Oliveira",
"H. M.",
""
],
[
"Falk",
"T. H.",
""
]
] | This paper introduces some foundations of wavelets over Galois fields. Standard orthogonal finite-field wavelets (FF-Wavelets) including FF-Haar and FF-Daubechies are derived. Non-orthogonal FF-wavelets such as B-spline over GF(p) are also considered. A few examples of multiresolution analysis over Finite fields are pr... |
2304.11354 | YuanFu Yang | Yuan-Fu Yang, Iuan-Kai Fang, Min Sun, Su-Chu Hsu | Medium. Permeation: SARS-COV-2 Painting Creation by Generative Model | Keywords: SARS-CoV-2; Generative Art; Graph Neural Network. arXiv
admin note: text overlap with arXiv:1706.07068 by other authors | null | null | null | cs.CV cs.GR | http://creativecommons.org/licenses/by/4.0/ | Airborne particles are the medium for SARS-CoV-2 to invade the human body.
Light also reflects through suspended particles in the air, allowing people to
see a colorful world. Impressionism is the most prominent art school that
explores the spectrum of color created through color reflection of light. We
find similari... | [
{
"created": "Sat, 22 Apr 2023 09:27:47 GMT",
"version": "v1"
}
] | 2023-04-25 | [
[
"Yang",
"Yuan-Fu",
""
],
[
"Fang",
"Iuan-Kai",
""
],
[
"Sun",
"Min",
""
],
[
"Hsu",
"Su-Chu",
""
]
] | Airborne particles are the medium for SARS-CoV-2 to invade the human body. Light also reflects through suspended particles in the air, allowing people to see a colorful world. Impressionism is the most prominent art school that explores the spectrum of color created through color reflection of light. We find similariti... |
1806.04584 | Chujie Wang | Chujie Wang, Zhifeng Zhao, Qi Sun, Honggang Zhang | Deep Learning-based Intelligent Dual Connectivity for Mobility
Management in Dense Network | 5 pages, 9 figures, conference | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Ultra-dense network deployment has been proposed as a key technique for
achieving capacity goals in the fifth-generation (5G) mobile communication
system. However, the deployment of smaller cells inevitably leads to more
frequent handovers, thus making mobility management more challenging and
reducing the capacity ga... | [
{
"created": "Wed, 30 May 2018 07:59:12 GMT",
"version": "v1"
}
] | 2018-06-13 | [
[
"Wang",
"Chujie",
""
],
[
"Zhao",
"Zhifeng",
""
],
[
"Sun",
"Qi",
""
],
[
"Zhang",
"Honggang",
""
]
] | Ultra-dense network deployment has been proposed as a key technique for achieving capacity goals in the fifth-generation (5G) mobile communication system. However, the deployment of smaller cells inevitably leads to more frequent handovers, thus making mobility management more challenging and reducing the capacity gain... |
2209.01386 | Chao Zhang | Chao Zhang, Zijian Tang, Taoming Guo, Jiaxin Lei, Jiaxin Xiao, Anhe
Wang, Shuo Bai, Milin Zhang | SaleNet: A low-power end-to-end CNN accelerator for sustained attention
level evaluation using EEG | 5 pages, 4 figures, to be published in IEEE International Symposium
on Circuits and Systems (ISCAS) 2022 | null | null | null | cs.AR cs.LG eess.SP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper proposes SaleNet - an end-to-end convolutional neural network
(CNN) for sustained attention level evaluation using prefrontal
electroencephalogram (EEG). A bias-driven pruning method is proposed together
with group convolution, global average pooling (GAP), near-zero pruning, weight
clustering and quantiza... | [
{
"created": "Sat, 3 Sep 2022 09:49:37 GMT",
"version": "v1"
}
] | 2022-09-07 | [
[
"Zhang",
"Chao",
""
],
[
"Tang",
"Zijian",
""
],
[
"Guo",
"Taoming",
""
],
[
"Lei",
"Jiaxin",
""
],
[
"Xiao",
"Jiaxin",
""
],
[
"Wang",
"Anhe",
""
],
[
"Bai",
"Shuo",
""
],
[
"Zhang",
"Milin",
... | This paper proposes SaleNet - an end-to-end convolutional neural network (CNN) for sustained attention level evaluation using prefrontal electroencephalogram (EEG). A bias-driven pruning method is proposed together with group convolution, global average pooling (GAP), near-zero pruning, weight clustering and quantizati... |
1906.00189 | Tongliang Liu | Xiaobo Xia and Tongliang Liu and Nannan Wang and Bo Han and Chen Gong
and Gang Niu and Masashi Sugiyama | Are Anchor Points Really Indispensable in Label-Noise Learning? | Accepted by NeurIPS 2019 | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In label-noise learning, \textit{noise transition matrix}, denoting the
probabilities that clean labels flip into noisy labels, plays a central role in
building \textit{statistically consistent classifiers}. Existing theories have
shown that the transition matrix can be learned by exploiting \textit{anchor
points} (i... | [
{
"created": "Sat, 1 Jun 2019 09:14:54 GMT",
"version": "v1"
},
{
"created": "Tue, 17 Dec 2019 02:23:29 GMT",
"version": "v2"
}
] | 2019-12-18 | [
[
"Xia",
"Xiaobo",
""
],
[
"Liu",
"Tongliang",
""
],
[
"Wang",
"Nannan",
""
],
[
"Han",
"Bo",
""
],
[
"Gong",
"Chen",
""
],
[
"Niu",
"Gang",
""
],
[
"Sugiyama",
"Masashi",
""
]
] | In label-noise learning, \textit{noise transition matrix}, denoting the probabilities that clean labels flip into noisy labels, plays a central role in building \textit{statistically consistent classifiers}. Existing theories have shown that the transition matrix can be learned by exploiting \textit{anchor points} (i.e... |
2010.13816 | Maarten Sap | Xinyao Ma, Maarten Sap, Hannah Rashkin, Yejin Choi | PowerTransformer: Unsupervised Controllable Revision for Biased Language
Correction | EMNLP 2020 | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Unconscious biases continue to be prevalent in modern text and media, calling
for algorithms that can assist writers with bias correction. For example, a
female character in a story is often portrayed as passive and powerless ("She
daydreams about being a doctor") while a man is portrayed as more proactive and
powerf... | [
{
"created": "Mon, 26 Oct 2020 18:05:48 GMT",
"version": "v1"
}
] | 2020-10-28 | [
[
"Ma",
"Xinyao",
""
],
[
"Sap",
"Maarten",
""
],
[
"Rashkin",
"Hannah",
""
],
[
"Choi",
"Yejin",
""
]
] | Unconscious biases continue to be prevalent in modern text and media, calling for algorithms that can assist writers with bias correction. For example, a female character in a story is often portrayed as passive and powerless ("She daydreams about being a doctor") while a man is portrayed as more proactive and powerful... |
1703.05446 | Ke Gong | Ke Gong, Xiaodan Liang, Dongyu Zhang, Xiaohui Shen, Liang Lin | Look into Person: Self-supervised Structure-sensitive Learning and A New
Benchmark for Human Parsing | Accepted to appear in CVPR 2017 | null | null | null | cs.CV cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Human parsing has recently attracted a lot of research interests due to its
huge application potentials. However existing datasets have limited number of
images and annotations, and lack the variety of human appearances and the
coverage of challenging cases in unconstrained environment. In this paper, we
introduce a ... | [
{
"created": "Thu, 16 Mar 2017 01:14:36 GMT",
"version": "v1"
},
{
"created": "Fri, 28 Jul 2017 01:41:39 GMT",
"version": "v2"
}
] | 2017-07-31 | [
[
"Gong",
"Ke",
""
],
[
"Liang",
"Xiaodan",
""
],
[
"Zhang",
"Dongyu",
""
],
[
"Shen",
"Xiaohui",
""
],
[
"Lin",
"Liang",
""
]
] | Human parsing has recently attracted a lot of research interests due to its huge application potentials. However existing datasets have limited number of images and annotations, and lack the variety of human appearances and the coverage of challenging cases in unconstrained environment. In this paper, we introduce a ne... |
1110.2849 | Karthick Jayaraman | Karthick Jayaraman, Vijay Ganesh, Mahesh Tripunitara, Martin C Rinard,
Steve J. Chapin | ARBAC Policy for a Large Multi-National Bank | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Administrative role-based access control (ARBAC) is the first comprehensive
administrative model proposed for role-based access control (RBAC). ARBAC has
several features for designing highly expressive policies, but current work has
not highlighted the utility of these expressive policies. In this report, we
present... | [
{
"created": "Thu, 13 Oct 2011 07:13:11 GMT",
"version": "v1"
}
] | 2011-10-14 | [
[
"Jayaraman",
"Karthick",
""
],
[
"Ganesh",
"Vijay",
""
],
[
"Tripunitara",
"Mahesh",
""
],
[
"Rinard",
"Martin C",
""
],
[
"Chapin",
"Steve J.",
""
]
] | Administrative role-based access control (ARBAC) is the first comprehensive administrative model proposed for role-based access control (RBAC). ARBAC has several features for designing highly expressive policies, but current work has not highlighted the utility of these expressive policies. In this report, we present a... |
2301.03094 | Jonas Witt | Jonas Witt, Stef Rasing, Sebastijan Duman\v{c}i\'c, Tias Guns and
Claus-Christian Carbon | A Divide-Align-Conquer Strategy for Program Synthesis | 11 pages, 9 figures | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A major bottleneck in search-based program synthesis is the exponentially
growing search space which makes learning large programs intractable. Humans
mitigate this problem by leveraging the compositional nature of the real world:
In structured domains, a logical specification can often be decomposed into
smaller, co... | [
{
"created": "Sun, 8 Jan 2023 19:10:55 GMT",
"version": "v1"
}
] | 2023-01-10 | [
[
"Witt",
"Jonas",
""
],
[
"Rasing",
"Stef",
""
],
[
"Dumančić",
"Sebastijan",
""
],
[
"Guns",
"Tias",
""
],
[
"Carbon",
"Claus-Christian",
""
]
] | A major bottleneck in search-based program synthesis is the exponentially growing search space which makes learning large programs intractable. Humans mitigate this problem by leveraging the compositional nature of the real world: In structured domains, a logical specification can often be decomposed into smaller, comp... |
cs/0212044 | Sandor P. Fekete | Sandor P. Fekete, Henk Meijer, Andre Rohe, and Walter Tietze | Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for
Maximum Matchings and Maximum Traveling Salesman Problems | 20 pages, 14 figures, Latex, to appear in Journal of Experimental
Algorithms, 2002 | Journal of Experimental Algorithms, 7 (2002), article 11. | null | null | cs.DS | null | We consider geometric instances of the Maximum Weighted Matching Problem
(MWMP) and the Maximum Traveling Salesman Problem (MTSP) with up to 3,000,000
vertices. Making use of a geometric duality relationship between MWMP, MTSP,
and the Fermat-Weber-Problem (FWP), we develop a heuristic approach that yields
in near-li... | [
{
"created": "Mon, 16 Dec 2002 09:39:16 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Fekete",
"Sandor P.",
""
],
[
"Meijer",
"Henk",
""
],
[
"Rohe",
"Andre",
""
],
[
"Tietze",
"Walter",
""
]
] | We consider geometric instances of the Maximum Weighted Matching Problem (MWMP) and the Maximum Traveling Salesman Problem (MTSP) with up to 3,000,000 vertices. Making use of a geometric duality relationship between MWMP, MTSP, and the Fermat-Weber-Problem (FWP), we develop a heuristic approach that yields in near-line... |
1508.07504 | Joseph Cheriyan | Joe Cheriyan, Zhihan Gao | Approximating (Unweighted) Tree Augmentation via Lift-and-Project, Part
I: Stemless TAP | 24 pages, 11 figures | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In Part I, we study a special case of the unweighted Tree Augmentation
Problem (TAP) via the Lasserre (Sum of Squares) system. In the special case, we
forbid so-called stems; these are a particular type of subtree configuration.
For stemless TAP, we prove that the integrality ratio of an SDP relaxation (the
Lasserre ... | [
{
"created": "Sat, 29 Aug 2015 20:48:09 GMT",
"version": "v1"
}
] | 2015-09-01 | [
[
"Cheriyan",
"Joe",
""
],
[
"Gao",
"Zhihan",
""
]
] | In Part I, we study a special case of the unweighted Tree Augmentation Problem (TAP) via the Lasserre (Sum of Squares) system. In the special case, we forbid so-called stems; these are a particular type of subtree configuration. For stemless TAP, we prove that the integrality ratio of an SDP relaxation (the Lasserre ti... |
1908.00485 | Zhun Zhong | Zhun Zhong, Liang Zheng, Zhiming Luo, Shaozi Li and Yi Yang | Learning to Adapt Invariance in Memory for Person Re-identification | Extension of conference version: arXiv:1904.01990 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work considers the problem of unsupervised domain adaptation in person
re-identification (re-ID), which aims to transfer knowledge from the source
domain to the target domain. Existing methods are primary to reduce the
inter-domain shift between the domains, which however usually overlook the
relations among tar... | [
{
"created": "Thu, 1 Aug 2019 16:20:16 GMT",
"version": "v1"
}
] | 2019-08-02 | [
[
"Zhong",
"Zhun",
""
],
[
"Zheng",
"Liang",
""
],
[
"Luo",
"Zhiming",
""
],
[
"Li",
"Shaozi",
""
],
[
"Yang",
"Yi",
""
]
] | This work considers the problem of unsupervised domain adaptation in person re-identification (re-ID), which aims to transfer knowledge from the source domain to the target domain. Existing methods are primary to reduce the inter-domain shift between the domains, which however usually overlook the relations among targe... |
2408.01962 | Robert Wolfe | Robert Wolfe, Tanushree Mitra | The Implications of Open Generative Models in Human-Centered Data
Science Work: A Case Study with Fact-Checking Organizations | Accepted at Artificial Intelligence, Ethics, and Society 2024 | null | null | null | cs.HC cs.AI cs.CL cs.CY cs.ET | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Calls to use open generative language models in academic research have
highlighted the need for reproducibility and transparency in scientific
research. However, the impact of generative AI extends well beyond academia, as
corporations and public interest organizations have begun integrating these
models into their d... | [
{
"created": "Sun, 4 Aug 2024 08:41:48 GMT",
"version": "v1"
}
] | 2024-08-06 | [
[
"Wolfe",
"Robert",
""
],
[
"Mitra",
"Tanushree",
""
]
] | Calls to use open generative language models in academic research have highlighted the need for reproducibility and transparency in scientific research. However, the impact of generative AI extends well beyond academia, as corporations and public interest organizations have begun integrating these models into their dat... |
2311.03725 | Arti Kumbhar | Arti Kumbhar, Amruta Chougule, Priya Lokhande, Saloni Navaghane, Aditi
Burud, Saee Nimbalkar | DeepInspect: An AI-Powered Defect Detection for Manufacturing Industries | Research Paper for Defect Detection for Manufacturing Industries
Using Deep Learning Techniques: 5 pages, 8 figures | null | null | null | cs.CV eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Utilizing Convolutional Neural Networks (CNNs), Recurrent Neural Networks
(RNNs), and Generative Adversarial Networks (GANs), our system introduces an
innovative approach to defect detection in manufacturing. This technology
excels in precisely identifying faults by extracting intricate details from
product photograp... | [
{
"created": "Tue, 7 Nov 2023 04:59:43 GMT",
"version": "v1"
},
{
"created": "Wed, 8 Nov 2023 07:45:58 GMT",
"version": "v2"
}
] | 2023-11-09 | [
[
"Kumbhar",
"Arti",
""
],
[
"Chougule",
"Amruta",
""
],
[
"Lokhande",
"Priya",
""
],
[
"Navaghane",
"Saloni",
""
],
[
"Burud",
"Aditi",
""
],
[
"Nimbalkar",
"Saee",
""
]
] | Utilizing Convolutional Neural Networks (CNNs), Recurrent Neural Networks (RNNs), and Generative Adversarial Networks (GANs), our system introduces an innovative approach to defect detection in manufacturing. This technology excels in precisely identifying faults by extracting intricate details from product photographs... |
2103.11297 | Ryan Rossi | Camille Harris, Ryan A. Rossi, Sana Malik, Jane Hoffswell, Fan Du, Tak
Yeon Lee, Eunyee Koh, Handong Zhao | Insight-centric Visualization Recommendation | null | null | null | null | cs.HC cs.AI cs.IR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Visualization recommendation systems simplify exploratory data analysis (EDA)
and make understanding data more accessible to users of all skill levels by
automatically generating visualizations for users to explore. However, most
existing visualization recommendation systems focus on ranking all
visualizations into a... | [
{
"created": "Sun, 21 Mar 2021 03:30:22 GMT",
"version": "v1"
}
] | 2021-03-23 | [
[
"Harris",
"Camille",
""
],
[
"Rossi",
"Ryan A.",
""
],
[
"Malik",
"Sana",
""
],
[
"Hoffswell",
"Jane",
""
],
[
"Du",
"Fan",
""
],
[
"Lee",
"Tak Yeon",
""
],
[
"Koh",
"Eunyee",
""
],
[
"Zhao",
"H... | Visualization recommendation systems simplify exploratory data analysis (EDA) and make understanding data more accessible to users of all skill levels by automatically generating visualizations for users to explore. However, most existing visualization recommendation systems focus on ranking all visualizations into a s... |
2310.15624 | Yan Lu | Yan Lu, Xinzhu Ma, Lei Yang, Tianzhu Zhang, Yating Liu, Qi Chu, Tong
He, Yonghui Li, Wanli Ouyang | GUPNet++: Geometry Uncertainty Propagation Network for Monocular 3D
Object Detection | 18 pages, 9 figures | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Geometry plays a significant role in monocular 3D object detection. It can be
used to estimate object depth by using the perspective projection between
object's physical size and 2D projection in the image plane, which can
introduce mathematical priors into deep models. However, this projection
process also introduce... | [
{
"created": "Tue, 24 Oct 2023 08:45:15 GMT",
"version": "v1"
}
] | 2023-10-25 | [
[
"Lu",
"Yan",
""
],
[
"Ma",
"Xinzhu",
""
],
[
"Yang",
"Lei",
""
],
[
"Zhang",
"Tianzhu",
""
],
[
"Liu",
"Yating",
""
],
[
"Chu",
"Qi",
""
],
[
"He",
"Tong",
""
],
[
"Li",
"Yonghui",
""
],
... | Geometry plays a significant role in monocular 3D object detection. It can be used to estimate object depth by using the perspective projection between object's physical size and 2D projection in the image plane, which can introduce mathematical priors into deep models. However, this projection process also introduces ... |
2105.10016 | Xinyu Liu | Xinyu Liu, Qi Zhou, Joy Arulraj, and Alessandro Orso | Testing DBMS Performance with Mutations | null | null | null | null | cs.DB cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Because database systems are the critical component of modern data-intensive
applications, it is important to ensure that they operate correctly. To this
end, developers extensively test these systems to eliminate bugs that
negatively affect functionality. In addition to functional bugs, however, there
is another imp... | [
{
"created": "Thu, 20 May 2021 20:18:43 GMT",
"version": "v1"
},
{
"created": "Thu, 2 Sep 2021 01:49:11 GMT",
"version": "v2"
}
] | 2021-09-03 | [
[
"Liu",
"Xinyu",
""
],
[
"Zhou",
"Qi",
""
],
[
"Arulraj",
"Joy",
""
],
[
"Orso",
"Alessandro",
""
]
] | Because database systems are the critical component of modern data-intensive applications, it is important to ensure that they operate correctly. To this end, developers extensively test these systems to eliminate bugs that negatively affect functionality. In addition to functional bugs, however, there is another impor... |
2005.10801 | Farhad Pakdaman | Farhad Pakdaman, Mohammad Ali Adelimanesh, Moncef Gabbouj, Mahmoud
Reza Hashemi | Complexity Analysis Of Next-Generation VVC Encoding and Decoding | IEEE ICIP 2020 | Proceedings of International Conference on Image Processing
(ICIP), (2020) 3134-3138 | 10.1109/ICIP40778.2020.9190983 | null | cs.MM cs.CC eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While the next generation video compression standard, Versatile Video Coding
(VVC), provides a superior compression efficiency, its computational complexity
dramatically increases. This paper thoroughly analyzes this complexity for both
encoder and decoder of VVC Test Model 6, by quantifying the complexity
break-down... | [
{
"created": "Thu, 21 May 2020 17:30:42 GMT",
"version": "v1"
}
] | 2020-10-08 | [
[
"Pakdaman",
"Farhad",
""
],
[
"Adelimanesh",
"Mohammad Ali",
""
],
[
"Gabbouj",
"Moncef",
""
],
[
"Hashemi",
"Mahmoud Reza",
""
]
] | While the next generation video compression standard, Versatile Video Coding (VVC), provides a superior compression efficiency, its computational complexity dramatically increases. This paper thoroughly analyzes this complexity for both encoder and decoder of VVC Test Model 6, by quantifying the complexity break-down f... |
2206.10025 | Petra Wolf | Jonas Lingg, Mateus de Oliveira Oliveira, Petra Wolf | Learning from Positive and Negative Examples: New Proof for Binary
Alphabets | null | null | null | null | cs.FL cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One of the most fundamental problems in computational learning theory is the
the problem of learning a finite automaton $A$ consistent with a finite set $P$
of positive examples and with a finite set $N$ of negative examples. By
consistency, we mean that $A$ accepts all strings in $P$ and rejects all
strings in $N$. ... | [
{
"created": "Mon, 20 Jun 2022 22:20:48 GMT",
"version": "v1"
}
] | 2022-06-22 | [
[
"Lingg",
"Jonas",
""
],
[
"Oliveira",
"Mateus de Oliveira",
""
],
[
"Wolf",
"Petra",
""
]
] | One of the most fundamental problems in computational learning theory is the the problem of learning a finite automaton $A$ consistent with a finite set $P$ of positive examples and with a finite set $N$ of negative examples. By consistency, we mean that $A$ accepts all strings in $P$ and rejects all strings in $N$. It... |
2102.12684 | Wil Thomason | Claire Liang (1), Wil Thomason (2), E. Andy Ricci (1), and Soham
Sankaran (1, 3) ((1) Cornell University Department of Computer Science, (2)
Rice University Department of Computer Science, (3) Pashi Corp.) | Ensuring Progress for Multiple Mobile Robots via Space Partitioning,
Motion Rules, and Adaptively Centralized Conflict Resolution | 9 pages, 4 figures. Submitted to IROS 2021 | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In environments where multiple robots must coordinate in a shared space,
decentralized approaches allow for decoupled planning at the cost of global
guarantees, while centralized approaches make the opposite trade-off. These
solutions make a range of assumptions - commonly, that all the robots share the
same planning... | [
{
"created": "Thu, 25 Feb 2021 04:51:09 GMT",
"version": "v1"
},
{
"created": "Mon, 7 Mar 2022 18:45:50 GMT",
"version": "v2"
}
] | 2022-03-08 | [
[
"Liang",
"Claire",
""
],
[
"Thomason",
"Wil",
""
],
[
"Ricci",
"E. Andy",
""
],
[
"Sankaran",
"Soham",
""
]
] | In environments where multiple robots must coordinate in a shared space, decentralized approaches allow for decoupled planning at the cost of global guarantees, while centralized approaches make the opposite trade-off. These solutions make a range of assumptions - commonly, that all the robots share the same planning s... |
1802.05666 | Jonathan Uesato | Jonathan Uesato, Brendan O'Donoghue, Aaron van den Oord, Pushmeet
Kohli | Adversarial Risk and the Dangers of Evaluating Against Weak Attacks | null | null | null | null | cs.LG cs.CR stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper investigates recently proposed approaches for defending against
adversarial examples and evaluating adversarial robustness. We motivate
'adversarial risk' as an objective for achieving models robust to worst-case
inputs. We then frame commonly used attacks and evaluation metrics as defining
a tractable sur... | [
{
"created": "Thu, 15 Feb 2018 17:13:18 GMT",
"version": "v1"
},
{
"created": "Tue, 12 Jun 2018 14:20:27 GMT",
"version": "v2"
}
] | 2018-06-13 | [
[
"Uesato",
"Jonathan",
""
],
[
"O'Donoghue",
"Brendan",
""
],
[
"Oord",
"Aaron van den",
""
],
[
"Kohli",
"Pushmeet",
""
]
] | This paper investigates recently proposed approaches for defending against adversarial examples and evaluating adversarial robustness. We motivate 'adversarial risk' as an objective for achieving models robust to worst-case inputs. We then frame commonly used attacks and evaluation metrics as defining a tractable surro... |
2210.15804 | Gayathri Manikutty | Sreejith Sasidharan, Pranav Prabha, Devasena Pasupuleti, Anand M Das,
Chaitanya Kapoor, Gayathri Manikutty, Praveen Pankajakshan, Bhavani Rao | Handwashing Action Detection System for an Autonomous Social Robot | null | null | 10.1109/TENCON55691.2022.9977684 | null | cs.RO cs.AI | http://creativecommons.org/licenses/by/4.0/ | Young children are at an increased risk of contracting contagious diseases
such as COVID-19 due to improper hand hygiene. An autonomous social agent that
observes children while handwashing and encourages good hand washing practices
could provide an opportunity for handwashing behavior to become a habit. In
this arti... | [
{
"created": "Thu, 27 Oct 2022 23:46:56 GMT",
"version": "v1"
}
] | 2023-06-21 | [
[
"Sasidharan",
"Sreejith",
""
],
[
"Prabha",
"Pranav",
""
],
[
"Pasupuleti",
"Devasena",
""
],
[
"Das",
"Anand M",
""
],
[
"Kapoor",
"Chaitanya",
""
],
[
"Manikutty",
"Gayathri",
""
],
[
"Pankajakshan",
"Praveen... | Young children are at an increased risk of contracting contagious diseases such as COVID-19 due to improper hand hygiene. An autonomous social agent that observes children while handwashing and encourages good hand washing practices could provide an opportunity for handwashing behavior to become a habit. In this articl... |
2312.05594 | Dong In Kim | Nguyen Van Huynh, Jiacheng Wang, Hongyang Du, Dinh Thai Hoang, Dusit
Niyato, Diep N. Nguyen, Dong In Kim, and Khaled B. Letaief | Generative AI for Physical Layer Communications: A Survey | null | null | null | null | cs.NI cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The recent evolution of generative artificial intelligence (GAI) leads to the
emergence of groundbreaking applications such as ChatGPT, which not only
enhances the efficiency of digital content production, such as text, audio,
video, or even network traffic data, but also enriches its diversity. Beyond
digital conten... | [
{
"created": "Sat, 9 Dec 2023 15:20:56 GMT",
"version": "v1"
}
] | 2023-12-12 | [
[
"Van Huynh",
"Nguyen",
""
],
[
"Wang",
"Jiacheng",
""
],
[
"Du",
"Hongyang",
""
],
[
"Hoang",
"Dinh Thai",
""
],
[
"Niyato",
"Dusit",
""
],
[
"Nguyen",
"Diep N.",
""
],
[
"Kim",
"Dong In",
""
],
[
"... | The recent evolution of generative artificial intelligence (GAI) leads to the emergence of groundbreaking applications such as ChatGPT, which not only enhances the efficiency of digital content production, such as text, audio, video, or even network traffic data, but also enriches its diversity. Beyond digital content ... |
2307.00771 | Ning Lin | Ning Lin, Shaocong Wang, Yi Li, Bo Wang, Shuhui Shi, Yangu He, Woyu
Zhang, Yifei Yu, Yue Zhang, Xiaojuan Qi, Xiaoming Chen, Hao Jiang, Xumeng
Zhang, Peng Lin, Xiaoxin Xu, Qi Liu, Zhongrui Wang, Dashan Shang and Ming Liu | Resistive memory-based zero-shot liquid state machine for multimodal
event data learning | null | null | null | null | cs.ET | http://creativecommons.org/licenses/by-nc-sa/4.0/ | The human brain is a complex spiking neural network (SNN) that learns
multimodal signals in a zero-shot manner by generalizing existing knowledge.
Remarkably, the brain achieves this with minimal power consumption, using
event-based signals that propagate within its structure. However, mimicking the
human brain in ne... | [
{
"created": "Mon, 3 Jul 2023 06:21:05 GMT",
"version": "v1"
}
] | 2023-07-04 | [
[
"Lin",
"Ning",
""
],
[
"Wang",
"Shaocong",
""
],
[
"Li",
"Yi",
""
],
[
"Wang",
"Bo",
""
],
[
"Shi",
"Shuhui",
""
],
[
"He",
"Yangu",
""
],
[
"Zhang",
"Woyu",
""
],
[
"Yu",
"Yifei",
""
],
... | The human brain is a complex spiking neural network (SNN) that learns multimodal signals in a zero-shot manner by generalizing existing knowledge. Remarkably, the brain achieves this with minimal power consumption, using event-based signals that propagate within its structure. However, mimicking the human brain in neur... |
0812.1394 | Sahbi Sidhom | Sahbi Sidhom (LORIA, Sii) | Conceptual approach through an annotation process for the representation
and the information contents enhancement in economic intelligence (EI) | null | Journal of Global Management Research (2008) 15 pages | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the era of the information society, the impact of the information systems
on the economy of material and immaterial is certainly perceptible. With
regards to the information resources of an organization, the annotation
involved to enrich informational content, to track the intellectual activities
on a document and... | [
{
"created": "Sun, 7 Dec 2008 20:07:37 GMT",
"version": "v1"
}
] | 2008-12-10 | [
[
"Sidhom",
"Sahbi",
"",
"LORIA, Sii"
]
] | In the era of the information society, the impact of the information systems on the economy of material and immaterial is certainly perceptible. With regards to the information resources of an organization, the annotation involved to enrich informational content, to track the intellectual activities on a document and t... |
1703.10772 | Irshad Bhat | Irshad Ahmad Bhat, Riyaz Ahmad Bhat, Manish Shrivastava and Dipti
Misra Sharma | Joining Hands: Exploiting Monolingual Treebanks for Parsing of
Code-mixing Data | 5 pages, EACL 2017 short paper | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose efficient and less resource-intensive strategies
for parsing of code-mixed data. These strategies are not constrained by
in-domain annotations, rather they leverage pre-existing monolingual annotated
resources for training. We show that these methods can produce significantly
better results ... | [
{
"created": "Fri, 31 Mar 2017 07:10:30 GMT",
"version": "v1"
}
] | 2017-04-03 | [
[
"Bhat",
"Irshad Ahmad",
""
],
[
"Bhat",
"Riyaz Ahmad",
""
],
[
"Shrivastava",
"Manish",
""
],
[
"Sharma",
"Dipti Misra",
""
]
] | In this paper, we propose efficient and less resource-intensive strategies for parsing of code-mixed data. These strategies are not constrained by in-domain annotations, rather they leverage pre-existing monolingual annotated resources for training. We show that these methods can produce significantly better results as... |
2404.15194 | Michal Nazarczuk | Michal Nazarczuk, Jan Kristof Behrens, Karla Stepanova, Matej
Hoffmann, Krystian Mikolajczyk | Closed Loop Interactive Embodied Reasoning for Robot Manipulation | null | null | null | null | cs.RO cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Embodied reasoning systems integrate robotic hardware and cognitive processes
to perform complex tasks typically in response to a natural language query
about a specific physical environment. This usually involves changing the
belief about the scene or physically interacting and changing the scene (e.g.
'Sort the obj... | [
{
"created": "Tue, 23 Apr 2024 16:33:28 GMT",
"version": "v1"
}
] | 2024-04-24 | [
[
"Nazarczuk",
"Michal",
""
],
[
"Behrens",
"Jan Kristof",
""
],
[
"Stepanova",
"Karla",
""
],
[
"Hoffmann",
"Matej",
""
],
[
"Mikolajczyk",
"Krystian",
""
]
] | Embodied reasoning systems integrate robotic hardware and cognitive processes to perform complex tasks typically in response to a natural language query about a specific physical environment. This usually involves changing the belief about the scene or physically interacting and changing the scene (e.g. 'Sort the objec... |
2303.06644 | Tian Wen | Yan Lei, Tiantian Wen, Huan Xie, Lingfeng Fu, Chunyan Liu, Lei Xu,
Hongxia Sun | Mitigating the Effect of Class Imbalance in Fault Localization Using
Context-aware Generative Adversarial Network | null | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Fault localization (FL) analyzes the execution information of a test suite to
pinpoint the root cause of a failure. The class imbalance of a test suite,
i.e., the imbalanced class proportion between passing test cases (i.e.,
majority class) and failing ones (i.e., minority class), adversely affects FL
effectiveness. ... | [
{
"created": "Sun, 12 Mar 2023 12:26:52 GMT",
"version": "v1"
}
] | 2023-03-14 | [
[
"Lei",
"Yan",
""
],
[
"Wen",
"Tiantian",
""
],
[
"Xie",
"Huan",
""
],
[
"Fu",
"Lingfeng",
""
],
[
"Liu",
"Chunyan",
""
],
[
"Xu",
"Lei",
""
],
[
"Sun",
"Hongxia",
""
]
] | Fault localization (FL) analyzes the execution information of a test suite to pinpoint the root cause of a failure. The class imbalance of a test suite, i.e., the imbalanced class proportion between passing test cases (i.e., majority class) and failing ones (i.e., minority class), adversely affects FL effectiveness. To... |
1105.1824 | Haris Aziz | Haris Aziz and Paul Harrenstein and Evangelia Pyrga | Individual-based stability in hedonic games depending on the best or
worst players | 16 pages | null | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider coalition formation games in which each player has preferences
over the other players and his preferences over coalitions are based on the
best player ($\mathcal{B}$-/B-hedonic games) or the worst player
($\mathcal{W}$/W-hedonic games) in the coalition. We show that for
$\mathcal{B}$-hedonic games, an ind... | [
{
"created": "Mon, 9 May 2011 23:51:47 GMT",
"version": "v1"
},
{
"created": "Sat, 3 Dec 2011 08:20:21 GMT",
"version": "v2"
}
] | 2011-12-06 | [
[
"Aziz",
"Haris",
""
],
[
"Harrenstein",
"Paul",
""
],
[
"Pyrga",
"Evangelia",
""
]
] | We consider coalition formation games in which each player has preferences over the other players and his preferences over coalitions are based on the best player ($\mathcal{B}$-/B-hedonic games) or the worst player ($\mathcal{W}$/W-hedonic games) in the coalition. We show that for $\mathcal{B}$-hedonic games, an indiv... |
cs/0408065 | Somdeb Lahiri | Somdeb Lahiri | The Core of Directed Network Problems with Quotas | 6 pages, 0 figures, source file: MS Word; definitions of the feasible
allocations have been strengthened; examples provided; network obtained by
the procedure can be decentralized | null | null | null | cs.GT | null | This paper proves the existence of non-empty cores for directed network
problems with quotas and for those combinatorial allocation problems which
permit only exclusive allocations.
| [
{
"created": "Sat, 28 Aug 2004 10:12:17 GMT",
"version": "v1"
},
{
"created": "Thu, 2 Sep 2004 11:18:12 GMT",
"version": "v2"
},
{
"created": "Mon, 6 Sep 2004 11:05:37 GMT",
"version": "v3"
},
{
"created": "Tue, 7 Sep 2004 09:37:08 GMT",
"version": "v4"
},
{
"crea... | 2007-05-23 | [
[
"Lahiri",
"Somdeb",
""
]
] | This paper proves the existence of non-empty cores for directed network problems with quotas and for those combinatorial allocation problems which permit only exclusive allocations. |
1409.5715 | Stefan Schulte | Stefan Schulte, Christian Janiesch, Srikumar Venugopal, Ingo Weber,
Philipp Hoenisch | Elastic Business Process Management: State of the Art and Open
Challenges for BPM in the Cloud | Please cite as: S. Schulte, C. Janiesch, S. Venugopal, I. Weber, and
P. Hoenisch (2015). Elastic Business Process Management: State of the Art and
Open Challenges for BPM in the Cloud. Future Generation Computer Systems,
Volume NN, Number N, NN-NN., http://dx.doi.org/10.1016/j.future.2014.09.005 | Future Generation Computer Systems, Volume 46, 36-50 (2015) | 10.1016/j.future.2014.09.005 | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the advent of cloud computing, organizations are nowadays able to react
rapidly to changing demands for computational resources. Not only individual
applications can be hosted on virtual cloud infrastructures, but also complete
business processes. This allows the realization of so-called elastic processes,
i.e.,... | [
{
"created": "Fri, 19 Sep 2014 16:36:49 GMT",
"version": "v1"
},
{
"created": "Mon, 22 Sep 2014 10:56:55 GMT",
"version": "v2"
}
] | 2017-08-21 | [
[
"Schulte",
"Stefan",
""
],
[
"Janiesch",
"Christian",
""
],
[
"Venugopal",
"Srikumar",
""
],
[
"Weber",
"Ingo",
""
],
[
"Hoenisch",
"Philipp",
""
]
] | With the advent of cloud computing, organizations are nowadays able to react rapidly to changing demands for computational resources. Not only individual applications can be hosted on virtual cloud infrastructures, but also complete business processes. This allows the realization of so-called elastic processes, i.e., p... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.