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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2310.02294 | Tomislav Duricic | Tomislav Duricic, Dominik Kowald, Emanuel Lacic and Elisabeth Lex | Beyond-Accuracy: A Review on Diversity, Serendipity and Fairness in
Recommender Systems Based on Graph Neural Networks | 14 pages, 1 figure, 1 table | null | null | null | cs.IR | http://creativecommons.org/licenses/by/4.0/ | By providing personalized suggestions to users, recommender systems have
become essential to numerous online platforms. Collaborative filtering,
particularly graph-based approaches using Graph Neural Networks (GNNs), have
demonstrated great results in terms of recommendation accuracy. However,
accuracy may not always... | [
{
"created": "Tue, 3 Oct 2023 09:25:01 GMT",
"version": "v1"
}
] | 2023-10-05 | [
[
"Duricic",
"Tomislav",
""
],
[
"Kowald",
"Dominik",
""
],
[
"Lacic",
"Emanuel",
""
],
[
"Lex",
"Elisabeth",
""
]
] | By providing personalized suggestions to users, recommender systems have become essential to numerous online platforms. Collaborative filtering, particularly graph-based approaches using Graph Neural Networks (GNNs), have demonstrated great results in terms of recommendation accuracy. However, accuracy may not always b... |
1407.3128 | Agnieszka Kulacka PhD | Agnieszka Kulacka | A tableau for set-satisfiability for extended fuzzy logic BL | null | null | null | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a tableau calculus for finding a model for a
set-satisfiable finite set of formulas of an extended fuzzy logic BL, a fuzzy
logic BL with additional Baaz connective and the involutive negation, if such a
model exists. The calculus is a generalisation of a tableau calculus for BL,
which is based on ... | [
{
"created": "Fri, 11 Jul 2014 12:12:40 GMT",
"version": "v1"
}
] | 2014-07-14 | [
[
"Kulacka",
"Agnieszka",
""
]
] | This paper presents a tableau calculus for finding a model for a set-satisfiable finite set of formulas of an extended fuzzy logic BL, a fuzzy logic BL with additional Baaz connective and the involutive negation, if such a model exists. The calculus is a generalisation of a tableau calculus for BL, which is based on th... |
2007.05080 | Furkan K{\i}nl{\i} | Furkan K{\i}nl{\i}, Bar{\i}\c{s} \"Ozcan, Furkan K{\i}ra\c{c} | A Benchmark for Inpainting of Clothing Images with Irregular Holes | Accepted to AIM2020: Advanced Image Manipulation workshop and
challenges at ECCV2020 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Fashion image understanding is an active research field with a large number
of practical applications for the industry. Despite its practical impacts on
intelligent fashion analysis systems, clothing image inpainting has not been
extensively examined yet. For that matter, we present an extensive benchmark of
clothing... | [
{
"created": "Thu, 9 Jul 2020 21:44:08 GMT",
"version": "v1"
},
{
"created": "Thu, 20 Aug 2020 12:21:54 GMT",
"version": "v2"
},
{
"created": "Thu, 27 Aug 2020 17:43:38 GMT",
"version": "v3"
}
] | 2020-08-28 | [
[
"Kınlı",
"Furkan",
""
],
[
"Özcan",
"Barış",
""
],
[
"Kıraç",
"Furkan",
""
]
] | Fashion image understanding is an active research field with a large number of practical applications for the industry. Despite its practical impacts on intelligent fashion analysis systems, clothing image inpainting has not been extensively examined yet. For that matter, we present an extensive benchmark of clothing i... |
1905.01046 | Yajun Zhao | Hanqing Xu, Yajun Zhao, Linmei Mo, Chen Huang, and Baoyu Sun | Inter-Cell Antenna Calibration for Coherent Joint Transmission in TDD
System | 5 pages, 8 figures, GLOBECOM | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work the modeling and calibration method of reciprocity error in a
coherent TDD coordinated multi-point (CoMP) joint transmission (JT) system are
addressed. The modeling includes parameters such as amplitude gains and phase
differences of RF chains between the eNBs. The calibration method used for
inter-cell ... | [
{
"created": "Fri, 3 May 2019 06:50:53 GMT",
"version": "v1"
}
] | 2021-08-23 | [
[
"Xu",
"Hanqing",
""
],
[
"Zhao",
"Yajun",
""
],
[
"Mo",
"Linmei",
""
],
[
"Huang",
"Chen",
""
],
[
"Sun",
"Baoyu",
""
]
] | In this work the modeling and calibration method of reciprocity error in a coherent TDD coordinated multi-point (CoMP) joint transmission (JT) system are addressed. The modeling includes parameters such as amplitude gains and phase differences of RF chains between the eNBs. The calibration method used for inter-cell an... |
1705.04979 | Bing Li | Bing Li, Ning Chen, Ulf Schlichtmann | Fast Statistical Timing Analysis for Circuits with Post-Silicon Tunable
Clock Buffers | IEEE/ACM International Conference on Computer-Aided Design (ICCAD),
2011 | null | 10.1109/ICCAD.2011.6105314 | null | cs.AR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Post-Silicon Tunable (PST) clock buffers are widely used in high performance
designs to counter process variations. By allowing delay compensation between
consecutive register stages, PST buffers can effectively improve the yield of
digital circuits. To date, the evaluation of manufacturing yield in the
presence of P... | [
{
"created": "Sun, 14 May 2017 15:39:59 GMT",
"version": "v1"
}
] | 2017-05-16 | [
[
"Li",
"Bing",
""
],
[
"Chen",
"Ning",
""
],
[
"Schlichtmann",
"Ulf",
""
]
] | Post-Silicon Tunable (PST) clock buffers are widely used in high performance designs to counter process variations. By allowing delay compensation between consecutive register stages, PST buffers can effectively improve the yield of digital circuits. To date, the evaluation of manufacturing yield in the presence of PST... |
1810.02400 | Ang Li | Wei Du, Ang Li, Qinghua Li | Privacy-Preserving Multiparty Learning For Logistic Regression | This work was done when Wei Du was at the University of Arkansas | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In recent years, machine learning techniques are widely used in numerous
applications, such as weather forecast, financial data analysis, spam
filtering, and medical prediction. In the meantime, massive data generated from
multiple sources further improve the performance of machine learning tools.
However, data shari... | [
{
"created": "Thu, 4 Oct 2018 19:34:33 GMT",
"version": "v1"
}
] | 2018-10-08 | [
[
"Du",
"Wei",
""
],
[
"Li",
"Ang",
""
],
[
"Li",
"Qinghua",
""
]
] | In recent years, machine learning techniques are widely used in numerous applications, such as weather forecast, financial data analysis, spam filtering, and medical prediction. In the meantime, massive data generated from multiple sources further improve the performance of machine learning tools. However, data sharing... |
2109.04621 | Ren-Song Tsay | Hsin-Yu Ho, Ren-Song Tsay | An Effective Early Multi-core System Shared Cache Design Method Based on
Reuse-distance Analysis | null | null | null | null | cs.PF | http://creativecommons.org/licenses/by-nc-nd/4.0/ | In this paper, we proposed an effective and efficient multi-core shared-cache
design optimization approach based on reuse-distance analysis of the data
traces of target applications. Since data traces are independent of system
hardware architectures, a designer can easily compute the best cache design at
the early sy... | [
{
"created": "Fri, 10 Sep 2021 02:10:45 GMT",
"version": "v1"
}
] | 2021-09-13 | [
[
"Ho",
"Hsin-Yu",
""
],
[
"Tsay",
"Ren-Song",
""
]
] | In this paper, we proposed an effective and efficient multi-core shared-cache design optimization approach based on reuse-distance analysis of the data traces of target applications. Since data traces are independent of system hardware architectures, a designer can easily compute the best cache design at the early syst... |
2002.00360 | Esam Alkaldy Dr. | Esam Alkaldy, Ali H. Majeed, Mohd Shamian Zainal, Danial Md. Nor | Optimum multiplexer design in quantum-dot cellular automata | 8 pages | null | null | null | cs.ET quant-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Quantum-dot Cellular Automata (QCA) is one of the most important computing
technologies for the future and will be the alternative candidate for current
CMOS technology. QCA is attracting a lot of researchers due to many features
such as high speed, small size, and low power consumption. QCA has two main
building blo... | [
{
"created": "Sun, 2 Feb 2020 10:52:51 GMT",
"version": "v1"
}
] | 2020-02-04 | [
[
"Alkaldy",
"Esam",
""
],
[
"Majeed",
"Ali H.",
""
],
[
"Zainal",
"Mohd Shamian",
""
],
[
"Nor",
"Danial Md.",
""
]
] | Quantum-dot Cellular Automata (QCA) is one of the most important computing technologies for the future and will be the alternative candidate for current CMOS technology. QCA is attracting a lot of researchers due to many features such as high speed, small size, and low power consumption. QCA has two main building block... |
2008.11423 | Tsai-Shien Chen | Tsai-Shien Chen, Chih-Ting Liu, Chih-Wei Wu, Shao-Yi Chien | Orientation-aware Vehicle Re-identification with Semantics-guided Part
Attention Network | ECCV 2020 (Oral). Paper Website:
http://media.ee.ntu.edu.tw/research/SPAN/ | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Vehicle re-identification (re-ID) focuses on matching images of the same
vehicle across different cameras. It is fundamentally challenging because
differences between vehicles are sometimes subtle. While several studies
incorporate spatial-attention mechanisms to help vehicle re-ID, they often
require expensive keypo... | [
{
"created": "Wed, 26 Aug 2020 07:33:09 GMT",
"version": "v1"
},
{
"created": "Mon, 12 Oct 2020 11:51:16 GMT",
"version": "v2"
}
] | 2020-10-13 | [
[
"Chen",
"Tsai-Shien",
""
],
[
"Liu",
"Chih-Ting",
""
],
[
"Wu",
"Chih-Wei",
""
],
[
"Chien",
"Shao-Yi",
""
]
] | Vehicle re-identification (re-ID) focuses on matching images of the same vehicle across different cameras. It is fundamentally challenging because differences between vehicles are sometimes subtle. While several studies incorporate spatial-attention mechanisms to help vehicle re-ID, they often require expensive keypoin... |
2204.06185 | Yinglong Ma | Gao Pengfei and Ma Yinglong | A Universality-Individuality Integration Model for Dialog Act
Classification | 12 pages, 1 figure, 2 tables | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Dialog Act (DA) reveals the general intent of the speaker utterance in a
conversation. Accurately predicting DAs can greatly facilitate the development
of dialog agents. Although researchers have done extensive research on dialog
act classification, the feature information of classification has not been
fully conside... | [
{
"created": "Wed, 13 Apr 2022 06:05:34 GMT",
"version": "v1"
}
] | 2022-04-14 | [
[
"Pengfei",
"Gao",
""
],
[
"Yinglong",
"Ma",
""
]
] | Dialog Act (DA) reveals the general intent of the speaker utterance in a conversation. Accurately predicting DAs can greatly facilitate the development of dialog agents. Although researchers have done extensive research on dialog act classification, the feature information of classification has not been fully considere... |
2207.03520 | Yunsheng Li | Yunsheng Li, Yinpeng Chen, Xiyang Dai, Dongdong Chen, Mengchen Liu,
Pei Yu, Jing Yin, Lu Yuan, Zicheng Liu, Nuno Vasconcelos | Should All Proposals be Treated Equally in Object Detection? | Accepted by ECCV 2022 | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | The complexity-precision trade-off of an object detector is a critical
problem for resource constrained vision tasks. Previous works have emphasized
detectors implemented with efficient backbones. The impact on this trade-off of
proposal processing by the detection head is investigated in this work. It is
hypothesize... | [
{
"created": "Thu, 7 Jul 2022 18:26:32 GMT",
"version": "v1"
}
] | 2022-07-11 | [
[
"Li",
"Yunsheng",
""
],
[
"Chen",
"Yinpeng",
""
],
[
"Dai",
"Xiyang",
""
],
[
"Chen",
"Dongdong",
""
],
[
"Liu",
"Mengchen",
""
],
[
"Yu",
"Pei",
""
],
[
"Yin",
"Jing",
""
],
[
"Yuan",
"Lu",
... | The complexity-precision trade-off of an object detector is a critical problem for resource constrained vision tasks. Previous works have emphasized detectors implemented with efficient backbones. The impact on this trade-off of proposal processing by the detection head is investigated in this work. It is hypothesized ... |
1912.02951 | Suhabe Bugrara | Suhabe Bugrara | User Experience with Language-Independent Formal Verification | null | null | null | null | cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The goal of this paper is to help mainstream programmers routinely use formal
verification on their smart contracts by 1) proposing a new YAML-format for
writing general-purpose formal specifications, 2) demonstrating how a formal
specification can be incrementally built up without needing advanced training,
and 3) s... | [
{
"created": "Fri, 6 Dec 2019 02:08:07 GMT",
"version": "v1"
}
] | 2019-12-09 | [
[
"Bugrara",
"Suhabe",
""
]
] | The goal of this paper is to help mainstream programmers routinely use formal verification on their smart contracts by 1) proposing a new YAML-format for writing general-purpose formal specifications, 2) demonstrating how a formal specification can be incrementally built up without needing advanced training, and 3) sho... |
2107.10869 | Nathaniel Strawn | Nate Strawn | Filament Plots for Data Visualization | 43 pages, 13 figures; newest version updates plots, clarifies some
terminology, and clarifies proofs | null | null | null | cs.HC cs.LG stat.ML | http://creativecommons.org/licenses/by/4.0/ | The efficiency of modern computer graphics allows us to explore collections
of space curves simultaneously with "drag-to-rotate" interfaces. This inspires
us to replace "scatterplots of points" with "scatterplots of curves" to
simultaneously visualize relationships across an entire dataset. Since spaces
of curves are... | [
{
"created": "Tue, 20 Jul 2021 18:20:33 GMT",
"version": "v1"
},
{
"created": "Tue, 5 Oct 2021 16:57:08 GMT",
"version": "v2"
},
{
"created": "Thu, 10 Mar 2022 02:53:33 GMT",
"version": "v3"
}
] | 2022-03-11 | [
[
"Strawn",
"Nate",
""
]
] | The efficiency of modern computer graphics allows us to explore collections of space curves simultaneously with "drag-to-rotate" interfaces. This inspires us to replace "scatterplots of points" with "scatterplots of curves" to simultaneously visualize relationships across an entire dataset. Since spaces of curves are i... |
2207.13320 | Gayoung Lee | Gayoung Lee, Hyunsu Kim, Junho Kim, Seonghyeon Kim, Jung-Woo Ha,
Yunjey Choi | Generator Knows What Discriminator Should Learn in Unconditional GANs | Accepted to ECCV 2022. Our code is available at
https://github.com/naver-ai/GGDR | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent methods for conditional image generation benefit from dense
supervision such as segmentation label maps to achieve high-fidelity. However,
it is rarely explored to employ dense supervision for unconditional image
generation. Here we explore the efficacy of dense supervision in unconditional
generation and find... | [
{
"created": "Wed, 27 Jul 2022 06:49:26 GMT",
"version": "v1"
}
] | 2022-07-28 | [
[
"Lee",
"Gayoung",
""
],
[
"Kim",
"Hyunsu",
""
],
[
"Kim",
"Junho",
""
],
[
"Kim",
"Seonghyeon",
""
],
[
"Ha",
"Jung-Woo",
""
],
[
"Choi",
"Yunjey",
""
]
] | Recent methods for conditional image generation benefit from dense supervision such as segmentation label maps to achieve high-fidelity. However, it is rarely explored to employ dense supervision for unconditional image generation. Here we explore the efficacy of dense supervision in unconditional generation and find g... |
1812.01061 | Mohammad Raji | Mohammad Raji, Behzad Montazeri | On the Relationship Between Modularity and Stability in Software
Packages | 4 pages, 2 figures | null | null | null | cs.SE | http://creativecommons.org/licenses/by/4.0/ | Modular and well-written software is an ideal that programmers strive to
achieve. However, real-world project constraints limit the amount of reusable
and modular code that programmers can produce. Many techniques exist that
refactor code automatically using graph-based measurements and increase the
quality and modul... | [
{
"created": "Mon, 3 Dec 2018 20:09:23 GMT",
"version": "v1"
}
] | 2018-12-05 | [
[
"Raji",
"Mohammad",
""
],
[
"Montazeri",
"Behzad",
""
]
] | Modular and well-written software is an ideal that programmers strive to achieve. However, real-world project constraints limit the amount of reusable and modular code that programmers can produce. Many techniques exist that refactor code automatically using graph-based measurements and increase the quality and modular... |
1603.00302 | Zhiguo Ding | Z. Ding and L. Dai and H. V. Poor | MIMO-NOMA Design for Small Packet Transmission in the Internet of Things | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A feature of the Internet of Things (IoT) is that some users in the system
need to be served quickly for small packet transmission. To address this
requirement, a new multiple-input multiple-output non-orthogonal multiple
access (MIMO-NOMA) scheme is designed in this paper, where one user is served
with its quality o... | [
{
"created": "Tue, 1 Mar 2016 15:00:49 GMT",
"version": "v1"
}
] | 2016-03-02 | [
[
"Ding",
"Z.",
""
],
[
"Dai",
"L.",
""
],
[
"Poor",
"H. V.",
""
]
] | A feature of the Internet of Things (IoT) is that some users in the system need to be served quickly for small packet transmission. To address this requirement, a new multiple-input multiple-output non-orthogonal multiple access (MIMO-NOMA) scheme is designed in this paper, where one user is served with its quality of ... |
2008.05531 | Ishrat Jahan Eliza | Ajwad Akil, Ishrat Jahan Eliza, Md. Hasibul Hussain Hisham, Fahim
Morshed, Nazmus Sakib, Nuwaisir Rabi, Abir Mohammad Turza, Sriram Chellappan,
A. B. M. Alim Al Islam | The Past, Present, and Future of COVID-19: A Data-Driven Perspective | 36 pages, 19 figures, CSCW 2021/UbiComp 2021 | null | null | null | cs.CY | http://creativecommons.org/licenses/by/4.0/ | Epidemics and pandemics have ravaged human life since time. To combat these,
novel ideas have always been created and deployed by humanity, with varying
degrees of success. At this very moment, the COVID-19 pandemic is the singular
global health crisis. Now, perhaps for the first time in human history, almost
the who... | [
{
"created": "Wed, 12 Aug 2020 19:03:57 GMT",
"version": "v1"
}
] | 2020-08-14 | [
[
"Akil",
"Ajwad",
""
],
[
"Eliza",
"Ishrat Jahan",
""
],
[
"Hisham",
"Md. Hasibul Hussain",
""
],
[
"Morshed",
"Fahim",
""
],
[
"Sakib",
"Nazmus",
""
],
[
"Rabi",
"Nuwaisir",
""
],
[
"Turza",
"Abir Mohammad",
... | Epidemics and pandemics have ravaged human life since time. To combat these, novel ideas have always been created and deployed by humanity, with varying degrees of success. At this very moment, the COVID-19 pandemic is the singular global health crisis. Now, perhaps for the first time in human history, almost the whole... |
1310.3358 | Gerasimos G. Rigatos | Gerasimos G. Rigatos | A Kalman Filtering approach of improved precision for fault diagnosis in
distributed parameter systems | 11 pages, 8 figures | null | null | null | cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Derivative-free nonlinear Kalman Filter is proposed for state estimation
and fault diagnosis in distributed parameter systems and particularly in
dynamical systems described by partial differential equations of the nonlinear
wave type. At a first stage, a nonlinear filtering approach for estimating the
dynamics o... | [
{
"created": "Sat, 12 Oct 2013 10:28:53 GMT",
"version": "v1"
},
{
"created": "Sun, 3 Nov 2013 23:03:08 GMT",
"version": "v2"
}
] | 2013-11-05 | [
[
"Rigatos",
"Gerasimos G.",
""
]
] | The Derivative-free nonlinear Kalman Filter is proposed for state estimation and fault diagnosis in distributed parameter systems and particularly in dynamical systems described by partial differential equations of the nonlinear wave type. At a first stage, a nonlinear filtering approach for estimating the dynamics of ... |
2308.08621 | Elahe Moradi | Neda Darbeheshti and Elahe Moradi | LSTM-Based Forecasting Model for GRACE Accelerometer Data | null | null | null | null | cs.LG cs.AI physics.space-ph | http://creativecommons.org/licenses/by/4.0/ | The Gravity Recovery and Climate Experiment (GRACE) satellite mission,
spanning from 2002 to 2017, has provided a valuable dataset for monitoring
variations in Earth's gravity field, enabling diverse applications in
geophysics and hydrology. The mission was followed by GRACE Follow-On in 2018,
continuing data collect... | [
{
"created": "Wed, 16 Aug 2023 18:39:29 GMT",
"version": "v1"
}
] | 2023-08-21 | [
[
"Darbeheshti",
"Neda",
""
],
[
"Moradi",
"Elahe",
""
]
] | The Gravity Recovery and Climate Experiment (GRACE) satellite mission, spanning from 2002 to 2017, has provided a valuable dataset for monitoring variations in Earth's gravity field, enabling diverse applications in geophysics and hydrology. The mission was followed by GRACE Follow-On in 2018, continuing data collectio... |
1007.3926 | Dakshina Ranjan Kisku | Dakshina Ranjan Kisku, Phalguni Gupta, Jamuna Kanta Sing | Ear Identification by Fusion of Segmented Slice Regions using Invariant
Features: An Experimental Manifold with Dual Fusion Approach | 12 pages, 3 figures | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/3.0/ | This paper proposes a robust ear identification system which is developed by
fusing SIFT features of color segmented slice regions of an ear. The proposed
ear identification method makes use of Gaussian mixture model (GMM) to build
ear model with mixture of Gaussian using vector quantization algorithm and K-L
diverge... | [
{
"created": "Wed, 21 Jul 2010 14:09:33 GMT",
"version": "v1"
}
] | 2010-07-23 | [
[
"Kisku",
"Dakshina Ranjan",
""
],
[
"Gupta",
"Phalguni",
""
],
[
"Sing",
"Jamuna Kanta",
""
]
] | This paper proposes a robust ear identification system which is developed by fusing SIFT features of color segmented slice regions of an ear. The proposed ear identification method makes use of Gaussian mixture model (GMM) to build ear model with mixture of Gaussian using vector quantization algorithm and K-L divergenc... |
2009.12682 | He Sun | He Sun, Zhun Deng, Hui Chen, David C. Parkes | Decision-Aware Conditional GANs for Time Series Data | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce the decision-aware time-series conditional generative
adversarial network (DAT-CGAN) as a method for time-series generation. The
framework adopts a multi-Wasserstein loss on structured decision-related
quantities, capturing the heterogeneity of decision-related data and providing
new effectiveness in sup... | [
{
"created": "Sat, 26 Sep 2020 20:37:38 GMT",
"version": "v1"
},
{
"created": "Wed, 30 Sep 2020 00:16:35 GMT",
"version": "v2"
},
{
"created": "Tue, 27 Oct 2020 20:18:47 GMT",
"version": "v3"
},
{
"created": "Sat, 4 Feb 2023 00:52:13 GMT",
"version": "v4"
}
] | 2023-02-07 | [
[
"Sun",
"He",
""
],
[
"Deng",
"Zhun",
""
],
[
"Chen",
"Hui",
""
],
[
"Parkes",
"David C.",
""
]
] | We introduce the decision-aware time-series conditional generative adversarial network (DAT-CGAN) as a method for time-series generation. The framework adopts a multi-Wasserstein loss on structured decision-related quantities, capturing the heterogeneity of decision-related data and providing new effectiveness in suppo... |
2212.00368 | Konstantin Nikolaev | O. A. Nevzorova, K. S. Nikolaev | Ontomathedu Ontology Enrichment Method | null | null | null | null | cs.AI | http://creativecommons.org/licenses/by/4.0/ | Nowadays, distance learning technologies have become very popular. The recent
pandemic has had a particularly strong impact on the development of distance
education technologies. Kazan Federal University has a distance learning system
based on LMS Moodle. This article describes the structure of the OntoMathEdu
ecosys... | [
{
"created": "Thu, 1 Dec 2022 08:57:18 GMT",
"version": "v1"
}
] | 2022-12-02 | [
[
"Nevzorova",
"O. A.",
""
],
[
"Nikolaev",
"K. S.",
""
]
] | Nowadays, distance learning technologies have become very popular. The recent pandemic has had a particularly strong impact on the development of distance education technologies. Kazan Federal University has a distance learning system based on LMS Moodle. This article describes the structure of the OntoMathEdu ecosyste... |
2404.08970 | Zihao Wang | Wei Zhang, Zihao Wang, Jie Fan, Hao Wu, Yong Zhang | Fast Gradient Computation for Gromov-Wasserstein Distance | Work in progress | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Gromov-Wasserstein distance is a notable extension of optimal transport.
In contrast to the classic Wasserstein distance, it solves a quadratic
assignment problem that minimizes the pair-wise distance distortion under the
transportation of distributions and thus could apply to distributions in
different spaces. T... | [
{
"created": "Sat, 13 Apr 2024 11:23:34 GMT",
"version": "v1"
}
] | 2024-04-16 | [
[
"Zhang",
"Wei",
""
],
[
"Wang",
"Zihao",
""
],
[
"Fan",
"Jie",
""
],
[
"Wu",
"Hao",
""
],
[
"Zhang",
"Yong",
""
]
] | The Gromov-Wasserstein distance is a notable extension of optimal transport. In contrast to the classic Wasserstein distance, it solves a quadratic assignment problem that minimizes the pair-wise distance distortion under the transportation of distributions and thus could apply to distributions in different spaces. The... |
1911.10364 | Kenneth Co | Kenneth T. Co, Luis Mu\~noz-Gonz\'alez, Leslie Kanthan, Ben Glocker,
Emil C. Lupu | Universal Adversarial Robustness of Texture and Shape-Biased Models | In Proceedings of the 28th IEEE International Conference on Image
Processing (ICIP 2021), code available at:
https://github.com/kenny-co/sgd-uap-torch | null | 10.1109/ICIP42928.2021.9506325 | null | cs.CV | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Increasing shape-bias in deep neural networks has been shown to improve
robustness to common corruptions and noise. In this paper we analyze the
adversarial robustness of texture and shape-biased models to Universal
Adversarial Perturbations (UAPs). We use UAPs to evaluate the robustness of DNN
models with varying de... | [
{
"created": "Sat, 23 Nov 2019 13:23:45 GMT",
"version": "v1"
},
{
"created": "Sun, 8 Mar 2020 20:54:44 GMT",
"version": "v2"
},
{
"created": "Wed, 13 Jan 2021 06:55:29 GMT",
"version": "v3"
},
{
"created": "Tue, 31 Aug 2021 02:50:56 GMT",
"version": "v4"
}
] | 2021-09-01 | [
[
"Co",
"Kenneth T.",
""
],
[
"Muñoz-González",
"Luis",
""
],
[
"Kanthan",
"Leslie",
""
],
[
"Glocker",
"Ben",
""
],
[
"Lupu",
"Emil C.",
""
]
] | Increasing shape-bias in deep neural networks has been shown to improve robustness to common corruptions and noise. In this paper we analyze the adversarial robustness of texture and shape-biased models to Universal Adversarial Perturbations (UAPs). We use UAPs to evaluate the robustness of DNN models with varying degr... |
0903.4696 | Lucas Sabalka | Joshua Brown Kramer, Lucas Sabalka | Multidimensional Online Robot Motion | 26 pages, 5 figures | International Journal of Computational Geometry and Applications,
20(6):653-684, 2010 | 10.1142/S0218195910003475 | null | cs.CG cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider three related problems of robot movement in arbitrary dimensions:
coverage, search, and navigation. For each problem, a spherical robot is asked
to accomplish a motion-related task in an unknown environment whose geometry is
learned by the robot during navigation. The robot is assumed to have tactile
and ... | [
{
"created": "Thu, 26 Mar 2009 20:39:55 GMT",
"version": "v1"
}
] | 2011-10-13 | [
[
"Kramer",
"Joshua Brown",
""
],
[
"Sabalka",
"Lucas",
""
]
] | We consider three related problems of robot movement in arbitrary dimensions: coverage, search, and navigation. For each problem, a spherical robot is asked to accomplish a motion-related task in an unknown environment whose geometry is learned by the robot during navigation. The robot is assumed to have tactile and gl... |
2209.07676 | Shenao Zhang | Shenao Zhang | Conservative Dual Policy Optimization for Efficient Model-Based
Reinforcement Learning | Published at NeurIPS 2022 | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Provably efficient Model-Based Reinforcement Learning (MBRL) based on
optimism or posterior sampling (PSRL) is ensured to attain the global
optimality asymptotically by introducing the complexity measure of the model.
However, the complexity might grow exponentially for the simplest nonlinear
models, where global con... | [
{
"created": "Fri, 16 Sep 2022 02:27:01 GMT",
"version": "v1"
}
] | 2022-09-19 | [
[
"Zhang",
"Shenao",
""
]
] | Provably efficient Model-Based Reinforcement Learning (MBRL) based on optimism or posterior sampling (PSRL) is ensured to attain the global optimality asymptotically by introducing the complexity measure of the model. However, the complexity might grow exponentially for the simplest nonlinear models, where global conve... |
1802.08847 | Gennaro Notomista | Gennaro Notomista and Magnus Egerstedt | Coverage Control for Wire-Traversing Robots | null | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we consider the coverage control problem for a team of
wire-traversing robots. The two-dimensional motion of robots moving in a planar
environment has to be projected to one-dimensional manifolds representing the
wires. Starting from Lloyd's descent algorithm for coverage control, a solution
that genera... | [
{
"created": "Sat, 24 Feb 2018 13:38:06 GMT",
"version": "v1"
}
] | 2018-02-27 | [
[
"Notomista",
"Gennaro",
""
],
[
"Egerstedt",
"Magnus",
""
]
] | In this paper we consider the coverage control problem for a team of wire-traversing robots. The two-dimensional motion of robots moving in a planar environment has to be projected to one-dimensional manifolds representing the wires. Starting from Lloyd's descent algorithm for coverage control, a solution that generate... |
2401.12380 | Michael Hagenow | Michael Hagenow, Emmanuel Senft, Robert Radwin, Michael Gleicher,
Michael Zinn, Bilge Mutlu | A System for Human-Robot Teaming through End-User Programming and Shared
Autonomy | Proceedings of the 2024 ACM/IEEE International Conference on
Human-Robot Interaction (HRI '24), March 11 - 14, 2024, Boulder, CO, USA | null | 10.1145/3610977.3634965 | null | cs.RO | http://creativecommons.org/licenses/by/4.0/ | Many industrial tasks-such as sanding, installing fasteners, and wire
harnessing-are difficult to automate due to task complexity and variability. We
instead investigate deploying robots in an assistive role for these tasks,
where the robot assumes the physical task burden and the skilled worker
provides both the hig... | [
{
"created": "Mon, 22 Jan 2024 22:07:45 GMT",
"version": "v1"
}
] | 2024-01-24 | [
[
"Hagenow",
"Michael",
""
],
[
"Senft",
"Emmanuel",
""
],
[
"Radwin",
"Robert",
""
],
[
"Gleicher",
"Michael",
""
],
[
"Zinn",
"Michael",
""
],
[
"Mutlu",
"Bilge",
""
]
] | Many industrial tasks-such as sanding, installing fasteners, and wire harnessing-are difficult to automate due to task complexity and variability. We instead investigate deploying robots in an assistive role for these tasks, where the robot assumes the physical task burden and the skilled worker provides both the high-... |
1904.05124 | Phong Nguyen-Ha | Phong Nguyen-Ha, Lam Huynh, Esa Rahtu, Janne Heikkila | Predicting Novel Views Using Generative Adversarial Query Network | 12 pages, 4 figures, accepted for presentation at the Scandinavian
Conference on Image Analysis 2019 | null | null | null | cs.CV cs.AI cs.GR | http://creativecommons.org/licenses/by/4.0/ | The problem of predicting a novel view of the scene using an arbitrary number
of observations is a challenging problem for computers as well as for humans.
This paper introduces the Generative Adversarial Query Network (GAQN), a
general learning framework for novel view synthesis that combines Generative
Query Networ... | [
{
"created": "Wed, 10 Apr 2019 11:49:25 GMT",
"version": "v1"
}
] | 2020-04-08 | [
[
"Nguyen-Ha",
"Phong",
""
],
[
"Huynh",
"Lam",
""
],
[
"Rahtu",
"Esa",
""
],
[
"Heikkila",
"Janne",
""
]
] | The problem of predicting a novel view of the scene using an arbitrary number of observations is a challenging problem for computers as well as for humans. This paper introduces the Generative Adversarial Query Network (GAQN), a general learning framework for novel view synthesis that combines Generative Query Network ... |
1301.3584 | Razvan Pascanu | Razvan Pascanu and Yoshua Bengio | Revisiting Natural Gradient for Deep Networks | null | null | null | null | cs.LG cs.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We evaluate natural gradient, an algorithm originally proposed in Amari
(1997), for learning deep models. The contributions of this paper are as
follows. We show the connection between natural gradient and three other
recently proposed methods for training deep models: Hessian-Free (Martens,
2010), Krylov Subspace De... | [
{
"created": "Wed, 16 Jan 2013 04:47:02 GMT",
"version": "v1"
},
{
"created": "Tue, 22 Jan 2013 03:57:04 GMT",
"version": "v2"
},
{
"created": "Wed, 23 Jan 2013 14:59:04 GMT",
"version": "v3"
},
{
"created": "Wed, 13 Mar 2013 19:13:08 GMT",
"version": "v4"
},
{
"c... | 2014-02-18 | [
[
"Pascanu",
"Razvan",
""
],
[
"Bengio",
"Yoshua",
""
]
] | We evaluate natural gradient, an algorithm originally proposed in Amari (1997), for learning deep models. The contributions of this paper are as follows. We show the connection between natural gradient and three other recently proposed methods for training deep models: Hessian-Free (Martens, 2010), Krylov Subspace Desc... |
1712.02822 | Alex Levinshtein | Alex Levinshtein (1), Edmund Phung (1), Parham Aarabi (1 and 2) ((1)
ModiFace Inc, (2) University of Toronto) | Hybrid eye center localization using cascaded regression and
hand-crafted model fitting | 12 pages, 5 figures, submitted to Journal of Image and Vision
Computing | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a new cascaded regressor for eye center detection. Previous
methods start from a face or an eye detector and use either advanced features
or powerful regressors for eye center localization, but not both. Instead, we
detect the eyes more accurately using an existing facial feature alignment
method. We impro... | [
{
"created": "Thu, 7 Dec 2017 19:21:19 GMT",
"version": "v1"
}
] | 2017-12-11 | [
[
"Levinshtein",
"Alex",
"",
"1 and 2"
],
[
"Phung",
"Edmund",
"",
"1 and 2"
],
[
"Aarabi",
"Parham",
"",
"1 and 2"
]
] | We propose a new cascaded regressor for eye center detection. Previous methods start from a face or an eye detector and use either advanced features or powerful regressors for eye center localization, but not both. Instead, we detect the eyes more accurately using an existing facial feature alignment method. We improve... |
cs/0505002 | Christoph Koch | Martin Grohe, Christoph Koch, Nicole Schweikardt | Tight Lower Bounds for Query Processing on Streaming and External Memory
Data | 25 pages, 4 figures, to appear in Proc. ICALP 2005; extended version
with appendix | null | null | null | cs.DB cs.CC | null | We study a clean machine model for external memory and stream processing. We
show that the number of scans of the external data induces a strict hierarchy
(as long as work space is sufficiently small, e.g., polylogarithmic in the size
of the input). We also show that neither joins nor sorting are feasible if the
prod... | [
{
"created": "Fri, 29 Apr 2005 22:28:31 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Grohe",
"Martin",
""
],
[
"Koch",
"Christoph",
""
],
[
"Schweikardt",
"Nicole",
""
]
] | We study a clean machine model for external memory and stream processing. We show that the number of scans of the external data induces a strict hierarchy (as long as work space is sufficiently small, e.g., polylogarithmic in the size of the input). We also show that neither joins nor sorting are feasible if the produc... |
1809.08479 | Eli (Omid) David | Ilay Cordonsky, Ishai Rosenberg, Guillaume Sicard, Eli David | DeepOrigin: End-to-End Deep Learning for Detection of New Malware
Families | null | International Joint Conference on Neural Networks (IJCNN), pages
1-7, Rio de Janeiro, Brazil, July 2018 | 10.1109/IJCNN.2018.8489667 | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we present a novel method of differentiating known from
previously unseen malware families. We utilize transfer learning by learning
compact file representations that are used for a new classification task
between previously seen malware families and novel ones. The learned file
representations are com... | [
{
"created": "Sat, 22 Sep 2018 19:41:45 GMT",
"version": "v1"
},
{
"created": "Sun, 24 Nov 2019 02:25:29 GMT",
"version": "v2"
}
] | 2019-11-26 | [
[
"Cordonsky",
"Ilay",
""
],
[
"Rosenberg",
"Ishai",
""
],
[
"Sicard",
"Guillaume",
""
],
[
"David",
"Eli",
""
]
] | In this paper, we present a novel method of differentiating known from previously unseen malware families. We utilize transfer learning by learning compact file representations that are used for a new classification task between previously seen malware families and novel ones. The learned file representations are compo... |
2201.09689 | Bo Li | Bo Li, Qiulin Wang, Jiquan Pei, Yu Yang, Xiangyang Ji | Which Style Makes Me Attractive? Interpretable Control Discovery and
Counterfactual Explanation on StyleGAN | null | null | null | null | cs.CV cs.AI cs.LG cs.MM | http://creativecommons.org/licenses/by/4.0/ | The semantically disentangled latent subspace in GAN provides rich
interpretable controls in image generation. This paper includes two
contributions on semantic latent subspace analysis in the scenario of face
generation using StyleGAN2. First, we propose a novel approach to disentangle
latent subspace semantics by e... | [
{
"created": "Mon, 24 Jan 2022 13:42:47 GMT",
"version": "v1"
}
] | 2022-01-25 | [
[
"Li",
"Bo",
""
],
[
"Wang",
"Qiulin",
""
],
[
"Pei",
"Jiquan",
""
],
[
"Yang",
"Yu",
""
],
[
"Ji",
"Xiangyang",
""
]
] | The semantically disentangled latent subspace in GAN provides rich interpretable controls in image generation. This paper includes two contributions on semantic latent subspace analysis in the scenario of face generation using StyleGAN2. First, we propose a novel approach to disentangle latent subspace semantics by exp... |
2008.09724 | Xingjian Ding | Xingjian Ding, Jianxiong Guo, Deying Li, and Weili Wu | Pricing and Budget Allocation for IoT Blockchain with Edge Computing | 11 pages, 6 figures | null | null | null | cs.CR cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Attracted by the inherent security and privacy protection of the blockchain,
incorporating blockchain into Internet of Things (IoT) has been widely studied
in these years. However, the mining process requires high computational power,
which prevents IoT devices from directly participating in blockchain
construction. ... | [
{
"created": "Sat, 22 Aug 2020 00:41:26 GMT",
"version": "v1"
}
] | 2020-08-25 | [
[
"Ding",
"Xingjian",
""
],
[
"Guo",
"Jianxiong",
""
],
[
"Li",
"Deying",
""
],
[
"Wu",
"Weili",
""
]
] | Attracted by the inherent security and privacy protection of the blockchain, incorporating blockchain into Internet of Things (IoT) has been widely studied in these years. However, the mining process requires high computational power, which prevents IoT devices from directly participating in blockchain construction. Fo... |
2302.11417 | Kevin Mann | Henning Fernau and Kevin Mann | Hitting the Romans | null | null | null | null | cs.CC | http://creativecommons.org/licenses/by/4.0/ | Roman domination is one of few examples where the related extension problem
is polynomial-time solvable even if the original decision problem is
NP-complete. This is interesting, as it allows to establish polynomial-delay
enumeration algorithms for finding minimal Roman dominating functions, while it
is open for more... | [
{
"created": "Wed, 22 Feb 2023 14:53:52 GMT",
"version": "v1"
}
] | 2023-02-23 | [
[
"Fernau",
"Henning",
""
],
[
"Mann",
"Kevin",
""
]
] | Roman domination is one of few examples where the related extension problem is polynomial-time solvable even if the original decision problem is NP-complete. This is interesting, as it allows to establish polynomial-delay enumeration algorithms for finding minimal Roman dominating functions, while it is open for more t... |
2104.00902 | Jongyoun Noh | Jongyoun Noh, Sanghoon Lee, Bumsub Ham | HVPR: Hybrid Voxel-Point Representation for Single-stage 3D Object
Detection | Accepted to CVPR 2021 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We address the problem of 3D object detection, that is, estimating 3D object
bounding boxes from point clouds. 3D object detection methods exploit either
voxel-based or point-based features to represent 3D objects in a scene.
Voxel-based features are efficient to extract, while they fail to preserve
fine-grained 3D s... | [
{
"created": "Fri, 2 Apr 2021 06:34:49 GMT",
"version": "v1"
}
] | 2021-04-05 | [
[
"Noh",
"Jongyoun",
""
],
[
"Lee",
"Sanghoon",
""
],
[
"Ham",
"Bumsub",
""
]
] | We address the problem of 3D object detection, that is, estimating 3D object bounding boxes from point clouds. 3D object detection methods exploit either voxel-based or point-based features to represent 3D objects in a scene. Voxel-based features are efficient to extract, while they fail to preserve fine-grained 3D str... |
2308.11829 | Ido Kaminer | Rotem Elimelech, Ofir David, Carlos De la Cruz Mengual, Rotem Kalisch,
Wolfgang Berndt, Michael Shalyt, Mark Silberstein, Yaron Hadad, and Ido
Kaminer | Algorithm-assisted discovery of an intrinsic order among mathematical
constants | 21 pages, 6 figures, and 1 table; with 9 appendix sections totaling
12 pages, 1 figure, and 4 tables | PNAS 121 (25) e2321440121 (2024) | 10.1073/pnas.2321440121 | null | cs.AI cs.DC math.NT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In recent decades, a growing number of discoveries in fields of mathematics
have been assisted by computer algorithms, primarily for exploring large
parameter spaces that humans would take too long to investigate. As computers
and algorithms become more powerful, an intriguing possibility arises - the
interplay betwe... | [
{
"created": "Tue, 22 Aug 2023 23:27:47 GMT",
"version": "v1"
},
{
"created": "Mon, 16 Oct 2023 10:41:15 GMT",
"version": "v2"
}
] | 2024-06-17 | [
[
"Elimelech",
"Rotem",
""
],
[
"David",
"Ofir",
""
],
[
"Mengual",
"Carlos De la Cruz",
""
],
[
"Kalisch",
"Rotem",
""
],
[
"Berndt",
"Wolfgang",
""
],
[
"Shalyt",
"Michael",
""
],
[
"Silberstein",
"Mark",
"... | In recent decades, a growing number of discoveries in fields of mathematics have been assisted by computer algorithms, primarily for exploring large parameter spaces that humans would take too long to investigate. As computers and algorithms become more powerful, an intriguing possibility arises - the interplay between... |
2405.19642 | Mengjie Gan | Mengjie Gan, Penglong Lian, Zhiheng Su, Jiyang Zhang, Jialong Huang,
Benhao Wang, Jianxiao Zou and Shicai Fan | Few-shot fault diagnosis based on multi-scale graph convolution
filtering for industry | 6 pages, 2 figures, 2 tables, 63rd IEEE Conference on Decision and
Control | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Industrial equipment fault diagnosis often encounter challenges such as the
scarcity of fault data, complex operating conditions, and varied types of
failures. Signal analysis, data statistical learning, and conventional deep
learning techniques face constraints under these conditions due to their
substantial data re... | [
{
"created": "Thu, 30 May 2024 02:51:29 GMT",
"version": "v1"
}
] | 2024-05-31 | [
[
"Gan",
"Mengjie",
""
],
[
"Lian",
"Penglong",
""
],
[
"Su",
"Zhiheng",
""
],
[
"Zhang",
"Jiyang",
""
],
[
"Huang",
"Jialong",
""
],
[
"Wang",
"Benhao",
""
],
[
"Zou",
"Jianxiao",
""
],
[
"Fan",
... | Industrial equipment fault diagnosis often encounter challenges such as the scarcity of fault data, complex operating conditions, and varied types of failures. Signal analysis, data statistical learning, and conventional deep learning techniques face constraints under these conditions due to their substantial data requ... |
1701.05881 | Navid Naderializadeh | Navid Naderializadeh, Mohammad Ali Maddah-Ali, A. Salman Avestimehr | On the Optimality of Separation between Caching and Delivery in General
Cache Networks | Presented in part at the 2017 IEEE International Symposium on
Information Theory (ISIT) -- withdrawn due to possible errors in the
achievability proof in Section IV-A | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider a system, containing a library of multiple files and a general
memoryless communication network through which a server is connected to
multiple users, each equipped with a local isolated cache of certain size that
can be used to store part of the library. Each user will ask for one of the
files in the lib... | [
{
"created": "Fri, 20 Jan 2017 18:27:17 GMT",
"version": "v1"
},
{
"created": "Mon, 26 Jun 2017 17:39:21 GMT",
"version": "v2"
},
{
"created": "Sat, 5 May 2018 09:26:40 GMT",
"version": "v3"
}
] | 2018-05-08 | [
[
"Naderializadeh",
"Navid",
""
],
[
"Maddah-Ali",
"Mohammad Ali",
""
],
[
"Avestimehr",
"A. Salman",
""
]
] | We consider a system, containing a library of multiple files and a general memoryless communication network through which a server is connected to multiple users, each equipped with a local isolated cache of certain size that can be used to store part of the library. Each user will ask for one of the files in the libra... |
2006.06608 | Yuke Wang | Yuke Wang, Boyuan Feng, Gushu Li, Shuangchen Li, Lei Deng, Yuan Xie,
Yufei Ding | GNNAdvisor: An Adaptive and Efficient Runtime System for GNN
Acceleration on GPUs | null | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As the emerging trend of graph-based deep learning, Graph Neural Networks
(GNNs) excel for their capability to generate high-quality node feature vectors
(embeddings). However, the existing one-size-fits-all GNN implementations are
insufficient to catch up with the evolving GNN architectures, the
ever-increasing grap... | [
{
"created": "Thu, 11 Jun 2020 16:58:10 GMT",
"version": "v1"
},
{
"created": "Thu, 3 Sep 2020 06:12:57 GMT",
"version": "v2"
},
{
"created": "Sun, 20 Jun 2021 04:49:17 GMT",
"version": "v3"
}
] | 2021-06-22 | [
[
"Wang",
"Yuke",
""
],
[
"Feng",
"Boyuan",
""
],
[
"Li",
"Gushu",
""
],
[
"Li",
"Shuangchen",
""
],
[
"Deng",
"Lei",
""
],
[
"Xie",
"Yuan",
""
],
[
"Ding",
"Yufei",
""
]
] | As the emerging trend of graph-based deep learning, Graph Neural Networks (GNNs) excel for their capability to generate high-quality node feature vectors (embeddings). However, the existing one-size-fits-all GNN implementations are insufficient to catch up with the evolving GNN architectures, the ever-increasing graph ... |
2003.02751 | Ehsan Haghighat | Ehsan Haghighat, Maziar Raissi, Adrian Moure, Hector Gomez, Ruben
Juanes | A deep learning framework for solution and discovery in solid mechanics | 19 pages, 14 figures | null | null | null | cs.LG cs.CE stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present the application of a class of deep learning, known as Physics
Informed Neural Networks (PINN), to learning and discovery in solid mechanics.
We explain how to incorporate the momentum balance and constitutive relations
into PINN, and explore in detail the application to linear elasticity, and
illustrate it... | [
{
"created": "Fri, 14 Feb 2020 08:24:53 GMT",
"version": "v1"
},
{
"created": "Wed, 6 May 2020 20:42:15 GMT",
"version": "v2"
}
] | 2020-05-12 | [
[
"Haghighat",
"Ehsan",
""
],
[
"Raissi",
"Maziar",
""
],
[
"Moure",
"Adrian",
""
],
[
"Gomez",
"Hector",
""
],
[
"Juanes",
"Ruben",
""
]
] | We present the application of a class of deep learning, known as Physics Informed Neural Networks (PINN), to learning and discovery in solid mechanics. We explain how to incorporate the momentum balance and constitutive relations into PINN, and explore in detail the application to linear elasticity, and illustrate its ... |
1904.01289 | Daksh Thapar | Daksh Thapar, Gaurav Jaswal, Aditya Nigam | FKIMNet: A Finger Dorsal Image Matching Network Comparing Component
(Major, Minor and Nail) Matching with Holistic (Finger Dorsal) Matching | Accepted in IJCNN 2019 | null | 10.1109/IJCNN.2019.8852390 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Current finger knuckle image recognition systems, often require users to
place fingers' major or minor joints flatly towards the capturing sensor. To
extend these systems for user non-intrusive application scenarios, such as
consumer electronics, forensic, defence etc, we suggest matching the full
dorsal fingers, rat... | [
{
"created": "Tue, 2 Apr 2019 08:47:16 GMT",
"version": "v1"
}
] | 2020-06-26 | [
[
"Thapar",
"Daksh",
""
],
[
"Jaswal",
"Gaurav",
""
],
[
"Nigam",
"Aditya",
""
]
] | Current finger knuckle image recognition systems, often require users to place fingers' major or minor joints flatly towards the capturing sensor. To extend these systems for user non-intrusive application scenarios, such as consumer electronics, forensic, defence etc, we suggest matching the full dorsal fingers, rathe... |
2307.16449 | Wenhao Chai | Enxin Song, Wenhao Chai, Guanhong Wang, Yucheng Zhang, Haoyang Zhou,
Feiyang Wu, Haozhe Chi, Xun Guo, Tian Ye, Yanting Zhang, Yan Lu, Jenq-Neng
Hwang, Gaoang Wang | MovieChat: From Dense Token to Sparse Memory for Long Video
Understanding | CVPR 2024. First three authors contribute equally to this work.
Project Website https://rese1f.github.io/MovieChat/ | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently, integrating video foundation models and large language models to
build a video understanding system can overcome the limitations of specific
pre-defined vision tasks. Yet, existing systems can only handle videos with
very few frames. For long videos, the computation complexity, memory cost, and
long-term te... | [
{
"created": "Mon, 31 Jul 2023 07:15:45 GMT",
"version": "v1"
},
{
"created": "Fri, 24 Nov 2023 02:43:18 GMT",
"version": "v2"
},
{
"created": "Sun, 3 Dec 2023 00:51:13 GMT",
"version": "v3"
},
{
"created": "Sat, 9 Mar 2024 06:43:37 GMT",
"version": "v4"
}
] | 2024-03-12 | [
[
"Song",
"Enxin",
""
],
[
"Chai",
"Wenhao",
""
],
[
"Wang",
"Guanhong",
""
],
[
"Zhang",
"Yucheng",
""
],
[
"Zhou",
"Haoyang",
""
],
[
"Wu",
"Feiyang",
""
],
[
"Chi",
"Haozhe",
""
],
[
"Guo",
"Xu... | Recently, integrating video foundation models and large language models to build a video understanding system can overcome the limitations of specific pre-defined vision tasks. Yet, existing systems can only handle videos with very few frames. For long videos, the computation complexity, memory cost, and long-term temp... |
1611.06987 | Thomas M\"ollenhoff | Thomas M\"ollenhoff, Daniel Cremers | Sublabel-Accurate Discretization of Nonconvex Free-Discontinuity
Problems | ICCV 2017 version | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work we show how sublabel-accurate multilabeling approaches can be
derived by approximating a classical label-continuous convex relaxation of
nonconvex free-discontinuity problems. This insight allows to extend these
sublabel-accurate approaches from total variation to general convex and
nonconvex regularizat... | [
{
"created": "Mon, 21 Nov 2016 20:09:18 GMT",
"version": "v1"
},
{
"created": "Sat, 5 Aug 2017 07:46:22 GMT",
"version": "v2"
}
] | 2017-08-08 | [
[
"Möllenhoff",
"Thomas",
""
],
[
"Cremers",
"Daniel",
""
]
] | In this work we show how sublabel-accurate multilabeling approaches can be derived by approximating a classical label-continuous convex relaxation of nonconvex free-discontinuity problems. This insight allows to extend these sublabel-accurate approaches from total variation to general convex and nonconvex regularizatio... |
1910.01784 | Lu Wang | Lu Wang, Wenchao Yu, Wei Wang, Wei Cheng, Wei Zhang, Hongyuan Zha,
Xiaofeng He, Haifeng Chen | Learning Robust Representations with Graph Denoising Policy Network | 10 pages | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Graph representation learning, aiming to learn low-dimensional
representations which capture the geometric dependencies between nodes in the
original graph, has gained increasing popularity in a variety of graph analysis
tasks, including node classification and link prediction. Existing
representation learning method... | [
{
"created": "Fri, 4 Oct 2019 02:22:17 GMT",
"version": "v1"
}
] | 2019-10-07 | [
[
"Wang",
"Lu",
""
],
[
"Yu",
"Wenchao",
""
],
[
"Wang",
"Wei",
""
],
[
"Cheng",
"Wei",
""
],
[
"Zhang",
"Wei",
""
],
[
"Zha",
"Hongyuan",
""
],
[
"He",
"Xiaofeng",
""
],
[
"Chen",
"Haifeng",
... | Graph representation learning, aiming to learn low-dimensional representations which capture the geometric dependencies between nodes in the original graph, has gained increasing popularity in a variety of graph analysis tasks, including node classification and link prediction. Existing representation learning methods ... |
2312.03753 | Mustapha Eddahibi | Mustapha Eddahibi and Mohammed Mensouri | English to Arabic machine translation of mathematical documents | null | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | This paper is about the development of a machine translation system tailored
specifically for LATEX mathematical documents. The system focuses on
translating English LATEX mathematical documents into Arabic LATEX, catering to
the growing demand for multilingual accessibility in scientific and
mathematical literature.... | [
{
"created": "Sat, 2 Dec 2023 21:02:07 GMT",
"version": "v1"
}
] | 2023-12-08 | [
[
"Eddahibi",
"Mustapha",
""
],
[
"Mensouri",
"Mohammed",
""
]
] | This paper is about the development of a machine translation system tailored specifically for LATEX mathematical documents. The system focuses on translating English LATEX mathematical documents into Arabic LATEX, catering to the growing demand for multilingual accessibility in scientific and mathematical literature. W... |
2005.10711 | Moran Koren | Amir Ban and Moran Koren | Sequential Fundraising and Mutual Insurance | null | null | null | null | cs.GT econ.TH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Seed fundraising for ventures often takes place by sequentially approaching
potential contributors, who make observable decisions. The fundraising succeeds
when a target number of investments is reached. Though resembling classic
information cascades models, its behavior is radically different, exhibiting
surprising ... | [
{
"created": "Thu, 21 May 2020 15:08:58 GMT",
"version": "v1"
},
{
"created": "Fri, 10 Dec 2021 07:37:47 GMT",
"version": "v2"
},
{
"created": "Mon, 13 Dec 2021 21:39:31 GMT",
"version": "v3"
}
] | 2021-12-15 | [
[
"Ban",
"Amir",
""
],
[
"Koren",
"Moran",
""
]
] | Seed fundraising for ventures often takes place by sequentially approaching potential contributors, who make observable decisions. The fundraising succeeds when a target number of investments is reached. Though resembling classic information cascades models, its behavior is radically different, exhibiting surprising co... |
2310.14030 | Abdelhakim Amer | Abdelhakim Amer, Mohit Mehndiratta, Jonas le Fevre Sejersen, Huy Xuan
Pham, Erdal Kayacan | Visual Tracking Nonlinear Model Predictive Control Method for Autonomous
Wind Turbine Inspection | 8 pages, accepted for publication at ICAR conference | null | null | null | cs.RO | http://creativecommons.org/licenses/by/4.0/ | Automated visual inspection of on-and offshore wind turbines using aerial
robots provides several benefits, namely, a safe working environment by
circumventing the need for workers to be suspended high above the ground,
reduced inspection time, preventive maintenance, and access to hard-to-reach
areas. A novel nonlin... | [
{
"created": "Sat, 21 Oct 2023 14:52:23 GMT",
"version": "v1"
}
] | 2023-10-24 | [
[
"Amer",
"Abdelhakim",
""
],
[
"Mehndiratta",
"Mohit",
""
],
[
"Sejersen",
"Jonas le Fevre",
""
],
[
"Pham",
"Huy Xuan",
""
],
[
"Kayacan",
"Erdal",
""
]
] | Automated visual inspection of on-and offshore wind turbines using aerial robots provides several benefits, namely, a safe working environment by circumventing the need for workers to be suspended high above the ground, reduced inspection time, preventive maintenance, and access to hard-to-reach areas. A novel nonlinea... |
1703.00426 | Francois Chollet | Cezary Kaliszyk, Fran\c{c}ois Chollet, Christian Szegedy | HolStep: A Machine Learning Dataset for Higher-order Logic Theorem
Proving | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Large computer-understandable proofs consist of millions of intermediate
logical steps. The vast majority of such steps originate from manually selected
and manually guided heuristics applied to intermediate goals. So far, machine
learning has generally not been used to filter or generate these steps. In this
paper, ... | [
{
"created": "Wed, 1 Mar 2017 18:20:19 GMT",
"version": "v1"
}
] | 2017-03-02 | [
[
"Kaliszyk",
"Cezary",
""
],
[
"Chollet",
"François",
""
],
[
"Szegedy",
"Christian",
""
]
] | Large computer-understandable proofs consist of millions of intermediate logical steps. The vast majority of such steps originate from manually selected and manually guided heuristics applied to intermediate goals. So far, machine learning has generally not been used to filter or generate these steps. In this paper, we... |
1205.1758 | Jonathan Ullman | Justin Thaler, Jonathan Ullman, Salil Vadhan | Faster Algorithms for Privately Releasing Marginals | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the problem of releasing $k$-way marginals of a database $D \in
(\{0,1\}^d)^n$, while preserving differential privacy. The answer to a $k$-way
marginal query is the fraction of $D$'s records $x \in \{0,1\}^d$ with a given
value in each of a given set of up to $k$ columns. Marginal queries enable a
rich class... | [
{
"created": "Tue, 8 May 2012 17:43:11 GMT",
"version": "v1"
},
{
"created": "Mon, 25 Jun 2012 14:59:54 GMT",
"version": "v2"
},
{
"created": "Fri, 14 Mar 2014 13:56:07 GMT",
"version": "v3"
}
] | 2014-03-17 | [
[
"Thaler",
"Justin",
""
],
[
"Ullman",
"Jonathan",
""
],
[
"Vadhan",
"Salil",
""
]
] | We study the problem of releasing $k$-way marginals of a database $D \in (\{0,1\}^d)^n$, while preserving differential privacy. The answer to a $k$-way marginal query is the fraction of $D$'s records $x \in \{0,1\}^d$ with a given value in each of a given set of up to $k$ columns. Marginal queries enable a rich class o... |
2303.03888 | Heitor Ferreira Gonzaga | Heitor Ferreira Gonzaga | A Juridicidade e a Regulamenta\c{c}\~ao dos Dark Patterns | in Portuguese language. arXiv admin note: text overlap with
arXiv:2101.04843 by other authors | null | null | null | cs.CY cs.HC | http://creativecommons.org/licenses/by/4.0/ | The evolution of audiovisual computer interfaces was an important milestone
for the popularization of the internet without which it is impossible to
conceive the use of this technology in modern society However the progress of
these interfaces has not taken exclusively beneficial paths for humanity From
the beginning... | [
{
"created": "Fri, 17 Feb 2023 12:13:13 GMT",
"version": "v1"
},
{
"created": "Sat, 1 Jul 2023 19:56:42 GMT",
"version": "v2"
}
] | 2023-07-04 | [
[
"Gonzaga",
"Heitor Ferreira",
""
]
] | The evolution of audiovisual computer interfaces was an important milestone for the popularization of the internet without which it is impossible to conceive the use of this technology in modern society However the progress of these interfaces has not taken exclusively beneficial paths for humanity From the beginning o... |
1111.6757 | Fadi Battah | Hussain A.H. Awad and Fadi M. Battah | Enhancing Information Systems Security in Educational Organizations in
KSA through proposing security model | null | null | null | null | cs.OH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | It is well known that technology utilization is not restricted for one sector
than the other anymore, Educational organizations share many parts of their
information systems with commercial organizations. In this paper we will try to
identify the main characteristics of information systems in educational
organization... | [
{
"created": "Tue, 29 Nov 2011 10:41:17 GMT",
"version": "v1"
}
] | 2011-11-30 | [
[
"Awad",
"Hussain A. H.",
""
],
[
"Battah",
"Fadi M.",
""
]
] | It is well known that technology utilization is not restricted for one sector than the other anymore, Educational organizations share many parts of their information systems with commercial organizations. In this paper we will try to identify the main characteristics of information systems in educational organizations,... |
1811.06621 | Ian McGraw | Yanzhang He, Tara N. Sainath, Rohit Prabhavalkar, Ian McGraw, Raziel
Alvarez, Ding Zhao, David Rybach, Anjuli Kannan, Yonghui Wu, Ruoming Pang,
Qiao Liang, Deepti Bhatia, Yuan Shangguan, Bo Li, Golan Pundak, Khe Chai Sim,
Tom Bagby, Shuo-yiin Chang, Kanishka Rao, Alexander Gruenstein | Streaming End-to-end Speech Recognition For Mobile Devices | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | End-to-end (E2E) models, which directly predict output character sequences
given input speech, are good candidates for on-device speech recognition. E2E
models, however, present numerous challenges: In order to be truly useful, such
models must decode speech utterances in a streaming fashion, in real time; they
must ... | [
{
"created": "Thu, 15 Nov 2018 23:09:44 GMT",
"version": "v1"
}
] | 2018-11-19 | [
[
"He",
"Yanzhang",
""
],
[
"Sainath",
"Tara N.",
""
],
[
"Prabhavalkar",
"Rohit",
""
],
[
"McGraw",
"Ian",
""
],
[
"Alvarez",
"Raziel",
""
],
[
"Zhao",
"Ding",
""
],
[
"Rybach",
"David",
""
],
[
"Kan... | End-to-end (E2E) models, which directly predict output character sequences given input speech, are good candidates for on-device speech recognition. E2E models, however, present numerous challenges: In order to be truly useful, such models must decode speech utterances in a streaming fashion, in real time; they must be... |
2312.03808 | Ryan Rubel | Ryan Rubel and Nathan Clark and Andrew Dudash | SurfaceAug: Closing the Gap in Multimodal Ground Truth Sampling | Contains eight pages and three figures. A version of this document
was submitted to CVPR 2024 | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Despite recent advances in both model architectures and data augmentation,
multimodal object detectors still barely outperform their LiDAR-only
counterparts. This shortcoming has been attributed to a lack of sufficiently
powerful multimodal data augmentation. To address this, we present SurfaceAug,
a novel ground tru... | [
{
"created": "Wed, 6 Dec 2023 16:51:30 GMT",
"version": "v1"
}
] | 2023-12-08 | [
[
"Rubel",
"Ryan",
""
],
[
"Clark",
"Nathan",
""
],
[
"Dudash",
"Andrew",
""
]
] | Despite recent advances in both model architectures and data augmentation, multimodal object detectors still barely outperform their LiDAR-only counterparts. This shortcoming has been attributed to a lack of sufficiently powerful multimodal data augmentation. To address this, we present SurfaceAug, a novel ground truth... |
1908.01420 | Alexander Zook | Alexander Zook and Mark O. Riedl | Automatic Game Design via Mechanic Generation | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Game designs often center on the game mechanics---rules governing the logical
evolution of the game. We seek to develop an intelligent system that generates
computer games. As first steps towards this goal we present a composable and
cross-domain representation for game mechanics that draws from AI planning
action re... | [
{
"created": "Sun, 4 Aug 2019 23:12:16 GMT",
"version": "v1"
}
] | 2019-08-06 | [
[
"Zook",
"Alexander",
""
],
[
"Riedl",
"Mark O.",
""
]
] | Game designs often center on the game mechanics---rules governing the logical evolution of the game. We seek to develop an intelligent system that generates computer games. As first steps towards this goal we present a composable and cross-domain representation for game mechanics that draws from AI planning action repr... |
0912.0579 | Rdv Ijcsis | Mohammad Ghulam Ali | A Multidatabase System as 4-Tiered Client-Server Distributed
Heterogeneous Database System | 5 pages IEEE format, International Journal of Computer Science and
Information Security, IJCSIS November 2009, ISSN 1947 5500,
http://sites.google.com/site/ijcsis/ | International Journal of Computer Science and Information
Security, IJCSIS, Vol. 6, No. 2, pp. 010-014, November 2009, USA | null | ISSN 19475500 | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we describe a multidatabase system as 4tiered Client-Server
DBMS architectures. We discuss their functional components and provide an
overview of their performance characteristics. The first component of this
proposed system is a web based interface or Graphical User Interface, which
resides on top of ... | [
{
"created": "Thu, 3 Dec 2009 05:34:56 GMT",
"version": "v1"
}
] | 2009-12-04 | [
[
"Ali",
"Mohammad Ghulam",
""
]
] | In this paper, we describe a multidatabase system as 4tiered Client-Server DBMS architectures. We discuss their functional components and provide an overview of their performance characteristics. The first component of this proposed system is a web based interface or Graphical User Interface, which resides on top of th... |
2210.01615 | Konstantin Kobs | Konstantin Kobs and Andreas Hotho | On Background Bias in Deep Metric Learning | To be published at ICMV 2022 | null | null | null | cs.CV cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep Metric Learning trains a neural network to map input images to a
lower-dimensional embedding space such that similar images are closer together
than dissimilar images. When used for item retrieval, a query image is embedded
using the trained model and the closest items from a database storing their
respective em... | [
{
"created": "Tue, 4 Oct 2022 13:57:39 GMT",
"version": "v1"
}
] | 2022-10-05 | [
[
"Kobs",
"Konstantin",
""
],
[
"Hotho",
"Andreas",
""
]
] | Deep Metric Learning trains a neural network to map input images to a lower-dimensional embedding space such that similar images are closer together than dissimilar images. When used for item retrieval, a query image is embedded using the trained model and the closest items from a database storing their respective embe... |
1703.06934 | William La Cava | William La Cava and Jason H. Moore | Ensemble representation learning: an analysis of fitness and survival
for wrapper-based genetic programming methods | Genetic and Evolutionary Computation Conference (GECCO) 2017, Berlin,
Germany | null | 10.1145/3071178/3071215 | null | cs.NE cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently we proposed a general, ensemble-based feature engineering wrapper
(FEW) that was paired with a number of machine learning methods to solve
regression problems. Here, we adapt FEW for supervised classification and
perform a thorough analysis of fitness and survival methods within this
framework. Our tests dem... | [
{
"created": "Mon, 20 Mar 2017 19:26:00 GMT",
"version": "v1"
},
{
"created": "Thu, 20 Apr 2017 12:46:40 GMT",
"version": "v2"
},
{
"created": "Thu, 3 Aug 2017 19:01:17 GMT",
"version": "v3"
}
] | 2017-08-07 | [
[
"La Cava",
"William",
""
],
[
"Moore",
"Jason H.",
""
]
] | Recently we proposed a general, ensemble-based feature engineering wrapper (FEW) that was paired with a number of machine learning methods to solve regression problems. Here, we adapt FEW for supervised classification and perform a thorough analysis of fitness and survival methods within this framework. Our tests demon... |
2107.09419 | Rogier van de Wetering | Rogier van de Wetering and Johan Versendaal | The role of IT ambidexterity, digital dynamic capability and knowledge
processes as enablers of patient agility: an empirical study | 23 pages, 2 figures, 5 tables. arXiv admin note: text overlap with
arXiv:2105.09013 | null | null | null | cs.CY | http://creativecommons.org/licenses/by-nc-sa/4.0/ | There is a limited understanding of IT's role as a crucial enabler of patient
agility and the department's ability to respond to patient's needs and wishes
adequately. This study's objective is to contribute to the insights of the
validity of the hypothesized relationship between IT resources, practices and
capabilit... | [
{
"created": "Tue, 20 Jul 2021 11:30:56 GMT",
"version": "v1"
}
] | 2021-07-21 | [
[
"van de Wetering",
"Rogier",
""
],
[
"Versendaal",
"Johan",
""
]
] | There is a limited understanding of IT's role as a crucial enabler of patient agility and the department's ability to respond to patient's needs and wishes adequately. This study's objective is to contribute to the insights of the validity of the hypothesized relationship between IT resources, practices and capabilitie... |
2006.06958 | Seyed Iman Mirzadeh | Seyed Iman Mirzadeh, Mehrdad Farajtabar, Razvan Pascanu, Hassan
Ghasemzadeh | Understanding the Role of Training Regimes in Continual Learning | null | null | null | null | cs.LG cs.NE stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Catastrophic forgetting affects the training of neural networks, limiting
their ability to learn multiple tasks sequentially. From the perspective of the
well established plasticity-stability dilemma, neural networks tend to be
overly plastic, lacking the stability necessary to prevent the forgetting of
previous know... | [
{
"created": "Fri, 12 Jun 2020 06:00:27 GMT",
"version": "v1"
}
] | 2020-06-15 | [
[
"Mirzadeh",
"Seyed Iman",
""
],
[
"Farajtabar",
"Mehrdad",
""
],
[
"Pascanu",
"Razvan",
""
],
[
"Ghasemzadeh",
"Hassan",
""
]
] | Catastrophic forgetting affects the training of neural networks, limiting their ability to learn multiple tasks sequentially. From the perspective of the well established plasticity-stability dilemma, neural networks tend to be overly plastic, lacking the stability necessary to prevent the forgetting of previous knowle... |
2311.01198 | Mathieu Alain | Mathieu Alain, So Takao, Brooks Paige, Marc Peter Deisenroth | Gaussian Processes on Cellular Complexes | null | null | null | null | cs.LG stat.ML | http://creativecommons.org/licenses/by/4.0/ | In recent years, there has been considerable interest in developing machine
learning models on graphs in order to account for topological inductive biases.
In particular, recent attention was given to Gaussian processes on such
structures since they can additionally account for uncertainty. However, graphs
are limite... | [
{
"created": "Thu, 2 Nov 2023 12:49:14 GMT",
"version": "v1"
}
] | 2023-11-03 | [
[
"Alain",
"Mathieu",
""
],
[
"Takao",
"So",
""
],
[
"Paige",
"Brooks",
""
],
[
"Deisenroth",
"Marc Peter",
""
]
] | In recent years, there has been considerable interest in developing machine learning models on graphs in order to account for topological inductive biases. In particular, recent attention was given to Gaussian processes on such structures since they can additionally account for uncertainty. However, graphs are limited ... |
2006.12631 | Oleksandr Shchur | Oleksandr Shchur, Nicholas Gao, Marin Bilo\v{s}, Stephan G\"unnemann | Fast and Flexible Temporal Point Processes with Triangular Maps | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Temporal point process (TPP) models combined with recurrent neural networks
provide a powerful framework for modeling continuous-time event data. While
such models are flexible, they are inherently sequential and therefore cannot
benefit from the parallelism of modern hardware. By exploiting the recent
developments i... | [
{
"created": "Mon, 22 Jun 2020 21:34:10 GMT",
"version": "v1"
},
{
"created": "Tue, 10 Nov 2020 16:44:49 GMT",
"version": "v2"
}
] | 2020-11-11 | [
[
"Shchur",
"Oleksandr",
""
],
[
"Gao",
"Nicholas",
""
],
[
"Biloš",
"Marin",
""
],
[
"Günnemann",
"Stephan",
""
]
] | Temporal point process (TPP) models combined with recurrent neural networks provide a powerful framework for modeling continuous-time event data. While such models are flexible, they are inherently sequential and therefore cannot benefit from the parallelism of modern hardware. By exploiting the recent developments in ... |
2111.12746 | Hammond Pearce | Caleb Beckwith and Harsh Sankar Naicker and Svara Mehta and Viba R.
Udupa and Nghia Tri Nim and Varun Gadre and Hammond Pearce and Gary Mac and
Nikhil Gupta | Needle in a Haystack: Detecting Subtle Malicious Edits to Additive
Manufacturing G-code Files | To appear in IEEE Embedded Systems Letters | null | 10.1109/LES.2021.3129108 | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Increasing usage of Digital Manufacturing (DM) in safety-critical domains is
increasing attention on the cybersecurity of the manufacturing process, as
malicious third parties might aim to introduce defects in digital designs. In
general, the DM process involves creating a digital object (as CAD files)
before using a... | [
{
"created": "Wed, 24 Nov 2021 19:09:40 GMT",
"version": "v1"
}
] | 2021-11-29 | [
[
"Beckwith",
"Caleb",
""
],
[
"Naicker",
"Harsh Sankar",
""
],
[
"Mehta",
"Svara",
""
],
[
"Udupa",
"Viba R.",
""
],
[
"Nim",
"Nghia Tri",
""
],
[
"Gadre",
"Varun",
""
],
[
"Pearce",
"Hammond",
""
],
[
... | Increasing usage of Digital Manufacturing (DM) in safety-critical domains is increasing attention on the cybersecurity of the manufacturing process, as malicious third parties might aim to introduce defects in digital designs. In general, the DM process involves creating a digital object (as CAD files) before using a s... |
2204.01102 | Jeremy Seeman | Jeremy Seeman, Matthew Reimherr, Aleksandra Slavkovic | Formal Privacy for Partially Private Data | 34 pages, 4 figures; submitted to JMLR | null | null | null | cs.CR stat.ME | http://creativecommons.org/licenses/by/4.0/ | Differential privacy (DP) quantifies privacy loss by analyzing noise injected
into output statistics. For non-trivial statistics, this noise is necessary to
ensure finite privacy loss. However, data curators frequently release
collections of statistics where some use DP mechanisms and others are released
as-is, i.e.,... | [
{
"created": "Sun, 3 Apr 2022 16:13:58 GMT",
"version": "v1"
},
{
"created": "Thu, 26 May 2022 23:32:36 GMT",
"version": "v2"
},
{
"created": "Wed, 14 Dec 2022 17:03:18 GMT",
"version": "v3"
}
] | 2022-12-15 | [
[
"Seeman",
"Jeremy",
""
],
[
"Reimherr",
"Matthew",
""
],
[
"Slavkovic",
"Aleksandra",
""
]
] | Differential privacy (DP) quantifies privacy loss by analyzing noise injected into output statistics. For non-trivial statistics, this noise is necessary to ensure finite privacy loss. However, data curators frequently release collections of statistics where some use DP mechanisms and others are released as-is, i.e., w... |
1411.2917 | Sophie Spirkl | Stephan Held and Sophie Spirkl | Fast Prefix Adders for Non-Uniform Input Arrival Times | null | null | null | null | cs.AR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the problem of constructing fast and small parallel prefix adders
for non-uniform input arrival times. This problem arises whenever the adder is
embedded into a more complex circuit, e. g. a multiplier.
Most previous results are based on representing binary carry-propagate adders
as so-called parallel p... | [
{
"created": "Tue, 11 Nov 2014 18:52:26 GMT",
"version": "v1"
}
] | 2014-11-12 | [
[
"Held",
"Stephan",
""
],
[
"Spirkl",
"Sophie",
""
]
] | We consider the problem of constructing fast and small parallel prefix adders for non-uniform input arrival times. This problem arises whenever the adder is embedded into a more complex circuit, e. g. a multiplier. Most previous results are based on representing binary carry-propagate adders as so-called parallel prefi... |
1510.00240 | Denis Gordeev | Rodmonga Potapova and Denis Gordeev | Determination of the Internet Anonymity Influence on the Level of
Aggression and Usage of Obscene Lexis | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This article deals with the analysis of the semantic content of the anonymous
Russian-speaking forum 2ch.hk, different verbal means of expressing of the
emotional state of aggression are revealed for this site, and aggression is
classified by its directions. The lexis of different Russian-and English-
speaking anonym... | [
{
"created": "Thu, 1 Oct 2015 14:01:32 GMT",
"version": "v1"
}
] | 2015-10-02 | [
[
"Potapova",
"Rodmonga",
""
],
[
"Gordeev",
"Denis",
""
]
] | This article deals with the analysis of the semantic content of the anonymous Russian-speaking forum 2ch.hk, different verbal means of expressing of the emotional state of aggression are revealed for this site, and aggression is classified by its directions. The lexis of different Russian-and English- speaking anonymou... |
2010.08169 | Cheng-Yu Kuo | Cheng-Yu Kuo, Andreas Schaarschmidt, Yunduan Cui, Tamim Asfour, and
Takamitsu Matsubara | Uncertainty-aware Contact-safe Model-based Reinforcement Learning | 8 pages, Accepted by Robotics and Automation Letters with ICRA 2021
option | null | null | null | cs.RO cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This letter presents contact-safe Model-based Reinforcement Learning (MBRL)
for robot applications that achieves contact-safe behaviors in the learning
process. In typical MBRL, we cannot expect the data-driven model to generate
accurate and reliable policies to the intended robotic tasks during the
learning process ... | [
{
"created": "Fri, 16 Oct 2020 05:11:25 GMT",
"version": "v1"
},
{
"created": "Fri, 5 Mar 2021 12:13:49 GMT",
"version": "v2"
},
{
"created": "Tue, 9 Mar 2021 05:57:06 GMT",
"version": "v3"
}
] | 2021-03-10 | [
[
"Kuo",
"Cheng-Yu",
""
],
[
"Schaarschmidt",
"Andreas",
""
],
[
"Cui",
"Yunduan",
""
],
[
"Asfour",
"Tamim",
""
],
[
"Matsubara",
"Takamitsu",
""
]
] | This letter presents contact-safe Model-based Reinforcement Learning (MBRL) for robot applications that achieves contact-safe behaviors in the learning process. In typical MBRL, we cannot expect the data-driven model to generate accurate and reliable policies to the intended robotic tasks during the learning process du... |
2402.14976 | Dmitry Kangin | Dmitry Kangin, Plamen Angelov | Unsupervised Domain Adaptation within Deep Foundation Latent Spaces | null | null | null | null | cs.CV cs.AI cs.LG | http://creativecommons.org/licenses/by-nc-sa/4.0/ | The vision transformer-based foundation models, such as ViT or Dino-V2, are
aimed at solving problems with little or no finetuning of features. Using a
setting of prototypical networks, we analyse to what extent such foundation
models can solve unsupervised domain adaptation without finetuning over the
source or targ... | [
{
"created": "Thu, 22 Feb 2024 21:25:20 GMT",
"version": "v1"
}
] | 2024-02-26 | [
[
"Kangin",
"Dmitry",
""
],
[
"Angelov",
"Plamen",
""
]
] | The vision transformer-based foundation models, such as ViT or Dino-V2, are aimed at solving problems with little or no finetuning of features. Using a setting of prototypical networks, we analyse to what extent such foundation models can solve unsupervised domain adaptation without finetuning over the source or target... |
2111.01415 | Wenyu Zhu | Wenyu Zhu, Zhiyao Feng, Zihan Zhang, Jianjun Chen, Zhijian Ou, Min
Yang, Chao Zhang | Callee: Recovering Call Graphs for Binaries with Transfer and
Contrastive Learning | null | null | null | null | cs.SE cs.AI cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recovering binary programs' call graphs is crucial for inter-procedural
analysis tasks and applications based on them.transfer One of the core
challenges is recognizing targets of indirect calls (i.e., indirect callees).
Existing solutions all have high false positives and negatives, making call
graphs inaccurate. In... | [
{
"created": "Tue, 2 Nov 2021 08:08:18 GMT",
"version": "v1"
},
{
"created": "Wed, 3 Nov 2021 02:57:17 GMT",
"version": "v2"
},
{
"created": "Sat, 20 Aug 2022 07:45:02 GMT",
"version": "v3"
},
{
"created": "Fri, 23 Dec 2022 08:18:41 GMT",
"version": "v4"
}
] | 2022-12-26 | [
[
"Zhu",
"Wenyu",
""
],
[
"Feng",
"Zhiyao",
""
],
[
"Zhang",
"Zihan",
""
],
[
"Chen",
"Jianjun",
""
],
[
"Ou",
"Zhijian",
""
],
[
"Yang",
"Min",
""
],
[
"Zhang",
"Chao",
""
]
] | Recovering binary programs' call graphs is crucial for inter-procedural analysis tasks and applications based on them.transfer One of the core challenges is recognizing targets of indirect calls (i.e., indirect callees). Existing solutions all have high false positives and negatives, making call graphs inaccurate. In t... |
1504.00788 | Gianmarco De Francisci Morales | Muhammad Anis Uddin Nasir, Gianmarco De Francisci Morales, David
Garc\'ia-Soriano, Nicolas Kourtellis, Marco Serafini | The Power of Both Choices: Practical Load Balancing for Distributed
Stream Processing Engines | 31st IEEE International Conference on Data Engineering (ICDE), 2015 | null | 10.1109/ICDE.2015.7113279 | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the problem of load balancing in distributed stream processing
engines, which is exacerbated in the presence of skew. We introduce Partial Key
Grouping (PKG), a new stream partitioning scheme that adapts the classical
"power of two choices" to a distributed streaming setting by leveraging two
novel technique... | [
{
"created": "Fri, 3 Apr 2015 09:24:22 GMT",
"version": "v1"
}
] | 2016-11-17 | [
[
"Nasir",
"Muhammad Anis Uddin",
""
],
[
"Morales",
"Gianmarco De Francisci",
""
],
[
"García-Soriano",
"David",
""
],
[
"Kourtellis",
"Nicolas",
""
],
[
"Serafini",
"Marco",
""
]
] | We study the problem of load balancing in distributed stream processing engines, which is exacerbated in the presence of skew. We introduce Partial Key Grouping (PKG), a new stream partitioning scheme that adapts the classical "power of two choices" to a distributed streaming setting by leveraging two novel techniques:... |
1903.04181 | Fabien Gandon | Fabien Gandon (Laboratoire I3S - SPARKS, WIMMICS, CRISAM), Franck
Michel (WIMMICS), Olivier Corby (WIMMICS), Michel Buffa (WIMMICS), Andrea
Tettamanzi (WIMMICS), Catherine Faron Zucker (WIMMICS), Elena Cabrio
(WIMMICS), Serena Villata (WIMMICS) | Graph Data on the Web: extend the pivot, don't reinvent the wheel | W3C Workshop on Web Standardization for Graph Data - Creating
Bridges: RDF, Property Graph and SQL, Mar 2019, Berlin, France. 2019,
https://www.w3.org/Data/events/data-ws-2019/index.html | null | null | null | cs.DB cs.AI cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This article is a collective position paper from the Wimmics research team,
expressing our vision of how Web graph data technologies should evolve in the
future in order to ensure a high-level of interoperability between the many
types of applications that produce and consume graph data. Wimmics stands for
Web-Instru... | [
{
"created": "Mon, 11 Mar 2019 09:09:06 GMT",
"version": "v1"
}
] | 2019-03-12 | [
[
"Gandon",
"Fabien",
"",
"Laboratoire I3S - SPARKS, WIMMICS, CRISAM"
],
[
"Michel",
"Franck",
"",
"WIMMICS"
],
[
"Corby",
"Olivier",
"",
"WIMMICS"
],
[
"Buffa",
"Michel",
"",
"WIMMICS"
],
[
"Tettamanzi",
"Andrea",
"",
"... | This article is a collective position paper from the Wimmics research team, expressing our vision of how Web graph data technologies should evolve in the future in order to ensure a high-level of interoperability between the many types of applications that produce and consume graph data. Wimmics stands for Web-Instrume... |
1610.01959 | Panos P. Markopoulos | Panos P. Markopoulos, Sandipan Kundu, Shubham Chamadia, Dimitris A.
Pados | Efficient L1-Norm Principal-Component Analysis via Bit Flipping | null | null | 10.1109/TSP.2017.2708023 | null | cs.DS cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | It was shown recently that the $K$ L1-norm principal components (L1-PCs) of a
real-valued data matrix $\mathbf X \in \mathbb R^{D \times N}$ ($N$ data
samples of $D$ dimensions) can be exactly calculated with cost
$\mathcal{O}(2^{NK})$ or, when advantageous, $\mathcal{O}(N^{dK - K + 1})$
where $d=\mathrm{rank}(\mathb... | [
{
"created": "Thu, 6 Oct 2016 17:20:16 GMT",
"version": "v1"
}
] | 2017-08-02 | [
[
"Markopoulos",
"Panos P.",
""
],
[
"Kundu",
"Sandipan",
""
],
[
"Chamadia",
"Shubham",
""
],
[
"Pados",
"Dimitris A.",
""
]
] | It was shown recently that the $K$ L1-norm principal components (L1-PCs) of a real-valued data matrix $\mathbf X \in \mathbb R^{D \times N}$ ($N$ data samples of $D$ dimensions) can be exactly calculated with cost $\mathcal{O}(2^{NK})$ or, when advantageous, $\mathcal{O}(N^{dK - K + 1})$ where $d=\mathrm{rank}(\mathbf ... |
2203.07475 | Adam Gleave | Joar Skalse, Matthew Farrugia-Roberts, Stuart Russell, Alessandro
Abate, Adam Gleave | Invariance in Policy Optimisation and Partial Identifiability in Reward
Learning | ICML 2023. 9 pages main paper, 26 pages total, 3 figures | null | null | null | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | It is often very challenging to manually design reward functions for complex,
real-world tasks. To solve this, one can instead use reward learning to infer a
reward function from data. However, there are often multiple reward functions
that fit the data equally well, even in the infinite-data limit. This means
that t... | [
{
"created": "Mon, 14 Mar 2022 20:19:15 GMT",
"version": "v1"
},
{
"created": "Wed, 7 Jun 2023 04:37:57 GMT",
"version": "v2"
}
] | 2023-06-08 | [
[
"Skalse",
"Joar",
""
],
[
"Farrugia-Roberts",
"Matthew",
""
],
[
"Russell",
"Stuart",
""
],
[
"Abate",
"Alessandro",
""
],
[
"Gleave",
"Adam",
""
]
] | It is often very challenging to manually design reward functions for complex, real-world tasks. To solve this, one can instead use reward learning to infer a reward function from data. However, there are often multiple reward functions that fit the data equally well, even in the infinite-data limit. This means that the... |
2203.09940 | Anna Kuzina | Anna Kuzina, Max Welling, Jakub M. Tomczak | Alleviating Adversarial Attacks on Variational Autoencoders with MCMC | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Variational autoencoders (VAEs) are latent variable models that can generate
complex objects and provide meaningful latent representations. Moreover, they
could be further used in downstream tasks such as classification. As previous
work has shown, one can easily fool VAEs to produce unexpected latent
representations... | [
{
"created": "Fri, 18 Mar 2022 13:25:18 GMT",
"version": "v1"
},
{
"created": "Wed, 12 Oct 2022 15:42:45 GMT",
"version": "v2"
}
] | 2022-10-13 | [
[
"Kuzina",
"Anna",
""
],
[
"Welling",
"Max",
""
],
[
"Tomczak",
"Jakub M.",
""
]
] | Variational autoencoders (VAEs) are latent variable models that can generate complex objects and provide meaningful latent representations. Moreover, they could be further used in downstream tasks such as classification. As previous work has shown, one can easily fool VAEs to produce unexpected latent representations a... |
2112.10752 | Robin Rombach | Robin Rombach and Andreas Blattmann and Dominik Lorenz and Patrick
Esser and Bj\"orn Ommer | High-Resolution Image Synthesis with Latent Diffusion Models | CVPR 2022 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | By decomposing the image formation process into a sequential application of
denoising autoencoders, diffusion models (DMs) achieve state-of-the-art
synthesis results on image data and beyond. Additionally, their formulation
allows for a guiding mechanism to control the image generation process without
retraining. How... | [
{
"created": "Mon, 20 Dec 2021 18:55:25 GMT",
"version": "v1"
},
{
"created": "Wed, 13 Apr 2022 11:38:44 GMT",
"version": "v2"
}
] | 2022-04-14 | [
[
"Rombach",
"Robin",
""
],
[
"Blattmann",
"Andreas",
""
],
[
"Lorenz",
"Dominik",
""
],
[
"Esser",
"Patrick",
""
],
[
"Ommer",
"Björn",
""
]
] | By decomposing the image formation process into a sequential application of denoising autoencoders, diffusion models (DMs) achieve state-of-the-art synthesis results on image data and beyond. Additionally, their formulation allows for a guiding mechanism to control the image generation process without retraining. Howev... |
2204.12176 | Qi Wan | Qi Wan, Xiangnan He, Xiang Wang, Jiancan Wu, Wei Guo, Ruiming Tang | Cross Pairwise Ranking for Unbiased Item Recommendation | WWW 2022 | null | null | null | cs.IR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Most recommender systems optimize the model on observed interaction data,
which is affected by the previous exposure mechanism and exhibits many biases
like popularity bias. The loss functions, such as the mostly used pointwise
Binary Cross-Entropy and pairwise Bayesian Personalized Ranking, are not
designed to consi... | [
{
"created": "Tue, 26 Apr 2022 09:20:27 GMT",
"version": "v1"
}
] | 2022-04-27 | [
[
"Wan",
"Qi",
""
],
[
"He",
"Xiangnan",
""
],
[
"Wang",
"Xiang",
""
],
[
"Wu",
"Jiancan",
""
],
[
"Guo",
"Wei",
""
],
[
"Tang",
"Ruiming",
""
]
] | Most recommender systems optimize the model on observed interaction data, which is affected by the previous exposure mechanism and exhibits many biases like popularity bias. The loss functions, such as the mostly used pointwise Binary Cross-Entropy and pairwise Bayesian Personalized Ranking, are not designed to conside... |
1804.07819 | Erik Altman | Erik Altman | Understanding AI Data Repositories with Automatic Query Generation | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We describe a set of techniques to generate queries automatically based on
one or more ingested, input corpuses. These queries require no a priori domain
knowledge, and hence no human domain experts. Thus, these auto-generated
queries help address the epistemological question of how we know what we know,
or more prec... | [
{
"created": "Fri, 20 Apr 2018 20:44:09 GMT",
"version": "v1"
}
] | 2018-04-24 | [
[
"Altman",
"Erik",
""
]
] | We describe a set of techniques to generate queries automatically based on one or more ingested, input corpuses. These queries require no a priori domain knowledge, and hence no human domain experts. Thus, these auto-generated queries help address the epistemological question of how we know what we know, or more precis... |
1703.01362 | Mehrdad Tahmasbi | Mehrdad Tahmasbi and Matthieu R. Bloch | First and Second Order Asymptotics in Covert Communication | null | null | 10.1109/TIT.2018.2878526 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the first- and second-order asymptotics of covert communication over
binary-input DMC for three different covertness metrics and under maximum
probability of error constraint. When covertness is measured in terms of the
relative entropy between the channel output distributions induced with and
without commun... | [
{
"created": "Fri, 3 Mar 2017 23:59:56 GMT",
"version": "v1"
},
{
"created": "Sat, 23 Dec 2017 01:15:55 GMT",
"version": "v2"
},
{
"created": "Tue, 3 Jul 2018 22:16:21 GMT",
"version": "v3"
}
] | 2019-01-09 | [
[
"Tahmasbi",
"Mehrdad",
""
],
[
"Bloch",
"Matthieu R.",
""
]
] | We study the first- and second-order asymptotics of covert communication over binary-input DMC for three different covertness metrics and under maximum probability of error constraint. When covertness is measured in terms of the relative entropy between the channel output distributions induced with and without communic... |
2303.17607 | Houwen Xin | Lizhi Xin, Kevin Xin, Houwen Xin | Machine learning for discovering laws of nature | null | null | null | null | cs.LG cs.AI quant-ph | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Based on Darwin's natural selection, we developed "machine scientists" to
discover the laws of nature by learning from raw data. "Machine scientists"
construct physical theories by applying a logic tree (state Decision Tree) and
a value tree (observation Function Tree); the logical tree determines the state
of the en... | [
{
"created": "Sat, 18 Mar 2023 07:31:58 GMT",
"version": "v1"
},
{
"created": "Sat, 8 Jul 2023 16:37:46 GMT",
"version": "v2"
}
] | 2023-07-11 | [
[
"Xin",
"Lizhi",
""
],
[
"Xin",
"Kevin",
""
],
[
"Xin",
"Houwen",
""
]
] | Based on Darwin's natural selection, we developed "machine scientists" to discover the laws of nature by learning from raw data. "Machine scientists" construct physical theories by applying a logic tree (state Decision Tree) and a value tree (observation Function Tree); the logical tree determines the state of the enti... |
1602.03966 | Yongkun Li | Pengpeng Zhao, Yongkun Li, Hong Xie, Zhiyong Wu, Yinlong Xu, John C.
S. Lui | Measuring and Maximizing Influence via Random Walk in Social Activity
Networks | 19 pages | null | null | null | cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the popularity of OSNs, finding a set of most influential users (or
nodes) so as to trigger the largest influence cascade is of significance. For
example, companies may take advantage of the "word-of-mouth" effect to trigger
a large cascade of purchases by offering free samples/discounts to those most
influentia... | [
{
"created": "Fri, 12 Feb 2016 05:40:25 GMT",
"version": "v1"
},
{
"created": "Mon, 9 Jan 2017 14:01:32 GMT",
"version": "v2"
}
] | 2017-01-10 | [
[
"Zhao",
"Pengpeng",
""
],
[
"Li",
"Yongkun",
""
],
[
"Xie",
"Hong",
""
],
[
"Wu",
"Zhiyong",
""
],
[
"Xu",
"Yinlong",
""
],
[
"Lui",
"John C. S.",
""
]
] | With the popularity of OSNs, finding a set of most influential users (or nodes) so as to trigger the largest influence cascade is of significance. For example, companies may take advantage of the "word-of-mouth" effect to trigger a large cascade of purchases by offering free samples/discounts to those most influential ... |
1608.06039 | Cl\'ement Maria | Cl\'ement Maria and Steve Oudot | Computing Zigzag Persistent Cohomology | null | null | null | null | cs.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Zigzag persistent homology is a powerful generalisation of persistent
homology that allows one not only to compute persistence diagrams with less
noise and using less memory, but also to use persistence in new fields of
application. However, due to the increase in complexity of the algebraic
treatment of the theory, ... | [
{
"created": "Mon, 22 Aug 2016 03:06:15 GMT",
"version": "v1"
}
] | 2016-08-23 | [
[
"Maria",
"Clément",
""
],
[
"Oudot",
"Steve",
""
]
] | Zigzag persistent homology is a powerful generalisation of persistent homology that allows one not only to compute persistence diagrams with less noise and using less memory, but also to use persistence in new fields of application. However, due to the increase in complexity of the algebraic treatment of the theory, mo... |
2310.02263 | Canwen Xu | Canwen Xu, Corby Rosset, Ethan C. Chau, Luciano Del Corro, Shweti
Mahajan, Julian McAuley, Jennifer Neville, Ahmed Hassan Awadallah, Nikhil Rao | Automatic Pair Construction for Contrastive Post-training | NAACL 2024 (Findings) | null | null | null | cs.CL cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Alignment serves as an important step to steer large language models (LLMs)
towards human preferences. In this paper, we propose an automatic way to
construct contrastive data for LLM, using preference pairs from multiple models
of varying strengths (e.g., InstructGPT, ChatGPT and GPT-4). We compare the
contrastive t... | [
{
"created": "Tue, 3 Oct 2023 17:59:46 GMT",
"version": "v1"
},
{
"created": "Wed, 3 Apr 2024 00:16:19 GMT",
"version": "v2"
}
] | 2024-04-04 | [
[
"Xu",
"Canwen",
""
],
[
"Rosset",
"Corby",
""
],
[
"Chau",
"Ethan C.",
""
],
[
"Del Corro",
"Luciano",
""
],
[
"Mahajan",
"Shweti",
""
],
[
"McAuley",
"Julian",
""
],
[
"Neville",
"Jennifer",
""
],
[
... | Alignment serves as an important step to steer large language models (LLMs) towards human preferences. In this paper, we propose an automatic way to construct contrastive data for LLM, using preference pairs from multiple models of varying strengths (e.g., InstructGPT, ChatGPT and GPT-4). We compare the contrastive tec... |
2107.07167 | Shyh Yaw Jou | Shi-Yao Zhou and Chung-Yen Su | An Efficient and Small Convolutional Neural Network for Pest Recognition
-- ExquisiteNet | 4 pages | null | 10.1109/ECICE50847.2020.9301938 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Nowadays, due to the rapid population expansion, food shortage has become a
critical issue. In order to stabilizing the food source production, preventing
crops from being attacked by pests is very important. In generally, farmers use
pesticides to kill pests, however, improperly using pesticides will also kill
some ... | [
{
"created": "Thu, 15 Jul 2021 07:34:45 GMT",
"version": "v1"
}
] | 2021-07-16 | [
[
"Zhou",
"Shi-Yao",
""
],
[
"Su",
"Chung-Yen",
""
]
] | Nowadays, due to the rapid population expansion, food shortage has become a critical issue. In order to stabilizing the food source production, preventing crops from being attacked by pests is very important. In generally, farmers use pesticides to kill pests, however, improperly using pesticides will also kill some in... |
2310.03320 | Zifeng Wang | Zifeng Wang, Zichen Wang, Balasubramaniam Srinivasan, Vassilis N.
Ioannidis, Huzefa Rangwala, Rishita Anubhai | BioBridge: Bridging Biomedical Foundation Models via Knowledge Graphs | ICLR 2024 | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Foundation models (FMs) are able to leverage large volumes of unlabeled data
to demonstrate superior performance across a wide range of tasks. However, FMs
developed for biomedical domains have largely remained unimodal, i.e.,
independently trained and used for tasks on protein sequences alone, small
molecule structu... | [
{
"created": "Thu, 5 Oct 2023 05:30:42 GMT",
"version": "v1"
},
{
"created": "Thu, 12 Oct 2023 21:38:27 GMT",
"version": "v2"
},
{
"created": "Mon, 30 Oct 2023 20:43:20 GMT",
"version": "v3"
},
{
"created": "Fri, 19 Jan 2024 02:47:51 GMT",
"version": "v4"
}
] | 2024-01-22 | [
[
"Wang",
"Zifeng",
""
],
[
"Wang",
"Zichen",
""
],
[
"Srinivasan",
"Balasubramaniam",
""
],
[
"Ioannidis",
"Vassilis N.",
""
],
[
"Rangwala",
"Huzefa",
""
],
[
"Anubhai",
"Rishita",
""
]
] | Foundation models (FMs) are able to leverage large volumes of unlabeled data to demonstrate superior performance across a wide range of tasks. However, FMs developed for biomedical domains have largely remained unimodal, i.e., independently trained and used for tasks on protein sequences alone, small molecule structure... |
1904.11946 | Mehraneh Liaee | Samuel Haney, Mehraneh Liaee, Bruce M. Maggs, Debmalya Panigrahi,
Rajmohan Rajaraman, and Ravi Sundaram | Retracting Graphs to Cycles | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We initiate the algorithmic study of retracting a graph into a cycle in the
graph, which seeks a mapping of the graph vertices to the cycle vertices, so as
to minimize the maximum stretch of any edge, subject to the constraint that the
restriction of the mapping to the cycle is the identity map. This problem has
its ... | [
{
"created": "Fri, 26 Apr 2019 17:24:27 GMT",
"version": "v1"
}
] | 2019-04-29 | [
[
"Haney",
"Samuel",
""
],
[
"Liaee",
"Mehraneh",
""
],
[
"Maggs",
"Bruce M.",
""
],
[
"Panigrahi",
"Debmalya",
""
],
[
"Rajaraman",
"Rajmohan",
""
],
[
"Sundaram",
"Ravi",
""
]
] | We initiate the algorithmic study of retracting a graph into a cycle in the graph, which seeks a mapping of the graph vertices to the cycle vertices, so as to minimize the maximum stretch of any edge, subject to the constraint that the restriction of the mapping to the cycle is the identity map. This problem has its ro... |
1604.05562 | Veronika Loitzenbauer | Oren Ben-Zwi and Monika Henzinger and Veronika Loitzenbauer | Ad Exchange: Envy-Free Auctions with Mediators | null | null | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Ad exchanges are an emerging platform for trading advertisement slots on the
web with billions of dollars revenue per year. Every time a user visits a web
page, the publisher of that web page can ask an ad exchange to auction off the
ad slots on this page to determine which advertisements are shown at which
price. Du... | [
{
"created": "Tue, 19 Apr 2016 13:34:08 GMT",
"version": "v1"
}
] | 2016-04-20 | [
[
"Ben-Zwi",
"Oren",
""
],
[
"Henzinger",
"Monika",
""
],
[
"Loitzenbauer",
"Veronika",
""
]
] | Ad exchanges are an emerging platform for trading advertisement slots on the web with billions of dollars revenue per year. Every time a user visits a web page, the publisher of that web page can ask an ad exchange to auction off the ad slots on this page to determine which advertisements are shown at which price. Due ... |
2004.07607 | Jeff Hajewski | Jeff Hajewski, Suely Oliveira, and Xiaoyu Xing | Distributed Evolution of Deep Autoencoders | null | null | null | null | cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Autoencoders have seen wide success in domains ranging from feature selection
to information retrieval. Despite this success, designing an autoencoder for a
given task remains a challenging undertaking due to the lack of firm intuition
on how the backing neural network architectures of the encoder and decoder
impact ... | [
{
"created": "Thu, 16 Apr 2020 11:31:18 GMT",
"version": "v1"
}
] | 2020-04-17 | [
[
"Hajewski",
"Jeff",
""
],
[
"Oliveira",
"Suely",
""
],
[
"Xing",
"Xiaoyu",
""
]
] | Autoencoders have seen wide success in domains ranging from feature selection to information retrieval. Despite this success, designing an autoencoder for a given task remains a challenging undertaking due to the lack of firm intuition on how the backing neural network architectures of the encoder and decoder impact th... |
2403.04430 | Bingkun Lai | Bingkun Lai, Jiayi He, Jiawen Kang, Gaolei Li, Minrui Xu, Tao zhang,
Shengli Xie | On-demand Quantization for Green Federated Generative Diffusion in
Mobile Edge Networks | null | null | null | null | cs.LG cs.DC cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Generative Artificial Intelligence (GAI) shows remarkable productivity and
creativity in Mobile Edge Networks, such as the metaverse and the Industrial
Internet of Things. Federated learning is a promising technique for effectively
training GAI models in mobile edge networks due to its data distribution.
However, the... | [
{
"created": "Thu, 7 Mar 2024 12:00:33 GMT",
"version": "v1"
}
] | 2024-03-08 | [
[
"Lai",
"Bingkun",
""
],
[
"He",
"Jiayi",
""
],
[
"Kang",
"Jiawen",
""
],
[
"Li",
"Gaolei",
""
],
[
"Xu",
"Minrui",
""
],
[
"zhang",
"Tao",
""
],
[
"Xie",
"Shengli",
""
]
] | Generative Artificial Intelligence (GAI) shows remarkable productivity and creativity in Mobile Edge Networks, such as the metaverse and the Industrial Internet of Things. Federated learning is a promising technique for effectively training GAI models in mobile edge networks due to its data distribution. However, there... |
1706.03762 | Llion Jones | Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion
Jones, Aidan N. Gomez, Lukasz Kaiser, Illia Polosukhin | Attention Is All You Need | 15 pages, 5 figures | null | null | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The dominant sequence transduction models are based on complex recurrent or
convolutional neural networks in an encoder-decoder configuration. The best
performing models also connect the encoder and decoder through an attention
mechanism. We propose a new simple network architecture, the Transformer, based
solely on ... | [
{
"created": "Mon, 12 Jun 2017 17:57:34 GMT",
"version": "v1"
},
{
"created": "Mon, 19 Jun 2017 16:49:45 GMT",
"version": "v2"
},
{
"created": "Tue, 20 Jun 2017 05:20:02 GMT",
"version": "v3"
},
{
"created": "Fri, 30 Jun 2017 17:29:30 GMT",
"version": "v4"
},
{
"c... | 2023-08-03 | [
[
"Vaswani",
"Ashish",
""
],
[
"Shazeer",
"Noam",
""
],
[
"Parmar",
"Niki",
""
],
[
"Uszkoreit",
"Jakob",
""
],
[
"Jones",
"Llion",
""
],
[
"Gomez",
"Aidan N.",
""
],
[
"Kaiser",
"Lukasz",
""
],
[
"Po... | The dominant sequence transduction models are based on complex recurrent or convolutional neural networks in an encoder-decoder configuration. The best performing models also connect the encoder and decoder through an attention mechanism. We propose a new simple network architecture, the Transformer, based solely on at... |
2212.05122 | Yifan Gong | Yifan Gong, Zheng Zhan, Pu Zhao, Yushu Wu, Chao Wu, Caiwen Ding,
Weiwen Jiang, Minghai Qin, Yanzhi Wang | All-in-One: A Highly Representative DNN Pruning Framework for Edge
Devices with Dynamic Power Management | null | null | null | null | cs.LG cs.AI cs.CV | http://creativecommons.org/licenses/by/4.0/ | During the deployment of deep neural networks (DNNs) on edge devices, many
research efforts are devoted to the limited hardware resource. However, little
attention is paid to the influence of dynamic power management. As edge devices
typically only have a budget of energy with batteries (rather than almost
unlimited ... | [
{
"created": "Fri, 9 Dec 2022 21:30:52 GMT",
"version": "v1"
}
] | 2022-12-13 | [
[
"Gong",
"Yifan",
""
],
[
"Zhan",
"Zheng",
""
],
[
"Zhao",
"Pu",
""
],
[
"Wu",
"Yushu",
""
],
[
"Wu",
"Chao",
""
],
[
"Ding",
"Caiwen",
""
],
[
"Jiang",
"Weiwen",
""
],
[
"Qin",
"Minghai",
""... | During the deployment of deep neural networks (DNNs) on edge devices, many research efforts are devoted to the limited hardware resource. However, little attention is paid to the influence of dynamic power management. As edge devices typically only have a budget of energy with batteries (rather than almost unlimited en... |
1906.04913 | Wei Wang | Wei Wang, Kaicheng Yu, Joachim Hugonot, Pascal Fua and Mathieu
Salzmann | Recurrent U-Net for Resource-Constrained Segmentation | arXiv admin note: substantial text overlap with arXiv:1811.10914 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | State-of-the-art segmentation methods rely on very deep networks that are not
always easy to train without very large training datasets and tend to be
relatively slow to run on standard GPUs. In this paper, we introduce a novel
recurrent U-Net architecture that preserves the compactness of the original
U-Net, while s... | [
{
"created": "Tue, 11 Jun 2019 17:52:30 GMT",
"version": "v1"
}
] | 2019-06-13 | [
[
"Wang",
"Wei",
""
],
[
"Yu",
"Kaicheng",
""
],
[
"Hugonot",
"Joachim",
""
],
[
"Fua",
"Pascal",
""
],
[
"Salzmann",
"Mathieu",
""
]
] | State-of-the-art segmentation methods rely on very deep networks that are not always easy to train without very large training datasets and tend to be relatively slow to run on standard GPUs. In this paper, we introduce a novel recurrent U-Net architecture that preserves the compactness of the original U-Net, while sub... |
1301.3557 | Matthew Zeiler | Matthew D. Zeiler and Rob Fergus | Stochastic Pooling for Regularization of Deep Convolutional Neural
Networks | 9 pages | null | null | null | cs.LG cs.NE stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce a simple and effective method for regularizing large
convolutional neural networks. We replace the conventional deterministic
pooling operations with a stochastic procedure, randomly picking the activation
within each pooling region according to a multinomial distribution, given by
the activities within ... | [
{
"created": "Wed, 16 Jan 2013 02:12:07 GMT",
"version": "v1"
}
] | 2013-01-17 | [
[
"Zeiler",
"Matthew D.",
""
],
[
"Fergus",
"Rob",
""
]
] | We introduce a simple and effective method for regularizing large convolutional neural networks. We replace the conventional deterministic pooling operations with a stochastic procedure, randomly picking the activation within each pooling region according to a multinomial distribution, given by the activities within th... |
2212.08067 | Yufan Ren | Yufan Ren, Fangjinhua Wang, Tong Zhang, Marc Pollefeys and Sabine
S\"usstrunk | VolRecon: Volume Rendering of Signed Ray Distance Functions for
Generalizable Multi-View Reconstruction | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The success of the Neural Radiance Fields (NeRF) in novel view synthesis has
inspired researchers to propose neural implicit scene reconstruction. However,
most existing neural implicit reconstruction methods optimize per-scene
parameters and therefore lack generalizability to new scenes. We introduce
VolRecon, a nov... | [
{
"created": "Thu, 15 Dec 2022 18:59:54 GMT",
"version": "v1"
},
{
"created": "Mon, 3 Apr 2023 06:54:50 GMT",
"version": "v2"
}
] | 2023-04-04 | [
[
"Ren",
"Yufan",
""
],
[
"Wang",
"Fangjinhua",
""
],
[
"Zhang",
"Tong",
""
],
[
"Pollefeys",
"Marc",
""
],
[
"Süsstrunk",
"Sabine",
""
]
] | The success of the Neural Radiance Fields (NeRF) in novel view synthesis has inspired researchers to propose neural implicit scene reconstruction. However, most existing neural implicit reconstruction methods optimize per-scene parameters and therefore lack generalizability to new scenes. We introduce VolRecon, a novel... |
0809.4484 | Lane A. Hemaspaandra | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Joerg
Rothe | Llull and Copeland Voting Computationally Resist Bribery and Control | This 2008/9/28 version is the same as both the 2008/9/25 version at
arxiv.org and the 2008/9/25 revision of URCS TR-2008-933, except the present
version corrects a minor typo in the penultimate paragraph of Section 3 | null | null | URCS-TR-2008-933 | cs.GT cs.CC cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The only systems previously known to be resistant to all the standard control
types were highly artificial election systems created by hybridization. We
study a parameterized version of Copeland voting, denoted by Copeland^\alpha,
where the parameter \alpha is a rational number between 0 and 1 that specifies
how ties... | [
{
"created": "Thu, 25 Sep 2008 19:49:38 GMT",
"version": "v1"
},
{
"created": "Sun, 28 Sep 2008 04:25:35 GMT",
"version": "v2"
}
] | 2008-09-29 | [
[
"Faliszewski",
"Piotr",
""
],
[
"Hemaspaandra",
"Edith",
""
],
[
"Hemaspaandra",
"Lane A.",
""
],
[
"Rothe",
"Joerg",
""
]
] | The only systems previously known to be resistant to all the standard control types were highly artificial election systems created by hybridization. We study a parameterized version of Copeland voting, denoted by Copeland^\alpha, where the parameter \alpha is a rational number between 0 and 1 that specifies how ties a... |
2404.01727 | Haoxiang Ma | Haoxiang Ma, Modi Shi, Boyang Gao, Di Huang | Generalizing 6-DoF Grasp Detection via Domain Prior Knowledge | Accepted at CVPR 2024 | null | null | null | cs.RO cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We focus on the generalization ability of the 6-DoF grasp detection method in
this paper. While learning-based grasp detection methods can predict grasp
poses for unseen objects using the grasp distribution learned from the training
set, they often exhibit a significant performance drop when encountering
objects with... | [
{
"created": "Tue, 2 Apr 2024 08:33:21 GMT",
"version": "v1"
}
] | 2024-04-03 | [
[
"Ma",
"Haoxiang",
""
],
[
"Shi",
"Modi",
""
],
[
"Gao",
"Boyang",
""
],
[
"Huang",
"Di",
""
]
] | We focus on the generalization ability of the 6-DoF grasp detection method in this paper. While learning-based grasp detection methods can predict grasp poses for unseen objects using the grasp distribution learned from the training set, they often exhibit a significant performance drop when encountering objects with d... |
1907.12956 | Shervin Minaee | Shervin Minaee, Elham Azimi, Amirali Abdolrashidi | FingerNet: Pushing The Limits of Fingerprint Recognition Using
Convolutional Neural Network | arXiv admin note: substantial text overlap with arXiv:1907.09380 | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Fingerprint recognition has been utilized for cellphone authentication,
airport security and beyond. Many different features and algorithms have been
proposed to improve fingerprint recognition. In this paper, we propose an
end-to-end deep learning framework for fingerprint recognition using
convolutional neural netw... | [
{
"created": "Sun, 28 Jul 2019 21:00:56 GMT",
"version": "v1"
}
] | 2019-07-31 | [
[
"Minaee",
"Shervin",
""
],
[
"Azimi",
"Elham",
""
],
[
"Abdolrashidi",
"Amirali",
""
]
] | Fingerprint recognition has been utilized for cellphone authentication, airport security and beyond. Many different features and algorithms have been proposed to improve fingerprint recognition. In this paper, we propose an end-to-end deep learning framework for fingerprint recognition using convolutional neural networ... |
2110.14708 | Cheng Zhang | Chao Ma and Cheng Zhang | Identifiable Generative Models for Missing Not at Random Data Imputation | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Real-world datasets often have missing values associated with complex
generative processes, where the cause of the missingness may not be fully
observed. This is known as missing not at random (MNAR) data. However, many
imputation methods do not take into account the missingness mechanism,
resulting in biased imputat... | [
{
"created": "Wed, 27 Oct 2021 18:51:38 GMT",
"version": "v1"
}
] | 2021-10-29 | [
[
"Ma",
"Chao",
""
],
[
"Zhang",
"Cheng",
""
]
] | Real-world datasets often have missing values associated with complex generative processes, where the cause of the missingness may not be fully observed. This is known as missing not at random (MNAR) data. However, many imputation methods do not take into account the missingness mechanism, resulting in biased imputatio... |
2009.01497 | Gregor Stefan Bankhamer | Gregor Bankhamer, Robert Els\"asser, Stefan Schmid | Local Fast Rerouting with Low Congestion: A Randomized Approach | null | null | 10.1109/ICNP.2019.8888087 | null | cs.NI cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Most modern communication networks include fast rerouting mechanisms,
implemented entirely in the data plane, to quickly recover connectivity after
link failures. By relying on local failure information only, these data plane
mechanisms provide very fast reaction times, but at the same time introduce an
algorithmic c... | [
{
"created": "Thu, 3 Sep 2020 07:45:34 GMT",
"version": "v1"
},
{
"created": "Thu, 5 May 2022 12:44:56 GMT",
"version": "v2"
}
] | 2022-05-06 | [
[
"Bankhamer",
"Gregor",
""
],
[
"Elsässer",
"Robert",
""
],
[
"Schmid",
"Stefan",
""
]
] | Most modern communication networks include fast rerouting mechanisms, implemented entirely in the data plane, to quickly recover connectivity after link failures. By relying on local failure information only, these data plane mechanisms provide very fast reaction times, but at the same time introduce an algorithmic cha... |
2303.11668 | Yongjin Jeon | Yongjin Jeon, Youngtack Oh, Doyoung Jeong, Hyunguk Choi, Junsik Kim | Focus or Not: A Baseline for Anomaly Event Detection On the Open Public
Places with Satellite Images | I am withdrawing my submission due to issues with content
modification | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In recent years, monitoring the world wide area with satellite images has
been emerged as an important issue.
Site monitoring task can be divided into two independent tasks; 1) Change
Detection and 2) Anomaly Event Detection.
Unlike to change detection research is actively conducted based on the
numerous datasets... | [
{
"created": "Tue, 21 Mar 2023 08:23:05 GMT",
"version": "v1"
},
{
"created": "Wed, 5 Apr 2023 02:39:39 GMT",
"version": "v2"
}
] | 2023-04-06 | [
[
"Jeon",
"Yongjin",
""
],
[
"Oh",
"Youngtack",
""
],
[
"Jeong",
"Doyoung",
""
],
[
"Choi",
"Hyunguk",
""
],
[
"Kim",
"Junsik",
""
]
] | In recent years, monitoring the world wide area with satellite images has been emerged as an important issue. Site monitoring task can be divided into two independent tasks; 1) Change Detection and 2) Anomaly Event Detection. Unlike to change detection research is actively conducted based on the numerous datasets(\eg L... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.