A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Spy vs. Spy: Rumor Source Obfuscation
[article]
2015
arXiv
pre-print
Preserved Fulltext
Other Versions
Experiments on a sampled Facebook network show that it effectively hides the location of the source even when the graph is finite, irregular and has cycles. ...
Recent advances in rumor source detection shows that the existing messaging protocols are vulnerable against such an adversary. ...
Although adaptive diffusion obfuscates the source on infinite regular trees, real world contact networks have cycles, and degrees are irregular, and the size is finite. ...
arXiv:1412.8439v3
fatcat:qj7afdjfuvbqfpwwljnf3hsx4i
Hiding the Rumor Source
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Experiments on a sampled Facebook network demonstrate that adaptive diffusion effectively hides the location of the source even when the graph is finite, irregular and has cycles. ...
the source when the underlying contact network is an infinite regular tree. ...
Irregular Trees In this section, we study adaptive diffusion on irregular trees, with potentially different degrees at the vertices. ...
arXiv:1509.02849v2
fatcat:f4q6qv4nrnhifdy7yg7irii4bm
Rumor source detection with multiple observations under adaptive diffusions
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We show that (1) a weak form of source obfuscation is still possible in the case of two independent snapshots, but (2) already with three observations there is a simple algorithm that finds the rumor source ...
Recent work, motivated by anonymous messaging platforms, has introduced adaptive diffusion protocols which can obfuscate the source of a rumor: a "snapshot adversary" with access to the subgraph of "infected ...
Rumor source obfuscation. ...
arXiv:2006.11211v1
fatcat:3jt3geh4rjgwrpjdcchbvsqsgy
Infection Spreading and Source Identification: A Hide and Seek Game
2016
IEEE Transactions on Signal Processing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2015 pre-print arXiv:1504.04796v1 fatcat:vivo3dk53ngmhb3hbuql3av66yOther Versions
On the other hand, the network administrator aims to identify the source node based on knowledge of which nodes have been infected. ...
The goal of an infection source node (e.g., a rumor or computer virus source) in a network is to spread its infection to as many nodes as possible, while remaining hidden from the network administrator ...
Moreover, simulations are provided in [20] to verify the performance of the messaging protocol on irregular trees and general networks. ...
doi:10.1109/tsp.2016.2558168
fatcat:gro2vrwcirffbl2r7logzqfx4m
Epidemic Source Detection in Contact Tracing Networks: Epidemic Centrality in Graphs and Message-Passing Algorithms
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We study the epidemic source detection problem in contact tracing networks modeled as a graph-constrained maximum likelihood estimation problem using the susceptible-infected model in epidemiology. ...
In particular, we show that the optimal solution of the maximum likelihood estimator can be refined to distances on graphs based on a novel statistical distance centrality that captures the optimality ...
Note that, when G n is a general graph, rumor center is only defined on the BFS spanning tree of G n . ...
arXiv:2201.06751v1
fatcat:mqzkoq62qrbivgq3uefgppoee4
Metadata-conscious anonymous messaging
2016
IEEE Transactions on Signal and Information Processing over Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
We further demonstrate empirically that adaptive diffusion hides the source effectively on real social networks. ...
The spread of messages on these platforms can be modeled by a diffusion process over a graph. ...
Specifically, we show that the tree protocol achieves provably (asymptotically) optimal source obfuscation, significantly improving upon standard diffusion. ...
doi:10.1109/tsipn.2016.2605761
fatcat:rugyvh2ojfb3xa7jrnddmzehy4
Anonymity Properties of the Bitcoin P2P Network
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We theoretically prove that Bitcoin's networking protocols (both pre- and post-2015) offer poor anonymity properties on networks with a regular-tree topology. ...
In doing so, we consider new adversarial models and spreading mechanisms that have not been previously studied in the source-finding literature. ...
Andrew Miller for pointing out the Bitcoin community's transition from trickle to diffusion, Varun Jog for valuable insights about the limiting behavior of Pòlya urns, and Sewoong Oh for discussions on ...
arXiv:1703.08761v1
fatcat:imte7a44fjauzalyxqt2gieusm
Text Analysis in Adversarial Settings: Does Deception Leave a Stylistic Trace?
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Additionally, we discuss forms of deception beyond semantic content, focusing on hiding author identity by writing style obfuscation. ...
Surveying the literature on both author identification and obfuscation techniques, we conclude that current style transformation methods fail to achieve reliable obfuscation while simultaneously ensuring ...
A comparison of studies using ILT for style obfuscation ("Success" = the reported success of the approach in deceiving author identification, based on the source paper.) ...
arXiv:1902.08939v2
fatcat:qjbxcq5fpjaubj5z5xii3v44mu
Text Analysis in Adversarial Settings
2019
ACM Computing Surveys
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Additionally, we discuss forms of deception beyond semantic content, focusing on hiding author identity by writing style obfuscation. ...
Surveying the literature on both author identification and obfuscation techniques, we conclude that current style transformation methods fail to achieve reliable obfuscation while simultaneously ensuring ...
This feature had a positive effect on classification, and links troll-detection to rumor-debunking, where similar content-comparison methods prevail [147] . ...
doi:10.1145/3310331
fatcat:563vjvd63fcdnnswmvmsxthu7e
Construing the big data based on taxonomy, analytics and approaches
2018
Iran Journal of Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Researchers are also focusing on detecting the rumors, fake news and fake likes, videos, text, and audio recordings from social media platforms [128, 129] . ...
They are characterized by partial, irregular and implicit structure. ...
doi:10.1007/s42044-018-0024-3
fatcat:teiovluolngepjyebzz2wnwjxu
"The Fruit of the Poisonous Tree" Revisited and Shepardized
1968
California Law Review
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
source," there is little reason to view the evidence as anything other than the "fruit of the poisonous tree." ...
source. ...
doi:10.2307/3479264
fatcat:ofdjx4ggbffbri4g6o4cloaata
How to apply de Bruijn graphs to genome assembly
2011
Nature Biotechnology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
One of the simplest data structures is a binary tree in which each node begets two more nodes. e branches of this graph expand in powers of two, so a er just 16 generations, there are already 131,071 nodes ...
But graph algorithms are computationally challenging because of their irregular structure and combinatorial expansion. ...
doi:10.1038/nbt.2023
pmid:22068540
pmcid:PMC5531759
fatcat:yvbmxbd2pnbg5ojtaqggieuiia
Event Prediction in the Big Data Era: A Systematic Survey
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
There is a large amount of existing work that focuses on addressing the challenges involved, including heterogeneous multi-faceted outputs, complex dependencies, and streaming data feeds. ...
To improve the memory efficiency, this can be limited to a consideration of just the source and current locations, leveraging a quad-tree style architecture to store the historical information. ...
Similarly, [45] proposed another tree structure referred to as a "circular binary search tree" to manage the event occurrence pattern. ...
arXiv:2007.09815v3
fatcat:ypmjm3n3xjbcjbzdlhowdkaona
Mechanics Lost: Husserl's Galileo and Ihde's Telescope
2016
Husserl Studies
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source ...
On the other hand, however, Galileo obfuscated the true nature of his own revolution because he failed to inquire into the ''how'' of geometry's applicability to reality. ...
This means, among other things, that the stick has become a source of direct, non-inferential information about the world. ...
doi:10.1007/s10743-016-9204-x
fatcat:jslpgln5vvfzrpw5tbtllafcym
Two bits: the cultural significance of free software
2008
ChoiceReviews
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
One such lieutenant was Dave Miller, who maintained a "mirror" of the stable Linux kernel tree, the VGER tree, on a server at Rutgers. ...
UNIX is admired for its integrity as a conceptual thing and despised (or marveled at) for its truly tangled genealogical tree of ports and forks: new versions of UNIX, some based directly on the source ...
The most recent source for this is Rabinow, Anthropos Today. ...
doi:10.5860/choice.46-2158
fatcat:jtxrurovzvexbm7lslgffroqem
« Previous
Showing results 1 — 15 out of 197 results