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
.
Filters
Brief Announcement: Exact Size Counting in Uniform Population Protocols in Nearly Logarithmic Time
2018
International Symposium on Distributed Computing
The size counting problem is that of calculating the exact number n of agents in the population, assuming no leader (each agent starts in the same state). ...
Crucially, unlike most published protocols with ω(1) states, our protocol is uniform: it uses the same transition algorithm for any population size, so does not need an estimate of the population size ...
There is a leaderless, uniform population protocol solving the exact size counting problem with probability 1. ...
doi:10.4230/lipics.disc.2018.46
dblp:conf/wdag/DotyEMST18
fatcat:batrpixdmnechcppailth5dxu4
On Counting the Population Size
2019
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing - PODC '19
We consider the problem of counting the population size in the population model. ...
We present two population protocols to count the size of the population: protocol Approximate, which computes with high probability either log n or log n , and protocol CountExact, which computes the exact ...
Brief Announcement: Exact Size Counting in Uniform Population Protocols in Nearly Logarithmic Time. ...
doi:10.1145/3293611.3331631
dblp:conf/podc/BerenbrinkKR19
fatcat:t7gpdu6vbrdwlmbh4y7vq7r4va
Towards the european strategy for particle physics: The briefing book
2007
European Physical Journal C: Particles and Fields
This document was prepared as part of the briefing material for the Workshop of the CERN Council Strategy Group, held in DESY Zeuthen from 2nd to 6th May 2006. ...
Orsay from 30th January to 2nd February 2006, reflecting the various opinions of the European community as recorded in written submissions to the Strategy Group and in the discussions at the Symposium ...
The research support from the EC 6 th Framework has a certain influence on EPP in Europe through the Marie-Curie Programme and through support for technical R&D and industrialization for accelerators ( ...
doi:10.1140/epjc/s10052-007-0318-3
fatcat:u54ydvn4s5dvfgrrowi7a4huby
Alterations in MicroRNA gene expression profile in liver transplant patients with hepatocellular carcinoma
2021
BMC Gastroenterology
SYBR Green Real-time PCR protocols on 30 other tissue samples composed of 10 rejected and 20 non-rejected ones for the selected miRNAs. ...
Therefore, in the present study, alterations in miRNAs as biomarkers were detected in LT patients with HCC. ...
Argasi at the Research Consultation Center (RCC) of Shiraz University of Medical Sciences for his invaluable assistance in editing this manuscript. ...
doi:10.1186/s12876-020-01596-2
pmid:34118888
pmcid:PMC8199419
fatcat:3tbpyidycfgillu4yet6neiske
Centric Allometry: Studying Growth Using Landmark Data
2021
Evolutionary biology
This paper adapts two variants of standard morphometric least-squares, principal components and uniform strains, to circumvent size standardization while still accommodating an analytic toolkit for studies ...
Standardization of position and orientation but not size yields the coordinates Franz Boas first discussed in 1905. ...
(The name "Boas coordinates" was, in fact, Joe's idea.) ...
doi:10.1007/s11692-020-09530-w
fatcat:uezgm6lj3ncwvejpkynuovx2sa
A Comprehensive Survey on Local Differential Privacy
2020
Security and Communication Networks
With the advent of the era of big data, privacy issues have been becoming a hot topic in public. ...
In this paper, we present a comprehensive survey of LDP. We first give an overview on the fundamental knowledge of LDP and its frameworks. ...
When the size of the possible domain is small, this can be solved with an FO protocol. ...
doi:10.1155/2020/8829523
fatcat:xjk3vgyambb5xioc2q5hyr2hua
A methodology for studying persistency aspects of internet flows
2005
Computer communication review
The research of the authors is supported in part by EPSRC grant GR/S86266/01. ...
Acknowledgments We would like to thank AT&T Labs Research for providing access to Netflow data and Leibnitz Rechenzentrum, München for their help in collecting packet traces. ...
terms of round-trip times, application layer protocols, transfer sizes, etc. ...
doi:10.1145/1064413.1064417
fatcat:b5leqpkvmnd5paw2vws4mqhlme
Analytic Hierarchy Process aided Key Management Schemes Evaluation in Wireless Sensor Network
2012
Journal of Networks
A discrete time fluid model is created to study the impact of retransmission mechanism on SIP (Session Initiation Protocol) overload. ...
BDFT is intended for high-speed routers where CPU time is crucial. BDFT is time and space efficient thanks to the use of counting Bloom filters as the data structure that represents the bins. ...
The number of flows normally decreases logarithmically with the duration, so longer duration bins should cover more time and be reduced in size. ...
doi:10.4304/jnw.7.1.88-100
fatcat:7atjgdr7hngvfjvvfibte6d3pm
Wireless Sensor Network Security
2013
International Journal of Distributed Sensor Networks
The information in this document reflects only the author's views, is provided as is and no guarantee or warranty is given that the information is fit for any particular purpose. ...
Acknowledgements We wish to thank Alexander Becher and Maximillian Dornseif for many helpful discussions and the delightful previous cooperation in breaking sensors [6] which formed the basis of Section ...
The exact amount of time required for the attacks proposed above remains to be determined. ...
doi:10.1155/2013/362385
fatcat:2ph46uukonbtbdkc5q6t4mvgcq
The Algorithmic Foundations of Differential Privacy
2013
Foundations and Trends® in Theoretical Computer Science
This book was used in a course taught by Salil Vadhan and Jon Ullman, whose students also provided careful feedback. ...
Obtaining exact truthfulness So far we have discussed mechanisms that are asymptotically truthful in large population games. ...
In this section, we give a brief survey of some of these ideas. ...
doi:10.1561/0400000042
fatcat:jk3mb6ltcfeqzeyvpyznpohuja
Internet Telephony
[chapter]
2004
The Practical Handbook of Internet Computing
In 1999, nearly 93% of the population of the United States can call for help with 911, with 95% offering enhanced 911 services. ...
Time code: Timing code laid down on videotape to give each frame a unique number so as to ensure exact transitions during editing. ...
PANS Progressive scan: All lines in a frame are scanned consecutively. Typically used for computer displays, as it gives better quality for (moving) text.
PSTN: Public Switched Telephone Network. ...
doi:10.1201/9780203507223.ch6
fatcat:3ljkkei7j5d3lhqedymkwcvpwu
Large Deviations of Convex Hulls of Random Walks and Other Stochastic Models
2019
Zenodo
While all those problems have in common that they were up to now mainly studied in regards to the mean values of some observable, in this thesis the full distribution including very rare events with probabilities ...
of the single energy levels in the system. ...
Except for data previously published in References [31, 37] (distribution of the size of the single connected components and 2-core for Erdős-Rényi graph) all data was generated by simulation code written ...
doi:10.5281/zenodo.3377932
fatcat:pbej6euvmjdtjkantta66er77u
A Large-scale Empirical Analysis of Browser Fingerprints Properties for Web Authentication
[article]
2020
arXiv
pre-print
These properties include their distinctiveness, their stability through time, their collection time, their size, and the accuracy of a simple verification mechanism. ...
In this paper, we investigate the adequacy of browser fingerprints for web authentication. ...
Ent.), their sameness rate (% Same), their median size (Size), and their median collection time (Time).
E.2 Attributes list E.2.1 Attributes nomenclature. ...
arXiv:2006.09511v1
fatcat:z24bm7lbzbhprbd2gutuxyh4su
From Zero to Hero: How Zero-Rating Became a Debate about Human Rights
2016
IEEE Internet Computing
This set of /32s illustrates We don't plot the top two /32 prefixes (listed in Table 2 ), because nearly every /48 is represented, resulting in interface counts that are an order of magnitude higher ...
protocol in 1996. ...
Most Prestigious contributors in the teaching and R&D computing communities. ...
doi:10.1109/mic.2016.88
fatcat:imrhaaoac5gifool7wjegaxl5q
ACKNOWLEDGMENTS/REMERCIEMENTS
[chapter]
1988
Thematic Mapping from Satellite Imagery
Acknowledgments, Remerciements, Ringraziamenti
fLEDBAT vs fLEDBAT We now consider the intra-protocol scenario in which two fLEDBAT flows share the bottleneck. ...
We set the start time of latecomer flow to t = 10 s, which was shown in [155] to represent a worst case scenario for the fairness index. ...
, network setting, user population and years. ...
doi:10.1016/b978-1-85166-217-3.50005-9
fatcat:juz2oqrslzfvrjxqdvg7wsslba
« Previous
Showing results 1 — 15 out of 606 results