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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2305.06185 | Chidi Agbo | Chidi Agbo, Hoda Mehrpouyan | Conflict Analysis and Resolution of Safety and Security Boundary
Conditions for Industrial Control Systems | 12 pages, 10 figures, 2022 6th International Conference on System
Reliability and Safety (ICSRS)|978-1-6654-7092-6 @IEEE | null | 10.1109/ICSRS56243.2022.10067393 | null | cs.CR | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Safety and security are the two most important properties of industrial
control systems (ICS), and their integration is necessary to ensure that safety
goals do not undermine security goals and vice versa. Sometimes, safety and
security co-engineering leads to conflicting requirements or violations capable
of impacti... | [
{
"created": "Wed, 10 May 2023 14:16:49 GMT",
"version": "v1"
}
] | 2023-05-11 | [
[
"Agbo",
"Chidi",
""
],
[
"Mehrpouyan",
"Hoda",
""
]
] | Safety and security are the two most important properties of industrial control systems (ICS), and their integration is necessary to ensure that safety goals do not undermine security goals and vice versa. Sometimes, safety and security co-engineering leads to conflicting requirements or violations capable of impacting... |
cs/0504044 | Richard McClatchey | Michael Thomas, Conrad Steenberg, Frank van Lingen, Harvey Newman,
Julian Bunn, Arshad Ali, Richard McClatchey, Ashiq Anjum, Tahir Azim, Waqas
ur Rehman, Faisal Khan, Jang Uk In | JClarens: A Java Framework for Developing and Deploying Web Services for
Grid Computing | 8 pages, 4 figures. Paper at the 3rd IEEE International Conference on
Web Services (ICWS05). Florida, USA. July 2005 | null | null | null | cs.DC | null | High Energy Physics (HEP) and other scientific communities have adopted
Service Oriented Architectures (SOA) as part of a larger Grid computing effort.
This effort involves the integration of many legacy applications and
programming libraries into a SOA framework. The Grid Analysis Environment (GAE)
is such a service... | [
{
"created": "Mon, 11 Apr 2005 21:45:07 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Thomas",
"Michael",
""
],
[
"Steenberg",
"Conrad",
""
],
[
"van Lingen",
"Frank",
""
],
[
"Newman",
"Harvey",
""
],
[
"Bunn",
"Julian",
""
],
[
"Ali",
"Arshad",
""
],
[
"McClatchey",
"Richard",
""
],
[... | High Energy Physics (HEP) and other scientific communities have adopted Service Oriented Architectures (SOA) as part of a larger Grid computing effort. This effort involves the integration of many legacy applications and programming libraries into a SOA framework. The Grid Analysis Environment (GAE) is such a service o... |
1409.5872 | Peter Schrammel | Peter Schrammel, Daniel Kroening, Martin Brain, Ruben Martins, Tino
Teige, Tom Bienm\"uller | Incremental Bounded Model Checking for Embedded Software (extended
version) | extended version of paper submitted to EMSOFT'14 | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Program analysis is on the brink of mainstream in embedded systems
development. Formal verification of behavioural requirements, finding runtime
errors and automated test case generation are some of the most common
applications of automated verification tools based on Bounded Model Checking.
Existing industrial tools... | [
{
"created": "Sat, 20 Sep 2014 09:14:04 GMT",
"version": "v1"
}
] | 2014-09-23 | [
[
"Schrammel",
"Peter",
""
],
[
"Kroening",
"Daniel",
""
],
[
"Brain",
"Martin",
""
],
[
"Martins",
"Ruben",
""
],
[
"Teige",
"Tino",
""
],
[
"Bienmüller",
"Tom",
""
]
] | Program analysis is on the brink of mainstream in embedded systems development. Formal verification of behavioural requirements, finding runtime errors and automated test case generation are some of the most common applications of automated verification tools based on Bounded Model Checking. Existing industrial tools f... |
2110.03522 | Jules Leguy | Jules Leguy, Thomas Cauchy, Beatrice Duval, Benoit Da Mota | Surrogate-Based Black-Box Optimization Method for Costly Molecular
Properties | Submitted to ICTAI 2021 | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by-nc-nd/4.0/ | AI-assisted molecular optimization is a very active research field as it is
expected to provide the next-generation drugs and molecular materials. An
important difficulty is that the properties to be optimized rely on costly
evaluations. Machine learning methods are investigated with success to predict
these properti... | [
{
"created": "Fri, 1 Oct 2021 15:28:15 GMT",
"version": "v1"
}
] | 2021-10-08 | [
[
"Leguy",
"Jules",
""
],
[
"Cauchy",
"Thomas",
""
],
[
"Duval",
"Beatrice",
""
],
[
"Da Mota",
"Benoit",
""
]
] | AI-assisted molecular optimization is a very active research field as it is expected to provide the next-generation drugs and molecular materials. An important difficulty is that the properties to be optimized rely on costly evaluations. Machine learning methods are investigated with success to predict these properties... |
1610.08597 | Sanjaya Wijeratne | Sanjaya Wijeratne, Lakshika Balasuriya, Derek Doran, Amit Sheth | Word Embeddings to Enhance Twitter Gang Member Profile Identification | 7 pages, 1 figure, 2 tables, Published at IJCAI Workshop on Semantic
Machine Learning (SML 2016) | IJCAI Workshop on Semantic Machine Learning (SML 2016). pp. 18-24.
CEUR-WS, New York City, NY (07 2016) | null | null | cs.SI cs.CL cs.CY cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Gang affiliates have joined the masses who use social media to share thoughts
and actions publicly. Interestingly, they use this public medium to express
recent illegal actions, to intimidate others, and to share outrageous images
and statements. Agencies able to unearth these profiles may thus be able to
anticipate,... | [
{
"created": "Thu, 27 Oct 2016 03:21:49 GMT",
"version": "v1"
}
] | 2016-10-28 | [
[
"Wijeratne",
"Sanjaya",
""
],
[
"Balasuriya",
"Lakshika",
""
],
[
"Doran",
"Derek",
""
],
[
"Sheth",
"Amit",
""
]
] | Gang affiliates have joined the masses who use social media to share thoughts and actions publicly. Interestingly, they use this public medium to express recent illegal actions, to intimidate others, and to share outrageous images and statements. Agencies able to unearth these profiles may thus be able to anticipate, s... |
1206.6030 | Sundararajan Sellamanickam | Sundararajan Sellamanickam, Shirish Shevade | An Additive Model View to Sparse Gaussian Process Classifier Design | 14 pages, 3 figures | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the problem of designing a sparse Gaussian process classifier
(SGPC) that generalizes well. Viewing SGPC design as constructing an additive
model like in boosting, we present an efficient and effective SGPC design
method to perform a stage-wise optimization of a predictive loss function. We
introduce new ... | [
{
"created": "Tue, 26 Jun 2012 15:58:21 GMT",
"version": "v1"
}
] | 2012-06-27 | [
[
"Sellamanickam",
"Sundararajan",
""
],
[
"Shevade",
"Shirish",
""
]
] | We consider the problem of designing a sparse Gaussian process classifier (SGPC) that generalizes well. Viewing SGPC design as constructing an additive model like in boosting, we present an efficient and effective SGPC design method to perform a stage-wise optimization of a predictive loss function. We introduce new me... |
2405.04095 | Yiling He | Yiling He, Junchi Lei, Zhan Qin and Kui Ren | DREAM: Combating Concept Drift with Explanatory Detection and Adaptation
in Malware Classification | null | null | null | null | cs.CR cs.AI | http://creativecommons.org/licenses/by-sa/4.0/ | Deep learning-based malware classifiers face significant challenges due to
concept drift. The rapid evolution of malware, especially with new families,
can depress classification accuracy to near-random levels. Previous research
has primarily focused on detecting drift samples, relying on expert-led
analysis and labe... | [
{
"created": "Tue, 7 May 2024 07:55:45 GMT",
"version": "v1"
},
{
"created": "Thu, 8 Aug 2024 05:45:56 GMT",
"version": "v2"
}
] | 2024-08-09 | [
[
"He",
"Yiling",
""
],
[
"Lei",
"Junchi",
""
],
[
"Qin",
"Zhan",
""
],
[
"Ren",
"Kui",
""
]
] | Deep learning-based malware classifiers face significant challenges due to concept drift. The rapid evolution of malware, especially with new families, can depress classification accuracy to near-random levels. Previous research has primarily focused on detecting drift samples, relying on expert-led analysis and labeli... |
2012.02516 | Patrick Esser | Patrick Esser and Robin Rombach and Bj\"orn Ommer | A Note on Data Biases in Generative Models | Extended Abstract for the NeurIPS 2020 Workshop on Machine Learning
for Creativity and Design | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | It is tempting to think that machines are less prone to unfairness and
prejudice. However, machine learning approaches compute their outputs based on
data. While biases can enter at any stage of the development pipeline, models
are particularly receptive to mirror biases of the datasets they are trained on
and theref... | [
{
"created": "Fri, 4 Dec 2020 10:46:37 GMT",
"version": "v1"
}
] | 2020-12-07 | [
[
"Esser",
"Patrick",
""
],
[
"Rombach",
"Robin",
""
],
[
"Ommer",
"Björn",
""
]
] | It is tempting to think that machines are less prone to unfairness and prejudice. However, machine learning approaches compute their outputs based on data. While biases can enter at any stage of the development pipeline, models are particularly receptive to mirror biases of the datasets they are trained on and therefor... |
2001.08014 | Hongyu Jin | Hongyu Jin and Mohammad Khodaei and Panos Papadimitratos | Security and Privacy in Vehicular Social Networks | A chapter for the book "Vehicular Social Networks" | A. M. Vegni, V. Loscr\`i, and A. V. Vasilakos, Eds. CRC Press,
Taylor & Francis Group, March 2017 | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We surveyed and presented the state-of-the-art VC systems, security and
privacy architectures and technologies, emphasizing on security and privacy
challenges and their solutions for P2P interactions in VSNs towards
standardization and deployment. We note that beyond safety applications that
have drawn a lot of atten... | [
{
"created": "Wed, 22 Jan 2020 13:49:23 GMT",
"version": "v1"
}
] | 2020-01-23 | [
[
"Jin",
"Hongyu",
""
],
[
"Khodaei",
"Mohammad",
""
],
[
"Papadimitratos",
"Panos",
""
]
] | We surveyed and presented the state-of-the-art VC systems, security and privacy architectures and technologies, emphasizing on security and privacy challenges and their solutions for P2P interactions in VSNs towards standardization and deployment. We note that beyond safety applications that have drawn a lot of attenti... |
2312.04590 | Alexander Ziller | Alexander Ziller, Tamara T. Mueller, Simon Stieger, Leonhard Feiner,
Johannes Brandt, Rickmer Braren, Daniel Rueckert, Georgios Kaissis | Reconciling AI Performance and Data Reconstruction Resilience for
Medical Imaging | null | null | null | null | cs.CR cs.AI cs.CV cs.LG | http://creativecommons.org/licenses/by/4.0/ | Artificial Intelligence (AI) models are vulnerable to information leakage of
their training data, which can be highly sensitive, for example in medical
imaging. Privacy Enhancing Technologies (PETs), such as Differential Privacy
(DP), aim to circumvent these susceptibilities. DP is the strongest possible
protection f... | [
{
"created": "Tue, 5 Dec 2023 12:21:30 GMT",
"version": "v1"
}
] | 2023-12-11 | [
[
"Ziller",
"Alexander",
""
],
[
"Mueller",
"Tamara T.",
""
],
[
"Stieger",
"Simon",
""
],
[
"Feiner",
"Leonhard",
""
],
[
"Brandt",
"Johannes",
""
],
[
"Braren",
"Rickmer",
""
],
[
"Rueckert",
"Daniel",
""
... | Artificial Intelligence (AI) models are vulnerable to information leakage of their training data, which can be highly sensitive, for example in medical imaging. Privacy Enhancing Technologies (PETs), such as Differential Privacy (DP), aim to circumvent these susceptibilities. DP is the strongest possible protection for... |
2210.13024 | Martin Lentschat | Puthineath Lay, Martin Lentschat and Cyril Labb\'e | Investigating the detection of Tortured Phrases in Scientific Literature | null | null | null | null | cs.CL cs.IR | http://creativecommons.org/licenses/by-nc-sa/4.0/ | With the help of online tools, unscrupulous authors can today generate a
pseudo-scientific article and attempt to publish it. Some of these tools work
by replacing or paraphrasing existing texts to produce new content, but they
have a tendency to generate nonsensical expressions. A recent study introduced
the concept... | [
{
"created": "Mon, 24 Oct 2022 08:15:22 GMT",
"version": "v1"
}
] | 2022-10-25 | [
[
"Lay",
"Puthineath",
""
],
[
"Lentschat",
"Martin",
""
],
[
"Labbé",
"Cyril",
""
]
] | With the help of online tools, unscrupulous authors can today generate a pseudo-scientific article and attempt to publish it. Some of these tools work by replacing or paraphrasing existing texts to produce new content, but they have a tendency to generate nonsensical expressions. A recent study introduced the concept o... |
1308.3136 | Richard Preen | Richard J. Preen and Larry Bull | Toward the Coevolution of Novel Vertical-Axis Wind Turbines | appears in IEEE Transactions on Evolutionary Computation (2014).
arXiv admin note: substantial text overlap with arXiv:1212.5271,
arXiv:1204.4107 | IEEE Transactions on Evolutionary Computation (2015),
19(2):284-294 | 10.1109/TEVC.2014.2316199 | null | cs.NE cs.AI cs.CE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The production of renewable and sustainable energy is one of the most
important challenges currently facing mankind. Wind has made an increasing
contribution to the world's energy supply mix, but still remains a long way
from reaching its full potential. In this paper, we investigate the use of
artificial evolution t... | [
{
"created": "Tue, 13 Aug 2013 14:02:34 GMT",
"version": "v1"
},
{
"created": "Thu, 15 Jan 2015 16:25:33 GMT",
"version": "v2"
}
] | 2015-07-02 | [
[
"Preen",
"Richard J.",
""
],
[
"Bull",
"Larry",
""
]
] | The production of renewable and sustainable energy is one of the most important challenges currently facing mankind. Wind has made an increasing contribution to the world's energy supply mix, but still remains a long way from reaching its full potential. In this paper, we investigate the use of artificial evolution to ... |
2208.11885 | Melissa Swift | Melissa E. Swift (1 and 2), Wyatt Ayers (1), Sophie Pallanck (1),
Scott Wehrwein (1) ((1) Western Washington University, (2) Pacific Northwest
National Laboratory) | Visualizing the Passage of Time with Video Temporal Pyramids | 11 pages, 9 figures, accepted for presentation at IEEE VIS 2022, will
be published in conference proceedings, supplementary material and more can
be found on our project page at
https://fw.cs.wwu.edu/~wehrwes/TemporalPyramids | null | 10.1109/TVCG.2022.3209454 | null | cs.CV eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | What can we learn about a scene by watching it for months or years? A video
recorded over a long timespan will depict interesting phenomena at multiple
timescales, but identifying and viewing them presents a challenge. The video is
too long to watch in full, and some occurrences are too slow to experience in
real-tim... | [
{
"created": "Thu, 25 Aug 2022 06:19:02 GMT",
"version": "v1"
}
] | 2023-05-02 | [
[
"Swift",
"Melissa E.",
"",
"1 and 2"
],
[
"Ayers",
"Wyatt",
""
],
[
"Pallanck",
"Sophie",
""
],
[
"Wehrwein",
"Scott",
""
]
] | What can we learn about a scene by watching it for months or years? A video recorded over a long timespan will depict interesting phenomena at multiple timescales, but identifying and viewing them presents a challenge. The video is too long to watch in full, and some occurrences are too slow to experience in real-time,... |
1810.05716 | Yanting Pei | Yanting Pei, Yaping Huang, Qi Zou, Yuhang Lu and Song Wang | Does Haze Removal Help CNN-based Image Classification? | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Hazy images are common in real scenarios and many dehazing methods have been
developed to automatically remove the haze from images. Typically, the goal of
image dehazing is to produce clearer images from which human vision can better
identify the object and structural details present in the images. When the
ground-t... | [
{
"created": "Fri, 12 Oct 2018 20:46:29 GMT",
"version": "v1"
}
] | 2018-10-16 | [
[
"Pei",
"Yanting",
""
],
[
"Huang",
"Yaping",
""
],
[
"Zou",
"Qi",
""
],
[
"Lu",
"Yuhang",
""
],
[
"Wang",
"Song",
""
]
] | Hazy images are common in real scenarios and many dehazing methods have been developed to automatically remove the haze from images. Typically, the goal of image dehazing is to produce clearer images from which human vision can better identify the object and structural details present in the images. When the ground-tru... |
1905.02025 | Grigorios Kalliatakis | Grigorios Kalliatakis, Shoaib Ehsan, Maria Fasli, Klaus McDonald-Maier | DisplaceNet: Recognising Displaced People from Images by Exploiting
Dominance Level | To be published in CVPR Workshop on Computer Vision for Global
Challenges (CV4GC). arXiv admin note: substantial text overlap with
arXiv:1902.03817 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Every year millions of men, women and children are forced to leave their
homes and seek refuge from wars, human rights violations, persecution, and
natural disasters. The number of forcibly displaced people came at a record
rate of 44,400 every day throughout 2017, raising the cumulative total to 68.5
million at the ... | [
{
"created": "Fri, 3 May 2019 11:07:27 GMT",
"version": "v1"
}
] | 2019-05-07 | [
[
"Kalliatakis",
"Grigorios",
""
],
[
"Ehsan",
"Shoaib",
""
],
[
"Fasli",
"Maria",
""
],
[
"McDonald-Maier",
"Klaus",
""
]
] | Every year millions of men, women and children are forced to leave their homes and seek refuge from wars, human rights violations, persecution, and natural disasters. The number of forcibly displaced people came at a record rate of 44,400 every day throughout 2017, raising the cumulative total to 68.5 million at the ye... |
2208.02885 | Zilin Si | Zilin Si, Zirui Zhu, Arpit Agarwal, Stuart Anderson and Wenzhen Yuan | Grasp Stability Prediction with Sim-to-Real Transfer from Tactile
Sensing | null | null | null | null | cs.RO | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Robot simulation has been an essential tool for data-driven manipulation
tasks. However, most existing simulation frameworks lack either efficient and
accurate models of physical interactions with tactile sensors or realistic
tactile simulation. This makes the sim-to-real transfer for tactile-based
manipulation tasks... | [
{
"created": "Thu, 4 Aug 2022 20:55:09 GMT",
"version": "v1"
}
] | 2022-08-08 | [
[
"Si",
"Zilin",
""
],
[
"Zhu",
"Zirui",
""
],
[
"Agarwal",
"Arpit",
""
],
[
"Anderson",
"Stuart",
""
],
[
"Yuan",
"Wenzhen",
""
]
] | Robot simulation has been an essential tool for data-driven manipulation tasks. However, most existing simulation frameworks lack either efficient and accurate models of physical interactions with tactile sensors or realistic tactile simulation. This makes the sim-to-real transfer for tactile-based manipulation tasks s... |
1907.02703 | Yong Min | Yong Min, Tingjun Jiang, Cheng Jin, Qu Li and Xiaogang Jin | Intelligent social bots uncover the link between user preference and
diversity of news consumption | The refined manuscript is under review in Royal Society Open Science | Roy. Soc. Open Sci. 6 (2019) 190868 | 10.1098/rsos.190868 | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The boom of online social media and microblogging platforms has rapidly alter
the way we consume news and exchange opinions. Even though considerable efforts
try to recommend various contents to users, loss of information diversity and
the polarization of interest groups are still an enormous challenge for
industry a... | [
{
"created": "Fri, 5 Jul 2019 07:20:48 GMT",
"version": "v1"
}
] | 2020-03-05 | [
[
"Min",
"Yong",
""
],
[
"Jiang",
"Tingjun",
""
],
[
"Jin",
"Cheng",
""
],
[
"Li",
"Qu",
""
],
[
"Jin",
"Xiaogang",
""
]
] | The boom of online social media and microblogging platforms has rapidly alter the way we consume news and exchange opinions. Even though considerable efforts try to recommend various contents to users, loss of information diversity and the polarization of interest groups are still an enormous challenge for industry and... |
1906.00284 | Ehsan Aryafar | Ehsan Aryafar, Alireza Keshavarz-Haddad, Carlee Joe-Wong | Proportional Fair RAT Aggregation in HetNets | Extended version of the 31st International Teletraffic Congress (ITC
2019) conference paper | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Heterogeneity in wireless network architectures (i.e., the coexistence of 3G,
LTE, 5G, WiFi, etc.) has become a key component of current and future
generation cellular networks. Simultaneous aggregation of each client's traffic
across multiple such radio access technologies (RATs) / base stations (BSs) can
significan... | [
{
"created": "Sat, 1 Jun 2019 20:22:14 GMT",
"version": "v1"
}
] | 2019-06-04 | [
[
"Aryafar",
"Ehsan",
""
],
[
"Keshavarz-Haddad",
"Alireza",
""
],
[
"Joe-Wong",
"Carlee",
""
]
] | Heterogeneity in wireless network architectures (i.e., the coexistence of 3G, LTE, 5G, WiFi, etc.) has become a key component of current and future generation cellular networks. Simultaneous aggregation of each client's traffic across multiple such radio access technologies (RATs) / base stations (BSs) can significantl... |
2101.06409 | Ashish Kumar | Ashish Kumar, L. Behera | Shape Back-Projection In 3D Scenes | 7 pages, 7 figures, 3 tables | null | null | null | cs.CV cs.RO | http://creativecommons.org/licenses/by-sa/4.0/ | In this work, we propose a novel framework shape back-projection for
computationally efficient point cloud processing in a probabilistic manner. The
primary component of the technique is shape histogram and a back-projection
procedure. The technique measures similarity between 3D surfaces, by analyzing
their geometri... | [
{
"created": "Sat, 16 Jan 2021 09:00:34 GMT",
"version": "v1"
}
] | 2021-01-19 | [
[
"Kumar",
"Ashish",
""
],
[
"Behera",
"L.",
""
]
] | In this work, we propose a novel framework shape back-projection for computationally efficient point cloud processing in a probabilistic manner. The primary component of the technique is shape histogram and a back-projection procedure. The technique measures similarity between 3D surfaces, by analyzing their geometrica... |
2205.14280 | Li Niu | Li Niu, Qingyang Liu, Zhenchen Liu, Jiangtong Li | Fast Object Placement Assessment | null | null | null | null | cs.CV | http://creativecommons.org/publicdomain/zero/1.0/ | Object placement assessment (OPA) aims to predict the rationality score of a
composite image in terms of the placement (e.g., scale, location) of inserted
foreground object. However, given a pair of scaled foreground and background,
to enumerate all the reasonable locations, existing OPA model needs to place
the fore... | [
{
"created": "Sat, 28 May 2022 00:28:32 GMT",
"version": "v1"
}
] | 2022-05-31 | [
[
"Niu",
"Li",
""
],
[
"Liu",
"Qingyang",
""
],
[
"Liu",
"Zhenchen",
""
],
[
"Li",
"Jiangtong",
""
]
] | Object placement assessment (OPA) aims to predict the rationality score of a composite image in terms of the placement (e.g., scale, location) of inserted foreground object. However, given a pair of scaled foreground and background, to enumerate all the reasonable locations, existing OPA model needs to place the foregr... |
2405.06652 | Yuhongmo Mo | Yuhong Mo, Hao Qin, Yushan Dong, Ziyi Zhu, Zhenglin Li | Large Language Model (LLM) AI text generation detection based on
transformer deep learning algorithm | 6 pages | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, a tool for detecting LLM AI text generation is developed based
on the Transformer model, aiming to improve the accuracy of AI text generation
detection and provide reference for subsequent research. Firstly the text is
Unicode normalised, converted to lowercase form, characters other than
non-alphabeti... | [
{
"created": "Sat, 6 Apr 2024 06:22:45 GMT",
"version": "v1"
}
] | 2024-05-14 | [
[
"Mo",
"Yuhong",
""
],
[
"Qin",
"Hao",
""
],
[
"Dong",
"Yushan",
""
],
[
"Zhu",
"Ziyi",
""
],
[
"Li",
"Zhenglin",
""
]
] | In this paper, a tool for detecting LLM AI text generation is developed based on the Transformer model, aiming to improve the accuracy of AI text generation detection and provide reference for subsequent research. Firstly the text is Unicode normalised, converted to lowercase form, characters other than non-alphabetic ... |
2112.01330 | Moein Sorkhei | Moein Sorkhei, Yue Liu, Hossein Azizpour, Edward Azavedo, Karin
Dembrower, Dimitra Ntoula, Athanasios Zouzos, Fredrik Strand, Kevin Smith | CSAW-M: An Ordinal Classification Dataset for Benchmarking Mammographic
Masking of Cancer | 35th Conference on Neural Information Processing Systems (NeurIPS
2021) Track on Datasets and Benchmarks | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Interval and large invasive breast cancers, which are associated with worse
prognosis than other cancers, are usually detected at a late stage due to false
negative assessments of screening mammograms. The missed screening-time
detection is commonly caused by the tumor being obscured by its surrounding
breast tissues... | [
{
"created": "Thu, 2 Dec 2021 15:31:51 GMT",
"version": "v1"
}
] | 2021-12-03 | [
[
"Sorkhei",
"Moein",
""
],
[
"Liu",
"Yue",
""
],
[
"Azizpour",
"Hossein",
""
],
[
"Azavedo",
"Edward",
""
],
[
"Dembrower",
"Karin",
""
],
[
"Ntoula",
"Dimitra",
""
],
[
"Zouzos",
"Athanasios",
""
],
[
... | Interval and large invasive breast cancers, which are associated with worse prognosis than other cancers, are usually detected at a late stage due to false negative assessments of screening mammograms. The missed screening-time detection is commonly caused by the tumor being obscured by its surrounding breast tissues, ... |
2311.07761 | Maximilian Luz | Maximilian Luz, Rohit Mohan, Ahmed Rida Sekkat, Oliver Sawade, Elmar
Matthes, Thomas Brox, Abhinav Valada | Amodal Optical Flow | null | null | null | null | cs.CV cs.AI cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Optical flow estimation is very challenging in situations with transparent or
occluded objects. In this work, we address these challenges at the task level
by introducing Amodal Optical Flow, which integrates optical flow with amodal
perception. Instead of only representing the visible regions, we define amodal
optic... | [
{
"created": "Mon, 13 Nov 2023 21:21:43 GMT",
"version": "v1"
},
{
"created": "Tue, 7 May 2024 17:36:29 GMT",
"version": "v2"
}
] | 2024-05-08 | [
[
"Luz",
"Maximilian",
""
],
[
"Mohan",
"Rohit",
""
],
[
"Sekkat",
"Ahmed Rida",
""
],
[
"Sawade",
"Oliver",
""
],
[
"Matthes",
"Elmar",
""
],
[
"Brox",
"Thomas",
""
],
[
"Valada",
"Abhinav",
""
]
] | Optical flow estimation is very challenging in situations with transparent or occluded objects. In this work, we address these challenges at the task level by introducing Amodal Optical Flow, which integrates optical flow with amodal perception. Instead of only representing the visible regions, we define amodal optical... |
2102.11057 | Guillaume Jaume | Pushpak Pati and Guillaume Jaume and Antonio Foncubierta and Florinda
Feroce and Anna Maria Anniciello and Giosu\`e Scognamiglio and Nadia Brancati
and Maryse Fiche and Estelle Dubruc and Daniel Riccio and Maurizio Di Bonito
and Giuseppe De Pietro and Gerardo Botti and Jean-Philippe Thiran and Maria
Frucci and ... | Hierarchical Graph Representations in Digital Pathology | null | null | null | null | cs.CV | http://creativecommons.org/publicdomain/zero/1.0/ | Cancer diagnosis, prognosis, and therapy response predictions from tissue
specimens highly depend on the phenotype and topological distribution of
constituting histological entities. Thus, adequate tissue representations for
encoding histological entities is imperative for computer aided cancer patient
care. To this ... | [
{
"created": "Mon, 22 Feb 2021 14:30:57 GMT",
"version": "v1"
},
{
"created": "Wed, 17 Mar 2021 09:09:02 GMT",
"version": "v2"
}
] | 2021-03-18 | [
[
"Pati",
"Pushpak",
""
],
[
"Jaume",
"Guillaume",
""
],
[
"Foncubierta",
"Antonio",
""
],
[
"Feroce",
"Florinda",
""
],
[
"Anniciello",
"Anna Maria",
""
],
[
"Scognamiglio",
"Giosuè",
""
],
[
"Brancati",
"Nadia"... | Cancer diagnosis, prognosis, and therapy response predictions from tissue specimens highly depend on the phenotype and topological distribution of constituting histological entities. Thus, adequate tissue representations for encoding histological entities is imperative for computer aided cancer patient care. To this en... |
cs/0507029 | Samuel Landau | Samuel Landau (INRIA Futurs), Olivier Sigaud (LIP6), Marc Schoenauer
(INRIA Futurs) | ATNoSFERES revisited | null | Dans Proceedings of the Genetic and Evolutionary Computation
Conference, GECCO-2005 [OAI: oai:hal.inria.fr:inria-00000158_v1] -
http://hal.inria.fr/inria-00000158 | null | null | cs.AI | null | ATNoSFERES is a Pittsburgh style Learning Classifier System (LCS) in which
the rules are represented as edges of an Augmented Transition Network.
Genotypes are strings of tokens of a stack-based language, whose execution
builds the labeled graph. The original ATNoSFERES, using a bitstring to
represent the language to... | [
{
"created": "Mon, 11 Jul 2005 13:11:25 GMT",
"version": "v1"
}
] | 2019-05-01 | [
[
"Landau",
"Samuel",
"",
"INRIA Futurs"
],
[
"Sigaud",
"Olivier",
"",
"LIP6"
],
[
"Schoenauer",
"Marc",
"",
"INRIA Futurs"
]
] | ATNoSFERES is a Pittsburgh style Learning Classifier System (LCS) in which the rules are represented as edges of an Augmented Transition Network. Genotypes are strings of tokens of a stack-based language, whose execution builds the labeled graph. The original ATNoSFERES, using a bitstring to represent the language toke... |
2407.13594 | Nils Palumbo | Nils Palumbo, Ravi Mangal, Zifan Wang, Saranya Vijayakumar, Corina S.
Pasareanu, Somesh Jha | Mechanistically Interpreting a Transformer-based 2-SAT Solver: An
Axiomatic Approach | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Mechanistic interpretability aims to reverse engineer the computation
performed by a neural network in terms of its internal components. Although
there is a growing body of research on mechanistic interpretation of neural
networks, the notion of a mechanistic interpretation itself is often ad-hoc.
Inspired by the not... | [
{
"created": "Thu, 18 Jul 2024 15:32:44 GMT",
"version": "v1"
}
] | 2024-07-19 | [
[
"Palumbo",
"Nils",
""
],
[
"Mangal",
"Ravi",
""
],
[
"Wang",
"Zifan",
""
],
[
"Vijayakumar",
"Saranya",
""
],
[
"Pasareanu",
"Corina S.",
""
],
[
"Jha",
"Somesh",
""
]
] | Mechanistic interpretability aims to reverse engineer the computation performed by a neural network in terms of its internal components. Although there is a growing body of research on mechanistic interpretation of neural networks, the notion of a mechanistic interpretation itself is often ad-hoc. Inspired by the notio... |
1905.09958 | Ren\'ee Burton | Ren\'ee Burton | Characterizing Certain DNS DDoS Attacks | 25 pages, 21 figures | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper details data science research in the area of Cyber Threat
Intelligence applied to a specific type of Distributed Denial of Service (DDoS)
attack. We study a DDoS technique prevalent in the Domain Name System (DNS) for
which little malware have been recovered. Using data from a globally
distributed set of a... | [
{
"created": "Thu, 23 May 2019 22:38:11 GMT",
"version": "v1"
},
{
"created": "Sat, 20 Jul 2019 16:21:23 GMT",
"version": "v2"
}
] | 2019-07-23 | [
[
"Burton",
"Renée",
""
]
] | This paper details data science research in the area of Cyber Threat Intelligence applied to a specific type of Distributed Denial of Service (DDoS) attack. We study a DDoS technique prevalent in the Domain Name System (DNS) for which little malware have been recovered. Using data from a globally distributed set of a p... |
2309.15418 | Hengchang Hu | Hengchang Hu, Yiming Cao, Zhankui He, Samson Tan, Min-Yen Kan | Automatic Feature Fairness in Recommendation via Adversaries | SIGIR-AP'23 | null | 10.1145/3624918.3625318 | null | cs.IR cs.LG | http://creativecommons.org/licenses/by/4.0/ | Fairness is a widely discussed topic in recommender systems, but its
practical implementation faces challenges in defining sensitive features while
maintaining recommendation accuracy. We propose feature fairness as the
foundation to achieve equitable treatment across diverse groups defined by
various feature combina... | [
{
"created": "Wed, 27 Sep 2023 05:48:05 GMT",
"version": "v1"
}
] | 2023-09-28 | [
[
"Hu",
"Hengchang",
""
],
[
"Cao",
"Yiming",
""
],
[
"He",
"Zhankui",
""
],
[
"Tan",
"Samson",
""
],
[
"Kan",
"Min-Yen",
""
]
] | Fairness is a widely discussed topic in recommender systems, but its practical implementation faces challenges in defining sensitive features while maintaining recommendation accuracy. We propose feature fairness as the foundation to achieve equitable treatment across diverse groups defined by various feature combinati... |
1906.07601 | Yannick Est\`eve | Antoine Caubri\`ere, Natalia Tomashenko, Antoine Laurent, Emmanuel
Morin, Nathalie Camelin, Yannick Est\`eve | Curriculum-based transfer learning for an effective end-to-end spoken
language understanding and domain portability | Accepted to the INTERSPEECH 2019 conference. Submitted on March 29,
2019 (Paper submission deadline) | null | null | null | cs.CL cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present an end-to-end approach to extract semantic concepts directly from
the speech audio signal. To overcome the lack of data available for this spoken
language understanding approach, we investigate the use of a transfer learning
strategy based on the principles of curriculum learning. This approach allows
us t... | [
{
"created": "Tue, 18 Jun 2019 14:19:52 GMT",
"version": "v1"
}
] | 2019-06-19 | [
[
"Caubrière",
"Antoine",
""
],
[
"Tomashenko",
"Natalia",
""
],
[
"Laurent",
"Antoine",
""
],
[
"Morin",
"Emmanuel",
""
],
[
"Camelin",
"Nathalie",
""
],
[
"Estève",
"Yannick",
""
]
] | We present an end-to-end approach to extract semantic concepts directly from the speech audio signal. To overcome the lack of data available for this spoken language understanding approach, we investigate the use of a transfer learning strategy based on the principles of curriculum learning. This approach allows us to ... |
2305.06985 | Alexander Fengler | Alexander Fengler, Alejandro Lancho, Krishna Narayanan, and Yury
Polyanskiy | On the Advantages of Asynchrony in the Unsourced MAC | Accepted for presentation at IEEE ISIT 2023 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work we demonstrate how a lack of synchronization can in fact be
advantageous in the problem of random access. Specifically, we consider a
multiple-access problem over a frame-asynchronous 2-user binary-input adder
channel in the unsourced setup (2-UBAC). Previous work has shown that under
perfect synchroniza... | [
{
"created": "Thu, 11 May 2023 17:16:57 GMT",
"version": "v1"
}
] | 2023-05-12 | [
[
"Fengler",
"Alexander",
""
],
[
"Lancho",
"Alejandro",
""
],
[
"Narayanan",
"Krishna",
""
],
[
"Polyanskiy",
"Yury",
""
]
] | In this work we demonstrate how a lack of synchronization can in fact be advantageous in the problem of random access. Specifically, we consider a multiple-access problem over a frame-asynchronous 2-user binary-input adder channel in the unsourced setup (2-UBAC). Previous work has shown that under perfect synchronizati... |
1703.00159 | Yong Wang | Yong Wang | A Calculus for True Concurrency | 31 pages, 1 figures. arXiv admin note: substantial text overlap with
arXiv:1611.09035 | null | null | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We design a calculus for true concurrency called CTC, including its syntax
and operational semantics. CTC has good properties modulo several kinds of
strongly truly concurrent bisimulations and weakly truly concurrent
bisimulations, such as monoid laws, static laws, new expansion law for strongly
truly concurrent bis... | [
{
"created": "Wed, 1 Mar 2017 07:25:23 GMT",
"version": "v1"
},
{
"created": "Wed, 22 Apr 2020 11:55:29 GMT",
"version": "v2"
}
] | 2020-04-24 | [
[
"Wang",
"Yong",
""
]
] | We design a calculus for true concurrency called CTC, including its syntax and operational semantics. CTC has good properties modulo several kinds of strongly truly concurrent bisimulations and weakly truly concurrent bisimulations, such as monoid laws, static laws, new expansion law for strongly truly concurrent bisim... |
2101.02527 | Christian Hesch | Ustim Khristenko, Stefan Schu{\ss}, Melanie Kr\"uger, Felix Schmidt,
Barbara Wohlmuth, Christian Hesch | Multidimensional coupling: A variationally consistent approach to
fiber-reinforced materials | null | null | 10.1016/j.cma.2021.113869 | null | cs.CE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A novel mathematical model for fiber-reinforced materials is proposed. It is
based on a 1-dimensional beam model for the thin fiber structures, a flexible
and general 3-dimensional elasticity model for the matrix and an overlapping
domain decomposition approach. From a computational point of view, this is
motivated b... | [
{
"created": "Thu, 7 Jan 2021 13:03:03 GMT",
"version": "v1"
},
{
"created": "Wed, 24 Feb 2021 14:29:01 GMT",
"version": "v2"
},
{
"created": "Sat, 10 Apr 2021 06:42:55 GMT",
"version": "v3"
}
] | 2021-05-12 | [
[
"Khristenko",
"Ustim",
""
],
[
"Schuß",
"Stefan",
""
],
[
"Krüger",
"Melanie",
""
],
[
"Schmidt",
"Felix",
""
],
[
"Wohlmuth",
"Barbara",
""
],
[
"Hesch",
"Christian",
""
]
] | A novel mathematical model for fiber-reinforced materials is proposed. It is based on a 1-dimensional beam model for the thin fiber structures, a flexible and general 3-dimensional elasticity model for the matrix and an overlapping domain decomposition approach. From a computational point of view, this is motivated by ... |
1606.01178 | Md. Reza | Md. Alimoor Reza and Jana Kosecka | Reinforcement Learning for Semantic Segmentation in Indoor Scenes | null | null | null | null | cs.CV cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Future advancements in robot autonomy and sophistication of robotics tasks
rest on robust, efficient, and task-dependent semantic understanding of the
environment. Semantic segmentation is the problem of simultaneous segmentation
and categorization of a partition of sensory data. The majority of current
approaches ta... | [
{
"created": "Fri, 3 Jun 2016 16:35:58 GMT",
"version": "v1"
}
] | 2016-06-06 | [
[
"Reza",
"Md. Alimoor",
""
],
[
"Kosecka",
"Jana",
""
]
] | Future advancements in robot autonomy and sophistication of robotics tasks rest on robust, efficient, and task-dependent semantic understanding of the environment. Semantic segmentation is the problem of simultaneous segmentation and categorization of a partition of sensory data. The majority of current approaches tack... |
1905.09045 | Lorenzo Cerrone | Lorenzo Cerrone, Alexander Zeilmann, Fred A. Hamprecht | End-to-End Learned Random Walker for Seeded Image Segmentation | null | null | null | null | cs.CV cs.LG | http://creativecommons.org/licenses/by/4.0/ | We present an end-to-end learned algorithm for seeded segmentation. Our
method is based on the Random Walker algorithm, where we predict the edge
weights of the underlying graph using a convolutional neural network. This can
be interpreted as learning context-dependent diffusivities for a linear
diffusion process. Be... | [
{
"created": "Wed, 22 May 2019 09:56:04 GMT",
"version": "v1"
}
] | 2019-05-23 | [
[
"Cerrone",
"Lorenzo",
""
],
[
"Zeilmann",
"Alexander",
""
],
[
"Hamprecht",
"Fred A.",
""
]
] | We present an end-to-end learned algorithm for seeded segmentation. Our method is based on the Random Walker algorithm, where we predict the edge weights of the underlying graph using a convolutional neural network. This can be interpreted as learning context-dependent diffusivities for a linear diffusion process. Besi... |
2009.10679 | Manish Bhattarai | Manish Bhattarai, Aura Rose Jensen-Curtis, Manel Mart\'iNez-Ram\'on | An embedded deep learning system for augmented reality in firefighting
applications | Accepted to ICMLA Special Session on Deep Learning | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Firefighting is a dynamic activity, in which numerous operations occur
simultaneously. Maintaining situational awareness (i.e., knowledge of current
conditions and activities at the scene) is critical to the accurate
decision-making necessary for the safe and successful navigation of a fire
environment by firefighter... | [
{
"created": "Tue, 22 Sep 2020 16:55:44 GMT",
"version": "v1"
}
] | 2021-07-23 | [
[
"Bhattarai",
"Manish",
""
],
[
"Jensen-Curtis",
"Aura Rose",
""
],
[
"MartíNez-Ramón",
"Manel",
""
]
] | Firefighting is a dynamic activity, in which numerous operations occur simultaneously. Maintaining situational awareness (i.e., knowledge of current conditions and activities at the scene) is critical to the accurate decision-making necessary for the safe and successful navigation of a fire environment by firefighters.... |
2006.10587 | Yisroel Mirsky Dr. | Yisroel Mirsky, Tomer Golomb, Yuval Elovici | Lightweight Collaborative Anomaly Detection for the IoT using Blockchain | Preprint of accepted publication, June 2020: Journal of Parallel and
Distributed Computing, Elsevier, ISSN: 0743-7315 | null | null | null | cs.CR cs.DC cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Due to their rapid growth and deployment, the Internet of things (IoT) have
become a central aspect of our daily lives. Unfortunately, IoT devices tend to
have many vulnerabilities which can be exploited by an attacker. Unsupervised
techniques, such as anomaly detection, can be used to secure these devices in a
plug-... | [
{
"created": "Thu, 18 Jun 2020 14:50:08 GMT",
"version": "v1"
}
] | 2020-06-19 | [
[
"Mirsky",
"Yisroel",
""
],
[
"Golomb",
"Tomer",
""
],
[
"Elovici",
"Yuval",
""
]
] | Due to their rapid growth and deployment, the Internet of things (IoT) have become a central aspect of our daily lives. Unfortunately, IoT devices tend to have many vulnerabilities which can be exploited by an attacker. Unsupervised techniques, such as anomaly detection, can be used to secure these devices in a plug-an... |
1908.08774 | Yikun Ban | Yikun Ban, Yuchen Zhou, Xu Cheng, Jiangfang Yi | Coalesced TLB to Exploit Diverse Contiguity of Memory Mapping | null | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The miss rate of TLB is crucial to the performance of address translation for
virtual memory. To reduce the TLB misses, improving translation coverage of TLB
has been an primary approach. Many previous works focus on coalescing multiple
contiguously mapped pages of the memory mapping into a modified entry, which
func... | [
{
"created": "Thu, 22 Aug 2019 11:34:43 GMT",
"version": "v1"
},
{
"created": "Mon, 2 Dec 2019 22:21:59 GMT",
"version": "v2"
}
] | 2019-12-04 | [
[
"Ban",
"Yikun",
""
],
[
"Zhou",
"Yuchen",
""
],
[
"Cheng",
"Xu",
""
],
[
"Yi",
"Jiangfang",
""
]
] | The miss rate of TLB is crucial to the performance of address translation for virtual memory. To reduce the TLB misses, improving translation coverage of TLB has been an primary approach. Many previous works focus on coalescing multiple contiguously mapped pages of the memory mapping into a modified entry, which functi... |
2311.08383 | Priyanka Kaswan | Priyanka Kaswan and Sennur Ulukus | Choosing Outdated Information to Achieve Reliability in Age-Based
Gossiping | null | null | null | null | cs.IT cs.NI eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider a system model with two sources, a reliable source and an
unreliable source, who are responsible for disseminating updates regarding a
process to an age-based gossip network of $n$ nodes. Nodes wish to have fresh
information, however, they have preference for packets that originated at the
reliable source... | [
{
"created": "Tue, 14 Nov 2023 18:45:29 GMT",
"version": "v1"
}
] | 2023-11-15 | [
[
"Kaswan",
"Priyanka",
""
],
[
"Ulukus",
"Sennur",
""
]
] | We consider a system model with two sources, a reliable source and an unreliable source, who are responsible for disseminating updates regarding a process to an age-based gossip network of $n$ nodes. Nodes wish to have fresh information, however, they have preference for packets that originated at the reliable source a... |
2110.13052 | Noah Golowich | Noah Golowich, Ankur Moitra | Can Q-Learning be Improved with Advice? | null | null | null | null | cs.LG cs.AI cs.DS math.OC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Despite rapid progress in theoretical reinforcement learning (RL) over the
last few years, most of the known guarantees are worst-case in nature, failing
to take advantage of structure that may be known a priori about a given RL
problem at hand. In this paper we address the question of whether worst-case
lower bounds... | [
{
"created": "Mon, 25 Oct 2021 15:44:20 GMT",
"version": "v1"
}
] | 2021-10-26 | [
[
"Golowich",
"Noah",
""
],
[
"Moitra",
"Ankur",
""
]
] | Despite rapid progress in theoretical reinforcement learning (RL) over the last few years, most of the known guarantees are worst-case in nature, failing to take advantage of structure that may be known a priori about a given RL problem at hand. In this paper we address the question of whether worst-case lower bounds f... |
1709.00112 | Swanand Kadhe | Swanand Kadhe, Brenden Garcia, Anoosheh Heidarzadeh, Salim El
Rouayheb, Alex Sprintson | Private Information Retrieval with Side Information | Shorter version of the paper is accepted in Allerton Conference 2017 | null | null | null | cs.IT cs.CR math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the problem of Private Information Retrieval (PIR) in the presence
of prior side information. The problem setup includes a database of $K$
independent messages possibly replicated on several servers, and a user that
needs to retrieve one of these messages. In addition, the user has some prior
side informatio... | [
{
"created": "Fri, 1 Sep 2017 00:04:11 GMT",
"version": "v1"
}
] | 2017-09-04 | [
[
"Kadhe",
"Swanand",
""
],
[
"Garcia",
"Brenden",
""
],
[
"Heidarzadeh",
"Anoosheh",
""
],
[
"Rouayheb",
"Salim El",
""
],
[
"Sprintson",
"Alex",
""
]
] | We study the problem of Private Information Retrieval (PIR) in the presence of prior side information. The problem setup includes a database of $K$ independent messages possibly replicated on several servers, and a user that needs to retrieve one of these messages. In addition, the user has some prior side information ... |
1910.11791 | Linchao Bao | Yajing Chen, Fanzi Wu, Zeyu Wang, Yibing Song, Yonggen Ling, Linchao
Bao | Self-supervised Learning of Detailed 3D Face Reconstruction | Accepted by IEEE Transactions on Image Processing (TIP) | null | 10.1109/TIP.2020.3017347 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we present an end-to-end learning framework for detailed 3D
face reconstruction from a single image. Our approach uses a 3DMM-based coarse
model and a displacement map in UV-space to represent a 3D face. Unlike
previous work addressing the problem, our learning framework does not require
supervision of... | [
{
"created": "Fri, 25 Oct 2019 15:16:20 GMT",
"version": "v1"
},
{
"created": "Wed, 2 Sep 2020 03:58:23 GMT",
"version": "v2"
}
] | 2020-09-03 | [
[
"Chen",
"Yajing",
""
],
[
"Wu",
"Fanzi",
""
],
[
"Wang",
"Zeyu",
""
],
[
"Song",
"Yibing",
""
],
[
"Ling",
"Yonggen",
""
],
[
"Bao",
"Linchao",
""
]
] | In this paper, we present an end-to-end learning framework for detailed 3D face reconstruction from a single image. Our approach uses a 3DMM-based coarse model and a displacement map in UV-space to represent a 3D face. Unlike previous work addressing the problem, our learning framework does not require supervision of s... |
1804.06996 | Gaurav Bharaj | Gaurav Bharaj, Danny Kaufman, Etienne Vouga, Hanspeter Pfister | Metamorphs: Bistable Planar Structures | null | null | null | null | cs.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Extreme deformation can drastically morph a structure from one structural
form into another. Programming such deformation properties into the structure
is often challenging and in many cases an impossible task. The morphed forms do
not hold and usually relapse to the original form, where the structure is in
its lowes... | [
{
"created": "Thu, 19 Apr 2018 05:15:03 GMT",
"version": "v1"
}
] | 2018-04-20 | [
[
"Bharaj",
"Gaurav",
""
],
[
"Kaufman",
"Danny",
""
],
[
"Vouga",
"Etienne",
""
],
[
"Pfister",
"Hanspeter",
""
]
] | Extreme deformation can drastically morph a structure from one structural form into another. Programming such deformation properties into the structure is often challenging and in many cases an impossible task. The morphed forms do not hold and usually relapse to the original form, where the structure is in its lowest ... |
1510.01891 | Adam Kurpisz | Adam Kurpisz, Samuli Lepp\"anen, Monaldo Mastrolilli | On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy | null | null | null | null | cs.CC cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Lasserre/Sum-of-Squares (SoS) hierarchy is a systematic procedure for
constructing a sequence of increasingly tight semidefinite relaxations. It is
known that the hierarchy converges to the 0/1 polytope in n levels and captures
the convex relaxations used in the best available approximation algorithms for
a wide ... | [
{
"created": "Wed, 7 Oct 2015 10:57:45 GMT",
"version": "v1"
}
] | 2015-10-08 | [
[
"Kurpisz",
"Adam",
""
],
[
"Leppänen",
"Samuli",
""
],
[
"Mastrolilli",
"Monaldo",
""
]
] | The Lasserre/Sum-of-Squares (SoS) hierarchy is a systematic procedure for constructing a sequence of increasingly tight semidefinite relaxations. It is known that the hierarchy converges to the 0/1 polytope in n levels and captures the convex relaxations used in the best available approximation algorithms for a wide va... |
2203.06870 | Cl\'ement Canonne | Jayadev Acharya and Cl\'ement L. Canonne and Ziteng Sun and Himanshu
Tyagi | The Role of Interactivity in Structured Estimation | null | null | null | null | cs.DS cs.DM cs.IT cs.LG math.IT math.ST stat.TH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study high-dimensional sparse estimation under three natural constraints:
communication constraints, local privacy constraints, and linear measurements
(compressive sensing). Without sparsity assumptions, it has been established
that interactivity cannot improve the minimax rates of estimation under these
informat... | [
{
"created": "Mon, 14 Mar 2022 05:54:42 GMT",
"version": "v1"
}
] | 2022-03-15 | [
[
"Acharya",
"Jayadev",
""
],
[
"Canonne",
"Clément L.",
""
],
[
"Sun",
"Ziteng",
""
],
[
"Tyagi",
"Himanshu",
""
]
] | We study high-dimensional sparse estimation under three natural constraints: communication constraints, local privacy constraints, and linear measurements (compressive sensing). Without sparsity assumptions, it has been established that interactivity cannot improve the minimax rates of estimation under these informatio... |
1903.00553 | Binghui Wang | Binghui Wang, Neil Zhenqiang Gong | Attacking Graph-based Classification via Manipulating the Graph
Structure | To appear in The 26th ACM Conference on Computer and Communications
Security, Nov 2019 | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Graph-based classification methods are widely used for security and privacy
analytics. Roughly speaking, graph-based classification methods include
collective classification and graph neural network. Evading a graph-based
classification method enables an attacker to evade detection in security
analytics and can be us... | [
{
"created": "Fri, 1 Mar 2019 21:59:17 GMT",
"version": "v1"
},
{
"created": "Tue, 13 Aug 2019 02:00:12 GMT",
"version": "v2"
}
] | 2019-08-14 | [
[
"Wang",
"Binghui",
""
],
[
"Gong",
"Neil Zhenqiang",
""
]
] | Graph-based classification methods are widely used for security and privacy analytics. Roughly speaking, graph-based classification methods include collective classification and graph neural network. Evading a graph-based classification method enables an attacker to evade detection in security analytics and can be used... |
2308.03312 | Kexin Pei | Kexin Pei, Weichen Li, Qirui Jin, Shuyang Liu, Scott Geng, Lorenzo
Cavallaro, Junfeng Yang, Suman Jana | Exploiting Code Symmetries for Learning Program Semantics | null | null | null | null | cs.LG cs.CR cs.PL | http://creativecommons.org/licenses/by/4.0/ | This paper tackles the challenge of teaching code semantics to Large Language
Models (LLMs) for program analysis by incorporating code symmetries into the
model architecture. We introduce a group-theoretic framework that defines code
symmetries as semantics-preserving transformations, where forming a code
symmetry gr... | [
{
"created": "Mon, 7 Aug 2023 05:40:58 GMT",
"version": "v1"
},
{
"created": "Fri, 25 Aug 2023 16:08:51 GMT",
"version": "v2"
},
{
"created": "Mon, 28 Aug 2023 04:53:52 GMT",
"version": "v3"
},
{
"created": "Tue, 29 Aug 2023 01:44:39 GMT",
"version": "v4"
},
{
"cr... | 2024-06-07 | [
[
"Pei",
"Kexin",
""
],
[
"Li",
"Weichen",
""
],
[
"Jin",
"Qirui",
""
],
[
"Liu",
"Shuyang",
""
],
[
"Geng",
"Scott",
""
],
[
"Cavallaro",
"Lorenzo",
""
],
[
"Yang",
"Junfeng",
""
],
[
"Jana",
"Su... | This paper tackles the challenge of teaching code semantics to Large Language Models (LLMs) for program analysis by incorporating code symmetries into the model architecture. We introduce a group-theoretic framework that defines code symmetries as semantics-preserving transformations, where forming a code symmetry grou... |
2202.05329 | Simon Lars\'en | Simon Lars\'en (1), Jean-R\'emy Falleri (2), Benoit Baudry (1), Martin
Monperrus (1) ((1) KTH Royal Institute of Technology, (2) Univ. Bordeaux,
Bordeaux INP, CNRS, LaBRI, IUF) | Spork: Structured Merge for Java with Formatting Preservation | 21 pages, 18 figures, 11 tables, accepted for publication in IEEE
Transactions on Software Engineering | IEEE Transactions on Software Engineering, 2022 | 10.1109/TSE.2022.3143766 | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The highly parallel workflows of modern software development have made
merging of source code a common activity for developers. The state of the
practice is based on line-based merge, which is ubiquitously used with "git
merge". Line-based merge is however a generalized technique for any text that
cannot leverage the... | [
{
"created": "Thu, 10 Feb 2022 21:15:49 GMT",
"version": "v1"
}
] | 2022-02-21 | [
[
"Larsén",
"Simon",
""
],
[
"Falleri",
"Jean-Rémy",
""
],
[
"Baudry",
"Benoit",
""
],
[
"Monperrus",
"Martin",
""
]
] | The highly parallel workflows of modern software development have made merging of source code a common activity for developers. The state of the practice is based on line-based merge, which is ubiquitously used with "git merge". Line-based merge is however a generalized technique for any text that cannot leverage the s... |
1501.04985 | Konstantinos Georgiou | Jurek Czyzowicz, Konstantinos Georgiou, Evangelos Kranakis, Lata
Narayanan, Jarda Opatrny, Birgit Vogtenhuber | Evacuating Robots from a Disk Using Face-to-Face Communication | 22 pages, 8 figures. An extended abstract of this work was accepted
for publication in the LNCS proceedings of the 9th International Conference
on Algorithms and Complexity (CIAC15) | Discrete Mathematics & Theoretical Computer Science, vol. 22 no.
4, Distributed Computing and Networking (August 27, 2020) dmtcs:6198 | 10.23638/DMTCS-22-4-4 | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Assume that two robots are located at the centre of a unit disk. Their goal
is to evacuate from the disk through an exit at an unknown location on the
boundary of the disk. At any time the robots can move anywhere they choose on
the disk, independently of each other, with maximum speed $1$. The robots can
cooperate b... | [
{
"created": "Tue, 20 Jan 2015 21:36:08 GMT",
"version": "v1"
},
{
"created": "Thu, 12 Mar 2020 02:07:34 GMT",
"version": "v2"
},
{
"created": "Tue, 9 Jun 2020 02:12:31 GMT",
"version": "v3"
},
{
"created": "Tue, 21 Jul 2020 04:08:18 GMT",
"version": "v4"
},
{
"cr... | 2023-06-22 | [
[
"Czyzowicz",
"Jurek",
""
],
[
"Georgiou",
"Konstantinos",
""
],
[
"Kranakis",
"Evangelos",
""
],
[
"Narayanan",
"Lata",
""
],
[
"Opatrny",
"Jarda",
""
],
[
"Vogtenhuber",
"Birgit",
""
]
] | Assume that two robots are located at the centre of a unit disk. Their goal is to evacuate from the disk through an exit at an unknown location on the boundary of the disk. At any time the robots can move anywhere they choose on the disk, independently of each other, with maximum speed $1$. The robots can cooperate by ... |
2310.11450 | Thomas Decker | Thomas Decker, Michael Lebacher and Volker Tresp | Explaining Deep Neural Networks for Bearing Fault Detection with
Vibration Concepts | 2023 IEEE 21st International Conference on Industrial Informatics
(INDIN) | null | 10.1109/INDIN51400.2023.10218170 | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Concept-based explanation methods, such as Concept Activation Vectors, are
potent means to quantify how abstract or high-level characteristics of input
data influence the predictions of complex deep neural networks. However,
applying them to industrial prediction problems is challenging as it is not
immediately clear... | [
{
"created": "Tue, 17 Oct 2023 17:58:19 GMT",
"version": "v1"
}
] | 2023-10-18 | [
[
"Decker",
"Thomas",
""
],
[
"Lebacher",
"Michael",
""
],
[
"Tresp",
"Volker",
""
]
] | Concept-based explanation methods, such as Concept Activation Vectors, are potent means to quantify how abstract or high-level characteristics of input data influence the predictions of complex deep neural networks. However, applying them to industrial prediction problems is challenging as it is not immediately clear h... |
1403.3286 | Sadegh Esmaeil Zadeh Soudjani | S. Esmaeil Zadeh Soudjani, C. Gevaerts, A. Abate | FAUST$^2$: Formal Abstractions of Uncountable-STate STochastic processes | This paper is submitted to the 26th International Conference on
Computer Aided Verification (CAV 2014) | null | null | null | cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | FAUST$^2$ is a software tool that generates formal abstractions of (possibly
non-deterministic) discrete-time Markov processes (dtMP) defined over
uncountable (continuous) state spaces. A dtMP model is specified in MATLAB and
abstracted as a finite-state Markov chain or Markov decision processes. The
abstraction proc... | [
{
"created": "Thu, 13 Mar 2014 14:53:46 GMT",
"version": "v1"
}
] | 2014-03-14 | [
[
"Soudjani",
"S. Esmaeil Zadeh",
""
],
[
"Gevaerts",
"C.",
""
],
[
"Abate",
"A.",
""
]
] | FAUST$^2$ is a software tool that generates formal abstractions of (possibly non-deterministic) discrete-time Markov processes (dtMP) defined over uncountable (continuous) state spaces. A dtMP model is specified in MATLAB and abstracted as a finite-state Markov chain or Markov decision processes. The abstraction proced... |
2210.16046 | Masakazu Yoshimura | Masakazu Yoshimura, Junji Otsuka, Atsushi Irie, Takeshi Ohashi | Rawgment: Noise-Accounted RAW Augmentation Enables Recognition in a Wide
Variety of Environments | Accepted to CVPR2023 | null | null | null | cs.CV eess.IV | http://creativecommons.org/licenses/by/4.0/ | Image recognition models that work in challenging environments (e.g.,
extremely dark, blurry, or high dynamic range conditions) must be useful.
However, creating training datasets for such environments is expensive and hard
due to the difficulties of data collection and annotation. It is desirable if
we could get a r... | [
{
"created": "Fri, 28 Oct 2022 10:33:45 GMT",
"version": "v1"
},
{
"created": "Mon, 27 Mar 2023 06:17:13 GMT",
"version": "v2"
}
] | 2023-03-28 | [
[
"Yoshimura",
"Masakazu",
""
],
[
"Otsuka",
"Junji",
""
],
[
"Irie",
"Atsushi",
""
],
[
"Ohashi",
"Takeshi",
""
]
] | Image recognition models that work in challenging environments (e.g., extremely dark, blurry, or high dynamic range conditions) must be useful. However, creating training datasets for such environments is expensive and hard due to the difficulties of data collection and annotation. It is desirable if we could get a rob... |
1305.2755 | Issam Sahmoudi issam sahmoudi | Issam Sahmoudi and Abdelmonaime Lachkar | Clustering Web Search Results For Effective Arabic Language Browsing | null | International Journal on Natural Language Computing (IJNLC) Vol.
2, No.2, April 2013 | 10.5121/ijnlc.2013.2202 | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The process of browsing Search Results is one of the major problems with
traditional Web search engines for English, European, and any other languages
generally, and for Arabic Language particularly. This process is absolutely
time consuming and the browsing style seems to be unattractive. Organizing Web
search resul... | [
{
"created": "Mon, 13 May 2013 12:28:34 GMT",
"version": "v1"
}
] | 2013-05-14 | [
[
"Sahmoudi",
"Issam",
""
],
[
"Lachkar",
"Abdelmonaime",
""
]
] | The process of browsing Search Results is one of the major problems with traditional Web search engines for English, European, and any other languages generally, and for Arabic Language particularly. This process is absolutely time consuming and the browsing style seems to be unattractive. Organizing Web search results... |
1802.07983 | Miroslav Bures | Miroslav Bures and Karel Frajtak and Bestoun S. Ahmed | Tapir: Automation Support of Exploratory Testing Using Model
Reconstruction of the System Under Test | null | null | 10.1109/TR.2018.2799957 | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For a considerable number of software projects, the creation of effective
test cases is hindered by design documentation that is either lacking,
incomplete or obsolete. The exploratory testing approach can serve as a sound
method in such situations. However, the efficiency of this testing approach
strongly depends on... | [
{
"created": "Thu, 22 Feb 2018 11:27:14 GMT",
"version": "v1"
}
] | 2019-12-05 | [
[
"Bures",
"Miroslav",
""
],
[
"Frajtak",
"Karel",
""
],
[
"Ahmed",
"Bestoun S.",
""
]
] | For a considerable number of software projects, the creation of effective test cases is hindered by design documentation that is either lacking, incomplete or obsolete. The exploratory testing approach can serve as a sound method in such situations. However, the efficiency of this testing approach strongly depends on t... |
0910.1123 | Arvind Yedla | Arvind Yedla, Henry D. Pfister, Krishna R. Narayanan | Can Iterative Decoding for Erasure Correlated Sources be Universal? | 8 pages, to appear in Allerton '09 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we consider a few iterative decoding schemes for the joint
source-channel coding of correlated sources. Specifically, we consider the
joint source-channel coding of two erasure correlated sources with transmission
over different erasure channels. Our main interest is in determining whether or
not vario... | [
{
"created": "Tue, 6 Oct 2009 22:10:56 GMT",
"version": "v1"
}
] | 2009-10-08 | [
[
"Yedla",
"Arvind",
""
],
[
"Pfister",
"Henry D.",
""
],
[
"Narayanan",
"Krishna R.",
""
]
] | In this paper, we consider a few iterative decoding schemes for the joint source-channel coding of correlated sources. Specifically, we consider the joint source-channel coding of two erasure correlated sources with transmission over different erasure channels. Our main interest is in determining whether or not various... |
2206.00227 | Junbo Zhang | Junbo Zhang, Kaisheng Ma | Rethinking the Augmentation Module in Contrastive Learning: Learning
Hierarchical Augmentation Invariance with Expanded Views | Accepted to CVPR 2022 | 2022 IEEE/CVF Conference on Computer Vision and Pattern
Recognition (CVPR) | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A data augmentation module is utilized in contrastive learning to transform
the given data example into two views, which is considered essential and
irreplaceable. However, the predetermined composition of multiple data
augmentations brings two drawbacks. First, the artificial choice of
augmentation types brings spec... | [
{
"created": "Wed, 1 Jun 2022 04:30:46 GMT",
"version": "v1"
},
{
"created": "Mon, 22 Aug 2022 03:28:52 GMT",
"version": "v2"
}
] | 2022-08-23 | [
[
"Zhang",
"Junbo",
""
],
[
"Ma",
"Kaisheng",
""
]
] | A data augmentation module is utilized in contrastive learning to transform the given data example into two views, which is considered essential and irreplaceable. However, the predetermined composition of multiple data augmentations brings two drawbacks. First, the artificial choice of augmentation types brings specif... |
0706.3132 | Paulo Condado | Paulo A. Condado and Fernando G. Lobo | EasyVoice: Integrating voice synthesis with Skype | null | null | null | null | cs.CY cs.HC | null | This paper presents EasyVoice, a system that integrates voice synthesis with
Skype. EasyVoice allows a person with voice disabilities to talk with another
person located anywhere in the world, removing an important obstacle that
affect these people during a phone or VoIP-based conversation.
| [
{
"created": "Thu, 21 Jun 2007 12:04:40 GMT",
"version": "v1"
}
] | 2007-06-22 | [
[
"Condado",
"Paulo A.",
""
],
[
"Lobo",
"Fernando G.",
""
]
] | This paper presents EasyVoice, a system that integrates voice synthesis with Skype. EasyVoice allows a person with voice disabilities to talk with another person located anywhere in the world, removing an important obstacle that affect these people during a phone or VoIP-based conversation. |
1512.03866 | Fei Li | Qiuyan Wang, Fei Li and Dongdai Lin | A Class of Linear Codes With Three Weights | 11 pages,2 tables | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Linear codes have been an interesting subject of study for many years.
Recently, linear codes with few weights have been constructed and extensively
studied. In this paper, for an odd prime p, a class of three-weight linear
codes over Fp are constructed. The weight distributions of the linear codes are
settled. These... | [
{
"created": "Sat, 12 Dec 2015 02:42:24 GMT",
"version": "v1"
},
{
"created": "Wed, 23 Dec 2015 03:32:36 GMT",
"version": "v2"
}
] | 2015-12-24 | [
[
"Wang",
"Qiuyan",
""
],
[
"Li",
"Fei",
""
],
[
"Lin",
"Dongdai",
""
]
] | Linear codes have been an interesting subject of study for many years. Recently, linear codes with few weights have been constructed and extensively studied. In this paper, for an odd prime p, a class of three-weight linear codes over Fp are constructed. The weight distributions of the linear codes are settled. These c... |
2206.12011 | Zeynep K | Zeynep K and Bobak Nazer | Detecting Correlated Gaussian Databases | 26 pages, 4 figures | null | null | null | cs.IT math.IT math.ST stat.TH | http://creativecommons.org/licenses/by/4.0/ | This paper considers the problem of detecting whether two databases, each
consisting of $n$ users with $d$ Gaussian features, are correlated. Under the
null hypothesis, the databases are independent. Under the alternate hypothesis,
the features are correlated across databases, under an unknown row permutation.
A simp... | [
{
"created": "Thu, 23 Jun 2022 23:08:24 GMT",
"version": "v1"
}
] | 2022-06-27 | [
[
"K",
"Zeynep",
""
],
[
"Nazer",
"Bobak",
""
]
] | This paper considers the problem of detecting whether two databases, each consisting of $n$ users with $d$ Gaussian features, are correlated. Under the null hypothesis, the databases are independent. Under the alternate hypothesis, the features are correlated across databases, under an unknown row permutation. A simple... |
2208.05777 | Shaina Raza Dr. | Shaina Raza, Deepak John Reji, Chen Ding | Dbias: Detecting biases and ensuring Fairness in news articles | Accepted for publication in International Journal of Data Science and
Analytics | null | null | null | cs.IR | http://creativecommons.org/licenses/by/4.0/ | Because of the increasing use of data-centric systems and algorithms in
machine learning, the topic of fairness is receiving a lot of attention in the
academic and broader literature. This paper introduces Dbias
(https://pypi.org/project/Dbias/), an open-source Python package for ensuring
fairness in news articles. D... | [
{
"created": "Thu, 11 Aug 2022 12:14:06 GMT",
"version": "v1"
}
] | 2022-08-12 | [
[
"Raza",
"Shaina",
""
],
[
"Reji",
"Deepak John",
""
],
[
"Ding",
"Chen",
""
]
] | Because of the increasing use of data-centric systems and algorithms in machine learning, the topic of fairness is receiving a lot of attention in the academic and broader literature. This paper introduces Dbias (https://pypi.org/project/Dbias/), an open-source Python package for ensuring fairness in news articles. Dbi... |
2104.00837 | Pingchuan Ma | Pingchuan Ma, Tao Du, John Z. Zhang, Kui Wu, Andrew Spielberg, Robert
K. Katzschmann, Wojciech Matusik | DiffAqua: A Differentiable Computational Design Pipeline for Soft
Underwater Swimmers with Shape Interpolation | ACM SIGGRAPH 2021. Homepage: http://diffaqua.csail.mit.edu/ | null | 10.1145/3450626.3459832 | null | cs.LG cs.GR cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The computational design of soft underwater swimmers is challenging because
of the high degrees of freedom in soft-body modeling. In this paper, we present
a differentiable pipeline for co-designing a soft swimmer's geometry and
controller. Our pipeline unlocks gradient-based algorithms for discovering
novel swimmer ... | [
{
"created": "Fri, 2 Apr 2021 01:18:15 GMT",
"version": "v1"
},
{
"created": "Wed, 5 May 2021 18:58:41 GMT",
"version": "v2"
}
] | 2021-05-07 | [
[
"Ma",
"Pingchuan",
""
],
[
"Du",
"Tao",
""
],
[
"Zhang",
"John Z.",
""
],
[
"Wu",
"Kui",
""
],
[
"Spielberg",
"Andrew",
""
],
[
"Katzschmann",
"Robert K.",
""
],
[
"Matusik",
"Wojciech",
""
]
] | The computational design of soft underwater swimmers is challenging because of the high degrees of freedom in soft-body modeling. In this paper, we present a differentiable pipeline for co-designing a soft swimmer's geometry and controller. Our pipeline unlocks gradient-based algorithms for discovering novel swimmer de... |
2111.03144 | Abhinav Agrawal | Abhinav Agrawal, Justin Domke | Amortized Variational Inference for Simple Hierarchical Models | Neural Information Processing Systems (NeurIPS) 2021 | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | It is difficult to use subsampling with variational inference in hierarchical
models since the number of local latent variables scales with the dataset.
Thus, inference in hierarchical models remains a challenge at large scale. It
is helpful to use a variational family with structure matching the posterior,
but optim... | [
{
"created": "Thu, 4 Nov 2021 20:29:12 GMT",
"version": "v1"
}
] | 2021-11-08 | [
[
"Agrawal",
"Abhinav",
""
],
[
"Domke",
"Justin",
""
]
] | It is difficult to use subsampling with variational inference in hierarchical models since the number of local latent variables scales with the dataset. Thus, inference in hierarchical models remains a challenge at large scale. It is helpful to use a variational family with structure matching the posterior, but optimiz... |
1802.07779 | Daniel DeFreez | Daniel DeFreez, Aditya V. Thakur, Cindy Rubio-Gonz\'alez | Path-Based Function Embedding and its Application to Specification
Mining | 11 pages, 8 figures | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Identifying the relationships among program elements is useful for program
understanding, debugging, and analysis. One such relationship is synonymy.
Function synonyms are functions that play a similar role in code, e.g.
functions that perform initialization for different device drivers, or
functions that implement d... | [
{
"created": "Wed, 21 Feb 2018 20:02:52 GMT",
"version": "v1"
},
{
"created": "Sun, 25 Feb 2018 04:22:50 GMT",
"version": "v2"
}
] | 2018-02-27 | [
[
"DeFreez",
"Daniel",
""
],
[
"Thakur",
"Aditya V.",
""
],
[
"Rubio-González",
"Cindy",
""
]
] | Identifying the relationships among program elements is useful for program understanding, debugging, and analysis. One such relationship is synonymy. Function synonyms are functions that play a similar role in code, e.g. functions that perform initialization for different device drivers, or functions that implement dif... |
1404.3920 | Aske Plaat | Catholijn Jonker, Joost Broekens, Aske Plaat | Virtual Reflexes | null | null | null | null | cs.CY cs.HC | http://creativecommons.org/licenses/by/3.0/ | Virtual Reality is used successfully to treat people for regular phobias. A
new challenge is to develop Virtual Reality Exposure Training for social
skills. Virtual actors in such systems have to show appropriate social behavior
including emotions, gaze, and keeping distance. The behavior must be realistic
and real-t... | [
{
"created": "Mon, 14 Apr 2014 14:07:09 GMT",
"version": "v1"
}
] | 2014-04-16 | [
[
"Jonker",
"Catholijn",
""
],
[
"Broekens",
"Joost",
""
],
[
"Plaat",
"Aske",
""
]
] | Virtual Reality is used successfully to treat people for regular phobias. A new challenge is to develop Virtual Reality Exposure Training for social skills. Virtual actors in such systems have to show appropriate social behavior including emotions, gaze, and keeping distance. The behavior must be realistic and real-tim... |
1908.07018 | Ayush Maheshwari | Ayush Maheshwari, Hrishikesh Patel, Nandan Rathod, Ritesh Kumar,
Ganesh Ramakrishnan and Pushpak Bhattacharyya | Tale of tails using rule augmented sequence labeling for event
extraction | 9 pages, 4 figures, 6 tables | StarAI Workshop at AAAI 2020 | null | null | cs.IR cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The problem of event extraction is a relatively difficult task for low
resource languages due to the non-availability of sufficient annotated data.
Moreover, the task becomes complex for tail (rarely occurring) labels wherein
extremely less data is available. In this paper, we present a new dataset
(InDEE-2019) in th... | [
{
"created": "Mon, 19 Aug 2019 18:43:06 GMT",
"version": "v1"
},
{
"created": "Thu, 22 Aug 2019 06:10:02 GMT",
"version": "v2"
},
{
"created": "Fri, 31 Jan 2020 07:36:09 GMT",
"version": "v3"
}
] | 2020-11-23 | [
[
"Maheshwari",
"Ayush",
""
],
[
"Patel",
"Hrishikesh",
""
],
[
"Rathod",
"Nandan",
""
],
[
"Kumar",
"Ritesh",
""
],
[
"Ramakrishnan",
"Ganesh",
""
],
[
"Bhattacharyya",
"Pushpak",
""
]
] | The problem of event extraction is a relatively difficult task for low resource languages due to the non-availability of sufficient annotated data. Moreover, the task becomes complex for tail (rarely occurring) labels wherein extremely less data is available. In this paper, we present a new dataset (InDEE-2019) in the ... |
1204.0535 | S Muthukrishnan | Yishay Mansour, S. Muthukrishnan and Noam Nisan | Doubleclick Ad Exchange Auction | null | null | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Display advertisements on the web are sold via ad exchanges that use real
time auction. We describe the challenges of designing a suitable auction, and
present a simple auction called the Optional Second Price (OSP) auction that is
currently used in Doubleclick Ad Exchange.
| [
{
"created": "Mon, 2 Apr 2012 20:56:53 GMT",
"version": "v1"
}
] | 2012-04-04 | [
[
"Mansour",
"Yishay",
""
],
[
"Muthukrishnan",
"S.",
""
],
[
"Nisan",
"Noam",
""
]
] | Display advertisements on the web are sold via ad exchanges that use real time auction. We describe the challenges of designing a suitable auction, and present a simple auction called the Optional Second Price (OSP) auction that is currently used in Doubleclick Ad Exchange. |
1410.4011 | EPTCS | Amir M. Ben-Amram, Aviad Pineles | Flowchart Programs, Regular Expressions, and Decidability of Polynomial
Growth-Rate | In Proceedings VPT 2016, arXiv:1607.01835 | EPTCS 216, 2016, pp. 24-49 | 10.4204/EPTCS.216.2 | null | cs.PL cs.FL cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a new method for inferring complexity properties for a class of
programs in the form of flowcharts annotated with loop information.
Specifically, our method can (soundly and completely) decide if computed values
are polynomially bounded as a function of the input; and similarly for the
running time. Such c... | [
{
"created": "Wed, 15 Oct 2014 11:16:16 GMT",
"version": "v1"
},
{
"created": "Sun, 13 Mar 2016 14:40:47 GMT",
"version": "v2"
},
{
"created": "Sun, 20 Mar 2016 10:01:27 GMT",
"version": "v3"
},
{
"created": "Wed, 1 Jun 2016 16:30:18 GMT",
"version": "v4"
},
{
"cr... | 2016-07-11 | [
[
"Ben-Amram",
"Amir M.",
""
],
[
"Pineles",
"Aviad",
""
]
] | We present a new method for inferring complexity properties for a class of programs in the form of flowcharts annotated with loop information. Specifically, our method can (soundly and completely) decide if computed values are polynomially bounded as a function of the input; and similarly for the running time. Such com... |
2312.01656 | Yilin Ye | Yilin Ye, Qian Zhu, Shishi Xiao, Kang Zhang, Wei Zeng | The Contemporary Art of Image Search: Iterative User Intent Expansion
via Vision-Language Model | Accepted by The 2024 ACM SIGCHI Conference on Computer-Supported
Cooperative Work & Social Computing (CSCW) (Proc. CSCW 2024) | null | null | null | cs.IR cs.AI cs.CV cs.HC | http://creativecommons.org/licenses/by/4.0/ | Image search is an essential and user-friendly method to explore vast
galleries of digital images. However, existing image search methods heavily
rely on proximity measurements like tag matching or image similarity, requiring
precise user inputs for satisfactory results. To meet the growing demand for a
contemporary ... | [
{
"created": "Mon, 4 Dec 2023 06:14:25 GMT",
"version": "v1"
},
{
"created": "Tue, 5 Dec 2023 02:24:38 GMT",
"version": "v2"
}
] | 2023-12-06 | [
[
"Ye",
"Yilin",
""
],
[
"Zhu",
"Qian",
""
],
[
"Xiao",
"Shishi",
""
],
[
"Zhang",
"Kang",
""
],
[
"Zeng",
"Wei",
""
]
] | Image search is an essential and user-friendly method to explore vast galleries of digital images. However, existing image search methods heavily rely on proximity measurements like tag matching or image similarity, requiring precise user inputs for satisfactory results. To meet the growing demand for a contemporary im... |
2302.05743 | Zian Li | Zian Li, Xiyuan Wang, Yinan Huang, Muhan Zhang | Is Distance Matrix Enough for Geometric Deep Learning? | To be published in NeurIPS2023 | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | Graph Neural Networks (GNNs) are often used for tasks involving the 3D
geometry of a given graph, such as molecular dynamics simulation. While
incorporating Euclidean distance into Message Passing Neural Networks (referred
to as Vanilla DisGNN) is a straightforward way to learn the geometry, it has
been demonstrated ... | [
{
"created": "Sat, 11 Feb 2023 16:54:20 GMT",
"version": "v1"
},
{
"created": "Mon, 3 Apr 2023 15:31:56 GMT",
"version": "v2"
},
{
"created": "Fri, 14 Apr 2023 14:37:06 GMT",
"version": "v3"
},
{
"created": "Fri, 2 Jun 2023 08:12:40 GMT",
"version": "v4"
},
{
"cre... | 2023-11-01 | [
[
"Li",
"Zian",
""
],
[
"Wang",
"Xiyuan",
""
],
[
"Huang",
"Yinan",
""
],
[
"Zhang",
"Muhan",
""
]
] | Graph Neural Networks (GNNs) are often used for tasks involving the 3D geometry of a given graph, such as molecular dynamics simulation. While incorporating Euclidean distance into Message Passing Neural Networks (referred to as Vanilla DisGNN) is a straightforward way to learn the geometry, it has been demonstrated th... |
1803.02123 | Per Skarin | Per Skarin, William T\"arneberg, Karl-Erik {\AA}rzen, Maria Kihl | Towards Mission-Critical Control at the Edge and Over 5G | June 18th: Upload the final version as submitted to IEEE Services
[EDGE] 2018 on May 16th (updated abstract and some wording, results
unchanged) | null | null | null | cs.SY cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the emergence of industrial IoT and cloud computing, and the advent of
5G and edge clouds, there are ambitious expectations on elasticity, economies
of scale, and fast time to market for demanding use cases in the next
generation of ICT networks. Responsiveness and reliability of wireless
communication links and... | [
{
"created": "Tue, 6 Mar 2018 11:31:59 GMT",
"version": "v1"
},
{
"created": "Mon, 18 Jun 2018 08:25:56 GMT",
"version": "v2"
}
] | 2018-06-19 | [
[
"Skarin",
"Per",
""
],
[
"Tärneberg",
"William",
""
],
[
"Årzen",
"Karl-Erik",
""
],
[
"Kihl",
"Maria",
""
]
] | With the emergence of industrial IoT and cloud computing, and the advent of 5G and edge clouds, there are ambitious expectations on elasticity, economies of scale, and fast time to market for demanding use cases in the next generation of ICT networks. Responsiveness and reliability of wireless communication links and s... |
2205.14198 | Marina Knittel | Marina Knittel, Max Springer, John P. Dickerson, MohammadTaghi
Hajiaghayi | Generalized Reductions: Making any Hierarchical Clustering Fair and
Balanced with Low Cost | null | null | null | null | cs.LG cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Clustering is a fundamental building block of modern statistical analysis
pipelines. Fair clustering has seen much attention from the machine learning
community in recent years. We are some of the first to study fairness in the
context of hierarchical clustering, after the results of Ahmadian et al. from
NeurIPS in 2... | [
{
"created": "Fri, 27 May 2022 19:04:00 GMT",
"version": "v1"
},
{
"created": "Tue, 9 May 2023 21:59:01 GMT",
"version": "v2"
}
] | 2023-05-11 | [
[
"Knittel",
"Marina",
""
],
[
"Springer",
"Max",
""
],
[
"Dickerson",
"John P.",
""
],
[
"Hajiaghayi",
"MohammadTaghi",
""
]
] | Clustering is a fundamental building block of modern statistical analysis pipelines. Fair clustering has seen much attention from the machine learning community in recent years. We are some of the first to study fairness in the context of hierarchical clustering, after the results of Ahmadian et al. from NeurIPS in 202... |
2307.03003 | Johannes Jakubik | Johannes Jakubik, Daniel Weber, Patrick Hemmer, Michael V\"ossing,
Gerhard Satzger | Improving the Efficiency of Human-in-the-Loop Systems: Adding Artificial
to Human Experts | Accepted at International Conference on Wirtschaftsinformatik, 2023 | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Information systems increasingly leverage artificial intelligence (AI) and
machine learning (ML) to generate value from vast amounts of data. However, ML
models are imperfect and can generate incorrect classifications. Hence,
human-in-the-loop (HITL) extensions to ML models add a human review for
instances that are d... | [
{
"created": "Thu, 6 Jul 2023 14:06:23 GMT",
"version": "v1"
},
{
"created": "Fri, 7 Jul 2023 06:39:38 GMT",
"version": "v2"
}
] | 2023-07-10 | [
[
"Jakubik",
"Johannes",
""
],
[
"Weber",
"Daniel",
""
],
[
"Hemmer",
"Patrick",
""
],
[
"Vössing",
"Michael",
""
],
[
"Satzger",
"Gerhard",
""
]
] | Information systems increasingly leverage artificial intelligence (AI) and machine learning (ML) to generate value from vast amounts of data. However, ML models are imperfect and can generate incorrect classifications. Hence, human-in-the-loop (HITL) extensions to ML models add a human review for instances that are dif... |
1411.6749 | Tie (Tony) Luo | Tie Luo and Mehul Motani and Vikram Srinivasan | Analyzing DISH for Multi-Channel MAC Protocols in Wireless Networks | Multi-channel multi-hop networks, availability of cooperation,
cooperative protocol, distributed information sharing, ACM MobiHoc, May 2008 | null | null | null | cs.NI cs.PF | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For long, node cooperation has been exploited as a data relaying mechanism.
However, the wireless channel allows for much richer interaction between nodes.
One such scenario is in a multi-channel environment, where transmitter-receiver
pairs may make incorrect decisions (e.g., in selecting channels) but idle
neighbor... | [
{
"created": "Tue, 25 Nov 2014 06:58:51 GMT",
"version": "v1"
}
] | 2014-11-26 | [
[
"Luo",
"Tie",
""
],
[
"Motani",
"Mehul",
""
],
[
"Srinivasan",
"Vikram",
""
]
] | For long, node cooperation has been exploited as a data relaying mechanism. However, the wireless channel allows for much richer interaction between nodes. One such scenario is in a multi-channel environment, where transmitter-receiver pairs may make incorrect decisions (e.g., in selecting channels) but idle neighbors ... |
1803.01166 | Seonwook Park | Seonwook Park and Christoph Gebhardt and Roman R\"adle and Anna Feit
and Hana Vrzakova and Niraj Dayama and Hui-Shyong Yeo and Clemens Klokmose
and Aaron Quigley and Antti Oulasvirta and Otmar Hilliges | AdaM: Adapting Multi-User Interfaces for Collaborative Environments in
Real-Time | formatting tweaks | null | 10.1145/3173574.3173758 | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Developing cross-device multi-user interfaces (UIs) is a challenging problem.
There are numerous ways in which content and interactivity can be distributed.
However, good solutions must consider multiple users, their roles, their
preferences and access rights, as well as device capabilities. Manual and
rule-based sol... | [
{
"created": "Sat, 3 Mar 2018 14:05:07 GMT",
"version": "v1"
},
{
"created": "Thu, 29 Mar 2018 11:22:23 GMT",
"version": "v2"
}
] | 2018-03-30 | [
[
"Park",
"Seonwook",
""
],
[
"Gebhardt",
"Christoph",
""
],
[
"Rädle",
"Roman",
""
],
[
"Feit",
"Anna",
""
],
[
"Vrzakova",
"Hana",
""
],
[
"Dayama",
"Niraj",
""
],
[
"Yeo",
"Hui-Shyong",
""
],
[
"Kl... | Developing cross-device multi-user interfaces (UIs) is a challenging problem. There are numerous ways in which content and interactivity can be distributed. However, good solutions must consider multiple users, their roles, their preferences and access rights, as well as device capabilities. Manual and rule-based solut... |
2312.03357 | Doriand Petit | Doriand Petit, Steve Bourgeois, Dumitru Pavel, Vincent Gay-Bellile,
Florian Chabot and Loic Barthe | RING-NeRF : Rethinking Inductive Biases for Versatile and Efficient
Neural Fields | This publication has been accepted at ECCV'24 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent advances in Neural Fields mostly rely on developing task-specific
supervision which often complicates the models. Rather than developing
hard-to-combine and specific modules, another approach generally overlooked is
to directly inject generic priors on the scene representation (also called
inductive biases) in... | [
{
"created": "Wed, 6 Dec 2023 08:54:04 GMT",
"version": "v1"
},
{
"created": "Thu, 14 Mar 2024 13:58:06 GMT",
"version": "v2"
},
{
"created": "Wed, 17 Jul 2024 07:47:30 GMT",
"version": "v3"
}
] | 2024-07-18 | [
[
"Petit",
"Doriand",
""
],
[
"Bourgeois",
"Steve",
""
],
[
"Pavel",
"Dumitru",
""
],
[
"Gay-Bellile",
"Vincent",
""
],
[
"Chabot",
"Florian",
""
],
[
"Barthe",
"Loic",
""
]
] | Recent advances in Neural Fields mostly rely on developing task-specific supervision which often complicates the models. Rather than developing hard-to-combine and specific modules, another approach generally overlooked is to directly inject generic priors on the scene representation (also called inductive biases) into... |
2402.02399 | Hao Wang | Hao Wang, Licheng Pan, Zhichao Chen, Degui Yang, Sen Zhang, Yifei
Yang, Xinggao Liu, Haoxuan Li, Dacheng Tao | FreDF: Learning to Forecast in Frequency Domain | null | null | null | null | cs.LG cs.AI stat.AP stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Time series modeling is uniquely challenged by the presence of
autocorrelation in both historical and label sequences. Current research
predominantly focuses on handling autocorrelation within the historical
sequence but often neglects its presence in the label sequence. Specifically,
emerging forecast models mainly ... | [
{
"created": "Sun, 4 Feb 2024 08:23:41 GMT",
"version": "v1"
}
] | 2024-02-06 | [
[
"Wang",
"Hao",
""
],
[
"Pan",
"Licheng",
""
],
[
"Chen",
"Zhichao",
""
],
[
"Yang",
"Degui",
""
],
[
"Zhang",
"Sen",
""
],
[
"Yang",
"Yifei",
""
],
[
"Liu",
"Xinggao",
""
],
[
"Li",
"Haoxuan",
... | Time series modeling is uniquely challenged by the presence of autocorrelation in both historical and label sequences. Current research predominantly focuses on handling autocorrelation within the historical sequence but often neglects its presence in the label sequence. Specifically, emerging forecast models mainly co... |
2311.15260 | Adam Tonderski | Adam Tonderski, Carl Lindstr\"om, Georg Hess, William Ljungbergh,
Lennart Svensson, Christoffer Petersson | NeuRAD: Neural Rendering for Autonomous Driving | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Neural radiance fields (NeRFs) have gained popularity in the autonomous
driving (AD) community. Recent methods show NeRFs' potential for closed-loop
simulation, enabling testing of AD systems, and as an advanced training data
augmentation technique. However, existing methods often require long training
times, dense s... | [
{
"created": "Sun, 26 Nov 2023 10:27:22 GMT",
"version": "v1"
},
{
"created": "Tue, 5 Dec 2023 09:53:18 GMT",
"version": "v2"
},
{
"created": "Thu, 18 Apr 2024 12:44:56 GMT",
"version": "v3"
}
] | 2024-04-19 | [
[
"Tonderski",
"Adam",
""
],
[
"Lindström",
"Carl",
""
],
[
"Hess",
"Georg",
""
],
[
"Ljungbergh",
"William",
""
],
[
"Svensson",
"Lennart",
""
],
[
"Petersson",
"Christoffer",
""
]
] | Neural radiance fields (NeRFs) have gained popularity in the autonomous driving (AD) community. Recent methods show NeRFs' potential for closed-loop simulation, enabling testing of AD systems, and as an advanced training data augmentation technique. However, existing methods often require long training times, dense sem... |
1207.2847 | Kai Liu | Kai Liu, Hock Beng Lim | Positioning Accuracy Improvement via Distributed Location Estimate in
Cooperative Vehicular Networks | To appear in Proc. of the 15th International IEEE Conference on
Intelligent Transportation Systems (IEEE ITSC'12) | null | 10.1109/ITSC.2012.6338743 | null | cs.DC cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The development of cooperative vehicle safety (CVS) applications, such as
collision warnings, turning assistants, and speed advisories, etc., has
received great attention in the past few years. Accurate vehicular localization
is essential to enable these applications. In this study, motivated by the
proliferation of ... | [
{
"created": "Thu, 12 Jul 2012 05:27:16 GMT",
"version": "v1"
},
{
"created": "Sat, 14 Jul 2012 06:32:37 GMT",
"version": "v2"
},
{
"created": "Fri, 20 Jul 2012 08:33:23 GMT",
"version": "v3"
}
] | 2016-11-15 | [
[
"Liu",
"Kai",
""
],
[
"Lim",
"Hock Beng",
""
]
] | The development of cooperative vehicle safety (CVS) applications, such as collision warnings, turning assistants, and speed advisories, etc., has received great attention in the past few years. Accurate vehicular localization is essential to enable these applications. In this study, motivated by the proliferation of th... |
0802.0820 | Jonathan Hayman | Jonathan Hayman and Glynn Winskel | Independence and concurrent separation logic | null | Logical Methods in Computer Science, Volume 4, Issue 1 (March 19,
2008) lmcs:1100 | 10.2168/LMCS-4(1:6)2008 | null | cs.LO cs.PL | null | A compositional Petri net-based semantics is given to a simple language
allowing pointer manipulation and parallelism. The model is then applied to
give a notion of validity to the judgements made by concurrent separation logic
that emphasizes the process-environment duality inherent in such rely-guarantee
reasoning.... | [
{
"created": "Wed, 6 Feb 2008 15:39:20 GMT",
"version": "v1"
},
{
"created": "Wed, 19 Mar 2008 15:26:51 GMT",
"version": "v2"
}
] | 2015-07-01 | [
[
"Hayman",
"Jonathan",
""
],
[
"Winskel",
"Glynn",
""
]
] | A compositional Petri net-based semantics is given to a simple language allowing pointer manipulation and parallelism. The model is then applied to give a notion of validity to the judgements made by concurrent separation logic that emphasizes the process-environment duality inherent in such rely-guarantee reasoning. S... |
2101.00318 | Xiaofeng Liu | Xiaofeng Liu, Xiongchang Liu, Bo Hu, Wenxuan Ji, Fangxu Xing, Jun Lu,
Jane You, C.-C. Jay Kuo, Georges El Fakhri, Jonghye Woo | Subtype-aware Unsupervised Domain Adaptation for Medical Diagnosis | Accepted to AAAI 2021 | null | null | null | cs.CV cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | Recent advances in unsupervised domain adaptation (UDA) show that
transferable prototypical learning presents a powerful means for class
conditional alignment, which encourages the closeness of cross-domain class
centroids. However, the cross-domain inner-class compactness and the underlying
fine-grained subtype stru... | [
{
"created": "Fri, 1 Jan 2021 21:04:50 GMT",
"version": "v1"
},
{
"created": "Mon, 11 Jan 2021 15:09:03 GMT",
"version": "v2"
}
] | 2021-01-12 | [
[
"Liu",
"Xiaofeng",
""
],
[
"Liu",
"Xiongchang",
""
],
[
"Hu",
"Bo",
""
],
[
"Ji",
"Wenxuan",
""
],
[
"Xing",
"Fangxu",
""
],
[
"Lu",
"Jun",
""
],
[
"You",
"Jane",
""
],
[
"Kuo",
"C. -C. Jay",
... | Recent advances in unsupervised domain adaptation (UDA) show that transferable prototypical learning presents a powerful means for class conditional alignment, which encourages the closeness of cross-domain class centroids. However, the cross-domain inner-class compactness and the underlying fine-grained subtype struct... |
1104.4668 | Massimiliano Vasile Massimiliano Vasile | Matteo Ceriotti and Massimiliano Vasile | MGA trajectory planning with an ACO-inspired algorithm | null | Acta Astronautica, 67 (9-10). pp. 1202-1217, ISSN 0094-5765, 2010 | null | null | cs.CE cs.NE cs.SY math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Given a set of celestial bodies, the problem of finding an optimal sequence
of swing-bys, deep space manoeuvres (DSM) and transfer arcs connecting the
elements of the set is combinatorial in nature. The number of possible paths
grows exponentially with the number of celestial bodies. Therefore, the design
of an optim... | [
{
"created": "Mon, 25 Apr 2011 00:58:35 GMT",
"version": "v1"
}
] | 2011-04-26 | [
[
"Ceriotti",
"Matteo",
""
],
[
"Vasile",
"Massimiliano",
""
]
] | Given a set of celestial bodies, the problem of finding an optimal sequence of swing-bys, deep space manoeuvres (DSM) and transfer arcs connecting the elements of the set is combinatorial in nature. The number of possible paths grows exponentially with the number of celestial bodies. Therefore, the design of an optimal... |
2310.02264 | Mingyu Ding | Haoyu Zhou, Mingyu Ding, Weikun Peng, Masayoshi Tomizuka, Lin Shao,
Chuang Gan | Generalizable Long-Horizon Manipulations with Large Language Models | null | null | null | null | cs.RO cs.CL cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work introduces a framework harnessing the capabilities of Large
Language Models (LLMs) to generate primitive task conditions for generalizable
long-horizon manipulations with novel objects and unseen tasks. These task
conditions serve as guides for the generation and adjustment of Dynamic
Movement Primitives (D... | [
{
"created": "Tue, 3 Oct 2023 17:59:46 GMT",
"version": "v1"
}
] | 2023-10-04 | [
[
"Zhou",
"Haoyu",
""
],
[
"Ding",
"Mingyu",
""
],
[
"Peng",
"Weikun",
""
],
[
"Tomizuka",
"Masayoshi",
""
],
[
"Shao",
"Lin",
""
],
[
"Gan",
"Chuang",
""
]
] | This work introduces a framework harnessing the capabilities of Large Language Models (LLMs) to generate primitive task conditions for generalizable long-horizon manipulations with novel objects and unseen tasks. These task conditions serve as guides for the generation and adjustment of Dynamic Movement Primitives (DMP... |
1706.06239 | Hao Wang | Hao Wang, Yanmei Fu, Qinyong Wang, Hongzhi Yin, Changying Du, Hui
Xiong | A Location-Sentiment-Aware Recommender System for Both Home-Town and
Out-of-Town Users | Accepted by KDD 2017 | null | null | null | cs.SI cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Spatial item recommendation has become an important means to help people
discover interesting locations, especially when people pay a visit to
unfamiliar regions. Some current researches are focusing on modelling
individual and collective geographical preferences for spatial item
recommendation based on users' check-... | [
{
"created": "Tue, 20 Jun 2017 01:54:01 GMT",
"version": "v1"
}
] | 2017-06-21 | [
[
"Wang",
"Hao",
""
],
[
"Fu",
"Yanmei",
""
],
[
"Wang",
"Qinyong",
""
],
[
"Yin",
"Hongzhi",
""
],
[
"Du",
"Changying",
""
],
[
"Xiong",
"Hui",
""
]
] | Spatial item recommendation has become an important means to help people discover interesting locations, especially when people pay a visit to unfamiliar regions. Some current researches are focusing on modelling individual and collective geographical preferences for spatial item recommendation based on users' check-in... |
1305.3354 | Sandip Chakraborty | Sandip Chakraborty, Soumyadip Majumder, Diganta Goswami | Approximate Congestion Games for Load Balancing in Distributed
Environment | A version of this work has been presented at International Workshop
on Distributed System (IWDS) 2010, IIT Kanpur, India, as a "work-in-progress"
report | null | null | null | cs.NI cs.DC cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The use of game theoretic models has been quite successful in describing
various cooperative and non-cooperative optimization problems in networks and
other domains of computer systems. In this paper, we study an application of
game theoretic models in the domain of distributed system, where nodes play a
game to bala... | [
{
"created": "Wed, 15 May 2013 05:06:02 GMT",
"version": "v1"
}
] | 2013-05-16 | [
[
"Chakraborty",
"Sandip",
""
],
[
"Majumder",
"Soumyadip",
""
],
[
"Goswami",
"Diganta",
""
]
] | The use of game theoretic models has been quite successful in describing various cooperative and non-cooperative optimization problems in networks and other domains of computer systems. In this paper, we study an application of game theoretic models in the domain of distributed system, where nodes play a game to balanc... |
2309.13438 | Tingyu Zhao | Tingyu Zhao, Bo Peng, Yuan Sun, Daipeng Yang, Zhenguang Zhang, and Xi
Wu | Rethinking Superpixel Segmentation from Biologically Inspired Mechanisms | null | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently, advancements in deep learning-based superpixel segmentation methods
have brought about improvements in both the efficiency and the performance of
segmentation. However, a significant challenge remains in generating
superpixels that strictly adhere to object boundaries while conveying rich
visual significanc... | [
{
"created": "Sat, 23 Sep 2023 17:29:38 GMT",
"version": "v1"
},
{
"created": "Wed, 4 Oct 2023 12:13:53 GMT",
"version": "v2"
},
{
"created": "Wed, 11 Oct 2023 06:43:08 GMT",
"version": "v3"
}
] | 2023-10-12 | [
[
"Zhao",
"Tingyu",
""
],
[
"Peng",
"Bo",
""
],
[
"Sun",
"Yuan",
""
],
[
"Yang",
"Daipeng",
""
],
[
"Zhang",
"Zhenguang",
""
],
[
"Wu",
"Xi",
""
]
] | Recently, advancements in deep learning-based superpixel segmentation methods have brought about improvements in both the efficiency and the performance of segmentation. However, a significant challenge remains in generating superpixels that strictly adhere to object boundaries while conveying rich visual significance,... |
2211.17059 | Yiyang Liu | Yiyang Liu, Chenxin Li, Xiaotong Tu, Xinghao Ding, Yue Huang | Hint-dynamic Knowledge Distillation | 5 pages | null | null | null | cs.CV cs.LG | http://creativecommons.org/licenses/by/4.0/ | Knowledge Distillation (KD) transfers the knowledge from a high-capacity
teacher model to promote a smaller student model. Existing efforts guide the
distillation by matching their prediction logits, feature embedding, etc.,
while leaving how to efficiently utilize them in junction less explored. In
this paper, we pr... | [
{
"created": "Wed, 30 Nov 2022 15:03:53 GMT",
"version": "v1"
}
] | 2022-12-01 | [
[
"Liu",
"Yiyang",
""
],
[
"Li",
"Chenxin",
""
],
[
"Tu",
"Xiaotong",
""
],
[
"Ding",
"Xinghao",
""
],
[
"Huang",
"Yue",
""
]
] | Knowledge Distillation (KD) transfers the knowledge from a high-capacity teacher model to promote a smaller student model. Existing efforts guide the distillation by matching their prediction logits, feature embedding, etc., while leaving how to efficiently utilize them in junction less explored. In this paper, we prop... |
1301.4478 | Chaitanya Swamy | Sara Ahmadian, Zachary Friggstad, and Chaitanya Swamy | Local-Search based Approximation Algorithms for Mobile Facility Location
Problems | null | null | null | null | cs.DS cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the {\em mobile facility location} (\mfl) problem. We are given a
set of facilities and clients located in a common metric space. The goal is to
move each facility from its initial location to a destination and assign each
client to the destination of some facility so as to minimize the sum of the
movemen... | [
{
"created": "Fri, 18 Jan 2013 20:05:12 GMT",
"version": "v1"
}
] | 2013-01-21 | [
[
"Ahmadian",
"Sara",
""
],
[
"Friggstad",
"Zachary",
""
],
[
"Swamy",
"Chaitanya",
""
]
] | We consider the {\em mobile facility location} (\mfl) problem. We are given a set of facilities and clients located in a common metric space. The goal is to move each facility from its initial location to a destination and assign each client to the destination of some facility so as to minimize the sum of the movement-... |
2009.04656 | Yian Li | Yian Li, Hai Zhao | Learning Universal Representations from Word to Sentence | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Despite the well-developed cut-edge representation learning for language,
most language representation models usually focus on specific level of
linguistic unit, which cause great inconvenience when being confronted with
handling multiple layers of linguistic objects in a unified way. Thus this work
introduces and ex... | [
{
"created": "Thu, 10 Sep 2020 03:53:18 GMT",
"version": "v1"
}
] | 2020-09-11 | [
[
"Li",
"Yian",
""
],
[
"Zhao",
"Hai",
""
]
] | Despite the well-developed cut-edge representation learning for language, most language representation models usually focus on specific level of linguistic unit, which cause great inconvenience when being confronted with handling multiple layers of linguistic objects in a unified way. Thus this work introduces and expl... |
2303.07831 | Yu Zhou | Yu Zhou, Liyuan Guo, Lianghai Jin | Quaternion Orthogonal Transformer for Facial Expression Recognition in
the Wild | This paper has been accepted to ICASSP2023 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Facial expression recognition (FER) is a challenging topic in artificial
intelligence. Recently, many researchers have attempted to introduce Vision
Transformer (ViT) to the FER task. However, ViT cannot fully utilize emotional
features extracted from raw images and requires a lot of computing resources.
To overcome ... | [
{
"created": "Tue, 14 Mar 2023 12:07:48 GMT",
"version": "v1"
}
] | 2023-03-15 | [
[
"Zhou",
"Yu",
""
],
[
"Guo",
"Liyuan",
""
],
[
"Jin",
"Lianghai",
""
]
] | Facial expression recognition (FER) is a challenging topic in artificial intelligence. Recently, many researchers have attempted to introduce Vision Transformer (ViT) to the FER task. However, ViT cannot fully utilize emotional features extracted from raw images and requires a lot of computing resources. To overcome th... |
2001.08328 | Yuwei Tu | Yuwei Tu, Weiyu Chen, Christopher G. Brinton | A Deep Learning Approach to Behavior-Based Learner Modeling | null | null | null | null | cs.LG cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The increasing popularity of e-learning has created demand for improving
online education through techniques such as predictive analytics and content
recommendations. In this paper, we study learner outcome predictions, i.e.,
predictions of how they will perform at the end of a course. We propose a novel
Two Branch D... | [
{
"created": "Thu, 23 Jan 2020 01:26:52 GMT",
"version": "v1"
}
] | 2020-01-24 | [
[
"Tu",
"Yuwei",
""
],
[
"Chen",
"Weiyu",
""
],
[
"Brinton",
"Christopher G.",
""
]
] | The increasing popularity of e-learning has created demand for improving online education through techniques such as predictive analytics and content recommendations. In this paper, we study learner outcome predictions, i.e., predictions of how they will perform at the end of a course. We propose a novel Two Branch Dec... |
1809.07912 | Meng Shen | Meng Shen, Baoli Ma, Liehuang Zhu, Rashid Mijumbi, Xiaojiang Du, and
Jiankun Hu | Cloud-Based Approximate Constrained Shortest Distance Queries Over
Encrypted Graphs With Privacy Protection | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Constrained shortest distance (CSD) querying is one of the fundamental graph
query primitives, which finds the shortest distance from an origin to a
destination in a graph with a constraint that the total cost does not exceed a
given threshold. CSD querying has a wide range of applications, such as routing
in telecom... | [
{
"created": "Fri, 21 Sep 2018 01:58:00 GMT",
"version": "v1"
}
] | 2018-09-24 | [
[
"Shen",
"Meng",
""
],
[
"Ma",
"Baoli",
""
],
[
"Zhu",
"Liehuang",
""
],
[
"Mijumbi",
"Rashid",
""
],
[
"Du",
"Xiaojiang",
""
],
[
"Hu",
"Jiankun",
""
]
] | Constrained shortest distance (CSD) querying is one of the fundamental graph query primitives, which finds the shortest distance from an origin to a destination in a graph with a constraint that the total cost does not exceed a given threshold. CSD querying has a wide range of applications, such as routing in telecommu... |
2403.07238 | Mostafa Jamshidian | Farah Alkhatib, Mostafa Jamshidian, Donatien Le Liepvre, Florian
Bernard, Ludovic Minvielle, Adam Wittek, Karol Miller | Towards Full Automation of Geometry Extraction for Biomechanical
Analysis of Abdominal Aortic Aneurysm; Neural Network-Based versus Classical
Methodologies | 32 pages, 9 figures | null | null | null | cs.CE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this study we investigated the impact of image segmentation methods on the
results of stress computation in the wall of abdominal aortic aneurysms (AAAs).
We compared wall stress distributions and magnitudes calculated from geometry
models obtained from classical semi-automated segmentation versus automated
neural... | [
{
"created": "Tue, 12 Mar 2024 01:20:34 GMT",
"version": "v1"
}
] | 2024-03-13 | [
[
"Alkhatib",
"Farah",
""
],
[
"Jamshidian",
"Mostafa",
""
],
[
"Liepvre",
"Donatien Le",
""
],
[
"Bernard",
"Florian",
""
],
[
"Minvielle",
"Ludovic",
""
],
[
"Wittek",
"Adam",
""
],
[
"Miller",
"Karol",
""
... | In this study we investigated the impact of image segmentation methods on the results of stress computation in the wall of abdominal aortic aneurysms (AAAs). We compared wall stress distributions and magnitudes calculated from geometry models obtained from classical semi-automated segmentation versus automated neural n... |
2406.17873 | Zhongtao Miao | Zhongtao Miao, Kaiyan Zhao, Yoshimasa Tsuruoka | Improving Arithmetic Reasoning Ability of Large Language Models through
Relation Tuples, Verification and Dynamic Feedback | Under review, 25 figures, 8 tables, 29 pages | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Current representations used in reasoning steps of large language models can
mostly be categorized into two main types: (1) natural language, which is
difficult to verify; and (2) non-natural language, usually programming code,
which is difficult for people who are unfamiliar with coding to read. In this
paper, we pr... | [
{
"created": "Tue, 25 Jun 2024 18:21:00 GMT",
"version": "v1"
}
] | 2024-06-27 | [
[
"Miao",
"Zhongtao",
""
],
[
"Zhao",
"Kaiyan",
""
],
[
"Tsuruoka",
"Yoshimasa",
""
]
] | Current representations used in reasoning steps of large language models can mostly be categorized into two main types: (1) natural language, which is difficult to verify; and (2) non-natural language, usually programming code, which is difficult for people who are unfamiliar with coding to read. In this paper, we prop... |
2306.17411 | Yanjiang Guo | Yanjiang Guo, Zheyuan Jiang, Yen-Jen Wang, Jingyue Gao, Jianyu Chen | Decentralized Motor Skill Learning for Complex Robotic Systems | 8 pages, 7 figures | null | null | null | cs.RO cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Reinforcement learning (RL) has achieved remarkable success in complex
robotic systems (eg. quadruped locomotion). In previous works, the RL-based
controller was typically implemented as a single neural network with
concatenated observation input. However, the corresponding learned policy is
highly task-specific. Sin... | [
{
"created": "Fri, 30 Jun 2023 05:55:34 GMT",
"version": "v1"
}
] | 2023-07-03 | [
[
"Guo",
"Yanjiang",
""
],
[
"Jiang",
"Zheyuan",
""
],
[
"Wang",
"Yen-Jen",
""
],
[
"Gao",
"Jingyue",
""
],
[
"Chen",
"Jianyu",
""
]
] | Reinforcement learning (RL) has achieved remarkable success in complex robotic systems (eg. quadruped locomotion). In previous works, the RL-based controller was typically implemented as a single neural network with concatenated observation input. However, the corresponding learned policy is highly task-specific. Since... |
2210.02287 | Luyuan Xie | Luyuan Xie, Yan Zhong, Lin Yang, Zhaoyu Yan, Zhonghai Wu, Junjie Wang | TC-SKNet with GridMask for Low-complexity Classification of Acoustic
scene | Accepted to APSIPA ASC 2022 | null | null | null | cs.SD cs.LG eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Convolution neural networks (CNNs) have good performance in low-complexity
classification tasks such as acoustic scene classifications (ASCs). However,
there are few studies on the relationship between the length of target speech
and the size of the convolution kernels. In this paper, we combine Selective
Kernel Netw... | [
{
"created": "Wed, 5 Oct 2022 14:24:17 GMT",
"version": "v1"
}
] | 2022-10-06 | [
[
"Xie",
"Luyuan",
""
],
[
"Zhong",
"Yan",
""
],
[
"Yang",
"Lin",
""
],
[
"Yan",
"Zhaoyu",
""
],
[
"Wu",
"Zhonghai",
""
],
[
"Wang",
"Junjie",
""
]
] | Convolution neural networks (CNNs) have good performance in low-complexity classification tasks such as acoustic scene classifications (ASCs). However, there are few studies on the relationship between the length of target speech and the size of the convolution kernels. In this paper, we combine Selective Kernel Networ... |
cs/0208044 | Stephen A. Fenner | Stephen A. Fenner | Gales and supergales are equivalent for defining constructive Hausdorff
dimension | 7 pages, no figures | null | null | null | cs.CC | null | We show that for a wide range of probability measures, constructive gales are
interchangable with constructive supergales for defining constructive Hausdorff
dimension, thus generalizing a previous independent result of Hitchcock
(cs.CC/0208043) and partially answering an open question of Lutz
(cs.CC/0203017).
| [
{
"created": "Thu, 29 Aug 2002 21:25:47 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Fenner",
"Stephen A.",
""
]
] | We show that for a wide range of probability measures, constructive gales are interchangable with constructive supergales for defining constructive Hausdorff dimension, thus generalizing a previous independent result of Hitchcock (cs.CC/0208043) and partially answering an open question of Lutz (cs.CC/0203017). |
1803.06904 | SeyedMajid Azimi | Seyed Majid Azimi, Peter Fischer, Marco K\"orner, Peter Reinartz | Aerial LaneNet: Lane Marking Semantic Segmentation in Aerial Imagery
using Wavelet-Enhanced Cost-sensitive Symmetric Fully Convolutional Neural
Networks | IEEE TGRS 2018 - Accepted | null | 10.1109/TGRS.2018.2878510 | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | The knowledge about the placement and appearance of lane markings is a
prerequisite for the creation of maps with high precision, necessary for
autonomous driving, infrastructure monitoring, lane-wise traffic management,
and urban planning. Lane markings are one of the important components of such
maps. Lane markings... | [
{
"created": "Mon, 19 Mar 2018 13:32:27 GMT",
"version": "v1"
},
{
"created": "Thu, 1 Nov 2018 16:16:51 GMT",
"version": "v2"
}
] | 2019-08-26 | [
[
"Azimi",
"Seyed Majid",
""
],
[
"Fischer",
"Peter",
""
],
[
"Körner",
"Marco",
""
],
[
"Reinartz",
"Peter",
""
]
] | The knowledge about the placement and appearance of lane markings is a prerequisite for the creation of maps with high precision, necessary for autonomous driving, infrastructure monitoring, lane-wise traffic management, and urban planning. Lane markings are one of the important components of such maps. Lane markings c... |
2405.00287 | Jeongwhan Choi | Chaejeong Lee, Jeongwhan Choi, Hyowon Wi, Sung-Bae Cho, Noseong Park | Stochastic Sampling for Contrastive Views and Hard Negative Samples in
Graph-based Collaborative Filtering | null | null | null | null | cs.IR cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Graph-based collaborative filtering (CF) has emerged as a promising approach
in recommendation systems. Despite its achievements, graph-based CF models face
challenges due to data sparsity and negative sampling. In this paper, we
propose a novel Stochastic sampling for i) COntrastive views and ii) hard
NEgative sampl... | [
{
"created": "Wed, 1 May 2024 02:27:59 GMT",
"version": "v1"
}
] | 2024-05-02 | [
[
"Lee",
"Chaejeong",
""
],
[
"Choi",
"Jeongwhan",
""
],
[
"Wi",
"Hyowon",
""
],
[
"Cho",
"Sung-Bae",
""
],
[
"Park",
"Noseong",
""
]
] | Graph-based collaborative filtering (CF) has emerged as a promising approach in recommendation systems. Despite its achievements, graph-based CF models face challenges due to data sparsity and negative sampling. In this paper, we propose a novel Stochastic sampling for i) COntrastive views and ii) hard NEgative samples... |
1811.00677 | Rafael Menelau Oliveira E Cruz | Rafael M. O. Cruz, Robert Sabourin, George D. C. Cavalcanti | Analyzing different prototype selection techniques for dynamic
classifier and ensemble selection | null | Published on the International Joint Conference on Neural
Networks, 2017, 3959-3966 | 10.1109/IJCNN.2017.7966355 | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In dynamic selection (DS) techniques, only the most competent classifiers,
for the classification of a specific test sample are selected to predict the
sample's class labels. The more important step in DES techniques is estimating
the competence of the base classifiers for the classification of each specific
test sam... | [
{
"created": "Thu, 1 Nov 2018 23:34:10 GMT",
"version": "v1"
}
] | 2018-11-05 | [
[
"Cruz",
"Rafael M. O.",
""
],
[
"Sabourin",
"Robert",
""
],
[
"Cavalcanti",
"George D. C.",
""
]
] | In dynamic selection (DS) techniques, only the most competent classifiers, for the classification of a specific test sample are selected to predict the sample's class labels. The more important step in DES techniques is estimating the competence of the base classifiers for the classification of each specific test sampl... |
2009.05487 | Timo Freiesleben | Timo Freiesleben | The Intriguing Relation Between Counterfactual Explanations and
Adversarial Examples | null | null | 10.1007/s11023-021-09580-9 | null | cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The same method that creates adversarial examples (AEs) to fool
image-classifiers can be used to generate counterfactual explanations (CEs)
that explain algorithmic decisions. This observation has led researchers to
consider CEs as AEs by another name. We argue that the relationship to the true
label and the toleranc... | [
{
"created": "Fri, 11 Sep 2020 15:09:12 GMT",
"version": "v1"
},
{
"created": "Thu, 3 Dec 2020 10:05:17 GMT",
"version": "v2"
},
{
"created": "Thu, 26 Aug 2021 08:40:29 GMT",
"version": "v3"
}
] | 2021-11-03 | [
[
"Freiesleben",
"Timo",
""
]
] | The same method that creates adversarial examples (AEs) to fool image-classifiers can be used to generate counterfactual explanations (CEs) that explain algorithmic decisions. This observation has led researchers to consider CEs as AEs by another name. We argue that the relationship to the true label and the tolerance ... |
2406.16527 | Miguel Arana-Catania | Zheng Fang, Miguel Arana-Catania, Felix-Anselm van Lier, Juliana Outes
Velarde, Harry Bregazzi, Mara Airoldi, Eleanor Carter, Rob Procter | SyROCCo: Enhancing Systematic Reviews using Machine Learning | 28 pages, 5 figures. To appear in Data & Policy journal | null | null | null | cs.CL cs.CY cs.DL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The sheer number of research outputs published every year makes systematic
reviewing increasingly time- and resource-intensive. This paper explores the
use of machine learning techniques to help navigate the systematic review
process. ML has previously been used to reliably 'screen' articles for review -
that is, ide... | [
{
"created": "Mon, 24 Jun 2024 11:04:43 GMT",
"version": "v1"
}
] | 2024-06-25 | [
[
"Fang",
"Zheng",
""
],
[
"Arana-Catania",
"Miguel",
""
],
[
"van Lier",
"Felix-Anselm",
""
],
[
"Velarde",
"Juliana Outes",
""
],
[
"Bregazzi",
"Harry",
""
],
[
"Airoldi",
"Mara",
""
],
[
"Carter",
"Eleanor",
... | The sheer number of research outputs published every year makes systematic reviewing increasingly time- and resource-intensive. This paper explores the use of machine learning techniques to help navigate the systematic review process. ML has previously been used to reliably 'screen' articles for review - that is, ident... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.